Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances