|Physicist's Algorithm solves optimization problems, plays Sudoku
||[Mar. 9th, 2006|01:33 am]
design. prog. dump.
Does anybody know anything more about this? Particularily of interest is the fact that Sudoku is NP-hard, so this likely has applications to every other NP-hard problem. (Graph colouring == yay!)|
The Wikipedia Article on Sudoku is surprisingly interesting as well.