Author: Dezhi Zhao
Date: 04:14:27 12/22/98
Go up one level in this thread
On December 22, 1998 at 01:14:12, Sylvain Lacombe wrote: > >>I agree; there are usually a lot of forced mates in a given position, and the >>first one found is usually NOT the fastest. >> >>James > >Well, if iterative deepening is implemented, it will find the fastest mate. If a >mate his found at deep 4, their his no reason to continue the search cause there >is nothing better than mate. But you need a condition for it to stop. > >The only thing i can think of for not implementing the PV play is the extra code >it takes. > >Sylvain. The things are a little complicated than that , because of extensions and null moves. You may find a mate in 6 at depth = 4. But if you continue the search, you got a mate in 5 at depth = 5. Dezhi Zhao
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.