Art Gallery Problem with Rook Vision

10/25/2018

∙

by   Hannah Alpert, et al.

∙

0

∙

share

We introduce rook visibility, which is a new model of visibility for the art gallery problem when the gallery is a polyomino, the union of square tiles from a square grid. We show that floor(n/2) chess rooks are sufficient and sometimes necessary to guard a polyomino with n tiles. We also prove that finding the minimum number of rooks needed to guard a polyomino is NP-hard.