Best-first fixed-depth minimax algorithms (Q2676580): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q55920594, #quickstatements; #temporary_batch_1705094664359
Created claim: DBLP publication ID (P1635): journals/ai/PlaatSPB96, #quickstatements; #temporary_batch_1731468600454
 
(4 intermediate revisions by 4 users not shown)
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(95)00126-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088182101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof-number search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster alternative to \(SSS^*\) with extension to variable memory / 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: A generalization of alpha-beta and \(SSS^*\) search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of alpha-beta pruning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first iterative-deepening: An optimal admissible tree search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conspiracy numbers for min-max search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997090 / 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: Game tree algorithms and solution trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992453 / 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 minimax algorithm better than alpha-beta? / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ai/PlaatSPB96 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:04, 13 November 2024

scientific article
Language Label Description Also known as
English
Best-first fixed-depth minimax algorithms
scientific article

    Statements

    Best-first fixed-depth minimax algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 September 2022
    0 references
    game-tree search
    0 references
    minimax search
    0 references
    alpha-beta
    0 references
    SSS*
    0 references
    transposition tables
    0 references
    null-window search
    0 references
    solution trees
    0 references

    Identifiers