With the same alpha/beta values at a min node you'd need your heuristic to say that h (s) <= -10 to be able to prune. Alpha-beta pruning can reduce a tree size b^d to b^ (d/2). With a perfect heuristic you could essentially reduce the tree size to d. That is, your heuristic could immediately cut off all remaining children at every state.