Hacker News new | ask | show | jobs
by sabageti 1472 days ago
How Sudoku is NP-Hard?
1 comments

If you generalise sudoku to a board with sides length, with subsquares with sides length n, then sudoku is no complete.