Author: margolies,marc
Date: 21:56:09 11/05/03
When examining a position deeply with an engine, say for the purposes of placing the evaluation of the position within a tree of candidate variations, how many millions of nodes of testing are necessary in order to get the closest approximation to that engines best numerical assessment of a chess position and its roughly corresponding possible variation move sequence? Is there a numerical methods heuristic, or some other rule of thumb which I might chose to use to attack the certainty issue? Maybe a statistical regression? Should it be engine specific (and correlative to the kinds of positions under assessment) or generic? I welcome any suggestions here. Thanks-Marc
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.