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
Parents
573
1–5 of 573
1K
6
h-index
6
h-index
5
h-index
5
h-index
5
h-index
1–5 of 1K
495

University of Alberta
Edmonton, Canada
17 h-index
29 publications
1.6K citations

McMaster University
Hamilton, Canada
9 h-index
16 publications
435 citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
14 publications
383 citations
University of California, Berkeley
Berkeley, United States
8 h-index
14 publications
636 citations

Imperial College London
London, United Kingdom
8 h-index
16 publications
680 citations
University of Maryland, College Park
College Park, United States
8 h-index
17 publications
915 citations

University of Toronto
Toronto, Canada
8 h-index
13 publications
800 citations
University of Michigan
Ann Arbor, United States
7 h-index
13 publications
755 citations
1–8 of 495
Repository · 30 publications · 948 citations
19
h-index
13 publications · 550 citations
12
h-index
12 publications · 586 citations
12
h-index
11 publications · 1.1K citations
10
h-index
9 publications · 375 citations
9
h-index
1–5