Chapter 9.1, Problem 33PS

HISTORICAL QUEST Traveler’s Dodecahedron This problem was sold in the last half of the 19th century as a puzzle known as the “Traveler’s Dodecahedron” or “A Voyage ‘Round the World.’ ” It consisted of 20 pegs (called cities), and the point of the puzzle was to use string to connect each peg only once, arriving back to the same peg you started from. Find a route (starting at Brussels-labeled 1) that visits each of the 20 cities on the dodecahedron shown in Figure $9.8$.

FIGURE $9.8$Hamilton’s “Traveler’s Dodecahedron”