Author: Dan Andersson
Date: 13:00:32 04/07/03
Go up one level in this thread
That would give you a local maximum. To get the minimal tree you would have to search with *every* possible move order and backtrack when it overflows. If you then add transpositions the problem gets worse since you would have to reset the hash when you backtrack. And the hashing scheme would influence the size of the search. 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.