Logic Masters Deutschland e.V.

LM-Übungsrätsel: Japanische Höhle

(Published on 27. June 2026, 15:47 by CJK)

This puzzle has been constructed as a preparation puzzle for this years LM.

Rules: Blacken some cells and write a digit from 1 to 6 in every remaining cell, such that no digit appears multiple times per row or column. Numbers outside the grid indicate the sums of connected digits in that row or column in the correct order. In every row, either all or no outside numbers are given. Questions marks can be any number.

Cells with digits form one orthogonally connected component and all blackende cells are orthogonally connected to the grid border. Yellow cells are digit cells. A digit in a yellow cell indicates the total number of digit cells seen in vertical and horizontal direction until the next blackened cell or the grid border. The yellow cell itself is included in this count. All possible yellow cells are given.

Link for online solving

Solution code: Row 4 and column 8: X for a blackened cell


Solved by Agent, ibag, Piatato, uvo, KNT, lupo, Jesper, Greg, h5663454, tuace, Snookerfan, Playmaker6174, Zzzyxas, marcmees, AnnaTh, JustinTucker, misko, ffricke, r45, ns08
Full list

Comments

on 30. June 2026, 18:37 by AnnaTh
Toll! Zu Recht Deutscher Meister! Noch mal herzlichen Glückwunsch zum Titel!

on 29. June 2026, 10:47 by Playmaker6174
Genuinely blown away by the setting of this one. What an impressive setting with such miraculous flow throughout, especially how the negative constraint worked :o

on 28. June 2026, 12:07 by Snookerfan
Superb! Incredible setting, the negative constraint is needed many times and in very clever ways. So many great moments during the solve. Masterpiece, thanks

on 28. June 2026, 00:35 by lupo
Toll!

on 27. June 2026, 21:34 by KNT
impressive construction! thanks

on 27. June 2026, 20:45 by Piatato
Great fun!

on 27. June 2026, 19:47 by ibag
Wie schön! Dafür hat sich der Stress doch gelohnt ... ;-)

Difficulty:4
Rating:96 %
Solved:20 times
Observed:0 times
ID:000THR

Puzzle variant Online solving tool

Enter solution

Solution code:

Login