Carcul wrote:[r3c9]=7=[r3c1]-7-[r4c1]-2-[r4c9]-9-[r3c9],
=> r3c9<>9 solving the puzzle.
Even simpler is this XY-wing:
-7-[r3c1]-1-[r3c5]-9-[r4c5]-7-,
=> r4c1<>7 solving the puzzle.
- Code: Select all
*-------------------------------------------------------------------*
| 13678 78 67 | 19 234 23 | 49 79 5 |
| 13 2 9 | 5 34 7 | 6 8 14 |
|#17 4 5 | 8 #19 6 | 3 2 179 |
|---------------------+--------------------+------------------------|
|*27 6 8 | 3 #79 1 | 5 4 29 |
| 4 1 27 | 79 68 5 | 29 36 368 |
| 5 9 3 | 2 68 4 | 7 1 68 |
|---------------------+--------------------+------------------------|
| 279 3 4 | 6 27 8 | 1 5 279 |
| 267 57 1 | 4 2357 9 | 8 367 2367 |
| 26789 578 267 | 17 12357 23 | 249 3679 234679 |
*-------------------------------------------------------------------*
Carcul wrote:Forcing chains often provide shorter solutions. In fact, if I were Finnish I would say that solving this puzzle without forcing chains would be "kiivetä perse edellä puuhun".
In general I would agree to this observation - a few hard steps can often replace several less hard steps. But would like to add: Sometimes it can be a challenge to pick techniques that immediately solve the puzzle. There are many blind paths - they don't hurt, they "waste" time, but they might lead us through beautiful landscape. When alternative short paths are available, it's also a challenge to select the simplest of those paths.