Computer Chess Club Archives

Search

Messages

Subject: Re: Proposed interface to C.A.P. data -- Request for feedback...

Author: KarinsDad

Date: 12:20:57 07/08/99

Go up one level in this thread

On July 08, 1999 at 13:11:05, Dann Corbit wrote:

[snip]
>
>Here is the binary position structure used by the permanent hash engine.  It is
>chosen because it is fairly compact and extremely simple.
>/*
>192 bits = 24 bytes.
>
>First 64 bits, one bit per square, 0=empty, 1=occupied in EPD/FEN sequence
>a8,b8,...a7,b7....
>
>Last 128 bits, 4 bits per pawn/piece, positionally in EPD/FEN sequence.
>Unused bits always zero.
>
>Pawn/piece bit patterns as follows:
>
>'0000'  - black king
>'1000'  - white king (white to move)
>'1111' - white king (black to move)
>'0001' - black queen
>'1001' - white queen
>'0010' - black rook
>'1010' - white rook
>'0011' - black rook (may castle)
>'1011' - white rook (may castle)
>'0100' - black knight
>'1100' - white knight
>'0101' - black bishop
>'1110' - white bishop
>'0110' - black pawn
>'1110' - white pawn
>'0111' - en passant pawn
>*/

Nice structure Dann. Similar to the EPD one, but a little nicer.

KarinsDad :)

• Re: Proposed interface to C.A.P. data -- Request for feedback... Dann Corbit 12:29:07 07/08/99
  • Re: Proposed interface to C.A.P. data -- Request for feedback... Will Singleton 12:56:27 07/08/99
    • Re: Proposed interface to C.A.P. data -- Request for feedback... Dann Corbit 13:23:32 07/08/99

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.