Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: DT and DB (prototype) vs Computers

Author: Ernst A. Heinz

Date: 10:59:26 01/25/00

Go up one level in this thread


Hi Eugene,

>Maybe problem was because Crafty doesn't generate checks in the Q-search?

No, checks in the quiescence search have nothing to do with the
principle of normal futility pruning. "DarkThought" does not do
checks in the quiescence either.

I really suspect that Bob did actually not perform normal futility
pruning at frontier nodes but some kind of razoring instead. This
indeed does not seem to work very well according to the combined
practical experiences of several people (mine included).

=Ernst=

P.S.
Among other things, my new book "Scalable Search in Computer Chess"
handles the topic of futility pruning and its various flavours in a
concise way. The book is now available at Amazon.de and MKP online.

http://www.amazon.de/exec/obidos/ASIN/3528057327/
http://www.mkp.com/books_catalog/3-52805-732-7.asp

Please visit http://supertech.lcs.mit.edu/~heinz/node1.html for more
information about the book.



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.