Partial order bounding: A new approach to evaluation in game tree search (Q5941319): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Bayesian approach to relevance in game playing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective Heuristic Search in AND/OR Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching game trees under a partial order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative deepening multiobjective \(A^{*}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of alpha-beta pruning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3123662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398828 / 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: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best-first fixed-depth minimax algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benefits of using multivalued functions for minimaxing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to generate the ideals of a partial order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective A* / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Data Structure for Lattice Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to generate all topological sorting arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Poset Dimension Algorithm / rank
 
Normal rank

Latest revision as of 18:24, 3 June 2024

scientific article; zbMATH DE number 1635484
Language Label Description Also known as
English
Partial order bounding: A new approach to evaluation in game tree search
scientific article; zbMATH DE number 1635484

    Statements

    Partial order bounding: A new approach to evaluation in game tree search (English)
    0 references
    20 August 2001
    0 references
    game tree search
    0 references
    evaluation functions
    0 references
    partial order evaluation
    0 references
    partial order bounding
    0 references
    computer Go
    0 references
    Semeai
    0 references

    Identifiers