Author: Robert Hyatt
Date: 09:07:13 03/01/04
Go up one level in this thread
On March 01, 2004 at 04:34:06, milix wrote: >Hello >I had read many posts about check extensions but still have some questions. >Assuming the case that incheck() situations always extendend with 1 ply (no >tricks): > >1. When incheck() and only one legal move do we extend again (meaning we extend >with two-plies)? I do, yes. I extend a check when I give the check, and extend the one-reply idea when getting out of check at the next ply. > >2. In the new extended search if we find a checking move, do we extend (the >already extended search) again? You have to be careful if you can allow more than 1 ply of extensions per ply, as that can produce a non-terminating search. > >3. When (and how) do we determine if a move is already extended; is this >relevant to (2)? Note all extensions, then just before calling search recursively, apply some sort of limit.. > >4. Do we have to disable extensions when in Internal Iterative Deepening? No. > >TIA
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.