Eulerian and Hamiltonian Graphs · Challenge problem

The cube graph $Q_3$ has $8$ vertices, the $3$-bit strings, joined whenever they differ in exactly one bit. Counting two Hamiltonian cycles as the same when they use the same set of edges, how many distinct Hamiltonian cycles does $Q_3$ have?