Constants for the side to move or the color of a piece.

chess.WHITE = True
chess.BLACK = False

You can get the opposite color using not color.

Piece types

chess.PAWN = 1
chess.KNIGHT = 2
chess.BISHOP = 3
chess.ROOK = 4
chess.QUEEN = 5
chess.KING = 6


chess.A1 = 0
chess.B1 = 1

and so on to

chess.H7 = 62
chess.H8 = 63
chess.SQUARES = [chess.A1, chess.B1, ..., chess.G8, chess.H8]
chess.SQUARE_NAMES = ['a1', 'b1', ..., 'g8', 'h8']
chess.FILE_NAMES = ['a', 'b', ..., 'g', 'h']

Gets the file index of square where 0 is the a file.


Gets the rank index of the square where 0 is the first rank.

chess.square(file_index, rank_index)

Gets a square number by file and rank index.


class chess.Piece(piece_type, color)

A piece with type and color.


The piece type.


The piece color.


Gets the symbol P, N, B, R, Q or K for white pieces or the lower-case variants for the black pieces.


Gets the unicode character for the piece.

classmethod from_symbol(symbol)

Creates a piece instance from a piece symbol.

Raises ValueError if the symbol is invalid.


class chess.Move(from_square, to_square, promotion=None)

Represents a move from a square to a square and possibly the promotion piece type.

Castling moves are king moves to the corresponding rook square.

Null moves are supported.


The source square.


The target square.


The promotion piece type.


Gets an UCI string for the move.

For example a move from A7 to A8 would be a7a8 or a7a8q if it is a promotion to a queen.

The UCI representatin of null moves is 0000.

classmethod from_uci(uci)

Parses an UCI string.

Raises ValueError if the UCI string is invalid.

classmethod null()

Gets a null move.

A null move just passes the turn to the other side (and possibly forfeits en-passant capturing). Null moves evaluate to False in boolean contexts.

>>> bool(chess.Move.null())


chess.STARTING_FEN = 'rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1'

The FEN of the standard chess starting position.

class chess.Board(fen='rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1')

A board and additional information representing a position.

Provides move generation, validation, parsing, attack generation, game end detection, move counters and the capability to make and unmake moves.

The board is initialized to the starting position, unless otherwise specified in the optional fen argument. If fen is None an empty board is created.


The side to move.


Bitmask of the rooks with castling rights.

>>> white_castle_kingside = board.castling_rights & chess.BB_H1

Also see has_castling_rights(), has_kingside_castling_rights() and has_queenside_castling_rights().


The potential en-passant square on the third or sixth rank or 0. It does not matter if en-passant would actually be possible on the next move.


Counts move pairs. Starts at 1 and is incremented after every move of the black side.


The number of half moves since the last capture or pawn move.

A dynamic list of pseudo legal moves.

Pseudo legal moves might leave or put the king in check, but are otherwise valid. Null moves are not pseudo legal. Castling moves are only included if they are completely legal.

For performance moves are generated on the fly and only when nescessary. The following operations do not just generate everything but map to more efficient methods.

>>> len(board.pseudo_legal_moves)
>>> bool(board.pseudo_legal_moves)
>>> move in board.pseudo_legal_moves
legal_moves = LegalMoveGenerator(self)

A dynamic list of completely legal moves, much like the pseudo legal move list.


The move stack. Use Board.push(), Board.pop(), Board.peek() and Board.clear_stack() for manipulation.


Restores the starting position.


Clears the board.

Resets move stacks and move counters. The side to move is white. There are no rooks or kings, so castling rights are removed.

In order to be in a valid status() at least kings need to be put on the board.


Clears the move stack and transposition table.

pieces(piece_type, color)

Gets pieces of the given type and color.

Returns a set of squares.


Gets the piece at the given square.


Gets the piece type at the given square.


Removes a piece from the given square if present.

set_piece_at(square, piece)

Sets a piece at the given square. An existing piece is replaced.

is_attacked_by(color, square)

Checks if the given side attacks the given square.

Pinned pieces still count as attackers. Pawns that can be captured en-passant are attacked.

attackers(color, square)

Gets a set of attackers of the given color for the given square.

Pinned pieces still count as attackers. Pawns that can be captured en-passant are attacked.

Returns a set of squares.


Gets a set of attacked squares from a given square.

There will be no attacks if the square is empty. Pinned pieces are still attacking other squares. Pawns will attack pawns they could capture en-passant.

Returns a set of squares.

pin(color, square)

Detects pins of the given square to the king of the given color.

Returns a set of squares that mask the rank, file or diagonal of the pin. If there is no pin, then a mask of the entire board is returned.

is_pinned(color, square)

Detects if the given square is pinned to the king of the given color.


Returns if the current side to move is in check.


Checks if the given move would leave the king in check or put it into check. The move must be at least pseudo legal.


Checks if the king of the other side is attacked. Such a position is not valid and could only be reached by an illegal move.


Checks if the game is over due to checkmate, stalemate, insufficient mating material, the seventyfive-move rule or fivefold repetition.


Checks if the current position is a checkmate.


Checks if the current position is a stalemate.


Checks for a draw due to insufficient mating material.


Since the first of July 2014 a game is automatically drawn (without a claim by one of the players) if the half move clock since a capture or pawn move is equal to or grather than 150. Other means to end a game take precedence.


Since the first of July 2014 a game is automatically drawn (without a claim by one of the players) if a position occurs for the fifth time on consecutive alternating moves.


Checks if the side to move can claim a draw by the fifty-move rule or by threefold repetition.


Draw by the fifty-move rule can be claimed once the clock of halfmoves since the last capture or pawn move becomes equal or greater to 100 and the side to move still has a legal move they can make.


Draw by threefold repetition can be claimed if the position on the board occured for the third time or if such a repetition is reached with one of the possible legal moves.


Updates the position with the given move and puts it onto a stack.

Null moves just increment the move counters, switch turns and forfeit en-passant capturing.

No validation is performed. For performance moves are assumed to be at least pseudo legal. Otherwise there is no guarantee that the previous board state can be restored. To check it yourself you can use:

>>> move in board.pseudo_legal_moves

Restores the previous position and returns the last move from the stack.


Gets the last move from the move stack.


Gets the FEN representation of the position.


Gets the Shredder FEN representation of the position.

Castling rights are encoded by the file of the rook. The starting castling rights in normal chess are HAha.


Parses a FEN and sets the position from it.

Rasies ValueError if the FEN string is invalid.


Gets an EPD representation of the current position.

EPD operations can be given as keyword arguments. Supported operands are strings, integers, floats and moves and lists of moves and None. All other operands are converted to strings.

A list of moves for pv will be interpreted as a variation. All other move lists are interpreted as a set of moves in the current position.

hmvc and fmvc are not included by default. You can use:

>>> board.epd(hmvc=board.halfmove_clock, fmvc=board.fullmove_number)
'rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - hmvc 0; fmvc 1;'

Parses the given EPD string and uses it to set the position.

If present the hmvc and the fmvn are used to set the half move clock and the fullmove number. Otherwise 0 and 1 are used.

Returns a dictionary of parsed operations. Values can be strings, integers, floats or move objects.

Raises ValueError if the EPD string is invalid.


Gets the standard algebraic notation of the given move in the context of the current position.

There is no validation. It is only guaranteed to work if the move is legal or a null move.


Uses the current position as the context to parse a move in standard algebraic notation and return the corresponding move object.

The returned move is guaranteed to be either legal or a null move.

Raises ValueError if the SAN is invalid or ambiguous.


Parses a move in standard algebraic notation, makes the move and puts it on the the move stack.

Raises ValueError if neither legal nor a null move.

Returns the move.

uci(move, chess960=True)

Gets the UCI notation of the move.

Castling moves are returned in UCI_Chess960 notation. If you provide False for chess960 they will be converted to legacy UCI notation in the context of the current position.


Parses the given move in UCI notation.

Supports both UCI_Chess960 and legacy UCI notation.

The returned move is guaranteed to be either legal or a null move.

Raises ValueError if the move is invalid or illegal in the current position (but not a null move).


Parses a move in UCI notation and puts it on the move stack.

Raises ValueError if the move is invalid or illegal in the current position (but not a null move).

Returns the move.


Checks if the given pseudo-legal move is an en-passant capture.


Checks if the given pseudo-legal move is a capture.


Checks if the given pseudo-legal move is a castling move.


Checks if the given side has castling rights.


Checks if the given side has kingside (that is h-side in Chess960) castling rights.


Checks if the given side has queenside (that is a-side in Chess960) castling rights.


Gets a bitmask of possible problems with the position.

Move making, generation and validation are only guaranteed to work on a completely valid board.

By default positions with generalized Chess960 castling rights are allowed. Pass False for allow_chess960 in order to restrict the validation to standard chess positions.

STATUS_VALID for a completely valid board.



Checks if the board is valid.

Move making, generation and validation are only guaranteed to work on a completely valid board.

See status() for details.


Returns a Zobrist hash of the current position.

A zobrist hash is an exclusive or of pseudo random values picked from an array. Which values are picked is decided by features of the position, such as piece positions, castling rights and en-passant squares. For this implementation an array of 781 values is required.

The default behaviour is to use values from POLYGLOT_RANDOM_ARRAY, which makes for hashes compatible with polyglot opening books.


Creates a copy of the board.

classmethod empty()

Creates a new empty board. Also see clear().

classmethod from_epd(epd)

Creates a new board from an EPD string. See set_epd().

Returns the board and the dictionary of parsed operations as a tuple.

Square sets

class chess.SquareSet(mask=0)

A set of squares.

>>> squares = chess.SquareSet(chess.BB_B1 | chess.BB_G1)
>>> squares
>>> print(squares)
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. 1 . . . . 1 .
>>> len(squares)
>>> bool(squares)
>>> chess.B1 in squares
>>> for square in squares:
...     # 1 -- chess.B1
...     # 6 -- chess.G1
...     print(square)
>>> list(squares)
[1, 6]

Square sets are internally represented by 64 bit integer masks of the included squares. Bitwise operations can be used to compute unions, intersections and shifts.

>>> int(squares)

Also supports common set operations like issubset(), issuperset(), union(), intersection(), difference(), symmetric_difference() and copy() as well as update(), intersection_update(), difference_update(), symmetric_difference_update() and clear().

Warning:Square sets can be used as dictionary keys, but do not modify them when doing this.

Add a square to the set.


Remove a square from the set.

Raises KeyError if the given square was not in the set.


Discards a square from the set.


Removes a square from the set and returns it.

Raises KeyError on an empty set.

Common integer masks are:

chess.BB_VOID = 0

Single squares:

chess.BB_SQUARES = [chess.BB_A1, chess.BB_B1, ..., chess.BB_G8, chess.BB_H8]

Ranks and files:

chess.BB_RANKS = [chess.BB_RANK_1, ..., chess.BB_RANK_8]
chess.BB_FILES = [chess.BB_FILE_A, ..., chess.BB_FILE_H]