A comparison of minimax tree search algorithms (Q1838331): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the branching factor of the alpha-beta pruning algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An analysis of alpha-beta pruning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymptotic properties of minimax trees and game-searching procedures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3912009 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Experiments With Some Programs That Search Game Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A minimax algorithm better than alpha-beta? / rank | |||
Normal rank |
Latest revision as of 17:38, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A comparison of minimax tree search algorithms |
scientific article |
Statements
A comparison of minimax tree search algorithms (English)
0 references
1983
0 references
game-searching algorithms
0 references
0 references