Solving CSP using backtracking with conflict-directed back-jumping. Consider the graph with 8 nodes ????1 , ????2 , ????3 , ????4 , ????, ????, ????1 , ????2 . As shown on fig below nodes ???????? are connected to ????(????+1) for all ????, each ???????? is connected to ????, ???? is connected to ???? and ???? is connected to each ???????? . Find a 3-coloring of this graph by hand using the following strategy: backtracking with conflict-directed back-jumping, the variable order ????1 , ????, ????4 , ????1 , ????2 , ????2 , ????3 , ????, and the value order R (red), G (green), B (blue).