The invention requests to protect a simple easing game solving method based on
pruning search, which is characterized by comprising the following steps of: 101, establishing a
decision tree, 102, establishing a
hash table, 103, carrying out data preprocessing, 104, establishing a strategy diagram, 105, searching the
decision tree; 106, searching a cache value; Mathematical principles of simple
pier eating games are studied. The method comprises the steps of establishing a
pruning tree which can be accurately solved, traversing all low-order instances in a given range through
recursion, establishing a Hash cache table, performing data ground preprocessing and
data structure equivalent conversion, accurately solving an optimal solution of the given instance, and greatly improving the
time efficiency compared with a naive maximum and minimum search. The simple
pier-eating game is a true child game of classic
pier-eating games such as bridges and Tarot, so that the method can help bridge or Tarot players to more accurately analyze strategies during the game, and can help computer intelligent programs of the bridges or the Tarot reduce the search space, thereby improving the
time efficiency of the bridges or the Tarot.