An interactive look at an NP-Complete problem. Try to color the graph using the available colors so no connected nodes share a color. Experience the difference between finding a solution (hard) and verifying one (easy).