TalkChess.com

Exacto wrote:Hello,

Thanks to a few people on here for testing out Exacto 0.e. While it shares the same name as my last program, Exacto 0.d, this new version is really a brand new version. Is there anything I need to do to get the new version onto the CCRL?

Anyway, here's the website. It contains a list of the features:

http://math.berkeley.edu/~sparks/exacto/

The source code is included and covered under a BSD type license (but use it at your own risk - I am neither a chess player nor a programmer). The engine is meant to use with WinBoard/XBoard/Arena.

Best,
Dan

Exacto wrote:Is there anything I need to do to get the new version onto the CCRL?

Exacto wrote:Hello,

Thanks to a few people on here for testing out Exacto 0.e. While it shares the same name as my last program, Exacto 0.d, this new version is really a brand new version. Is there anything I need to do to get the new version onto the CCRL?

Anyway, here's the website. It contains a list of the features:

http://math.berkeley.edu/~sparks/exacto/

The source code is included and covered under a BSD type license (but use it at your own risk - I am neither a chess player nor a programmer). The engine is meant to use with WinBoard/XBoard/Arena.

Best,
Dan

Exacto wrote:Hello,

Thanks to a few people on here for testing out Exacto 0.e. While it shares the same name as my last program, Exacto 0.d, this new version is really a brand new version. Is there anything I need to do to get the new version onto the CCRL?

Anyway, here's the website. It contains a list of the features:

http://math.berkeley.edu/~sparks/exacto/

The source code is included and covered under a BSD type license (but use it at your own risk - I am neither a chess player nor a programmer). The engine is meant to use with WinBoard/XBoard/Arena.

Best,
Dan

Gerd Isenberg wrote:Hi Dan,

you may easily quarter your plain magic tables sizes, i.e. 2MB instead of 8MB for rooks, if you allow constructive index collisions, where redundant outer one-bits of the occupancy may share the same attack set and entry.

Gerd

    if(rook_moves[square][quickhash(x, magic, bits)] == all_set){
        // A new hash entry
        rook_moves[square][quickhash(x, magic, bits)] = y;
    } else if(rook_moves[square][quickhash(x, magic, bits)] != y) {
        // A bad collision

Exacto wrote: - As far as my magics - good eye catching that. Yes, I allow constructive collisions. But, for whatever reason, my code wasn't able to generate magics for smaller tables. It would just sit their looping seemingly indefinitely (20-30 minutes, until I closed it and decided to just use 14/11 bit magics).

uint64 random_uint64() {
  uint64 u1, u2, u3, u4;
  u1 = (uint64)(random()) & 0xFFFF; u2 = (uint64)(random()) & 0xFFFF;
  u3 = (uint64)(random()) & 0xFFFF; u4 = (uint64)(random()) & 0xFFFF;
  return u1 | (u2 << 16) | (u3 << 32) | (u4 << 48);
}

uint64 random_uint64_fewbits() {
  return random_uint64() & random_uint64() & random_uint64();
}