CN106776758A - Construction method of card calling database for bridge computer game - Google Patents
Construction method of card calling database for bridge computer game Download PDFInfo
- Publication number
- CN106776758A CN106776758A CN201611034072.3A CN201611034072A CN106776758A CN 106776758 A CN106776758 A CN 106776758A CN 201611034072 A CN201611034072 A CN 201611034072A CN 106776758 A CN106776758 A CN 106776758A
- Authority
- CN
- China
- Prior art keywords
- represent
- bid
- bidtype
- spade
- heart
- 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
- 238000010276 construction Methods 0.000 title claims abstract description 5
- 238000000034 method Methods 0.000 claims abstract description 10
- 230000003993 interaction Effects 0.000 claims abstract description 3
- 229910003460 diamond Inorganic materials 0.000 claims description 81
- 239000010432 diamond Substances 0.000 claims description 81
- GOLXNESZZPUPJE-UHFFFAOYSA-N spiromesifen Chemical compound CC1=CC(C)=CC(C)=C1C(C(O1)=O)=C(OC(=O)CC(C)(C)C)C11CCCC1 GOLXNESZZPUPJE-UHFFFAOYSA-N 0.000 claims description 12
- 235000001808 Ceanothus spinosus Nutrition 0.000 claims description 9
- 241001264786 Ceanothus spinosus Species 0.000 claims description 9
- 206010011469 Crying Diseases 0.000 claims description 7
- 241000196324 Embryophyta Species 0.000 claims description 7
- 230000014509 gene expression Effects 0.000 claims description 5
- 235000013399 edible fruits Nutrition 0.000 claims description 3
- 241000694589 Gesneria viridiflora Species 0.000 claims description 2
- 239000004744 fabric Substances 0.000 claims 1
- 238000005516 engineering process Methods 0.000 description 3
- 208000001613 Gambling Diseases 0.000 description 2
- 238000013473 artificial intelligence Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/21—Design, administration or maintenance of databases
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A construction method of a card-calling database for a bridge computer game is used for calling cards in the initial stage of the bridge computer game. Firstly, a relational card calling database table structure is designed and an extensible card calling database is established. Secondly, an accurate matching card calling method based on a card calling database is disclosed, and the method searches for proper called articles from the card calling database according to card calling information and the card type and click force of the user. When no matched calling article is found, the system inputs the calling article of the human expert in a man-machine interaction mode and expands the card calling database according to the calling article of the human expert.
Description
Technical field
The invention belongs to the computer game field of imperfect information, and in particular to a kind of for bridge computer game
Bid database construction method.
Background technology
Bridge is a kind of riddle being loved by people, comprising bidding and play card two stages.In the stage of bidding, cry
The board type of oneself and board power are expressed according to certain bidding system arranged by board each side, and then decide through consultation and suitably conclude a contract or treaty.
Bridge computer game is realized bidding and playing card automatically using computer program, belongs to Incompletely information games neck
Domain；Automatic bidding is considered as always one of difficulties of bridge computer game system design；Bridge computer is caused to be won
Play chess system bid automatically module complication principal element include：（1）INFORMATION OF INCOMPLETE；（2）Auction is disturbed by other side；
（3）The incompleteness and ambiguity of bidding system；（4）Bidding system is difficult by computer language description.
In the prior art, Ginsberg, M. L. propose a kind of Monte Carlo and bid method（Referring to, Ginsberg,
M. L. (2001). Gib: 《Imperfect information in a computationally challenging
game》, Journal of Artificial Intelligence Research, 2001,）, its key step includes：(1) give
The fixed database Z that bids, is optionally product set B；(2) the set D of consistent gambling party of being bid with history is constructed；(3) for B
In any any gambling party d cried in product b, D, according to the database Z that bids determine selection be product b after it is final conclude a contract or treaty,
And its score is evaluated using double bright solvers, it is designated as s (b, d)；(4) return and cause ∑dS (b, d) it is maximum be product d；Wherein
The database Z that bids is made up of series of rules；The major defect of the technology is：Number of bidding is realized using rule-based mode
According to storehouse so that database of bidding is difficult to retrieve, increase and change.
The content of the invention
The Integral Thought of the technology is that the rule of bidding of bridge is expressed using relational data, and is provided based on this
Retrieval and the extended method of expression way are planted, is bid for the bridge computer game starting stage；Design relation type first is bid
Database table structure simultaneously sets up the database of bidding that can extend, except the built-in body of bidding naturally of standard in database table of bidding
Outside system and accurate bidding system, any one bidding system is can be extended to；Next discloses a kind of based on database of bidding
Accurately mate bid method, the method is searched for properly according to the information of bidding and my board type and point power from database of bidding
Be product；Not finding when being product of matching, what system was input into human expert by way of man-machine interaction is product and basis
The product that cry of human expert extend database of bidding；
（1）Relationship type is bid database table structure such as table 1：
Table 1 is bid database bidsystem
Wherein, " C " represents the showy flowers of herbaceous plants, and " D " represents square, and " H " represents red heart, and " S " represents spade, and " NT " represents no-trump；
Note 1：" ZR " represents nature bidding system, and " JQ " represents accurate bidding system, further, it is also possible to define other bodies of bidding
System；
Note 2：The fields such as Bid, POpenBid, PResponseBid, POpenBid2, OppBid, PCompetiveBid
Span for set 0,11,12,13,14,15,21,22,23,24,25,31,32,33,34,35,
41, 42, 43, 44, 45, 51, 52, 53, 54, 55, 61, 62, 63, 64, 65, 71, 72, 73, 74,
75,80,90 }, " Double " is represented wherein 0 represents " Pass ", 80,90 represent " ReDouble ", 11 represent " 1C ", 12 represent
" 1D ", 13 represent " 1H ", and 14 represent " 1S ", and 15 represent " 1NT ", and 21 represent " 2C ", and 22 represent " 2D ", and 23 represent " 2H ", 24 tables
Show " 2S ", 25 represent " 2NT ", 31 represent " 3C ", 32 represent " 3D ", 33 represent " 3H ", 34 represent " 3S ", 35 represent " 3NT ", 41
Represent " 4C ", 42 represent " 4D ", 43 represent " 4H ", 44 represent " 4S ", 45 represent " 4NT ", 51 represent " 5C ", 52 represent " 5D ",
53 represent " 5H ", and 54 represent " 5S ", and 55 represent " 5NT ", and 61 represent " 6C ", and 62 represent " 6D ", and 63 represent " 6H ", and 64 represent
" 6S ", 65 represent " 6NT ", and 71 represent " 7C ", and 72 represent " 7D ", and 73 represent " 7H ", and 74 represent " 7S ", and 75 represent " 7NT "；
Note 3：1 represent " open and cry ", 2 represent " should cry ", 3 represent " opening cry side to cry again ", 4 expressions " strive and cry ", 5 expressions " should the side of crying again
Cry ", 6 represent " strive and cry and should cry "；
Note 4：As BidType=2, the field represents that companion opens and is product；As BidType=3, the field is represented to open in person and cried
Be product；
Note 5：As BidType=3, the field represents that companion should be product；As BidType=5, the field represents that I should cry
It is product；
Note 6：As BidType=5, the field represents out that what the side of crying named again is product；
Note 7：As BidType=4, the field represents that other side is not that the newest of Pass is product；
Note 8：As BidType=6, the field represents that companion strives and is product；
Note 9：When two kinds and the above all meet condition product, selection priority it is big be product；
Note 10：0 represents uncertain；
Note 11：0 represents without limitation, and 1 represents that square number is less than showy flowers of herbaceous plants number, and 2 represent square number more than or equal to grass
Flower number；
Note 12：0 represents without limitation, and 1 represents that spade number is less than red heart number, and 2 represent spade number more than or equal to red
Heart number.
（2）Bid database accurately mate and dynamic expansion method：
Input：OurSystem represents our bidding system, and OppSystem represents other side's bidding system, and MyCard represents me
Board set, HistoryBid represents history product queue, and HumanBid represents that human expert is product；
Output：MyBid represents that what will be outputed in person is product；
Step 1, initialization：
My high card points power pt, showy flowers of herbaceous plants number club, square number diamond, red heart number is calculated according to MyCard
Heart, spade number spade；
If diamond>=club, then dvc be set to 2;If diamond<Club, then dvc be set to 1；
If spade>=heart, then svh be set to 2;If spade<Heart, then svh be set to 1；
If HistoryBidND is the element set in HistoryBid queues less than 80, it is set to set maxbid
The maximum of element in HistoryBidND；
Step 2, determined to bid type B idType according to HistoryBid；
Step 3, the accurate ratio of database of bidding are matched somebody with somebody：If BidType=1,3.1 are gone to step；If BidType=2,3.2 are gone to step；
BidType=3, goes to step 3.3；BidType=4, goes to step 3.4；BidType=5, goes to step 3.5；BidType=6, goes to step
3.6；If the value of BidType in { 1,2,3,4,5,6 } is gathered, does not then go to step 3.7；
Step 3.1,
SQL query statement searchstr is generated according to following sentence:
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system=’%s’ and BidType=1 and %d*PMin>=PMin*PMin and %d*PMax<=PMax*PMax and %
d*CMin>=CMin*CMin and %d*CMax<=CMax*CMax and %d*DMin>=DMin*DMin and %d*DMax<=
DMax*DMax and %d*HMin>=HMin*HMin and %d*HMax<=HMax*HMax and %d*SMin>=SMin*
SMin and %d*SMax<=SMax*SMax and %d*DvsC=DvsC*DvsC and %d*SvsH=SvsH*SvsH order
by Priority desc",OurSystem,pt,pt,club,club,diamond,diamond,heart,heart,
spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If there is the record for meeting condition, then the value of MyBid is set to first Bid field value of record and returned；Such as
Fruit does not meet the record of condition, then go to step 4；
Step 3.2,
Companion is obtained from HistoryBid open and be product bid1, SQL query statement searchstr is generated according to following sentence：
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system=’%s’ and BidType=2 and POpenBid='%s' and %d*PMin>=PMin*PMin and %d*
PMax<=PMax*PMax and %d*CMin>=CMin*CMin and %d*CMax<=CMax*CMax and %d*DMin>=
DMin*DMin and %d*DMax<=DMax*DMax and %d*HMin>=HMin*HMin and %d*HMax<=HMax*
HMax and %d*SMin>=SMin*SMin and %d*SMax<=SMax*SMax and %d*DvsC=DvsC*DvsC and
%d*SvsH=SvsH*SvsH order by Priority desc", OurSystem , bid1,pt,pt,club,club,
diamond,diamond,heart,heart,spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If not meeting the record of condition, 4 are gone to step；
If there is the record for meeting condition, then bid is set to first Bid field value of record；
If bid<=maxbid, then set Mybid and be 0 and return；
If bid>Maxbid, then set the value of Mybid for bid and return；
Step 3.3,
To obtain open in person from HistoryBid makes product bid2 and the companion should to be product bid3, and SQL is generated according to following sentence
Query statement searchstr：
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system=’%s’ and BidType=3 and POpenBid=%d and PResponseBid=%d and %d*PMin>=
PMin*PMin and %d*PMax<=PMax*PMax and %d*CMin>=CMin*CMin and %d*CMax<=CMax*
CMax and %d*DMin>=DMin*DMin and %d*DMax<=DMax*DMax and %d*HMin>=HMin*HMin and
%d*HMax<=HMax*HMax and %d*SMin>=SMin*SMin and %d*SMax<=SMax*SMax and %d*DvsC=
DvsC*DvsC and %d*SvsH=SvsH*SvsH order by Priority desc", OurSystem ,bid2,
bid3,pt,pt,club,club,diamond,diamond,heart,heart,spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If not meeting the record of condition, 4 are gone to step；
If there is the record for meeting condition, then bid is set to first Bid field value of record；
If bid<=maxbid, then set Mybid and be 0 and return；
If bid>Maxbid, then set the value of Mybid for bid and return；
Step 3.4,
The newest non-Pass of other side is obtained from HistoryBid and is product bid4, SQL query statement is generated according to following sentence
searchstr：
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system='%s' and BidType=4 and OppBid=%d and %d*PMin>=PMin*PMin and %d*PMax<=
PMax*PMax and %d*CMin>=CMin*CMin and %d*CMax<=CMax*CMax and %d*DMin>=DMin*
DMin and %d*DMax<=DMax*DMax and %d*HMin>=HMin*HMin and %d*HMax<=HMax*HMax and
%d*SMin>=SMin*SMin and %d*SMax<=SMax*SMax and %d*DvsC=DvsC*DvsC and %d*SvsH=
SvsH*SvsH order by Priority desc", OurSystem ,bid4,pt,pt,club,club,diamond,
diamond,heart,heart,spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If there is the record for meeting condition, then the value of MyBid is set to first Bid field value of record and returned；
If not meeting the record of condition, 4 are gone to step；
Step 3.5,
Obtained from HistoryBid companion open cry product bid1, I should bid bid5, open the side of crying and be product bid6, root again
Sentence is descended to generate SQL query statement searchstr according to this：
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system='%s' and BidType=5 and POpenBid=%d and PResponseBid=%d and POpenBid2=%
d and %d*PMin>=PMin*PMin and %d*PMax<=PMax*PMax and %d*CMin>=CMin*CMin and %
d*CMax<=CMax*CMax and %d*DMin>=DMin*DMin and %d*DMax<=DMax*DMax and %d*HMin>=
HMin*HMin and %d*HMax<=HMax*HMax and %d*SMin>=SMin*SMin and %d*SMax<=SMax*
SMax and %d*DvsC=DvsC*DvsC and %d*SvsH=SvsH*SvsH order by Priority desc",
OurSystem, bid1, bid5, bid6, pt, pt, club, club, diamond, diamond, heart,
heart, spade, spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If not meeting the record of condition, 4 are gone to step；
If there is the record for meeting condition, then bid is set to first Bid field value of record；
If bid<=maxbid, then set Mybid and be 0 and return；
If bid>Maxbid, then set the value of Mybid for bid and return；
Step 3.6,
Companion is obtained from HistoryBid strive and be product bid7, SQL query statement searchstr is generated according to following sentence:
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system='%s' and BidType=6 and PCompetiveBid=%d and %d*PMin>=PMin*PMin and %d*
PMax<=PMax*PMax and %d*CMin>=CMin*CMin and %d*CMax<=CMax*CMax and %d*DMin>=
DMin*DMin and %d*DMax<=DMax*DMax and %d*HMin>=HMin*HMin and %d*HMax<=HMax*
HMax and %d*SMin>=SMin*SMin and %d*SMax<=SMax*SMax and %d*DvsC=DvsC*DvsC and
%d*SvsH=SvsH*SvsH order by Priority desc", OurSystem, bid7,pt,pt,club,club,
diamond,diamond,heart,heart,spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If not meeting the record of condition, 4 are gone to step；
If there is the record for meeting condition, then bid is set to first Bid field value of record；
If bid<=maxbid, then set Mybid and be 0 and return；
If bid>Maxbid, then set the value of Mybid for bid and return；
Step 3.7, the value of setting Mybid are HumanBid and return；
Step 4, Database Dynamic of bidding extension：
If BidType=1,4.1 are gone to step；If BidType=2,4.2 are gone to step；BidType=3, goes to step 4.3；
BidType=4, goes to step 4.4；BidType=5, goes to step 4.5；BidType=6, goes to step 4.6；
Step 4.1,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, PMin, PMax, CMin, CMax, DMin, DMax, HMin, HMax, SMin, SMax, DvsC,
SvsH, Bid) VALUES (’%s’, 1, %d, %d, %d, %d, %d, %d, %d, %d, %d, %d, 0, 0,
HumanBid)", OurSystem, pt,pt,club,club,diamond,diamond,heart,heart,spade,
spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and the value for setting Mybid is
HumanBid is simultaneously returned；
Step 4.2,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, POpenBid, PMin, PMax, CMin, CMax, DMin, DMax, HMin, HMax, SMin,
SMax, DvsC, SvsH, Bid) VALUES (’%s’, 2, %d, %d, %d, %d, %d, %d, %d, %d, %d, %
d, %d, 0, 0, HumanBid)", OurSystem, bid1,pt,pt,club,club,diamond,diamond,
heart,heart,spade,spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and the value for setting Mybid is
HumanBid is simultaneously returned；
Step 4.3,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, POpenBid, PResponseBid, PMin, PMax, CMin, CMax, DMin, DMax, HMin,
HMax, SMin, SMax, DvsC, SvsH, Bid) VALUES (’%s’, 3, %d, %d, %d, %d, %d, %d, %
d, %d, %d, %d, %d, %d, 0, 0, HumanBid)", OurSystem, bid2, bid3,pt,pt,club,
club,diamond,diamond,heart,heart,spade,spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and the value for setting Mybid is
HumanBid is simultaneously returned；
Step 4.4,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, OppBid, PMin, PMax, CMin, CMax, DMin, DMax, HMin, HMax, SMin, SMax,
DvsC, SvsH, Bid) VALUES (’%s’, 4, %d, %d, %d, %d, %d, %d, %d, %d, %d, %d, %d,
0, 0, HumanBid)", OurSystem, bid4,pt,pt,club,club,diamond,diamond,heart,
heart,spade,spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and the value for setting Mybid is
HumanBid is simultaneously returned；
Step 4.5,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, POpenBid, PResponseBid, POpenBid2,PMin, PMax, CMin, CMax, DMin,
DMax, HMin, HMax, SMin, SMax, DvsC, SvsH, Bid) VALUES (’%s’, 5, %d, %d, %d, %
d, %d, %d, %d, %d, %d, %d, %d, %d, %d, 0, 0, HumanBid)", OurSystem, bid1,
bid5, bid6, pt, pt, club, club, diamond, diamond, heart, heart, spade,
spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and the value for setting Mybid is
HumanBid is simultaneously returned；
Step 4.6,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, PCompetiveBid, PMin, PMax, CMin, CMax, DMin, DMax, HMin, HMax, SMin,
SMax, DvsC, SvsH, Bid) VALUES (’%s’, 6, %d, %d, %d, %d, %d, %d, %d, %d, %d, %
d, %d, 0, 0, HumanBid)", OurSystem, bid7,pt,pt,club,club,diamond,diamond,
heart,heart,spade,spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and the value for setting Mybid is
HumanBid is simultaneously returned.
Specific embodiment
Described in detail specific embodiment of the invention by taking standard nature bidding system as an example below.
The rule of bidding of standard nature bidding system is added in the database bidsystem that bids first, for example, table 2
Give the part record of database of bidding.
Table 2 bid database part record
| Sy st em | Bi d | Bi dT yp e | PO pe nB id | PR es po ns eB id | PO pe nB id 2 | Op pB Id | PC om pe ti ve Bi d | Pr io ri ty | PM in | PM ax | CM in | CM ax | DM in | DM ax | HM in | HM ax | SM in | SM ax | Dv sC | SvsH |
| ZR | 0 | 1 | 0 | 0 | 11 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |||||
| ZR | 11 | 1 | 1 | 12 | 21 | 3 | 3 | 3 | 3 | 0 | 4 | 0 | 4 | 0 | 0 | |||||
| ZR | 11 | 1 | 1 | 12 | 21 | 3 | 3 | 2 | 2 | 4 | 4 | 4 | 4 | 0 | 0 | |||||
| ZR | 11 | 1 | 1 | 12 | 21 | 4 | 0 | 0 | 0 | 0 | 4 | 0 | 4 | 1 | 0 | |||||
| ZR | 12 | 1 | 1 | 12 | 21 | 2 | 2 | 3 | 3 | 0 | 4 | 0 | 4 | 0 | 0 | |||||
| ZR | 12 | 1 | 1 | 12 | 21 | 0 | 0 | 4 | 0 | 0 | 4 | 0 | 4 | 2 | 0 | |||||
| ZR | 12 | 2 | 11 | 1 | 6 | 0 | 0 | 0 | 4 | 0 | 0 | 3 | 0 | 3 | 0 | 0 | ||||
| ZR | 13 | 2 | 11 | 1 | 6 | 0 | 0 | 0 | 0 | 0 | 4 | 0 | 0 | 0 | 0 | 0 | ||||
| ZR | 14 | 2 | 11 | 1 | 6 | 0 | 0 | 0 | 0 | 0 | 0 | 3 | 4 | 0 | 0 | 0 |
It is " ZR " to set OurSystem, and it is " ZR " to set OppSystem, is input into the set MyCard of my board, and history is product
Queue HistoryBid.
Step 1, initialization：My high card points power pt, showy flowers of herbaceous plants number club, square number is calculated according to MyCard
Diamond, red heart number heart, spade number spade；
If diamond>=club, then dvc be set to 2;If diamond<Club, then dvc be set to 1；
If spade>=heart, then svh be set to 2;If spade<Heart, then svh be set to 1；
If HistoryBidND is the element set in HistoryBid queues less than 80, it is set to set maxbid
The maximum of element in HistoryBidND.
Step 2, determined to bid type B idType according to HistoryBid.
Step 3, the accurate ratio of database of bidding are matched somebody with somebody：If BidType=1,3.1 are gone to step；If BidType=2, go to step
3.2；BidType=3, goes to step 3.3；BidType=4, goes to step 3.4；BidType=5, goes to step 3.5；BidType=6, turns
Step 3.6；If the value of BidType in { 1,2,3,4,5,6 } is gathered, does not then go to step 3.7.
Step 3.1,
SQL query statement searchstr is generated according to following sentence:
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system=’%s’ and BidType=1 and %d*PMin>=PMin*PMin and %d*PMax<=PMax*PMax and %
d*CMin>=CMin*CMin and %d*CMax<=CMax*CMax and %d*DMin>=DMin*DMin and %d*DMax<=
DMax*DMax and %d*HMin>=HMin*HMin and %d*HMax<=HMax*HMax and %d*SMin>=SMin*
SMin and %d*SMax<=SMax*SMax and %d*DvsC=DvsC*DvsC and %d*SvsH=SvsH*SvsH order
by Priority desc",OurSystem,pt,pt,club,club,diamond,diamond,heart,heart,
spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If there is the record for meeting condition, then the value of MyBid is set to first Bid field value of record and returned；Such as
Fruit does not meet the record of condition, then go to step 4.
Step 3.2,
Companion is obtained from HistoryBid open and be product bid1, SQL query statement searchstr is generated according to following sentence：
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system=’%s’ and BidType=2 and POpenBid='%s' and %d*PMin>=PMin*PMin and %d*
PMax<=PMax*PMax and %d*CMin>=CMin*CMin and %d*CMax<=CMax*CMax and %d*DMin>=
DMin*DMin and %d*DMax<=DMax*DMax and %d*HMin>=HMin*HMin and %d*HMax<=HMax*
HMax and %d*SMin>=SMin*SMin and %d*SMax<=SMax*SMax and %d*DvsC=DvsC*DvsC and
%d*SvsH=SvsH*SvsH order by Priority desc", OurSystem , bid1,pt,pt,club,club,
diamond,diamond,heart,heart,spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If not meeting the record of condition, 4 are gone to step；
If there is the record for meeting condition, then bid is set to first Bid field value of record；
If bid<=maxbid, then set Mybid and be 0 and return；
If bid>Maxbid, then set the value of Mybid for bid and return.
Step 3.3,
To obtain open in person from HistoryBid makes product bid2 and the companion should to be product bid3, and SQL is generated according to following sentence
Query statement searchstr：
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system=’%s’ and BidType=3 and POpenBid=%d and PResponseBid=%d and %d*PMin>=
PMin*PMin and %d*PMax<=PMax*PMax and %d*CMin>=CMin*CMin and %d*CMax<=CMax*
CMax and %d*DMin>=DMin*DMin and %d*DMax<=DMax*DMax and %d*HMin>=HMin*HMin and
%d*HMax<=HMax*HMax and %d*SMin>=SMin*SMin and %d*SMax<=SMax*SMax and %d*DvsC=
DvsC*DvsC and %d*SvsH=SvsH*SvsH order by Priority desc", OurSystem ,bid2,
bid3,pt,pt,club,club,diamond,diamond,heart,heart,spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If not meeting the record of condition, 4 are gone to step；
If there is the record for meeting condition, then bid is set to first Bid field value of record；
If bid<=maxbid, then set Mybid and be 0 and return；
If bid>Maxbid, then set the value of Mybid for bid and return.
Step 3.4,
The newest non-Pass of other side is obtained from HistoryBid and is product bid4, SQL query statement is generated according to following sentence
searchstr：
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system='%s' and BidType=4 and OppBid=%d and %d*PMin>=PMin*PMin and %d*PMax<=
PMax*PMax and %d*CMin>=CMin*CMin and %d*CMax<=CMax*CMax and %d*DMin>=DMin*
DMin and %d*DMax<=DMax*DMax and %d*HMin>=HMin*HMin and %d*HMax<=HMax*HMax and
%d*SMin>=SMin*SMin and %d*SMax<=SMax*SMax and %d*DvsC=DvsC*DvsC and %d*SvsH=
SvsH*SvsH order by Priority desc", OurSystem ,bid4,pt,pt,club,club,diamond,
diamond,heart,heart,spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If there is the record for meeting condition, then the value of MyBid is set to first Bid field value of record and returned；
If not meeting the record of condition, 4 are gone to step.
Step 3.5,
Obtained from HistoryBid companion open cry product bid1, I should bid bid5, open the side of crying and be product bid6, root again
Sentence is descended to generate SQL query statement searchstr according to this：
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system='%s' and BidType=5 and POpenBid=%d and PResponseBid=%d and POpenBid2=%
d and %d*PMin>=PMin*PMin and %d*PMax<=PMax*PMax and %d*CMin>=CMin*CMin and %
d*CMax<=CMax*CMax and %d*DMin>=DMin*DMin and %d*DMax<=DMax*DMax and %d*HMin>=
HMin*HMin and %d*HMax<=HMax*HMax and %d*SMin>=SMin*SMin and %d*SMax<=SMax*
SMax and %d*DvsC=DvsC*DvsC and %d*SvsH=SvsH*SvsH order by Priority desc",
OurSystem, bid1, bid5, bid6, pt, pt, club, club, diamond, diamond, heart,
heart, spade, spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If not meeting the record of condition, 4 are gone to step；
If there is the record for meeting condition, then bid is set to first Bid field value of record；
If bid<=maxbid, then set Mybid and be 0 and return；
If bid>Maxbid, then set the value of Mybid for bid and return.
Step 3.6,
Companion is obtained from HistoryBid strive and be product bid7, SQL query statement searchstr is generated according to following sentence:
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system='%s' and BidType=6 and PCompetiveBid=%d and %d*PMin>=PMin*PMin and %d*
PMax<=PMax*PMax and %d*CMin>=CMin*CMin and %d*CMax<=CMax*CMax and %d*DMin>=
DMin*DMin and %d*DMax<=DMax*DMax and %d*HMin>=HMin*HMin and %d*HMax<=HMax*
HMax and %d*SMin>=SMin*SMin and %d*SMax<=SMax*SMax and %d*DvsC=DvsC*DvsC and
%d*SvsH=SvsH*SvsH order by Priority desc", OurSystem, bid7,pt,pt,club,club,
diamond,diamond,heart,heart,spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If not meeting the record of condition, 4 are gone to step；
If there is the record for meeting condition, then bid is set to first Bid field value of record；
If bid<=maxbid, then set Mybid and be 0 and return；
If bid>Maxbid, then set the value of Mybid for bid and return.
Step 3.7, input human expert are product HumanBid, set the value of Mybid for HumanBid and return.
Step 4, Database Dynamic of bidding extension：
If BidType=1,4.1 are gone to step；If BidType=2,4.2 are gone to step；BidType=3, goes to step 4.3；
BidType=4, goes to step 4.4；BidType=5, goes to step 4.5；BidType=6, goes to step 4.6.
Step 4.1,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, PMin, PMax, CMin, CMax, DMin, DMax, HMin, HMax, SMin, SMax, DvsC,
SvsH, Bid) VALUES (’%s’, 1, %d, %d, %d, %d, %d, %d, %d, %d, %d, %d, 0, 0,
HumanBid)", OurSystem, pt,pt,club,club,diamond,diamond,heart,heart,spade,
spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and input human expert is product
HumanBid, sets the value of Mybid for HumanBid and returns.
Step 4.2,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, POpenBid, PMin, PMax, CMin, CMax, DMin, DMax, HMin, HMax, SMin,
SMax, DvsC, SvsH, Bid) VALUES (’%s’, 2, %d, %d, %d, %d, %d, %d, %d, %d, %d, %
d, %d, 0, 0, HumanBid)", OurSystem, bid1,pt,pt,club,club,diamond,diamond,
heart,heart,spade,spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and input human expert is product
HumanBid, sets the value of Mybid for HumanBid and returns.
Step 4.3,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, POpenBid, PResponseBid, PMin, PMax, CMin, CMax, DMin, DMax, HMin,
HMax, SMin, SMax, DvsC, SvsH, Bid) VALUES (’%s’, 3, %d, %d, %d, %d, %d, %d, %
d, %d, %d, %d, %d, %d, 0, 0, HumanBid)", OurSystem, bid2, bid3,pt,pt,club,
club,diamond,diamond,heart,heart,spade,spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and input human expert is product
HumanBid, sets the value of Mybid for HumanBid and returns.
Step 4.4,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, OppBid, PMin, PMax, CMin, CMax, DMin, DMax, HMin, HMax, SMin, SMax,
DvsC, SvsH, Bid) VALUES (’%s’, 4, %d, %d, %d, %d, %d, %d, %d, %d, %d, %d, %d,
0, 0, HumanBid)", OurSystem, bid4,pt,pt,club,club,diamond,diamond,heart,
heart,spade,spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and input human expert is product
HumanBid, sets the value of Mybid for HumanBid and returns.
Step 4.5,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, POpenBid, PResponseBid, POpenBid2,PMin, PMax, CMin, CMax, DMin,
DMax, HMin, HMax, SMin, SMax, DvsC, SvsH, Bid) VALUES (’%s’, 5, %d, %d, %d, %
d, %d, %d, %d, %d, %d, %d, %d, %d, %d, 0, 0, HumanBid)", OurSystem, bid1,
bid5, bid6, pt, pt, club, club, diamond, diamond, heart, heart, spade,
spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and input human expert is product
HumanBid, sets the value of Mybid for HumanBid and returns.
Step 4.6,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, PCompetiveBid, PMin, PMax, CMin, CMax, DMin, DMax, HMin, HMax, SMin,
SMax, DvsC, SvsH, Bid) VALUES (’%s’, 6, %d, %d, %d, %d, %d, %d, %d, %d, %d, %
d, %d, 0, 0, HumanBid)", OurSystem, bid7,pt,pt,club,club,diamond,diamond,
heart,heart,spade,spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and input human expert is product
HumanBid, sets the value of Mybid for HumanBid and returns.
Claims (1)
1. a kind of database construction method of bidding for bridge computer game, is named for the bridge computer game starting stage
Board；Design relation type is bid and database table structure and sets up the database of bidding that can extend first, is removed in database table of bidding
Outside the natural bidding system and accurate bidding system of built-in standard, any one bidding system is can be extended to；Secondly it is public
A kind of accurately mate based on database of bidding of cloth is bid method, and the method is according to the information of bidding and my board type and point power
Search is suitably product from database of bidding；When being product of matching is not being found, system is defeated by way of man-machine interaction
Enter being product and extending database of bidding according to the product that cry of human expert for human expert；
（1）Relationship type is bid database table structure such as table 1：
Table 1 is bid database bidsystem
Wherein, " C " represents the showy flowers of herbaceous plants, and " D " represents square, and " H " represents red heart, and " S " represents spade, and " NT " represents no-trump；
Note 1：" ZR " represents nature bidding system, and " JQ " represents accurate bidding system, further, it is also possible to define other bodies of bidding
System；
Note 2：The fields such as Bid, POpenBid, PResponseBid, POpenBid2, OppBid, PCompetiveBid
Span for set 0,11,12,13,14,15,21,22,23,24,25,31,32,33,34,35,
41, 42, 43, 44, 45, 51, 52, 53, 54, 55, 61, 62, 63, 64, 65, 71, 72, 73, 74,
75,80,90 }, " Double " is represented wherein 0 represents " Pass ", 80,90 represent " ReDouble ", 11 represent " 1C ", 12 represent
" 1D ", 13 represent " 1H ", and 14 represent " 1S ", and 15 represent " 1NT ", and 21 represent " 2C ", and 22 represent " 2D ", and 23 represent " 2H ", 24 tables
Show " 2S ", 25 represent " 2NT ", 31 represent " 3C ", 32 represent " 3D ", 33 represent " 3H ", 34 represent " 3S ", 35 represent " 3NT ", 41
Represent " 4C ", 42 represent " 4D ", 43 represent " 4H ", 44 represent " 4S ", 45 represent " 4NT ", 51 represent " 5C ", 52 represent " 5D ",
53 represent " 5H ", and 54 represent " 5S ", and 55 represent " 5NT ", and 61 represent " 6C ", and 62 represent " 6D ", and 63 represent " 6H ", and 64 represent
" 6S ", 65 represent " 6NT ", and 71 represent " 7C ", and 72 represent " 7D ", and 73 represent " 7H ", and 74 represent " 7S ", and 75 represent " 7NT "；
Note 3：1 represent " open and cry ", 2 represent " should cry ", 3 represent " opening cry side to cry again ", 4 expressions " strive and cry ", 5 expressions " should the side of crying again
Cry ", 6 represent " strive and cry and should cry "；
Note 4：As BidType=2, the field represents that companion opens and is product；As BidType=3, the field is represented to open in person and cried
Be product；
Note 5：As BidType=3, the field represents that companion should be product；As BidType=5, the field represents that I should cry
It is product；
Note 6：As BidType=5, the field represents out that what the side of crying named again is product；
Note 7：As BidType=4, the field represents that other side is not that the newest of Pass is product；
Note 8：As BidType=6, the field represents that companion strives and is product；
Note 9：When two kinds and the above all meet condition product, selection priority it is big be product；
Note 10：0 represents uncertain；
Note 11：0 represents without limitation, and 1 represents that square number is less than showy flowers of herbaceous plants number, and 2 represent square number more than or equal to grass
Flower number；
Note 12：0 represents without limitation, and 1 represents that spade number is less than red heart number, and 2 represent spade number more than or equal to red
Heart number；
（2）Bid database accurately mate and dynamic expansion method：
Input：OurSystem represents our bidding system, and OppSystem represents other side's bidding system, and MyCard represents me
Board set, HistoryBid represents history product queue, and HumanBid represents that human expert is product；
Output：MyBid represents that what will be outputed in person is product；
Step 1, initialization：
My high card points power pt, showy flowers of herbaceous plants number club, square number diamond, red heart number is calculated according to MyCard
Heart, spade number spade；
If diamond>=club, then dvc be set to 2;If diamond<Club, then dvc be set to 1；
If spade>=heart, then svh be set to 2;If spade<Heart, then svh be set to 1；
If HistoryBidND is the element set in HistoryBid queues less than 80, it is set to set maxbid
The maximum of element in HistoryBidND；
Step 2, determined to bid type B idType according to HistoryBid；
Step 3, the accurate ratio of database of bidding are matched somebody with somebody：If BidType=1,3.1 are gone to step；If BidType=2,3.2 are gone to step；
BidType=3, goes to step 3.3；BidType=4, goes to step 3.4；BidType=5, goes to step 3.5；BidType=6, goes to step
3.6；If the value of BidType in { 1,2,3,4,5,6 } is gathered, does not then go to step 3.7；
Step 3.1,
SQL query statement searchstr is generated according to following sentence:
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system=’%s’ and BidType=1 and %d*PMin>=PMin*PMin and %d*PMax<=PMax*PMax and %
d*CMin>=CMin*CMin and %d*CMax<=CMax*CMax and %d*DMin>=DMin*DMin and %d*DMax<=
DMax*DMax and %d*HMin>=HMin*HMin and %d*HMax<=HMax*HMax and %d*SMin>=SMin*
SMin and %d*SMax<=SMax*SMax and %d*DvsC=DvsC*DvsC and %d*SvsH=SvsH*SvsH order
by Priority desc",OurSystem,pt,pt,club,club,diamond,diamond,heart,heart,
spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If there is the record for meeting condition, then the value of MyBid is set to first Bid field value of record and returned；Such as
Fruit does not meet the record of condition, then go to step 4；
Step 3.2,
Companion is obtained from HistoryBid open and be product bid1, SQL query statement searchstr is generated according to following sentence：
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system=’%s’ and BidType=2 and POpenBid='%s' and %d*PMin>=PMin*PMin and %d*
PMax<=PMax*PMax and %d*CMin>=CMin*CMin and %d*CMax<=CMax*CMax and %d*DMin>=
DMin*DMin and %d*DMax<=DMax*DMax and %d*HMin>=HMin*HMin and %d*HMax<=HMax*
HMax and %d*SMin>=SMin*SMin and %d*SMax<=SMax*SMax and %d*DvsC=DvsC*DvsC and
%d*SvsH=SvsH*SvsH order by Priority desc", OurSystem , bid1,pt,pt,club,club,
diamond,diamond,heart,heart,spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If not meeting the record of condition, 4 are gone to step；
If there is the record for meeting condition, then bid is set to first Bid field value of record；
If bid<=maxbid, then set Mybid and be 0 and return；
If bid>Maxbid, then set the value of Mybid for bid and return；
Step 3.3,
To obtain open in person from HistoryBid makes product bid2 and the companion should to be product bid3, and SQL is generated according to following sentence
Query statement searchstr：
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system=’%s’ and BidType=3 and POpenBid=%d and PResponseBid=%d and %d*PMin>=
PMin*PMin and %d*PMax<=PMax*PMax and %d*CMin>=CMin*CMin and %d*CMax<=CMax*
CMax and %d*DMin>=DMin*DMin and %d*DMax<=DMax*DMax and %d*HMin>=HMin*HMin and
%d*HMax<=HMax*HMax and %d*SMin>=SMin*SMin and %d*SMax<=SMax*SMax and %d*DvsC=
DvsC*DvsC and %d*SvsH=SvsH*SvsH order by Priority desc", OurSystem ,bid2,
bid3,pt,pt,club,club,diamond,diamond,heart,heart,spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If not meeting the record of condition, 4 are gone to step；
If there is the record for meeting condition, then bid is set to first Bid field value of record；
If bid<=maxbid, then set Mybid and be 0 and return；
If bid>Maxbid, then set the value of Mybid for bid and return；
Step 3.4,
The newest non-Pass of other side is obtained from HistoryBid and is product bid4, SQL query statement is generated according to following sentence
searchstr：
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system='%s' and BidType=4 and OppBid=%d and %d*PMin>=PMin*PMin and %d*PMax<=
PMax*PMax and %d*CMin>=CMin*CMin and %d*CMax<=CMax*CMax and %d*DMin>=DMin*
DMin and %d*DMax<=DMax*DMax and %d*HMin>=HMin*HMin and %d*HMax<=HMax*HMax and
%d*SMin>=SMin*SMin and %d*SMax<=SMax*SMax and %d*DvsC=DvsC*DvsC and %d*SvsH=
SvsH*SvsH order by Priority desc", OurSystem ,bid4,pt,pt,club,club,diamond,
diamond,heart,heart,spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If there is the record for meeting condition, then the value of MyBid is set to first Bid field value of record and returned；
If not meeting the record of condition, 4 are gone to step；
Step 3.5,
Obtained from HistoryBid companion open cry product bid1, I should bid bid5, open the side of crying and be product bid6, root again
Sentence is descended to generate SQL query statement searchstr according to this：
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system='%s' and BidType=5 and POpenBid=%d and PResponseBid=%d and POpenBid2=%
d and %d*PMin>=PMin*PMin and %d*PMax<=PMax*PMax and %d*CMin>=CMin*CMin and %
d*CMax<=CMax*CMax and %d*DMin>=DMin*DMin and %d*DMax<=DMax*DMax and %d*HMin>=
HMin*HMin and %d*HMax<=HMax*HMax and %d*SMin>=SMin*SMin and %d*SMax<=SMax*
SMax and %d*DvsC=DvsC*DvsC and %d*SvsH=SvsH*SvsH order by Priority desc",
OurSystem, bid1, bid5, bid6, pt, pt, club, club, diamond, diamond, heart,
heart, spade, spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If not meeting the record of condition, 4 are gone to step；
If there is the record for meeting condition, then bid is set to first Bid field value of record；
If bid<=maxbid, then set Mybid and be 0 and return；
If bid>Maxbid, then set the value of Mybid for bid and return；
Step 3.6,
Companion is obtained from HistoryBid strive and be product bid7, SQL query statement searchstr is generated according to following sentence:
sprintf_s(searchstr,sizeof(searchstr),"select * from bidsystem where
system='%s' and BidType=6 and PCompetiveBid=%d and %d*PMin>=PMin*PMin and %d*
PMax<=PMax*PMax and %d*CMin>=CMin*CMin and %d*CMax<=CMax*CMax and %d*DMin>=
DMin*DMin and %d*DMax<=DMax*DMax and %d*HMin>=HMin*HMin and %d*HMax<=HMax*
HMax and %d*SMin>=SMin*SMin and %d*SMax<=SMax*SMax and %d*DvsC=DvsC*DvsC and
%d*SvsH=SvsH*SvsH order by Priority desc", OurSystem, bid7,pt,pt,club,club,
diamond,diamond,heart,heart,spade,spade,dvc,svh);
The SQL statement represented according to searchstr is inquired about the database bidsystem that bids；
If not meeting the record of condition, 4 are gone to step；
If there is the record for meeting condition, then bid is set to first Bid field value of record；
If bid<=maxbid, then set Mybid and be 0 and return；
If bid>Maxbid, then set the value of Mybid for bid and return；
Step 3.7, the value of setting Mybid are HumanBid and return；
Step 4, Database Dynamic of bidding extension：
If BidType=1,4.1 are gone to step；If BidType=2,4.2 are gone to step；BidType=3, goes to step 4.3；
BidType=4, goes to step 4.4；BidType=5, goes to step 4.5；BidType=6, goes to step 4.6；
Step 4.1,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, PMin, PMax, CMin, CMax, DMin, DMax, HMin, HMax, SMin, SMax, DvsC,
SvsH, Bid) VALUES (’%s’, 1, %d, %d, %d, %d, %d, %d, %d, %d, %d, %d, 0, 0,
HumanBid)", OurSystem, pt,pt,club,club,diamond,diamond,heart,heart,spade,
spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and the value for setting Mybid is
HumanBid is simultaneously returned；
Step 4.2,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, POpenBid, PMin, PMax, CMin, CMax, DMin, DMax, HMin, HMax, SMin,
SMax, DvsC, SvsH, Bid) VALUES (’%s’, 2, %d, %d, %d, %d, %d, %d, %d, %d, %d, %
d, %d, 0, 0, HumanBid)", OurSystem, bid1,pt,pt,club,club,diamond,diamond,
heart,heart,spade,spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and the value for setting Mybid is
HumanBid is simultaneously returned；
Step 4.3,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, POpenBid, PResponseBid, PMin, PMax, CMin, CMax, DMin, DMax, HMin,
HMax, SMin, SMax, DvsC, SvsH, Bid) VALUES (’%s’, 3, %d, %d, %d, %d, %d, %d, %
d, %d, %d, %d, %d, %d, 0, 0, HumanBid)", OurSystem, bid2, bid3,pt,pt,club,
club,diamond,diamond,heart,heart,spade,spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and the value for setting Mybid is
HumanBid is simultaneously returned；
Step 4.4,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, OppBid, PMin, PMax, CMin, CMax, DMin, DMax, HMin, HMax, SMin, SMax,
DvsC, SvsH, Bid) VALUES (’%s’, 4, %d, %d, %d, %d, %d, %d, %d, %d, %d, %d, %d,
0, 0, HumanBid)", OurSystem, bid4,pt,pt,club,club,diamond,diamond,heart,
heart,spade,spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and the value for setting Mybid is
HumanBid is simultaneously returned；
Step 4.5,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, POpenBid, PResponseBid, POpenBid2,PMin, PMax, CMin, CMax, DMin,
DMax, HMin, HMax, SMin, SMax, DvsC, SvsH, Bid) VALUES (’%s’, 5, %d, %d, %d, %
d, %d, %d, %d, %d, %d, %d, %d, %d, %d, 0, 0, HumanBid)", OurSystem, bid1,
bid5, bid6, pt, pt, club, club, diamond, diamond, heart, heart, spade,
spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and the value for setting Mybid is
HumanBid is simultaneously returned；
Step 4.6,
SQL statement insertstr is generated according to following sentence：
sprintf_s(insertstr,sizeof(insertstr), "INSERT INTO bidsystem (system,
BidType, PCompetiveBid, PMin, PMax, CMin, CMax, DMin, DMax, HMin, HMax, SMin,
SMax, DvsC, SvsH, Bid) VALUES (’%s’, 6, %d, %d, %d, %d, %d, %d, %d, %d, %d, %
d, %d, 0, 0, HumanBid)", OurSystem, bid7,pt,pt,club,club,diamond,diamond,
heart,heart,spade,spade);
The SQL statement represented according to insertstr is updated to the database bidsystem that bids, and the value for setting Mybid is
HumanBid is simultaneously returned.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611034072.3A CN106776758A (en) | 2016-11-23 | 2016-11-23 | Construction method of card calling database for bridge computer game |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611034072.3A CN106776758A (en) | 2016-11-23 | 2016-11-23 | Construction method of card calling database for bridge computer game |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106776758A true CN106776758A (en) | 2017-05-31 |
Family
ID=58971084
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611034072.3A Pending CN106776758A (en) | 2016-11-23 | 2016-11-23 | Construction method of card calling database for bridge computer game |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106776758A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110428057A (en) * | 2019-05-06 | 2019-11-08 | 南京大学 | A kind of intelligent game playing system based on multiple agent deeply learning algorithm |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101437122A (en) * | 2008-10-31 | 2009-05-20 | 康佳集团股份有限公司 | Control method for implementing landholder-fighting game on TV set using remote controller for TV set |
| CN102376184A (en) * | 2010-08-27 | 2012-03-14 | 洪荣昭 | Teaching game method |
| US20150314199A1 (en) * | 2014-05-01 | 2015-11-05 | MPH, Inc. | Analytics Enabled By A Database-Driven Game Development System |
-
2016
- 2016-11-23 CN CN201611034072.3A patent/CN106776758A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101437122A (en) * | 2008-10-31 | 2009-05-20 | 康佳集团股份有限公司 | Control method for implementing landholder-fighting game on TV set using remote controller for TV set |
| CN102376184A (en) * | 2010-08-27 | 2012-03-14 | 洪荣昭 | Teaching game method |
| US20150314199A1 (en) * | 2014-05-01 | 2015-11-05 | MPH, Inc. | Analytics Enabled By A Database-Driven Game Development System |
Non-Patent Citations (1)
| Title |
|---|
| 刘磊: ""自动测试桥牌叫牌法结果比对的研究与实现"", 《中国优秀硕士学位论文全文数据库（信息科技辑）》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110428057A (en) * | 2019-05-06 | 2019-11-08 | 南京大学 | A kind of intelligent game playing system based on multiple agent deeply learning algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Nixon | Cyberpunk: Preparing the ground for revolution or keeping the boys satisfied? | |
| Bullock | Women and work | |
| Moore | Understanding sex and gender | |
| Mucina | Classification of vegetation: Past, present and future | |
| CN110309320B (en) | NBA basketball news automatic generation method combining NBA event knowledge map | |
| Sauer | The state of research on markets for sports betting and suggested future directions | |
| CN106776758A (en) | Construction method of card calling database for bridge computer game | |
| Taylor | 19 SOCIALIST FEMINISM: UTOPIAN OR SCIENTIFIC? | |
| Bacus | A gendered past: a critical bibliography of gender in archaeology | |
| Kingston-Mann | Women, land rights and rural development: how much land does a woman need? | |
| Manivannan et al. | Convolutional neural network and feature encoding for predicting the outcome of cricket matches | |
| Glickman | Introductory note to 1928 (= 1929) | |
| DeLooze et al. | Bridge bidding with imperfect information | |
| Redmond | A natural generalization of the win-loss rating system | |
| Sillitoe | The gender of crops in the Papua New Guinea highlands | |
| Ishwaran | A populistic Community and Modernization in India | |
| Li et al. | Study on the play strategy of dou dizhu poker based on convolution neural network | |
| CN109460475A (en) | A kind of merging method of similar clue | |
| Parde et al. | I spy: An interactive game-based approach to multimodal robot learning | |
| Quinn-Judge | Vietnam's bumpy road to reform | |
| CN113018837A (en) | Machine game playing method and system of whipped egg poker and storage medium | |
| Domin | Phylogenetic evolution of the phyllome | |
| Hansen | The African peasant: uncaptured or participating? A comparative study | |
| Rae | Political theory and the division of labor in society: Asleep aboard the titanic and steaming into halifax | |
| Tejani | Application of Neuroevolution in Blackjack |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20170531 |
|
| WD01 | Invention patent application deemed withdrawn after publication |