Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: late move reductions (and another question)

Author: Robert Hyatt

Date: 08:45:14 03/02/06

Go up one level in this thread


On March 02, 2006 at 05:46:06, Rémi Coulom wrote:

>On March 01, 2006 at 19:54:20, Robert Hyatt wrote:
>
>>On March 01, 2006 at 19:11:15, Jarkko Pesonen wrote:
>>
>>>Her is what open source Fruit/Toga is using
>>>
>>>index = PIECE_TO_12(board->square[MOVE_FROM(move)]) * 64 +
>>>SQUARE_TO_64(MOVE_TO(move));
>>
>>
>>That is the same as everyone doing history I assume?  4096 entries per side...
>
>If you read the code carefully, you'll notice that it is not. It is 12 * 64.
>
>Rémi

yes, but the history_index() function computes a 12 bit index.  That is what is
confusing.

notice the index calculation above...  from * 64 + to, which certainly gives a
12 bit index into a 12 * 64 table.  That has to be a bug, or else I am missing
something.  Note that someone just sent me the pieces above, not the entire
fruit source so I have not looked at the surrounding code to see if there is
more to the story...



This page took 0.01 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.