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).
I hope that helps!
Am 13.02.2006 um 14:01 schrieb andrew welch:
Does one exist?
I've been asked if it's possible to solve a Sudoku puzzle with XSLT,
which I replied "of course"...
I've started to write one myself - its gets pretty hard pretty
quickly, has anyone does this before?
--~------------------------------------------------------------------
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>
--~--
--~------------------------------------------------------------------
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>
--~--