Professional Documents
Culture Documents
Chess 0x88
Chess 0x88
The 0x88 chess board representation is a square-centric method of representing the chess board used by
some chess programs. The number 0x88 (13610, 2108, 100010002) is a hexadecimal integer in C syntax.
The rank and file positions are each represented by a nibble (hexadecimal digit), and the bit gaps simplify a
number of computations to bitwise operations.
Layout
In the 0x88 board-representation the layout is spread out to cover an 8-by-16 board, equal to the size of two
adjacent chessboards. Each square of the 8-by-16 matrix is assigned a number as can be seen in the board
layout table. In this scheme each nibble represents a rank or a file, so that the 8-bit integer 0x42 represents
the square at (4,2) — c4.
Adding 16 to a number for a square results in the number for the square one row above, and subtracting 16
results in the number for the square one row below. To move from one column to another the number is
increased or decreased by one. In hexadecimal notation, legal chess positions (A1-H8) are always below
0x88. This layout simplifies many computations that chess programs need to perform by allowing bitwise
operations instead of comparisons.
Applications
Off-the-board detection
Off-the-board detection is a feature of chess programs which determines whether a piece is on or off the
legal chess board. In 0x88, the highest bit of each nibble represents whether a piece is on the board or not.
Specifically, out of the 8 bits to represent a square, the fourth and the eighth must both be 0 for a piece to be
located within the board. This allows off-the-board detection by bitwise AND operations. If $square
AND 0x88 (or, in binary, 0b10001000) is non-zero, then the square is not on the board. This bitwise
operation requires fewer computer resources than integer comparisons. This makes calculations such as
illegal move detection faster.
Square Relations
The difference of valid 0x88 coordinates A and B is unique with respect to distance and direction, which is
not true for classical packed three bit rank and file coordinates. That makes lookups for Manhattan distance,
possible piece attacks, and legal piece moves more resource friendly. While classical square coordinates in
the 0..63 range require 4K (64*64) sized tables, the 0x88 difference takes 1/16 or 256 sized tables - or even
16 less.
An offset of 119 (0x77 as max valid square index) is added, to make +-119 a 0..238 range (size of 240 for
alignment reasons).
0x88Diff = 0x77 + A - B
Adoption
Though the 0x88 representation was initially popular, it has been mostly replaced by the system of
bitboards.
Retrieved from "https://en.wikibooks.org/w/index.php?title=Chess/0x88&oldid=3702293"
Text is available under the Creative Commons Attribution-ShareAlike License.; additional terms may apply. By using
this site, you agree to the Terms of Use and Privacy Policy.