Problem #WSP-5481

Problems Graph Theory

Problem

Seven Smurfs live in seven mushroom houses. There is a tunnel between every pair of houses, so from any house you can walk to any other house. One of the Smurfs, Clumsy, starts walking from his house, but he must not use the same tunnel more than once. He keeps walking until he reaches a house where all the tunnels have already been used. Where will Clumsy’s journey end?