Statements (30)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:assumes |
perfect play by both players
|
| gptkbp:category |
gptkb:search_engine
recursive algorithm |
| gptkbp:complexity |
O(b^d)
|
| gptkbp:firstDescribed |
1928
|
| gptkbp:form |
combinatorial game theory
|
| gptkbp:goal |
minimize the possible loss for a worst-case scenario
maximize the minimum gain |
| https://www.w3.org/2000/01/rdf-schema#label |
Minimax
|
| gptkbp:improves |
alpha-beta pruning
|
| gptkbp:input |
game tree
|
| gptkbp:limitation |
computationally expensive for large trees
|
| gptkbp:originatedIn |
gptkb:John_von_Neumann
|
| gptkbp:output |
optimal move
|
| gptkbp:relatedTo |
alpha-beta pruning
expectiminimax maximin |
| gptkbp:usedFor |
gptkb:checkers
gptkb:tic-tac-toe chess adversarial search two-player zero-sum games |
| gptkbp:usedIn |
gptkb:artificial_intelligence
decision theory game theory |
| gptkbp:bfsParent |
gptkb:MCTS
gptkb:The_Fox-Badger_Family gptkb:Moonbug_Entertainment |
| gptkbp:bfsLayer |
7
|