2 docs tagged with "constraint satisfaction"

The M-Coloring problem is a backtracking algorithm where the task is to assign colors to vertices of a graph so that no two adjacent vertices share the same color. The goal is to find if it is possible to color the graph using at most M colors.

Solve a 9×9 Sudoku puzzle using backtracking with constraint propagation. A classic constraint-satisfaction problem solved by trying digits and backtracking on conflicts.