Author: David Rasmussen
Date: 02:31:02 01/16/03
Go up one level in this thread
On January 16, 2003 at 00:09:04, Nathan Thom wrote: > >I dont understand how using hash tables for pruning would not speed the search? > I don't understand that either. A correctly implemented and used hash table will certainly help here. But there are many things to get right. In middlegame positions I get about 30% hits, so that is saving a lot node wise. Of course, you might have so many related problems (because of bad implementation and/or use) that even though you get 30% hits, your program doesn't play better, or maybe it even plays worse. But if that is the case, there is room for improvement. Hash tables can be made to work. /David
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.