Author: scott farrell
Date: 04:49:15 11/09/03
Go up one level in this thread
On November 06, 2003 at 00:56:09, margolies,marc wrote: It all depends in the accuracy you are after. It will be accurate after only a few hundred nodes, unless there are come specific tactical moves. Most modern engines find simple tactics in a few thousand nodes. In a million nodes most obvious tactics are overcome. If an engine cant see a tactic in 10 mill nodes, it is unlikely to find it. If you are analysing full games, use a small number of nodes, and if the score jumps, keep the hashtable and go back and redo a few nodes deeper to see the earliest point you can pick up the tactic. Scott >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.