The game model and the probability algorithm of einstein chess

Einstein Chess is one of the Olympic computer game competition items. It is obviously different from the other games. Players throw the dice, then according to the dice's point number, the player decide to move the chess piece. The dice's point number is random. Therefore, Einstein chess is a random game of complete information. Research on random game is still in the exploration stage. This paper analyzes the game model of Einstein chess. Chess strategy optimization algorithm is designed based on the position and the probability. Through a lot of simulation experiments prove that, the algorithm is effective and practical.