Backtracking Example: Finding a 3-coloring of a graph
Explore possibilities; backtrack when doesn’t work.
Start by assigning an arbitrary color to one of the vertices.
Continue coloring while maintaining the constraints imposed by the edges
If reach a vertex that can’t be colored, backtrack -- go back up the recursion tree and explore other children