Author: Gian-Carlo Pascutto
Date: 02:37:11 09/24/01
Go up one level in this thread
On September 23, 2001 at 13:24:56, José Carlos wrote: > Of course, there're zillions of ways to handle this smartly. I handle this by searching on after a mate is found until the nominal search depth = found mate depth. This way (except for nullmove madness) we are sure there can be no shorter mate and we can still stop the search early. I personally think that, even though it may not increase the actual strength of the engine, this is important. One common example is programs seeing tablebase mates and then giving away pieces for a mate in 50 while there is a mate in 6. Either way the program wins, but I hate it if the latter happens. -- GCP
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.