Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Search Depth in CM6000?

Author: blass uri

Date: 22:34:20 08/10/99

Go up one level in this thread


On August 10, 1999 at 22:12:50, Tina Long wrote:

<snipped>
>Junior      25
>
>This is the longest extension searched.    Correct?

The depth of Junior is not the long extension searched.
and is not the brute force depth.

depth x of Junior says something like x/2 brute force depth and the selective
search 2x.

Junior does brute force search of all the lines with depth<=25 when it considers
some moves as depth 2 and some moves as a smaller depth.

The brute force depth is not always at least x/2 because Junior may be blind and
never see something(also because of some bugs and not only because it does not
consider underpromotions)
but usually it is at least x/2 when the depth is x.

Uri



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.