Consider an arbitrarily large $N \times N$ grid graph.
How can I express the number of closed walks starting from a reference vertex $v$ in terms of the length $L$ of the walk?

For example, for $L = 2$, there are 4 closed walks from $v$ to $v$.
For $L = 4$, there are $36$ closed walks from $v$ to $v$.