Search found 692 matches

by rbarreira
Sat Jun 19, 2010 5:59 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Killer moves with null move pruning
Replies: 5
Views: 1767

Killer moves with null move pruning

Hi, I was thinking of implementing the killer heuristic, but I thought of a potential problem which may affect the implementation. To store the killer moves, usually people talk about an array indexed by search depth. But when doing null-move searches, a given depth may belong to the opposite player...
by rbarreira
Sat Jun 19, 2010 5:34 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Collision Detection in Transposition Table
Replies: 7
Views: 1965

Re: Collision Detection in Transposition Table

Hi We know 64 bit zobrist key is considered large enough to avoid collisions, and 32 apparently is not. I'm considering using a 54 bit zobrist key so I can make my TT 2^22 elements (instead of 2^21), each one being one java long(64 bits) (instead of 2 java longs). I believe I can get it down to 54 ...