Question: We introduced Sudoku as a CSP to be solved by search over partial assignments because that is the way people generally undertake solving Sudoku problems.
We introduced Sudoku as a CSP to be solved by search over partial assignments because that is the way people generally undertake solving Sudoku problems. It is also possible, of course, to attack these problems with local search over complete assignments. How well would a local solver using the min-conflicts heuristic do on Sudoku problems?
Step by Step Solution
3.49 Rating (172 Votes )
There are 3 Steps involved in it
It is certainly possible to solve Sudoku problems in this fash... View full answer
Get step-by-step solutions from verified subject matter experts
