An \(n\)-dimensional version of Steinhaus' chessboard theorem (Q2469575)

The Steinhaus chessboard theorem was formulated in this way: Let some segments of the chessboard be mined. Assume that the king cannot go across the chessboard from the left edge to the right one without meeting a mined square. The rook can go from the upper edge to the lower one moving exclusively on mined segments. In this interesting paper the authors prove an \(n\)-dimensional version of the Steinhaus theorem and as a consequence they obtain a classical result of Poincaré which is equivalent to the Brouwer fixed point theorem.