Parades – 3
The red path is an attempt to find a parade route that crosses each edge of this diagram exactly once. Alas, one of the sides has been missed!
THE CHALLENGE
If you can, find a parade route that crosses each edge of this diagram exactly once. If you can’t, give a reason for why it is impossible.
Notes
THE CHALLENGE
Start by translating this problem into one that has edges we need to traverse. We saw in the earlier “Parades” Puzzle of the Week that it is crucial to have no more than two nodes where an odd number of sides come in.
The red lines represent paths that must be taken to cross each of the edges. We are looking for a parade route that will follow each of the red paths once. Unfortunately, there are four nodes that have an odd number of red paths coming into them. Therefore, it is impossible to find a route that will work!