Past exam of the probability, statistics and options I course of the University of Oxford / 2009 / R / 1 / i / Solution

Label the outer square $000,001,011,010$ in cyclic order and the inner square $100,101,111,110$ in corresponding order. Join corresponding vertices radially. Each edge changes exactly one bit, so this gives every edge of $Q_3$, with no crossings.