If a tree's branching factor (i.e. the number of possible actions per turn) is N, and the depth of the tree (i.e. the length of the game) is N, the size of the tree is N^N, not N^2.
I guess chess (without the 50-move rule), checkers, and go (with a certain ruleset) can go on for longer.