Author: Robert Hyatt
Date: 18:47:01 08/09/00
Go up one level in this thread
On August 09, 2000 at 14:10:29, J. Wesley Cleveland wrote: >On August 09, 2000 at 12:10:15, Robert Hyatt wrote: > >[snip] >>mtd(f) with no hashing really does suck. > >Does this also imply that if the number of nodes searched is much larger than >the size of the hash table, mtd(f)'s performance is worse than other alpha-beta >searches ? Yes. You _really_ need the hash table, otherwise all those re-searches will blow the tree size out of the water.
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.