Information set generation in partially observable games

摘要: We address the problem of making single-point decisions in large partially observable games, where players interleave observation, deliberation, and action. present information set generation as a key operation needed to reason about games this way. show how can be used implement an existing decision-making algorithm. develop constraint satisfaction algorithm for performing that it scales better than depth-first search approach on multiple non-trivial games.