We show that anagram-free vertex colouring a $2\times n$ square grid requires number of colours increases with $n$. This answers an open question in Wilson's thesis and shows there are even graphs pathwidth $2$ do not have colourings bounded colours.
