On 2/13/06, Benjamin Boksa <benjamin(_at_)boksa(_dot_)de> wrote:
Wikipedia has some hints on that: http://en.wikipedia.org/wiki/
Sudoku#Computer_solutions
Backtracking should be quite simple to implement. A highly efficient
way seems to be Donald Knuth's Dancing Links Algorithm (I did not
look at it so far).
The reason why this is so hard with XSLT is because you can't update
variables, which rules out Backtracking. Maintaining the "state" of
the grid is the hard part - the technique on determining which number
goes where should be straightforward after that.
--~------------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail: <mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--