Well, that's true for unique boards, but if you do the silly generation method of "pick every number from 1 to 9, recurse" then you will end up with 9^81 boards -- unless you do some validation along...
Type: Posts; User: dwks
Well, that's true for unique boards, but if you do the silly generation method of "pick every number from 1 to 9, recurse" then you will end up with 9^81 boards -- unless you do some validation along...
You can see the puzzle solution space as a tree. If you try a '3' here, you go down this branch of the tree; if you try a '4' here, you go down another branch. Probably the vast majority of the...
One easy way you could do the recursion is like this. Maintain just one puzzle[][] array, which is initially filled with the inital values. Then try setting the first unknown element to 1, 2, ..., 9...