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.

Comments

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

Publication Title

Mathematics Magazine

DOI

10.1080/0025570X.2026.2630703

Included in

Mathematics Commons

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.