Searching game trees under a partial order

DOI10.1016/0004-3702(94)00085-9zbMath1506.68123OpenAlexW1993339151MaRDI QIDQ2674204

Pallab Dasgupta, S. C. de Sarkar, Partha Pratim Chakrabarti

Publication date: 22 September 2022

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

Full work available at URL: https://doi.org/10.1016/0004-3702(94)00085-9

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial games (91A46)

Related Items (3)

A preference-based approach to spanning trees and shortest paths problems ⋮ Partial order bounding: A new approach to evaluation in game tree search ⋮ Multiobjective heuristic state-space planning

Cites Work

• Multi-player alpha-beta pruning
• Shortest paths without a map
• A minimax algorithm better than alpha-beta?
• An analysis of alpha-beta pruning
• Multiobjective A*

This page was built for publication: Searching game trees under a partial order