Computer Chess Club Archives

Search

Terms

Messages

Subject: Re: Chess Engine evaluation question

Author: Russell Reagan

Date: 18:55:34 12/02/03

Go up one level in this thread

On December 02, 2003 at 21:00:03, Robert Hyatt wrote:

>Makes sense, and points out that there is a _big_ cost for doing that still.
>The EBF is meaningless when N-1 and N are _both_ doing something that is "bad"
>in terms of tree search space.

Why is it bad? If program A has an EBF of 2, and program B has an EBF of 3,
wouldn't you want program A even if program A was 16x slower than program B?

Depth    A Nodes    B Nodes    Who finishes first?
1        100        100        B
2        200        300        B
3        400        900        B
4        800        2700       B
5        1600       8100       B
6        3200       24300      B
7        6400       72900      B
8        12800      218700     A
...

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.