Is there a finite game that cannot be represented by an extensive form or a game tree?
I know that many games are too long and complex to be represented by a tree of a reasonable size, but that's not what I'm looking for because it is in part a computational limitation.
Instead I wonder if there is something simple out there that just doesn't fit into an extensive form? All the books that I've read say something like
Various games can be represented by trees
But I haven't seen "all games" claim anywhere. Are there any known exceptions?