Logic Masters Deutschland e.V.

Chapter 2: A mysterious Invitation

(Published on 8. July 2026, 17:44 by The Book Wyrm)


This puzzle exists as part of a series begun by Isaiah, in which setters will create a series of puzzles alongside a story.

Previous Chapter: Click Here

Next Chapter: To be written by Damasosos


After bit of work figuring out the code, you manage to open the package. Inside, you find another note, along with some scraps of paper. You go to look at those, but decide that before you get ahead of yourself, it would be worth reading the note.

“You do not know me, but I have been watching you for some time. Your puzzle-solving skills are of interest to me, for there have been certain . . . events of late where I suspect your talents could be helpful. Things have escalated recently, and so I am giving you an offer to join my team. Now, I am sure you would like to know what I do before accepting, but I am afraid that is classified. Suffice to say, there are more mysteries in this world that you could ever have dreamt of. It will be dangerous, of course, and much of what you learn must be kept secret. This is not an offer to be taken lightly.
Alongside this note are some pieces of a map. I doubt figuring out the location it points to should pose much of a challenge to one such as yourself. Should you choose to accept my offer, I will be waiting there for you when you arrive. If not, then you may simply destroy this message and forget this ever happened.”


Rules:
  • Assemble the 4 grids into a single 14x14 grid, then solve the resulting grid using standard nurimaze rules. The subgrids can be moved and rotated, but not reflected.
  • Nurimaze:
    The grid is divided into tiles. Shade some tiles so that each tile is entirely shaded or unshaded, and no 2x2 square is entirely shaded or unshaded.
    Tiles containing a clue cannot be shaded.
    Unshaded tiles are all orthogonally connected, and form the pathways of a maze, where shaded tiles are the walls. The maze may have branches and dead ends, but it never loops.
    There is exactly one path from S to G which doesn't require backtracking, and it must pass through every circle but not visit any triangles.
Puzzle links:
Main link: Click Here
Blank link for notetaking: Click Here

Solution code: With the solution in the orientation that has the S in the top-left quadrant, give the number of shaded cells in each row.


Solved by isajo4002, Myxo, Bobuardo da Vinci, dogfarts, jennyaa, TalkingFredish, kays, Rickium, CJK, zzw, wisty, sporq
Full list

Comments

on 11. July 2026, 18:30 by wisty
Phenomenal! This was so fun and relatively smooth. Rotating grids in my head was the hardest part.

on 8. July 2026, 20:48 by Myxo
Awesome!

Difficulty:4
Rating:98 %
Solved:12 times
Observed:2 times
ID:000TBE

Puzzle variant Path puzzle Shading puzzle

Enter solution

Solution code:

Login