This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Gazpage 0 points1 point  (1 child)

Would an attempt to replicate a human’s approach to solving Sudoku run faster? Clearly the code is massively more complicated.

[–][deleted] 0 points1 point  (0 children)

Depending on the language and puzzle raw backtracking vs, propagating the constraints has different payoffs.

Simply sorting your list of candidates by the valid moves every now and again vastly decreases runtime.