Author: Dan Andersson
Date: 20:24:03 07/28/04
Go up one level in this thread
A perfect move order is only one part of making a tree search consume less nodes. The other one is to find the move that leads to less work. This paper shows how the possible transpositions in the search graph makes for a much smaller 'real minimal graph' that defines the value of Alpha-Beta search: Exploiting Graph Properties of Game Trees, Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin http://www.cs.vu.nl/~aske/Papers/abstr-aaai.html Page four shows how ETC helps in transposing the search graph. Thus shrinking the tree. 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.