When Rooks Miss: Probability through Chess

Steven J. Miller, Haoyu Sheng, Daniel Turek

A famous (and hard) chess problem asks what is the maximum number of safe squares possible in placing $n$ queens on an $n\times n$ board. We examine related problems from placing $…