Author: Dan Andersson
Date: 18:13:31 01/30/02
Go up one level in this thread
The short version: You construct a table containing the positions required to guarantee you to find the value of any position in a n ply search. Where the table gets smaller as n gets larger. There are several obstacles with it. The extra depth of search is one. And how and when to probe the table efficiently are others. Finding the optimum positions is a fourth problem. 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.