Author: Brian Richardson
Date: 18:40:50 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 I do use hashing in the q-search in Tinker since it seems to help. However, different programs behave differently.
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.