Author: Robert Hyatt
Date: 10:24:00 08/27/99
Go up one level in this thread
On August 27, 1999 at 11:47:16, KarinsDad wrote: >On August 26, 1999 at 10:28:59, Robert Hyatt wrote: > >>On August 26, 1999 at 03:23:43, Inmann Werner wrote: >> >>>Hello >>> >>>When I began to implement hashing, I tried to use all "tricks" to avoid draws >>>by repetition going into the hash tables, because I thought, this would be very >>>bad. >>>Yesterday I disabled this code and let also the draw by repetition evals into >>>the hash tables, and surprisingly, the program worked better (at the complete >>>LCTII Test) >>> >>>Do you also let "draw by repetition evals" into your hash tables? >>> >>>Werner >> >> >>There is one serious error associated with hashing: lack of path information. > >I don't have that problem. I have a list of parents in each hash node. However, >this has the detriment of forcing me to back scores up all parent paths and the >detriment of increasing the size of a hash node. You want to hear the music, you >have to pay the piper. > >KarinsDad :) I'm not sure what you mean by "a list of parents" unless you mean "parent positions". Which means you miss a lot of transpositions... IE there are lots of ways to reach the same position without having the same position at the previous move... Did I misunderstand?
This page took 0.01 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.