2015 Advanced #8
Source:
July 8, 2022
2015Advanced Topics Test
Problem Statement
You have friends, each of whom lives at a different vertex of a cube. You want to chart a path along the cube’s edges that will visit each of your friends exactly once. You can start at any vertex, but you must end at the vertex you started at, and you cannot travel on any edge more than once. How many different paths can you take?