Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Fast check detection in bitboard engine

Author: Robert Hyatt

Date: 06:08:50 12/11/03

Go up one level in this thread


On December 11, 2003 at 04:43:32, Andreas Guettinger wrote:

>On December 10, 2003 at 22:42:05, Robert Hyatt wrote:
>
>
>>>Could you point me to where is this going on? I can't seem to find it when
>>>looking over the move generation functions or the search function.
>>
>>
>>Hmmm.  Neither can I.  I don't remember where/when I stopped doing that.
>
>Maybe at the time you realized it's faster to make an incheck() test than
>updating the extension counters, initailizing the next search and generating all
>the moves for the next ply?

Actually, I looked back at all my old notes.  It had to do with null-move
search.  It was possible for a null-move to fail high even after making
a move at the previous ply that was illegal, and that caused problems.  I
don't remember exactly what was happening, but apparently it was enough for
me to start "checking".




>


>:-)
>
>regards
>Andy



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.