Game tree searching by min/max approximation (Q1096402): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4747542 / 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 analysis of alpha-beta pruning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An investigation of the causes of pathology in games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathology on game trees revisited, and an alternative to minimaxing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992828 / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0004-3702(87)90004-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014969765 / rank
 
Normal rank

Latest revision as of 09:24, 30 July 2024

scientific article
Language Label Description Also known as
English
Game tree searching by min/max approximation
scientific article

    Statements

    Game tree searching by min/max approximation (English)
    0 references
    0 references
    1988
    0 references
    min/max approximation
    0 references
    searching
    0 references
    min/max game trees
    0 references
    playing computers
    0 references

    Identifiers