Author: Dann Corbit
Date: 15:03:03 03/29/04
Go up one level in this thread
On March 29, 2004 at 17:51:08, Dan Andersson wrote: > Too tired to reason straight. But here is a brief thought. > Two points in tree size: > best move first: 2*sqrt(Minimax)-1 nodes > degenerate search: D*Minimax nodes D<=1 > Does it seem linear? If that were true, then it would not be linear. I believe that the degenerate search will still be proportional to the square root of the nodes of the minimax search. It should be easy to test, if someone has an interest. Just change your move ordering function to pick a random move instead of the pv node. Try some searches at various depths for various positions. Then we can match mental extrapolations to measurements.
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.