Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Fast bitmap methods.

Author: Dann Corbit

Date: 12:46:15 03/31/99

Go up one level in this thread


On March 31, 1999 at 07:41:03, David Blackman wrote:
[snip]
>The big question is NOT "can you do this from my vague description plus sneaking
>a look at KnightCap", but "has this inspired you to look for something even
>better". Approx 600 machine instructions per node for a fast/dumb program is
>better than most out there, but it still seems too many to me.
I agree strongly.  If you copy someone else's technique exactly, you cannot
possibly beat them.  In addition, it is quite likely you do not fully understand
it.  But it is important to really understand what many people have tried.  In
that way, we do not have to reinvent the wheel over and over again (and not
nearly as well as it was invented the first time).  Once you know what others
have done, then you can make rational choices about how to improve it.



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.