Machine game optimization method

Abstract

The invention discloses a machine game optimization method. Innovation of the method is using a probability matrix to analyze magnitude of enemy chess pieces force so as to decide a chess strategy of our party more purposefully. The method mainly comprises probability matrix design and an update process. The design method mainly comprises setting dimensions according to a chessboard layout and a chess piece type and quantity of the military chess, and determining an initial value of a matrix according to military chess rules and a history chess manual of an enemy; updating rules relate to updating both rows and columns in the probability matrix; and finally, after updating location information of the chess pieces, the chess strategy of our party is more purposeful, and a winning probability can be significantly increased. According the optimization method, without further expansion of a game tree, a probability distribution model is adopted to simulate a real situation, search and evaluation are carried out targeting on a current situation and prediction of a possible strategy of the enemy in a next step, and the method can be easily realized through a machine language, and the software operation speed is fast, thereby improving speed and the winning probability of machine playing chess, and overcoming shortcomings of both a slow speed and a complex search space.

Description

technical field [0001] The invention belongs to the technical field of computers, and in particular relates to a machine game optimization method. Background technique [0002] ComputerGames, also known as computer games, has attracted widespread attention in the academic circles with the birth of computers. Obviously, this is a very prominent and challenging topic in the field of artificial intelligence. Although "artificial intelligence" (Artificial Intelligence) The discipline was not officially born until ten years after it (1956). [0003] As early as the eve of the birth of the computer, the famous mathematician and computer scientist Alan Turing (Alan Turing) designed a paper program capable of playing chess, and after a step-by-step artificial deduction, the first international chess game was realized. Programmed game of chess [1]. The most famous scientists in the world, such as John von Neumann, the founder of computer, Claude E. Shannon, the founder of informati...

AI Technical Summary

Problems solved by technology

However, the software designed according to the Monte Carlo random test is more complicated and requires a large number of tests, and the software runs slowly, which affects the chess playing speed of the system.

Images