Abstract:Incomplete information game is an important research direction in the field of artificial intelligence. In this study, we introduce a solution of incomplete information game based on Satisfiability Modulo Theory (SMT). We describe the dynamic process of the game as corresponding constraints through Situation Calculus and write the constraints into propositional logic formula. Then, we convert the reasoning problem to the problem of satisfiability of logical formula and call the SMT solver. The application shows that the proposed algorithm can effectively deduce the answer of the game.