✳flâneur — a map of the web's best reading

Alpha–beta pruning

en.wikipedia.org · 3,464 words · saved by 1 readers

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 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.

Alpha–beta pruning - Wikipedia Jump to content From Wikipedia, the free encyclopedia Search algorithm For other uses, see Alphabeta (disambiguation) . O(b^d)</math>"},"best-time":{"wt":"<math>O\\left(\\sqrt{b^d}\\right)</math>"},"average-time":{"wt":""},"space":{"wt":""},"optimal":{"wt":""},"complete":{"wt":""}},"i":0}}]}'> Alpha–beta pruning Class Search algorithm Worst-case performance O ( b d ) {\displaystyle O(b^{d})} Best-case performance O ( b d ) {\displaystyle O\left({\sqrt {b^{d}}}\right)} Alpha–beta pruning is a tree search algorithm that seeks to decrease the number of nodes that ar

Explore this link on the map →

related reading