Author: Amir Ban
Date: 07:19:45 12/01/99
Go up one level in this thread
On November 30, 1999 at 22:03:45, Robert Hyatt wrote: >On November 30, 1999 at 18:26:27, Inmann Werner wrote: > >>Since some time, I do the following. >> >>when I am in the loop in alpha-beta, trying all moves of a position and find a >>new bestmove I do not stuff it in the hashtable (what others normally do?). I >>look at all moves till all searched or a cutoff occurs. Then I stuff only the >>cutoff or best move in the hash. >> >>Difference is, that i only stuff in hash one time and i do not have a "best move >>so far" in the hashtable. >>In my prog it works some better then the "normal" method. >> >>Has anyone tried this also? >>Did I miss something in my idea? (don´t think so, cause it works well..) >> >>Werner > > > >you are describing what I consider the 'normal'method... I haven't seen >anybody store each new best move... just store right before you return from >the current instantiation of Search()... > > >you There's no real benefit to storing intermediate moves. The only way this intermediate entry will be hit is if this position is generated again within the subtree. That means there's a repetition in the line and it should be evaluated to a draw regardless of the hash entry content. Amir
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.