Author: Tom Kerrigan
Date: 10:37:02 03/23/00
Go up one level in this thread
On March 23, 2000 at 13:18:52, Andrew Dados 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 > > Any brute-force search (including alpha-beta) guarantees it by definition :) I don't think so. The brute force searches that people do in computer chess rely on evaluation functions that do not distinguish between depths. -Tom
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.