A Dynamic Puzzle (Q3984343)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 26085
Language Label Description Also known as
default for all languages
No label defined
    English
    A Dynamic Puzzle
    scientific article; zbMATH DE number 26085

      Statements

      A Dynamic Puzzle (English)
      0 references
      0 references
      27 June 1992
      0 references
      dynamic puzzle
      0 references
      rectangle
      0 references
      squares
      0 references
      torus
      0 references
      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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references