Re: [maybe OT] Sudoku: solving method or simply backtrack?
- From: "Pierpaolo BERNARDI" <pierpaolo@xxxxxxxxxxxxx>
- Date: 14 Jun 2006 01:36:28 +0200
On Tue, 13 Jun 2006 19:12:55 +0200, Libra <libraramaANTISPAM@xxxxxxxxx> wrote:
Hello,
I apologize if the subject is off topic, but since I found several
sudoku solvers in Prolog, I thought you can answer this (hope not so
silly) question: suppose to have a sudoku grid partly filled: once you
propagated all the constraints for the empty cells, you can search for a
solution using a backtrack method. My question is: is backtrack the best
method or there is a backtrack-free method?
From what I gather from:
http://www.sudoku.org.uk/PDF/Solving_Sudoku.pdf
the use of backtracking is inevitable (in that article they
call backtracking "ariadne's thread")
Cheers
P.
--
Anything below this line is being added by the newsserver
Inviato da X-Privat.Org - Registrazione gratuita http://www.x-privat.org/join.php
.
- Follow-Ups:
- References:
- Prev by Date: Re: ! and ->
- Next by Date: Re: [maybe OT] Sudoku: solving method or simply backtrack?
- Previous by thread: [maybe OT] Sudoku: solving method or simply backtrack?
- Next by thread: Re: [maybe OT] Sudoku: solving method or simply backtrack?
- Index(es):
