Author: Dan Newman
Date: 19:50:56 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've tried it once or twice, but it seems to slow my program down a bit. I've got it ifdef'ed so that I can try it out every now and then. I think the slowdown is due to the memory bandwidth bottleneck since the qsearch probes the hash table at a much higher rate than the full-width search. -Dan.
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.