Logic Masters Deutschland e.V.

Anti-symmetry Fillomino

(Eingestellt am 24. Juli 2023, 01:38 Uhr von tesseralis)

My second puzzle with the "anti-symmetry" constraint first seen in Anti-symmetry hexominous. The ways different sizes of polyominoes interact with symmetry is interesting to me, and I hope I can convey some of that in this puzzle!

Rules

Divide the grid into polyominoes so that polyominoes of the same size don't share an edge. Each cell contains a number equal to its polyomino's size.

Additionally, polyominoes with the same symmetry class cannot share an edge. Examples for symmetry classes.

Solve online on Penpa.

Lösungscode: Numbers in Row 10 followed by Column 10

Zuletzt geändert am 25. Juli 2023, 03:46 Uhr

Gelöst von KNT, Jesper, Christounet, Piatato, jkuo7, ascension, jessica6, lerroyy, tuturitu, SquaringSquirrel, kiwi0710, Joe Average, RoyalJelly, Calesch, puzzler05, Puppy, booteskey
Komplette Liste

Kommentare

Zuletzt geändert am 26. Juli 2023, 23:27 Uhr

am 26. Juli 2023, 21:24 Uhr von jessica6
Is a "2" domino and a straight "3" tromino the same symmetry class? Both have the same symmetries, however one of the symmetry axes of the "2" goes through a grid line while both axes of the "3" don't.
--
yes, for the purposes of this puzzle, they have the same symmetry class

am 26. Juli 2023, 01:46 Uhr von Piatato
Very cool concept! Excellent webpage too :)

am 25. Juli 2023, 08:29 Uhr von Christounet
Very enjoyable puzzle ! Your very complete guide to polyominos symmetry provided the needed help along the way. Easier solve than expected with my lack of knowledge in that domain ! Thanks :)

am 25. Juli 2023, 03:46 Uhr von tesseralis
Update to a new version of the puzzle that fixes a logical leap in the old solution path.

am 24. Juli 2023, 03:40 Uhr von KNT
Really cool puzzle once I discovered your page here: https://minos.tessera.li/symmetry/table

Schwierigkeit:3
Bewertung:94 %
Gelöst:17 mal
Beobachtet:8 mal
ID:000EKP

Dominos Trominos Tetrominos Pentominos Hexominos Polyominos

Lösung abgeben

Lösungscode:

Anmelden