Find all possibe configurations switching next door neighbors only with no repetitions. Climb the decision tree so when you come to the fork in the tree, take it. Unfortunately I took the high road (column AC) but if I were going to do it over I would take the low road (column V). But when you have to climb back down the tree and try another path, be sure to take a different fork. Fortunately there are only two choices in this problem.