TETRAHEDRON TRAVEL
You will make a travel through the edges of two tetrahedrons (ABCD, and CDEF) joined as shown in the figure. -You will start at A, and finish at F. -You can visit the vertices more than once except the finishing vertex F. -You cannot pass through the edges more than once. In how many ways can this travel be done? Note: Two travels having same edges in different order will be considered as different.
Popularity: 62.5 % Difficulty: 37.5 %