Hacker News new | past | comments | ask | show | jobs | submit login

If anyone is interested in exactly how to solve Sudoku via integer programming see the following: http://www.mathworks.com.au/help/optim/ug/solve-sudoku-puzzl...

It's a very elegant solution.




Mixed-integer and 0-1 integer programming problems are NP-complete in the general case. You might as well use the backtracking approach which in my opinion is much more elegant.


One thing often missing from these types of solutions (this one included) is that it's extremely easy to generalize them beyond the 9x9 case.




Consider applying for YC's Spring batch! Applications are open till Feb 11.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: