Counting Nonattacking Chess Piece Placements: Bishops and Anassas
Abstract
We derive recurrences and closed-form expressions for counting nonattacking placements of two types of chess pieces with unbounded straight-line moves, namely the bishop (two diagonal moves) and the anassa (one horizontal or vertical move and one diagonal move), placed on a standard square chessboard. Additionally, we obtain explicit expressions for the corresponding quasi-polynomial coefficients. The recurrences are derived by analyzing how nonattacking configurations attack a specific subset of board squares, employing a bijective argument to establish the relations. The main results are simplifications of known expressions for the bishop and a general counting formula for the anassa.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.