The Alpha–beta pruning cardAlpha–beta pruning

Alpha–beta pruning

Uncommon

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

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

Excerpt from the Wikipedia article “Alpha–beta pruning”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Auteur inconnu, CC BY-SA 3.0, via Wikimedia Commons.

Open free boosters and add Alpha–beta pruning to your collection.

Play for free

Related cards