Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: all time multiple world record setting chess programmer

Author: Russell Reagan

Date: 16:54:45 10/26/03

Go up one level in this thread


On October 26, 2003 at 17:36:36, K. Burcham wrote:

>Not true and you know this better than most-----you ask and post as many or more
>questions than most. you personnally know it takes tremendous amount of bug
>fixes, troubleshooting, testing, consulting. I think this comment of yours is a
>blow to many of the top programmers, you imply a top program is easy to achieve.


It is not an easy task to make a good program, and certainly not easy to make
one as good as Ruffian, but writing bug free code is not as difficult as you
make it seem. Most bugs are a result of premature optimization. If you don't put
the focus on efficiency, it is not hard to write correct code.


>It is my record...

Right, it's YOUR record. NOT a "world record". If you want to make it a world
record then let's see some proof of each of the claims you make.


>Possible but not probable--world record still stands.


Wow...so "probable" is all we need to declare a "world record"? Pretty low
standards.



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.