"be consistent" | |
PerlMonks |
Re^2: Golf: Sudoku solvingby erroneousBollock (Curate) |
on Nov 12, 2007 at 03:40 UTC ( [id://650211]=note: print w/replies, xml ) | Need Help?? |
I'm pretty sure you're mistaken. Sudoku is a simple constraint resolution problem. The static constraints describe the rules of the game. The dynamic constraints are specified by the initial state of the board. You seem to be implying that for some initial state (a partially filled board), there'll be only one correct solution (filled board).I'm quite sure that's not the case. It's surely the case that for some problems where the board is mostly filled, that there is only one correct solution; I'd need to see a damn nifty proof to believe that is the case for all conceivable (and valid) starting states. -David
In Section
Meditations
|
|