A cool algorithm to check a Sudoku field?
You need to check for all the constraints of Sudoku :
- check the sum on each row
- check the sum on each column
- check for sum on each box
- check for duplicate numbers on each row
- check for duplicate numbers on each column
- check for duplicate numbers on each box
that's 6 checks altogether.. using a brute force approach.
Some sort of mathematical optimization can be used if you know the size of the board (ie 3x3 or 9x9)
Edit: explanation for the sum constraint: Checking for the sum first (and stoping if the sum is not 45) is much faster (and simpler) than checking for duplicates. It provides an easy way of discarding a wrong solution.
Peter Norvig has a great article on solving sudoku puzzles (with python),
https://norvig.com/sudoku.html
Maybe it's too much for what you want to do, but it's a great read anyway