Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: move ordering and node count

Author: Dan Andersson

Date: 15:03:13 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
 A little rewrite:    D*sqrt(Minimax)*sqrt(Minimax)
 It should seem clear that the size of the variable Minimax features outside the
expression sqrt(Minimax)
> Does it seem linear?
>
>MvH Dan Andersson



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.