- Code: Select all
+-------+-------+-------+
| . . . | . . . | . . 6 |
| . . . | . . . | . . . |
| . . . | 5 . . | 8 . . |
+-------+-------+-------+
| . . . | . . . | . . . |
| . 3 8 | 1 2 . | . . . |
| . . 4 | . . . | . . . |
+-------+-------+-------+
| . . . | . . 1 | . . . |
| 5 . 3 | . . . | . . 4 |
| . . . | 9 . . | . . . |
+-------+-------+-------+
The Manhattan Cocktail is a puzzle that combines the standard Sudoku rules with extra constraints involving the Manhattan Distance measure. The MD between any two cells is simply the sum of the row and column differences.
The Manhattan constraints are simply stated: if (R, C) = D, then D can not occur in any cell that is (Manhattan) distance D from (R, C).
The set of cells at a fixed MD from a given cell form a diamond around the given cell. For D = 3, 4, 5 in the central square, the potential eliminations for D are shown below (the corners of the diamond are included for clarity, they do not give any extra additional eliminations, of course):
- Code: Select all
. . . . . . . . . . . . . X . . . . . . . X . X . . .
. . . . X . . . . . . . X . X . . . . . X . . . X . .
. . . X . X . . . . . X . . . X . . . X . . . . . X .
. . X . . . X . . . X . . . . . X . X . . . . . . . X
. X . . 3 . . X . X . . . 4 . . . X . . . . 5 . . . .
. . X . . . X . . . X . . . . . X . X . . . . . . . X
. . . X . X . . . . . X . . . X . . . X . . . . . X .
. . . . X . . . . . . . X . X . . . . . X . . . X . .
. . . . . . . . . . . . . X . . . . . . . X . X . . .
Some general observations:
- 1's are unrestricted, since the minimum MD between any cell pair is 2
- for 2's, the MD constraint is effectively an "anti-King" constraint
- for 3's, the MD constraint is effectively an "anti-Knight" constraint
- the sample puzzle given above is singles-only, and there is a hidden single in row 5 for value 4
Solution: Show