An anonymous reader writes: Sudoku is a number puzzle consisting of a 9 x 9 grid in which some cells contain clues in the form of digits from 1 to 9. The solver's jobs is to ll in the remaining cells so that each row, column and 3×3 box in the grid contains all nine digits.
There's another unwritten rule: the puzzle must have only one solution. So grids cannot contain just a few starting clues.
It's easy to see why. A grid with 7 clues cannot have a unique answer because the two missing digits can always be interchanged in any solution. A similar argument explains why grids with fewer clues must also have multiple solutions.
But it's not so easy to see why a grid with 8 clues cannot have a unique solution, or indeed one with 9 or more clues.
That raises an interesting question for mathematicians: what is the minimum number of Sudoku clues that produces a unique answer?
This is a question that has hung heavy over the Sudoku community, not least because they think they know the answer. Sudoku fanatics have found numerous examples of grids with 17 clues that have a unique solution but they have never found one with 16 clues.
That suggests the minimum number is 17 but nobody has been able to prove that there isn't a 16-clue solution lurking somewhere in puzzle space.
Enter Gary McGuire and pals at University College Dublin. These guys have solved the problem using the tried and trusted mathematical technique of sheer brute force.