Information processing apparatus, information processing method, and program

Abstract

To provide an information processing apparatus configured to enhance the fun of notification performance for reporting a result of an electronic drawing right.SOLUTION: An information processing apparatus is configured to execute notification performance for reporting whether first information matches second information for which a user has a right, the first information including multiple pieces of result information, the second information including multiple pieces of selection information, the notification performance including multiple stages of performance. The number of pieces of result information constituting the first information is variable. According to the number of pieces of result information constituting the first information, the maximum number of the stages of notification performance to be executed is changed.SELECTED DRAWING: Figure 8

Description

[Technical field]

[0001] The present invention relates to an information processing device, an information processing method, and a program for notifying whether or not granted information matches winning information. [Background technology]

[0002] Conventionally, there has been known an information processing system that provides users with granted information, which is an electronic lottery ticket (for example, Patent Document 1). In the above conventional technology, an information processing device (for example, a smartphone) owned by a user may be configured to be capable of executing a notification performance for notifying whether or not the granted information matches the winning information. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Patent Publication No. 2022-76961 Summary of the Invention [Problem to be solved by the invention]

[0004] The present invention aims to improve the entertainment value of notification presentations. [Means for solving the problem]

[0005] In order to solve the above problems, the information processing device of the present invention is an information processing device that is capable of executing a notification display to notify whether or not first information matches second information to which a user has rights, wherein the first information is composed of a plurality of result information, the second information is composed of a plurality of selection information, the notification display is composed of a plurality of stages of display, the number of result information constituting the first information is variable, and the maximum number of execution stages of the notification display changes depending on the number of result information constituting the first information. Effect of the Invention

[0006] According to the present invention, the entertainment value of the notification effect for notifying whether the second information matches the first information is improved. [Brief description of the drawings]

[0007] [Figure 1] FIG. 2 is a diagram for explaining each component of the information processing system. [Diagram 2] FIG. 2 is a diagram for explaining a hardware configuration of a terminal device. [Diagram 3] FIG. 2 is a functional block diagram of an information processing device. [Figure 4] 4A to 4C are diagrams for explaining specific examples of the first information and the second information. [Diagram 5] 4A to 4C are diagrams for explaining specific examples of information received by an information processing device. [Figure 6] 13 is a diagram for explaining another specific example of the first information and the second information. FIG. [Figure 7] FIG. 13 is a conceptual diagram of a specific example of a performance determination table. [Figure 8] FIG. 13 is a conceptual diagram of another specific example of the effect determination table. [Figure 9] FIG. 13 is a conceptual diagram of yet another specific example of the effect determination table. [Figure 10] A figure to explain specific examples of each image displayed at each point in the notification performance. [Figure 11] FIG. 13 is a diagram for explaining a specific example of an execution number. [Figure 12] FIG. 11 is a diagram for explaining a specific example of priority. [Figure 13] FIG. 11 is a schematic diagram of a specific example of a received image. [Figure 14] 11 is a flowchart of a reception process executed by the information processing device. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0008] 1 is a diagram for explaining an example of an information processing system 1 of the present invention. The information processing system 1 is configured to be able to grant second information Dx, which is an electronic lottery ticket, to a user. The information processing system 1 is also configured to be able to determine first information Dy. When the second information Dx granted to a user matches the first information Dy, a predetermined winning amount is granted to the user.

[0009] As shown in Fig. 1, the information processing system 1 includes a terminal device 100, a control server 200, and a management server 300. Each of the above devices is configured to be capable of communicating with each other via a network N. As the network N, various communication networks including the Internet are assumed. For the sake of explanation, although one terminal device 100 is shown in Fig. 1, the information processing system 1 is configured to be capable of providing services to a plurality of terminal devices 100 (a plurality of users).

[0010] The management server 300 manages various information in the information processing system 1. For example, the management server 300 stores various pieces of information for managing users. The above-mentioned pieces of information are assumed to be a user ID for identifying a user, a remaining charge amount that the user can use to purchase second information Dx, and an amount of winnings awarded to the user. Although FIG. 1 shows one computer as the management server 300, the management server 300 may be configured with multiple computers. The same applies to the control server 200.

[0011] The management server 300 also stores the first information Dy. In this embodiment, the first information Dy is determined according to the results of an auto race. Specifically, as shown in FIG. 1, the first information Dy is an array of multiple pieces of result information (ny1, ny2...). Each piece of result information ny in the first information Dy is determined according to the car number that came first in a predetermined race R (1, 2...). Car numbers in an auto race are any of the numbers "1" to "8".

[0012] In auto racing, it is normal for each racer to have a different winning percentage. Specifically, the higher the winning percentage of the racer in past races, the larger the car number of the racer. In the above configuration, the number "8" is most likely to be determined as the result information ny, and the number "1" is most unlikely to be determined. However, in this embodiment, unless otherwise specified, it is assumed that each racer has the same winning percentage.

[0013] As described above, the first information Dy in this embodiment is determined based on the results of multiple races R. Hereinafter, for the sake of explanation, the combination of multiple races R that determines the first information Dy may be referred to as a "race combination C" that corresponds to the first information Dy. In this embodiment, multiple pieces of first information Dy are determined, each of which corresponds to a different race combination C. That is, each piece of first information Dy is determined based on the results of races R that differ in venue, date and time, and race number.

[0014] Although details will be described later, a user can select a race combination C for which second information Dx is purchased. When the second information Dx of the race combination C purchased by the user matches the first information Dy corresponding to the race combination C, the second information Dx wins. The management server 300 stores the date and time of each race R, the race venue, and the race number for each race combination C. In addition, the first-place car number (result information ny) is stored for each race R. Furthermore, the management server 300 stores the determined first information Dy in association with the race combination C to which the first information Dy corresponds.

[0015] In this embodiment, the number of races R in the race combination C corresponding to the first information Dy is variable. Specifically, there are provided double wins in which the first information Dy is determined according to the results of two races R, triple wins in which the first information Dy is determined according to the results of three races R, and quadruple wins in which the first information Dy is determined according to the results of four races R (multiple multiple win types Rt are provided). When the multiple win type Rt is double wins, the first information Dy is an arrangement of two pieces of result information ny (ny1, ny2) (see FIG. 5(a) described later). When it is triple wins, the first information Dy is an arrangement of three pieces of result information ny (ny1, ny2, ny3) (see FIG. 6(a) described later). Similarly, when it is quadruple wins, the first information Dy is an arrangement of four pieces of result information ny (ny1, ny2, ny3, ny4) (see FIG. 6(c) described later).

[0016] Among the races R in a race combination C, the earlier a race R is held, the earlier its position in the first information Dy (array of result information ny) corresponding to that race combination C. For example, in the specific example of FIG. 1, it is assumed that, among the races R in the race combination C, race R1 is held first and race R2 is held second. In the above case, the first result information ny1 is determined according to the result of race R1, and the second result information ny2 is determined according to the result of the subsequent race R2. In the specific example of FIG. 1, it is assumed that car No. 8 comes first in race R1, and car No. 7 comes first in race R2. In the above case, the first information Dy has an array of result information "8(ny1), 7(ny2)...".

[0017] The management server 300 updates each piece of information in response to various requests from the terminal device 100 (user) received via the control server 200. For example, when a purchase request to purchase second information Dx (electronic lottery ticket) is received, the management server 300 subtracts the remaining charge amount available to the user, and determines and stores the second information Dx to be newly granted to the user. Specifically, the purchase request includes target race information and multiple win type Rt that specify each piece of information (venue, race number, date and time) related to each race R of the race combination C selected by the user. The management server 300 determines the second information Dx by lottery based on the multiple win type Rt and the target race information included in the purchase request.

[0018] Each selection information nx of the second information Dx corresponds to each result information ny of the first information Dy. For example, in the specific example of FIG. 1, the first information Dy is an array of "8 (ny1), 7 (ny2) ...", and the second information Dx is an array of "1 (nx1), 7 (ny2) ...". The selection information nx1 corresponds to the result information ny1, the selection information nx2 corresponds to the result information ny2, the selection information nx3 corresponds to the result information ny3, and the selection information nx4 corresponds to the result information ny4. Note that, in the specific example of FIG. 1, the selection information nx2 of each selection information nx of the second information Dx matches the result information ny2 (nx2 = ny2 = 7), but the selection information nx1 does not match the result information ny1 (nx1 ≠ ny1). Therefore, the second information Dx is "non-winning".

[0019] In this embodiment, a predetermined number (64, 512, 4096) of second information Dx with different combinations of selection information nx are generated for each race combination C and sold to users. Specifically, when the multiple win type Rt is double win and eight racers participate in each race R of the race combination C, there are 64 types (=8×8) of first information Dy (combinations of result information ny) corresponding to the race combination C. In the above case, a total of 64 pieces of second information Dx for the race combination C are generated and sold. In the above configuration, the number of winning second information Dx among each piece of second information Dx for one race combination C is one.

[0020] Similarly, in the case of a triple win, the number of types of first information Dy is 512 (=8×8×8), and 512 pieces of second information Dx are generated and sold for each race combination C. In addition, in the case of a quadruple win, the number of types of first information Dy is 4096 (=8×8×8×8), and 4096 pieces of second information Dx are generated and sold for each race combination C. However, the method of generating the second information Dx is not limited to the above example. For example, a configuration may be adopted in which duplicate second information Dx may occur among second information Dx that share a race combination C.

[0021] The terminal device 100 accepts, for example, a user's operation for purchasing second information Dx (electronic lottery ticket). Specifically, the terminal device 100 accepts an operation for selecting the above-mentioned race combination C (a combination of races R that determines the first information Dy) for purchasing the second information. The multiple win type Rt is essentially selected by the above-mentioned operation. In addition, the terminal device 100 accepts an operation for selecting the number of pieces of second information Dx to be purchased. When the terminal device 100 accepts a user's purchase operation for purchasing the second information Dx, it transmits the above-mentioned purchase request including the number of pieces to be purchased to the control server 200. When the control server 200 receives the purchase request, it transfers the purchase request to the management server 300.

[0022] When the management server 300 receives a purchase request, it determines whether or not the second information Dx of the multiple win type Rt specified in the purchase request can be purchased in the purchase quantity (whether or not the user's remaining balance is sufficient). If the purchase quantity of second information Dx specified in the purchase request can be purchased, the management server 300 stores the combination of the multiple win type Rt and the purchase quantity in association with the user ID. In the above cases, the management server 300 subtracts the user's remaining balance and notifies the terminal device 100 (user) via the control server 200 that the purchase of the second information Dx has been completed.

[0023] The management server 300 generates second information Dx for the multiple win type Rt in response to the purchase request, the number of pieces purchased, and stores the second information Dx in correspondence with the user ID. Specifically, the management server 300 determines each piece of selection information nx of the second information Dx by lottery. The second information Dx is generated, for example, when the holding of each race R, in which each piece of result information ny of the first information Dy is determined, is confirmed. The management server 300 notifies the terminal device 100 (user) of the second information Dx via the control server 200 before the first race R is held.

[0024] If the number of second information Dx specified in the purchase request cannot be purchased, the control server 200 is notified of that fact. The control server 200 transfers the notification received from the management server 300 to the terminal device 100. Note that the terminal device 100 may be configured so that the amount required to purchase the second information Dx can be charged by appropriately operating the terminal device 100. For example, when a notification is received that the second information Dx cannot be purchased, the terminal device 100 may display a charge image to enable charging of the amount required to purchase the second information Dx.

[0025] When all the result information ny constituting the first information Dy are determined, the notification performance E can be executed in the terminal device 100 (see FIG. 10 described later). The notification performance E is a performance for notifying the user whether the second information Dx given to the user matches the first information Dy. Specifically, the terminal device 100 can accept an execution operation (a touch operation of a button B shown in FIG. 13 described later) for executing the notification performance E. When the terminal device 100 accepts the execution operation, it transmits a result notification request to the management server 300 via the control server 200. When the management server 300 receives the result notification request, it transmits the second information Dx and the first information Dy to the terminal device 100 via the control server 200.

[0026] The terminal device 100 judges whether the second information Dx and the first information Dy received from the control server 200 match, and executes a notification effect E according to the judgment result. According to the above embodiment, the user can check the success or failure of the purchased second information Dx on the terminal device 100 that the user owns. Therefore, the convenience of the user is improved compared to a configuration in which the success or failure of the second information Dx can be checked only by a dedicated device installed at the auto race track, for example.

[0027] However, if the notification performance E is a simple performance that simply notifies only the win or loss of the second information Dx, some users may feel that it is lacking in interest. In consideration of the above circumstances, this embodiment is provided with a configuration that improves the interest of the notification performance E. Specifically, the notification performance E is configured to be executable up to any of multiple stages. In addition, the number of stages executed in the notification performance E is configured to be variably determined according to the number of result information nx that matches the result information ny and the multiple win type Rt (the number of result information ny that constitutes the first information Dy). The above configuration will be described in detail later.

[0028] Fig. 2 is a block diagram showing a hardware configuration of the terminal device 100. As shown in Fig. 2, the terminal device 100 includes a CPU 101, a memory 102, a communication unit 103, and a display unit 104. The above terminal device 100 is assumed to be a smartphone carried by a user. Note that the terminal device 100 is not limited to a smartphone, and a tablet computer may also be used.

[0029] The CPU 101 controls the entire terminal device 100. The memory 102 stores various information including a basic program and an application program PG. When the application program PG is executed by the CPU 101, various services can be provided in the terminal device 100 via the control server 200.

[0030] For example, during the period in which the application program PG is executed, an operation for purchasing the second information Dx can be accepted in the terminal device 100. Also, during the period in which the application program PG is executed, the above-mentioned notification performance E can be executed in the terminal device 100. The above-mentioned application program PG is downloaded in advance from a specific site and installed in the terminal device 100.

[0031] The communication unit 103 communicates with the control server 200 via the network N. The terminal device 100 (communication unit 102) may be configured to directly communicate with the management server 300. The display unit 104 includes a display panel Pa and a touch panel Pb. The display panel Pa is, for example, a flat display configured with an organic EL (Electro Luminescence). The touch panel Pb is configured to be able to detect a touch operation by a user. Specifically, the touch panel Pb is provided over the display panel Pa, and accepts a touch operation on an image displayed on the display panel Pa.

[0032] Fig. 3 is a functional block diagram of the information processing device 10. For example, the above-mentioned CPU 101 executes the application program PG, causing the terminal device 100 to function as the information processing device 10. Note that Fig. 3 also shows a control device 20 and a management device 30 in addition to the information processing device 10. For example, the above-mentioned control server 200 functions as the control device 20. Furthermore, the above-mentioned management server 300 functions as the management device 30.

[0033] As shown in Fig. 3, the information processing device 10 includes an acquisition unit 11, a judgment unit 12, a storage unit 13, a decision unit 14, a control unit 15, a display unit 16, and an operation unit 17. The display unit 16 can execute a notification effect E for notifying whether or not the first information Dy matches the second information Dx given to the user. For example, the display panel Pa of the above-mentioned display unit 103 functions as the display unit 16. The operation unit 17 accepts various operations including an operation for executing the notification effect E. For example, the touch panel Pb of the above-mentioned display unit 103 functions as the operation unit 17.

[0034] The acquisition unit 11 acquires the first information Dy and the second information Dx. Specifically, when the information processing device 10 accepts an operation to execute the notification performance E, the information processing device 10 transmits a result notification request to the management device 30 via the control device 20. When the management device 30 receives the result notification request, the management device 30 transmits the second information Dx and the first information Dy to the information processing device 10 via the control device 20. Specifically, the management device 20 transmits the second information Dx of the race combination C purchased by the user and the first information Dy corresponding to the race combination C. Note that the timing at which the information processing device 10 acquires the second information Dx and the first information Dy is not limited to the above example. For example, the information processing device 10 may be configured to acquire the second information Dx and the first information Dy at different times. The second information Dx and the first information Dy acquired by the acquisition unit 11 are input to the determination unit 12.

[0035] The determination unit 12 determines whether the second information Dx matches the first information Dy. Specific examples of the second information Dx and the first information Dy are shown in FIG. 3. As described above, the first information Dy is an array of a plurality of pieces of result information ny, and each piece of result information ny is determined from a plurality of types of numbers (1 to 8). In addition, the second information Dx is an array of a plurality of pieces of selection information nx, and each piece of selection information nx is determined from a plurality of types of numbers (1 to 8). In addition, each piece of selection information nx corresponds to one of the plurality of pieces of result information ny.

[0036] The determination unit 12 identifies the number of winnings dn, which is the number of pieces of selection information nx that match the result information ny. For example, assume that the first information Dy "ny1, ny2" of a double win is "8, 8" and the second information Dx "nx1, nx2" is "1, 8". In the above cases, the selection information nx1 does not match the result information ny1 (nx1 ≠ ny1), and the selection information nx2 matches the result information ny2 (nx2 = ny2 = 8). Therefore, the number of winnings dn is the numerical value "1". Hereinafter, for the sake of explanation, "the result information ny corresponding to the selection information nx matches the selection information nx" may be simply described as "the selection information nx wins".

[0037] For example, when the second information Dx of the double win matches the first information Dy (nx1=ny1, nx2=ny2), the number of winnings dn becomes the value "2". Also, when one of the second information Dx of the double win wins, the number of winnings dn becomes the value "1". Specifically, when the selection information nx1 of the second information Dx wins and the selection information nx2 does not win, and when the selection information nx2 wins and the selection information nx1 does not win, the number of winnings dn is commonly the value "1". That is, the number of winnings dn is determined regardless of the type of the selection information nx that wins (the position in the array "nx1, nx2 ..."). The number of winnings dn determined by the determination unit 12 is input to the determination unit 14.

[0038] The determination unit 14 determines the stage of the notification effect E. Specifically, the determination unit 14 determines the notification effect E using the effect determination table T and the number of wins dn. The above-mentioned effect determination table T is stored in the storage unit 13, and is provided for each multiple win type Rt (see Figs. 7 to 9 described later). The notification effect E determined by the determination unit 14 is notified to the control unit 15.

[0039] For example, in the case of a double win, the notification effect E is executed up to the second stage. Specifically, when the number of winnings dn is the value "0", the notification effect E ends at the first stage (challenge effect described later). On the other hand, when the number of winnings dn is the value "1" or "2", the notification effect E is executed up to the second stage (battle effect described later). However, when the number of winnings dn is the value "1", a defeat image is displayed in the second stage, and when the number of winnings dn is the value "2", a victory image is displayed in the second stage. In the case of a triple win or quadruple win, as in the case of a double win, when the number of winnings dn is the value "1" or more, the notification effect E from the second stage onwards is executed. As can be understood from the above explanation, the stage of the notification effect E is variably determined according to the number of winnings dn.

[0040] Although details will be described later, in the final stage of the notification performance E (the second stage in the case of a double win, the third stage in the case of a triple win, and the fourth stage in the case of a quadruple win), a battle performance Ed is executed. In the battle performance Ed, there are cases where only the first half stage (the stage in which the enemy character attacks) is executed, and cases where both the first half stage and the second half stage (the stage in which the ally character counterattacks) are executed. In this embodiment, for the sake of simplicity, the above battle performance Ed (first half stage, second half stage) may be explained as one stage of the notification performance E. However, the first half stage and the second half stage of the battle performance Ed are separate "stages" in the present invention.

[0041] As described above, the number of winning items dn is determined regardless of the position of the winning selection information nx in the array (nx1, nx2...) of the second information Dx. In other words, in this embodiment, the stage of the notification effect E is determined regardless of the position of the selection information nx in the array of the second information Dx. According to the above configuration, even if the first selection information nx1 is not a winning item, the notification effect E continues to the second stage or later if any of the other selection information nx is a winning item.

[0042] Let us assume a configuration (hereinafter, "comparative example") in which the notification effect E ends at the initial stage if the selection information nx1, which determines whether or not a winner will win in the first race R, is not selected. In the above comparative example, the notification effect E ends at the initial stage even if the selection information nx (2-4), which determines whether or not a winner will win in the second or subsequent races R, is selected. Therefore, the probability that the notification effect E will continue to the second stage or later becomes extremely low, which may cause an inconvenience that makes the notification effect E less interesting. The configuration of the present embodiment described above has the advantage that the above inconveniences are suppressed compared to, for example, the comparative example.

[0043] In this embodiment, the number (2, 3, 4) of the result information ny constituting the first information Dy is variable depending on the multiple win type Rt (double win, triple win, quadruple win). The determination unit 14 determines the execution of the notification effect E with a number of stages depending on the number of the result information ny constituting the first information Dy (multiple win type). Specifically, in the case of a double win, a maximum of two stages of the notification effect E are executed. In addition, in the case of a triple win, a maximum of three stages of the notification effect E are executed, and in the case of a quadruple win, a maximum of four stages of the notification effect E are executed.

[0044] As described above, the probability that the second information Dx matches the first information Dy (winning probability) differs for each multiple win type Rt. Specifically, the winning probability for a double win is 1 / 64. The winning probability for a triple win is 1 / 512, and the winning probability for a quadruple win is 1 / 4096. That is, the probability that all the selected information nx of the second information Dx wins decreases as the number of second information Dx that should win increases. Specifically, the winning probability of the second information Dx is highest for a double win and lowest for a quadruple win. In addition, the winning amount given to the user in the event of a win is the highest for a quadruple win, the second highest for a triple win, and the lowest for a double win.

[0045] However, as will be described in detail later, the probability that one or more pieces of selection information nx will be a winner increases as the number of pieces of selection information nx constituting the second information Dx increases (see Figs. 5 and 6). In other words, the probability that the number of wins dn will be the numerical value "1" or more is highest for quadruple wins, second highest for triple wins, and lowest for double wins. According to the above configuration, the notification effect E of quadruple wins, which has the lowest probability of winning, is more likely to continue to the second stage and beyond, compared to the notification effect E of other multiple win types Rt. According to the above configuration, there is an advantage in that it is easier to maintain the expectation that the second information Dx of quadruple wins, which has the lowest probability of winning, may have won, for a long period of time.

[0046] The control unit 15 enables the notification performance E determined by the determination unit 14 to be executed. Specifically, the control unit 15 causes the display unit 16 to execute the notification performance E. In this embodiment, it is possible to give a plurality of pieces of second information Dx to the user, and the control unit 15 may enable the execution of a notification performance E that notifies at once whether any of the plurality of pieces of second information Dx matches the first information Dy. In the above case, the determination unit 14 determines the stage of the notification performance E based on the maximum number of winning pieces dn among the number of winning pieces dn of the plurality of pieces of second information Dx. The above configuration will be described in detail with reference to FIG. 12 and FIG. 14 described later. In this embodiment, unless otherwise specified, it is assumed that one piece of second information Dx is given to the user.

[0047] Fig. 4 is a diagram for explaining a specific example of each piece of information that the information processing device 10 receives from the control device 20. Fig. 4 shows each piece of information that the information processing device 10 receives and the occasion when the information is received.

[0048] For example, when the information processing device 10 receives an operation to display race information, it transmits a race information request to the control device 20. When the control device 20 receives the race information request, it transmits the "number of cars", "date of event", "time of event", "closing date and time", "venue", "total number of purchases", "probability of winning", "maximum winning amount", and "purchase amount per share" to the information processing device 10. The "number of cars" indicates the number of racers who will participate in the race R. The "date of event" indicates the date of the race R, the "time of event" indicates the time of the race R, the "closing date and time" indicates the date and time when the purchase of the second information Dx is closed, the "venue" indicates the race venue where the race R is held, and the "total number of purchases" indicates the total number of the second information Dx purchased by each user. In addition, the "probability of winning" indicates the probability that the second information Dx will win, the "maximum winning amount" indicates the winning amount that will be awarded if the second information Dx wins, and the "purchase amount per share" indicates the amount required to purchase one piece of second information.

[0049] When the information processing device 10 accepts the purchase operation of the second information, it transmits a purchase request to the control device 20. When the control device 20 receives the purchase request, it transmits "purchase availability" to the information processing device 10. "Purchase availability" is information indicating whether or not the number of pieces of second information specified in the purchase request is available for purchase. Furthermore, when the number of pieces of second information specified in the purchase request is available for purchase, the control device 20 transmits "number of purchases," "charge amount," "purchase amount," and "purchase date and time" to the information processing device 10. "Number of purchases" indicates the number of pieces of second information newly purchased by the user, "charge amount" indicates the remaining charge amount after purchasing the second information Dx, "purchase amount" indicates the amount used this time to purchase the second information, and "purchase date and time" is information indicating the date and time when the second information was purchased.

[0050] When the information processing device 10 receives an execution operation to execute the notification effect E, it transmits a result notification request to the control device 20. When the control device 20 receives the result notification request, it transmits first information Dy to the information processing device 10. Furthermore, when the control device 20 receives the result notification request, it transmits "near the pin information," "unconfirmed list," and "total winnings" to the information processing device 10. The unconfirmed list is a list of second information Dx for which the win or loss has not been notified by the notification effect E.

[0051] The near pin information is transmitted when a user purchases the second information Dx for the race combination C of a quadruple win. The above near pin information is a sequence of four numbers, similar to the first information Dy. Specifically, the near pin information is a sequence of numbers in which only one of the result information ny in the first information Dy is different. For example, assume that the first information Dy is "8, 7, 6, 8". In the above cases, the near pin information is "8, 7, 6, 1", "8, 7, 6, 2", "8, 7, 6, 3", "8, 7, 6, 4", "8, 7, 6, 5", "8, 7, 6, 6", "8, 7, 6, 7", "8, 7, 1, 8", "8, 7, 2, 8", "8, 7, 3, 8", "8, 7, 4, 8", "8, 7, 5, 8", "8, 7, 7, 8", "8, 7, 8, 8", "8, 1, 6, 8", "8, 2, 6, 8", "8, 3, 6, 8", "8, 4, 6, 8", "8, 5, 6, 8", "8, 6, 6, 8", "8, 8, 6, 8", "1, 7, 6, 8", "2, 7, 6, 8", "3, 7, 6, 8", "4, 7, 6, 8", "5, 7, 6, 8", "6, 7, 6, 8", "7, 7, 6, 8".

[0052] If the second information Dx matches any of the near pin information, a predetermined winning amount is awarded to the user. However, the winning amount when the second information Dx matches any of the near pin information is smaller (e.g., 500 yen) than the winning amount when the second information Dx matches the first information Dy. Note that when a battle performance described below is executed, the second information Dx matches at least one of the near pin information and the first information Dy. "Total winning amount" indicates the total winning amount awarded to the user.

[0053] 5(a) and 5(b) are diagrams for explaining specific examples of the second information Dx and the first information Dy of a double win. Hereinafter, for the sake of explanation, the second information Dx of a double win may be described as "second information Dxa" to distinguish it from the second information Dx of other multiple win types Rt. Similarly, the second information Dx of a triple win may be described as "second information Dxb", and the second information Dx of a quadruple win may be described as "second information Dxc". Also, the first information Dy of a double win may be described as "first information Dya" to distinguish it from the first information Dy of other multiple win types Rt. Similarly, the first information Dy of a triple win may be described as "first information Dyb". Also, the first information Dy of a quadruple win may be described as "first information Dyc".

[0054] FIG. 5(a) is a diagram for explaining a specific example of the first information Dya. The first information Dya for a double win is an arrangement of result information ny1 and result information ny2. In the specific example of FIG. 5(a), it is assumed that car number "2" comes first in race R that determines the result information ny1, and then car number "7" comes first in race R that determines the result information ny2. In the above case, the first information Dya becomes "2(ny1), 7(ny2)".

[0055] FIG. 5(b) is a diagram for explaining a specific example of the second information Dxa. In the specific example of FIG. 5(b), as in the specific example of FIG. 5(a), the first information Dya is assumed to be "2 (ny1), 7 (ny2)". As described above, the second information Dxa of a double win is an array of selection information nx1 and selection information nx2. In FIG. 5(b), specific examples of the second information Dxa are shown for each number of winnings dn. Hereinafter, for the sake of explanation, the number of winnings dn in a double win may be referred to as "number of winnings dna" to distinguish it from the number of winnings dn in other multiple win types Rt. The number of winnings dna is any one of the numbers "0" to "2".

[0056] For example, if all the selection information nx in the second information Dxa are non-winning, the number of winning pieces dna will be the value "0". Also, if we assume that each racer has the same winning rate, the probability that the selection information nx is a non-winning piece is "7 / 8". Therefore, the probability that the number of winning pieces dna will be the value "0" in the case of a double win is approximately "77%" ((7 / 8) x (7 / 8) x 1 ≒ 0.77).

[0057] When one of the selection information nx of the second information Dxa is a winner and the other is not a winner, the number of winning pieces dna becomes the value "1". Specifically, the number of winning pieces dna is assumed to be the value "1" when the selection information nx1 of the second information Dxa is a winner and the selection information nx2 is not a winner, and when the selection information nx2 is a winner and the selection information nx1 is not a winner. Also, assuming that each racer has the same winning rate, the probability that the selection information nx will be a winner is "1 / 8", and the probability that the selection information nx will not be a winner is "7 / 8". Therefore, the probability that the number of winning pieces dna will be the value "1" in a double win is approximately "22%" ((1 / 8) x (7 / 8) x 2 ≒ 0.22).

[0058] If all the selection information nx of the second information Dxa are winning, the number of winnings dna will be the number "2". The probability that the number of winnings dna will be the number "2" in a double win is approximately "1.5%" ((1 / 8) x (1 / 8) x 1 ≒ 0.015).

[0059] 6(a) and 6(b) are diagrams for explaining a specific example of the second information Dxb and the first information Dyb of a triple win. FIG. 6(a) shows an example of the first information Dyb. The first information Dyb of a triple win is an arrangement of the result information ny1, the result information ny2, and the result information ny3. In the specific example of FIG. 6(a), it is assumed that the car number "8" comes first in the race R that determines the result information ny1, then the car number "6" comes first in the race R that determines the result information ny2, and then the car number "8" comes first in the race R that determines the result information ny3. In the above case, the first information Dyb becomes "8(ny1), 6(ny2), 8(ny3)".

[0060] FIG. 6(b) is a diagram for explaining a specific example of the second information Dxb. The second information Dxb of a triple win is an arrangement of selection information nx1, selection information nx2, and selection information nx3. Also, in FIG. 6(b), a specific example of the second information Dxb is shown for each winning number dn. Hereinafter, for the sake of explanation, the winning number dn in a triple win may be described as "winning number dnb" to distinguish it from the winning number dn in other multiple win types Rt. The winning number dnb is any one of the values ​​"0" to "3". In the specific example of FIG. 6(b), as in the specific example of FIG. 6(a), the first information Dy is assumed to be "8 (ny1), 6 (ny2), 8 (ny3)".

[0061] For example, if all the selection information nx of the second information Dxb are non-winning, the number of winnings dnb will be the value "0". In a triple win, the probability that the number of winnings dnb will be the value "0" is approximately "67%" ((7 / 8) x (7 / 8) x (7 / 8) x 1 ≒ 0.67). In addition, the number of winnings dnb will be the value "1" when the selection information nx1 of the second information Dxb is a winning and the other selection information nx (2, 3) is a non-winning, when the selection information nx2 is a winning and the other selection information nx (1, 3) is a non-winning, or when the selection information nx3 is a winning and the other selection information nx (1, 2) is a non-winning. Therefore, the probability that the number of winnings dnb will be the value "1" is approximately "29%" ((1 / 8) x (7 / 8) x (7 / 8) x 3 ≒ 0.29).

[0062] In addition, the number of winning items dnb will be the number "2" when the selection information nx1 of the second information Dxb is a non-winning item and the other selection information nx(2,3) is a winning item, when the selection information nx2 is a non-winning item and the other selection information nx(1,3) is a winning item, and when the selection information nx3 is a non-winning item and the other selection information nx(1,2) is a winning item. Therefore, the probability that the number of winning items dnb will be the number "2" is approximately "4%" ((1 / 8) x (1 / 8) x (7 / 8) x 3 ≒ 0.04). Similarly, the probability that the number of winning items dnb will be the number "3" in a triple win is approximately "0.2%" ((1 / 8) x (1 / 8) x (1 / 8) x 3 ≒ 0.02).

[0063] FIG. 6(c) and FIG. 6(d) are diagrams for explaining a specific example of the second information Dxc and the first information Dyc of a quadruple win. FIG. 6(c) shows an example of the first information Dyc. The first information Dyc of a quadruple win is an arrangement of the result information ny1 to the result information ny4. In the specific example of FIG. 6(c), it is assumed that the car number "8" comes first in the race R that determines the result information ny1, then the car number "7" comes first in the race R that determines the result information ny2, then the car number "6" comes first in the race R that determines the result information ny3, and then the car number "8" comes first in the race R that determines the result information ny4. In the above cases, the first information Dyc becomes "8(ny1), 7(ny2), 6(ny3), 8(ny4)".

[0064] FIG. 6(d) is a diagram for explaining a specific example of the second information Dxc. The second information Dxc of a quadruple win is an array of selection information nx1 to nx4. In FIG. 6(d), a specific example of the second information Dxc is shown for each number of winnings dn. Hereinafter, for the sake of explanation, the number of winnings dn in a quadruple win may be described as "number of winnings dnc" to distinguish it from the number of winnings dn in other multiple win types Rt. The number of winnings dnc is any one of the values ​​"0" to "4". In the specific example of FIG. 6(d), as in the specific example of FIG. 6(c), the first information Dy is assumed to be "8 (ny1), 7 (ny2), 6 (ny3), 8 (ny4)".

[0065] For example, the number of winning items dnc is assumed to be "0" only when all the selection information nx of the second information Dxc are non-winning items. Therefore, the probability that the number of winning items dnc is "0" is approximately "59%" ((7 / 8) x (7 / 8) x (7 / 8) x (7 / 8) x 1 ≒ 0.59). The number of winning items dnc is assumed to be "1" when the selection information nx1 of the second information Dxc is a winning item and the other selection information nx (2, 3, 4) is a non-winning item, when the selection information nx2 is a winning item and the other selection information nx (1, 3, 4) is a non-winning item, when the selection information nx3 is a winning item and the other selection information nx (1, 2, 4) is a non-winning item, when the selection information nx4 is a winning item and the other selection information nx (1, 2, 3) is a non-winning item. Therefore, the probability that the number of winning numbers dnc is the number "1" is approximately "33%" ((1 / 8) x (7 / 8) x (7 / 8) x (7 / 8) x 4 ≒ 0.33).

[0066] The number of winning items dnc will be the value "2" when the selection information nx1 and selection information nx2 of the second information Dxc are winning and the other selection information nx(3, 4) is not winning, when the selection information nx1 and selection information nx3 are winning and the other selection information nx(2, 4) is not winning, when the selection information nx1 and selection information nx4 are winning and the other selection information nx(2, 3) is not winning, when the selection information nx2 and selection information nx3 are winning and the other selection information nx(1, 4) is not winning, when the selection information nx2 and selection information nx4 are winning and the other selection information nx(1, 3) is not winning, when the selection information nx3 and selection information nx4 are winning and the other selection information nx(1, 2) is not winning. Therefore, the probability that the number of winning numbers dnc is the number "2" is approximately "7%" ((1 / 8) x (1 / 8) x (7 / 8) x (7 / 8) x 6 ≒ 0.07).

[0067] In addition, the number of winning items dnc is assumed to be the number "3" when the selection information nx1 of the second information Dxc is a non-winning item and the other selection information nx(2, 3, 4) is a winning item, when the selection information nx2 is a non-winning item and the other selection information nx(1, 3, 4) is a winning item, when the selection information nx3 is a non-winning item and the other selection information nx(1, 2, 4) is a winning item, and when the selection information nx4 is a non-winning item and the other selection information nx(1, 2, 3) is a winning item. Therefore, the probability that the number of winning items dnc is the number "3" is approximately "0.6%" ((1 / 8) x (1 / 8) x (1 / 8) x (7 / 8) x 4 ≒ 0.006). Similarly, the probability that the number of winnings dnc will be the number "4" in a quadruple win is approximately "0.02%" ((1 / 8) x (1 / 8) x (1 / 8) x (1 / 8) x 1 ≒ 0.0002).

[0068] 7(a) is a diagram for explaining a specific example of the notification effect E. The notification effect E of this embodiment is configured to include challenge effects (Ea to Ec). The challenge effects (Ea to Ec) are executed up to one of multiple stages (1 to 3 stages) according to the number of winning items dn (the number of winning selection information nx).

[0069] Specifically, the challenge effects (Ea to Ec) are executed up to a maximum of three stages. However, the maximum number of stages of the challenge effects E changes depending on the multiple win type Rt (the number of pieces of result information ny that make up the first information Dy). The above configuration will be described in detail later. Also, the notification effects E may include a battle effect Ed depending on the numerical value of the number of wins dn. In other words, the notification effects E may be executed up to a maximum of four stages, including the above-mentioned challenge effects (Ea to Ec) and the battle effect Ed.

[0070] The battle performance Ed may be executed in the final stage of the notification performance E. Specifically, if the number of pieces of result information ny included in the first information Dy is "M" (M=2, 3, 4), and the number of winning pieces dn is less than the value "M-1", the notification performance E consisting of only the challenge performance Ea is determined. In the notification performance E described above, it is notified in the challenge performance Ea that the second information Dx is not a winning piece, and the performance does not progress to the battle performance Ed.

[0071] On the other hand, if the number of winnings dn is equal to or greater than the value "M-1" (if dn=M or dn=M-1), the notification effect E consisting of the challenge effect (Ea to Ec) and the battle effect Ed is determined. In the notification effect E, the challenge effect (Ea to Ec) progresses to the battle effect Ed.

[0072] For example, when the number of winning pieces dn is the number "M" (when all the selection information nx is a winning piece), a battle performance Ed is executed in which the ally character wins against the enemy character. In the above battle performance Ed, it is notified that the second information Dx is a winning piece. On the other hand, when the number of winning pieces dn is the number "M-1" (when only one selection information nx is a non-winning piece), a battle performance Ed is executed in which the ally character is defeated by the enemy character. In the above battle performance Ed, it is notified that the second information Dx is a non-winning piece.

[0073] FIG. 7(b) is a diagram for explaining a specific example of the effect determination table T. The effect determination table T in this embodiment includes a challenge effect determination table Tx and a battle effect determination table Ty. The challenge effect determination table Tx is used to determine the challenge effect E(a to c), and the battle effect determination table Ty is used to determine the battle effect Ed. The challenge effect determination table Tx includes a challenge effect determination table Txa (FIG. 7(b)), a challenge effect determination table Txb (FIG. 8(a)), and a challenge effect determination table Txc (FIG. 8(b)). The challenge effect determination table Txa is used in a double win, the challenge effect determination table Txb is used in a triple win, and the challenge effect determination table Txc is used in a triple win.

[0074] FIG. 7(b) is a conceptual diagram of the challenge effect determination table Txa used in double wins. As shown in FIG. 7(b), the challenge effect determination table Txa is configured to include the number of winnings dna (0 to 2) and the challenge effects (Ea1, Ea2) corresponding to the number of winnings dna. For example, when the number of winnings dna is the value "0", the challenge effect Ea1 is determined. As described above, the probability that the number of winnings dna will be the value "0" in double wins is approximately "77%" (see FIG. 5(b)). Therefore, as shown in FIG. 7(b), the determination rate of the challenge effect Ea1 in double wins is approximately "77%".

[0075] In the challenge performance Ea1, only the first stage of the multiple stages of the challenge performance is executed. In the above challenge performance Ea1, it is notified that the second information Dx is not a winning entry. Specifically, in the first stage of the challenge performance, a first challenge image is displayed in which the ally character tries to jump over a pitfall. Also, in the challenge performance Ea1, after the first challenge image is displayed, a failure image is displayed in which the ally character falls into the pitfall. The above failure images are images for notifying that the second information Dx is not a winning entry. The above challenge performance Ea1 does not progress to the battle performance Ed.

[0076] As shown in FIG. 7(b), when the winning number dna is the value "1", the challenge performance Ea2 is determined. In the challenge performance Ea2 described above, the first stage of the multiple stages of the challenge performance is executed. Specifically, in the challenge performance Ea2, a first challenge image is displayed in which the ally character tries to jump over a pitfall (similar to the challenge performance Ea1), and then a success image is displayed in which the ally character successfully jumps over the pitfall.

[0077] As shown in FIG. 7(b), when the number of winning items dna is the value "1", the challenge presentation Ea2 progresses to the battle presentation Ed. In the above battle presentation Ed, a defeat image is displayed in which the friendly character is defeated by the enemy character, and the fact that the second information Dx is a non-winning item is notified. As described above, the probability that the number of winning items dna will be the value "1" in a double win is approximately "22%" (see FIG. 5(b)). Therefore, the decision rate of the announcement presentation E of "challenge presentation Ea2 + battle presentation Ed (defeat)" is approximately "22%". Note that, as will be described in detail later, the battle presentation Ed when the second information Dx is a non-winning item is determined by lottery from among the battle presentations Ed1 to Ed3 (see FIG. 9).

[0078] As shown in Fig. 7(b), when the number of winning points dna is the value "2" in the case of a double win, the challenge performance Ea2 is determined in the same way as when the number of winning points dna is the value "1". Also, when the number of winning points dna is the value "2", the challenge performance Ea2 progresses to a battle performance Ed. In the battle performance Ed when the number of winning points dna is the value "2", a victory image is displayed in which the ally character finally wins against the enemy character, and it is announced that the second information Dx is a win.

[0079] As can be understood from the above explanation, in the first stage of the challenge performance, there are cases where the first challenge image and a failure image are displayed, and cases where the first challenge image and a success image are displayed. Hereinafter, for the sake of explanation, displaying a series of images including the first challenge image and a failure image may be described as "executing the first stage failure performance." Also, displaying a series of images including the first challenge image and a success image may be described as "executing the first stage success performance."

[0080] As mentioned above, the probability that the winning number dna will be the number "2" in a double win is approximately "1.5%" (see FIG. 5(b)). Therefore, the probability of the announcement effect E of "challenge effect Ea2 + battle effect Ed (win)" being determined is approximately "1.5%". Note that, as will be described in detail later, when the second information Dx is a win, the battle effect Ed is determined by lottery from among battle effects Ed4 and Ed5 (see FIG. 9).

[0081] FIG. 7(b) shows the probability (breakthrough rate) that the first stage of the notification effect E will be successful in a double win. As described above, when the number of winning items dna is the value "1" (decision rate: approximately 22%), and when the number of winning items dna is the value "2" (decision rate: approximately 1.5%), the challenge effect Ea2 is determined, and the first stage of the notification effect E is successful. Therefore, the breakthrough rate of the first stage in a double win is approximately "23.5%".

[0082] Fig. 8(a) is a conceptual diagram of the challenge effect determination table Txb used in triple win. As shown in Fig. 8(a), the challenge effect determination table Txb is configured to include the number of winnings dnb (0 to 3) and the challenge effects (Ea1, Eb1, Eb2) corresponding to the number of winnings dnb, similar to the above-mentioned challenge effect determination table Txa (see Fig. 7(b)).

[0083] For example, when the number of winnings dnb is the value "0", the challenge effect Ea1 is determined in the same way as when the number of winnings dna is the value "0" in a double win. As mentioned above, the probability that the number of winnings dnb will be the value "0" in a triple win is approximately "67%" (see FIG. 6(a)). Therefore, as shown in FIG. 8(a), the determination rate of the challenge effect Ea1 in a triple win is approximately "67%".

[0084] As shown in FIG. 8(a), when the number of winnings dnb is the value "1" in a triple win, the challenge performance Eb1 is determined. In the challenge performance Eb1 described above, the first and second stages of each stage of the challenge performance are executed as shown in FIG. 8(a). Specifically, when the challenge performance Eb1 starts, the success performance of the first stage is executed, similar to the challenge performance Ea2 described above. After that, in the challenge performance Eb1, the second stage of the challenge performance is executed.

[0085] In the second stage of the challenge performance, a second challenge image is displayed in which an ally character tries to avoid a needle trap. In the challenge performance Eb1, after the second challenge image is displayed, a failure image is displayed in which an ally character collides with a needle trap. The above failure images are images to notify that the second information Dx is not a winning entry, and the challenge performance Eb1 does not progress to a battle performance Ed. As mentioned above, the probability that the number of winning entries dnb will be the number "1" in a triple win is approximately "29%" (see FIG. 6(a)). Therefore, as shown in FIG. 8(a), the success rate of the challenge performance Eb1 in a triple win is approximately "29%".

[0086] As shown in FIG. 8(a), when the number of winnings dnb is the number "2" in a triple win, the challenge performance Eb2 is determined. In the challenge performance Eb2 described above, as shown in FIG. 8(a), the first and second stages of the multiple stages of the challenge performance are executed. Specifically, in the challenge performance Eb2, similar to the challenge performance Eb1 and challenge performance Ea2 described above, the second challenge image is displayed after the success performance of the first stage is executed. Also, in the challenge performance Eb2, after the second challenge image is displayed, a success image is displayed in which the ally character avoids the needle trap.

[0087] As can be understood from the above explanation, in the second stage of the challenge performance, there are cases where the second challenge image and the failure image are displayed, and cases where the second challenge image and the success image are displayed. Hereinafter, for the sake of explanation, displaying a series of images including the second challenge image and the failure image may be described as "executing the second stage failure performance." Also, displaying a series of images including the second challenge image and the success image may be described as "executing the second stage success performance."

[0088] As shown in FIG. 8(a), when the number of winning pieces dnb is the value "2", the challenge presentation Eb2 progresses to the battle presentation Ed. In the above battle presentation Ed, similar to the case where the number of winning pieces dna is the value "1" in the above-mentioned double win, a defeat image is displayed in which the friendly character is ultimately defeated by the enemy character, and it is announced that the second information Dx is not a winning piece. As mentioned above, the probability that the number of winning pieces dnb will be the value "2" in a triple win is approximately "4%" (see FIG. 6(a)). Therefore, the probability of the announcement presentation E of "challenge presentation Eb2 + battle presentation Ed (defeat)" is approximately "4%".

[0089] As shown in FIG. 8(a), when the number of winning pieces dnb is the number "3" in a triple win, the challenge presentation Eb2 is determined in the same manner as when the number of winning pieces dnb is the number "2". Also, when the number of winning pieces dnb is the number "3", the challenge presentation Eb2 progresses to a battle presentation Ed. In the battle presentation Ed when the number of winning pieces dnb is the number "3", a victory image in which the friendly character finally wins against the enemy character is displayed, and it is announced that the second information Dx is a win. As described above, the probability that the number of winning pieces dnb will be the number "3" in a triple win is about "0.2%" (see FIG. 6(a)). Therefore, the decision rate of the announcement presentation E of "challenge presentation Eb2 + battle presentation Ed (win)" is about "0.2%".

[0090] FIG. 8(a) shows the probability (breakthrough rate) that the first stage of the challenge performance will be successful in a triple win. As described above, when the number of winning pieces dnb is the value "1" (decision rate "approximately 29%"), when the number of winning pieces dnb is the value "2" (decision rate "approximately 4%), and when the number of winning pieces dnb is the value "3" (decision rate "approximately 0.2%), the first stage of the challenge performance will be successful. Therefore, the breakthrough rate of the first stage of the challenge performance in a triple win is approximately "33.2%". In the above configuration, the breakthrough rate of the first stage of the challenge performance is higher in a triple win (breakthrough rate ≒ 33.2%) than in a double win (breakthrough rate ≒ 23.5%).

[0091] Fig. 8(b) is a conceptual diagram of the challenge effect determination table Txc used in quadruple wins. As shown in Fig. 8(b), the challenge effect determination table Txc includes the number of winnings dnc (0 to 4) and the challenge effects (Ea1, Eb1, Ec1, Ec2) corresponding to the number of winnings dnc, similar to the above-mentioned challenge effect determination table Txa (see Fig. 7(b)) and challenge effect determination table Txb (see Fig. 8(a)).

[0092] For example, when the number of winnings dnc is the value "0", the challenge effect Ea1 is determined in the same way as when the number of winnings dn (a, b) is the value "0" for other multiple win types Rt (double win, triple win). As mentioned above, the probability that the number of winnings dnc will be the value "0" in a quadruple win is approximately "59%" (see FIG. 6(d)). Therefore, as shown in FIG. 8(c), the determination rate of the challenge effect Ea1 in a quadruple win is approximately "59%".

[0093] As shown in FIG. 8(b), when the number of winnings dnc is the value "1" in a quadruple win, the challenge effect Eb1 is determined, similar to when the number of winnings dnb is the value "1" in a triple win. As mentioned above, the probability that the number of winnings dnc will be the value "1" in a quadruple win is approximately "33%" (see FIG. 6(d)). Therefore, as shown in FIG. 8(b), the determination rate of the challenge effect Eb1 in a quadruple win is approximately "33%".

[0094] As shown in FIG. 8(b), when the number of winnings dnc is "2" in a quadruple win, the challenge performance Ec1 is determined. In the challenge performance Ec1 described above, the first to third stages of the multiple stages of the challenge performance are executed. Specifically, when the challenge performance Ec1 starts, the first stage success performance is executed, and then the second stage success performance is executed, and then it progresses to the third stage of the challenge performance.

[0095] In the third stage of the challenge performance, a third challenge image is displayed in which an ally character tries to avoid a pendulum trap. In the challenge performance Ec1, after the third challenge image is displayed, a failure image is displayed in which an ally character collides with the pendulum trap. The above failure images are images to notify that the second information Dx is not a winning combination, and the challenge performance Ec1 does not progress to a battle performance Ed. As mentioned above, the probability that the number of winning combinations dnc will be the number "2" in a quadruple win is approximately "7%" (see FIG. 6(d)). Therefore, as shown in FIG. 8(b), the success rate of the challenge performance Ec1 in a quadruple win is approximately "7%".

[0096] As shown in FIG. 8(b), when the number of winnings dnc is "3" in a quadruple win, the challenge performance Ec2 is determined. When the challenge performance Ec2 starts, the first stage success performance is executed, followed by the second stage success performance, and then the challenge performance progresses to the third stage. In the challenge performance Ec2, the third challenge image is displayed, followed by a success image of avoiding the pendulum trap.

[0097] As shown in FIG. 8(b), when the number of winning pieces dnc is the value "3", the challenge presentation Ec2 progresses to the battle presentation Ed. In the above battle presentation Ed, a defeat image is displayed and a notice is issued that the second information Dx is not a winning piece, similar to the case where the number of winning pieces dna is the value "1" in the above-mentioned double win or the number of winning pieces dnb is the value "2" in the above-mentioned triple win (when only one of the selection information nx is not a winning piece). As described above, the probability that the number of winning pieces dnc will be the value "3" in a quadruple win is approximately "0.6%" (see FIG. 6(d)). Therefore, the decision rate of the announcement presentation E of "challenge presentation Ec2 + battle presentation Ed (defeat)" is approximately "0.6%".

[0098] As shown in FIG. 8(b), when the number of winning pieces dnc is the value "4" in a quadruple win, the challenge presentation Ec2 is determined in the same manner as when the number of winning pieces dnc is the value "3". Also, when the number of winning pieces dnc is the value "4", the challenge presentation Ec2 progresses to the battle presentation Ed. When the number of winning pieces dnc is the value "4" (when all the selection information nx is a win), the battle presentation Ed displays a victory image and notifies the user that the second information Dx is a win. As described above, the probability that the number of winning pieces dnc will be the value "4" in a quadruple win is approximately "0.02%" (see FIG. 6(d)). Therefore, the decision rate of the notification presentation E of "challenge presentation Ec2 + battle presentation Ed (win)" is approximately "0.02%".

[0099] FIG. 8(b) shows the probability (breakthrough rate) that the first stage of the challenge performance will be successful in a quadruple win. As mentioned above, the first stage of the challenge performance will be successful when the number of winning pieces dnc is the value "1" (decision rate: about 33%), when the number of winning pieces dnc is the value "2" (decision rate: about 7%), when the number of winning pieces dnc is the value "3" (decision rate: about 0.6%), and when the number of winning pieces dnc is the value "4" (decision rate: about 0.02%). Therefore, the breakthrough rate of the first stage of the challenge performance in a quadruple win is about "40.62%".

[0100] As can be understood from the above explanation, in this embodiment, the breakthrough rate of the first stage of the challenge performance is higher in the case of a triple win (breakthrough rate ≒ 33.2%) than in the case of a double win (breakthrough rate ≒ 23.5%), and the breakthrough rate of the first stage of the challenge performance is higher in the case of a quadruple win (breakthrough rate ≒ 40.62%) than in the case of a triple win. This embodiment has the advantage that it is easier to maintain a sense of expectation that the second information Dx of a quadruple win, which has the lowest probability of winning, may have won for a long period of time.

[0101] FIG. 9 is a diagram for explaining the battle performance Ed. As described above, in the notification performance E when all the selection information nx are winning or when only one selection information nx is not winning, the challenge performance E (a, b, c) develops into the battle performance Ed. In addition, the battle performance Ed of this embodiment includes the battle performance Ed1 to the battle performance Ed5. The battle performance Ed1, the battle performance Ed2, and the battle performance Ed3 are determined when the second information Dx is not winning. In addition, the battle performance Ed4 and the battle performance Ed5 are determined when the second information Dx is winning.

[0102] FIG. 9(a) is a diagram for explaining the patterns of each performance (avoiding enemy attacks, weak ally attacks, and strong ally attacks) executed in the battle performance Ed. In the battle performance Ed, a moving image of an ally character facing off against an enemy character is displayed. Specifically, when the battle performance Ed starts, an enemy attack image, which is a moving image of an enemy character attacking an ally character, is displayed regardless of the type of the battle performance Ed. After that, for example, in the battle performance Ed1, an avoidance failure image is displayed, which shows an ally character that has failed to avoid the attack of the enemy character. The above avoidance failure image is an image for notifying that the second information Dx is not a winning entry.

[0103] On the other hand, in battle performances Ed(2-5) other than battle performance Ed1, an enemy attack image is displayed, and then an evasion image is displayed, which represents an ally character evading an attack by an enemy character. In battle performances Ed(2-5), an evasion image is displayed, and then a counterattack image is displayed, which represents an ally character making a counterattack. The above counterattack images include a strong attack image, which represents an ally character making a strong attack, and a weak attack image, which represents an ally character making a weak attack. In this embodiment, the counterattack image displayed differs depending on the type of battle performance Ed(2-5).

[0104] For example, in the battle performance Ed2, an evasion image is displayed, followed by a weak attack image. Then, in the battle performance Ed2, a defeat image is displayed in which the enemy character evades the weak attack of the ally character and the ally character is defeated. The defeat image described above is an image for notifying that the second information Dx is not a winning entry. Also, in the battle performance Ed3, an evasion image is displayed, followed by a strong attack image. Then, in the battle performance Ed3, a defeat image is displayed in which the enemy character evades the strong attack of the ally character and the ally character is defeated.

[0105] In battle performance Ed4, after an evasion image is displayed, a weak attack image is displayed in the same manner as in the above-mentioned battle performance Ed2. Then, in battle performance Ed4, a victory image is displayed in which the ally character's weak attack hits the enemy character and the ally character wins. The above victory image is an image for notifying that the second information Dx has been selected. Also, in battle performance Ed5, after an evasion image is displayed, a strong attack image is displayed in the same manner as in the above-mentioned battle performance Ed3. Then, in battle performance Ed5, a victory image is displayed in which the ally character's strong attack hits the enemy character and the ally character wins.

[0106] 9(b) to 9(d) are diagrams for explaining specific examples of the battle performance determination table Ty(a, b, c). When executing a notification performance E that develops into a battle performance Ed, the information processing device 10 determines the type of the battle performance Ed by lottery using the battle performance determination table Ty.

[0107] The battle performance determination table Ty includes a battle performance determination table Tya, a battle performance determination table Tyb, and a battle performance determination table Tyc. The battle performance determination table Tya is used when the multiple win type Rt is a double win. The battle performance determination table Tyb is used when the multiple win type Rt is a triple win, and the battle performance determination table Tyc is used when the multiple win type Rt is a quadruple win. Although the details will be described later, by switching the battle performance determination table Ty according to the multiple win type Rt, the expectation of the second information Dx winning when each performance (avoidance of enemy attacks, weak attacks by allies, and strong attacks by allies) in the battle performance Ed is executed becomes approximately the same regardless of the multiple win type Rt.

[0108] FIG. 9(b) is a conceptual diagram of the battle performance determination table Tya used when the multiple win type Rt is double win. As shown in FIG. 9(b), the battle performance determination table Tya specifies the lottery rate for each battle performance Ed (1-5). Specifically, when the second information Dx is not a winning combination, the battle performance Ed1 is determined with a probability of about 70%, the battle performance Ed2 is determined with a probability of about 28%, and the battle performance Ed3 is determined with a probability of about 2%. Also, when the second information Dx is a winning combination, the battle performance Ed4 is determined with a probability of about 50%, and the battle performance Ed5 is determined with a probability of about 50%.

[0109] As described above, in the case of a double win, the probability that the second information Dx is a non-winning item and the battle performance Ed is executed (probability that the number of winning items dna = 1) is approximately 22% (see Figure 7(b)). Also, in the case of a double win, the probability that the second information Dx is a winning item and the battle performance Ed is executed (probability that the number of winning items dna = 2) is approximately 1.5% (see the same figure). Therefore, among the cases in which the battle performance Ed is executed in a double win, the proportion in which the second information Dx is a non-winning item (hereinafter referred to as the "loss proportion") is approximately 93%, and the proportion in which the second information Dx is a winning item (hereinafter referred to as the "win proportion") is approximately 7%.

[0110] FIG. 9(c) is a conceptual diagram of the battle performance determination table Tyb used when the multiple win type Rt is a triple win. As shown in FIG. 9(c), the battle performance determination table Tyb specifies the lottery rate for each battle performance Ed (1-5). Specifically, when the second information Dx is not a winning combination, the battle performance Ed1 is determined with a probability of about 80%, the battle performance Ed2 is determined with a probability of about 19%, and the battle performance Ed3 is determined with a probability of about 1%. Also, when the second information Dx is a winning combination, the battle performance Ed4 is determined with a probability of about 50%, and the battle performance Ed5 is determined with a probability of about 50%.

[0111] As described above, in the case of a triple win, the probability that the second information Dx is a non-winning combination and the battle performance Ed is executed (probability that the number of winning combinations dnb = 2) is approximately 4% (see FIG. 8(a)). Also, in the case of a triple win, the probability that the second information Dx is a winning combination and the battle performance Ed is executed (probability that the number of winning combinations dnb = 3) is approximately 0.2% (see FIG. 8(a)). Therefore, the win rate in the case of a triple win is 5%, and the loss rate is 95%. In other words, the win rate in the case of a double win (7%) is different from the win rate in the case of a triple win (5%). Similarly, the loss rate in the case of a double win (93%) is different from the loss rate in the case of a triple win (95%).

[0112] FIG. 9(d) is a conceptual diagram of the battle performance determination table Tyc used when the multiple win type Rt is a quadruple win. As shown in FIG. 9(d), the battle performance determination table Tyc specifies the lottery rate of each battle performance Ed (1 to 5). Specifically, when the second information Dx is not a winning combination, the battle performance Ed1 is determined with a probability of about 85%, the battle performance Ed2 is determined with a probability of about 14%, and the battle performance Ed3 is determined with a probability of about 0.7%. Also, when the second information Dx is a winning combination, the battle performance Ed4 is determined with a probability of about 50%, and the battle performance Ed5 is determined with a probability of about 50%.

[0113] As described above, in the case of a quadruple win, the probability that the second information Dx is not a winning combination and the battle performance Ed is executed (the probability that the number of winning combinations dnc = 3) is approximately 0.6% (see FIG. 8(b)). Also, in the case of a quadruple win, the probability that the second information Dx is a winning combination and the battle performance Ed is executed (the probability that the number of winning combinations dnc = 4) is approximately 0.02% (see FIG. 8(b)). Therefore, the winning ratio in the case of a quadruple win is 3%, and the losing ratio is 97%. As can be understood from the above explanation, the winning ratio in the case of a double win (7%), the winning ratio in the case of a triple win (5%), and the winning ratio in the case of a quadruple win (3%) are different. Similarly, the losing ratio in the case of a double win (93%), the losing ratio in the case of a triple win (95%), and the losing ratio in the case of a quadruple win (97%) are different.

[0114] Incidentally, the expectation of the second information Dx being a winning result when an evasion effect in which an ally character avoids an enemy character's attack is executed varies according to the drawing rate, winning percentage, and losing percentage of each battle effect Ed defined in the battle effect determination table Tt. Similarly, the expectation of a weak attack effect in which an ally character performs a weak attack and the expectation of a strong attack effect in which an ally character performs a strong attack are calculated from the drawing rate, winning percentage, and losing percentage of each battle effect Ed. Also, the winning percentage and losing percentage vary according to the multiple win type Rt (double win, triple win, quadruple win).

[0115] As can be understood from the above explanation, if a common battle performance determination table Ty is used regardless of the multiple win type Rt, and the lottery rate of each battle performance Ed is common regardless of the multiple win type Rt (hereinafter referred to as "comparison ratio"), the expectation level of each performance (avoidance performance, weak attack performance, strong attack performance) changes according to the multiple win type Rt. However, in the comparison ratio in which the expectation level of each performance changes according to the multiple win type Rt, some users may have the inconvenience of misunderstanding the expectation level of each performance.

[0116] In consideration of the above circumstances, in this embodiment, the lottery rate of each battle performance Ed is changed according to the multiple win type Rt so that the expected value of each performance is approximately the same regardless of the multiple win type Rt. Specifically, a battle performance determination table Yy (a, b, c) that differs for each multiple win type Rt is provided.

[0117] FIG. 9(e) shows the expected value of the second information Dx winning when each effect (avoidance effect, weak attack effect, strong attack effect) is executed for each multiple win type Rt. As shown in FIG. 9(e), in this embodiment, the expected value of the avoidance effect is approximately 19%, which is almost the same regardless of the multiple win type Rt. Also, the expected value of the weak attack effect is approximately 11%, which is the same regardless of the multiple win type Rt. Similarly, the expected value of the strong attack effect is approximately 70%, which is the same regardless of the multiple win type Rt. According to the above embodiment, there is an advantage that the above-mentioned inconveniences are suppressed, for example, compared to the above-mentioned comparison.

[0118] Fig. 10(a) is a diagram for explaining specific examples of each image displayed at each point in time of the notification performance E. Fig. 10(a) shows the period during which the notification performance E is executed, as well as an image (acceptance image) displayed immediately before the notification performance E is executed, and an image (end image, winning image) displayed immediately after the notification performance E ends (the same applies to Fig. 10(b) described later).

[0119] In the specific example of Fig. 10(a), it is assumed that a challenge performance Ea1 is executed as the notification performance E. Specifically, when the information processing device 10 (operation unit 17) is appropriately operated, a reception image (see Fig. 13 described later) is displayed on the display unit 16. The information processing device 10 is capable of accepting an execution operation for starting the notification performance E during the period in which the reception image is displayed. In the specific example of Fig. 10(a), it is assumed that the execution operation is accepted at time ta1.

[0120] When the challenge performance Ea1 (notification performance E) starts, the first challenge image is displayed as described above. The first challenge image is a moving image of an ally character attempting to jump over a pitfall. As shown in FIG. 10(a), the button image starts to be displayed from time ta2, a predetermined time after the first challenge image is displayed. From time ta2 onwards, the button image is displayed in front of the still image of the last scene of the first challenge image (the image of the ally character above the pitfall).

[0121] During the period when the button image is displayed, if the button image is touched, the first challenge image is switched to a failure image or a success image. Specifically, if the second stage or later of the notification performance E is executed (if a performance other than challenge performance Ea1 is selected), a success image is displayed when the button image is touched, and each image from the second stage onwards (the second challenge image or the image of the battle performance) is displayed. On the other hand, if the notification performance E ends at the first stage (if challenge performance Ea1 is selected), a failure image is displayed when the button image is touched, and then an end image is displayed.

[0122] In the specific example of FIG. 10(a), it is assumed that the button image is touched at time ta3. In the above case, a failure image is displayed after time ta3. In this embodiment, the failure image is displayed for a predetermined time (for example, about 3 seconds), and then an end image is displayed in place of the failure image. The end image displays a message that the second information Dx was not a winning entry. The end image also displays the remaining charge amount that can be used to purchase new second information Dx, and a repurchase button image. When the repurchase button image is touched, an image that allows the purchase of new second information Dx is displayed.

[0123] As described above, in the case of a triple win or quadruple win, the second stage and subsequent stages of the challenge performance may be executed. In the second stage of the challenge performance, as in the first stage, the second challenge image is displayed, and then the button image is displayed. Also, when the button image is touched, each image in the third stage and subsequent stages is displayed. Similarly, in the third stage of the challenge performance, the third challenge image is displayed, and then the button image is displayed. Also, when the button image is touched, each image in the battle performance is displayed. If the second information Dx is a non-win, the above-mentioned end image is commonly displayed after the notification performance E ends.

[0124] Fig. 10(b) is a diagram for explaining other specific examples of each image displayed at each time point of the notification effect E. Fig. 10(b) assumes a case where the second information Dx of a double win is won and the combination of "challenge effect Ea2, battle effect Ed5" is determined as the notification effect E. In the above case, when an execution operation is accepted during the period in which the reception image is displayed, the challenge effect Ea2 starts. In the specific example of Fig. 10(b), a case where an execution operation is accepted at time point tb1 is assumed.

[0125] When the challenge performance Ea2 starts, the first challenge image is displayed in the same manner as when the challenge performance Ea1 starts (see FIG. 10(a) above). In addition, the button image is displayed from time tb2, a predetermined time after the first challenge image starts to be displayed. In the specific example of FIG. 10(b), it is assumed that the button image is touched at time tb3 after the button image is displayed. In the above cases, after the button image is touched, a success image is displayed. The success image in the challenge performance is displayed for a predetermined time (e.g., 3 seconds), and then switches to the image of the next stage in the notification performance E.

[0126] When the challenge performance Ea2 ends, it progresses to a battle performance Ed. As described above, the specific example of FIG. 10(b) assumes that the second information Dx is selected. In the above cases, after the challenge performance Ea2 ends, it progresses to a battle performance Ed4 or a battle performance Ed5 among the battle performances Ed(1-5). In the specific example of FIG. 10(b), it is assumed that each battle performance Ed progresses to a battle performance Ed5.

[0127] As described above, when the battle performance Ed starts, an enemy attack image is displayed regardless of the type of the battle performance Ed. As shown in FIG. 10(b), the button image starts to be displayed at time tb4, when a predetermined time has elapsed since the enemy attack image was displayed. After time tb4, the button image is displayed in front of a still image of the last scene of the enemy attack image (an image of an ally character trying to avoid the attack of the enemy character).

[0128] In the battle performance Ed (2-5) in which the above-mentioned evasion performance is executed (see FIG. 9(a)), when the button image displayed on the enemy attack image is touched, the enemy attack image is switched to an evasion image. In the specific example of FIG. 10(b), it is assumed that the button image is touched at time tb5 in battle performance Ed5. In the above case, the evasion image is displayed from time tb5.

[0129] The evasion image is displayed for a predetermined time (for example, 2 seconds), and then switches to a counterattack image. If the battle performance Ed1 (no evasion performance) is selected from the battle performances Ed, when the button image displayed on the enemy attack image is touched, the counterattack image switches to a failed evasion image, and then a defeat image is displayed. In addition, after a predetermined time (for example, 2 seconds), the defeat image switches to the above-mentioned end image.

[0130] As described above, the counterattack images include weak attack images (battle performances Ed2, Ed4) and strong attack images (battle performances Ed3, Ed5) (see FIG. 9(a)). As shown in FIG. 10(b), in battle performance Ed5, a strong attack image is displayed. When a predetermined time (e.g., 2 seconds) has elapsed since the counterattack image (weak attack image, strong attack image) was displayed, a button image is displayed in front of the last scene (still image) of the counterattack image. In addition, when the button image displayed in the counterattack image is touched, a victory image or defeat image is displayed depending on the type of battle performance Ed.

[0131] For example, in the battle performance Ed5 shown in Fig. 10(b), when the button image displayed in the strong counterattack image is touched (time tb7), a victory image is displayed instead of the strong attack image. Similarly, in the battle performance Ed4, a button image is displayed in the weak counterattack image, and when the button image is touched, a victory image is displayed instead of the weak attack image. The above victory image is displayed for a predetermined time (for example, 2 seconds), and then a winning image is displayed.

[0132] The winning image displays the winning second information Dx (array of selected information nx) and a winning money handling button. When the winning money handling button is touched, a settlement processing image and a charge processing image are displayed. When the settlement processing image is touched, various operations for transferring the winning money to the user's bank account become possible. On the other hand, when the charge processing image is touched, the winning money is added to the amount that can be used to grant new second information Dx.

[0133] On the other hand, for example, in the battle performance Ed2 selected when the second information Dx is not a winning combination, a button image is displayed in the weak counterattack image, and when the button image is touched, a defeat image is displayed instead of the weak attack image. Also, in the battle performance Ed3, a button image is displayed in the strong counterattack image, and when the button image is touched, a defeat image is displayed instead of the strong attack image. The defeat images above are displayed for a predetermined time (for example, 2 seconds), and then the above-mentioned end image is displayed.

[0134] As described above, in this embodiment, when the button image is touched, a notification is given as to whether or not the notification performance E will progress to the next stage. The above configuration has the advantage that the notification can be executed at a timing desired by the user. Note that, in this embodiment, if the button image is not touched, the notification performance E does not progress to the next stage. However, for example, if a predetermined time (e.g., 30 seconds) has elapsed since the button image was displayed, the notification performance may progress to the next stage.

[0135] Furthermore, the information processing device 10 of this embodiment receives each piece of information (e.g., an unconfirmed list described later) required until the notification performance E ends at the time when the reception image is displayed. That is, before the notification performance E starts, each piece of information required until the notification performance E ends is received by the information processing device 10. Therefore, even if the information processing device 10 becomes unable to communicate with the control device 20 in the middle of the notification performance E, there is an advantage that the notification performance E can be executed to the end.

[0136] As described above, in this embodiment, multiple pieces of second information Dx can be given to a user at one time. When multiple pieces of second information Dx are given, if any one of the pieces of second information Dx wins, the winning amount is given to the user.

[0137] 11 is a specific example in which multiple pieces of second information Dx are provided. When multiple pieces of second information Dx are provided, the information processing device 10 acquires all pieces of second information Dx that do not notify the result (win, no win) from the control device 20 when determining the notification performance E. Specifically, the information processing device 10 acquires an unconfirmed list made up of the second information Dx that does not notify the result from the control device 20.

[0138] Furthermore, in this embodiment, during the period in which the reception image is displayed, an execution operation of the notification performance E can be accepted. The above execution operations include a first execution operation (a touch operation of B3 in FIG. 13 described later) and a second execution operation (a touch operation of B1 or B2 in the same figure). The first execution operation is an operation to execute the notification performance E that notifies the result of one piece of second information Dx out of the multiple pieces of second information Dx. The second execution operation is an operation to execute the notification performance E that notifies the results of the multiple pieces of second information Dx collectively.

[0139] Although the details will be described below, the information processing device 10 of this embodiment assigns an execution number to the second information Dx according to the selection information nx (1 to 8) of the second information Dx. For example, when the first execution operation is accepted, a notification performance E is executed to notify the result of the second information Dx having the earliest execution number among the multiple pieces of second information Dx. The above execution numbers are determined by a sorting process described later.

[0140] In the specific example of Fig. 11, it is assumed that four pieces of second information Dx with a multiple win classification Rt of double win are assigned. Specifically, it is assumed that the second information Dxa1 "7(nx1), 8(nx1)" is assigned first among the second information Dx, followed by the second information Dxa2 "1(nx1), 7(nx1)", the second information Dxa3 "8(nx1), 6(nx1)", and the second information Dxa4 "1(nx1), 2(nx1)".

[0141] As described above, in the sorting process of this embodiment, a run number is assigned to the second information Dx according to the selection information nx of the second information Dx. Specifically, the smaller the selection information nx1 of the second information Dx, the earlier the run number is assigned. In addition, in each piece of second information Dx with the same selection information nx1, the smaller the selection information nx2 of the second information Dx, the earlier the run number is assigned. Similarly, in each piece of second information Dx with the same selection information nx1 and selection information nx2, the smaller the selection information nx3 of the second information Dx, the earlier the run number is assigned. In each piece of second information Dx with the same selection information nx1 to selection information nx3, the smaller the selection information nx4 of the second information Dx, the earlier the run number is assigned.

[0142] For example, in the specific example of FIG. 11, among the multiple pieces of second information Dxa (1 to 4), the selection information nx1 of the second information Dxa2 and the second information Dxa4 is the smallest, being the numerical value "1". Furthermore, the selection information nx2 (numerical value "2") of the second information Dxa4 is smaller than the selection information nx2 (numerical value "7") of the second information Dxa2. Therefore, the second information Dxa4 is given the run number "1", and the second information Dxa2 is given the run number "2". Furthermore, among the remaining pieces of second information Dxa1 and Dxa3, the selection information nx1 (numerical value "7") of the second information Dxa1 is smaller than the selection information nx1 (numerical value "8") of the second information Dxa3. Therefore, the second information Dxa1 is given the run number "3", and the second information Dxa3 is given the run number "4".

[0143] By the way, the car numbers (1 to 8) of each racer in an auto race are given according to the racer's winning percentage in past races. Specifically, the higher the racer's winning percentage in the past, the higher the car number they are given. Therefore, the higher the car number (1 to 8) the more likely the racer is to come in first.

[0144] For the above reasons, the second information Dx composed of larger selection information nx is more likely to have a larger number of winning items dn, and the probability of winning is higher. According to the sorting process of this embodiment, the second information Dx composed of larger selection information nx is assigned a later execution number. In other words, the second information Dx with a larger number of winning items dn is more likely to have a later execution number for the notification performance E. The above configuration can also be said as the notification performance E with higher expectation (announcement performance in which the challenge performance continues to multiple stages) is more likely to have a later execution number.

[0145] According to the above configuration, for example, when the results of multiple pieces of second information Dx are confirmed one by one (by the first execution operation), a presentation with high expectations is likely to be executed in the notification presentation E at the end. Immediately after the notification presentation E with high expectations is executed, some users tend to be more motivated to purchase new second information Dx. Therefore, according to the above-mentioned embodiment, there is an advantage that it becomes easier for users to purchase new second information Dx after all the notification presentations E have been executed.

[0146] 12(a) is a diagram for explaining the notification effect E executed when the second execution operation is accepted in the acceptance image. As described above, when the second execution operation is accepted, the notification effect E notifies whether the winning second information Dx is included in the plurality of second information Dx.

[0147] As described above, when the information processing device 10 receives a plurality of pieces of second information Dx, it determines the execution number of each of the pieces of second information Dx (see FIG. 11 described above). Furthermore, when the information processing device 10 receives a plurality of pieces of second information Dx, it determines each notification effect E of each piece of second information Dx. Furthermore, the information processing device 10 determines the priority of the second information Dx based on each notification effect E of each piece of second information Dx.

[0148] Specifically, the second information Dx that determines the notification effect E including an effect with a higher expectation level (battle effect (evasion, strong attack)) is given a higher priority. For example, when the multiple win type Rt is a double win, the expectation level of each effect of the notification effect E increases in the order of "Ea1", "Ea2+Ed1", "Ea2+Ed2", "Ea2+Ed3", "Ea2+Ed4", and "Ea2+Ed5". Therefore, the priority of the second information Dx in a double win is the lowest, with the value "1" being the second information Dxa that determines the notification effect Ea1, as shown in FIG. 12(a).

[0149] In addition, when the multiple win type Rt is double win, the priority of the second information Dx in which the notification performance "Ea2+Ed1" is determined becomes the numerical value "2." Similarly, the priority of the second information Dx in which "Ea2+Ed2" is determined becomes the numerical value "3," the priority of the second information Dx in which "Ea2+Ed3" is determined becomes the numerical value "4," the priority of the second information Dx in which "Ea2+Ed4" is determined becomes the numerical value "5," and the priority of the second information Dx in which "Ea2+Ed5" is determined becomes the numerical value "6."

[0150] As shown in Fig. 12(a), when the multiple win type Rt is triple win, similar to the case of double win, any of the priorities "1" to "7" is determined as the priority of the second information Dx according to the notification effect E. Also, when the multiple win type Rt is quadruple win, similar to the case of other multiple win types Rt, as shown in Fig. 12(a), any of the priorities "1" to "8" is determined as the priority of the second information Dx according to the notification effect E.

[0151] In this embodiment, the notification effect E when the second information Dx is a winning item includes either a battle effect Ed4 or a battle effect Ed5 (hereinafter, "victory battle effect"). The priority of the notification effect E including the victory battle effect is always higher than the priority of other notification effects E. Therefore, when the winning second information Dx is included in each of the second information Dx whose results are reported collectively, the victory battle effect is always executed.

[0152] FIG. 12(b) is a diagram for explaining a specific example of the notification effect E executed in response to the execution operation (first execution operation, second execution operation). In the specific example of FIG. 12(b), as in the specific example of FIG. 11 described above, it is assumed that the second information Dxa1 (7(nx1), 8(nx2)), the second information Dxa2 (1(nx1), 7(nx2)), the second information Dxa3 (8(nx1), 6(nx2)), and the second information Dxa4 (1(nx1), 2(nx2)) are given. In the above case, as shown in FIG. 12(b), the execution number of the second information Dxa1 is the number "3", the execution number of the second information Dxa2 is the number "2", the execution number of the second information Dxa3 is the number "4", and the execution number of the second information Dxa4 is the number "1".

[0153] In the specific example of Fig. 12(b), it is assumed that "Ea2+Ed2" is determined as the notification effect E of the second information Dxa1, "Ea1" is determined as the notification effect E of the second information Dxa2, "Ea2+Ed1" is determined as the notification effect E of the second information Dxa3, and "Ea1" is determined as the notification effect E of the second information Dxa4. In the above case, as shown in Fig. 12(b), the priority of the second information Dxa1 is the numerical value "3", the priority of the second information Dxa2 is the numerical value "1", the priority of the second information Dxa3 is the numerical value "2", and the priority of the second information Dxa4 is the numerical value "1".

[0154] In the specific example of FIG. 12(b) above, when the first execution operation (checking one by one) is executed, the notification effect "Ea1" is executed to notify the result of the second information Dxa4 with execution number "1". When the information processing device 10 notifies the result of the second information Dx, it deletes the second information Dx from the unconfirmed list. In addition, when the next first execution operation is executed after the notification effect E is executed by the first execution operation, the notification effect E of the second information Dx with the earliest execution number among the remaining second information Dx is executed. For example, when the first execution operation is executed again after the notification effect Ea1 of the second information Dxa4 with execution number "1" is executed, the notification effect Ea1 of the second information Dax2 with execution number "2" is executed.

[0155] In the specific example of FIG. 12(b), when the second execution operation (check all at once) is performed, a notification effect "Ea2+Ed2" is executed to notify the result of the second information Dxa1, which has the highest priority of "3". When the results of multiple pieces of second information Dx are notified at once, the multiple pieces of second information Dx are deleted from the unconfirmed list. In the above configuration, when the results of multiple pieces of second information Dx are notified at once, only the notification effect E with the highest expectation among the notification effects E determined by the information processing device 10 is executed.

[0156] In this embodiment, after the results of some of the second information Dx are notified by the first execution operation, the results of the remaining second information Dx can be notified collectively by the second execution operation. For example, in the specific example of FIG. 12(b), assume that the first execution operation is accepted first, and the notification effect Ea1 is executed to notify the result of the second information Dxa4 with execution number "1". In the above case, when the second execution operation is accepted thereafter, the notification effect E of the second information Dxa1 with the highest priority among the remaining second information Dxa (1, 2, 3) is executed.

[0157] Fig. 13(a) is a schematic diagram of a reception image. As described above, the reception image is an image for receiving an execution operation (first execution operation, second execution operation) for executing the notification performance E. As shown in Fig. 13(a), the reception image displays the remaining number of pieces of second information Dx included in the unconfirmed list received from the control device 20. In the specific example of Fig. 13(a), it is assumed that there are 20 pieces of second information Dx in the unconfirmed list. When the notification performance E is executed and the second information Dx is deleted from the unconfirmed list, the remaining number of pieces of second information Dx in the reception image is subtracted.

[0158] 13(a), the reception image includes a button image B1, a button image B2, and a button image B3. When the button image B1 is touched, one notification effect E is executed to collectively notify the results of all the second information Dx included in the unconfirmed list. When the button image B2 is touched, one notification effect E is executed to collectively display the results of the 10 pieces of second information Dx with the smallest execution numbers among the pieces of second information Dx included in the unconfirmed list.

[0159] As can be understood from the above description, the touch operation of the button image B1 and the touch operation of the button image B2 are specific examples of the above-mentioned second execution operation. On the other hand, when the button image B3 is touched, a notification effect E is executed to notify the result of the second information Dx with the smallest execution number among the second information Dx included in the unconfirmed list. In other words, the touch operation of the button image B3 is a specific example of the above-mentioned first execution operation.

[0160] As shown in Fig. 13(a), the reception image includes a charge amount display image Gc and a payout amount display image Gr. The charge amount display image Gc displays the current charge amount, and the payout amount display image Gr displays the total amount of payouts (winnings). The information processing device 10 is configured to be able to switch to either a display mode or a non-display mode.

[0161] In the display mode, the total amount of the refund is displayed in the refund amount display image Gr. The specific example in FIG. 13(a) assumes that the information processing device 10 is in the display mode. On the other hand, in the non-display mode, the total amount of the refund is not displayed in the refund amount display image Gr. FIG. 13(b) shows a specific example of a reception image in the non-display mode. When the refund amount display image Gr is touched in the display mode, the mode transitions to the non-display mode, and when the refund amount display image Gr is touched in the non-display mode, the mode transitions to the display mode.

[0162] Assume that the total amount of payouts is always displayed in the payout display image Gr. Also, assume that the payout displayed by the payout display image Gr is updated before the notification performance E is executed. In the above configuration, the win / loss of the second information Dx may be guessed from the payout displayed by the payout display image Gr before the notification performance E is executed. Also, assume that the payout displayed by the payout display image Gr is updated after the notification performance E is executed. Even in the above configuration, if the payout displayed by the payout display image Gr is "0 yen", some users may mistakenly think that all the second information Dx is a non-win, even though the notification performance E has not been executed. According to the present embodiment, the total amount of payouts in the payout display image Gr can be hidden, which has the advantage of suppressing the above inconveniences.

[0163] In addition, in this modified example, it is preferable that the information processing device 10 is controlled in principle to the non-display mode. As the above configuration, it is possible to consider a configuration in which the information processing device 10 is controlled to the non-display mode immediately after the application program PG is executed. Also, it is preferable that the information processing device 10 is controlled to the non-display mode even if the execution of the application program PG is stopped during the display mode and then the execution of the application program PG is resumed.

[0164] In the above modified example, the payout may be added to the display amount of the payout display image Gr at the time when the winning of the purchased second information Dx is confirmed, regardless of whether the notification effect E is executed. According to the above configuration, the winning or losing of the second information Dx can be confirmed by switching the information processing device 10 to the display mode without executing the notification effect E. Therefore, there is an advantage that the winning or losing of the second information Dx can be confirmed at any timing in a short period of time, improving convenience for the user.

[0165] 14 is a flowchart of the reception process. The information processing device 10 starts the reception process, for example, when a reception image is displayed.

[0166] 14, when the reception process is started, the information processing device 10 determines whether or not a touch operation on a button image B (1 to 3) has been received (S101). The information processing device 10 repeatedly executes step S101 until it determines that the touch operation has been received (S101: No), and if the touch operation has been received (S101: Yes), executes an acquisition process (S102).

[0167] In the acquisition process, the information processing device 10 acquires the second information Dx and the first information Dy from the control device 20. Specifically, in the acquisition process, various pieces of information including the first information Dy and an unconfirmed list including the second information Dx whose results have not been confirmed are received by the information processing device 10. After executing the acquisition process, the information processing device 10 executes a sorting process (S103).

[0168] In the sorting process, as described above in FIG. 11, an execution number is assigned to each piece of second information Dx in the unconfirmed list. After executing the sorting process, the information processing device 10 executes a determination process (S104). In the determination process, the result information ny of the first information Dy is compared with the selection information nx of the second information Dx in the unconfirmed list, and the number of winning pieces dn of each piece of second information Dx is specified. In addition, based on the number of winning pieces dn of the second information Dx, the notification effect E of the second information Dx is determined. That is, in the determination process, the stage of the notification effect E is determined. As described above in FIG. 12(a), the information processing device 10 determines the priority of the second information Dx based on the notification effect E of the second information Dx.

[0169] After executing the determination process, the information processing device 10 determines whether or not the button image B3 of each button image B (1 to 3) has been touched (S105). If the button image B3 has been touched (S105: Yes), the information processing device 10 selects the second information Dx with the smallest execution number among the second information Dx in the unconfirmed list (S106). On the other hand, if a button image other than the button image B3 has been touched (S105: No), the information processing device 10 determines whether or not the button image B2 has been touched (S107).

[0170] When the button image B2 is touched (S107: Yes), the information processing device 10 selects the second information Dx with the highest priority from among the 10 pieces of second information Dx with the smallest execution numbers among the pieces of second information Dx in the unconfirmed list. When the notification performance E is executed by the touch operation of the button image B2, the 10 pieces of second information Dx are deleted from the unconfirmed list.

[0171] On the other hand, when the button image B1 is touched (S107: No), the information processing device 10 selects the second information Dx with the highest priority among all the second information Dx in the unconfirmed list (S109). When the information processing device 10 selects the second information Dx in the above-mentioned step S106, S108, or S109, it starts executing the notification performance E that notifies the result of the second information Dx (S110), and ends the reception process.

[0172] <Modification> The above embodiments can be modified in various ways. Specific modified embodiments are exemplified below. Two or more embodiments selected from the following examples can be appropriately combined.

[0173] (1) In the first embodiment described above, each piece of result information ny in the first information Dy was determined according to the result of an auto race, but the method of determining the result information ny is not limited to the above example. For example, each piece of result information ny may be determined according to the result of each race of a horse race, a bicycle race, or a boat race. Also, each piece of result information ny may be determined in a manner similar to that of lottery result information. Furthermore, the result information ny may be determined by executing a program capable of determining random numbers. When the above program starts to be executed, each piece of result information ny is determined substantially simultaneously in the order of result information ny1, result information ny2, ....

[0174] (2) In auto racing, race R may be run by seven or six racers, in addition to eight racers. When the number of racers participating in race R is seven, the result information ny is one of the numbers "1 to 7", and when the number of racers is six, the result information ny is one of the numbers "1 to 6". The same applies to the second information Dx. As can be understood from the above explanation, the probability of the second information Dx winning varies depending on the number of racers participating in race R. In other words, even if the multiple win type Rt is the same, the above-mentioned winning rate and losing rate vary depending on the number of racers participating in race R.

[0175] However, as described above, a configuration in which the degree of expectation of the battle performance Ed changes can cause the inconvenience of making it difficult to grasp the degree of expectation of the battle performance Ed. In consideration of the above circumstances, a configuration in which the degree of expectation of the battle performance Ed is approximately the same even when the number of racers participating in race R changes is preferable. Specifically, a configuration in which a battle performance determination table Ty (see FIG. 9) is provided for each number of racers participating in race R (8, 7, 6) can be considered.

[0176] (3) In each embodiment, the result of the second information Dx may be notified without the notification performance E. For example, a button image for switching the notification method is displayed in the reception image. Each time the above button image is operated, the information processing device 10 switches between the notification performance mode and the direct notification mode. In the notification performance mode, when an execution operation is accepted, the notification performance E is executed and the correct or incorrect result of the second information Dx is notified, as in the first embodiment described above. On the other hand, in the direct notification mode, when an execution operation is accepted, the correct or incorrect result of the selected second information Dx is directly notified without executing the notification performance E.

[0177] (4) In each embodiment, the terminal device 100 functions as the information processing device 10, but a device other than the terminal device 100 may function as the information processing device 10. For example, the control server 200 may function as the information processing device 10. Specifically, the control server 200 may execute a program to function as the acquisition unit 11, the determination unit 12, the storage unit 13, the determination unit 14, and the control unit 15. In the above modified example, when an execution operation is accepted on the terminal device 100 side, a determination request is transmitted to the control server 200. When the control unit 15 of the control server 200 receives the determination request, the control unit 15 determines the notification performance E by the determination unit 14 and transmits an execution request indicating the notification performance E to the terminal device 100. When the terminal device 100 receives the above execution request, it executes the notification performance E indicated by the execution request.

[0178] (5) In each embodiment, the second information Dx capable of announcing the results collectively can be changed as appropriate. For example, the second information Dx in which the winning or losing is determined according to the results of rail R1 and race R2, and the second information Dx in which the winning or losing is determined according to the results of rail R3 and race R4 may be configured to be executable to execute the notification performance E in which the results of both are announced collectively.

[0179] Also, the configuration may be such that the winning / losing of the second information Dx can be notified for each racecourse where the race R is held. For example, assume that the race R4 is run from the rail R1 at the first racecourse, and the race R8 is run from the rail R5 at the second racecourse. In the above case, the configuration may be such that the notification performance E can be executed to notify the results of both the second information Dx, the winning / losing of which is determined according to the results of the rail R1 and the race R2, and the second information Dx, the winning / losing of which is determined according to the results of the rail R3 and the race R4, together, and the notification performance E can be executed to notify the results of both the second information Dx, the winning / losing of which is determined according to the results of the rail R5 and the race R6, and the second information Dx, the winning / losing of which is determined according to the results of the rail R7 and the race R8, together.

[0180] (6) In the first embodiment described above, "when the number of pieces of result information constituting the first information is a predetermined number, the probability that the second information matches the first information is lower than when the number is a specific number less than the predetermined number, and when the number of pieces of result information constituting the first information is a predetermined number, the notification performance is less likely to end at the initial stage than when the number is a specific number less than the predetermined number," and an example was shown in which the winning probability (first winning probability) when the number of pieces of result information constituting the first information is a predetermined number (e.g., 2) is always higher than the winning probability (second winning probability) when the number of pieces of result information constituting the first information is a specific number (e.g., 3 or 4). Specifically, in the first embodiment, the number of racers in each race R is usually 8, and at least 6. Therefore, the minimum winning probability of a double win, 1 / 64, is higher than the maximum winning probability of a triple win, 1 / 216, and the maximum winning probability of a quadruple win, 1 / 1296. Similarly, the minimum probability of winning a triple win, 1 / 512, is higher than the maximum probability of winning a quadruple win, 1 / 1296.

[0181] However, the present invention does not exclude a configuration in which the first winning probability may be lower than the second winning probability in some cases. For example, assume that the minimum number of racers in each race R is two. In the above case, the minimum winning probability of a double win, 1 / 64, is lower than the maximum winning probability of a triple win, 1 / 8, and the maximum winning probability of a quadruple win, 1 / 16.

[0182] <Summary of the functions and effects of the embodiment> <First aspect> The information processing device (10) of this aspect is an information processing device that can execute a notification performance for notifying whether or not first information (Dy) matches second information (Dx) to which a user has rights, the first information is composed of a plurality of result information (ny), the second information is composed of a plurality of selection information (nx), the notification performance is composed of a plurality of stages of performance, the number of result information constituting the first information is variable, and the maximum number of execution stages of the notification performance changes depending on the number of result information constituting the first information. According to this aspect, the entertainment value of the notification performance is improved.

[0183] <Second aspect> In the information processing device (10) of this embodiment, when the number of result information constituting the first information is a predetermined number (4), the probability that the second information matches the first information is lower than when the number is a specific number less than the predetermined number (2 or 3), and when the number of result information constituting the first information is a predetermined number, the notification performance is less likely to end at the initial stage than when the number is a specific number less than the predetermined number (see Figure 6(b)).

[0184] <Third aspect> In the information processing device (10) of this aspect, the presentation (battle presentation Ed) that can be executed in the final stage of the notification presentation is common when the number of pieces of result information constituting the first information is a predetermined number and when the number is a specific number. According to this aspect, there is an advantage that the number of types of notification presentation required can be reduced compared to a configuration in which a common notification presentation is not executed when the number of winning numbers (multiple win types Rt) is different, for example.

[0185] <Fourth aspect> The information processing method of this aspect is an information processing method that enables the execution of a notification performance for notifying whether or not the first information and the second information to which the user has rights match, the first information is composed of a plurality of result information, the second information is composed of a plurality of selection information, the notification performance is composed of a plurality of stages of performance, the number of result information constituting the first information is variable, and includes a step (S104 in FIG. 14) of determining the execution stage of the notification performance so that the maximum number of execution stages of the notification performance changes according to the number of result information constituting the first information. According to this aspect, the same effect as the first aspect described above can be achieved.

[0186] <Fifth aspect> The program (PG) of this aspect is a program that causes a computer to execute each step of the fourth aspect. According to this aspect, the same effects as those of the first aspect described above can be achieved. [Explanation of symbols]

[0187] 10...information processing device, 11...acquisition unit, 12...determination unit, 13...storage unit, 14...decision unit, 15...control unit, 16...display unit, 17...operation unit, 20...control device, 30...management device.

Claims

1. An information processing device that can execute a notification performance for notifying whether or not first information and second information to which a user has a right match, The first information is composed of a plurality of pieces of result information, the second information is composed of a plurality of selection information; The notification performance is composed of a plurality of stages of performance, The number of pieces of the result information constituting the first information is variable, An information processing device in which the maximum number of execution stages of the notification performance changes depending on the number of the result information that constitutes the first information.

2. When the number of the result information constituting the first information is a predetermined number, the probability that the second information matches the first information is lower than when the number of the result information constituting the first information is a specific number less than the predetermined number; When the number of the result information constituting the first information is a predetermined number, the notification performance is less likely to end in an initial stage than when the number of the result information constituting the first information is a specific number less than the predetermined number. The information processing device according to claim 1 .

3. The presentation that can be executed in the final stage of the notification presentation is common between the case where the number of pieces of the result information constituting the first information is the predetermined number and the case where the number is the specific number.

3. The information processing device according to claim 1 or 2.

4. An information processing method for executing a notification performance for notifying whether or not first information and second information to which a user has a right match, comprising: The first information is composed of a plurality of pieces of result information, the second information is composed of a plurality of selection information; The notification performance is composed of a plurality of stages of performance, The number of the result information constituting the first information is variable. An information processing method comprising a step of determining an execution stage of the notification performance so that the maximum number of execution stages of the notification performance changes depending on the number of the result information constituting the first information.

5. A program for causing a computer to execute the steps recited in claim 4.

Images