Consider a game like go, where board size is n. This means the game tree's branching factor is O(n). Let's say the game tree's depth is O(n) too. Then what is the size of the tree?
I guess chess (without the 50-move rule), checkers, and go (with a certain ruleset) can go on for longer.