School of Mathematical & Statistical Sciences Faculty Publications
Document Type
Article
Publication Date
6-2026
Abstract
Chess has inspired an abundance of mathematical problems, especially in combinatorics and probability. One such problem, initially studied by Miller, Sheng, and Turek, considers the proportion of safe spaces when randomly placing n rooks on an πΓπ chess board. They show that as n approaches infinity, the proportion of safe spaces converges to 1/π2. We first generalize their results to bishops and queens. This problem is significantly more interesting and difficult; while a rook attacks the same number of spaces regardless of its position, this is not so for bishops and queens. We prove that the proportion of safe spaces on an πΓπ board with n randomly placed bishops converges to 2/π2, while it converges to 2/π4 for n randomly placed queens. We then extend this result to the k-dimensional chessboard and consider two natural extensions. We define line-pieces to attack along lines, and define hyper-pieces attack along (πβ1)-dimensional hyper-planes. We provide exact results for line-rooks and hyper-rooks for arbitrary k, and give bounds and initial observations for line-bishops, line-queens, hyper-bishops and hyper-queens.
Recommended Citation
Cashman, Caroline, Joseph Cooper, Raul Marquez, Steven J. Miller, and Jenna Shuffelton. "Hyper-Bishops, Hyper-Rooks, and Hyper-Queens: Percentage of Safe Squares on Higher Dimensional Chess Boards." Mathematics Magazine(2026): 1-13.Β https://doi.org/10.1080/0025570X.2026.2630703
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Publication Title
Mathematics Magazine
DOI
10.1080/0025570X.2026.2630703

Comments
Student publication. Original published version available atΒ https://doi.org/10.1080/0025570X.2026.2630703