Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Killer Moves

Author: Rick Bischoff

Date: 16:16:28 07/12/03

Go up one level in this thread


>A couple points:
>
>What you have described is usually called history tables, except that most
>people don't have a ply index (just 64x64).
>
>Killers are usually organized as 2 per ply per side, and the actual moves are
>stored (e.g. Kb1).
>
>Killers/history are usually updated on successful moves (i.e. > alpha).
>
>My suggestion is that you download crafty and take a look at next.c. [WARNING:
>it takes a bit of time to get a feel for the crafty source.  EVERYTHING in there
>is a macro. And I do mean everything.  An example is WhiteKnights ->
>tree->white_knights_bitboard.]
>
>anthony

Yes, I understand why having a ply_index is counter productive-- thanks for
pointing that out :-)  As for the crafty source... once I wire up the C
preprocessor directly to my brain I might look at it again!!

Thanks,
Rick



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.