Logic Masters Deutschland e.V.

Into the Dungeon

(Eingestellt am 15. Mai 2024, 15:00 Uhr von Corvin)

Normal Sudoku rules apply.

Help the hero on his quest to conquer all dungeons and defeat the final boss!

Draw an orthogonal path that doesn't fork. It starts at the given 1 and ends at the given 9. If a part of the path is not in a dungeon that part is not allowed to touch another part of itself orthogonally that's also outside of a dungeon.

Dungeons (Killer Cages): Cages are Dungeons and digits inside sum to the value shown in the upper left corner of the cage (if given) and do not repeat inside the cage. The hero must traverse the dungeon completely before exiting. The last cell the hero touches is the boss. The boss is the highest digit in the dungeon. Each boss is a unique digit.

Maximum Cell: The digit inside the purple cell is greater than all orthogonal cells around it.

Odd/Even: Cells containing a gray square are even, cells containing a gray circle are odd. The hero can't cross over those cells and the digit inside shows the number of adjacent cells that are outside a Dungeon on the heroes path.

Play on SudokuPad by Sven Neumann

Lösungscode: All digits on the 6th row, left to right

Zuletzt geändert am 16. Mai 2024, 10:24 Uhr

Gelöst von Maxima, sanabas, SirMoose, styngerr, Smartacus, Tamuha, vfig, EFlatMinor, LuanMerlin
Komplette Liste


am 17. Mai 2024, 15:55 Uhr von styngerr
Beautiful puzzle! I was stuck until you clarified for @Dragonheart91 that odd/evens include diagonals, might've just been an oversight on my part though. Otherwise, had a wonderful time solving it, and I'm not a huge fan of pathing puzzles!

am 17. Mai 2024, 08:11 Uhr von redovermars
Very good game! I like this idea very much, and I hope to have more puzzles like this in the future!

am 17. Mai 2024, 01:23 Uhr von Corvin
@Dragonheart91 Yes, the odd/even cells look for both diagonal and orthogonal, that's why it's not specified as orthogonal only.

am 17. Mai 2024, 00:57 Uhr von Dragonheart91
Can you clarify that the odd/even cells count the number of adjacent cells in both diagonal and orthogonal directions? I am assuming they count diagonal because you specified orthogonal only in every other rule.

am 17. Mai 2024, 00:50 Uhr von Corvin
@Dragonheart91 It wasn't solvable. There were also 2 more problems in that version that are fixed in this one.

am 17. Mai 2024, 00:25 Uhr von Dragonheart91
@corvin the change you just made to the puzzle switching the gray circle in box 5 with a gray square in box 1 addresses my problem. Previously there was only a single way to make the path pass box 5 and that made one of the two cages in Box 4 impossible to complete. Was the puzzle solvable in the previous version?

am 16. Mai 2024, 16:08 Uhr von sanabas
Good fun, though another puzzle where I didn't pay attention to all the rules. Did most of it, then ran out of logic and thought there were multiple solutions, because I'd missed the rule about circles/squares showing how many surrounding cells were on the path. Proving that one option for cage order broke those squares/circles turned out to be the trickiest part of the puzzle for me.

am 16. Mai 2024, 10:37 Uhr von Corvin
@redovermars Just realized that I uploaded the alpha version, this one is 100% the right one.
@Dragonheart91 The line only sees other lines outside the dungeon for the orthogonal touch check. When you exit cage 11 from the left side you can just enter the unlabeled box and then escape from the top.

am 16. Mai 2024, 10:24 Uhr von Corvin
Just saw from the comments that I uploaded the wrong version, sorry for the confusion.

am 16. Mai 2024, 05:21 Uhr von redovermars
The gray circle in box 5, is that correct?

am 16. Mai 2024, 03:34 Uhr von Dragonheart91
I am endlessly stuck in Box 4. I cannot find a way to draw the line that doesn't eliminate all possibilities for the 3 size unlabeled cage in box 4.

am 15. Mai 2024, 15:04 Uhr von Corvin
Fixed some spelling errors.

am 15. Mai 2024, 15:02 Uhr von Corvin
Fixed the link not working.

Gelöst:9 mal
Beobachtet:2 mal


Lösung abgeben