Author: David Rasmussen
Date: 02:59:05 12/07/00
Go up one level in this thread
>So let's do a 1 ply search from this position: > >1. e4 e5 2. Bc4 d6 3. Qf3 Nc6 >[D]r1bqkbnr/ppp2ppp/2np4/4p3/2B1P3/5Q2/PPPP1PPP/RNB1K1NR w KQkq - 2 4 > >Eventually program will try move Qxf7#... but will it see the checkmate at 1 >ply? > >SearchRoot() >1. extend if required (we don't extend, because we are at the root). >2. iterate through moves >3. make move Qxf7# >4. depth now 0, so go into Quiesce(). >Quiesce() >5. Do you detect checkmates in Quiesce()?? > >It doesn't just work with checkmates, but with any extension at the lowest level >of search. > >Is this any clearer at all? :-)) > >Cheers, Tim. It finds the checkmate at ply 1. I understand what you mean, but I'm afraid you misunderstand what my search function looks like. The extensions are determined BEFORE I check whether depth<=0 and go to quiescence.
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.