Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

If a Sudoku has one and only one solution, then it is always solvable without guessing or backtracking. It just might not be within the scope of the human brain. There exist (many) configurations where every cell is influenced by every other, so to solve any one cell essentially requires a simultaneous solve of the entire puzzle. There's no theoretical reason a human couldn't do that too; it's a problem simply of computational capacity not fundamental approach.


How would you structure a program to solve such a puzzle without having it generate and test potential solutions along the way?




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

Search: