Hexagonal chess file f). Ranks 1–6 each contain 11 cells, rank 7 (filled with black pawns in the initial setup) has 9 cells, rank 8 has 7, and so on. Rank 11 contains exactly one cell: f11. The diagrams show how each piece moves. As in chess, the knight can jump over other pieces. A player's three bishops, relegated to different colours, can never meet. The queen moves as rook plus bishop. There is no castling in Gliński's chess. Pawns move straight forward and capture obliquely forward to an adjacent cell (shown as crosses in the diagram); the pawn's capturing move direction
Infinite chess a checkmate. Theorists conceive of infinite chess variations to expand the theory of chess in general, or as a model to study other mathematical, economic, or game-playing strategies. For infinite chess, mathematical investigations have shown that in a general endgame, one player can force a win in a finite number of moves. More specifically, it has been found that infinite chess is decidable; that is, given a position (such as formula_1, and assuming pawns do not promote) of a finite number of chess pieces which are uniformly mobile and with constant and linear freedom, and (for example) White to move,