Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Branche factor

Author: Dominic Marcello

Date: 03:40:11 11/23/99

Go up one level in this thread


>Why?
>
>I have to check if the hash move is correct.
>Now I can look in my generated moves and this cost only 0.15 seconds.
>
>Otherwise I must write seperate code to check if the
>hash move is legal.
>
>

   Think about it.. the hash move is always legal. The entry you look up is for
the position you're in at the moment, so since they are the same position, they
have the same set of legal moves.
   Furthermore, if the hash move does not cause a cutoff and you generate the
rest of the moves, it's OK if the hash move is replayed because all that will
happen is that at the next ply the position will be in the hash table already
since it was already searched (assuming you're hash table is large enough)
   To save even more time, you can generate just the winning captures after if
the hash move does not cut-off, and then just non-captures if the winning
captures do not cause cut-off, and then just losing captures.



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.