Author: Dan Andersson
Date: 09:52:05 05/28/00
Go up one level in this thread
If you generate all legal moves, then you should consider using ETC (Enhanced Transposition Cutoff) by doing a hash table lookup at all positions resulting. That will give a much smaller tree (DAG really!) by improving the AB bounds. As long as you dont do the ETC close to the leaves of the tree. For reference, Aske Plaat, Jonathan Schaeffer, Wim Pijls, and Arie de Bruin: Best-First Fixed-Depth Minimax Algorithms. http://www.cs.vu.nl/~aske/minimax.html
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.