Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: La Petite 1.0 (download)

Author: Frank Schneider

Date: 13:02:34 10/24/99

Go up one level in this thread


On October 24, 1999 at 10:08:45, Robert Hyatt wrote:

>On October 24, 1999 at 05:59:40, Frank Schneider wrote:
>
>>
>>I haven't tried the 'strings lapetite.exe', but I believe you that there are
>>lots of strings that were just translated. I agree that is strong evidence
>>that lapetite's I/O is based on Crafty. But is there any evidence that the
>>engine is still a crafty clone?
>>
>>Copying an engine is, from my point of view, much worse than reusing the
>>I/O stuff and structure of the userinterface.
>>
>
>Run the second test I mentioned:  start "La Petite" under a debugger, and
>look for the area where all the 64 bit masks are in memory.  You will find
>patterns like 80000000 00000000, 40000000 00000000, 20000000 00000000, etc.
>then look for the rotated masks which are like the above, but in a different
>order (64 bits, 1 bit set).  Then compare to crafty.exe.  Look at data.c to
>find the pre-initialized scoring array patterns.  See if you can find 'em in
>La Petite.  :)
>
>etc.
I don't have La Petite.

But I have very similar bit masks in Gromit (only 16 bit, because Gromit
does not use bitboards) and I wonder how to write a bitboard-base program
without such bit masks. Is there anything special about the order of masks
in Crafty that is unlikely to be invented independently by others?

Do other bit board based programs use such masks? How do they look in
Inmichess? Insomniac (if it uses bit boards)?

I agree that it is something different if LaPetite uses the same scoring arrays.
Everyone uses them, but finding lots of identical scores would be surprising.


I'd really like to see a statement here, where G. Mueller gives her point
of view.


Frank



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.