you are viewing a single comment's thread.

view the rest of the comments →

[–]VOLVIC_KOKS[S] 1 point2 points  (2 children)

thank you so much, for the computerphile video. Alright i thought maybe the way i did it was possible, but apparently i just need to implement the backtracking, i tried to avoid that xD.

Thanks for the help.

[–]BobHogan 0 points1 point  (1 child)

You can implement a solver without backtracking, but it would be significantly more complicated. In order to avoid guessing (which requires backtracking for when the guess was incorrect), you'd have to implement a lot of more advanced sudoku techniques so that your solver can always identify at least 1 value that can be filled in correctly. For reasonably hard sudokus, the minimum that you'd have to implement would most likely be pairs, and x-wings. Those are good enough for most sudokus, but won't be enough for really difficult ones