Author: Gian-Carlo Pascutto
Date: 07:56:56 01/01/00
Go up one level in this thread
On December 31, 1999 at 11:53:04, Vincent Diepeveen wrote: [...] >>b) I understand that just storing the values into the transposition table is >>deadly (e.g. having to research after a fail-low would yield garbage), and >>this is mentioned in the paper, but how should this optimally be handled then? >>Just not storing anything in the ttable seems rather radical. > >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. I must admit I can't immediately see the link between the two ? But yes, my fliprate (never heard this before, but sounds like something interesting to measure nonetheless) is probably quite high and that's not due to my search but rather caused by the nature of the game I'm working with. -- GCP
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.