A comparison of minimax tree search algorithms (Q1838331): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0004-3702(83)90001-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974281669 / 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: 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

    Identifiers