Author: Carsten Kossendey
Date: 14:33:15 01/20/98
Go up one level in this thread
On January 20, 1998 at 17:13:06, Bruce Moreland wrote: >I think that I should admit that I didn't understand your original post >and I don't understand the source code you provided later. I don't know >why "quiescence" is a void function and I don't know what use it is to >probe the hash table after calling it. I think what Stuart wanted to express is that, contrary to deciding whether to call Search() or Quiesce() for each move [like Crafty does for example], he simply calls Search() for all moves, and if it is a q-node he uses the result of Quiesce(), otherwise continues as usual ... Now of course one could argue whether there is any sense in probing the hash table for the top-level q-nodes or not. I personally prefer to not hash inside the q-search at all. >But if it works, by all means keep doing it. > >bruce
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.