An ant must walk from one vertex of a cube to the "opposite" vertex (that is, the vertex that is farthest from the starting vertex) and back again to its starting position. It may only walk along the edges of the cube. For the entire trip its path must traverse exactly six edges and it may travel the same edge twice. How many different 6 edge paths can the ant choose from?
1 answer
36 possible combinations
1 answer