Alpha–beta pruning

Search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree

Alpha–beta pruning is a tree 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.).

Nº Q570496 ★★

Incomum · História

Alpha–beta pruning

Search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree

Texto em inglês

Alpha–beta pruning is a tree 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.).

Na Wikipédia

Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.

Alpha–beta pruning is a tree 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.

Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Wikimedia Commons (CC BY-SA 3.0) ·

Cartas próximas

Abrir

…

Confirmação