In the best case, the complexity of the algorithm is O(formula_1) while the worst case is O(formula_2) where b is the branching factor, that is how much each move splits into future options on average, and d is the depth, as in on average how many possible moves are made into the game.