Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: when is a clone a clone?

Author: Daniel Clausen

Date: 05:08:50 11/28/03

Go up one level in this thread


On November 28, 2003 at 06:44:48, Tord Romstad wrote:

>On November 28, 2003 at 06:12:43, Odd Gunnar Malin wrote:
>
>>On November 28, 2003 at 05:00:49, martin fierz wrote:
>>>
>>>how much foreign code is allowed?
>>
>>None.
>
>My engine is completely different from Crafty in almost every possible
>way.  I don't have a single bitboard in my code.  I do lots of
>eval-based extensions, reductions and forward pruning.  My qsearch is
>quite big and contains many checks and other non-capturing moves.
>Qsearch is hashed.  My eval is used to locate mate threats, hanging
>pieces, forks, pinned or overloaded pieces and similar tactical motifs.
>My search algorithm is MTD(f) rather than PVS.  In short, my whole
>approach to chess programming is radically different to Bob Hyatt's,
>and there is very little in Crafty's source code which has any interest
>to me.
>
>But still, my 64-bit random number generator is copied directly from
>Crafty's source code.  Does this make my engine a clone?  If you or
>somebody else thinks the answer is "yes", I will consider replacing
>the random number code in my next version, even though it will force
>my users to download the opening book again.

I copied the random32() function from Crafty as well. (I added a comment in the
source-file which references both the original implementation in Crafty and the
original algorithm by Knuth)

I don't consider this being a clone, since
(a) it's trivial to implement the function once you have the book from Knuth (I
just saved the money to actually buy it, but the algorithm is probably available
online as well)
(b) it's not really a chess-related function (like search, eval) but more a
utility function (like the FirstBit, LastBit, PopCount functions as well)

Sargon



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.