Minimax Search

Minimax Search is a decision-theoretic algorithm in adversarial game playing that belongs to the class of minimax algorithms, distinguished by its systematic exploration of the game tree to minimize the possible loss for a worst-case scenario assuming optimal play by the opponent.

573

Publications

40.4K

Citations

1K

Authors

495

Institutions

Publications per year

2017–2026

88

Authors

1K

  1. GS
    Gal Shmuel

    Technion – Israel Institute of Technology, Israel

    6 publications · 171 citations

    6

    h-index

  2. MH
    Mark H. M. Winands

    Maastricht University, Netherlands

    6 publications · 140 citations

    6

    h-index

  3. NS
    Nathan Sturtevant

    University of Alberta, Canada

    5 publications · 175 citations

    5

    h-index

  4. ZD
    Zvi Drezner

    California State University, Fullerton, United States

    5 publications · 164 citations

    5

    h-index

  5. JB
    J.W. Bandler

    McMaster University, Canada

    5 publications · 148 citations

    5

    h-index

1–5 of 1K

Venues

  1. arXiv (Cornell University)

    Repository · 30 publications · 948 citations

    19

    h-index

  2. Operations Research

    13 publications · 550 citations

    12

    h-index

  3. The Annals of Statistics

    12 publications · 586 citations

    12

    h-index

  4. Artificial Intelligence

    11 publications · 1.1K citations

    10

    h-index

  5. 9

    h-index

1–5