Code Breaking Game is a type of game in which a player strives to reveal a hidden code by a series of experiments from a defined set. The player learns the result of each experiment, which is a partial information about the code. The goal of the player is to minimize the number of experiments needed to reveal the code. Some famous board games fit into this category with Mastermind as the most prominent example. The thesis should study Code Breaking Games in general, find other examples of this type of games and discuss results of research in this area. Further, it should introduce a formalism and a computer language for game specification. The crucial part of the work is to design and implement a tool to parse the game description and perform basic analysis. The tool should be able to synthesize a strategy for the game, and thus give an upper bound on the minimal number of experiments needed to reveal the code.