Author: John Coffey
Date: 10:08:51 03/23/00
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
This page took 0.01 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.