lim (k -> 0) (n^k / (k!)) is actually 0. k! grows faster than n^k for any constant n.
On your comment though, I don't think there's much of "drama" in increasing the state space. Really it is just under 2 bits per cell by width by height. I would say it grows exponentially to the size of the board.