Several articles deal with tilings with various shapes, and also a very frequent type of combinatorics is to examine the walks on graphs or on grids. We combine these two things and give the numbers of the shortest walks crossing the tiled $(1\times n)$ and $(2\times n)$ square grids by covering them with squares and dominoes. We describe these numbers not only recursively, but also as rational polynomial linear combinations of Fibonacci numbers.