Application Of Dynamic Game Theory Model In Chess

We examine the widespread model of Royalist poker game. This thesis trys to build the Royalist poker game model by game theory methods. In the text, we firstly introduce the background of the game and pull into a lot of relevant speculative knowledge, then we bring the specific situation into the game.firstly, if the royalist and the king are not the same person and the royalist appears before the gambling party starts, or he will hide himself in the gambling, this should be investigated. Secondly, we will examine if the royalist and the king are the same person, and the royalist appears before the gambling party starts, or he will hide himself in the gambling, this will also be investigated. We put emphasis on the construction of the model, During the process of the game, we emphatically consider the dynamic formation pattern of anti-royalist coalition when the royalist don’t indicate his’state. The key is to build the model and we stress this point.The model that we bulid is a new discrete dynamic game. The royalist indicate his’state before the gambling party starts is clear and can be directly perceived through the senses, but the difficulty mainly concentrate on the situation he hides himself in the gambling, for example, the primary feature of the situation that the royalist hide himself and he is not the king is that there would be two couples of antagonistic coalitions. in the meantime, the main characteristic of the situation that the royalist hide himself and he is the king is that there would be specific coalition structure. By backward induction we give ways of building the corresponding optimal path so that we can get the solution of game.