A generalization of alpha-beta and \(SSS^*\) search procedures (Q1076524): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Toshihide Ibaraki / rank
Normal rank
 
Property / author
 
Property / author: Toshihide Ibaraki / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0004-3702(86)90092-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019928791 / 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: A comparison of minimax tree search algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An admissible and optimal algorithm for searching AND/OR graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantitative analysis of the alpha-beta pruning algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The technology chess program / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of alpha-beta pruning / 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: 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: 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? Yes and no / rank
 
Normal rank
Property / cites work
 
Property / cites work: A world-championship-level Othello program / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:31, 17 June 2024

scientific article
Language Label Description Also known as
English
A generalization of alpha-beta and \(SSS^*\) search procedures
scientific article

    Statements

    A generalization of alpha-beta and \(SSS^*\) search procedures (English)
    0 references
    1986
    0 references
    minimax game trees
    0 references
    static model
    0 references
    informed model
    0 references
    4\(\times 4\) Othello game
    0 references
    0 references

    Identifiers