A minimax algorithm better than alpha-beta? Yes and no (Q1837546): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An analysis of alpha-beta pruning / rank
 
Normal rank
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: The solution for the branching factor of the alpha-beta pruning algorithm and its optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimax algorithm better than alpha-beta? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / 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: Q5592596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of minimax tree search algorithms / rank
 
Normal rank

Revision as of 17:22, 13 June 2024

scientific article
Language Label Description Also known as
English
A minimax algorithm better than alpha-beta? Yes and no
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references