Programming, Udacity, Nanodegree, Csp, Sudoku.
reveal the solution. When it comes to Sudoku only “Minimum Remaining Values” make sense. By choosing squares with less number of values, there is less branching. For every algorithm, there are improvements by applying heuristics specific to the problem. Using Constraint Propagation to solve CSP