Author: Jay Scott
Date: 13:02:02 09/11/02
Go up one level in this thread
On September 11, 2002 at 11:41:13, Robert Hyatt wrote: >it also takes a huge amount of memory since best-first >has to store the whole tree as it is traversed. That is not strictly true, since the fringes of the tree are (or can be) searched serially by single processors. The bulk of nodes do not need to be stored. Certainly the traditional hash table, which pretty much can store all nodes if there's enough memory and degrades gracefully if there's not, has the best tradeoffs. Jay
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.