Alpha–beta pruning
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, Go, 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.
known for
A-b pruningAlexander BrudnoAlexander ReinefeldAlpha-beta pruningAlpha-beta searchAlphaGoAlphaZeroAlpha beta pruningAlphabeta (disambiguation)Alphabeta pruningAlpha–beta searchArimaaArthur SamuelAtaxxB*Belle (chess machine)Best node searchBranch and boundCandidate moveChessVCombinatorial game theoryCombinatorial searchComputer ArimaaComputer GoComputer OthelloComputer bridgeComputer chessConnect FourCraftyDecision tree pruningDeep Blue (chess computer)Efficiently updatable neural networkExpectiminimaxFanoronaFile carvingGame theoryGame treeGeneral game playingGlossary of computer chess termsGomoku
Link from a Wikipage to another Wikipage
known for
seeAlso
differentFrom
primaryTopic
Alpha–beta pruning
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, Go, 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.
has abstract
Alfa-beta ořezávání (angl. alp ...... při stejném čase) zdvojnásobí.
@cs
Algorytm Alfa-Beta – algorytm ...... ny wyniku działania algorytmu.
@pl
Alpha-beta剪枝是一种搜索算法,用以减少极小化极大算 ...... 和极小化极大算法所得结论相同,但剪去了不影响最终决定的分枝。
@zh
Alpha–beta pruning is a search ...... influence the final decision.
@en
Die Alpha-Beta-Suche (auch Alp ...... rgebnis wie die Minimax-Suche.
@de
En informatique, plus précisém ...... ou les dames[réf. souhaitée].
@fr
La poda alfa beta es una técni ...... influye en la decisión final.
@es
La potatura alfa-beta è un alg ...... goritmo a cui viene applicata.
@it
Альфа-бета відсічення — алгори ...... е потребують подальшої оцінки.
@uk
Альфа-бета-отсечение (англ. al ...... корректность работы алгоритма.
@ru
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,020,805,901
Link from a Wikipage to another Wikipage
class
wikiPageUsesTemplate
subject
hypernym
type
comment
Alfa-beta ořezávání (angl. alp ...... dvě, každá pro jednoho hráče.
@cs
Algorytm Alfa-Beta – algorytm ...... ny wyniku działania algorytmu.
@pl
Alpha-beta剪枝是一种搜索算法,用以减少极小化极大算 ...... 和极小化极大算法所得结论相同,但剪去了不影响最终决定的分枝。
@zh
Alpha–beta pruning is a search ...... influence the final decision.
@en
Die Alpha-Beta-Suche (auch Alp ...... ung nicht beeinflussen können.
@de
En informatique, plus précisém ...... ou les dames[réf. souhaitée].
@fr
La poda alfa beta es una técni ...... onald Knuth y Ronald W. Moore
@es
La potatura alfa-beta è un alg ...... goritmo a cui viene applicata.
@it
Альфа-бета відсічення — алгори ...... е потребують подальшої оцінки.
@uk
Альфа-бета-отсечение (англ. al ...... корректность работы алгоритма.
@ru
label
Alfa-beta ořezávání
@cs
Algorytm alfa-beta
@pl
Alpha-Beta-Suche
@de
Alpha-beta剪枝
@zh
Alpha–beta pruning
@en
Poda alfa-beta
@es
Potatura alfa-beta
@it
Élagage alpha-bêta
@fr
Альфа-бета-отсечение
@ru
Відсічення альфа-бета
@uk