Author: Rafael Andrist
Date: 09:37:27 01/01/02
Go up one level in this thread
On January 01, 2002 at 12:08:11, Alvaro Jose Povoa Cardoso wrote: >Is there any sense in having two hash moves instead of one? >Since the hash move (if we have one) is the best candidate for a fail high we >put it at the first position. So, since hash moves are very good why not have >more of them? > >When updating the current best move for the current ply we do: > >if Score>Alpha then > Score = Alpha > BestMove2=BestMove1 > BestMove1=CurrentMove >end if > >We should then pass BestMove1 and BestMove2 to HashStore(). >I've not tested it though. > >Any comments? If I disable storing the best move in hash, my program searches 5% more nodes. I guess storing a second move in the hash table wouldn't help much - at least not for me. And don't forget that you need more space for a hash table with the same number of entries. regards Rafael B. Andrist
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.