Metraipolis › archive › dc_6a28670246ea
Alpha–beta pruning — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-11-08T17:17:58.601Z
- SHA-256 of the archived text
3a0fd8a35dae2c071b2b592cf5c770fb99297d7cd004ccd9cebbadc1f797e2eb- Stable URL of this page
https://metraipolis.com/documento/dc_6a28670246ea
How to cite
Alpha–beta pruning — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_6a28670246ea (Metraipolis archive dc_6a28670246ea, sha256 3a0fd8a35dae2c071b2b592cf5c770fb99297d7cd004ccd9cebbadc1f797e2eb)
BibTeX
@misc{dc6a28670246ea,
title = {Alpha–beta pruning — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_6a28670246ea; sha256 3a0fd8a35dae2c071b2b592cf5c770fb99297d7cd004ccd9cebbadc1f797e2eb},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico). Fonte: Wikipedia in inglese, voce «Alpha–beta pruning» — https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning Wikidata Q570496: «search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q570496 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1380302874, consultata il 2026-11-08T17:14:04.742Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 7ed4d3acd09322e3945fa14253b9642463e8e04f25b8998db77d5f3218377522