Author: Vincent Diepeveen
Date: 10:10:33 01/01/02
Go up one level in this thread
On December 31, 2001 at 21:32:24, J. Wesley Cleveland wrote: >On December 31, 2001 at 05:28:54, Dann Corbit wrote: > >>On December 31, 2001 at 05:26:11, Michel Langeveld wrote: >>>I want to check how efficient Nullmover is. >> >>By how often you fail high on your first choice. > >Note that this is somewhat deceptive, e.g. crafty gets about 90% failhighs >first, but often visits twice as many nodes as the minimum. A more accurate way >is to compare the total number of nodes visited to the minimun. The recursive >algorithm to count this is relatively straightforward: > >if (failhigh node) > minimum_nodes = minimum_nodes(fail_high move) + 1 >else > minimum nodes = sum for all legal moves(1 + minimum_nodes(move)) Problem to determine minimum is nullmove reduction factor. It completely depends upon how you extend crazy tactical moves because after tactical move your nullmove will nearly always fail.
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.