Shishi (Ichikara)
(Eingestellt am 20. Dezember 2025, 08:15 Uhr von The Book Wyrm)
Shintaro also gets further credit for testing this puzzle, and suggesting the name.
Note: This puzzle is very difficult, but it can be solved logically.
For easier puzzles with the same ruleset, some introductory puzzles (with an example) can be found here.
Rules:
- Divide the grid into orthogonally connected regions.
A region must contain the numbers from 1 to N once each, where N is the largest number in the region. - Regions may also contain empty cells.
- A ? stands for an unknown number.
Penpa link: Click Here
Lösungscode: For each row of the grid, the number of vertical region borders in that row.
Kommentare
am 18. Juli 2026, 10:58 Uhr von wisty
Jokes aside, this puzzle was incredible and novel and never gave up until the very end. I really enjoyed my time internalizing the implications of the setup, enough that there's an enthusiastic hidden comment about my approach.
am 18. Juli 2026, 10:52 Uhr von wisty
Best U-Bahn ever
am 26. April 2026, 05:25 Uhr von widjo
beautiful
am 23. Dezember 2025, 16:51 Uhr von cyddrdrd
This is purely masterclass!
am 22. Dezember 2025, 05:11 Uhr von MonsieurTRISTE
The fact this puzzle exists is a miracle.
am 21. Dezember 2025, 14:42 Uhr von Andrewsarchus
Brilliant!
am 20. Dezember 2025, 13:00 Uhr von sfushidahardy
Such a cool puzzle! It's different from anything else I've solved.
