Author: Robert Hyatt
Date: 13:35:59 08/28/99
Go up one level in this thread
On August 28, 1999 at 03:06:09, KarinsDad wrote: >Well, it's late and I'm not sure how well I did the math or even if this makes >sense. But, let me know what you think. > >KarinsDad :) OK...now I sort of follow... you are actually 'building' a tree, much like is done in 'breadth-first' or 'best-first' type searches.... Rather than doing a traditional alpha/beta search and randomly probe the hash table... you are actually walking around the 'hash table' (which really doesn't sound like a hash table to me) because it contains the tree you are searching???
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.