Author: Daniel Clausen
Date: 07:12:44 11/26/99
Go up one level in this thread
Hi On November 26, 1999 at 08:43:38, Paul Clarke wrote: > ><delurk> > >I think Chinook (the draughts/checkers program) uses a similar idea. After, for >example, an 11-ply search, it plays the first four ply of the PV and then does >a 9-ply search of the resulting position. If this shows the score dropping >substantially, Chinook will allocate more time and try to search more deeply. I think this is a very clever idea. And implemented in this way it's surely different from a "normal" selective search. The big difference is, that if the 2nd search sees that the score is dropping, this is just a hint for the main search, to search more deeply. Whereas in the "normal" selective search, the nodes from the leaves are backuped up in a standard minimax way, and this can lead to a completely wrong score for the root-nodes, when it skips important lines. I will definitely give this idea a try in my engine. Kind regards, -sargon
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.