Eulerian and Hamiltonian Graphs · Superchallenge problem

The Möbius ladder $M_6$ has $12$ vertices $0,\ldots,11$ around a cycle plus $6$ rungs joining each $i$ to $i+6$. How many distinct Hamiltonian paths run from vertex $0$ to vertex $6$ (its rung-partner)?