Fountain Sudoku, Var.2
(Eingestellt am 25. März 2021, 09:12 Uhr von gjchangmu)
For each of ALL the cells, the following rule applies:
Assuming that the cell contains value N. There must be at least one path that:
(1) starts at the cell (inclusive);
(2) travels in a straight line horizontally or vertically and takes no turns;
(3) has a total length of N;
(4) is allowed to travel past grid border;
(5) all the values along the path must be not greater than N.
Following is an example, with paths starting from each of the 3's or 5's as examples illustrated:
The problem:
Lösungscode: row 6, followed by column 8.
Kommentare
am 5. April 2021, 03:17 Uhr von gjchangmu
add sudoku tag
am 1. April 2021, 02:51 Uhr von gjchangmu
I guess this puzzle is not very interesting, but just in case that it may also be too difficult, here is a spoiler:
--- spoiler alert ---
- one of the candidates in r3c3 could be easily ruled out;
- there is a hidden pair in the upper right box;
- r3c9 could not be 7, or else any candidate in r3c7 is obviously not possible (note where 5 could be in column 7);
after this the puzzle should be much easier.
am 25. März 2021, 09:20 Uhr von gjchangmu
A note: if you want more challenge, consider dropping the 3 in the middle before staring. After dropping the 3, my program is still able to logically solve the problem, but a few of the logic steps might be too hard (or not, I don't know as I'm not as good as you professionals).
