|
![](/i/fill.gif) |
Warp wrote:
> If trial-and-error was acceptable in a sudoku, then you could just as
> well give an empty sudoku grid for someone to solve.
I saw a solver someone had written using backtracking in Python (IIRC). It
solved the empty sudoku problem in under a second. :-)
(Obviously, it wasn't a unique solution.)
> The principle in sudoku puzzles is that they can be solved without having
> to guess anything. The chain of required deductions may go very deep in
> the hardest sudokus, but it's always possible to solve it without having
> to guess.
I think you might need some backtracking in the hardest of problems.
--
Darren New, San Diego CA, USA (PST)
"Ouch ouch ouch!"
"What's wrong? Noodles too hot?"
"No, I have Chopstick Tunnel Syndrome."
Post a reply to this message
|
![](/i/fill.gif) |