View previous topic :: View next topic |
Author |
Message |
| sam
| Joined: 09 Apr 2006 | Posts: 2 | : | | Items |
|
Posted: Sun Apr 09, 2006 6:42 am Post subject: Have simple but fast method??? |
|
|
After i saw most of the creation and solving of sudoku puzzle, the techniques and method are almost the same, is any one can have a more simple but fast method to do this? |
|
Back to top |
|
|
| Moritz
| Joined: 07 Oct 2006 | Posts: 23 | : | Location: Edinburgh, Scotland | Items |
|
Posted: Sat Oct 07, 2006 10:22 am Post subject: Re: Have simple but fast method??? |
|
|
Hi,
sam wrote: | After i saw most of the creation and solving of sudoku puzzle, the techniques and method are almost the same |
Usually the technique that is the easiest to implement is backtracking, and in most cases it's the slowest as well.
If there was a very simple method Sudoku solving wouldn't be such a enjoyable occupation ;-)
Moritz |
|
Back to top |
|
|
| shekhang
| Joined: 12 Nov 2006 | Posts: 3 | : | | Items |
|
Posted: Sun Nov 12, 2006 8:25 am Post subject: |
|
|
yup
as i am doing my project for the public exam., i found that the easiest method is backtracking.
by this, we can ensure that we can get the correct answer though the time needed is a bit more
about other algorithm, i hv heard that someone use SETS to do it... |
|
Back to top |
|
|
| abangser
| Joined: 25 Nov 2006 | Posts: 7 | : | | Items |
|
Posted: Thu Aug 30, 2007 6:02 pm Post subject: |
|
|
I believe all advanced techniques reduce to two: 1) Finding that only one candidate in a given cell does not lead to a logical conflict (using basic techniques), and 2) finding that all candidates in a given cell lead (again using only basic techniques) to the same elimination of a candidate elsewhere on the board.
I personally do not consider this to be guessing. Rather, it is a method for the computer to identify the equivalent of chains, wings, etc. In fact, if I reach an 81-cell solution while testing a candidate (in my excel solver) I ignore that result completely. |
|
Back to top |
|
|
|