Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:search_engine
|
| gptkbp:application |
gptkb:computer_chess
gptkb:game_AI |
| gptkbp:describes |
An iterative search algorithm that uses zero-window alpha-beta searches to converge on the minimax value.
|
| gptkbp:developedBy |
gptkb:Aske_Plaat
|
| gptkbp:field |
gptkb:artificial_intelligence
computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
MTD(f) algorithm
|
| gptkbp:input |
game tree
initial guess of minimax value |
| gptkbp:introducedIn |
1996
|
| gptkbp:notablePublication |
A New Paradigm for Minimax Search (Aske Plaat et al., 1996)
|
| gptkbp:output |
minimax value
|
| gptkbp:relatedTo |
alpha-beta pruning
minimax algorithm negascout |
| gptkbp:usedIn |
game tree search
|
| gptkbp:bfsParent |
gptkb:Aske_Plaat
|
| gptkbp:bfsLayer |
8
|