Alpha-beta Pruning

Alpha-Beta Pruning is an optimization algorithm in game tree search that reduces the number of nodes evaluated in the minimax algorithm by eliminating branches that cannot influence the final decision, thereby improving computational efficiency without affecting the outcome.

40

Publications

2.8K

Citations

62

Authors

34

Institutions

Publications per year

2017–2026

5

Authors

62

  1. RE
    Richard E. Korf

    University of California, Los Angeles, United States

    5 publications · 216 citations

    5

    h-index

  2. NS
    Nathan Sturtevant

    University of Alberta, Canada

    4 publications · 132 citations

    4

    h-index

  3. MB
    Michael Buro

    University of Alberta, Canada

    3 publications · 86 citations

    3

    h-index

  4. AS
    Abdallah Saffidine

    Université Paris Dauphine-PSL, France

    3 publications · 56 citations

    3

    h-index

  5. HB
    Hendrik Baier

    University of York, United Kingdom

    2 publications · 43 citations

    2

    h-index

1–5 of 62

Venues

  1. Artificial Intelligence

    5 publications · 1.3K citations

    5

    h-index

  2. National Conference on Artificial Intelligence

    Conference · 3 publications · 157 citations

    3

    h-index

  3. 2

    h-index

  4. International Joint Conference on Artificial Intelligence

    Conference · 2 publications · 25 citations

    2

    h-index

  5. ICGA Journal

    2 publications · 54 citations

    2

    h-index

1–5