Art gallery problem with rook and queen vision
Hannah Alpert, \'Erika Rold\'an

TL;DR
This paper investigates the minimum number of rooks and queens needed to guard all squares of a polyomino, establishing bounds, NP-hardness, and extending results to higher dimensions.
Contribution
It provides tight bounds for guarding polyominoes with rooks and queens, proves NP-hardness of the minimum guard problem, and extends results to d-dimensional polycubes.
Findings
Floor(n/2) rooks suffice for guarding polyominoes with n tiles.
Floor(n/3) queens suffice for guarding polyominoes with n tiles.
Finding the minimum number of guards is NP-hard.
Abstract
How many chess rooks or queens does it take to guard all the squares of a given polyomino, the union of square tiles from a square grid? This question is a version of the art gallery problem in which the guards can "see" whichever squares the rook or queen attacks. We show that floor(n/2) rooks or floor(n/3) queens are sufficient and sometimes necessary to guard a polyomino with n tiles. We also prove that finding the minimum number of rooks or the minimum number of queens needed to guard a polyomino is NP-hard. These results also apply to d-dimensional rooks and queens on d-dimensional polycubes. We also use bipartite matching theorems to describe sets of non-attacking rooks on polyominoes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
