Alpha–beta pruning
Search algorithm that seeks to decrease the number of nodes in the minimax algorithm search tree / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Alpha–beta pruning?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
For other uses, see Alphabeta (disambiguation).
Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. It is an adversarial search algorithm used commonly for machine playing of two-player combinatorial games (Tic-tac-toe, Chess, Connect 4, etc.). It stops evaluating a move when at least one possibility has been found that proves the move to be worse than a previously examined move. Such moves need not be evaluated further. When applied to a standard minimax tree, it returns the same move as minimax would, but prunes away branches that cannot possibly influence the final decision.[1]
Quick Facts Class, Worst-case performance ...
Class | Search algorithm |
---|---|
Worst-case performance | |
Best-case performance |
Close