This work develops the complexity theory of LCL problems for toroidal 2-dimensional grids. The complexity classes are the same as in the 1-dimensional case: O(1), Θ(log*n), and Θ(n). In addition to the general complexity result, we classify the complexity of several concrete LCL problems related to colourings and orientations, partially with the help of automated design tools.