Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: An Experiment that disproves Hyatt's 1000X NPS Theory

Author: Chan Rasjid

Date: 11:19:47 09/18/05

Go up one level in this thread


I forget something :-

You cannot match a GNU chess with some very basic fundamental flaw (may be
undiscoverd) at 1000 x nps with a mature good program. 1000x nps that chooses
a losing line will still lose some games.

So the only proper test must be w/o bugs, ie.
material + mate vs material + mate + best eval() on planet earth.

Rasjid



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.