Japanische Bahnhöfe, Teil 2
(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.)
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.
Comments
on 19. August 2023, 18:39 by KNT
fantastic!
on 27. May 2023, 06:43 by Agent
Sehr schönes Rätsel und Regelwerk!
on 15. June 2020, 18:06 by Joe Average
Großartig. Das erste der Serie sträubt sich noch, aber ich habe mich trotzdem an das hier rangetraut... hat Spaß gemacht!
on 8. June 2020, 10:05 by Alex
Ganz tolles Werk!
on 30. May 2020, 09:27 by r45
Super, das ging bei mir im Gegensatz zum ersten schon flüssig durch. Sehr schöner Lösungsweg!
on 29. May 2020, 15:56 by Statistica
Klasse. Aber ans Letzte traue ich mich jetzt nicht mehr ;-)
on 28. May 2020, 23:48 by ibag
Ganz toll!!! Aber phew - was einen da wohl noch erwartet?
