Mathematical proof for minimum number of clues in sudoku

91 Views Asked by At

There must be at least 17 starting clues in a sudoku to be univocally solved (brute force proof) but is there any mathematical (or if you want, more elegant) proof for this or research paper that tries to address it?