Problem: On the surface of a $3\times3$ cube is it possible to walk a path starting in one surface square, walking to neighbouring squares, visiting each of the $54$ squares only once? Is there a circuit?

Solution: Proof without words 😊