Progressively Missing
(Published on 14. March 2025, 18:56 by NotThatItMatters)
Normal sudoku rules apply.
There are nine Missing cells in the grid, exactly one in each row, column and marked 3x3 box and filled with a complete set of the digits 1-9. The value of a Missing cell is "missing" and it will never be part of a binary constraint.
Binary constraints:
Digits separated by a white dot are consecutive.
Digits separated by a black dot have a 1:2 ratio, meaning one is exactly double the other.
Digits separated by a V must sum to 5. V is the roman numeral for 5.
Digits separated by an X must sum to 10. X is the roman numeral for 10.
Some but not all unambiguous binary constraints are shown. An ambiguous binary constraint is one where two or more binary constraints would be true, and these would never be shown or counted. On the edges between 3x3 grid blocks there are NO binary constraints, either ambiguous or unambiguous.
Every 3x3 box N has N unambiguous binary constraints. Boxes are numbered 1 to 9, from the top left to the bottom right.
Solution code: Give the nine missing digits in order from box 1 to box 9.
