Author: Alvaro Jose Povoa Cardoso
Date: 08:58:28 08/15/01
My program (checkers) does hashing in all but the root and quiescence search. This is quite standard I think. So I decided to changed that to only store in hash, nodes that are 2 plies above quiescence while keeping hash probing in all nodes as before (except root and quiescence). I got some tree size increase, but in spite of this I got a pretty good time reduction. Since it is faster now, I decided to keep it. It seems my hashing is slowing things down considerably. I would like to ask if anybody has tried this in chess and what results did get. Thank you, Alvaro Cardoso
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.