A shortcut that skips losing branches during minimax game search.
Alpha-Beta Pruning is like playing chess with a strict grandma. Once your move is already losing, she stops watching your “genius” plan.
Game AIs use it to search moves faster. It skips branches but keeps the same best move.
MCTS
Both search decision trees, but Alpha-Beta cuts branches while MCTS samples plays.
Heuristic Search
Good move order helps Alpha-Beta cut branches earlier.
DQN
Alpha-Beta uses clear tree search. DQN uses learned value guesses.
Planning
Alpha-Beta is a classic search trick in planning and game solving.