Computer Chess Club Archives

Search

Messages

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

Author: Uri Blass

Date: 11:34:56 09/18/05

Go up one level in this thread

On September 18, 2005 at 14:12:11, Chan Rasjid wrote:

>This means there is NO-MATCH whatsoever with a 1 - 1000x nps difference.
>Fruit's seems to sacrifice complicated (undue) evaluation in favour of high nps
>and makes the top.

I disagree

Fruit has a very strong evaluation function.

Most of the improvement from Fruit1.0 to Fruit2.1 is because of better
evaluation.

Crafty is faster than Fruit in nodes per second so nodes per second is not the
secret of Fruit.

Uri

• Re: An Experiment that disproves Hyatt's 1000X NPS Theory Chan Rasjid 12:43:28 09/18/05
  • Re: An Experiment that disproves Hyatt's 1000X NPS Theory Uri Blass 13:14:10 09/18/05
    • Re: An Experiment that disproves Hyatt's 1000X NPS Theory Robert Hyatt 19:26:53 09/18/05
      • Re: An Experiment that disproves Hyatt's 1000X NPS Theory Peter Kappler 20:04:58 09/18/05
        • Re: An Experiment that disproves Hyatt's 1000X NPS Theory Robert Hyatt 20:28:42 09/18/05
          • Re: An Experiment that disproves Hyatt's 1000X NPS Theory Uri Blass 22:46:30 09/18/05
    • Re: An Experiment that disproves Hyatt's 1000X NPS Theory Chan Rasjid 15:08:47 09/18/05
      • Re: An Experiment that disproves Hyatt's 1000X NPS Theory Chan Rasjid 16:03:31 09/18/05

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.