Author: Dan Andersson
Date: 15:57:25 01/04/06
Go up one level in this thread
Mini-max is the base search variation. It is trivially true that move selection by mini-max can change by going deeper. In random trees a constrained mini-max search can certainly be degenerate. Considering the heuristic nature of chess evaluations there is a non zero probability that you will search a degenerate tree. This will be exceedingly rare in practice. Mainly due to the fact that positions in chess tree search are not independent. But also due to search enhancements such as extensions and quiescence search. There exists classes of games that are intrinsicality degenerate. MvH Dan Andersson
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.