Logic Masters Deutschland e.V.

The Human Calculator

(Published on 2. June 2024, 21:58 by 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

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

Last changed on on 16. June 2024, 11:12

Solved by The Book Wyrm, jessica6, Silverstep
Full list

Comments

Last changed on 20. June 2024, 19:07

on 20. June 2024, 18:59 by 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?

on 16. June 2024, 11:12 by filuta
Reformulated the rules.

Last changed on 16. June 2024, 11:11

on 16. June 2024, 10:28 by 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.

Difficulty:5
Rating:N/A
Solved:3 times
Observed:2 times
ID:000ICB

New

Enter solution

Solution code:

Login