Alpha–beta pruning
id:
alpha-beta-pruning-176-6527023
title:
Alpha–beta pruning
text:
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. 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
brand slug:
wiki
category slug:
encyclopedia
description:
Search algorithm that seeks to decrease the number of nodes in the minimax algorithm search tree
original url:
https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning
date created:
2002-12-19T07:00:49Z
date modified:
2024-09-03T16:56:30Z
main entity:
{"identifier":"Q570496","url":"https://www.wikidata.org/entity/Q570496"}
image:
fields total:
13
integrity:
15