In this paper we present a full-fledged player for general games with incomplete information specified in the game description language GDL-II. To deal with uncertainty we introduce a method that operates on partial belief states, which correspond to a subset of the set of states building a full belief state. To search for a partial belief state we present depth-first and Monte-Carlo methods. All can be combined with any traditional general game player, e.g., using minimax or UCT search. Our general game player is shown to be effective in a number of benchmarks and the UCT variant compares positively with the one-and-only winner of an incomplete information track at an international general game playing competition. © 2012 Springer-Verlag.
CITATION STYLE
Edelkamp, S., Federholzner, T., & Kissmann, P. (2012). Searching with partial belief states in general games with incomplete information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7526 LNAI, pp. 25–36). https://doi.org/10.1007/978-3-642-33347-7_3
Mendeley helps you to discover research relevant for your work.