Author: Tony Werten
Date: 00:57:50 11/13/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 It depends on what your program does in QSearch. If you do checks and inchecks detections it's more likely to work because you can save a lot more work. Another thing is the speed of your program. If you have a very big eval ( and therefor a slower program ) you can probabely afford to hash. If, on the other hand, you search 1Mn/s you probabely can't afford it, unless you have a few GB. cheers, Tony
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.