Computer Chess Club Archives

Search

Messages

Subject: Re: How important is a root search function ?

Author: Robert Hyatt

Date: 14:00:49 09/03/03

Go up one level in this thread

On September 02, 2003 at 14:58:24, Gian-Carlo Pascutto wrote:

>On September 02, 2003 at 14:54:25, Geoff wrote:
>
>>No hash Table
>>Ply  Eval   Time      Nodes   Principle Variation
>[...]
>> 9:    35    282    3064714   e2e4 e7e6 d2d4 b8c6 g1f3 d7d5 e4d5 e6d5 b1c3
>>10:    10    804  8,323,244   e2e4 e7e5 g1f3 g8f6 b1c3 b8c6 f1b5 f8b4 d2d3 b4c3
>>b2c3
>
>This looks suspect. Your node branching factor is > 20 but time
>branching factor is only about 1.5?
>
>--
>GCP

You missed the missing commas.  the first value is 3,064,714.  This gives a
BF of 2.6 roughly..

• Re: How important is a root search function ? Ricardo Gibert 17:55:04 09/04/03

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.