The Combinatorial Explosion
Suppose a search process begins with the initial state.
Then it considers each of k possible moves. Each of those may have k possible subsequent moves.
In order to look n steps ahead, the number of states that must be considered is
For k > 1, this expression grows rapidly as n increase.
This is known as the combinatorial explosion.