Author: Robert Hyatt
Date: 19:46:10 11/12/00
Go up one level in this thread
On November 12, 2000 at 21:36:27, Pham Minh Tri wrote: >Hi, > >I am wondering why we do not use the hash table for quiescence search? >Thanks in advance for any explaination. > >Pham Some do. Some don't. I found that the time used to probe/store was about the same as the time required to search the extra tree space if I didn't hash. Not hashing has the advantage of not requiring huge hash tables to avoid overrunning them badly.
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.