Author: Graham Laight
Date: 04:24:35 05/09/01
Go up one level in this thread
Just a thought - I don't know whether it's going to be useful or not. Suppose you switch off the opening books, and play the opening to the middlegame from the engine. What I would like to know is whether there is a correlation between the depth of search and the proportion of node positions which have already been seen. Would the hash hit statistics be able to show this? If this can be discovered, I suspect that we're going to find that the deeper we search, the higher the proportion of nodes we generate will have already been seen. In terms of estimating the size of chess, what would be REALLY interesting would be to see the shape of the following graph: proportion of repeated positions plotted against depth of search. If the graph turns out to be a straight line (a normal correlation), then chess is smaller than we all think. If the graph turns out to be logarithmic, then chess is very big, and it's going to be difficult to solve. Does anyone out there know what the shape of the graph of hash hits against search depth is? -g
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.