JP2000268107A - Reduce betting system and method, terminal and center - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide the reduce system of a lottery for predicting a game result on-line. SOLUTION: This center 3 stores a reduce pattern set for each combination of the game result and a basic rule for applying a reduce pattern before starting betting reception. A betting machine 1 downloads the reduce pattern set and an applying rule from the center 3 before starting the betting reception. The betting machine 1 reads the betting contents of an applicant, develops a betting pattern purchased by a betting person and transmits the betting contents and the digest of the developed pattern to the center 3. The center 3 generates the developed pattern by itself from the received betting contents, generates the digest and discriminates whether or not the received digest and the generated digest match. In discriminating that they match, the betting contents and the developed pattern are stored and an affirmative response is transmitted to a terminal 1. In response to the affirmative response, the betting machine 1 prints a betting ticket.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a system for reducing a lottery such as a sports lottery.

[0002]

2. Description of the Related Art Sports betting which can predict the results of sports games and receive a payout in accordance with the predicted results has become widespread throughout the world. Of the sports lottery, in soccer lotteries, etc., multiple games are expected to be won (home team win; away team lost), lost (home team lost; away team win), draw, etc. And vote for a matrix pattern with the results (wins / loses / draws) as columns. In order to promote and spread such a lottery, it is necessary to satisfy a purchaser's desire to vote for various game results at a low price.

However, in a voting system for a matrix pattern, the voting amount generally increases exponentially during multi-voting (when voting for a plurality of match result patterns).

[0004] For example, the game number 13 games, wins the match results, negative, when three patterns of a draw, a total, it is possible to vote 3 ^thirteen. If you only expect one outcome for every match, you only need one vote. However, for example, four games out of the expected 13 games (games a to d)
Results are difficult to predict, winning, losing,
Attempting to mark all three of the draws (triple marks) would require 81 (3 ⁴ ) votes alone. When calculated simply, the cost of voting is 81 times that of a single vote.

In order to reduce the price, it is necessary to reduce some marks. However, reducing the number of marks does not meet the buyer's desire to vote on various game results at a low price.

[0006] "Reduce buying" can be considered as a method of responding to the request of the purchaser. The “reduce buy” is to extract and buy votes for some matches under the condition that “the match will be completed by at most one match regardless of the match result”. This mechanism is called a “reduce system”, and the set of extracted predicted patterns is called a “reduce pattern set”.

[0007] The reduce system will be further described. Here, there are 13 games to be voted for, and each game wins (“1”; home team wins; away team loses) and loses (“2” home team loses; away team wins) , A lottery to predict a draw (“×”).

As shown in FIG. 17A, when one match result is expected for all matches, the number of votes
The voting fee will be the base unit price.

On the other hand, as shown in FIG.
For example, the home team wins or loses the first, second, and eighth matches, the home team wins the third match, and the fourth and eleventh matches.
-Predict that the 13th game will be drawn, the 5th and 7th games will be won, lost or drawn by the home team, the 6th and 9th games will be lost or drawn by the home team, and the 10th game will be defeated by the home team. Vote, the number of votes will be 2
× 2 × 1 × 1 × 3 × 2 × 3 × 2 × 2 × 1 × 1 × 1 × 1 =
288 mouths. Therefore, the voting cost is 288 for a single vote.
Double.

Here, since the 288 voting costs are too high, for example, as shown in FIG.
Matches, 5th match, 8th match, 12th match are subject to reduction, and simple combination voting of this part 3 × 3 × 3 ×
3 = 81 ways are extracted and purchased.
In this case, if the nine voting patterns (reduce pattern set) shown in FIG. 18B are processed as if they were purchased, if the results of all games other than the four games for which the reduce was specified were correct, As shown in FIG. 19, irrespective of the outcome of these four games, a voting pattern (1 etc.) that completely matches the match result of 13 games or a voting pattern (2 etc.) that is only one missed. Is guaranteed to exist. In other words, the first or second prize is guaranteed on condition that a match result other than the game to be reduced is hit.

Even if the same nine voting patterns are purchased, the results of the third and fifth games are fixed at "1", and
Assuming that the game and the twelfth game are triple-purchased, if the result of the third game or the fifth game is other than 1, the wish for the winning will be cut off at that time. However, when the reduce purchase is performed, the third, fifth, eighth, and twelfth matches are won regardless of the result, and the winning probability is increased.

The reduce pattern set needs to be obtained for each of the number of games to be reduced and the expected number of results of each of the games to be reduced (when two and three are expected). However, it is known that the size of the reduce pattern set increases exponentially as the number of games to be reduced increases.

[0013]

In order to spread this kind of lottery, an online system for accurately and promptly performing lottery sales and winning processing is indispensable. However, in the case of the reduce system, since the size of the reduce pattern set that satisfies the precondition is large, there is a problem in that when the reduce pattern set is transmitted and received on the online system, the traffic increases. In addition, in order to realize the reduce system, a combination pattern (reduce pattern set) that satisfies the precondition that at least one of them falls outside the range.
Must be prepared in accordance with the number of games to be reduced, the expected contents of each game, and the like. However, it is practically impossible to calculate the reduce pattern set at high speed every time it is assigned, because the amount of calculation is enormous and the number of games to be reduced increases by a certain number or more.

[0014] Even if the game to be reduced and the expected result are the same, there are a plurality of combinations in the reduce pattern set. Moreover, the winning class may be different depending on which reduce pattern set is used. Therefore, it is necessary to use a uniform reduce pattern online.

For example, it is assumed that the pattern set shown in FIG. 20 is generated by exchanging the first and third rows of the reduce pattern shown in FIG. This pattern set also satisfies the prerequisite of the reduction, "No matter what match result, it fits in at most one game off" and is a "reduce pattern set". However, for example, when the match result of the third, fifth, seventh, and twelfth matches is “1xxx”, this match result is the second in the reduce pattern set of FIG. 18B. The first prize will be won on condition that the pattern is perfectly matched and other predictions are correct. On the other hand, FIG.
In a reduce pattern set of 0, one of the sixth patterns is missed, and a second prize is won on condition that other predictions are correct.

As described above, even if the game to be reduced and the expected result are the same, there are a plurality of combinations in the reduce pattern set. Moreover, the winning class may be different depending on which reduce pattern set is used. Therefore, it is necessary to use a uniform reduce pattern online.

Also, since the winning grade differs depending on the reduce pattern set used, it is necessary to notify the purchaser of the reduce pattern set to be used, but the size of the face is limited, and a large amount of information is recorded. It is difficult to do.

The present invention has been made in view of the above circumstances, and has as its object to realize an online type reduce voting system. Another object of the present invention is to realize an online reduce voting system with reduced traffic. Still another object of the present invention is to facilitate calculation of a reduce pattern set.

Still another object of the present invention is to realize an on-line type reduction system in which a reduced pattern set can be used in a unified manner without variation in the used reduced pattern set.

[0020]

In order to achieve the above object, a reduce voting system according to a first aspect of the present invention includes a plurality of terminal devices for issuing voting tickets and connected to each terminal device. A reduce voting system, comprising a center and a voting system for voting for the results of a plurality of games, allowing a plurality of votes for each game, and allowing a designation of a reduce when a plurality of game results are expected (predicted). ,
The terminal device includes: an input unit configured to input a prediction of a match result of a plurality of matches including a designation of reduce; a transmission unit configured to transmit voting data including a prediction input by the input unit to the center; Issuance means for issuing a betting ticket in which the prediction is recorded, wherein the center comprises: a reduce pattern storage means for storing a reduce pattern;
Receiving the voting data transmitted from the terminal device,
Based on the prediction included in the voting data and the reduction pattern stored in advance in the reduction pattern storage means, the prediction is developed into a voting pattern, the voting pattern storage means storing the developed voting pattern, and A winning data storage means for extracting a winning voting pattern from the voting patterns stored in the voting pattern storing means and storing the voting data. According to this configuration, a reduce system can be realized online.

The terminal device includes a download unit that downloads a reduce pattern from a reduce pattern storage unit of the center, and the issuance unit stores an estimate including the designation of the reduce input from the input unit, and stores the reduced pattern in the downloaded reduce pattern. And a developing means for recording the developed voting pattern on a betting ticket and issuing it.

It is preferable that the download unit downloads the reduce pattern in a lump before inputting a prediction of a match result. Thereby, traffic can be suppressed.

The terminal device and the center have means for storing a rule for allocating a pattern constituting a reduce pattern to a game for which a reduce is designated, and the center and the terminal device are provided with the rule. May be assigned a pattern that constitutes the reduce pattern to the game for which the reduce is specified. Even if the same reduce pattern is used, if the reduce pattern is assigned to a match with a different assignment rule between the terminal and the center of the reduce pattern, the winning class may be different between the terminal and the center. .
With this configuration, the terminal and the center share the assignment rule, and such a trouble can be prevented.

[0024] The terminal device includes means for generating a digest of the contents of the voting developed by the developing means, wherein the transmitting means transmits the digest together with the voting data to the center. Means for expanding the voting pattern according to the reduce pattern stored by itself, means for generating a digest of the expanded voting pattern, means for comparing the generated digest with the received digest, and determining whether or not they match, Means for permitting the terminal device to issue a ticket when it is determined that they match. By using the digest, it is possible to secure the same pattern developed between the terminal and the center while suppressing traffic.

The center stores a reduce pattern (model reduce pattern) to be applied to one combination of wins and losses for the game for which the reduce is specified, and the center and the terminal device are designated by voting. If the game result of the reduction designation is other than the combination of the one win and loss, a means for modifying the stored reduce pattern according to a predetermined criterion may be provided. With this configuration, the data amount of the reduce pattern can be suppressed, and the storage capacity and communication traffic can be suppressed.

The reduce pattern storage means of the center stores the reduce pattern up to a predetermined combination of the number of games, and the developing means of the terminal device stores the reduction pattern of the number of games exceeding the predetermined number of the matches. For the designation of reduce, a means for obtaining a voting pattern by a combination of a corresponding reduce pattern and a plurality of votes may be provided.

In order to achieve the above object, a second aspect of the present invention is provided.
The reduce voting system according to the aspect includes a plurality of terminal devices for issuing voting tickets and a center connected to each terminal device. The reduce voting system comprises rows and columns, votes in a matrix, and recognizes the designation of reduce. In a reduce voting system, the terminal device includes an input unit that inputs a voting point on a matrix, a transmitting unit that notifies the center of voting data indicating the input voting point, and a terminal device according to a notification from the center. Issuing means for issuing a voting ticket in which the input voting points are recorded, wherein the center receives and receives voting data transmitted from the terminal device, and a reduce pattern storing means for storing a reduce pattern. Voting data that expands the voting pattern according to the reduce pattern according to the expanded voting data and stores the expanded voting pattern And 憶 means, based on the match result,
Based on the voting pattern stored in the voting data storage means, the winning voting data is extracted from the voting data, and the winning data storage means for storing the voting data is provided. . For example, the row direction of the matrix to be voted is assigned to a match, and the column direction is assigned to a combination of match results.

[0028] The terminal device includes download means for downloading a reduce pattern from a reduce pattern storage means of the center, and the issuance means stores a forecast including the designation of the reduce input from the input means, and the downloaded reduce pattern. May be provided, and means for recording and issuing the developed voting content on a betting ticket may be provided.

[0029] The download means may download the reduce pattern in a lump before inputting a prediction.

[0030] The terminal device includes means for generating a digest of the voting pattern developed by the developing means, wherein the transmitting means transmits the digest together with the voting data to the center, and the center transmits the digest with the received voting data. Means for expanding the voting pattern according to the reduce pattern stored by itself, means for generating a digest of the expanded voting pattern, means for comparing the generated digest with the received digest, and determining whether or not they match, Means for permitting the terminal device to issue a ticket when it is determined that they match.

The center stores a reduction pattern to be applied to a combination of voting in one line for a voting designated to be reduced, and the center and the terminal device determine whether the content of the voting designated to be reduced is Means may be provided for deforming the stored reduce pattern according to a predetermined criterion in cases other than the combination of voting in one row.

The reduction pattern storage means of the center stores a reduction pattern up to a predetermined range, and the expanding means of the terminal device determines whether a reduction exceeding the range is specified by a corresponding reduction pattern and a plurality of votes. A means for obtaining a voting pattern may be provided in combination with the above.

A terminal device according to a third aspect of the present invention includes a plurality of terminal devices for issuing voting tickets and a center connected to each terminal device, and provides a game result of a plurality of games. A terminal device for a reduce voting system for voting, allowing a plurality of votes for each game, and, when predicting a plurality of game results, allowing a designation of a reduce, wherein the terminal device includes a designation of a reduce. Input means for inputting predictions of game results of a plurality of games, transmitting means for transmitting the input prediction to the center, and issuing means for issuing a voting ticket recording the input prediction according to a notification from the center And the following.

Further, the center according to a fourth aspect of the present invention is composed of a plurality of terminal devices for issuing voting tickets and a center connected to each terminal device. And a center for a reduce voting system for allowing a plurality of votes for each game and for predicting a plurality of game results and for specifying a reduce, wherein the center is a reduce pattern storage for storing a reduce pattern. Means, receiving the notification of the voting content from the terminal device, expanding the voting content according to the reduce pattern, voting data storage means for storing the expanded voting content, and based on the match result, the voting data storage means A winning data storage means for extracting the winning voting content from the stored voting content and storing the voting content. And it features.

A reduce voting method according to a fifth aspect of the present invention is characterized in that a reduce voting method is performed by transmitting and receiving signals between a plurality of terminal devices for issuing voting tickets and a center connected to each terminal device. A reduce voting method for performing voting, wherein the terminal device inputs a prediction of a game result of a plurality of games including a designation of reduce, transmits the input prediction to the center, and Issue a voting ticket, receive, at the center, the prediction transmitted from the terminal device, develop the voting content according to a previously stored reduce pattern, store the developed content, and, based on the match result, And extracting a vote having a winning content from the stored voting contents.

[0036]

DESCRIPTION OF THE PREFERRED EMBODIMENTS A lottery system having a reduce system according to an embodiment of the present invention will be described below with reference to the drawings. As shown in FIG. 1, the lottery system includes a voting machine (seller terminal) 1 installed at a lottery store or the like, and a center system 3 connected to each voting machine 1 and installed at a center. Prepare.

The voting machine 1 includes a storage unit 11 and a control unit 12
, Communication unit 13, image scanner 14, printing unit 1
5 and a display unit 16.

The storage unit 11 receives the application for the lottery,
This is a memory for printing and issuing lottery, and for storing a program (OS, application, etc.) for processing a winning ticket, data, and the like, and includes a hard disk device, a flash memory and the like.

FIG. 2 shows a configuration of a part related to the reduce voting in the storage unit 11. As shown, the storage unit 11
Are the program area 111 and the basic information area 112
And a model reduce pattern area 113.

The program area 111 stores a program for performing processing for receiving a lottery application and issuing a voting ticket, a program for processing a winning ticket, and the like. The details of each process will be described later.

The basic information area 112 stores basic information for processing a reduce voting. The stored information includes (1) the type of the lot to be reduced, (2)
A template reduce pattern allocation rule (such as a rule that assigns a template reduce pattern to a game to be reduced, which will be described later, etc.), and (3) a game result replacement rule (a template reduce pattern for “1x” described later, x2 ”, a rule for conversion for“ 12 ”), and the like.

The template reduce pattern area 113 includes:
A plurality of reduce pattern sets are stored. In this embodiment, it is assumed that the results of the game to be voted are three types: a home team win, a draw, and an away team win. In this case, the combination of the mark of the game result for each game for which the reduce is specified is “1x”, “12”, or “x2” when two games (double) are specified.
"1x2" when specifying 3 games (triple)
There is one case. Here, "1" indicates a home team win, "2" indicates a home team negative, "x" indicates a draw, "1x" indicates a home team win or draw,
“12” means home team win or away team win, “x2” means draw or away team win, and “1 × 2” means home team win or draw or away team win.

Originally, a reduce pattern set should be prepared for each combination of match results. However, in this embodiment, in order to suppress the data amount of the reduce pattern, the mark is set to “1x” for the double.
In this case, only the reduce pattern for the case (1) is stored, and for the other marks, the reduce pattern for “1x” is transformed and used. This reduce pattern for “1x” is referred to as a “model reduce pattern”.

FIG. 3 shows an example of a template reduce pattern set stored in the template reduce pattern area 113. According to FIG. 3, for example, in the case of reducing three games, two games are designated as double (double = 2), and one game is designated as triple (triple = 1). , (Xxx), (x
x2). Each pattern constituting the template reduce pattern set indicates a combination of the results of the game for which the reduce is specified. That is, in FIG. 3, (abc... N) corresponds to one set of a plurality of game results for which the reduce is specified.

The control unit 12 shown in FIG. 1 is composed of a processor and the like, controls the voting machine 1 as a whole according to a program stored in the storage unit 11, receives a voting application form, and sends the application contents to the center system 3. , A process of issuing a voting ticket based on a response from the center system 3, a process of a winning ticket, and the like.

The communication unit 13 controls communication between the voting machine 1 and the center system 3 under the control of the control unit 12. The image scanner 14 includes an optical mark reading device and the like, reads an optical mark written on an application form, a two-dimensional code printed on a betting ticket, and supplies the read data to the control unit 12.

The printing section 15 prints necessary items on the voting paper under the control of the control section 12. The display unit 16 displays various data under the control of the control unit 12.

The center system 3 includes a storage unit 31, a control unit 32, and a communication unit 33. The storage unit 31 stores various programs (OS, applications, and the like) for executing the voting process and the winning process online, data, and the like. FIG. 4 shows a configuration of a part related to the reduce voting in the storage unit 31. As shown in FIG.
Indicates a program area 311, a reduce system basic information area 312, and a template reduce pattern area 3
13, a voting data area 314, and a winning ticket data area 315.

The program area 311 stores various programs for performing a voting process in response to a notification from each voting machine 1 and for performing a process such as extracting a winning voting from the voting. For details of each process,
It will be described later.

Reduce System Basic Information Area 312
Is an area for storing basic information for processing the reduce voting, (1) the type of the lot to be reduced, (2) the rule for performing the reduce (the template reduce pattern Is assigned from the top to the target game, etc.),
(3) The template reduce pattern for “1x” is changed to “x
For example, a game result replacement rule for conversion to “2” or “12” is stored. Each voting machine 1 downloads and uses the basic information stored in the reduce system basic information area 312.

The template reduce pattern area 313 includes:
A plurality of reduce pattern sets are stored. The reduce pattern stored here is the same as the content shown in FIG. Each voting machine 1 downloads and uses the reduce pattern stored in the template reduce pattern area 313.

The voting data area 314 stores voting data indicating the content of each voting based on the data transmitted from the voting machine 1. The winning ticket data area 315 stores only the winning betting ticket among the voting data stored in the voting data area 314.

The control unit 32 shown in FIG. 1 is composed of a processor and the like, controls the center system 3 and indirectly all the voting machines 1 in accordance with a program stored in the storage unit 31, and performs a voting application reception process. Check and reply to the application details, process winning tickets, etc.

The communication unit 33 controls communication between the center system 3 and the voting machine 1 under the control of the control unit 32.

Next, the operation of the entire voting system in such a system, from issuing a lottery voting ticket to refund of a winning, will be described with reference to FIGS.

First, when a combination of matches to be drawn, a voting method, and the like are determined, reduce system basic information is determined according to the content thereof, a template reduce pattern set is obtained, and the center system 3 stores the information. It is stored in the reduce system basic information area 312 and the template reduce pattern area 313 of the unit 31 (FIG. 5, step S11).

As described above, in this embodiment, the number of games is thirteen, and for each game, a win of the home team of "1", a draw of "x", and a negative of "2" are predicted. Further, when two or more results are predicted for each game, the reduction (R) can be designated.

Based on this condition, a template reduce pattern as shown in FIG. 3 is obtained and stored in the template reduce pattern area 313 of the storage unit 31. However, the reduce pattern set for double (predicting the result of two games) stores only the template reduce pattern set which is the reduce pattern set when the game result “1x” (win or draw) is specified. This is to reduce the data amount of the reduce pattern set. Also,
There may be a plurality of sets of reduce patterns for the match result, but only one set is determined and fixed and stored. This is to prevent the reduction patterns used by the voting machines 1 and the center system 3 from being different.

As basic information of the reduce system, 1. 1. rules for assigning a reduce pattern to a match for which a reduce is specified; A rule for converting a reduce pattern for “1x” into a reduce pattern for “x2” or “12” is set. In this example, 1. The game for which the reduce is specified is divided into a double game and a triple game, and numbers are assigned in order from the top, and a rule is set to apply the template reduce set sequentially from the top. 2. When double reduce is specified, the expected match result is “1x”
In the case of, the reduce pattern stored in the template reduce pattern area 313 is used as it is.
On the other hand, the expected match result is “12” or “x2”
In the case of (1), the reduce pattern for “1x” is modified and used. The transformation rule for that purpose is stored. That is, for the reduce marked as "1" and "2", "1" is rewritten to "1" and "x" is rewritten to "2".
For the reduce marked "x" and "2",
A rule for rewriting “x” to “x” and “1” to “2” is stored.

Each voting machine 1 downloads the above-described reduce pattern and reduce rule from the center system 3 before accepting a vote (step S12), and stores the basic information area 112 and the template reduce pattern area 113 of the storage unit 11. And stored in With this download,
Each voting machine 1 and the center system 3 store the same model reduce pattern set and reduce rule.

Thereafter, each voting machine 1 starts accepting votes. A person who wants to vote enters the expected (predicted) match result in an application form as shown in FIG.

An application form 71 shown in FIG. 7 includes an area 72 in which game information is recorded, an area 73 in which a purchaser records the expected game result, an area 74 for specifying the number of games for which a reduce is specified, and a pattern of a reduce pattern. It has an area 75 indicating the number (voting number).

For each match, the purchaser paints the mark “1” when predicting the home team's win, and marks “2” when predicting the home team's loss (away team win). Is painted, and when a draw is expected, the mark of “x” is painted. Fill at least one mark for each match.
For one game, the case where all three marks are painted is "triple", and the case where any two marks are painted is "double".

When a reduce is designated for a game in which a plurality of marks have been painted, the “R” mark is painted out.

In the example of FIG. 7, the purchaser predicts that the home team will lose for game a, predicts the home team will win or lose for game b, and designates reduce. . . . , E match, anticipate all three outcomes and specify a reduce; . . For the mth match, the home team is expected to lose.

In the case of the application form 71 shown in FIG. 7, the designation of the reduce is that the double reduce is 2 games (b game, i game) and the triple reduce is 3 games (e game, f game, k game). . Therefore, the area 74 is marked with "2" for double and "3" for triple. From this combination of marks, it can be seen that referring to the area 75 and referring to the number of votes for reduction, 18 patterns are extracted and bought.

The voting machine 1 reads the application form 71 with the image scanner 14 and supplies the read information to the control section 12 (FIG. 6, step S13). The control unit 12 counts the number m of double games and the number n of triple games for which reduction is specified based on the information from the image scanner 14 (step S14). Based on m and n, the template reduction pattern area A template reduce pattern set to be applied is extracted from the template reduce pattern set stored in 113 (step S15). In this example, for the game to be reduced, a template reduce pattern set for 2 doubles 3 triples is extracted.

Next, it is determined whether or not the number of votes exceeds a preset upper limit. In this example, the number of votes of 2 double 3 triple is 18 (see FIG. 3),
Since there are no other doubles or triples, the total number of votes is also 1
It becomes 8. If the control unit 12 determines that the number of voting units exceeds the limit value, the control unit 12 issues a warning to the display unit 16.

On the other hand, if it is determined that the number of votes does not exceed the limit value, a template reduce pattern set is assigned to each game to be reduced.

Even if the rows of the reduce pattern set are exchanged, reduce is established. However, the winning class may be different. Therefore, all devices on the network use the same reduce pattern, and
It is necessary to allocate the same reduce pattern for the same prediction. For this reason, the games to be reduced are divided into doubles and triples in accordance with the reduce system basic information commonly defined online, and numbers are assigned in order from the top. At this time, regarding the double, the user is aware of the marked result. In this example, as shown in FIG. 8A, for five games for which the reduce is specified,
Numbers are divided into doubles and triples.

Next, as shown in FIG. 8B, for the game to be reduced, the template reduce pattern read out in step S15 is assigned to each of the double portion and the triple portion.

The method of assigning the template reduce pattern will be described more specifically with reference to FIG. First, looking at the column of 2 doubles 3 triples in FIG. 3, 18 patterns (x1111) to (11x12) are registered. In order to facilitate understanding of these 18 patterns, vertical writing is temporarily performed as shown in FIG. As shown in FIG. 9B, the patterns of the first and second lines of the generated pattern are to be assigned to a double match, and the third to fifth lines are to be assigned to a triple match. It is a pattern. (The pattern to be assigned to the double and the pattern to be assigned to the triple are predetermined.) Therefore, according to the assignment rule of assigning in order from the top, the first
The row is assigned to the first double match b, the second row is assigned to the second double match i, the third row is assigned to the first triple match e, and the fourth row is assigned to the second triple match. f and the fifth row to the second match k of the triple. FIG. 8B shows the result of the assignment.

Further, for a double match, paying attention to the contents of the prediction, referring to the result replacement table, the template reduce pattern for "1x" is converted into a reduce pattern for the match result actually predicted ( Step S1
6). That is, when the expectation of the game in which the double reduce is specified is “12”, the reduce pattern “1” is converted to “1” and “x” is converted to “2”. Also,
In the case of “x2”, the reduce pattern is rewritten from “x” to “x” and “1” to “2”. In this example, the match b is a double reduce of “12”, and the match i is “x”.
Since it is a double reduction of "2", it is replaced as shown in FIG.

Finally, the reduce pattern thus obtained is allocated to the game to be reduced as shown in FIG. 8D (step S17). In this way, the contents of the current vote are obtained.

Next, the control unit 12 converts the voting pattern thus generated by using a one-way function such as a hash function to generate a digest (step S1).
8). Next, a voting request message (voting data) including the voting contents and the digest is sent to the center system 3 via the communication unit 13 (step S19).

The control unit 32 of the center system 3 receives the voting request message (voting data) via the communication unit 33 (FIG. 5, step S31), and determines the voting machine 1
The voting pattern is developed by using the same processing as that performed by the user (step S32). Next, the developed voting pattern is converted by using the same function as the hash function used in step S18 to create a digest.

Next, it is determined whether or not the generated digest matches the received digest (step S3).
3). If they match, the reduce pattern set obtained by developing the template reduce pattern set by the voting machine 1 and the reduce pattern set obtained by developing the template reduce pattern set by the center system 3 are the same. 1 and the center system 3 can guarantee the same voting content. Therefore, both the mark content and the development pattern at the time of voting are stored as voting data in the voting data area 314 of the storage unit 31 (step S34), and an acknowledgment message indicating a match is transmitted to the voting machine 1 (step S35). ). On the other hand, if both digests do not match, a negative response message indicating the mismatch is transmitted.

When the voting machine 1 receives the acknowledgment message (step S20), it prints a voting ticket indicating the contents of the voting (step S21) and delivers the voting ticket to the purchaser (step S22). In the case of a negative response message, a warning is issued to the display unit 16.

As described above, there are a plurality of methods for extracting a pattern that satisfies the reduce condition (one fits out), and the same match result depends on which extraction result is used, that is, the reduce pattern set to be used. Even so, the winning class will change. For this reason,
The buyer needs to clearly know what the reduced pattern set he / she purchased is, and needs to print the purchased reduced pattern set on a betting ticket. However, when printing on a voting ticket, it is necessary to be able to determine the winning / non-winning only by the information printed on the face of the ticket. Also,
Since the size of the ticket is limited, it is necessary to efficiently record the purchase pattern on the ticket.

Therefore, in this embodiment, the voting machine 1
Receives the acknowledgment message (step S20), converts the mark and the voting pattern developed by the user into a two-dimensional code, and based on the two-dimensional code and the voting pattern developed by the user, as shown in FIG. The voting two-dimensional code 92, the voting pattern 94, the reduce pattern 95, etc. are printed on the betting ticket 91 (step S21).

That is, a two-dimensional code (two-dimensional bar code) 92 of the contents of the mark and the contents of the voting, an area 93 indicating the contents of the game, a pattern 94 of the mark, and a reduce pattern 95 are printed on the ticket surface. Mark pattern 94
Is a match that does not specify a reduce (for example, a,
c, d. . . For the match, the content of the mark is printed as it is. In addition, for the match targeted for the reduction, a symbol “R” indicating that the reduce is designated is printed at the position of the marked match result. In order to reduce the area, a region indicating whether or not the object is to be reduced is not particularly provided. Further, in order to prevent additional writing, a mark such as "-" is written at a mark position where no entry has been made.

As for the reduce pattern 95, the pattern is not printed for a game which is not targeted for the reduction, and the reduced pattern is printed on the right side only in the portion targeted for the reduction. To prevent additional writing,
At the right end, a symbol such as "-" is printed.

When all the matches have been completed and the match results have been clarified, the control unit 32 of the center system 3 selects, from the voting data stored in the voting data area 314, one that completely matches the match result (1). Etc.) or voting data having only one out of the voting data (2 etc.) is extracted and registered in the winning ticket data area 315.

The purchaser determines whether or not his / her betting ticket 91 has been won based on the result of the race.

FIGS. 11 and 1 show a method for determining whether or not a winning is achieved.
2 will be described as an example. Figure 11 (a)
It is assumed that the contents are as shown in FIG. 1. First, as shown in FIG. 11 (b), the number of the portions not having the reduce mark is counted. In this case, as shown in FIG. 11 (b), the match m is missed, and thus one match is missed. 2. Next, as shown in FIG. 12 (a), the degree of matching of the game to be reduced with the double or triple mark before the reduction is checked. In this case, since i is off, one piece is off. 3. 1. And 2. Confirm that the total value of is not outside the winning class. In this case, 1 + 1 = 2 misses, and there is a possibility of winning third-rank (2 misses).

[0086] 4. As shown in FIG. The match pattern is compared with the reduce pattern for the part that matches in the determination of, and the part with the highest degree of match is searched for. In this case, there are some that completely match, and the degree of matching is out of zero. In principle, when using one-off reduction, the degree of matching is always zero or one, so
It is only necessary to check whether or not there is a perfect match. 5. 1. And 2. And 4. Is the number of outliers included in the betting ticket with the highest degree of matching. In this example, 1 + 1 + 0 = 2 misses, and if a winning such as 3 is accepted for two misses, it can be determined that the winning is included.

The mark pattern and the match result shown in FIG. 1. First, count the number of parts that have not been reduced marked. In this example, FIG.
As shown in (b), there is a perfect match and there is no deviation. 2. Next, about the matches that were targeted for the reduction,
Check the degree of matching with the double and triple marks before reduction. As shown in FIG. 13 (c), there is a perfect match and there are no 0 matches.

3. 1. And 2. Confirm that the total value of is not outside the winning class. In this case, since 0 + 0 = 0 pieces are missed, the possibility of winning first prize remains.

4. 2. For the part that matched in the judgment of, compare the reduce pattern and the match result,
Find the one with the highest degree of matching. In this example, since one-off reduction is used, it is sufficient to check whether there is a completely matching one, but there is no such one. Therefore, one piece is missing. 5. 1. And 2. And 4. Is the number of outliers included in the betting ticket with the highest matching degree. in this case,
Since 0 + 0 + 1 = 1, the betting ticket 91 is 2
It can be seen that the winnings are included.

The person having the winning ticket brings the winning ballot 91 to the polling place. The person in charge reads the two-dimensional code 92 stored in the betting ticket 91 with the image scanner 14 and notifies the control unit 12. The control unit 12 transmits the read content (voting ticket number, voting content, and voting pattern) to the center system 3.

The center system 3 receives the notification from the voting machine 1 and stores it in the winning ticket data area 315 of the storage unit 31.
Determine whether the corresponding voting data is recorded,
If it has been recorded, confirm that the received voting content matches the recorded voting content. If it is confirmed that the voting content matches, the voting machine 1 displays the winning number and the winning voting content. Notify. The voting machine 1 displays the received content on the display unit 16 and records it on the face of the betting ticket 91. In addition, a mark such as “Paid winning” is printed on the face of the voting ticket 91 and the voting ticket 91 is discharged. The person in charge
The voting ticket 91 is received and stored in exchange for the winning money.

As described above, according to this embodiment, a reduce voting system can be realized using an online system. Further, if the reduce voting is decomposed into a voting pattern and transmitted and received as a telegram between the voting machine (terminal) 1 and the center system 3, the amount of communication data becomes enormous. Since the content to be written is the mark itself, the amount of communication data can be suppressed. Further, a digest is generated for the developed reduced pattern set, and the center system 3 checks the matching of the digest, thereby checking the consistency between the reduced pattern set generated by the voting machine 1 and the reduced pattern set generated by the center system 3. Can be guaranteed.

In the above description, the game to be reduced is divided into a double game and a triple game, and the reduce patterns are sequentially allocated. However, the allocation method is not limited to the above-described embodiment, and is arbitrary. For example, a template reduce pattern may be allocated to each of the double reduce game and the triple reduce target game in order from the bottom.

[0094] Further, the example has been described in which the template reduce pattern is allocated to the game to be reduced each time in the same order, but the allocation method may be different for each vote. For example, using a random number or the like, in a match to be reduced in a double, which template reduction pattern is to be assigned to which match, and in a match to be reduced in a double,
Which template reduce pattern is allocated to which game may be determined. In this case, the center system 3 is notified of the method of allocating the template reduce pattern. The center system 3, based on the notified allocation method,
The self also allocates a template reduce pattern, and further replaces the double template reduce pattern so as to match the actual voting pattern. Further, a digest of the voting pattern obtained in this way is created, and the digest is notified and checked against the digest notified from the voting machine 1.

In the above description, only one game result is specified for a game other than the game for which the reduce is specified, but two or three game results may be predicted for those games. For example, FIG. 14 shows a print example of the voting ticket 91 in a case where the match d is a triple mark, the befik is a reduction target, and the double double triple triple reduction is performed.

(Application Example of First Embodiment) In the above embodiment, at the time of voting, the reduce pattern set is developed by the center system 3 to generate a digest thereof, and further, the digest notified from the voting machine 1 Is determined, the timing for determining whether the reduced pattern set generated by the voting machine 1 matches the reduced pattern set developed by the center system 3 is arbitrary, and is performed, for example, when a winning ticket is extracted. It is also possible.

In this case, the voting machine 1 transmits the contents of the mark and the digest of the reduced pattern set generated by the voting machine 1 to the voting machine 1 at the time of voting. On the other hand, at the time of voting, the center system 3 transmits the registration completion notification to the voting machine 1 without storing the contents of the mark and the digest in the voting data area 314 but developing and storing the voting pattern.

When the voting machine 1 receives the voting data registration end notification from the center system 3, the voting machine 1 performs necessary printing on the voting ticket 91 using the reduced pattern set developed by itself and issues the voting ticket 91. . Center system 3
When the winning data is extracted, the reduce pattern set is developed for each betting ticket 91, it is determined whether or not the winning has been won, and only for those determined to have been won, a digest thereof is generated. When the digest is determined to match with the digest notified from the voting machine 1, the digest is registered in the winning ticket data area 315 as winning data. With such a configuration, the center system 3 does not need to store the reduce pattern set for all the betting tickets 91, and can reduce the storage capacity.

[0099] In the above-described embodiment, the message transmitted from the voting machine 1 to the center system 3 and the message transmitted from the center system 3 to the voting machine 1 are particularly identified for identifying the betting ticket. For numbers etc.
Although not mentioned, it is natural that an identification number for identifying each vote is added to the voting data as needed.

(Second Embodiment) In the above embodiment, the reduce pattern set is developed by the center system 3. However, when the number of games to be reduced is large, it is difficult to obtain the reduce pattern set itself. It is. Also, since the number of match result patterns included in the reduce pattern set increases exponentially with respect to the number of reduce matches, it is efficient to download all the reduce pattern sets from the center system 3 to the voting machine 1. Low.

For example, the match result patterns covered by one reduce pattern increase by one pattern per double game and by two patterns per triple game.
Therefore, in the case of reduce for x double y triple, 1 + x + 2y match result patterns can be covered by one reduce pattern. In other words, one reduce pattern can cover only 1 + x + 2y match result patterns. Therefore, the extraction rate is 1
It can be said that it never exceeds + x + 2y times. Since simple pattern is ² x * ^{3 y} number, minimum Reduce set ^{(2 x * 3 y) /} (1 dozen x + 2y) becomes never less than the pattern. However, the minimum Reduce set ^{(2 x * 3 y) /} (l ten x + 2
y) It is not always the pattern.

When generating a reduce pattern, it is desirable to obtain a pattern with the minimum number of votes (minimum reduce pattern). However, it is very difficult to calculate the minimum reduce pattern set unless the number of games to be reduced is small. For this reason, when the number of games to be reduced becomes equal to or more than a certain value, the extraction efficiency becomes higher when a reduce set is created by a combination of multi and reduce.

For example, when trying to reduce 5 triples for 5 games a, b, c, d, and e,
4 triple reduce for matches a, b, c, d
9 patterns as normal multi-buy for game e
If you buy 3 patterns = 27 patterns, this is a simple set of 5 triples, and the extraction magnification is 9.0 times. Taking into account that the theoretical upper limit of the extraction magnification is only 11 times, a sufficiently large extraction magnification can be obtained with a combination of the multi and the reduction for a reduce of a large size. Hereinafter, this is referred to as “creating an extended reduce pattern set from the basic reduce pattern set”.

Therefore, in the second embodiment, FIG.
As shown in FIG. 5, when a basic minimum reduce pattern set is used and the pattern set becomes enormous, the basic minimum reduce pattern (basic reduce pattern) is generated without generating the minimum reduce pattern set. And a combination of multi-voting.

In FIG. 15, the number of patterns in the simple set means the number of votes when no reduce is specified. The number of multis in the reduce set means the number of votes when reduce is specified. The extraction magnification means (number of patterns in a simple set) / (number of votes when reduce is specified). This multiplication factor corresponds to the increase rate of the winning probability. The upper limit magnification means an upper limit value of a magnification calculated logically.

As a specific example, an example in which 6 triple reduce (reduce for 6 triple marks) voting is performed on 13 game results in the 1 × 2 system will be described.

(A) First, the center system 3 and the voting machine 1 preliminarily decide on a method of allocating multi-reduce at the time of the extended reduce set. In this description, it is assumed that the use of the basic reduce pattern and the extended reduce pattern is set in advance as shown in FIG. The basic configuration of FIG. 15 is the same as that of FIG. In addition, when the extended reduce pattern set is created, the reduction target games to be replaced with the multi-patterns are in order from the rear. The allocation method of the basic reduce pattern set portion is the same as the reduce pattern allocation method of the first embodiment. Although the matches to be read as multis are set in order from the back, they may be determined by random numbers.

(B) As in the first embodiment, reduce patterns respectively corresponding to the number of games to be reduced are downloaded to the voting machine 1 in advance. At this time, for those having a description of “base =” in FIG. 15, the minimum reduce pattern is not downloaded because a combination of the base minimum reduce pattern and the multi-pattern is used.

(C) Method of Creating Extended Reduce Pattern A case of performing a 6-triple reduce voting as shown in FIG. (A) First, according to the above-mentioned rules, the extended reduce pattern is decomposed into a portion to which the basic reduce pattern is applied and a portion to use the multi-pattern. (B) Next, the number m of double games and the number n of triple games to be reduced are counted, and it is determined which reduce pattern to use from now on. In the case above, there will be 6 triple reduce, which is the extended reduce pattern set coverage. Since the basic reduce pattern set of the 6 triple reduce set is the 4 triple reduce pattern set, two subtracted triple marks are regarded as multi.

(C) Determination of Basic Reduce Pattern Set Applied Part According to the above-mentioned rules, the basic reduce set is applied in order from the top of the mark to be reduced, and the remaining part is regarded as multi (ie, no R mark is added). Treat it the same as). (D) Assignment of reduce pattern In each game to be reduced, the reduce pattern for 4 triple reduce taken in (b) is swung as shown in FIG. 16 (b). The content obtained in this way is the content of the vote.

The voting machine 1 generates a digest of the contents of the voting, transmits the digest to the center system 3, and the center system 3 also develops the contents of the voting according to the same method as described above to generate a digest. Other operations are substantially the same as those of the first embodiment.

In the reduce system using only the minimum reduce pattern set, the number of games to be reduced must be limited to a small value due to the difficulty of calculating the reduce pattern set itself. According to this embodiment, there is no need for such a restriction. Further, the number of reduce patterns included in the reduce pattern set of the large number of games to be reduced becomes very large. For this reason, if this is to be downloaded to the voting machine 1, network traffic will increase. But,
By generating a reduce pattern set with a large number of games to be reduced from the basic reduce pattern set, traffic can be suppressed.

Although the present invention has been described in detail based on the first and second embodiments, the present invention is not limited to the above embodiment, and various modifications and applications are possible. . For example, in the above-described embodiment, the present invention has been described using an example of voting in a matrix in which a game is allocated in a row direction and a game result is allocated in a column direction. However, the voting format is arbitrary.
The reduce system can be applied to anything that votes in the matrix.

[0114]

As described above, according to the present invention,
Reduce voting can be conducted efficiently online.

[Brief description of the drawings]

FIG. 1 is a diagram showing a configuration of a voting system including a reduce system according to an embodiment of the present invention.

FIG. 2 is a diagram showing a configuration of a storage unit of the voting machine shown in FIG.

FIG. 3 is a diagram illustrating an example of a template reduce pattern stored in a template reduce pattern area illustrated in FIG. 2;

FIG. 4 is a diagram showing a configuration of a storage unit of the center system shown in FIG.

FIG. 5 is a diagram for explaining the configuration and operation of the reduce system according to the first embodiment;

FIG. 6 is a diagram for explaining the configuration and operation of the reduce system according to the first embodiment;

FIG. 7 is a diagram showing an example of an application form and an example of filling in the application form.

FIGS. 8A to 8D are diagrams for explaining assignment and replacement of a reduce pattern;

FIGS. 9A and 9B are diagrams for explaining a method of allocating a reduce pattern in FIG. 8;

FIG. 10 is a diagram showing an example of a betting ticket.

11A and 11B are diagrams for explaining a procedure for determining whether or not a voting ticket has been won;

FIGS. 12A and 12B are diagrams for explaining a procedure for determining whether or not a voting ticket has been won;

13A to 13C are diagrams for explaining a procedure for determining whether or not a voting ticket has been won;

FIG. 14 is a diagram showing an example of a combination of reduce voting and multi-voting.

FIG. 15 is a diagram illustrating an example of a reduce pattern set according to the second embodiment;

FIG. 16 is a diagram for explaining an extended reduce pattern set.

FIGS. 17A and 17B are diagrams for explaining a reduce system. FIG.

FIGS. 18A and 18B are diagrams for explaining a reduce system. FIG.

FIG. 19 is a diagram for explaining a reduce system.

FIG. 20 is a diagram showing a modification of the reduce pattern set shown in FIG.

[Explanation of symbols]

 Reference Signs List 1 voting machine 3 center system 11 storage unit 12 control unit 13 communication unit 14 image scanner 15 printing unit 16 display unit 31 storage unit 32 control unit 33 communication unit 71 application 91 voting ticket

Claims (16)

[Claims] 1. A game system comprising: a plurality of terminal devices for issuing voting tickets; and a center connected to each terminal device, voting for the results of a plurality of games, allowing a plurality of voting for each game, and A reduce voting system that allows designation of a reduce when a plurality of match results are predicted, wherein the terminal device inputs an expectation of a match result of a plurality of matches including the designation of a reduce, and the input Transmitting means for transmitting voting data including the prediction inputted by the means to the center; and issuing means for issuing a voting ticket in which the inputted prediction is recorded, the center comprising: a reduction pattern for storing a reduction pattern. Storage means, receiving the voting data transmitted from the terminal device,
Voting pattern storage means for developing the prediction into a voting pattern in accordance with the prediction included in the voting data and the reduce pattern stored in advance in the reduce pattern storage means, and storing the developed voting pattern; A reduced voting system, comprising: a winning data storage unit that extracts a winning voting pattern from voting patterns stored in a voting pattern storage unit and stores the voting data. 2. The terminal device further comprises: download means for downloading a reduce pattern from a reduce pattern storage means of the center; and the issuing means downloads a prediction including a designation of the reduce input from the input means. 2. The reduce voting system according to claim 1, further comprising: a developing unit that develops a voting pattern in accordance with the reduce pattern; and a developing unit that records the developed voting pattern on a voting ticket and issues the voting pattern. 3. The reduce voting system according to claim 2, wherein the download means downloads the reduce pattern in a lump before inputting a prediction of a match result. 4. The terminal device and the center further comprise means for storing a rule for allocating a pattern constituting a reduce pattern to a game for which a reduce is designated, wherein the center and the terminal device are: The reduce voting system according to claim 2 or 3, wherein a pattern constituting a reduce pattern is assigned to the game for which the reduce is specified according to the rule. 5. The terminal device, further comprising: means for generating a digest of the contents of the voting developed by the developing means; the transmitting means transmitting the digest to the center together with voting data; Means for developing a voting pattern in accordance with the data and the reduce pattern stored therein, means for generating a digest of the expanded voting pattern, means for comparing the generated digest with the received digest to determine whether or not they match. 4. The reduce voting system according to claim 3, further comprising: means for permitting the terminal device to issue a ticket when it is determined that they match. 6. The center stores a reduce pattern to be applied to one combination of wins and losses for a game for which a reduce is specified, and the center and the terminal device are connected to a reduce-designated reduce specified by a vote. The method according to claim 2, further comprising: means for deforming a stored reduce pattern according to a predetermined criterion when a match result is other than the one winning / losing combination. Reduce voting system. 7. The reduction pattern storage means of the center stores a reduction pattern up to a predetermined combination of the number of games, and the developing means of the terminal device stores the reduction pattern of the game exceeding the predetermined combination of the number of games. The reduce voting system according to claim 2, further comprising: means for obtaining a voting pattern by specifying a reduction of a number by a combination of a corresponding reduce pattern and a plurality of votes. 8. A reduce voting system comprising a plurality of terminal devices for issuing a voting ticket and a center connected to each terminal device, comprising a row and a column, voting on a matrix, and accepting the designation of a reduce. Wherein the terminal device comprises: input means for inputting a voting point on a matrix; transmitting means for notifying the center of voting data indicating the input voting point; and inputting according to a notification from the center. Issuance means for issuing a voting ticket in which a voting point is recorded, comprising: a reduction pattern storage means for storing a reduction pattern; receiving voting data transmitted from the terminal device, and according to the received voting data. A voting data storage means for developing a voting pattern according to the reduce pattern and storing the developed voting pattern Based on the voting pattern stored in the voting data storage means, to extract the winning voting data from the voting data, and a winning data storage means for storing the voting data. Characterized reduce voting system. 9. The terminal device includes a download unit that downloads a reduce pattern from a reduce pattern storage unit of the center, and the issuing unit downloads a prediction including a designation of the reduce input from the input unit. 9. The reduce voting system according to claim 8, further comprising: a developing means for developing in accordance with the reduce pattern; and a means for recording and issuing the developed voting contents on a betting ticket. 10. The reduce voting system according to claim 9, wherein the download means downloads the reduce pattern at a time before inputting a prediction. 11. The terminal device, further comprising: means for generating a digest of the voting pattern developed by the developing means, wherein the transmitting means transmits the digest together with voting data to the center; Means for developing a voting pattern in accordance with the data and the reduce pattern stored therein, means for generating a digest of the expanded voting pattern, means for comparing the generated digest with the received digest to determine whether or not they match. And a means for permitting the terminal device to issue a ticket when it is determined that they match with each other, The reduce voting system according to claim 9, further comprising: 12. The center stores a reduction pattern to be applied to a combination of voting in one line for a voting designated to be reduced. 12. The method according to claim 9, further comprising: means for deforming a stored reduce pattern in accordance with a predetermined criterion when the content is not a combination of the voting of the one row. Reduce voting system. 13. The reduction pattern storage means of the center stores a reduction pattern up to a predetermined range, and the developing means of the terminal device determines whether a reduction beyond the range is specified by a corresponding reduction pattern. The reduce voting system according to claim 10, further comprising: means for obtaining a voting pattern in combination with a plurality of voting. 14. A system comprising: a plurality of terminal devices for issuing voting tickets; a center connected to each terminal device; voting for a game result of a plurality of games; A terminal device for a reduce voting system that allows designation of a reduce when a plurality of match results are predicted, wherein the terminal device includes an input unit that inputs a prediction of a match result of a plurality of matches including a designation of a reduce. A terminal device, comprising: transmitting means for transmitting the input prediction to the center; and issuing means for issuing a voting ticket in which the input prediction is recorded in accordance with a notification from the center. 15. A system comprising a plurality of terminal devices for issuing voting tickets, and a center connected to each terminal device, voting for the results of a plurality of games, allowing a plurality of votes for each game, and A reduce voting system center for allowing a reduction to be designated when a plurality of match results are expected, wherein the center is a reduce pattern storage unit that stores a reduce pattern, and a notification of voting content from the terminal device. And deploys the voting content in accordance with the reduce pattern, and stores the expanded voting content; and a voting elected from the voting content stored in the voting data storage device based on the match result. A winning data storage means for extracting contents and storing the vote. 16. A reduce voting method for performing reduce voting by transmitting and receiving signals between a plurality of terminal devices for issuing voting tickets and a center connected to each terminal device, wherein In the device, input the prediction of the game result of a plurality of games including the designation of reduce, transmit the input prediction to the center, issue a voting ticket based on the input content, and in the center, the terminal device Receives the predictions sent from, expands the voting content according to the previously stored reduce pattern, stores the expanded content, and, based on the match result, selects the winning content from the stored voting content. Extracting a vote having a reduced vote.