Computer Chess Club Archives


Search

Terms

Messages

Subject: draw implementation in search for pulsar issues

Author: Mike Adams

Date: 18:24:40 09/23/00


I'm interested in implementing draw recognition in search for pulsar. It doesnt
get many draws but often times it probably misses the draw when its in trouble
or gives the draw when it should not. Right now it will recognize a draw at the
root which probably helps in many cases.  I think to implement draw recognition
in search it would be best to use hashing.  Two questions about this. How do you
ensure that all the postions pulsar played are in the hash table. Do you have a
seperate hash table for draw recognition?.
    The second is about how i do hashing.  Right now i just use it for move
ordeing and have not done a very through job. the hash number is made up of only
piece placement and side to move.  castling and enpassant considerations are not
considered. I'm guessing i need 4 values to put in for castling and 8 values for
enpassant. Is this correct? En passant seems trickiest because it is only a
consideration for one move.



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.