Patent Grant
8197333
This application claims the benefit under 35 U.S.C. §365 of International Application PCT/FRO2/01984 filed Jun. 11, 2002, which claims the benefit of French Patent Application No. 01/08233 filed Jun. 22, 2001.
The present invention relates to a method and a system of game management between a game management center and at least one remote game terminal. The invention furthermore relates to a game management center and a game terminal.
More precisely, the invention relates to a method of game management of the type comprising a step of request of at least one game ticket, from the game terminal, and a step of presentation of the game ticket, by the game terminal.
Such a method of game management is known. In particular, the CyberGrattage® game platform implemented by the company GOTO Software allows a player to request a game ticket from the game management center, using a microcomputer connected to the Internet network. The game ticket comprises several masked boxes, a certain number of which have to be scratched virtually, with the aid of a mouse, in order to remove the corresponding masks and uncover symbols. At least one combination of these symbols uncovered is a winner: it suffices to choose the right boxes.
However, when the ticket is a winner, this method requires an additional exchange of information between the game terminal and the game management center, in order to inform the latter thereof.
The invention is aimed at remedying the drawbacks of a conventional game management method, by creating a method making it possible to limit the number of exchanges between the game management center and the remote game terminal, for greater security, and which is simple to implement on the game management center side.
A subject of the invention is therefore a method of game management of the aforesaid type, characterized in that it comprises, between the request step and the presentation step: a step of generation, by the game management center, of a win indicator determining whether the game ticket presented is a winner or a loser; and a step of transmission by the game management center and to the game terminal, of a result containing said win indicator; and in that during the presentation step, the game terminal generates at least one representation of the game ticket as a function of the result transmitted and presents said game ticket under this representation.
Thus, the method of game management according to the invention limits the number of exchanges between the game terminal and the game management center, since when the ticket is presented to the player, the game management center already knows whether the ticket is a winner or a loser.
The method of game management according to the invention may moreover comprise one or more of the following characteristics:
The invention also relates to a center for game management, characterized in that it comprises means of reception of a game ticket request issued by a player, means of generation of at least one game ticket that are activated by the receipt of the request, and means of determination, whether the game ticket is a winner or a loser, before the latter is presented to the player.
The invention also relates to a game terminal, characterized in that it comprises means of issuing a request for at least one game ticket, means of reception of the result of a determination, whether the game ticket is a winner or a loser, and means of generation of at least one representation of the game ticket, as a function of the result, and of presentation of the game ticket under this representation.
The game terminal according to the invention can furthermore comprise the following characteristic:
The invention also relates to a system of game management comprising a game management center as described hereinabove and at least one remote game terminal as described hereinabove.
The invention will be better understood on reading the description which follows, given merely by way of example and while referring to the appended drawings in which:
The environment represented in
Moreover, remote game terminals 201, . . . , 20n are also linked to the Internet network 14 by means of bidirectional links 221, . . . , 22n. These remote game terminals 201, . . . , 20n are for example microcomputers located at the players' homes.
Each remote game terminal 20i comprises a modem 24 catering for the connection with the bidirectional link 22i, and a central methoding unit 26 associated with a display screen 28 and a keyboard 30. The central methoding unit 26 comprises a game application downloaded from the game management center 10, in the form of a Java applet. Moreover, the central methoding unit 26 is linked in bidirectional communication with a conventional electronic payment device 32, such as an electronic purse.
Represented in
During a first step 40, the player, interacting with the game application stored in the central methoding unit 26 of the game terminal 20i, by means of the keyboard 30 and of the display screen 28, requests the purchase of a game ticket.
During the next step 42, the central methoding unit 26 verifies that the content of the electronic purse 32 makes it possible to purchase the requested game ticket. If this is not the case, we go to a cancellation step 44, in the course of which the game application informs the player, via the screen 28, that he does not have enough money.
If the content of the electronic purse 32 allows the purchase of the game ticket, we go to a payment step 46, in the course of which the electronic purse 32 is debited with the sum corresponding to the price of the game ticket requested. The transaction is performed, for example, with a remote payment center (not represented) accessible by Internet. Regarded as conventional, this transaction will not be described further. At the end of this transaction, the electronic purse 32 transmits a proof of payment M1 to the central methoding unit 26 of the game terminal 20i.
During the next step 47, the game terminal 20i transmits a ticket request message M to the game management center 10. This message M comprises the proof of payment M1, emanating from the previous step.
Optionally, the message M also comprises a game identification number M2, uniquely defining the type of game ticket requested by the player.
Specifically, the game management center 10 can manage several games, each of which is associated with a predetermined probability of winning. Thus, the game identification number M2 makes it possible to determine which game, and hence which probability of winning, the requested ticket is associated with.
However, the ticket request message M does not necessarily comprise the game identification number M2. Specifically, as a variant, the player transmits the ticket request message M, without having previously chosen a particular game ticket type. In this case, the game management center 10, managing several games, chooses at least one type of ticket corresponding to at least one game, for example randomly.
Also optionally, the game terminal 20i also transmits a symmetric secret key M3, generated automatically by the game terminal 20i in a conventional manner. This key will be used, as will be described subsequently, by the game management center 10, for the symmetric encryption of data.
Finally, optionally, the message M comprises a seed M4 which is, for example, any real number and is intended to be used by the game management center 10 during a determination step which will be described later.
To secure the transmission of information between the game terminal 20i and the game management center 10, a well known means is to use an asymmetric public key cryptography process, in which the game management center 10 possesses a private key SKGP which is known only to itself and a public key PKGP which is known to the terminal 20i.
Thus, the message M is transmitted by the terminal 20i to the game management center 10, in encrypted form by means of a conventional encryption function E and of the public key PKGP. As a result, M takes the following form:
M=E PKGP(M1, M2, M3, M4).
Next, during a reception step 48, the game management center 10 decrypts the message M by means of the private key SKGP. It thus retrieves the symmetric secret key M3, the seed M4 and the game identification number M2 allowing it to associate the probability of winning corresponding to this identification number M2.
The probability of winning is defined by a statistical distribution of win values that is stored in memory 13. Furthermore, the game management center 10 authorizes passage to the next step of the method, after verification of the proof of payment M1.
The expression “statistical distribution of win values” is understood to mean a real function of the interval [0; 1] in a space of win values, such as the set of reals, or else a set of predetermined prizes.
For example, in the subsequent description, the game corresponding to the game identification number M2 is regarded as a game in which the game ticket comprises a grid of nine masked boxes, of which three contain a cross and six a circle. The rule of the game consists in uncovering three boxes out of the nine boxes. The player wins 100 Euros if he uncovers three crosses, 10 Euros if he uncovers two crosses, nothing otherwise.
Thus, for this game, the probability of the player winning 100 Euros is 1/84, the probability of the player winning 10 Euros is 18/84 and the probability of the player winning nothing is 65/84.
More precisely, the probability of winning is defined for example by the following statistical distribution of win values d:
Conventionally, in this type of game, it is the player who determines, when he uncovers three boxes out of these nine boxes, whether the game ticket is a winner or a loser. It will be noted however that, within the framework of the invention, it is the game management center 10 that determines whether the game ticket is a winner or a loser. When this ticket is presented to the player and when the latter chooses three boxes to be uncovered out of the nine boxes, the symbols appearing behind the three uncovered boxes are chosen dynamically by the game application of the game terminal 20i, to correspond to the result of the determination performed by the game management center 10.
Thus, during the next determination step 50, the game management center 10 randomly generates a real number xdet lying between 0 and 1, possibly from the seed M4. Specifically, a known method for generating xdet is to use a conventional pseudo-random number generating function, using an input variable, such as a real number, called a seed.
Next, during this same step, the game management center 10 generates a win value R2=d(xdet) as well as an indicator R1 equal to 0 if the win value R2 is zero and to 1 otherwise. Moreover, it generates a game ticket identifying number R3.
The game management center 10 keeps for each winning ticket, in memory 13, the game ticket identifying number R3 associated with the indication R1 and with the win value R2 as well as the game identifying number M2. Thus, it knows, before the game ticket is presented to the player, whether this ticket is a winner or a loser.
Next, during a step 52, the game management center 10 transmits a response R containing the indicator R1, the win value R2 if the indicator R1 is equal to 1 and the game ticket identifying number R3 to the game terminal 20i.
Optionally, the response R furthermore comprises the game identifying number M2 and a ticket generation seed R5, which is, like M4, any real number.
Finally, the response R comprises a signature R6 calculated with the aid of a conventional hash function Sign and of the private key SKGP, from the aforesaid data contained in the response R, that is to say R1, R2, R3, M2 with the exception of R5. It follows that:
R6=Sign SKGP(R1,R2,R3,M2).
The response R is transmitted to the game terminal 20i in encrypted form, with the aid of the encryption function E and of the symmetric secret key M3, known only to the game terminal 20i and to the game management center 10. R therefore takes the following form:
R=E M3(R1,R2,R3,M2,R5,R6).
During the next step 54, the game terminal 20i decrypts the response R with the aid of the symmetric secret key M3 and verifies, with the aid of the public key PKGP, that the signature R6 does indeed correspond to the content of the response R.
Next, during a test step 56, the game terminal 20i verifies the value of the indicator R1.
If R1 equals 0, we go to step 58, during which the game terminal 20i generates a game ticket to be scratched, possibly with the aid of the ticket generating seed R5, and displays the latter on the screen 28. Specifically, the game terminal 20i can use a conventional pseudo-random generating function to randomly diversify the presentation of the game ticket to be scratched.
During this step, whatever three boxes are uncovered by the player, the ticket presented on the screen 28 is a losing ticket, that is to say the boxes uncovered comprise at most one cross.
The presentation of the losing ticket is moreover implemented entirely by the game application recorded in the central methoding unit 26 of the game terminal.
Specifically, the game application generates at least one first representation of the game ticket not indicating whether the latter is a winner or a loser, before the player has uncovered a first box, and a second representation of the game ticket, indicating that the latter is a loser, when the player has uncovered three boxes.
On the other hand, if the indicator R1 equals 1, we go to a step 60. During this step 60, the game terminal 20i generates a ticket to be scratched, just as above, and presents the latter on the screen 28. However, in this case, the ticket to be scratched is a ticket which will be presented as a winner regardless of the player's choice.
If, moreover, the win value R2 equals 10, then whatever boxes are uncovered by the player, they comprise two crosses. If the win value R2 equals 100, the three boxes uncovered by the player each comprise a cross.
As above, the game application generates at least one first representation of the game ticket not indicating whether the latter is a winner or a loser, before the player has uncovered a first box, and a second representation of the game ticket, indicating the symbols corresponding to the win value R2, when the player has uncovered three boxes.
During step 62 following step 60, the game terminal 20i transmits a proof of winning P to the game management center 10, this proof comprising the signature R6 and payment information P2 such as for example a number of a bank account of the player, to which the game management center 10 can remit the sum won by the player during the previous step.
This proof of winning P is transmitted to the game management center 10 in encrypted form, with the aid of the encryption function E and of the asymmetric public key PKGP. It follows that:
P=E PKGP(R6,P2).
Finally, during a last step 64, the game management center 10 verifies the validity of the signature R6 and verifies that the ticket corresponding to the ticket identifying number R3 has not already been rewarded.
Any appropriate means can then be implemented to forward the prize to the winner during a step 66.
It is clearly apparent that the game management method according to the invention allows the straightforward implementation of the management of a game with predetermined probability of winning, by presenting the player with a game ticket which has already been determined as being a winner or a loser by the game management center 10, as a function of the probability of winning.
Another advantage of the method described above is to allow very straightforward implementation on the game management center 10 side, the latter comprising in memory the statistical distribution of win values corresponding to the type of game ticket requested by the player and transmitting only the result of the determination to the game terminal, without generating the game ticket. Specifically, the generation of the game ticket, the forwarding of the winning or losing ticket and the presentation of the response are performed entirely by the game terminal 20i, by virtue of the game application loaded into it.
Moreover, little data is exchanged between the game management center 10 and the game terminal 20i since the look of the ticket upon presentation thereof to the user is determined by the game terminal. Very little bandwidth is therefore required between the game management center and the terminal in order to implement the method of the invention.
Finally, it will be noted that the invention is not limited to the embodiment described above.
Specifically, as a variant, the statistical distribution of win values can be represented by a discrete function having discrete values.
| Number | Date | Country | Kind |
|---|---|---|---|
| 01 08233 | Jun 2001 | FR | national |
| Filing Document | Filing Date | Country | Kind | 371c Date |
|---|---|---|---|---|
| PCT/FR02/01984 | 6/11/2002 | WO | 00 | 12/18/2003 |
| Publishing Document | Publishing Date | Country | Kind |
|---|---|---|---|
| WO03/000368 | 1/3/2003 | WO | A |
| Number | Name | Date | Kind |
|---|---|---|---|
| 4157829 | Goldman et al. | Jun 1979 | A |
| 4582324 | Koza et al. | Apr 1986 | A |
| 4677553 | Roberts et al. | Jun 1987 | A |
| 4856787 | Itkis | Aug 1989 | A |
| 5709603 | Kaye | Jan 1998 | A |
| 5772510 | Roberts | Jun 1998 | A |
| 5779545 | Berg et al. | Jul 1998 | A |
| 5816918 | Kelly et al. | Oct 1998 | A |
| 5871398 | Schneier et al. | Feb 1999 | A |
| 5928082 | Clapper, Jr. | Jul 1999 | A |
| 5931467 | Kamille | Aug 1999 | A |
| 6080062 | Olson | Jun 2000 | A |
| 6117013 | Eiba | Sep 2000 | A |
| 6595855 | Sako | Jul 2003 | B2 |
| Number | Date | Country |
|---|---|---|
| 2 800 492 | Oct 2000 | FR |
| 2 800 492 | May 2001 | FR |
| 61-120277 | Jun 1986 | JP |
| 10-207971 | Aug 1998 | JP |
| 10-283423 | Oct 1998 | JP |
| 2001-076066 | Mar 2001 | JP |
| WO98-36809 | Aug 1998 | WO |
| 9963494 | Dec 1999 | WO |
| 0025281 | May 2000 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20040167792 A1 | Aug 2004 | US |
