Geodesic complexity of a cube

The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic complexity of a 3-dimensional cube exceeds its topological complexity by exactly 2. The proof involves a careful analysis of cut loci of the cube.