Representing Kriegspiel states with metapositions

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2450-2455

  Ciancarini, Paolo ^a   Favini, Gian Piero ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOARD GAMES; INCOMPLETE INFORMATION; INFORMATION SET; MINIMAX THEOREM; PERFECT INFORMATIONS;

MERGING; TREES (MATHEMATICS);

ARTIFICIAL INTELLIGENCE;

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

References (6)

1. A. Bolognesi and P. Ciancarini. Computer Programming of Kriegspiel Endings: the case of KR vs K. In J. van den Herik, H. Iida, and E. Heinz, editors, Advances in Computer Games 10, pages 325-342. Kluwer, 2003.
2. A. Bolognesi and P. Ciancarini. Searching over Metapositions in Kriegspiel. In J. van den Herik and H. Iida, editors, Computer and Games 04, volume (to appear) of Lecture Notes in Artificial Intelligence. Springer, 2004.
3. P. Ciancarini, F. DallaLibera, and F. Maran. Decision Making under Uncertainty: A Rational Approach to Kriegspiel. In J. van den Herik and J. Uiterwijk, editors, Advances in Computer Chess 8, pages 277-298. Univ. of Rulimburg, 1997.
4. I. Frank and D. Basin. Search in games with incomplete information: A case study using bridge card play. Artificial Intelligence, 100(1-2):87-123, 1998. (Pubitemid 128403238)
5. A. Parker, D. Nau, and VS. Subrahmanian. Game-Tree Search with Combinatorially Large Belief States. In Int. Joint Conf. on Artificial Intelligence (IJCAI05), volume (to appear), Edinburgh, Scotland, 2005.
6. M. Sakuta. Deterministic Solving of Problems with Uncertainty. PhD thesis, Shizuoka University, Japan, 2001.