Sudoku: Perbezaan antara semakan

A highly efficient way of solving such constraint problems is the [[Dancing Links]] Algorithm, by [[Donald Knuth]]. This method can be directly applied to solving ''Sudoku'' problems, counting all possible solutions for most puzzles in milliseconds. This is the method now preferred by many ''Sudoku'' programmers, mainly by virtue of its speed. A very fast solver is usually required for most trial-and-error puzzle-creation algorithms.

--->

== Taraf kesukaran ==