Partial order bounding: A new approach to evaluation in game tree search

DOI10.1016/S0004-3702(01)00085-6zbMath0971.68037MaRDI QIDQ5941319

No author found.

Publication date: 20 August 2001

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

computer Goevaluation functionsgame tree searchpartial order boundingpartial order evaluationSemeai

Mathematics Subject Classification ID

Searching and sorting (68P10) Other game-theoretic models (91A40)

Related Items (2)

A preference-based approach to spanning trees and shortest paths problems ⋮ Computer Go

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm to generate the ideals of a partial order
• A Bayesian approach to relevance in game playing
• Benefits of using multivalued functions for minimaxing
• An analysis of alpha-beta pruning
• Iterative deepening multiobjective \(A^{*}\)
• Pathology on game trees revisited, and an alternative to minimaxing
• Searching game trees under a partial order
• Best-first fixed-depth minimax algorithms
• An algorithm to generate all topological sorting arrangements
• A Poset Dimension Algorithm
• An Efficient Data Structure for Lattice Operations
• Multiobjective A*
• Multiobjective Heuristic Search in AND/OR Graphs

This page was built for publication: Partial order bounding: A new approach to evaluation in game tree search