Grid-based lottery game and associated system

Information

  • Patent Grant
  • 8056900
  • Patent Number
    8,056,900
  • Date Filed
    Monday, April 19, 2010
    14 years ago
  • Date Issued
    Tuesday, November 15, 2011
    13 years ago
Abstract
A method and associated system for hosting a lottery game includes designating a plurality of game player positions on a predetermined grid presented to the player on a play slip, the game player positions defining a pathway on the grid. The pathway includes the player positions is continuous from a start grid position to a finish grid position. A lottery ticket is issued to the player that indicates the player's pathway on the grid. The lottery authority randomly selects at least one position on the grid. A winning outcome is determined based on a value of the player positions in the pathway from the start grid position to the finish grid position prior to intersection of the pathway by the randomly selected lottery position on the grid.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


The invention relates in general to lottery game methods. More particularly, the invention relates to an on-line lottery wagering game.


2. Description of the Related Art


Many lottery games are available for the public to purchase. However, often people do not play these games for two simple reasons: the games do not appeal to them and the rules for these games are too confusing.


Most people enjoy playing games, either computer games, electronic games, or board games at a younger age. People often have fond memories of the games they played as children and often they still remember the rules for these games. One of such popular games is Pac Man®, which was very popular in the 1980s. In this game, the player moves an icon through different paths on a grid and tries to capture as many cookies as possible while evading ghosts who are after the player's icon. The game was easy to learn and fun to play. Pac Man® has long been replaced by more advanced video games, but it still has a special place in people's memory.


Although Pac Man® was a popular game and easy to play, it ran on electronic gaming devices that have long been retired. Pac Man® is an excellent vehicle to bring people's nostalgic feeling. It is to such a lottery game that utilizes a nostalgic electronic game theme the present invention is primarily directed.


SUMMARY OF THE INVENTION

Briefly described, the present invention teaches a lottery game method where a player selects positions on a grid that form a pathway, whereupon the lottery authority randomly selects positions on the grid. Prizes and/or an entry into a lottery game are determined based on the intersection of the player's and the lottery authority's selections on the grid.


In one embodiment, there is provided a method of hosting a lottery game that includes selecting for a game player a plurality of game player positions on a predetermined grid, wherein the game player positions defining a pathway on the grid and the pathway being linear and continuous and composed of the selected game player positions, a lottery authority randomly selecting at least one position on the grid, and determining an outcome of the game based on the intersection of the pathway and the at least one position on the grid selected by the lottery authority.


In another embodiment, there is provided another lottery game that includes a plurality of game player selectable positions on a predetermined grid, wherein the game player positions defining a pathway on the grid and the pathway being linear and continuous, wherein the grid selectively populated with numbers and symbols from a lottery authority, and the outcome of the lottery game determinable based on the numbers and symbols in the pathway.


In yet another embodiment, there is provided another method for conducting a lottery game that includes receiving a path from a player, wherein the path being defined on a predetermined grid, placing a plurality of player indicia on the path, placing a plurality of symbols on a plurality of predetermined positions on the predetermined grid, determining a set of player indicia based on the plurality of player indicia on the path and the plurality of symbols on the grid, generating a set of winning indicia, comparing the set of player indicia and the set of winning indicia, and awarding a prize to the player based on comparison between the set of player indicia and the set of winning indicia.


In yet another embodiment, there is provided a method for hosting a lottery game. The lottery game method includes receiving a path from a player, wherein the path being defined on a predetermined grid, placing a plurality of symbols on a plurality of predetermined positions on the predetermined grid, and awarding a prize to the player if the path does not intercept with any of symbols placed on the predetermined grid.


In yet another embodiment, there is provided a system for hosting a lottery game. The system includes a communication network, at least one gaming machine in communication with the communication network, and a server in communication with the at least one gaming machine through the communication network. The server hosting the lottery game and being capable of receiving a path from a player, the path being defined on a predetermined grid, placing a plurality of player indicia on the path, placing a plurality of symbols on a plurality of predetermined positions on the predetermined grid, determining a set of player indicia based on the plurality of player indicia on the path and the plurality of symbols on the grid, generating a set of winning indicia, comparing the set of player indicia and the set of winning indicia, and awarding a prize to the player based on comparison between the set of player indicia and the set of winning indicia.


Other objects, features, and advantages of the present invention will become apparent after review of the Brief Description of the Drawings, Detailed Description of the Invention, and the Claims.





BRIEF DESCRIPTION OF THE DRAWINGS


FIGS. 1-3 are schematic illustrations of a grid and of a pathway defined thereon.



FIGS. 4-7 are illustrations of lottery game play slips.



FIG. 8 is a schematic illustration a lottery game ticket of the invention.



FIGS. 9-12 are schematic illustrations of subsets of possible lottery game selections for a game method of the invention.



FIG. 13 is a schematic illustration of a lottery's game selections as publicly disclosed.



FIG. 14 is a schematic illustration of a lottery game ticket of the invention with the player's selections indicated thereon, and with the lottery's selections manually superimposed thereon.



FIG. 15 is a schematic illustration a lottery game ticket of the invention.



FIG. 16 is a schematic illustration of a lottery's selections as publicly disclosed.



FIG. 17 is a schematic illustration of a lottery game ticket of the invention with the player's selections indicated thereon, and with the lottery's selections superimposed thereon.



FIG. 18 is a schematic illustration of a game ticket with the both the player's and the lottery's selections indicated thereon.



FIG. 19 is an illustration of a prize table of the invention.



FIGS. 20-24 are illustrations of conditional probability tables for a draw-based game based on the outcome of the inventive game.



FIG. 25 is an illustration of a general probability table for game methods of the invention.



FIG. 26 is a schematic illustration of a game ticket with the both the player's and the lottery's selections indicated thereon.



FIG. 27 is a schematic illustration of a game ticket with the player's selections indicated thereon.



FIG. 28 is a schematic illustration of a game ticket with the lottery's selections as publicly disclosed.



FIG. 29 is a schematic illustration of the game tickets of FIG. 27-28, with the player's selections indicated thereon, and with the lottery's game selections manually superimposed thereon.



FIG. 30 illustrates a select set of positions on a grid where ghosts may be placed.



FIG. 31 illustrates an exemplary ticket according to one embodiment of the invention.



FIG. 32 illustrates another exemplary ticket according to one embodiment of the invention.



FIG. 33 illustrates a sample multiplier table.



FIG. 34 illustrates a sample prize table.



FIG. 35 illustrates a sample composite prize table.



FIG. 36 illustrates one special symbol used in one embodiment of the invention.



FIG. 37 illustrates a select set of positions on a grid where the special symbol of FIG. 36 may be placed.



FIGS. 38-39 illustrate sample tickets according to one embodiment of the invention.



FIGS. 40-41 illustrate prizes tables according to one embodiment of the invention.



FIG. 42 illustrates another sample ticket according the invention.



FIG. 43 illustrates another prize table according to the invention.



FIG. 44 illustrates a network supporting the present invention



FIG. 45 illustrates a game device process.



FIG. 46 illustrates a lottery server process.





DETAILED DESCRIPTION OF THE INVENTION

The present invention is a method for a lottery game method where a player selects positions on a grid that form a pathway and the lottery authority randomly places a set of ghosts on the same grid. The interception of the pathway with any of ghosts determines a set of player indicia that will be compared with a set of winning indicia drawn by the lottery. Prizes are determined based on the number of matches between the player indicia and the winning numbers.


Referring now the drawings and presentation materials, let S be a set of positions on a grid. P, a subset of S, is a path if P is linear and continuous, i.e., it is visually apparent that P can be ordered in a progressive sequence from first to last: P1<P2< . . . <Pn. Continuity means that if a and b EP, elements of P, are adjacent in the order, they are adjacent geometrically. Less formally, there are no “breaks” in the path.


To demonstrate the concept of a path, consider a 6 by 6 grid with 36 positions indicated by small circles as shown in FIG. 1. In FIG. 2, eight of the positions have been selected (blackened) by a game player. The selection forms a path and suggests an order as indicated in FIG. 3, with the selected positions numbered from 1 to 8. This order is continuous as it is clear that if two positions are next to each other in the order, they are adjacent, i.e. one is immediately to the right or below the other.


In the current invention, a player's selection includes a path on a grid. The lottery authority selects positions on that grid as well. Prizes or an entry into a lottery game are based on the intersection of the player's path and the lottery authority's selection on the grid.


Referring now to FIGS. 4-8, the following embodiment is derived from the electronic game “Pac Man®” The player pays $2. FIG. 4 illustrates a play slip with a 5 by 5 grid of bubbles with one designated “Start” and one designated “Finish.” The player selects a path of bubbles from “Start” to “Finish” by moving either down or to the right at each step. FIGS. 5-7 illustrate examples of possible player selections. The player thereafter receives a ticket memorializing their selection. For example, the ticket in FIG. 8 was generated by the play slip in FIG. 6.


The lottery authority randomly selects one position from each of 4 disjoint subsets of positions on a 5 by 5 grid. These subsets are illustrated in FIGS. 9-12, and are referred to as Subset 1, Subset 2, Subset 3, and Subset 4, respectively. For example, the positions in Subset 1, illustrated in FIG. 9, comprise the diagonal from the bottom left corner to the top right corner. Once the lottery positions have been selected, each is represented by a rendering of a “ghost,” which is a character from the game of Pac Man®, as shown on FIG. 13. If none of the positions selected by the lottery authority intersect the player's path, the player wins $5, otherwise the player wins nothing.


For example, suppose that FIG. 8 is a player's ticket. The draw consists of the lottery authority randomly selecting exactly one position from each of Subsets 1, 2, 3, and 4 in FIGS. 9-12. This draw is communicated by the image of 4 ghosts positioned on a grid as shown in FIG. 13. Such an image could be graphically or visually displayed on television, a monitor or in a newspaper, a cell phone, a handheld electronic device or as otherwise desired.


The player marks the drawn positions on his ticket as shown in FIG. 14, such as with X's. As the lottery authority has drawn the position of the 4th row down and 5th column from the left and this is also one of the positions in the player's path, the player does not win. Consider now the ticket in FIG. 15 and the lottery authority's draw is represented in FIG. 16. The player marks the drawn positions on his ticket in FIG. 17. As none of these positions intersect his selection, he wins $5. It is easy to verify that the return for this game is 50% by the formula (probability×prize)/price=return. Note that the player's path intersects each of Subsets 1-4 exactly once. As exactly one ghost is chosen from each of these subsets, it is a straightforward calculation that the probability that a ghost does not intersect a player's path is 1−(⅘×¾×⅔×½)=⅕. Therefore, the return is (⅕×$5)/$2=50%.


In the following embodiment, the outcome of the inventive game defines an entry into a lottery game. A representative play slip for this embodiment is that in FIG. 4, (the same as in the above embodiment). The player selects a path of bubbles from “Start” to “Finish” by moving either down or to the right at each step, as in the above embodiment. FIGS. 5-7 illustrate various player selections. The player pays $2 and submits a play slip (or requests a quick-pick). The lottery authority draws positions at the time of the purchase and these positions are represented on the ticket as ghosts.


For example, suppose the player submits the play slip in FIG. 6. He may receive a ticket as shown in FIG. 18. The grid on his ticket is occupied by 21 distinct numbers out of 1 to 40 and 4 ghosts. The positions of the ghosts are randomly selected by the lottery authority from each of Subsets 1-4 (FIGS. 9-12). The numbers in the path the player selected are highlighted from the “Start” position up to the position immediately before his path encounters a ghost. The ghost acts as a delimiter and stops the path. If there are no ghosts in the player's chosen path, all of the numbers in the path are highlighted. These highlighted numbers comprise an entry into a draw-based lottery game.


The lottery authority subsequently draws 4 numbers from 1 to 40 as an event, for example as a “daily draw.” Prizes are based on the number of matches between the lottery authority's draw and the player's entry. For example, suppose the player's ticket is that in FIG. 18. There are 5 highlighted numbers before his path encounters a ghost at the 6.sup.th step of his path. His entry comprises the numbers in his path before the ghost: 22-19-09-11-35. The lottery authority subsequently draws 03-19-21-22. As the player matches the numbers 19 and 22 he is credited with 2 matches. He is awarded $5 as indicated by the prize table in FIG. 19.


As another example, suppose that the play slip is as in FIG. 5 and the player's ticket is that of FIG. 26. As none of the drawn ghosts intersect the player's path his entry comprises 9 numbers: 30, 21, 31, 14, 27, 33, 06, 22, and 29. The lottery authority draws 21, 27, 29, and 39. As the player's entry includes 21, 27, 29 he has three matches and is awarded $50 as indicated by the prize table for this game in FIG. 19. It is to the player's advantage for his path to encounter a ghost later, or not at all, rather than earlier in his path as this allows for more numbers in his entry and thus a greater chance to match the lottery authority's draw.


The prize table for the embodiment of the game described above is illustrated in FIG. 19, and to derive this prize table it is necessary to compute the probabilities for the various number of matches. There are 5 different cases for how the drawn positions can intersect the player's path. In case 1, the lottery authority's selection from subset 1 (FIG. 9) is the first lottery-selected position to intersect the player's path. In case 2, subset 2 (FIG. 10) is the first; in case 3, subset 3 (FIG. 11) is the first; in case 4, Subset 4 (FIG. 12) is the first; and in case 5, the lottery authority's selected positions do not intersect the player's path. Note that regardless of how the player selects a path, the path intersects each of subsets 1-4 (FIGS. 9-12) exactly once. Moreover, the player's path intersects subsets 1-4 (FIGS. 9-12) in that order. The path intersects Subset 1 at the 5.sup.th step of his path, Subset 2 at the 6th step of his path, and so on.


It is easily verified that the probability of each case occurring is ⅕. For example, case 1 occurs if and only if the ghost randomly selected from subset 1 (FIG. 9) is in the player's selected path. As there are 5 positions, the lottery authority has a ⅕ chance of choosing the position that intersects the player's path. For case 2 to occur, it must be the case that the lottery authority's selection from subset 1 (FIG. 9) does not intersect the player's path but the lottery authority's selection from subset 2 (FIG. 10) does. As there are 5 positions in subset 1 (FIG. 9) and 4 positions in subset 2 (FIG. 10), this probability is ⅘×¼=⅕. Similarly, the probability for case 3 is ⅘×¾×⅓=⅕ and the probability for case 4 is ⅘×¾×⅔×½=⅕. Case 5 is the complement of cases 1-4, which is 1−(4×⅕)=⅕. Which of these cases occurs determines how many numbers are in the player's entry.


Case 1 results in 4 numbers being in the player's entry. For case 2, there are 5 numbers in the player's entry. For case 3, there are 6 numbers in the player's entry. For case 4, there are 7 numbers in the player's entry. For case 5, there are 9 numbers in the player's entry. Furthermore, given one of these cases, the probability for the number of matches can be computed using the hypergeometric probability distribution. Probability tables given each of these cases are illustrated in FIGS. 20-24. For example, given that there are 5 numbers in the player's entry the probability that the player will match 2 is that indicated in FIG. 21: 0.0651055914 (rounded to the nearest 1010). A general probability table for this game, FIG. 25, is derived by weighting each of the tables by ⅕ and adding the corresponding probabilities together. For example, the probability of matching 2 is:

⅕×0.0413611993+⅕×0.0651055914+⅕×0.0920779079+⅕×0.1213261845+⅕×0.1831710253=0.1006083817


The prize table in FIG. 19 is based on these probabilities. Those skilled in the art of mathematics can confirm that such a prize structure returns 64.1% based on a $2 price point.


A variation on this embodiment is to have the ghosts drawn and the lottery numbers drawn as events separate from the ticket. For example, suppose that a player's play slip is as shown in FIG. 6 and they receive a ticket as shown in FIG. 27. The ticket comprises 25 numbers out of 1 to 40 identified with the 25 positions of the grid. The numbers in the path selected by the player is also indicated. In this case, the font for the numbers on the player's path is larger than that for the others to distinguish them.


The lottery authority subsequently draws 4 ghosts and 4 numbers from 1 to 40. The lottery authority randomly draws the four ghosts one at a time from subsets 14 (FIGS. 9-12). The drawn ghosts are displayed on a grid as that in FIG. 28. Such a draw could be publicly disclosed in a variety of ways such as by television or by the newspaper. The player then identifies the positions of the drawn ghosts on his ticket.


In FIG. 29 he has marked these positions with X's. The first position in the path for which there is an X is that of the 3rd row down 4th column from the left. His entry comprises the numbers in his path up to but not including that point: 30, 12, 15, 21, and 34. The lottery authority draws 15, 18, 21, and 35. The player is credited with matching 15 and 21. He is not credited with matching 18 even though 18 is one of the numbers on his path. This is because 18 occurs after a ghost is encountered. He receives $5 for matching 2 as indicated on the prize table in FIG. 19.


In other embodiments, the current invention incorporates symbols that affect the game mechanics and/or prizes. A player “wins” a symbol depending on whether or not and at what point the symbol occurs in the selected path on his ticket. One example is a symbol that awards a multiplier that is applied to the player's winnings. In one embodiment, the player purchases a ticket for $2.00. A 5 by 5 grid is populated with distinct numbers ranging from 00 to 99 (100 numbers) and four ghosts. The ghosts are randomly placed along the diagonals in FIGS. 9-12 as described in earlier embodiments. There is also a symbol, which is identified with a multiplier, placed in one of the 14 shaded cells in FIG. 30, after the 4 ghosts have been placed, i.e., in one of the 10 remaining cells. FIG. 31 illustrates an example of such a ticket.


There may be several different symbols that can be placed on the grid and each symbol has a different multiplier value. FIG. 33 illustrates an example of different symbols, and their respective multiplier values and probabilities. For example, a ticket has a probability of 50% of having a CHERRIES placed on the ticket. The player selects a path. His numbers comprise those in the path prior to being obstructed by a ghost. Prizes are based on the number of matches between his numbers and those drawn by the lottery. If it is the case that the symbol occurs in the player's selected path before a ghost, then the associated multiplier is applied to his winnings. If a CHERRIES symbol occurs in the player's selected path before a ghost is encountered, the player wins a 2 multiplier. In FIG. 32, the CHERRIES symbol is assigned the position of 1st row, 5th column. However, the symbol does not occur in the player's selected path. The player does not win the multiplier.



FIG. 34 illustrates the base prize table for this embodiment, i.e., prizes based on the number of matches between the player's and the lottery authority's drawn numbers. This prize will subsequently have a multiplier applied if the player wins a symbol. For example, if the draw is 41, 47, 68, 87, then the ticket in FIG. 31 has 2 matches (41 and 87). By the prize table in FIG. 34, the ticket is awarded $10. Also, as he has won a CHERRIES symbol the player gets a 2 multiplier. The final prize is 2×$10=$20. Those skilled in the art of Mathematics can verify that the above described embodiment pays out 53.3%. FIG. 35 illustrates a composite prize table for the above embodiment.


In another embodiment, a “Power Pill” symbol, FIG. 36, is incorporated into the game. This embodiment costs $5.00 per ticket. This embodiment is similar to that previously described. On the ticket, a 5 by 5 grid is similarly populated with numbers (00 to 99), ghosts and symbol, which has an associated multiplier. In addition, a Power Pill symbol is randomly placed in one of the 9 shaded cells in FIG. 37. In this embodiment, the Power Pill is worth a 2 multiplier and confers immunity to the ghosts, i.e., if the player wins the Power Pill, then his path cannot be obstructed by a ghost. The Power Pill acts like a ghost remover or a path delimiter remover. Instead, the player wins the ghosts that occur in his path, which are worth multipliers.



FIG. 38 is an exemplary ticket with the Power Pill. The Power Pill has been placed in the 1st row, 3rd column. The player wins the Power Pill as it is in the selected path. The Power Pill is worth a 2 multiplier. The player also has a CHERRIES symbol in his path, which is worth a 2 multiplier. Also, as the player has won the Power Pill, it is conferred immunity to the ghosts. The ghosts, now with a different appearance, evocative of the arcade game, to indicate that they are now “edible.” Each ghost that occurs in the selected path is worth a 2 multiplier. All of the player's multipliers are multiplied together to produce a final multiplier: 2 (Power Pill)×2 (CHERRIES)×2×2 (the two ghosts)=16. Therefore, the player will have 16 multiplied to his winnings. The player's numbers are 87, 33, 67, 47, and 41. The lottery authority draws 4 numbers out of 100 and the player wins prizes based on matches between his numbers and those drawn by the lottery. FIG. 39 is another exemplary ticket for this embodiment. The Power Pill is in the position 3.sup.rd row, 2.sup.nd column; however, the play does not win the Power Pill as it is not in the selected path. It does not have immunity to the ghosts and is obstructed.


This base game prize table for this embodiment is in FIG. 40. Notice that the prizes are the same as for those for the previous embodiment, which had a $2.00 price point. This is convenient as this would allow the two embodiments, one priced at $2.00 and the other priced at $5.00, to be run concurrently using the same draw and prize table. However, the $5.00 game also features a minimum prize of $7. This means that if a player wins a prize, then he is awarded the maximum of his prize and $7. This is appealing to the player as it guarantees that if he wins a prize, it will at least be as big as the price point. For example, suppose the draw is 41, 45, 50, and 87. As the ticket in FIG. 38 has two matches, it is awarded $10. Also, as discussed it has final multiplier (factoring in the Power Pill, CHERRIES symbols, and ghosts) of 16. The final prize is $160. The ticket in FIG. 39 has 1 match, 87 and is awarded $2. As there is a minimum prize of $7, his final prize is $7. Those skilled in the art of Mathematics can verify that this embodiment pays out 64.0%. A composite prize table is indicated in FIG. 41.


The current invention could be embodied with virtually any matrix, such as that for Keno, wherein 20 numbers are drawn from the set 1 to 80. FIG. 42 is a sample ticket. A ticket costs $5.00 and comprises 5 by 5 grid that is populated by numbers ranging from 1 to 80, a Power Pill symbol, a fruit symbol, and 4 ghosts. The Power Pill symbol, fruit symbol, and 4 ghosts are placed on the grid similar to earlier embodiments. In this embodiment, the Power Pill does not award a multiplier, but does confer immunity to the ghosts and the fruit symbol is always worth a 3 multiplier. Each ghost, if eaten, is worth a 2 multiplier. An exemplary base prize table is in FIG. 43. Notice that prizes are awarded for up to 9 matches. Nine matches are possible as it is possible for the player to have as many as 9 numbers in his path and the lottery authority draws 20 numbers. Those skilled in the art of Mathematics can confirm that this embodiment pays out 64.9% and the player has a 1 in 5.5 chance of winning a prize.


The invention can be implemented on a standalone gaming device or a game server. A standalone gaming device may include a display unit, a scanning unit (also known as a player input device) for scanning playslips containing player selection, and a ticket issuing unit for issuing tickets to players. The gaming device has a controller with a random number generator capable of generating numbers for the player. The controller also takes player selected path and numbers from the scanning device and issues a ticket to the player. After issuing the ticket, the controller generates a set of winning numbers and placement of ghosts, and determines a number of matches for the player's ticket as described above. The gaming device may also be connected to a genie server as illustrated in FIG. 44. The gaming device 4402 is connected to the server 4406 through a communication network 4404. In the embodiment illustrated in FIG. 44, each gaming device receives wagers and selections from players, passes betting information to the server 4406, and issues tickets to the players. The server 4406 receives player selections and determines winners based on the numbers selected by the lottery authority.



FIG. 45 illustrates a lottery station process 4500 according to one embodiment of the invention. A player may select a path on a grid and submit his selected path to a lottery station. The lottery station receives this path information, step 4502, and randomly generates a set of numbers, step 4504, and places each number on a position in the selected path, step 4506. Alternatively, the player may also select numbers and their placement on the selected path. After filling each position of the selected path with generated numbers, the lottery station will fill the rest of the grid with random numbers, step 4508, and print a ticket corresponding to this grid and player's path to the player, step 4510. Additionally, upon payment of additional fee, the player may also request a Power Pill be randomly placed on the selected path. The player's selected path and the generated numbers for the selected path are sent to a lottery server where it will be stored, step 4512.



FIG. 46 illustrates a lottery server process 4600. The lottery server receives ticket information from lottery stations, step 4602, and store the ticket information, step 4604. Subsequently, the lottery will draw or generate a set of winning numbers, step 4606, and also randomly placing a set of ghosts on the grid, one ghost on each subset as described above, step 4608. The winning numbers and the placement of the ghosts are made public. The lottery server may also compare winning numbers and the ghost information with the stored ticket information, step 4610, and determine prizes for each winning ticket, step 4612.


Although several preferred embodiments of the invention have been disclosed in the foregoing specification, it is understood by those skilled in the art that many modifications and other embodiments of the invention will come to mind to which the invention pertains, having the benefit of the teaching presented in the foregoing description and associated drawings. It is thus understood that the invention is not limited to the specific embodiments disclosed herein, and that many modifications and other embodiments of the inventions are intended to be included within the scope of the appended claims. Moreover, although specific terms are employed herein, as well as in the claims, they are used in a generic and descriptive sense only, and not for the purposes of limiting the described invention, nor the claims which follow below.

Claims
  • 1. A system for hosting a lottery game, comprising: a communication network;a plurality of gaming machines;a server, said server in communication with said gaming machines via said communication network;said gaming machines configured to issue a lottery ticket to a player that indicates a pathway of selected game player positions on a predetermined grid, the pathway including all of the player's selected positions and being linear and continuous from a start grid position to a finish grid position;said server configured to randomly select at least one lottery position on said grid and to determine a winning outcome of the game based on a cumulative characteristic of the player positions in the pathway from the start grid position to the finish grid position prior to intersection of the pathway by the randomly selected lottery position on the grid wherein the cumulative characteristic is the number of player positions, revealed by the player in the pathway prior to intersection of the pathway by the randomly selected lottery position on the grid.
  • 2. The system of claim 1, wherein the player positions in the pathway have an equal value and said server is configured to determine the winning outcome based on the cumulative characteristic.
  • 3. The system of claim 2, wherein said server is configured to determine a maximum prize for a winning outcome when the pathway is not intersected by the randomly selected lottery position on the grid.
  • 4. The system of claim 1, wherein said server is configured to randomly select a plurality of lottery positions on the grid from a plurality of separate subsets of positions defined on said grid, wherein the number of subsets is equal to the number of randomly selected lottery positions, and only one position is selected from each of the subsets.
  • 5. The system of claim 1, wherein said server is configured to randomly assign player indicia to the player positions in the pathway, said gaming machines configured to display the player indicia on the lottery ticket issued to the player, the player indicia having varying values between different indicia.
  • 6. The system of claim 5, wherein said server is configured to determine a prize award for the winning game outcome based on a total value of the player indicia in the pathway prior to intersection of the pathway by the randomly selected lottery position on the grid.
  • 7. The system of claim 5, wherein the player indicia in the pathway prior to intersection of the pathway by the randomly selected lottery position on the grid constitute the player's entry to a draw game, said server configured to randomly generate a set of lottery indicia and compare the player's entry to the randomly generated set of lottery indicia to determine the winning outcome in the lottery game.
  • 8. The system of claim 1, wherein said server is configured to randomly select the at least one lottery grid position at the time of game entry, said game machines configured to indicate the lottery grid position on the lottery ticket issued to the player that also indicates the player's pathway of player positions.
  • 9. The method of claim 1, wherein said server is configured to randomly select the same at least one lottery grid position for multiple players subsequent to the players' entry in the game, wherein the lottery grid position is not indicated on the lottery ticket issued to the player that indicates the player's pathway of player positions.
CROSS REFERENCE TO RELATED APPLICATION

The present application is a Divisional Application from application Ser. No. 11/327,608, filed Jan. 6, 2006. The '608 application claims priority to U.S. Provisional Application No. 60/642,242, filed Jan. 7, 2005, the entirety of which is hereby incorporated herein by this reference.

US Referenced Citations (287)
Number Name Date Kind
1527929 Simons Feb 1925 A
3089123 Hennis et al. May 1963 A
3245697 Nugent Apr 1966 A
3699311 Dunbar Oct 1972 A
3736368 Vogelman et al. May 1973 A
3826499 Lenkoff Jul 1974 A
3868057 Chavez Feb 1975 A
3876865 Bliss Apr 1975 A
3902253 Sabuzawa et al. Sep 1975 A
3918174 Miller et al. Nov 1975 A
3922529 Orloff Nov 1975 A
3934120 Maymarev Jan 1976 A
4017834 Cuttill et al. Apr 1977 A
4095824 Bachman Jun 1978 A
4105156 Dethloff Aug 1978 A
4176406 Matkan Nov 1979 A
4191376 Goldman et al. Mar 1980 A
4194296 Pagnozzi et al. Mar 1980 A
4195772 Nishimura Apr 1980 A
4206920 Weatherford et al. Jun 1980 A
4241942 Bachman Dec 1980 A
4243216 Mazumder Jan 1981 A
4273362 Carrier et al. Jun 1981 A
4309452 Sachs Jan 1982 A
4313087 Weitzen et al. Jan 1982 A
4355300 Weber Oct 1982 A
4375666 Buck et al. Mar 1983 A
4398708 Goldman et al. Aug 1983 A
4407443 McCorkle Oct 1983 A
4451759 Heynisch May 1984 A
4455039 Weitzen et al. Jun 1984 A
4457430 Darling et al. Jul 1984 A
4464423 LaBianca et al. Aug 1984 A
4466614 Bachman et al. Aug 1984 A
4488646 McCorkle Dec 1984 A
4491319 Nelson Jan 1985 A
4494197 Troy et al. Jan 1985 A
4536218 Ganho Aug 1985 A
4544184 Freund et al. Oct 1985 A
4579371 Long et al. Apr 1986 A
4591189 Holmen et al. May 1986 A
4634149 Donovan Jan 1987 A
4665502 Kreisner May 1987 A
4669729 Solitt et al. Jun 1987 A
4689742 Troy et al. Aug 1987 A
4726608 Walton Feb 1988 A
4736109 Dvorzsak Apr 1988 A
4738473 Meloni et al. Apr 1988 A
4740016 Konecny et al. Apr 1988 A
4760247 Keane et al. Jul 1988 A
4763927 Schneider Aug 1988 A
4775155 Lees Oct 1988 A
4792667 Chen Dec 1988 A
4805907 Hagiwara Feb 1989 A
4817951 Crouch et al. Apr 1989 A
4835624 Black et al. May 1989 A
4836546 DiRe et al. Jun 1989 A
4836553 Suttle et al. Jun 1989 A
4837728 Barrie et al. Jun 1989 A
4856787 Itkis Aug 1989 A
4861041 Jones et al. Aug 1989 A
4870260 Niepolomski et al. Sep 1989 A
4880964 Donahue Nov 1989 A
4888964 Klinge Dec 1989 A
4922522 Scanlon May 1990 A
4943090 Fienberg Jul 1990 A
4960611 Fujisawa et al. Oct 1990 A
4961578 Chateau Oct 1990 A
4964642 Kamille Oct 1990 A
4996705 Entenmann et al. Feb 1991 A
4998010 Chandler et al. Mar 1991 A
4998199 Tashiro et al. Mar 1991 A
5032708 Comerford et al. Jul 1991 A
5037099 Burtch Aug 1991 A
5046737 Fienberg Sep 1991 A
5074566 Desbiens Dec 1991 A
5083815 Scrymgeour et al. Jan 1992 A
5092598 Kamille Mar 1992 A
5094458 Kamille Mar 1992 A
5100139 Di Bella Mar 1992 A
5109153 Johnsen et al. Apr 1992 A
5112050 Koza et al. May 1992 A
5116049 Sludikoff et al. May 1992 A
5118109 Gumina Jun 1992 A
5119295 Kapur Jun 1992 A
5158293 Mullins Oct 1992 A
5165967 Theno et al. Nov 1992 A
5186463 Marin et al. Feb 1993 A
5189292 Batterman et al. Feb 1993 A
5193815 Pollard Mar 1993 A
5193854 Borowski, Jr. et al. Mar 1993 A
5228692 Carrick et al. Jul 1993 A
5232221 Sludikoff et al. Aug 1993 A
5234798 Heninger et al. Aug 1993 A
5249801 Jarvis Oct 1993 A
5259616 Bergmann Nov 1993 A
5273281 Lovell Dec 1993 A
5276980 Carter et al. Jan 1994 A
5282620 Keesee Feb 1994 A
5308992 Crane et al. May 1994 A
5317135 Finocchio May 1994 A
5326104 Pease et al. Jul 1994 A
5332219 Marnell, II et al. Jul 1994 A
5342047 Heidel et al. Aug 1994 A
5342049 Wichinsky et al. Aug 1994 A
5344144 Canon Sep 1994 A
5346258 Behm et al. Sep 1994 A
5380007 Travis et al. Jan 1995 A
5393057 Marnell, II et al. Feb 1995 A
5401024 Simunek Mar 1995 A
5403039 Borowski, Jr. et al. Apr 1995 A
5407199 Gumina Apr 1995 A
5411260 Smith May 1995 A
5420406 Izawa et al. May 1995 A
5432005 Tanigami et al. Jul 1995 A
5451052 Behm et al. Sep 1995 A
5453602 Hanada Sep 1995 A
5456465 Durham Oct 1995 A
5471040 May Nov 1995 A
5475205 Behm et al. Dec 1995 A
5486005 Neal Jan 1996 A
5513846 Niederlein et al. May 1996 A
5528154 Leichner et al. Jun 1996 A
5536016 Thompson Jul 1996 A
5540442 Orselli et al. Jul 1996 A
5548110 Storch et al. Aug 1996 A
5550746 Jacobs Aug 1996 A
5560610 Behm et al. Oct 1996 A
5564700 Celona Oct 1996 A
5564977 Algie Oct 1996 A
5591956 Longacre, Jr. et al. Jan 1997 A
5599046 Behm et al. Feb 1997 A
5602381 Hoshino et al. Feb 1997 A
5621200 Irwin et al. Apr 1997 A
5628684 Bouedec May 1997 A
5630753 Fuchs May 1997 A
5651735 Baba Jul 1997 A
5655961 Acres et al. Aug 1997 A
5667250 Behm et al. Sep 1997 A
5682819 Beaty Nov 1997 A
5690366 Luciano Nov 1997 A
5704647 Desbiens Jan 1998 A
5722891 Inoue Mar 1998 A
5726898 Jacobs Mar 1998 A
5732948 Yoseloff Mar 1998 A
5741183 Acres et al. Apr 1998 A
5743800 Huard et al. Apr 1998 A
5752882 Acres et al. May 1998 A
5756220 Hoshino et al. May 1998 A
5768142 Jacobs Jun 1998 A
5769458 Carides et al. Jun 1998 A
5770533 Franchi Jun 1998 A
5772509 Weiss Jun 1998 A
5772510 Roberts Jun 1998 A
5772511 Smeltzer Jun 1998 A
RE35864 Weingardt Jul 1998 E
5779840 Boris Jul 1998 A
5789459 Inagaki et al. Aug 1998 A
5791990 Schroeder et al. Aug 1998 A
5797794 Angell Aug 1998 A
5803504 Deshiens et al. Sep 1998 A
5816920 Hanai Oct 1998 A
5818019 Irwin, Jr. et al. Oct 1998 A
5820459 Acres et al. Oct 1998 A
5823874 Adams Oct 1998 A
5830063 Byrne Nov 1998 A
5830066 Goden et al. Nov 1998 A
5830067 Graves et al. Nov 1998 A
5833537 Barrie Nov 1998 A
5835576 Katz et al. Nov 1998 A
5836086 Elder Nov 1998 A
5836817 Acres et al. Nov 1998 A
5848932 Adams Dec 1998 A
5863075 Rich et al. Jan 1999 A
5871398 Schneier et al. Feb 1999 A
5876284 Acres et al. Mar 1999 A
5882261 Adams Mar 1999 A
5883537 Luoni et al. Mar 1999 A
5885158 Torango et al. Mar 1999 A
5887906 Sultan Mar 1999 A
5903340 Lawandy et al. May 1999 A
5911418 Adams Jun 1999 A
5915588 Stoken et al. Jun 1999 A
5934671 Harrison Aug 1999 A
5935002 Falciglia Aug 1999 A
5970143 Schneier et al. Oct 1999 A
5979894 Alexoff Nov 1999 A
5996997 Kamille Dec 1999 A
5997044 Behm et al. Dec 1999 A
6003307 Naber et al. Dec 1999 A
6004207 Wilson, Jr. et al. Dec 1999 A
6007162 Hinz et al. Dec 1999 A
6012982 Piechowiak et al. Jan 2000 A
6014032 Maddix et al. Jan 2000 A
6017032 Grippo et al. Jan 2000 A
6024641 Sarno Feb 2000 A
6053405 Irwin, Jr. et al. Apr 2000 A
6077162 Weiss Jun 2000 A
6080062 Olson Jun 2000 A
6086477 Walker et al. Jul 2000 A
6089978 Adams Jul 2000 A
6099407 Parker, Jr. et al. Aug 2000 A
6102400 Scott et al. Aug 2000 A
6107913 Gatto et al. Aug 2000 A
6119364 Elder Sep 2000 A
6125368 Bridge et al. Sep 2000 A
6142872 Walker et al. Nov 2000 A
6146272 Walker et al. Nov 2000 A
6149521 Sanduski Nov 2000 A
6155491 Dueker et al. Dec 2000 A
6168521 Luciano et al. Jan 2001 B1
6168522 Walker et al. Jan 2001 B1
6176487 Eklund et al. Jan 2001 B1
6179710 Sawyer et al. Jan 2001 B1
6203430 Walker et al. Mar 2001 B1
6206373 Garrod Mar 2001 B1
6210275 Olsen Apr 2001 B1
6217448 Olsen Apr 2001 B1
6220596 Horan Apr 2001 B1
6220961 Keane et al. Apr 2001 B1
6224055 Walker et al. May 2001 B1
6227969 Yoseloff May 2001 B1
6238288 Walker et al. May 2001 B1
6309300 Glavich Oct 2001 B1
6312334 Yoseloff Nov 2001 B1
6315291 Moody Nov 2001 B1
6330976 Dymetman et al. Dec 2001 B1
6331143 Yoseloff Dec 2001 B1
6334814 Adams Jan 2002 B1
6340158 Pierce et al. Jan 2002 B2
6368213 McNabola Apr 2002 B1
6375568 Roffman et al. Apr 2002 B1
6379742 Behm et al. Apr 2002 B1
6394899 Walker et al. May 2002 B1
6398214 Moteki et al. Jun 2002 B1
6398643 Knowles et al. Jun 2002 B1
6398644 Perrie et al. Jun 2002 B1
6398645 Yoseloff Jun 2002 B1
6416408 Tracy et al. Jul 2002 B2
6419579 Bennett Jul 2002 B1
6435408 Irwin, Jr. et al. Aug 2002 B1
6435500 Gumina Aug 2002 B2
6478677 Moody Nov 2002 B1
6491215 Irwin, Jr. et al. Dec 2002 B1
6497408 Walker et al. Dec 2002 B1
6514144 Riendeau et al. Feb 2003 B2
6552290 Lawandy Apr 2003 B1
6588747 Seelig Jul 2003 B1
6599186 Walker et al. Jul 2003 B1
6601772 Rubin et al. Aug 2003 B1
6637747 Garrod Oct 2003 B1
6645071 Perrie et al. Nov 2003 B2
6648735 Miyashita et al. Nov 2003 B2
6648753 Tracy et al. Nov 2003 B1
6648755 Luciano et al. Nov 2003 B1
6676126 Walker et al. Jan 2004 B1
6692354 Tracy et al. Feb 2004 B2
6702047 Huber Mar 2004 B2
6773345 Walker et al. Aug 2004 B2
6776337 Irwin, Jr. et al. Aug 2004 B2
6786824 Cannon Sep 2004 B2
6823874 Lexcen Nov 2004 B2
6855055 Perrie et al. Feb 2005 B2
6875105 Behm et al. Apr 2005 B1
6929186 Lapstun Aug 2005 B2
6988948 Perrie et al. Jan 2006 B2
20010027130 Namba et al. Oct 2001 A1
20010030978 Holloway et al. Oct 2001 A1
20010034262 Banyai Oct 2001 A1
20010040345 Au-Yeung Nov 2001 A1
20020022511 Eklund et al. Feb 2002 A1
20020082071 Riendeau et al. Jun 2002 A1
20020084335 Ericson Jul 2002 A1
20020171201 Au-Yeung Nov 2002 A1
20020187825 Tracy et al. Dec 2002 A1
20030050109 Caro et al. Mar 2003 A1
20030114210 Meyer et al. Jun 2003 A1
20040036212 Walker et al. Feb 2004 A1
20040076310 Hersch et al. Apr 2004 A1
20040173965 Stanek Sep 2004 A1
20040178579 Lowell et al. Sep 2004 A1
20040178582 Garrod Sep 2004 A1
20040185931 Hartman et al. Sep 2004 A1
20040204222 Roberts Oct 2004 A1
20040229674 Thomas Nov 2004 A1
20040259631 Katz et al. Dec 2004 A1
20040266514 Penrice Dec 2004 A1
Foreign Referenced Citations (61)
Number Date Country
529535 Jun 1983 AU
529536 Jun 1983 AU
B-1842892 Dec 1992 AU
B-2107092 Jul 1993 AU
A-5032796 Feb 1997 AU
B-5249996 Feb 1997 AU
199716432 Sep 1997 AU
A-4540397 Apr 1998 AU
A-6355398 Oct 1998 AU
2938307 Apr 1981 DE
3035898 Apr 1982 DE
3035947 May 1982 DE
2938307 Jun 1982 DE
29803107 Aug 1988 DE
3822636 Jan 1990 DE
2938307 Aug 1990 DE
3822636 Jan 1992 DE
3415114 Oct 1995 DE
19646956 May 1998 DE
19706286 May 1998 DE
29816453 Apr 1999 DE
19751746 May 1999 DE
0122902 Apr 1984 EP
0333934 Sep 1989 EP
0458623 Nov 1991 EP
0798676 Oct 1997 EP
0799649 Oct 1997 EP
0149712 Jul 1998 EP
0874337 Oct 1998 EP
0896304 Feb 1999 EP
0914875 May 1999 EP
0919965 Jun 1999 EP
0983801 Mar 2000 EP
0983801 Mar 2001 EP
1149712 Oct 2001 EP
2006400 Apr 1989 ES
2006401 Apr 1989 ES
642892 Sep 1950 GB
1495121 Dec 1977 GB
2075918 Nov 1981 GB
2222712 Mar 1990 GB
2230373 Oct 1990 GB
2295775 Dec 1996 GB
3328311 Feb 1999 GB
23282311 Feb 1999 GB
2 383 544 Jul 2003 GB
02235744 Sep 1990 JP
04132672 May 1992 JP
WO8502250 May 1985 WO
WO9117529 Nov 1991 WO
WO 9803910 Jan 1998 WO
WO 9840138 Sep 1998 WO
WO 9909364 Feb 1999 WO
WO 9926204 May 1999 WO
WO 9939312 Aug 1999 WO
WO0000256 Jan 2000 WO
WO0078418 Dec 2000 WO
WO0174460 Nov 2001 WO
WO0193966 Dec 2001 WO
WO02056266 Jul 2002 WO
WO 02087713 Nov 2002 WO
Related Publications (1)
Number Date Country
20100273548 A1 Oct 2010 US
Provisional Applications (1)
Number Date Country
60642242 Jan 2005 US
Divisions (1)
Number Date Country
Parent 11327608 Jan 2006 US
Child 12762754 US