Sudokulogician series
It had to be here! OK, you know how it goes, but can you say it in logic?
Complete by putting one of the numbers 1..9 in each place, so that each row, each column and each of the nine 3×3 squares contains exactly one occurrence of each number.
| 6 | 8 | 4 | 1 | 7 | ||||
| 8 | 5 | 3 | ||||||
| 2 | 6 | 8 | 9 | 4 | ||||
| 7 | 9 | |||||||
| 5 | 1 | 6 | 3 | 2 | ||||
| 4 | 6 | 1 | ||||||
| 3 | 2 | 7 | 6 | 9 | ||||
Representing the fact that each of the 3×3 squares contains every value (i.e. contains no duplicate values) takes a bit of thought, because multiplication is not one of the integer operations available. There are many ways to do it, not all of them equally efficient. Of course, your version should run in reasonable time!
Solver
Auto Parser Results
No errors found.