Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How to store quiescence search results in transposition tables?

Author: Brian Richardson

Date: 15:25:42 09/08/00

Go up one level in this thread


Tinker does hash q-search nodes and I have found it to be faster.  However, each
program is different.  Tinker only uses MVV/LVA move ordering and does not have
SEE.  I use depth == 0, but have not experimented with negative drafts.
Brian



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.