X-sudoku challenge (OT)
- From: "Michael Metcalf" <michaelmetcalf@xxxxxxxxxxxxxx>
- Date: Tue, 28 Feb 2006 22:21:21 GMT
There was a thread a little while ago concerning Fortran-generated
sudokus. I have now tuned my program to generate X-sudokus, in which each
diagonal also has the constraint that each of the digits 1-9 must appear
once. The one below has only 15 start values. Fame for the first correct
solution? No guessing required.
Regards,
Mike Metcalf
P.S. A standard solver will find that the sudoku has many solutions. Only
one is an x-sudoku.
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 6 0 0 0 0
0 1 0 4 0 8 0 0 6
9 0 0 3 0 0 0 0 0
0 0 0 0 9 0 5 0 0
0 6 1 0 0 0 0 0 3
0 4 0 0 0 2 0 0 7
.
- Prev by Date: Re: Python for Fortran programmers
- Previous by thread: get "undefined reference" with routines contained in a module
- Index(es):
Relevant Pages
|
|
