Bitboard

Uses your system voice; voice and rate in settings.

Snapshot

≈ 14 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

A bitboard is a specialized bit array data structure commonly used in computer systems that play board games, where each bit corresponds to a game board space or piece. The technique is applicable to any board game whose game state is represented by the presence of pieces on discrete spaces of a gameboard, including chess, checkers, othello and word games.

It was first employed in checkers programs in the 1950s, and since the mid-1970s has been the de facto standard for game board representation in computer automatons. Compared with the traditional mailbox representation, where each piece or space on the board is an array element, bitboards are a more space-efficient board representation. Bitboards are often also more time-efficient.

When the associated bits of related states on the bitboard fit into a single word or double word of the CPU architecture, single bitwise operators like AND and OR can be used to operate on the bitboard. These parallel bitwise operations can be much faster at setting and querying game states, and determining moves and plays in the game, than performing iterative array operations on a mailbox representation would be.

Modern chess engines predominantly utilize magic bitboards, which employ perfect hashing to map a piece's occupancy mask directly to a pre-computed array of attack patterns in a single lookup operation.

A bitboard is a specialized bit array data structure commonly used in computer systems that play board games, where each bit corresponds to a game board space or piece. The technique is applicable to any board game whose game state is represented by the presence of pieces on discrete spaces of a gameboard, including chess, checkers, othello and word games.

It was first employed in checkers programs in the 1950s, and since the mid-1970s has been the de facto standard for game board representation in computer automatons. Compared with the traditional mailbox representation, where each piece or space on the board is an array element, bitboards are a more space-efficient board representation. Bitboards are often also more time-efficient.

When the associated bits of related states on the bitboard fit into a single word or double word of the CPU architecture, single bitwise operators like AND and OR can be used to operate on the bitboard. These parallel bitwise operations can be much faster at setting and querying game states, and determining moves and plays in the game, than performing iterative array operations on a mailbox representation would be.

Modern chess engines predominantly utilize magic bitboards, which employ perfect hashing to map a piece's occupancy mask directly to a pre-computed array of attack patterns in a single lookup operation.

Description

A bitboard is a specialized bit field: a format that represents the state of a board game by packing multiple Boolean variables into the same machine word. Each bit represents a space; when the bit is positive, a property of that space is true. Bitboards allow the computer to answer questions about game state using very few bitwise operations.

For example, if a chess program wants to know if the white player has any pawns in the center of the board (center four squares), it can just compare a bitboard for the player's pawns with one for the center of the board using a bitwise AND operation. If there are no center pawns, the result will be all zero bits (i.e. equal to zero).

Multiple bitboards may represent different properties of spaces over the board, and special or temporary bitboards (like temporary variables) may represent local properties or hold intermediate collated results. The efficacy of bitboards is augmented by two other properties of the implementation.

First, bitboards are fast to incrementally update; for example, flipping the bits at the source and destination positions in a bitboard for piece location when a piece is moved. Second, bitmaps representing static properties like all spaces attacked by each piece type for every position on a chessboard can be pre-collated and stored in a table.

This allows a question like "what are the legal moves of a knight on space e4?" to be answered by a single memory fetch. Bitboard implementations take advantage of the presence of fullword (32-bit or 64-bit) bitwise logical operations like AND, OR, NOT and others on modern CPU architectures in order for operations to be fast.

Bitboards may not be as effective on earlier 8- and 16-bit minicomputer and microprocessor architectures.

Implementation

Because the implementation of bitboards requires correct compression and encoding of massive tables and complex game states, bitboard programs can be tedious for software developers to write and debug.

Advantages

Bitboard representations use parallel bitwise operations available on nearly all CPUs that complete in one cycle, and are typically among the fastest instructions (being fully pipelined and cached, as well as other CPU-specific optimizations). Nearly all CPUs have the AND, OR, NOR, and XOR operations.

Furthermore, modern CPUs have instruction pipelines that queue instructions for execution. A processor with multiple execution units can perform more than one instruction per cycle if more than one instruction is available in the pipeline. Normal instruction sequences with branches may cause the pipeline to empty if a branch is mispredicted.

Many bitboard operations require fewer conditionals, increasing pipelining and making effective use of multiple execution units on many CPUs. CPUs have a bit width, the number of completable bitwise operations in one cycle. On a 64-bit or larger CPU, 64-bit operations can therefore occur in one instruction.

There may be support for higher or lower width instructions. Many 32-bit CPUs may have some 64-bit instructions and those may take more than one cycle or otherwise be handicapped compared to their 32-bit instructions. If the bitboard is larger than the width of the instruction set, multiple instructions will be required to perform a full-width operation on it.

A program using 64-bit bitboards would therefore run faster on a 64-bit processor than on a 32-bit processor.

Disadvantages

Bitboard representations have much longer code, both source and object code. Long bit-twiddling sequences are technically tricky to write and debug. This issue may increase cache misses or cause cache thrashing.

If the processor does not have hardware instructions for 'first one' (or 'count leading zeros') and 'count ones' (or 'count zeros'), the implementation will be significantly handicapped, as these operations are extremely inefficient to code as loops or other high-level constructs.

Advantages

Bitboards require more memory than piece-list board data structures, but are more execution efficient because many loop-and-compare operations are reduced to a single (or small number of) bitwise operation(s). For example, in mailbox, determining whether piece attacks space requires generating and looping through legal moves of piece and comparing the final space with space. With bitboards, the legal moves of piece are stored in a bitmap, and that map is ANDed with the bitmap for space.

A non-zero result means that piece attacks space.

Disadvantages

For some games, writing a bitboard engine requires a fair amount of source code, including data tables that will be longer than the compact mailbox/enumeration implementation. This can cause problems for mobile devices (such as cell phones) with a limited number of registers or processor instruction cache.

For full-sized computers, it may cause cache misses between level-one and level-two cache. This is only a potential problem, not a major drawback, as most machines will have enough instruction cache for this not to be an issue.

Incremental update

Some kinds of bitboards are derived from others by an elaborate process of cross-correlation, such as the attack maps in chess. Reforming all these maps at each change of game state (such as a move) can be prohibitively expensive, so derived bitmaps are incrementally updated, a process which requires intricate and precise code.

This is much faster to execute, because only bitmaps associated with changed spaces, not all bitmaps over the board, need to change. Without incremental update, bitmapped representation may not be more efficient than the older mailbox representation where update is intrinsically local and incremental.

Precomputed bitmaps and table lookup

Some kinds of bitmaps that don't depend on board configurations can be precomputed and retrieved by table lookup rather than collated after a move or state change of the board, such as the spaces attacked by a knight or king on each of the 64 squares of a chessboard, which would otherwise require an enumeration.

Rotated bitboards

Rotated bitboards are complementary bitboard data structures that enable tabularizing of sliding piece attack vectors, one for file attack vectors of rooks, and one each for the diagonal and anti-diagonal attack vectors of bishops (rank attacks of rooks can be indexed from standard bitboards). With these bitboards, a single table lookup replaces lengthy sequences of bitwise operations.

These bitboards rotate the board occupancy configuration by 90 degrees, 45 degrees, and/or 315 degrees. A standard bitboard has one byte per rank of the chess board. With this bitboard, it is easy to determine rook attacks across a rank, using a table indexed by the occupied square and the occupied positions in the rank (because rook attacks stop at the first occupied square).

By rotating the bitboard 90 degrees, rook attacks up and down a file can be examined the same way. Bitboards rotated 45 degrees and 315 degrees (-45 degrees) have diagonals that are easy to examine, for determining bishop attacks. The queen can be examined by combining rook and bishop attacks.

The rotation of a bitboard, however, is an inelegant transformation that can take dozens of instructions.

Direct hashing

The attack vectors of rooks and bishops can be separately masked and used as indices into a hash table of precomputed attack vectors depending on occupancy: 8 bits each for rooks and from 2 to 8 bits each for bishops. The full attack vector of a piece is obtained as the union of each of the two unidirectional vectors indexed from the hash table.

The number of entries in the hash table is modest, on the order of 8*2^8 bytes, or about 2 kilobytes. Two hash function computations and two lookups per piece are required for the hashing scheme. I = (O \times M) \gg (64 - N) Where: O is the 64-bit occupancy bitboard representing relevant blocking pieces on the slider's attack rays.

M is a square-specific 64-bit unsigned integer constant (magic number). N is the number of bits required to index the attack lookup table for that specific square. >> represents a bitwise right-shift operation (Isolates the significant bits of the 64-bit multiplication product to yield a dense array index ) This shows how magic bitboards allow moves of a rook to be calculated in O(1) time and without performing a move a square at a time.

The program first notes the Current Position. Then it selects which squares, if any, can block the rook using a bitwise mask (Relevant Occupancy Mask). Then it selects which pieces are in those key squares (Relevant Piece Occupancy).

To map the 64-bit integer to a small lookup table without collisions, it is multiplied by a pre-calculated 64-bit constant magic number. This multiplication acts as a bit permutation, hash, and pack directly into the top N most significant bits of the product.

Shifting this product to the right by (64 - N) drops the lower bits, and creates a unique array index which is then used to retrieve the pre-computed Raw Attacks bitboard. The last step is removing the friendly pieces on e2, and this creates the Legal Moves.

History

The bitboard method for representing a board game is credited to Arthur Samuel, who used it in the mid-1950s in his checkers program. For the more complicated game of chess, the method was credited to both the Kaissa team in the Soviet Union in the late 1960s, and to the authors of the U.S. Northwestern University program "Chess" in the early 1970s. The 64-bit word length of 1970s supercomputers like Amdahl and Cray machines facilitated the development of bitboard representations, which conveniently mapped the 64-squares of the chessboard to bits of a word.

Rotated bitboards for collating the moves of sliding pieces were invented by Professor Robert Hyatt, author of Cray Blitz and Crafty chess engines, sometime in the mid-1990s and shared with the Dark Thought programming team. They were later implemented in Crafty and Dark Thought, but the first published description wasn't until 19971.

Prior to 2006, the primary state-of-the-art technique for sliding move generation was rotated bitboards, introduced by Professor Robert Hyatt, author of Cray Blitz and Crafty chess engines in the mid-1990s for the Crafty engine. Rotated bitboards maintained four separate, synchronized 64-bit representations of the board rotated at 0°, 90°, 45°, and -45°.

While this bypassed slow ray-scanning loops, keeping four parallel board states updated after every move created significant CPU cache thrashing. In the mid-2000s, two related but independently developed alternatives for rotated bitboards emerged. Magic bitboards were proposed around 2006 by Lasse Hansen, with Gerd Isenberg independently developing a separated-direction variant.

Pradu Kannan's 2007 paper documented the mathematics behind the approach and a general methodology for generating optimal magic numbers. Around that time, an intermediate, alternate approach was proposed by Sam Tannous.

Directing hashing via masked rank, file and diagonal lookup was more efficient in that it avoided maintenance of redundant board copies, though it still required two separate hash computations and lookups per piece. Magic bitboards use the same direct-hashing idea but completely replacing Tannous's two-hash-table lookup and collapsing it into a single perfect-hash multiplication, allowing engines to evaluate board states using a single, unified bitboard representation, and have since been the dominant technique in modern engine.

Other games

Many other games besides chess benefit from bitboards. In Connect Four, they allow for very efficient testing for four consecutive discs, by just two shift + AND operations per direction. In Conway's Game of Life, they are a possible alternative to arrays. They are also used in Reversi (also known as Othello).

See also

Board representation (chess)

Further reading

https://people.csail.mit.edu/heinz/dt/node2.html

Calculators

64 bits representation and manipulation

Checkers

Checkers Bitboard Tutorial by Jonathan Kreuzer

Articles

Bitboards - Chessprogramming wiki Programming area of the Beowulf project Laramee, Francois-Dominic. Chess Programming Part 2: Data Structures. Verhelst, Paul.

Chess Board Representations Hyatt, Robert. Chess program board representations Frayn, Colin. How to implement bitboards in a chess engine (chess programming theory) Pepicelli, Glen.

Bitfields, Bitboards, and Beyond - (Example of bitboards in the Java Language and a discussion of why this optimization works with the Java Virtual Machine (www. OnJava.com publisher: O'Reilly 2005)) Magic Move-Bitboard Generation in Computer Chess. Pradyumna Kannan

Code examples

The author of the Frenzee engine had posted some source examples. [https://tromp.github.io/c4/Connect4.java A 155 line java Connect-4 program demonstrating the use of bitboards.

Closed source

DarkThought Home Page

Othello

A complete discussion of Othello (Reversi) engines with some source code including an Othello bitboard in C and assembly. Edax (computing) See the Edax article. An Othello (Reversi) engine with source code based on bitboard.

Word games

Overview of bit board usage in word games.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1377444532 under CC BY-SA 4.0; modifications have been made.

References

  1. ↩Wikipedia “Bitboard” revision 1377444532 · retrieved 2026-10-20 publication date (×1) · confidence 0.95 revision URL