Full access to the folder with chess engines - about 3000 files!

If you do not want to wait a long time for download - donate a minimum of 10$, enter your email - you will gain full access to the folder with chess engines. Bonus on donate of 15$ - acces to the folder with games, tables, engines pack. My email: jotes@go2.pl


Or transfer bank:
IBAN: PL 58 2490 0005 0000 4000 2134 5302 SWIFT code of the bank: ALBPPLPW Name of bank: Alior Bank
Bank address: Lupuszanska 38D, 02-232 Warsaw Bank Country: Poland Postscript: donation - chess engines (and email)
List of donors

Monday, December 18, 2017

Stockfish 17121816_VandeVondele - new version!

Stockfish, chess engine UCI

Rating JCER = 3389
🔬 Author: Joost VandeVondele 

Timestamp: 1513611141 

Allow for general transposition table sizes. (#1341) 

For efficiency reasons current master only allows for transposition table sizes that are N = 2^k in size, the index computation can be done efficiently as (hash % N) can be written instead as (hash & 2^k - 1). On a typical computer (with 4, 8... etc Gb of RAM), this implies roughly half the RAM is left unused in analysis. 

Recently a neat trick was proposed to map a hash into the range [0,N[ more efficiently than (hash % N) for general N, nearly as efficiently as (hash % 2^k): 

namely computing (hash * N / 2^32) for 32 bit hashes. This patch implements this trick and now allows for general hash sizes. Note that for N = 2^k this just amounts to using a different subset of bits from the hash. Master will use the lower k bits, this trick will use the upper k bits (of the 32 bit hash). 

LLR: 2.96 (-2.94,2.94) [-3.00,1.00] 
Total: 128498 W: 23332 L: 23395 D: 81771 

There are two (smaller) caveats: 

1) the patch is implemented for a 32 bit hash (so that a 64 bit multiply can be used), this effectively limits the number of clusters that can be used to 2^32 or to 128Gb of transpostion table. That's a change in the maximum allowed TT size, which could bother those using 256Gb or more regularly. 

2) Already in master, an excluded move is hashed into the position key in rather simple way, essentially only affecting the lower 16 bits of the key. This is OK in master, since bits 0-15 end up in the index, but not in the new scheme, which picks the higher bits. This is 'fixed' by shifting the excluded move a few bits up. Eventually a better hashing scheme seems wise. 

Despite these two caveats, I think this is a nice improvement in usability. 

Bench: 5346341

⭐⭐⭐   Stockfish 17121816_VandeVondele - download


No comments:

Post a Comment