Author: Ernst A. Heinz
Date: 14:27:26 12/31/99
Go up one level in this thread
On December 31, 1999 at 11:53:04, Vincent Diepeveen wrote: > >> [...] > >Indeed. The more efficient your search is (so the smaller your fliprate >which i defined as the chance that a node which was stored as < beta >in transpositiontable now becomes >= beta), the less likely such >dubious things as futitily pruning will work for you. Well Vincent, Futility pruning might always remain dubious to you but it actually is a *** theoretically sound *** pruning scheme if you choose your futility margins large enough (>= max_posn_score). =Ernst= P.S. "Scalable Search in Computer Chess" now available at MKP online http://www.mkp.com/books_catalog/3-52805-732-7.asp :-) 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.