0

In packing problem "L's in Tans" as presented on https://erich-friedman.github.io/packing/Lintan/ . I don't understand how is some cases trivial and others are not. For example case $n=4$ isn't trivial but $n=8$ is trivial.

Can someone give me prove or directions how to prove trivial cases?

b_jonas
  • 300
  • 3
  • 17
Tutan Kamon
  • 436
  • 2
  • 10
  • You may want to ask the author how he classifies these. – Hagen von Eitzen Jul 06 '20 at 09:24
  • @HagenvonEitzen I sent mail but didn't get answer – Tutan Kamon Jul 06 '20 at 09:26
  • One thing common to all solutions labelled "trivial" (but also the $n=4$ solution) is that the L's forma a "pixelated" (or quantisized) version of the tan - up to possibly one missing pixel. Perhaps it is not hard to show that in such a case the tan is minimal? But again, that would make $n=4$ trivial - but perhaps this trivial solution was unknown for a long time – Hagen von Eitzen Jul 06 '20 at 09:33
  • Oh, wait! These are only the smallest known tans; so I woould tend to call a solution trivial if it consists of a "pixelation" as just described. – Hagen von Eitzen Jul 06 '20 at 09:40
  • @HagenvonEitzen I think that too, asked question just to see if someone have different opinion – Tutan Kamon Jul 06 '20 at 11:06

0 Answers0