Originally Posted by
Apocalypse
I assumed ultimately that that wouldn't be needed because that's more of a sanity check, but I will look through this thread, thanks
It's not a sanity check at all... it's a rule.
Code:
1 2 3 | 4 5 6 | 7 8 9
2 3 4 | 5 6 7 | 8 9 1
3 4 5 | 6 7 8 | 9 1 2
---------------------
4 5 6 | 7 8 9 | 1 2 3
5 6 7 | 8 9 1 | 2 3 4
6 7 8 | 9 1 2 | 3 4 5
---------------------
7 8 9 | 1 2 3 | 4 5 6
8 9 1 | 2 3 4 | 5 6 7
9 1 2 | 3 4 5 | 6 7 8
By your standards, this is a legal soduku solution. But it's not.
Anyway, here is an old post on a soduku solver, but it may be below you. It speaks in consideration of how to handle your 3x3 boxes.
If you're looking to make a soduku solver, you should consider writing the already known logic algorithms to your program. There a many of them already discovered. You can find most of them here and another great site here.