Editing Bitboard (section)

{{Short description|Data structure in computer board games}}
{{more citations needed|date=September 2019}}
{{Use dmy dates|date=January 2020|cs1-dates=y}}
A '''bitboard''' is a specialized [[bit array]] [[data structure]] commonly used in [[Game AI|computer systems that play]] [[board game]]s, where each bit corresponds to a game board space or piece. This allows parallel bitwise operations to set or query the game state, or determine moves or plays in the game.

Bits in the same bitboard relate to each other by the rules of the game, often forming a game position when taken together.  Other bitboards are commonly used as masks to transform or answer queries about positions.  Bitboards are applicable to any game whose progress is represented by the state of, or presence of pieces on, discrete spaces of a gameboard, by mapping of the space states to bits in the data structure.  Bitboards are a more efficient alternative board representation to the traditional ''mailbox'' representation, where each piece or space on the board is an array element.

Bitboards are especially effective when the associated bits of various related states on the board fit into a single word or double word of the CPU architecture, so that single bitwise operators like AND and OR can be used to build or query game states.

Among the computer game implementations that use bitboards are [[chess]], [[checkers]], [[reversi|othello]] and [[Word game#Letter arrangement games|word games]]. The scheme 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.