# Minimax With Alpha-Beta Pruning: Walkthrough
Minimax With Alpha-Beta Pruning shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Track the best guaranteed scores for each player and cut branches that cannot change the result.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(b^(d/2)) with good move ordering.
## Common mistake
Swapping alpha and beta updates between maximizing and minimizing levels.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at learn more.