Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: more examples for search-based stupidity

Author: Bruce Moreland

Date: 11:44:18 06/14/98

Go up one level in this thread



On June 14, 1998 at 11:39:38, blass uri wrote:

>I do not say 5K have no chance against 300K
>I believe 5K who know what to search can beat 300K who does not know
>what to search (with the same evaluation function).

The programs are using the same amount of CPU time, who cares how they
slice it?

Put a 5K nps on a machine that is 10x faster than the 300K nps machine.
The 5K nps machine is now going 50K nps, and the 300K nps machine is
still going 300K nps.

Which one is the underdog?

bruce



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.