Efficient belief-state AND-OR search, with application to Kriegspiel

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 278-285

  Russell, Stuart ^a   Wolfe, Jason ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLACK BOXES; HARD INSTANCES; INCREMENTALIZATION; ORDERS OF MAGNITUDE; PHYSICAL STATE; SEARCH DIMENSIONS; SOLUTION TREE;

ALGORITHMS; FORESTRY;

ARTIFICIAL INTELLIGENCE;

EID: 84880712794     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. L. V. Allis. Searching for Solutions in Games and Artificial Intelligence. PhD thesis, University of Limburg, 1994.
2. P. Bertoli, A. Cimatti, M. Roveri, and P. Traverso. Planning in nondeterministic domains under partial observability via symbolic model checking. In IJCAI, 2001.
3. A. Bolognesi and P. Ciancarini. Computer Programming of Kriegspiel Endings: The Case of KR vs. K. In Advances in Computer Games 10, 2003.
4. A. Bolognesi and P. Ciancarini. Searching over Metapositions in Kriegspiel. In Computers and Games 2004. Springer-Verlag, 2004.
5. P. Ciancarini, F. DallaLibera, and F. Maran. Decision Making under Uncertainty: A Rational Approach to Kriegspiel. In Advances in Computer Chess 8, 1997.
6. T. Ferguson. Mate with Bishop and Knight in Kriegspiel. Theoretical Computer Science, 96:389-403, 1992.
7. T. Ferguson. Mate with the Two Bishops in Kriegspiel. Technical report, UCLA, 1995.
8. M. L. Ginsberg. GIB: Steps toward an expert-level bridge-playing program. In IJCAI, 1999.
9. D. Koller and A. Pfeffer. Representations and solutions for game-theoretic problems. Artificial Intelligence, 94:167-215, 1997. (Pubitemid 127371450)
10. A. Parker, D. Nau, and V. S. Subrahmanian. Game-tree search with combinatorially large belief states. In IJCAI, 2005. (In press).
11. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs, NJ, 2003.
12. M. Sakuta. Deterministic Solving of Problems with Uncertainty. PhD thesis, Shizuoka University, 2001.