Derek Nalls wrote on Wed, Sep 19, 2012 02:03 AM UTC:
From Wikipedia-
It's hard even to estimate the game-tree complexity, but for some games a
reasonable lower bound can be given by raising the game's average
branching factor to the power of the number of plies in an average game,
or:
GTC ≥ b^d
