Searching game trees under a partial order

DOI10.1016/0004-3702(94)00085-9MaRDI QIDQ2674204zbMATH OpenOpenAlexFDO

Authors Pallab Dasgupta, P. P. Chakrabarti, S. De Sarkar

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)

Recommendations

• scientific article; zbMATH DE number 1944388
• Partial order bounding: A new approach to evaluation in game tree search
• scientific article; zbMATH DE number 4162309
• Game tree algorithms and solution trees
• Optimal Search on Some Game Trees

Cites work

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

Cited in

(5)

• Searching minimax game trees under memory space constraint
• scientific article; zbMATH DE number 1944388 (Why is no real title available?)
• Partial order bounding: A new approach to evaluation in game tree search
• A preference-based approach to spanning trees and shortest paths problems
• Multiobjective heuristic state-space planning

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674204)