Logic Masters Deutschland e.V.

Anti-symmetry Hexominous

(Eingestellt am 19. Juli 2023, 08:01 Uhr von tesseralis)

This is an older puzzle that I recently revisited and decided to publish, because I feel the logic holds up and I'm planning to make more puzzles with this constraint. Please enjoy!

Rules

Fill the grid with hexominoes (orthogonally-connected regions of 6 cells) such that orthogonally connected hexominoes do not have the same symmetry group (See Wikipedia for more info). Bold edges indicate borders between hexominoes.

Solve online on Penpa.

Lösungscode: For the last two rows of the puzzle, number of cells between each hexomino border from left to right.


Gelöst von nuzzopa, Nylimb, MicroStudy, Grausbert, Torvelo, Lizzy01, Jesper, Dandelo, Piatato, CJK, szabog, PrimeWeasel, polar, jkuo7, uvo, lerroyy, Calesch, Mark Sweep
Komplette Liste

Kommentare

am 21. Juli 2023, 17:08 Uhr von PrimeWeasel
Funky

Zuletzt geändert am 21. Juli 2023, 04:36 Uhr

am 21. Juli 2023, 03:56 Uhr von szabog
Tess, this was very fun to solve. My first time with hexominoes and I enjoyed it very much. Thank you :) And I am waiting for more puzzles with this constraint - you promised! :)
--
you're welcome! Yeah, hexominoes are less popular than their ancestors the pentominoes since there's a lot more of them, but I think the anti-symmetry constraint makes puzzles with them pretty tractable! ~tess

am 20. Juli 2023, 09:16 Uhr von Piatato
Cool puzzle! Surprisingly intuitive :)

Zuletzt geändert am 20. Juli 2023, 09:19 Uhr

am 19. Juli 2023, 10:34 Uhr von MicroStudy
super neat idea
--
yess spread the word of polyomino symmetry constraints

Zuletzt geändert am 19. Juli 2023, 21:56 Uhr

am 19. Juli 2023, 08:51 Uhr von Nylimb
Thanks for the fun puzzle! Also for the Wikipedia link; using the same colors as in the picture there made it easier to visualize the options.
--
heh, those colors are burned into my memory by now -tess

Schwierigkeit:3
Bewertung:93 %
Gelöst:18 mal
Beobachtet:3 mal
ID:000EIK

Rätselvariante Hexominos Polyominos

Lösung abgeben

Lösungscode:

Anmelden