CN108416166A - A kind of Chinese checkers method and system based on Dynamic estimation - Google Patents
A kind of Chinese checkers method and system based on Dynamic estimation Download PDFInfo
- Publication number
- CN108416166A CN108416166A CN201810257452.6A CN201810257452A CN108416166A CN 108416166 A CN108416166 A CN 108416166A CN 201810257452 A CN201810257452 A CN 201810257452A CN 108416166 A CN108416166 A CN 108416166A
- Authority
- CN
- China
- Prior art keywords
- chess game
- next step
- valuation
- current
- dynamic estimation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The Chinese checkers method and system based on Dynamic estimation that the invention discloses a kind of.This method includes：Obtain current chess game；Calculate the valuation of the current chess game；It according to the current chess game, is searched for by pruning algorithms, obtains multiple and different next step chess games；Calculate the valuation of each next step chess game；According to the valuation of the current chess game and the valuation of each next step chess game, the Dynamic estimation of each next step chess game is calculated；Optimal chess game is determined according to the Dynamic estimation of each next step chess game.The method that this method or system use Dynamic estimation, it is different according to the state of chess game, incrementally carry out valuation calculating so that valuation is more accurate, and improves computational efficiency.
Description
Technical field
The present invention relates to computer realms, more particularly to a kind of Chinese checkers method and system based on Dynamic estimation.
Background technology
Existing draughts AI engines, due to that using static depth, static valuation, can not be come dynamically according to situation
Percentage regulation and valuation easily cause the problems such as time overhead is big, valuation is inaccurate.
Also, existing draughts AI engines, which do not do search, to be optimized, high to the search time complexity of game theory.With more
For fork tree, if without optimization, often increase by one layer, time overhead exponential type increases.Thus the influence brought is exactly in certain time
Interior, the search number of plies is few, and chess power is weak.
Invention content
In view of the above-mentioned problems, the present invention provides a kind of Chinese checkers method and system based on Dynamic estimation.
To achieve the above object, the present invention provides following schemes：
A kind of Chinese checkers method based on Dynamic estimation, the method includes：
Obtain current chess game；
Calculate the valuation of the current chess game；
It according to the current chess game, is searched for by pruning algorithms, obtains multiple and different next step chess games；
Calculate the valuation of each next step chess game；
According to the valuation of the current chess game and the valuation of each next step chess game, each next step chess game is calculated
Dynamic estimation；
Optimal chess game is determined according to the Dynamic estimation of each next step chess game.
Optionally, the valuation for calculating the current chess game, specifically includes：
The chess game information of current chess game is recorded, and will be in current chess game information preservation to Hash table；
The valuation of current chess game is calculated according to the current chess game information.
Optionally, the valuation for calculating each next step chess game, specifically includes：
Record the chess game information of each next step chess game；And it will be in next step chess game information preservation to Hash table；
The valuation of next step chess game is calculated according to the next step chess game information.
Optionally, the Dynamic estimation according to each next step chess game determines optimal chess game, specifically includes：
The Dynamic estimation for comparing each next step chess game, obtains maximum Dynamic estimation；
It is optimal chess game to select the corresponding next step chess game of maximum Dynamic estimation.
A kind of Chinese checkers system based on Dynamic estimation, the system comprises：
Acquisition module, for obtaining current chess game；
First valuation computing module, the valuation for calculating the current chess game；
Search module, for according to the current chess game, being searched for by pruning algorithms, obtaining multiple and different next step chesses
Office；
Second valuation computing module, the valuation for calculating each next step chess game；
Dynamic estimation computing module, for according to the valuation of the current chess game and estimating for each next step chess game
Value calculates the Dynamic estimation of each next step chess game；
Determining module, for determining optimal chess game according to the Dynamic estimation of each next step chess game.
Optionally, the first valuation computing module includes：
First recording unit, the chess game information for recording the current chess game, and by current chess game information preservation to breathe out
In uncommon table；
First valuation computing unit, the valuation for calculating current chess game according to the current chess game information.
Optionally, the second valuation computing module includes：
Second recording unit, the chess game information for recording each next step chess game；And next step chess game information preservation is arrived
In Hash table；
Second valuation computing unit, the valuation for calculating next step chess game according to the next step chess game information.
Optionally, the determining module includes：
Comparing unit is used for the Dynamic estimation of more each next step chess game, obtains maximum Dynamic estimation；
Selecting unit is optimal chess game for selecting the corresponding next step chess game of maximum Dynamic estimation.
Compared with prior art, the present invention has the following technical effects：The present invention passes through beta pruning according to the current chess game
Algorithm search obtains multiple and different next step chess games；Then according to the valuation of the current chess game and each next step
The valuation of chess game calculates the Dynamic estimation of each next step chess game；Then according to the Dynamic estimation of each next step chess game
Determine optimal chess game.The method that the present invention uses Dynamic estimation, it is different according to the state of chess game, valuation calculating is incrementally carried out,
So that valuation is more accurate, and improve computational efficiency.
Description of the drawings
It in order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, below will be to institute in embodiment
Attached drawing to be used is needed to be briefly described, it should be apparent that, the accompanying drawings in the following description is only some implementations of the present invention
Example, for those of ordinary skill in the art, without having to pay creative labor, can also be according to these attached drawings
Obtain other attached drawings.
Fig. 1 is the flow chart of Chinese checkers method of the embodiment of the present invention based on Dynamic estimation；
Fig. 2 is the structure diagram of Chinese checkers system of the embodiment of the present invention based on Dynamic estimation.
Specific implementation mode
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation describes, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
In order to make the foregoing objectives, features and advantages of the present invention clearer and more comprehensible, below in conjunction with the accompanying drawings and specific real
Applying mode, the present invention is described in further detail.
Fig. 1 is the flow chart of Chinese checkers method of the embodiment of the present invention based on Dynamic estimation.As shown in Figure 1, a kind of based on dynamic
The Chinese checkers method of state valuation includes the following steps：
Step 101：Obtain current chess game.
Step 102：Calculate the valuation of the current chess game.
The chess game information of current chess game is recorded, and will be in current chess game information preservation to Hash table；
The valuation of current chess game is calculated according to the current chess game information.
Step 103：It according to the current chess game, is searched for by pruning algorithms, obtains multiple and different next step chess games.
Step 104：Calculate the valuation of each next step chess game.
Record the chess game information of each next step chess game；And it will be in next step chess game information preservation to Hash table；
The valuation of next step chess game is calculated according to the next step chess game information.
Step 105：According to the valuation of the current chess game and the valuation of each next step chess game, calculate it is each it is described under
The Dynamic estimation of one step chess game.
Step 106：Optimal chess game is determined according to the Dynamic estimation of each next step chess game.
The Dynamic estimation for comparing each next step chess game, obtains maximum Dynamic estimation；
It is optimal chess game to select the corresponding next step chess game of maximum Dynamic estimation.
Specific embodiment, current chess game are x, and the record information of current state has：Chess piece quantity factor s1, chess piece freedom
Spend s2(quantity in the vacancy that i.e. each chess piece is not contained in all directions), chess piece control force factor s3(i.e. chess piece is contained
The quantity in opposite vacancy), chess piece threated degree s4(i.e. chess piece also has several steps that can be eaten up by opposite), chess piece degree of proclaiming oneself king s5(i.e. chess
Distance of the son away from opposite baseline), chess game formation is laid out s6(for each chess piece, if rear side has two one's own side's chess pieces, for
100, if only one's own side's chess piece, is 50, if not having one's own side's chess piece, for 0).That is state S is with six element group representations：S
=(s1, s2, s3, s4, s5, s6).The valuation of chess game x is Sx(sx1, sx2, sx3, sx4, sx5, sx6).Current chess game information preservation is arrived
In Hash table.For chess game, a huge array is defined, each situation is included in wherein, each situation exists
Unique position is corresponded in array.In this way, data are included in and taking-up is similar to random read-write, do not have time-consuming lookup and
Insertion process.But if each situation is in array if a corresponding position different from other situations, the knot combined
Fruit is that calculator memory is far from enough.Using Hash table to each to be scanned for node, its Hash is calculated
Value to determine position of the situation in Hash table, calculate the data item that another cryptographic Hash is come in checklist whether meet it is desired
That.Orbit salted hash Salteds are to solve the problems, such as repeat search that the when of duplicating chess game in search process will produce.
It is searched for by Alpha-beta, obtains multiple next step chess game a, b.The valuation of chess game x is Sx(sx1, sx2, sx3,
sx4, sx5, sx6), the valuation of chess game a is Sa(sa1, sa2, sa3, sa4, sa5, sa6), the valuation of chess game b is Sib(sb1, sb2, sb3, sb4,
sb5, sb6).So, the Dynamic estimation of chess game a is
Wherein, i=1,2,3,4,5,6, indicate i-th of state.
The Dynamic estimation of chess game b is：
The Dynamic estimation for comparing chess game a, b obtains maximum Dynamic estimation；The corresponding next step chess of the maximum Dynamic estimation of selection
Office is optimal chess game.
According to specific embodiment provided by the invention, the invention discloses following technique effects：The present invention works as according to described
Preceding chess game, is searched for by pruning algorithms, obtains multiple and different next step chess games；Then according to the valuation of the current chess game with
And the valuation of each next step chess game, calculate the Dynamic estimation of each next step chess game；Then according to each next step
The Dynamic estimation of chess game determines optimal chess game.The method that the present invention uses Dynamic estimation, it is different according to the state of chess game, incrementally
Carry out valuation calculating so that valuation is more accurate, and improves computational efficiency.
Fig. 2 is the structure diagram of Chinese checkers system of the embodiment of the present invention based on Dynamic estimation.As shown in Fig. 2, one kind is based on
The Chinese checkers system of Dynamic estimation includes：
Acquisition module 201, for obtaining current chess game；
First valuation computing module 202, the valuation for calculating the current chess game.
The first valuation computing module 202 specifically includes：
First recording unit, the chess game information for recording the current chess game, and by current chess game information preservation to breathe out
In uncommon table；
First valuation computing unit, the valuation for calculating current chess game according to the current chess game information.
Search module 203 is searched for by pruning algorithms for according to the current chess game, is obtained multiple and different next
Walk chess game.
Second valuation computing module 204, the valuation for calculating each next step chess game.
The second valuation computing module 204 specifically includes：
Second recording unit, the chess game information for recording each next step chess game；And next step chess game information preservation is arrived
In Hash table；
Second valuation computing unit, the valuation for calculating next step chess game according to the next step chess game information.
Dynamic estimation computing module 205, for according to the valuation of the current chess game and each next step chess game
Valuation calculates the Dynamic estimation of each next step chess game.
Determining module 206, for determining optimal chess game according to the Dynamic estimation of each next step chess game.
The determining module 206 specifically includes：
Comparing unit is used for the Dynamic estimation of more each next step chess game, obtains maximum Dynamic estimation；
Selecting unit is optimal chess game for selecting the corresponding next step chess game of maximum Dynamic estimation.
Each embodiment is described by the way of progressive in this specification, the highlights of each of the examples are with other
The difference of embodiment, just to refer each other for identical similar portion between each embodiment.For system disclosed in embodiment
For, since it is corresponded to the methods disclosed in the examples, so description is fairly simple, related place is said referring to method part
It is bright.
Principle and implementation of the present invention are described for specific case used herein, and above example is said
The bright method and its core concept for being merely used to help understand the present invention；Meanwhile for those of ordinary skill in the art, foundation
The thought of the present invention, there will be changes in the specific implementation manner and application range.In conclusion the content of the present specification is not
It is interpreted as limitation of the present invention.
Claims (8)
1. a kind of Chinese checkers method based on Dynamic estimation, which is characterized in that the method includes：
Obtain current chess game；
Calculate the valuation of the current chess game；
It according to the current chess game, is searched for by pruning algorithms, obtains multiple and different next step chess games；
Calculate the valuation of each next step chess game；
According to the valuation of the current chess game and the valuation of each next step chess game, the dynamic of each next step chess game is calculated
State valuation；
Optimal chess game is determined according to the Dynamic estimation of each next step chess game.
2. according to the method described in claim 1, it is characterized in that, the valuation for calculating the current chess game, specifically includes：
The chess game information of current chess game is recorded, and will be in current chess game information preservation to Hash table；
The valuation of current chess game is calculated according to the current chess game information.
3. according to the method described in claim 1, it is characterized in that, the valuation for calculating each next step chess game, specifically
Including：
Record the chess game information of each next step chess game；And it will be in next step chess game information preservation to Hash table；
The valuation of next step chess game is calculated according to the next step chess game information.
4. according to the method described in claim 1, it is characterized in that, the Dynamic estimation according to each next step chess game is true
Fixed optimal chess game, specifically includes：
The Dynamic estimation for comparing each next step chess game, obtains maximum Dynamic estimation；
It is optimal chess game to select the corresponding next step chess game of maximum Dynamic estimation.
5. a kind of Chinese checkers system based on Dynamic estimation, which is characterized in that the system comprises：
Acquisition module, for obtaining current chess game；
First valuation computing module, the valuation for calculating the current chess game；
Search module, for according to the current chess game, being searched for by pruning algorithms, obtaining multiple and different next step chess games；
Second valuation computing module, the valuation for calculating each next step chess game；
Dynamic estimation computing module, for according to the valuation of the current chess game and the valuation of each next step chess game, meter
Calculate the Dynamic estimation of each next step chess game；
Determining module, for determining optimal chess game according to the Dynamic estimation of each next step chess game.
6. system according to claim 5, which is characterized in that the first valuation computing module includes：
First recording unit, the chess game information for recording the current chess game, and by current chess game information preservation to Hash table
In；
First valuation computing unit, the valuation for calculating current chess game according to the current chess game information.
7. system according to claim 5, which is characterized in that the second valuation computing module includes：
Second recording unit, the chess game information for recording each next step chess game；And by next step chess game information preservation to Hash
In table；
Second valuation computing unit, the valuation for calculating next step chess game according to the next step chess game information.
8. system according to claim 5, which is characterized in that the determining module includes：
Comparing unit is used for the Dynamic estimation of more each next step chess game, obtains maximum Dynamic estimation；
Selecting unit is optimal chess game for selecting the corresponding next step chess game of maximum Dynamic estimation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810257452.6A CN108416166A (en) | 2018-03-27 | 2018-03-27 | A kind of Chinese checkers method and system based on Dynamic estimation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810257452.6A CN108416166A (en) | 2018-03-27 | 2018-03-27 | A kind of Chinese checkers method and system based on Dynamic estimation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108416166A true CN108416166A (en) | 2018-08-17 |
Family
ID=63133455
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810257452.6A Pending CN108416166A (en) | 2018-03-27 | 2018-03-27 | A kind of Chinese checkers method and system based on Dynamic estimation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108416166A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112755520A (en) * | 2021-01-19 | 2021-05-07 | 寇英翰 | Chess force improving method based on Alpha-Beta pruning algorithm |
-
2018
- 2018-03-27 CN CN201810257452.6A patent/CN108416166A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112755520A (en) * | 2021-01-19 | 2021-05-07 | 寇英翰 | Chess force improving method based on Alpha-Beta pruning algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7537523B2 (en) | Dynamic player groups for interest management in multi-character virtual environments | |
| RU2607621C2 (en) | Method, system and computer-readable data medium for grouping in social networks | |
| KR20200031163A (en) | Neural network structure creation method and device, electronic device, storage medium | |
| JP6356789B2 (en) | Main knowledge point recommendation method and system | |
| CN106650928A (en) | Neural network optimization method and device | |
| CN110472790A (en) | A kind of more unmanned boat paths planning methods, terminal device and storage medium | |
| Deng et al. | An efficient online direction-preserving compression approach for trajectory streaming data | |
| US8218906B2 (en) | Image registration evaluation | |
| CN112001786A (en) | Client credit card limit configuration method and device based on knowledge graph | |
| CN110489574A (en) | A kind of multimedia messages recommended method, device and relevant device | |
| CN108416166A (en) | A kind of Chinese checkers method and system based on Dynamic estimation | |
| Akhmedova et al. | Soft island model for population-based optimization algorithms | |
| CN107679648A (en) | The monthly electricity demand forecasting method of cuckoo chess game optimization double moving average | |
| Köksalan et al. | An approach for finding the most preferred alternative in the presence of multiple criteria | |
| CN112182819B (en) | Structure topology optimization method and system based on weighted graph and readable storage medium | |
| CN109976888A (en) | A kind of data scanning method, device, equipment and storage medium | |
| CN112381360A (en) | Power system parallel recovery partitioning method based on label propagation algorithm and game theory | |
| CN104639495B (en) | The method and apparatus of constellation soft de-mapped | |
| CN116014764B (en) | Distributed energy storage optimization processing method and device | |
| CN116862025A (en) | Model training method, system, client and server node, electronic device and storage medium | |
| Wu et al. | Efficient methods for multi-agent multi-issue negotiation: Allocating resources | |
| CN116017476A (en) | Wireless sensor network coverage design method and device | |
| Gharajeh | T*: a weighted double-heuristic search algorithm to find the shortest path | |
| CN107423513A (en) | A kind of method, equipment and its storage device of four-dimensional interpolation data processing | |
| KR20210134640A (en) | Calculating cross products using MapReduce |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180817 |