Japanische Bahnhöfe, Teil 1
(Published on 27. May 2020, 13:00 by pirx)
Shade some cells in the diagram black and put digits from the indicated range 0-N into the other cells.
- No number may appear more than once in every row or column.
- The numbers on the left side and above the diagram give the sum of connected digits (without blackened cells in between) in the correct order. Single digits are also given.
- For some rows and columns the hints are missing at all; when hints are given they are complete.
- Some of the given numbers outside the grid are replaced by question marks; one question mark represents a one-digit number, two question marks a two-digit number.
Draw a single closed loop in the grid, going only horizontally and vertically, and connecting the centers of adjacent cells.
- The loop must use each black cell exactly once.
- The loop must go straight through numbers.
- Exactly N numbers (except "0") are stations and have to be used in the sequence from 1...N. The loop must not go through other numbers except "0".
- The loop has to cross itself exactly at cells that contain a "0". (A "0" is not a station, and can be used at any position in the loop, even one after another.)
Puzzle:
Solution code:
For every row from top to bottom enter the number of cells, in which the loop turns.
Then the marked rows from left to right; use "s" for shaded cells.
The solution code for the example would be "22222,24sss".
Comments
on 7. September 2024, 09:24 by wazdra
I've made a basic link for the puzzle (no solution checking, I don't know how to do that...): https://tinyurl.com/26ndnvfl
on 30. May 2020, 11:07 by pirx
Die Schwierigkeit dieser Variante habe ich wohl unterschätzt - passiert mir ja nicht zum ersten Mal. Einige ungewohnte, variantentypische Überlegungen braucht man zum Lösen schon.
Zu meiner Entlastung: Diese Teile (auch 2 und 3) waren relativ problemlos zu konstruieren.
on 29. May 2020, 07:40 by r45
Musste ich mehrmals wieder weglegen, weil ich eine Regel nicht gespeichert hatte. Hat aber super viel Spaß gemacht. Jetzt freue ich mich auf die Nummer 2.
on 27. May 2020, 22:19 by ibag
Oh ja, ganz schön schwierig. Natürlich auch ganz schön schön. ;-)
on 27. May 2020, 22:07 by Statistica
Geht logisch durch. Aber wenn der erste schon so schwierig ist, was wird da noch kommen... ;-)
