Chinese chess search method based on multiple optimization and iterative deepening and pruning

Abstract

The invention discloses a Chinese chess search method based on multiple optimization and iterative deepening and pruning. According to the method, on the basis of a conventional Alpha-Beta pruning search algorithm, a series of search optimization methods are superposed, so that pruning efficiency and searching accuracy of the conventional Alpha-Beta algorithm are greatly improved. The Chinese chess search method based on multiple optimization and iterative deepening and pruning has the advantages: (1) a designed iterative deepening technology can sufficiently utilize computing resources and increase a pruning probability; (2) an opening book is added, so that a system has the professional chess playing style at the beginning of a chess game; (3) a state machine search mechanism is constructed, and an execution sequence of each method is optimized, so that thinking of a machine has higher logic; and (4) obtained excellent playing methods are recorded into a historical table, so that thesystem has high learning capacity. According to the invention, the algorithm and an optimization mechanism ensure that an AI (Artificial Intelligent) algorithm can intelligently carry out human-computer fighting; a small resource space is occupied; and the Chinese chess search method is simple, convenient and rapid to operate and is a lightweight AI Chinese chess search method with the efficientAI algorithm.

Description

technical field [0001] The invention relates to a search method for Chinese chess based on multiple optimization and iterative deepening pruning, and belongs to the technical field of Alpha-Beta pruning search. Background technique [0002] The birth of computers also gave birth to artificial intelligence technology, and artificial intelligence technology was first explored from the practice of chess programs, so when it comes to artificial intelligence technology, people will inevitably think of chess. Intelligent chess is an important carrier for people to study artificial intelligence, and its research value is no less than that of fruit flies in the biological world. How to make the chess system more intelligent and efficient is the goal of people's research. At present, the intelligent Chinese chess system often responds slowly in the process of playing chess, and the traditional search algorithm is inefficient, consumes a lot of resources, and cannot efficiently give t...

AI Technical Summary

Problems solved by technology

This algorithm has the advantages of easy implementation and high precision, but the algorithm is heavily dependent on the search order of the moves

If you always search for the worst move first, then Beta truncation will not happen, so the algorithm is like min-max, which is very inefficient and may end up searching the entire game tree

Images