Zucca's Challenge Problem for Polyiamonds

Livio Zucca's Tetrominoes Challenge Page challenges you to find plane regions that can be tiled with each of a given set of tetrominoes and no others. Here I show solutions to the corresponding problem for tetriamonds and pentiamonds. If you have a smaller solution for any of these sets, please let me know.

For extrominoes (trikings), see Zucca's Challenge Problem for Extrominoes. For tetrahexes, see Zucca's Challenge Problem for Tetrahexes. For polypents, see Zucca's Challenge Problem for Polypents.

  • Tetriamonds
  • Pentiamonds
  • Tetriamonds

    Pentiamonds

    Last revised 2012-05-19.


    Back to Multiple Compatibility.
    Back to Polyform Compatibility.
    Back to Polyform Curiosities.
    Col. George Sicherman [ HOME | MAIL ]