A simple easing game solving method based on pruning search

A pruning and simple technique, applied in the fields of computer games, artificial intelligence, set theory, and game theory, can solve problems such as polynomial time can only find approximate solutions

Inactive Publication Date: 2019-06-25
CHONGQING UNIV OF POSTS & TELECOMM
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

At present, the solving methods of computer double-dummy bridge mainly include hash cache, machine learning, deep learning and their combinations. They have a common defect: if the feature dimen

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A simple easing game solving method based on pruning search
  • A simple easing game solving method based on pruning search
  • A simple easing game solving method based on pruning search

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0048] The technical solutions in the embodiments of the present invention will be described clearly and in detail below with reference to the drawings in the embodiments of the present invention. The described embodiments are only some of the embodiments of the invention.

[0049] The technical scheme that the present invention solves the problems of the technologies described above is:

[0050] A method for solving a simple pruning game based on pruning search, which includes the following steps:

[0051] 101. Establish a decision tree: According to the conclusions drawn from the theoretical research on games, establish a decision tree for pruning and searching for an accurate optimal solution;

[0052] 102. Establish a hash table: establish a hash table, traverse all game instances of orders within a given range, use the process from 103 to 106 to find the optimal solution for each instance, and use the input of each instance as the key , the output is the value written i...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

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.

Description

technical field [0001] The invention belongs to the technical fields of game theory, computer game, set theory, and artificial intelligence, and especially constructs accurate decision tree, hash cache, feature construction, model design, process design, etc. through mathematical reasoning. Background technique [0002] Computer games (also called machine games) are one of the most challenging research directions in the field of artificial intelligence. Card game is an intellectual activity that human beings have been engaged in for a long time. The research and cognition of its generics can not only improve human intelligence, but also have high guiding value for the research of industrial production, economic activities and other science and technology. [0003] The development of computer card games is generally inferior to that of chess, because card games basically have incomplete information. Before computers have moderate artificial intelligence, the strategy analysis...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06N5/04
Inventor 王进罗俊逸孙开伟邓欣陈乔松
Owner CHONGQING UNIV OF POSTS & TELECOMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products