Sudoku
Tom Phoenix
rootbeer at redcat.com
Tue Oct 11 15:40:59 UTC 2005
On 10/11/05, Georg Gollmann <gollmann at zid.tuwien.ac.at> wrote:
> Am 10.10.2005 um 17:07 schrieb Tom Phoenix:
>
> > Unless I missed it, the algorithm is not dealing with several cases
> > necessary for solving the tougher sudoku.
>
> The code is using a brute force recursive search. So it should find
> any solution, it just might take a long time.
I am not yet certain that you're right, but perhaps.
> > Your newspapers probably don't offer the most difficult sudoku that
> > there are.
>
> I would be interested in an example. Any pointers ?
Be sure to print this in a mono-spaced typeface. Enjoy! --Tom Phoenix
| 5 9 7 | 6
+-----------+ +-----------+
2 | | 7
-------+ | | +-------
| | | 5 |
| +---+ |
8 | 4 | | |
+---+-------+ +-------+---+
9 | | 3
+---+-------+ +-------+---+
| | | | 9
| +---+ |
| | | 8 1 |
-------+ | | +-------
2 | | 9
+-----------+ +-----------+
| 8 7 |
More information about the Squeak-dev
mailing list
|