0x88

This article is part of the series on
Chess programming
Board representations 0x88 Bitboards
Evaluation functions Deep neural networks (Transformers) Attention Efficiently updatable neural networks Handcrafted evaluation functions Piece-square tables Reinforcement learning Stochastic gradient descent Supervised learning Texel tuning Unsupervised learning
Graph and tree search algorithms Minimax Alpha-beta pruning Principal variation search Quiescence search Monte Carlo tree search
Chess computers Belle ChessMachine ChipTest Cray Blitz Deep Blue Deep Thought HiTech Hydra Mephisto Saitek
Chess engines AlphaZero Chess Tiger Crafty CuckooChess Deep Fritz Dragon by Komodo Chess Fairy-Max Fritz Fruit GNU Chess HIARCS Houdini Ikarus Junior KnightCap Komodo Leela Chess Zero MChess Pro Mittens MuZero Naum REBEL Rybka Shredder Sjeng SmarThink Stockfish Torch Turochamp Zappa
v t e

The 0x88 chess board representation is a square-centric method of representing the chess board in computer chess programs. The number 0x88 is a hexadecimal integer (136₁₀, 210₈, 10001000₂). 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.

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) in zero-based numbering, i.e. c5 in standard algebraic notation.^[1]

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.^[2] 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.^[3]

The modern standard to identify the squares on a chessboard and moves in a game is algebraic notation, whereby each square of the board is identified by a unique coordinate pair — a letter between a and h for the horizontal coordinate, known as the file, and a number between 1 and 8 for the vertical coordinate, known as the rank.

In computer chess, file-rank coordinates are internally represented as integers ranging from 0 to 7, with file a mapping to 0 through to file h mapping to 7, while the rank coordinate is shifted down by one to the range 0 to 7.

An advantage of the 0x88 coding scheme is that values can be easily converted between 0x88 representation and file-rank coordinates using only bitwise operations, which are simple and efficient for computer processors to work with. To convert a zero-based file-rank coordinate to 0x88 value:

${\displaystyle {\text{square}}_{0{\rm {{x}88}}}=({\text{rank}}_{\text{0 to 7}}<<4)+{\text{file}}_{\text{0 to 7}}}$

Thus, a1 corresponds to ${\displaystyle 00000000_{2}}$, with all 8 of the bits set to ${\displaystyle 0}$, b2 corresponds to ${\displaystyle 00010001_{2}}$, and h8 corresponds to ${\displaystyle 01110111_{2}}$.^[1]

To convert an 0x88 value to a file-rank coordinate pair:

${\displaystyle {\text{file}}_{\text{0 to 7}}={\text{square}}_{0{\rm {{x}88}}}\ \&\ 7}$

${\displaystyle {\text{rank}}_{\text{0 to 7}}=({\text{square}}_{0{\rm {{x}88}}}\ >>4)}$

Note: In the above formulas, << and >> represent left and right logical bit shift operations respectively while & represents bitwise and.

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.^[4] 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.^[5] This bitwise operation requires fewer computer resources than integer comparisons. This makes calculations such as illegal move detection faster.^[5]

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-sized tables (64×64), the 0x88 difference takes 1/16 that or 256-sized tables—or even 16 less.^[6]

An offset of 119 (0x77 as the maximum valid square index) is added, to make ±119 a 0–238 range (a size of 240 for alignment reasons).^[6]

0x88Diff = 0x77 + A − B 

Though the 0x88 representation was initially popular, it has been mostly replaced by the system of bitboards.^[7]

• Chess board representations by Robert Hyatt
• How Zarkov Plays Chess Archived 2020-08-19 at the Wayback Machine by John Stanback
• The 0x88 representation from Mediocre Chess Archived 2018-08-20 at the Wayback Machine by Jonatan Pettersson