JPF's puzzle:
In multi solution puzzles, any technique w/o uniqueness assumption is valid, notably basics, AIC's and ALS's:
- Code: Select all
+-------------------+----------------------+-----------------------+
| 7 1 2 | 3 4 5 | 6 89 89 |
| 5 3 68 | 1269 128 689 | 7 124 124 |
| 9 4 68 | 126 1278 678 | 5 123 123 |
+-------------------+----------------------+-----------------------+
| 134 7 5 | 8 9 346 | 2 146 146 |
| 2 9 34 | 456 357 1 | 8 4567 4567 |
| 8 6 14 | 245 257 47 | 3 14579 14579 |
+-------------------+----------------------+-----------------------+
| 36 5 7 | 19 138 389 | 4 2368 2368 |
| 346 8 9 | 45 35 2 | 1 367 367 |
| 134 2 134 | 7 6 348 | 9 358 358 |
+-------------------+----------------------+-----------------------+
(3)r5c3 = r9c3 - (3=64)r78c1 - (4=53)r89c45 => -3 r5c5; lcls to 63 solved cells (@ r123456789c1234567)
- Code: Select all
+-----------------+-----------------+-----------------+
| 7 1 2 | 3 4 5 | 6 89 89 |
| 5 3 8 | 9 1 6 | 7 24 24 |
| 9 4 6 | 2 8 7 | 5 13 13 |
+-----------------+-----------------+-----------------+
| 4 7 5 | 8 9 3 | 2 16 16 |
| 2 9 3 | 6 7 1 | 8 45 45 |
| 8 6 1 | 5 2 4 | 3 79 79 |
+-----------------+-----------------+-----------------+
| 6 5 7 | 1 3 9 | 4 28 28 |
| 3 8 9 | 4 5 2 | 1 67 67 |
| 1 2 4 | 7 6 8 | 9 35 35 |
+-----------------+-----------------+-----------------+
The two solutions of the BUG in c89 are then trivial.