Author: Andrew Williams
Date: 04:50:05 03/24/00
Go up one level in this thread
On March 24, 2000 at 07:18:44, leonid wrote: >On March 23, 2000 at 13:08:51, John Coffey wrote: > >>Does interative deepening insure that a program will pick the fastest >>improvement? I.e. if a program can improve its position by .1 pawn in 3 moves, >>how do I know that it won't choose a .1 improvement in 5 moves instead? >> >>John Coffey > >What is the interactive deepening? > >Thanks, >Leonid. I think he means "iterative deepening". Instead of starting out by trying to search a position to depth 6, you do a depth 1 search then a depth 2 search then depth 3 etc. This has two advantages: (a) It is quicker. (b) It gives you something sensible to play if you run out of time. Andrew
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.