Author: José Carlos
Date: 03:04:55 06/21/02
Go up one level in this thread
On June 21, 2002 at 05:52:11, Gian-Carlo Pascutto wrote: >On June 21, 2002 at 05:47:38, Daniel Clausen wrote: > >>When Crafty (and other engines) don't have a a move from the HT and want to >>search N plies, they first make a search of N-2 (or something similar) and try >>to get a move this way. Of course the search for N-2 plies will again don't have >>a HT-move, because it's the same position. So this search will try a N-4 search >>first, and so on.. internal iterative deepening :) >> >>[Please someone correct me if I'm wrong here :)] > >Hmm, wouldn't what you descibe degenerate into nothing? > >-- >GCP Not really. At some point, you search with depth<2, so you do a normal search. Then you get a best move, which you return to the caller, who then uses it as first move of a normal search... then you get back to the starting point, having a best move to try first. José C.
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.