The code in the post is based on depth-first search, which basically is a trial ... | Hacker News

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

		ondrasej on March 26, 2011 \| parent \| context \| favorite \| on: Sudoku Solving The code in the post is based on depth-first search, which basically is a trial and error approach. A well implemented and effective one thanks to constraint propagation, but it is still trial and error. And there are cases, in which backtracking (trial and error) is necessary - at least one of them is documented in the post (the puzzle "hard1" that took 188 seconds).

jules on March 26, 2011 [–]

There is no meaningful difference between trial and error and without trial and error. It makes this no less of an algorithm.

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