A Dynamic Puzzle

From MaRDI portal





The author discusses an interesting problem about a dynamic puzzle. Given an \(n\times m\) rectangle partioned into \(nm\) squares, successively cover a set of uncovered squares by a translate of the set of squares covered in the previous step. In the initial step, exactly one square is covered. The question is how many squares can be covered this way. There are variants of the problem for the \(n\times m\) torus and analogues in higher dimensions. Some partial results are discussed.











This page was built for publication: A Dynamic Puzzle

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