Piercing the Chessboard

From MaRDI portal



Abstract: We consider the minimum number of lines hn and pn needed to intersect or pierce, respectively, all the cells of the nimesn chessboard. Determining these values can also be interpreted as a strengthening of the classical plank problem for integer points. Using the symmetric plank theorem of K. Ball, we prove that hn=lceilfracn2ceil for each ngeq1. Studying the piercing problem, we show that 0.7nleqpnleqn−1 for ngeq3, where the upper bound is conjectured to be sharp. The lower bound is proven by using the linear programming method, whose limitations are also demonstrated.











This page was built for publication: Piercing the Chessboard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170442)