Logic Masters Deutschland e.V.

The Human Calculator

(Eingestellt am 2. Juni 2024, 21:58 Uhr von filuta)

I promised myself I'm done with this kind of puzzles but I just couldn't resist making this tribute the wonderful Landvermessung U-Bahn puzzles by The Book Wyrm. I am really grateful to her for not just the inspiration, but also for sticking with me through several (often broken) iterations of this puzzle until it was finally done. Many thanks also to zzw and ctc discord server member kays for trying the puzzle out and for their feedback.

Enjoy!

Rules:

-Draw some lines connecting centres of adjacent cells to make a network without dead ends.
-No cell with a number clue is part of the network, the number indicates how many distinct loops within the network have the clued cell in their interior (only loops that don't intersect themselves are counted). The symbol '..' can represent any number of digits including none.
-The letter clues (L,I,T,X) outside the grid show the single most frequent shape within the corresponding row or column. The symbols '?!' indicate there is no single most frequent shape in that row/column.


penpa+ link
sudokupad link

Lösungscode: The corresponding shape for each cell in row 7 (L,I,T,X or E for empty cell). Then then same for column 10.

Zuletzt geändert am 16. Juni 2024, 11:12 Uhr

Gelöst von The Book Wyrm, jessica6, Silverstep
Komplette Liste

Kommentare

Zuletzt geändert am 20. Juni 2024, 19:07 Uhr

am 20. Juni 2024, 18:59 Uhr von jessica6
Hooray!
After all that trouble, I had only two solution candidates left. You don't expect me to do the final calculations in the end, do you?

am 16. Juni 2024, 11:12 Uhr von filuta
Reformulated the rules.

Zuletzt geändert am 16. Juni 2024, 11:11 Uhr

am 16. Juni 2024, 10:28 Uhr von jessica6
Is a loop considered crossing itself if it makes a turn at a cross, and later another turn at the same cross, essentially touching but not crossing itself?
.........
It is, not intersecting itself would probably be a better wording.

Schwierigkeit:5
Bewertung:N/A
Gelöst:3 mal
Beobachtet:2 mal
ID:000ICB

Neu

Lösung abgeben

Lösungscode:

Anmelden