Author: Ralf Elvsén
Date: 06:50:56 10/17/99
Dave Gomboc posted here a while ago about the number of nodes searched with "random move ordering". The number would go something like w^(2d/3). I am interested in the assumptions made to derive this result, in particular what we can assume about the values at the leafs. I assume it is a calculation and not a numerical experiment behind this formula. Thanks in advance Ralf
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.