Author: Jesper Antonsson
Date: 07:59:09 04/06/03
Go up one level in this thread
We should get the minimal tree if we search with perfect move ordering, so it's only a matter of searching and building a database of best moves in the tree and then researching (again and again, refining the database) using that database for move ordering until the shape of the tree doesn't change. If you do the refinement carefully, throwing away unnessecary information as you go along, this method should be entirely feasible. I conjecture that it is as feasible to determine the minimal tree (for large trees) by formula as it is to find the best move by formula. I.e. not feasible at all.
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.