Re: AN EASY WAY TO SOLVE SUDOKU PUZZLES
- From: Michael Press <rubrum@xxxxxxxxxxx>
- Date: Sat, 30 Jun 2007 22:00:44 GMT
In article
<1183177242.947489.315170@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>
,
Proginoskes <CCHeckman@xxxxxxxxx> wrote:
On Jun 29, 11:19 am, gwh <ghug...@xxxxxxx> wrote:
On Jun 29, 9:24 am, Steven Siew <sie...@xxxxxx> wrote:
On Jun 29, 2:57 pm, "rajani...@xxxxxxxxxxx" <rajani...@xxxxxxxxxxx>
wrote:
Sudoku puzzles are quite intriguing generally involving number
matrices. A general way is presented here to solve methodologically.
At first have set of numbers possible in each empty cell of matrix
according to Sudoku rules that unique numbers 0 to 9 will have to be
at each unfilled segments of Sudoku. Here we are trying to have sets
of numbers satisfying the rules that they aren't either in the row or
column or a specific matrix segment. Obtaining listing all the numbers
sets are quite easy such as (3,4,5)....etc for each cell. Once sets
are obtained for all empty cells then it is a matter of carefully
eliminating all non-possible numbers coming up with the one solution
with Sudoku puzzle. This method has generality for any Sudoku puzzle.
Have you actually tested this by writting a computer program and
entering
a real life sudoku puzzle or are you just talking out of your arse?
I can speak because I have written a sudoku solving program in python
last year.
I think the OP is new to Sudoku solving, as the logic he proposes is
necessary but not sufficient as a general method. It will suffice on
only the very simplest of the puzzles which I've seen. As you and, I
am sure, many, many others have done, I, too, have written a Sudoku
solving program which so far has worked on all the puzzles on which
I've tried it. It uses four logic steps, of which the procedure
proposed by Mr. Rajani... is only the first, and most simple.
Writing a Sudoku program is easy. First, you generate the list of all
possible Sudoku grids, and store it as part of the program. Then the
program compares the input Sudoku to the ones in the list until it
finds one that matches the input (for all the filled-in squares) and
outputs it.
Not lazy enough. Generate the grids on the fly.
Faster too, and less code.
--
Michael Press
.
- Prev by Date: Re: Object Convolution
- Next by Date: Re: The Reason for the Slow Evolutionary Progress of Chimpanzee Physicists
- Previous by thread: Re: Searching for Happiness ?
- Next by thread: Re: The Reason for the Slow Evolutionary Progress of Chimpanzee Physicists
- Index(es):
Relevant Pages
|
