Backtracking Set 5 (m Coloring Problem)-Backtracking-Given an undirected graph and a number m, determine if the graph can be colored with at most m colors .
8 queen problem using backtracking
2 Articles
2
JAVA Programming-Backtracking Set 3 (N Queen Problem) – JAVA – discuss N Queen as another example problem that can be solved using Backtracking.