Patent Publication Number: US-2013237304-A1

Title: Systems and methods for second chance games

Description:
REFERENCE TO RELATED APPLICATIONS 
     This patent application is a Continuation-In-Part Application of U.S. patent application Ser. No. 13/460,201, filed Apr. 30, 2012, entitled “Systems and Methods for Map-Based Game.” This patent application is also a Continuation-In-Part Application of U.S. patent application Ser. No. 13/189,248, filed Jul. 22, 2011, entitled “Systems and Methods for Prize Discovery Games.” This patent application is also a Continuation-In-Part Application of U.S. patent application Ser. No. 12/180,163, filed on Jul. 25, 2008, entitled “Systems and Methods for Lottery-Style Games.” All of these prior applications are incorporated by reference in their entireties. 
    
    
     FIELD OF THE INVENTION 
     Embodiments of the present invention relate generally to games of chance. More specifically, the present invention relates to systems and methods for lottery-style games. 
     BACKGROUND OF THE INVENTION 
     Lottery is a popular game of chance in which a number of players contribute to form a jackpot that is later awarded, wholly or partially, to one or more winners. The participating players pay money or contribute other things of value in exchange for lottery tickets. Typically, each lottery ticket bears a combination of numbers or other symbols, and a winning ticket has to at least partially match a randomly generated set of numbers or symbols. In a properly operated lottery game, any one of the outstanding lottery tickets could be selected in a random drawing as a winning ticket, entitling its holder to some or all of the jackpot prize. 
     Sweepstakes in United States may be considered one special type of lottery games which are free to enter and are typically sponsored by merchants for promotional marketing purposes. In United Kingdom, a sweepstake is technically a lottery game in which the prize is financed through the tickets sold. Small-scale sweepstakes among private parties (e.g., colleagues and classmates) may also be considered lottery games which are often related to ongoing sports events. 
     Lottery games come in different formats. For example, the jackpot of a lottery game may be either a fixed cash amount or a certain percentage of ticket revenue. The combination of numbers on each lottery ticket could be a unique one, or each player may be allowed to select his or her own lucky numbers, making it possible for multiple tickets to share a same combination. Lottery games can be played either online or offline. The most popular lottery games, such as Powerball™, Mega Millions™, and Euro Millions™, are mostly paper-based, requiring the purchase of actual tickets, although some are now starting to open to online participants. A few lottery games can be played completely online. That is, instead of purchasing a paper ticket and filling in desired numbers with a pencil, an online player can purchase an electronic (or virtual) lottery ticket and select a desired combination via a web interface such as an Internet browser. 
     In all traditional lottery games, lottery tickets are sold in predetermined, fixed denominations, for example, one dollar per ticket. Accordingly, one winning ticket will entitle its holder to an entire unit of a corresponding winning prize. Proportional value lottery games have been proposed, for example, in U.S. Pat. Nos. 6,296,569 and 7,351,142, but none appears to have been commercially implemented. Both of those patents describe the issuance of proportional denomination lottery tickets, online or at a point of sale (POS). For example, in any transaction involving change under a dollar, the change can be converted to a proportional denomination share of a full-unit (one-dollar) lottery ticket. If the full-unit lottery ticket is qualified for a prize, the holder of the proportional denomination ticket will be entitled to a fraction of the prize. For instance, if a one-dollar ticket matching all the winning numbers would entitle its holder to a jackpot amount, then a 25-cent proportional ticket entitles its holder to 25% of the jackpot. 
     All the existing types of lottery games appear to share a few common characteristics. First, they all have to issue some kind of lottery tickets, whether paper or electronic, full-denomination or proportional. The purposes for issuing lottery tickets are two-fold. The tickets bear numerical combinations or patterns to be compared to the randomly generated winning combination or pattern. The tickets also serve as proof of participation in the lottery games. However, the entire mechanism of generating, drawing, and matching tickets could impose significant overhead costs on the operation of lottery games. 
     Second, participation in traditional lottery games depends heavily on player impulse or enthusiasm, which causes ticket revenue to fluctuate. Except for a handful of gambling fanatics, most people only purchase lottery tickets occasionally. A loss in one game might cause an ordinary player to stop playing for a while. Also, public sentiment towards a lottery game often varies with the amount of jackpot prize available at the time. There seems to be a general belief that a one-dollar ticket somehow has a better chance of winning when the jackpot reaches several million dollars or more. At the very least, the nature of the game is such that the economic utility to the player of participating is not determined solely by the probability of winning the jackpot nor the expected return on playing; rather the higher the jackpot the greater the excitement of playing—i.e. this is a motivator to play. Similarly, the greater the chance of winning a small prize, the higher likelihood that players will repeatedly play. This is in part because winning even a small prize reinforces in the player&#39;s mind the possibility of winning the jackpot and in part because a game most players never won any prize at all would be perceived as unfair or boring. Therefore, when the total jackpot snowballs into an unusually large amount, the public often become increasingly interested in the game. Once the jackpot is won, a period of stagnation typically follows the news-generating big win. For all these reasons, ticket revenues from traditional lottery games tend to swing with time and seldom generate a steady cash flow. 
     Third, players in a traditional lottery game have no direct or perceivable incentive for bringing more players into the game. Theoretically, an existing player may be indirectly benefited if more players join the lottery game, because the increased participation will increase the size of jackpot the existing player could potentially win. However, other than in very small games, that potential benefit may not be tangible enough to encourage referrals of additional players. In addition, the existing player&#39;s chance of winning does not increase with the number of new players. 
     Furthermore, traditional lottery games including sweepstakes are pure games of chance and typically do not require any player skill or strategy. Every player&#39;s chance of winning is only affected by the number of lottery tickets he or she buys. One player&#39;s chance of winning is independent of another player&#39;s chance of winning. As a result, there tends to be very little interaction among lottery participants. 
     In view of the foregoing, it may be understood that there are significant problems and shortcomings associated with traditional lottery games. 
     SUMMARY OF THE INVENTION 
     Systems and methods for lottery-style games are disclosed. In one particular exemplary embodiment, a computer-implemented method for lottery-style games may comprise: establishing a map-based game that is scheduled to have a number of lottery drawings associated with a plurality of grid units on a map; accepting enrollment of a plurality of players in the map-based game, each player being associated with at least one grid unit on the map and being committed to participate in a plurality of the lottery drawings by contributing tokens of value; receiving, from each player, a designated number of tokens to be contributed, on behalf of each of the at least one grid unit, to each of the plurality of the lottery drawings said player is committed to participate in; and executing the map-based game by doing the following for each lottery drawing: pooling tokens which are contributed to said lottery drawing on behalf of grid units participating in said lottery drawing, together with tokens carried over from one or more previous lottery drawings, if any, to form a jackpot for said lottery drawing, and conducting a drawing, from said grid units participating in said lottery drawing, to select at least one first grid unit to win a first prize. In addition, one or more second grid units may be selected to win lesser prizes, the selection being based on relative map positions of the one or more second grid units with respect to the at least one first grid unit. 
     In another particular exemplary embodiment, a system for lottery-style games may comprise: a processor; at least one storage device coupled to the processor; a user interface coupled to the processor via one or more communication networks; wherein the processor is adapted to communicate with the at least one storage device and the user interface to execute instructions to perform the following tasks: establishing a map-based game that is scheduled to have a number of lottery drawings associated with a plurality of grid units on a map; accepting enrollment of a plurality of players in the map-based game, each player being associated with at least one grid unit on the map and being committed to participate in a plurality of the lottery drawings by contributing tokens of value; receiving, from each player, a designated number of tokens to be contributed, on behalf of each of the at least one grid unit, to each of the plurality of the lottery drawings said player is committed to participate in; and executing the map-based game by doing the following for each lottery drawing: pooling tokens which are contributed to said lottery drawing on behalf of grid units participating in said lottery drawing, together with tokens carried over from one or more previous lottery drawings, if any, to form a jackpot for said lottery drawing, and conducting a drawing, from said grid units participating in said lottery drawing, to select at least one first grid unit to win a first prize. 
     One technical effect of the systems and methods of the present invention is that they facilitate more efficient and more entertaining implementation of lottery-style games on modern computers and communications systems. Another technical effect of the systems and methods of the present invention lies in the specialized computer devices and/or gaming kiosks that may be configured and deployed to carry out the lottery-style games disclosed herein. 
     The present invention will now be described in more detail with reference to exemplary embodiments thereof as shown in the accompanying drawings. While the present invention is described below with reference to exemplary embodiments, it should be understood that the present invention is not limited thereto. Those of ordinary skill in the art having access to the teachings herein will recognize additional implementations, modifications, and embodiments, as well as other fields of use, which are within the scope of the present invention as described herein, and with respect to which the present invention may be of significant utility. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       In order to facilitate a fuller understanding of the present invention, reference is now made to the accompanying drawings, in which like elements are referenced with like numerals. These drawings should not be construed as limiting the present invention, but are intended to be exemplary only. 
         FIG. 1  is a flow chart illustrating an exemplary method of facilitating lottery-style games in accordance with one embodiment of the present invention. 
         FIG. 2  illustrates the flow of tokens from the perspective of a lottery game operator in accordance with one embodiment of the present invention. 
         FIG. 3  illustrates the flow of tokens from the perspective of a player in a lottery game in accordance with one embodiment of the present invention. 
         FIG. 4  is a block diagram illustrating an exemplary system for facilitating lottery-style games in accordance with one embodiment of the present invention. 
         FIG. 5  is a block diagram illustrating exemplary software and data-storage modules for facilitating lottery-style games in accordance with one embodiment of the present invention. 
         FIG. 6  shows a grid map for an exemplary GeoSweep game in accordance with one embodiment of the present invention. 
         FIGS. 7A-B  illustrate an exemplary payout structure in an exemplary GeoSweep game in accordance with one embodiment of the present invention. 
         FIG. 8  illustrates an alternative payout structure in an exemplary GeoSweep game in accordance with one embodiment of the present invention. 
         FIG. 9  illustrates another alternative payout structure in an exemplary GeoSweep game in accordance with one embodiment of the present invention. 
         FIG. 10  illustrates an alternative method of establishing a grid or land boundaries in an exemplary GeoSweep game in accordance with one embodiment of the present invention. 
         FIG. 11  illustrates another alternative method of establishing a grid or land boundaries in an exemplary GeoSweep game in accordance with one embodiment of the present invention. 
         FIG. 12  is a flow chart illustrating an exemplary method of facilitating a sweepstakes-style game in accordance with one embodiment of the present invention. 
         FIG. 13  is a block diagram illustrating an exemplary system for facilitating sweepstakes-style games in accordance with one embodiment of the present invention. 
         FIG. 14  illustrates an exemplary user interface of one embodiment of the system containing advertisement. 
         FIG. 15  illustrates an exemplary user interface of one embodiment of the system containing a different manner of presenting advertisement. 
         FIG. 16  illustrates an exemplary user interface of one embodiment of the system containing advertisement in various grid units. 
         FIG. 17  illustrates an exemplary user interface of one embodiment of the system containing presenting advertisement in a map of real world locations. 
         FIG. 18  is a flow chart illustrating an exemplary method of facilitating a prize-searching style game using predetermined play in accordance with one embodiment of the present invention. 
         FIG. 19  is a flow chart illustrating an exemplary method of facilitating a prize-searching style game using dynamic play in accordance with one embodiment of the present invention. 
         FIG. 20  is a flow chart illustrating an exemplary probability algorithm in accordance with one embodiment of the present invention. 
         FIG. 21  is a flow chart illustrating an exemplary probability algorithm used in a game containing tiers of prizes in accordance with one embodiment of the present invention. 
         FIG. 22  is a block diagram illustrating an exemplary system for facilitating treasure hunt game according to one embodiment of the present invention. 
         FIG. 23  illustrates an exemplary user interface of one embodiment of the system containing information about the number of tiers for each grid unit in accordance with one embodiment of the present invention. 
         FIG. 24  illustrates an exemplary user interface of one embodiment of the system that contains a map with grid units that offers clues to players of the game in accordance with one embodiment of the present invention. 
         FIG. 25  illustrates one exemplary machine that is used at retail locations in accordance with one embodiment of the present invention. 
         FIG. 26  illustrates another alternative payout structure in an exemplary GeoSweep game in accordance with one embodiment of the present invention. 
         FIG. 27  illustrates yet another alternative payout structure in an exemplary GeoSweep game in accordance with one embodiment of the present invention. 
         FIG. 28  illustrates an exemplary embodiment of the lottery-style game in a casino or terminal style setting in accordance with one embodiment of the present invention. 
         FIG. 29  is a flow chart illustrating an exemplary method of facilitating casino-based lottery-style games in accordance with one embodiment of the present invention. 
         FIG. 30  shows a map for an exemplary GeoSweep gameboard in accordance with one embodiment of the present invention. 
         FIG. 31  shows another map for an exemplary GeoSweep gameboard in accordance with one embodiment of the present invention. 
         FIG. 32  shows yet another map for an exemplary GeoSweep gameboard in accordance with one embodiment of the present invention. 
         FIG. 33  is a flow chart illustrating the implementation of an exemplary second chance game system in accordance with one embodiment of the present invention. 
         FIG. 34A  depicts an exemplary scratch ticket  3401  and an exemplary screen  3410  showing a computer-based second chance game in accordance with one embodiment of the present invention. 
         FIG. 34B  depicts another exemplary scratch ticket  3400  in accordance with an embodiment of the present invention. 
         FIG. 35  is a flow chart illustrating an exemplary method for providing a second chance game in accordance with one embodiment of the present invention. 
     
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     Referring to  FIG. 1 , there is shown a flow chart illustrating an exemplary method of facilitating lottery-style games in accordance with one embodiment of the present invention. 
     In step  102 , a lottery game may be set up. The lottery game may be an ongoing one that is scheduled to have a plurality of lottery drawings over a period of time. For example, the lottery drawings may occur on a periodic basis, such as once every hour, one or more times every calendar day or every business day, one or more times every week, or a predetermined number of times per month or year. As the lottery game is set up, a set of rules, terms and conditions may be published or otherwise communicated to potential participants. The rules may define how the lottery game is operated and how the lottery drawings are conducted, as well as calculation and payout of prizes, as will be described in more detail below. The terms and conditions may specify rights and obligations of persons participating in the lottery game and lottery drawings. 
     In preferred embodiments of the present invention, the lottery game is established online and accessible via an Internet website. The lottery game may also be implemented in connection with one or more social networking websites, such as Facebook™, MySpace™, or LinkedIn™. Alternatively, the lottery game may also be implemented in connection with one or more virtual reality games such as Second Life™ or other multi-player video games. The lottery game may be either an add-on or an integrated part of an associated website, wherein participation in the lottery game may enhance a player&#39;s experience at the associated website or vice versa. According to some embodiments, the lottery game and lottery drawings may be implemented at least partially offline, without requiring every participant to have computer or Internet access. 
     In step  104 , players may be enrolled in the lottery game. Each person wishing to join the lottery game may be required to make a commitment to participate in a number of the scheduled lottery drawings. In one exemplary enrollment process, a player may (a) manifest consent to the set of rules, terms and conditions established in the lottery game and (b) deposit or pledge some amount of money or other things of value to be contributed to the game. The amount of initial deposit or pledge may depend on such factors as how many lottery drawings the player is obligated to participate in, how much wager the player is to enter for each drawing, the player&#39;s credit ratings, and so on. 
     Enrollment of players may be taken via a web interface, by mail, or through other communication means. When the lottery game is implemented in connection with a social networking website or other membership sites, enrollment in the lottery game may be simplified with the existing membership information. Alternatively, the lottery game operator, administrator, or personnel may receive and approve enrollment in person. In some instances, new players may join through referrals and/or gift membership. 
     In step  106 , each enrolled player may be assigned one or more unique identifiers. Each player identifier (or player ID) may be a text string, a serial number, or other symbols. According to one embodiment, each player ID may be associated with a “Lucky Star” of the player&#39;s choice. According to some embodiments, each player ID may comprise a machine readable portion (e.g., an alphanumeric string) and a human recognizable portion (e.g., a logo, icon or catch phrase). For a player, one of the assigned player IDs may be used as a username for logging into an Internet-based lottery game. Or, the player may choose a different username to log in but is still able to manage multiple player IDs assigned to that player. The assigned player IDs may be imprinted or encoded on a membership card. 
     In the drawings or games described herein, each registered player can participate with one or multiple player IDs. When participating with multiple player IDs, the rules regarding each of the multiple player IDs are the same as if each player ID is owned and controlled by a single player. For ease of illustration, it is assumed in the following description that each player participates with a single player ID. 
     In step  108 , each player may designate the number of tokens to enter for each drawing. That is, with respect to each lottery drawing the player is committed to participate in, the player may specify a wager amount that is typically measured in the number of tokens. As used herein, a “token” may be or represent any physical or virtual thing of value that can be counted or quantified. For example, a token may be or represent one or more units of cash or credit. Or, a token may be or represent one or more points that are exchangeable for things of value. According to one embodiment of the present invention, one token may be the equivalent of one cent ( 1/100 of a dollar). According to another embodiment, one token may be or represent one value point that may be used to exchange for music downloads, cell phone ring-tones, or for other online or in-store purchases. According to yet another embodiment, one token may represent one unit of a game score in an online video game or a virtual society. According to still another embodiment, one token may be or can be exchanged for one or more units of mobile telephone airtime or long-distance telephone minutes. 
     The players may purchase tokens with their initial deposits. They may set up electronic fund transfers and/or automatic credit card payments to refill their accounts with tokens. A player&#39;s account may be replenished automatically as soon as its balance falls below a preset lower limit. Apart from winning or purchasing refills, the players may alternatively or additionally obtain tokens through bartering or by engaging in certain activities. For example, a player may exchange credit card cash-back bonus points for tokens. The player may also take part in online surveys, view online advertisements, or increase activity level at social networking or blogger websites to earn tokens. 
     The number of tokens designated for each lottery drawing should typically fall within a certain range. For lottery drawings that take place on a daily basis, for example, there may be a daily minimum and a daily maximum for the number of tokens a player can contribute per player ID. According to one embodiment of the present invention, the daily minimum may be one token (e.g., one cent or one pence) and the daily maximum may be one hundred tokens (e.g., one dollar or one pound). The number of tokens that a player designates for each drawing may be any of a fixed value between and including the daily minimum and the daily maximum. Alternatively, the player may configure the daily wager to be a variable amount. To have a minimal level of participation in the lottery game (thus a more predictable revenue from the game), the game system may be configured to prevent players from lowering their preset daily wager amount for any upcoming drawings. 
     For each lottery drawing, a jackpot prize may be formed, in step  110 , from two sources: (a) tokens contributed by players who participate in that drawing, and (b) tokens carried over from one or more previous drawings, if available. Tokens from the two sources may be pooled together into one jackpot. The jackpot (or a portion thereof) may account for a maximum payable amount for a winner of that lottery drawing. 
     In step  112 , a random drawing from the player IDs may be conducted to select at least one winner. Note that the word “random” does not require randomness in the most rigorous statistical sense as such randomness is difficult to achieve. Instead, the word “random” implies a fair drawing process that does not appear to favor any one player more than any other player. The random (fair) drawing from the player IDs may be achieved in a number of computational methods as are well known in the gaming industry. According to some embodiments of the present invention, a single winner may be selected for each lottery drawing. According to some alternative embodiments, two or more winners may be selected for each drawing and they may share a prize fund on equal footings or according to an award hierarchy. 
     Then, in step  114 , a proportional value may be calculated based on the number of tokens the selected winner(s) contributed versus the maximum number allowed per player ID. Assuming there is only one selected winner, the proportional value (F) may be calculated by dividing the number of tokens the winner contributed (n) with the maximum number a player is allowed to contribute (M) to that individual lottery drawing. That is— 
     
       
         
           
             F 
             = 
             
               n 
               M 
             
           
         
       
     
     If there are multiple winners, the proportional value may be calculated for each winner. For example, if a selected winner contributed the maximum number of tokens for that lottery drawing, the proportional value for that winner would be one (1) or 100%. If the selected winner contributed half of the maximum number of tokens allowed, the proportional value would be ½ or 50%. The proportional value calculated in this step may be represented with either a fraction or a percentage. 
     In step  116 , a fraction of the jackpot (or maximum payable prize) may be provided to the selected winner(s) according to the proportional value calculated in step  114  above. That is, whatever the full prize amount (P) a winner might have been entitled to had he or she contributed the maximum number of tokens (M), the actual payout amount (p) may be reduced to a fraction of that full prize amount in proportion to the number of tokens contributed (n). That is— 
     
       
         
           
             p 
             = 
             
               
                 F 
                 × 
                 P 
               
               = 
               
                 
                   n 
                   M 
                 
                 × 
                 P 
               
             
           
         
       
     
     The same proportional payout rule applies to single-winner as well as multiple-winner scenarios. The actual payout may be made by depositing tokens into a winner&#39;s account in the game system. Alternatively, the winner may receive the prize in the form of cash, points, airtime or long-distance minutes, other things of value, or a combination thereof. Other payout arrangements are also possible. 
     In step  118 , the remainder of the jackpot prize may be rolled over to a next drawing. Unless one or more selected winners happen to have wagered the maximum number of tokens and therefore won the entire jackpot, there would always be some remaining jackpot to add to the jackpot of the next drawing. In addition, the enrollment rule ensures continuous participation in the ongoing lottery drawings. As a result, the jackpot may quickly snowball into a large amount, further increasing players&#39; interest in the game. 
     For business advantages, it may be preferable to set the maximum number of tokens that each player ID can contribute to each drawing at a relatively low value. For example, if the daily maximum that can be entered for a daily drawing is one dollar, a player can contribute as little as one cent but never more than one dollar. The player will not feel any significant financial impact or burden to continue playing the lottery game for many drawing days. By wagering the equivalent of pocket change on a daily basis, the player may still enjoy a decent chance of winning a substantial amount of money. 
       FIG. 2  illustrates the flow of tokens from the perspective of a lottery game operator in accordance with one embodiment of the present invention. For ease of illustration, it will be assumed that lottery drawings in the lottery game occur on a daily basis. On each drawing day, a pie chart  202  represents a jackpot prize and sources thereof, whereas a pie chart  204  represents the same jackpot prize (but shown separately for clarity) and disbursement therefrom. The pie chart  202  indicates that a first portion of the present drawing day&#39;s jackpot include tokens carried over from one or more previous drawing days. The pie chart  202  also indicates that second portion of the jackpot include tokens contributed by individual players for the current drawing. The pie chart  204  indicates that at least a fraction of the jackpot prize may be paid out to a winner of the day. Assuming there is a single winner and that player contributed 40 tokens out of the maximum 100 allowed, 40% of the jackpot prize may be paid out to the winner. In that case, the remaining 60% of the jackpot may be rolled over to a next drawing day. 
       FIG. 3  illustrates the flow of tokens from the perspective of a player in a lottery game in accordance with one embodiment of the present invention. The exemplary player, Player K, may be committed to participate in N lottery drawings occurring on N consecutive days, wherein N is an integer greater than one. The bucket of dollar-sign tokens represents an account balance for Player K. Player K may have started with a “full bucket” of tokens that were purchased upon enrollment. As described earlier, Player K may designate one or more tokens to be contributed to each daily drawing. The number of tokens designated may be constant or may vary day-to-day. As drawing days go by, unless Player K wins in one or more lottery drawings, Player K&#39;s account may be slowly depleted and may have to be replenished. If Player K happens to be picked as a winner in one of the drawings, the proportional payout from that drawing may also replenish Player K&#39;s account to some extent. 
     According to one embodiment of the present invention, Player K may also enjoy another source of tokens—referral rewards. In order to encourage Player K to refer additional players to join the lottery game, Player K may be awarded a number of tokens for each new player brought into the game. The referral rewards may be simply deposited into Player K&#39;s account. Alternatively, the referral rewards may be automatically entered into daily drawings on behalf of Player K and in addition to Player K&#39;s own contribution to the daily drawings. For example, for each new player that Player K received, one or more tokens may be added to Player K&#39;s daily wager amount. These additional tokens may be awarded to Player K as long as the newly referred player remains an active participant in the lottery drawings. Furthermore, the amount of referral rewards may be linked to activity level of the new player referred. 
       FIG. 4  is a block diagram illustrating an exemplary system  400  for facilitating lottery-style games in accordance with one embodiment of the present invention. 
     The system  400  may be or include a computer system. This embodiment of the present invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. A series of programmable instructions may be stored in a computer-readable medium performing the lottery-style gaming functions disclosed herein and to achieve technical effects in accordance with the disclosure. More exemplary software and data-storage modules will be described below in connection with  FIG. 5 . 
     The lottery-style games described herein may be entered into and/or played at one or more game terminals or kiosks on or near the premises of a casino, a department store, a shopping mall, or other suitable commercial sites. For example, potential participants in a lottery-style game might be limited by laws which prohibit online wagering with payment cards. It may be beneficial for those participants to visit, or have someone else visit on their behalf, a commercial outlet with above-mentioned game terminals or kiosks where they can lawfully register and/or play the lottery-style games. Once a player has registered and funded his/her membership, he/she may continue monitoring the daily progress of the game via Internet or other communication means. As needed, the player may occasionally re-visit the game terminals or kiosks to re-fill accounts associated with his/her player IDs. 
     Those skilled in the art will appreciate that the invention may be practiced with various computer system configurations, including hand-held wireless devices such as mobile phones or personal digital assistants (PDAs), multiprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, and the like. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices. 
     The computer system may include a general purpose computing device in the form of a computer including a processing unit, a system memory, and a system bus that couples various system components including the system memory to the processing unit. 
     Computers typically include a variety of computer readable media that can form part of the system memory and be read by the processing unit. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. The system memory may include computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) and random access memory (RAM). A basic input/output system (BIOS), containing the basic routines that help to transfer information between elements, such as during start-up, is typically stored in ROM. RAM typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit. The data or program modules may include an operating system, application programs, other program modules, and program data. The operating system may be or include a variety of operating systems such as Microsoft Windows® operating system, the Unix operating system, the Linux operating system, the Xenix operating system, the IBM AIX™ operating system, the Hewlett Packard UX™ operating system, the Novell Netware™ operating system, the Sun Microsystems Solaris™ operating system, the OS/2™ operating system, the BeOS™ operating system, the Macintosh™® operating system, the Apache™ operating system, an OpenStep™ operating system or another operating system of platform. 
     At a minimum, the memory includes at least one set of instructions that is either permanently or temporarily stored. The processor executes the instructions that are stored in order to process data. The set of instructions may include various instructions that perform a particular task or tasks, such as those shown in the appended flowcharts. Such a set of instructions for performing a particular task may be characterized as a program, software program, software, engine, module, component, mechanism, or tool. The system  400  may include a plurality of software processing modules stored in a memory as described above and executed on a processor in the manner described herein. The program modules may be in the form of any suitable programming language, which is converted to machine language or object code to allow the processor or processors to read the instructions. That is, written lines of programming code or source code, in a particular programming language, may be converted to machine language using a compiler, assembler, or interpreter. The machine language may be binary coded machine instructions specific to a particular computer. 
     Any suitable programming language may be used in accordance with the various embodiments of the invention. Illustratively, the programming language used may include assembly language, Ada, APL, Basic, C, C++, COBOL, dBase, Forth, FORTRAN, Java, Modula-2, Pascal, Prolog, REXX, and/or JavaScript, for example. Further, it is not necessary that a single type of instruction or programming language be utilized in conjunction with the operation of the system and method of the invention. Rather, any number of different programming languages may be utilized as is necessary or desirable. 
     Also, the instructions and/or data used in the practice of the invention may utilize any compression or encryption technique or algorithm, as may be desired. An encryption module might be used to encrypt data. Further, files or other data may be decrypted using a suitable decryption module. 
     The computing environment may also include other removable/non-removable, volatile/nonvolatile computer storage media. For example, a hard disk drive may read or write to non-removable, nonvolatile magnetic media. A magnetic disk drive may read from or writes to a removable, nonvolatile magnetic disk, and an optical disk drive may read from or write to a removable, nonvolatile optical disk such as a CD-ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The storage media are typically connected to the system bus through a removable or non-removable memory interface. 
     The processing unit that executes commands and instructions may be a general purpose computer, but may utilize any of a wide variety of other technologies including a special purpose computer, a microcomputer, mini-computer, mainframe computer, programmed micro-processor, micro-controller, peripheral integrated circuit element, a CSIC (Customer Specific Integrated Circuit), ASIC (Application Specific Integrated Circuit), a logic circuit, a digital signal processor, a programmable logic device such as an FPGA (Field Programmable Gate Array), PLD (Programmable Logic Device), PLA (Programmable Logic Array), RFID integrated circuits, smart chip, or any other device or arrangement of devices that is capable of implementing the steps of the processes of the invention. 
     It should be appreciated that the processors and/or memories of the computer system need not be physically in the same location. Each of the processors and each of the memories used by the computer system may be in geographically distinct locations and be connected so as to communicate with each other in any suitable manner. Additionally, it is appreciated that each of the processor and/or memory may be composed of different physical pieces of equipment. 
     A user may enter commands and information into the computer through a user interface that includes input devices such as a keyboard and pointing device, commonly referred to as a mouse, trackball or touch pad. Other input devices may include a microphone, joystick, game pad, satellite dish, scanner, voice recognition device, keyboard, touch screen, toggle switch, pushbutton, or the like. These and other input devices are often connected to the processing unit through a user input interface that is coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). 
     One or more monitors or display devices may also be connected to the system bus via an interface. In addition to display devices, computers may also include other peripheral output devices, which may be connected through an output peripheral interface. The computers implementing the invention may operate in a networked environment using logical connections to one or more remote computers, the remote computers typically including many or all of the elements described above. 
     Various networks may be implemented in accordance with embodiments of the invention, including a wired or wireless local area network (LAN) and a wide area network (WAN), wireless personal area network (PAN) and other types of networks. When used in a LAN networking environment, computers may be connected to the LAN through a network interface or adapter. When used in a WAN networking environment, computers typically include a modem or other communication mechanism. Modems may be internal or external, and may be connected to the system bus via the user-input interface, or other appropriate mechanism. Computers may be connected over the Internet, an Intranet, Extranet, Ethernet, or any other system that provides communications. Some suitable communications protocols may include TCP/IP, UDP, or OSI for example. For wireless communications, communications protocols may include Bluetooth, Zigbee, IrDa or other suitable protocol. Furthermore, components of the system may communicate through a combination of wired or wireless paths. 
     Although many other internal components of the computer are not shown, those of ordinary skill in the art will appreciate that such components and the interconnections are well known. Accordingly, additional details concerning the internal construction of the computer need not be disclosed in connection with the present invention. 
     More specifically, the system  400  may comprise at least one gaming server  402  coupled to one or more databases  404  and/or other data sources. The gaming server  402  may run a plurality of software modules to facilitate lottery-style games in accordance with embodiments of the present invention. The database(s)  404  may hold data records related to players and lottery drawings. One additional data source may be a bank or payment provider ( 406 ) that performs payment and/or credit services for the lottery game operator and players. Via a network  401 , the players may communicate, locally or remotely, with the gaming server  402  in order to enroll in the lottery game, participate in drawings, and manage player accounts. The players may employ a variety of computing devices  408  such as personal computers, mobile computers, personal digital assistants or handheld devices for communication with the gaming server  402 . 
       FIG. 5  is a block diagram illustrating exemplary software and data-storage modules for facilitating lottery-style games in accordance with one embodiment of the present invention. The exemplary modules may include a user interface module  502 , an enrollment module  504 , an accounting module  506 , a game execution module  508 , an administration/service module  510 , a player data module  512 , and a game data module  514 . These software modules may be programmed or configured to communicate with one another or with the data-storage modules. 
     The user interface module  502  may provide computer and/or Internet access for players and game operators/administrators to communicate with the other software modules. The enrollment module  504  may perform functions related to registering new players, such as verifying player information, assigning player IDs, and creating player records. The accounting module  506  may be responsible for managing player accounts and handling debit and credit transactions against the player accounts, including daily wagering and winner payouts. The game execution modules may perform functions such as scheduling and conducting lottery drawings, generating and publishing drawing results, and calculating proportional values and payout amounts. The administration/service module  510  may facilitate administrative and customer service tasks to be performed by an operator or personnel of the lottery game system. 
     The player data module  512  may contain and manage data records related to each player, such as player ID, personal information, wager preferences, account history, and so on. The game data module  514  may contain and manage data records related to the lottery drawings, such as drawing results, winner IDs, jackpot payouts, and roller amounts. 
     GeoSweep Games and Map-Based Games 
     As variations of and/or improvement upon the above-described lottery-style games, other embodiments of the present invention may offer similar, membership-based games in connection with virtual and/or real maps. This type of lottery-style games may be referred to and are intended to be marketed or promoted as GeoSweep™ games. In a typical GeoSweep™ game, a grid pattern may be overlaid over a map dividing a land into grid units. A player may enroll in the game by taking virtual land ownership of one or more grid units and becoming committed to participate in a series of scheduled lottery drawings. The player may participate in a drawing by contributing tokens of value on behalf of at least one grid unit the player owns. During any of those drawings, if a grid unit owned by the player is selected as a (first-prize) winner, that player may receive a full or proportional prize amount. Additional winners in that drawing may be selected to win lesser amounts than the first-prize winner. Those additional winners are selected and their payout amounts are determined based on map positions of the additional winners with respect to the first-prize winner. 
       FIG. 6  shows a grid map for an exemplary GeoSweep game in accordance with one embodiment of the present invention. The game may be referred to as “GeoSweep Texas,” wherein a map of the State of Texas is overlaid with a grid  602 . Each grid unit  604  may be a rectangle or a square of the same or similar size. In general, a grid unit can take any other shape, such as triangle, hexagon (honeycomb) or other polygon. In some GeoSweep games, the grid units can have different shapes and/or sizes without substantially affecting the operation of the games. As a result, the grid  602  may divide up land of Texas into a plurality of small parcels with well defined boundaries. Each of the parcels (or grid units  604 ) may be uniquely identified. 
     To participate in the GeoSweep Texas game, a player may be required to register to become a member. During registration, the player may pick one or more of available parcels to become a virtual owner thereof. There may or may not be an upfront cost for “owning” a parcel. Both sole and shared ownership may be possible for a parcel. In some instances, it might be beneficial to hold an auction among multiple interested players to determine which player gets a popular parcel. In addition, the player may make a commitment to participate in a plurality of scheduled lottery-style drawings involving the one or more parcels. The plurality of scheduled lottery-style drawings may take place periodically, such as once or more times a day, every other day or every few days, or a number of times per week or month. In each drawing, each participating parcel may be required to contribute a predetermined number of tokens to a prize pool or jackpot. The predetermined number may be a fixed one set by the game operator or administrator, or, alternatively, a variable one to be designated by each individual owner of the participating parcels. In any case, upon registration, each player may be required to fund his or her commitment to participate in drawings by depositing or pledging some amount of money. 
     At each drawing, one or more parcels or grid units  604  may be randomly selected as sole winner(s) or first-prize winner(s). For ease of explanation, it is assumed hereinafter that each drawing selects a single grid unit as a sole winner or a first-prize winner. In the case of a sole winner, an entire amount of jackpot or a calculated fraction thereof may be awarded to the owner of that winning grid unit. More typically, in addition to a first-prize winner, one or more winners of lesser amounts may be determined based on their relative map positions with respect to the first-prize winner. According to some embodiments, the drawing may be limited to parcels that are already owned or claimed by participating players, thereby ensuring at least one player will be entitled to a prize as described in more detail below. According to some embodiments of the present invention, the parcels or grid units may each have the same chance of being drawn as a first-prize winner. According to other embodiments, the parcels or grid units may have varying chances of being picked as a winner. For example, when a parcel costs more to own than others, it might enjoy a better chance of winning. 
     The prizes in each drawing may comprise tokens of value which have been contributed to that drawing by participating parcels. The prizes may also comprise rollover prizes from a previous drawing. In addition or as an alternative, the prizes may comprise other things of value. For example, a marketing partnership may be formed between the game operator and other business entities. In return for promotional or advertising activities on the GeoSweep game platform, the business partners may contribute products and services to be awarded as prizes. If justified by the cost or return on investment, an actual piece of land or other real property may be awarded to a first-prize winner or a sole jackpot winner. 
       FIGS. 7A-B  illustrate an exemplary payout structure for the GeoSweep Texas game described above. 
       FIG. 7A  shows one grid unit that has been selected as a first-prize winner. That first-prize winning grid unit has eight neighboring grid units among which six are owned by participating players while the other two ( 702  and  704 ) are not owned by any player. Grid units  706 ,  708  and  710 , which are owned by some players, do not share any common boundary with the grid unit selected for the first prize. 
     Referring to  FIG. 7B , the first-prize winning grid unit may be allocated a prize amount that equals 20% of the jackpot available for that drawing. The eight grid units which happen to be the winner&#39;s neighbors may each be allocated 10% of the jackpot. Thus, were all eight grid units of the winner&#39;s neighbors owned by participating players, the entire jackpot would have been disbursed among owners of the nine parcels (i.e., 1×20%+8×10%=100%). However, since two of the winner&#39;s neighbors ( 702  and  704 ) are not occupied or owned by any player, the two 10% shares (i.e., 20% of jackpot) that would have been allocated to owners of grid units  702  and  704  may now be deemed not won by anyone and can be rolled over to the next drawing. The grid units  706 ,  708  and  710 , which are further away from the first-prize winning grid unit than the winner&#39;s neighbors, do not win anything in this round of drawing. 
     According to one embodiment of the present invention, the GeoSweep game may include mechanisms to encourage player referrals. For example, in a GeoSweep Texas game where Texas is divided into 20 million parcels, a player owning  20  parcels may be gifted an additional unit for every new player that he or she refers. Each parcel has an equal chance of winning the first prize. Thus, the effect of the referral reward may be somewhat different from that in a proportional lottery-style game described earlier. In a lottery-style game, the referral reward has the effect of increasing the proportion of the prize that a referring player would win. Here, in a GeoSweep game, the referral reward has the effect of increasing the chance of winning. 
     According to another embodiment of the present invention, the GeoSweep game may also have a proportional lottery aspect to it. In that case, at or shortly after registration, a player in the GeoSweep Texas game may specify how many tokens to be entered for drawings on behalf of a parcel the player owns. The number of tokens entered for each drawing and on behalf of each parcel may be within a predetermined range, for example, between 1 and 100 inclusive. In a drawing, if a parcel is selected as a first-prize winner, then a proportional value may be calculated based on the number of tokens that have been entered on behalf of that parcel. For instance, if 100 is the maximum number of tokens that can be entered for each parcel and 45 tokens are actually entered on behalf of the first-prize winning parcel, then the proportional value is calculated to be 45% (i.e., 45/100). Next, that proportional value may be applied to whatever payout structure is applicable, such that the owner of the first-prize winning parcel will only be awarded a fraction (e.g., 45%) of the full first-prize amount. According to some embodiments, owners of the winner&#39;s neighboring parcels may be subject to the same proportional value applied to the first-prize winner. Alternatively, according to some other embodiments, the payout to a winner&#39;s neighboring parcel may be subject to a different proportional value calculated based on the number of tokens contributed on behalf of that particular parcel. Therefore, the above-described map-based payout structure may be used to determine full prize amounts for the winner&#39;s neighbors, whereupon such full prize amounts may be reduced according to the individual proportional values calculated for each of those parcels. 
     It should be appreciated that the above description of the GeoSweep Texas game is exemplary only. Numerous variations or modifications may be applied to that exemplary game, such as payout structure, grid geometry, and map subject. 
       FIG. 8  illustrates an alternative payout structure in an exemplary GeoSweep™ game in accordance with one embodiment of the present invention. In a grid with rectangular or square shaped units, cell D- 6  may be selected as a first-prize winner during a drawing. Then, four closest neighbors of cell D- 6  (i.e., D- 5 , D- 7 , C- 6 , and E- 6 ), each of which shares one side with cell D- 6 , may become entitled to second prizes. Four other neighbors of cell D- 6  (i.e., C- 5 , C- 7 , E- 5 , and E- 7 ), each of which shares only one node with cell D- 6 , may be entitled to third prizes. The third prizes may be of a lesser amount than the second prizes, and the second prizes of a lesser amount than the first prize. For example, the third prizes may each be 5% of a jackpot amount, the second prizes may each be 10% of the jackpot amount, and the first prize may be 40% of the jackpot amount. According to another embodiment, the first prize may be 60% of the jackpot, the second prizes may share 30% (i.e., 7.5% each), and the third prizes may share the remaining 10% (i.e., 2.5% each). 
       FIG. 9  illustrates another alternative payout structure in an exemplary GeoSweep game in accordance with one embodiment of the present invention. In this embodiment, cell D- 6  is again selected as a single first-prize winner. The eight neighbors of cell D- 6  may become winners of second prizes. Further away from cell D- 6 , the sixteen next closest neighbors of cell D- 6  may be winners of third prizes. For example, the first prize may be 68% of a jackpot, the second prizes may share 16% of the jackpot (i.e., 2% each), and the third prizes may share 16% of the jackpot (i.e., 1% each). According to other embodiments, additional “rings” of neighbors may be included as winners of even lesser prizes. 
     According to some embodiments of the present invention, two or more grid units may be selected as first-prize winners. A set of rules may be established to determine which other grid units qualify as second-prize winners, third-prize winners, and so on. For example, grid units which are immediate neighbors of the selected first-prize winners may win second prizes. Then, if the first-prize winning grid units are far apart from one another, there may be multiple pockets or clusters of prize winners, each pocket or cluster being centered around one first-prize winner. 
       FIG. 10  illustrates an alternative method of establishing a grid or land boundaries in an exemplary GeoSweep game in accordance with one embodiment of the present invention. In this version of the GeoSweep Texas game, rather than overlaying a uniform grid over the Texas map, actual boundaries among the Texas counties may help define grid units of various sizes and shapes. Alternatively, actual land boundaries may define grid units for the GeoSweep game, such that the GeoSweep grid units correspond to actual land parcels. According to one embodiment, every grid unit (e.g., county or smaller parcels) may still cost exactly the same to “own” and/or have the same chance of being selected as a winner. According to another embodiment, the grid units or counties may cost differently and/or have varying chances of winning based on size and popularity of each county or parcel. In some embodiments, game parameters associated with a parcel on the GeoSweep map may be correlated to or associated with the conditions, market value, and popularity of the corresponding piece of land in the real world. 
     Since the grid units are irregularly shaped and in a non-uniform grid, different grid units may have different number of neighbors. For example, County A has eight neighboring counties, County B has five, and County C has only one. Depending on which grid unit is selected as a first-prize winner, there may be at least one but up to eight immediate neighbors who may be entitled to a second prize. One solution is to designate a fixed percentage of the jackpot that each second-prize winner is entitled to. For example, if each second-prize winner takes 2% of the jackpot, then 9 neighbors of the first-prize winner will share 18% of the jackpot while 2 neighbors (if there are only two) will only take 4% of the jackpot. Alternatively, a fixed percentage of the jackpot may be shared among the second-prize winners regardless of how many second-prize winners there may be. In that case, if a first-prize winner has only one neighbor, such as the case of County C, that single neighbor will be the sole second-prize winner taking the entire amount that has been allocated to second prizes. If the first-prize winner has eight neighbors, such as the case of County A, the eight neighbors will each take ⅛ of the entire amount that has been allocated to second prizes. 
     Many variations of prize-sharing schemes may be implemented for GeoSweep and/or proportional lottery-style games. In one embodiment, players that were introduced to the game by an existing player may share some of their winnings with that original (referring) player. In a further embodiment, groups of players may form prize-sharing clusters or syndicates. 
     Although a map of the State of Texas is used above as an example, it should be appreciated that maps of other types of geographic regions (e.g., township, city, county, country, ocean, island, and continent) may also be appropriate in GeoSweep games in accordance with embodiments of the present invention. For example, there may be GeoSweep USA, GeoSweep Europe, GeoSweep London, GeoSweep Hawaii, and so forth. In fact, a GeoSweep game may be established for a tourist destination and help promote tourism by offering prizes related to that destination or portions thereof. For example, a GeoSweep Alaska game may offer free roundtrip airline tickets as or in addition to a first prize. The game may also offer free hotel accommodation in hotels that happen to be located within a winning grid unit. Since the GeoSweep games are map-based and/or location-specific, promotional opportunities and variations are almost endless, as will be appreciated by those of ordinary skill in the art of advertising and marketing. 
       FIG. 11  illustrates part of a New York City map to be used in an exemplary game which may be referred to as “GeoSweep Big Apple.” As shown, the actual streets and avenues in mid-town Manhattan may serve to define grid units for the GeoSweep game. Local residents, business entities, and/or tourists may be encouraged to participate in this game. Each potential group of players may be offered different incentives. A local resident may be interested in virtual ownership of a street block that he or she actually lives on, and participation in the GeoSweep game may also be a social networking opportunity with other community members. A local business might be interested in sponsoring promotions and placing its name on the GeoSweep map. In fact, the GeoSweep map may be an online, interactive map with promotional and informational features. A tourist may also be interested in the game for various reasons, such as to get familiar with the area and to win travel-related prizes offered by local businesses. 
     Free2Play Games 
     In certain preferred embodiments, the GeoSweep game may be played without costs to the players. In these instances, the sweepstake-style game includes the use of advertisements to contribute to the jackpot and/or to cover other costs associated with game operations, thereby allowing players to play for free. Many of the features discussed in connection with embodiments of this game, which may be called Free2Play, may be incorporated into the embodiments of GeoSweep™ and others discussed herein. 
     Referring now to  FIG. 12 , there is shown a flow chart illustrating an exemplary method of facilitating a sweepstake-style game in accordance with the Free2play embodiments. In step  1200 , a sweepstake game may be established in a similar manner to the GeoSweep™ lottery-style games disclosed above. The game may be established online and may be accessible via any Internet browser. Through the Internet browser, the game&#39;s map is shown to contain a plurality of grid units. The maps and their grid units may contain the same attributes as with those of GeoSweep™ as described above. In addition, real world or, alternatively, fictional areas of land may be used as a map in the game. A grid pattern is shown overlaying or dividing up each map, thereby creating the plurality of grid units (referred to in GeoSweep™ games as Geos). The sizes of these maps, the number of grid units, the shape and sizes of the grid units may differ accordingly from map to map. 
     The sweepstake drawings may take place according to a schedule and/or may occur on a periodic basis. The players of the game may themselves determine the schedule of any drawings. One method in which this might be made possible is by designating an administrator who may be in charge of setting the schedule or by allowing players to vote for certain schedules. Rules, terms of conditions may be similarly established similarly to those of GeoSweep™ games. 
     Next, in step  1204 , a plurality of players are accepted for enrollment to play the game. Like GeoSweep™, players may be enrolled by visiting a game&#39;s website and registering with the game. Information about the players, at that point, may be recorded for administrative use. In most cases, there will not be a limit to the number of players that may be enrolled in the game. It would be beneficial to have as many players play the game as possible as, as more players results in higher advertising revenue. In one embodiment, however, only a predetermined number of players are allowed to enroll for each map or participate in each Free2Play game, creating a sense of privilege for the selected few, which in turn may entice even more people to vie for an opportunity to enroll in subsequent games. Unlike GeoSweep™, the players of this style of game do not need to commit to participate in a number of scheduled drawings. According to some embodiments, players may decide, from drawing to drawing, whether he or she would like to participate. 
     When a player is enrolled in the game, he or she will receive a predetermined number of tokens to play each round without costs to the player. As used previously, a “token” may be or represent any physical or virtual thing of value that can be counted or quantified such as cash, credit, or simply a basic unit of monetary or virtual value that may be exchanged for services, merchandise, and general items of interests. Here, in the Free2Play context, a token may not be exchanged directly for things of value other than an opportunity to win in a Free2Play GeoSweep game. The number of tokens given to a player may vary from time to time, from player to player. For example, a player may receive one or more tokens to play when the player watches a television commercial or select an advertisement. The player may also receive extra tokens when he or she uses a social network function of the game or shares his or status with an external website. As another example, a player may receive additional tokens when he or she plays at an off-peak time of the day (e.g., during early morning hours) or on a less busy day of the week (e.g., Monday) when participation level in the game is typically low. 
     If he or she would like to increase his or her chances of winning, the player may purchase additional tokens to play. The player may also purchase tokens in bulk at a discounted rate. The player may spend the tokens that he or she receives over a number of rounds. In one embodiment, the tokens that are given to a player for free may expire after a certain period of time, if not used. However, tokens that were purchased may last until they are spent. The player may also take part in online surveys, view online advertisements, view in-game advertisements, or increase activity level at social networking or blogger websites to earn tokens. 
     At step  1208 , advertisements from one or more sources (e.g., third-party sponsors) are presented to the viewer. Advertisements include any form of communication, visual or otherwise, that delivers information for the benefit of the advertiser. Thus, advertisements may be in the form of an image (static or animated) such as a banner advertisement similar to that of a billboard; in the form of an audio presentation such as an audio commercial; in the form of a video presentation such as a television commercial; or any combination thereof. 
     Additionally, there could be any number of advertisement sources and could include any company or persons who may be interested in promoting an idea, a product, or a service. The sources of advertisements and therefore the advertisements presented will differ from player to player. The game may be able to detect a player and his interests and display an advertisement according to these interests. In order to accommodate for the wide range of users that are playing the game, the game may have access to advertisements from various sources that cover diverse interest. 
     Advertisements may be received by players of the game in numerous manners. For example, the advertisement source may manually upload its advertisements to a server where it may then be accessed by the players. Alternatively, the game may have the capability to retrieve the advertisements from a plurality of sources. In a preferred embodiment, the players are provided with addresses to the advertisements. This would allow third party sources to quickly change or update items of advertising without having to upload manually every advertising item that have been updated. 
     The advertisements may be presented to the players in a variety of manners. Particularly, advertisements may be presented to the user internal or external to the game. In-game advertisements may be shown to the players through a traditional banner advertisement. Popups may also be presented to the players in the game. In that case, a window is shown overlaying the map presented to the user. Additionally, a click-through advertisement may be presented to the player in the form of a full or restrictive window that requires players to view its advertisements before the player is able to perform a certain action. For example, the game may require the player to view an advertisement before he or she may see the map of the game. The player may also be required to view an advertisement before his or her grid unit selection is processed. The player may also be required to select on a link to visit a sponsor&#39;s website. In another embodiment, the user may be required to periodically answer a survey that is presented to the user in the game. Upon the player&#39; submission of his answers to the survey, the player may be able to play the map-based game for additional lengths of time. Upon viewing one or more advertisements, a player&#39;s Free2Play account may be automatically credited one or more tokens or the player may be immediately directed to the Free2Play game interface to enter the game. 
     In one preferred embodiment, advertisements are embedded into the map of the game. As will be discussed in further detail below, images or videos may take up the equivalent space of one or more grid units or objects in the map. In embodiments wherein the map is a real location, pins (or other icons) on the map may directly correspond to one of the sponsors&#39; stores. In one additional embodiment, grids are grouped together to form islands or territories similar to states of the United States with each territory being sponsored by an advertiser. The name of the territory may be the name of the sponsor or a name associated with the sponsor. For example, one large game may contain the entire continental United States including its large cities and with each grid units in the game representing a city block. In this game, sections of cities may be associated with a particular sponsor. For example, a baseball team, such as the New York Yankees, may sponsor the entire city of New York. Thus, the region may be called the Yankees Nation for a period of time. Other sponsors who are willing to pay even more, may sponsor an entire state or an entire region of the map such as the Midwest. In some embodiments, regions within a sponsored region may also be sponsored. Thus, even though the city of New York may be sponsored and be called the Yankees Nation, a certain city block may also be sponsored by another business. In many of these embodiments, players who play in certain territories may be eligible to receive prizes directly from that sponsor. 
     Advertisements external to the game may also be presented to the players. For example, images, videos, and audio may be presented to the players on a website external to the game. Advertisements on television, billboards and radio may also be used. Sponsors may direct the players to a particular website or distribute special codes that can be used to redeem extra tokens. In fact, according to some embodiments of the present invention, a player may simply visit any third-party website or view sponsored advertisements anywhere on the web, whereupon the player may be given a unique code with which he or she could either redeem token(s) at the Free2Play website or directly gain an entry into the game. This way, there is no need for direct links between the Free2Play website and sponsors&#39; websites. 
     Any number of the above-described forms of advertisement presentation may be used in combination. In fact, it may be most beneficial to use a combination of advertisements in order to maximize advertising revenue received. However, one of ordinary skill in the art would understand that using advertisements to a level of excess may be counter-productive to the growth of revenue received as players may begin to resent such efforts. 
     At step  1212 , a token and a player selection is received. A player may enter his or her commands through a device that includes a user interface and peripheral devices previously described. Upon confirmation that the user would like to play a particular grid unit for the next drawing, the user may be asked to confirm his or her desire to spend one or more tokens. In other embodiments, the game may be configured to automatically spend the default number of tokens upon a user selection of a grid unit. 
     After the player&#39;s tokens and selections are received, the player is automatically associated with the grid unit that he or she has selected with a requisite contribution of tokens, as seen in step  1216 . A record may be kept that ensures that when the drawing takes place, each grid unit&#39;s association can be tracked. Thus, a table may be kept that continuously tracks and identifies each grid unit and each unit&#39;s corresponding associated player. The table, for example, may record the player&#39;s associations based on the unique player ID. Alternatively, a table may also be kept for each player that identifies each player&#39;s associated grid units. These tables may also contain information describing how many tokens were contributed for each associated grid unit and other player selection information. The tables may be archived after a round has been completed and the jackpots have been distributed. 
     When a drawing is conducted, a winning grid unit may be chosen from the map (step  1220 ). A random drawing from all of the grid units in the map may be achieved in a number of computational methods well known in the gaming industry. In one simple example, each grid may be assigned a unique grid unit number starting at 1. If there are 64 grid units in the map, then they will be numbered 1 through 64. A drawing is then conducted by running the random number generator to select a number 1 through 64 to find the number corresponding to the winning grid unit. It is then checked whether the grid unit has an associated player. The table containing the grid units and each grid unit&#39;s corresponding associated player may be checked to find the winner, if any. If the drawing is not limited to those “participating” grid units (i.e., those selected by players for this particular round of prize draw), the winning grid unit may not have been selected by any player. In these cases, the prize may then be added to the next drawing&#39;s prize. In order to guarantee there will be a winner emerging from each prize draw (otherwise players might be discouraged from participation), it may be preferable to exclude unoccupied grid units from the random drawing. According to some alternative embodiments, two or more winners may be selected for each drawing. In other embodiments, a drawing is conducted from only a portion of the map&#39;s plurality of grid units. As another example, a drawing may be conducted only among the grid units in a region of the map. Thus, such a drawing may be used to give those in a specific region a bonus drawing in order to, for example, promote the area of the map or sponsors in that area. 
     The jackpot is then provided to the player that is associated with the winning grid unit (step not shown). According an embodiment of the present invention, a single winner may be selected for each lottery drawing. Jackpots may also be given to multiple users by performing multiple random drawings. In one embodiment, a portion of the jackpot may be given to players with associated grid units within the proximity of the winning grid unit, in a manner described above. They may also share a jackpot on equal footings or according to an award hierarchy. The jackpots that are awarded to players are derived from some of the advertising revenue received from presenting advertisements to the players. The jackpots may also be funded by token sales revenue. Although players do receive tokens for free at each round, many players will have the desire to increase their chances of winning the jackpot. In addition to the jackpot consisting of cash prizes or merchandise, in-game tokens may be given from time to time to ensure that budgets are maintained. 
       FIG. 13  is a block diagram illustrating an exemplary system  1300  for facilitating sweepstake-style games in accordance with one embodiment of the present invention.  FIG. 13  depicts a gaming server  1308  connected to at least one database  1320 . The gaming server  1308  is connected to network  1304 , which allows communications with a plurality of computing devices  1312 , payment provider  1316  and advertiser server  1324 . The gaming server  1308 , computing devices  1312 , payment provider  1316 , network and database of  FIG. 13  have many of the same capabilities of the corresponding devices described in connection with  FIG. 4 . The underlying hardware and software structure of each of these devices, therefore, will not be discussed in detail. The capabilities of the devices of  FIG. 4  and their embodiments may be incorporated into the corresponding devices in  FIG. 13 . The following will discuss the additional features and devices in detail. 
     The gaming server  1308  will enroll a plurality of players, each of whom are connected from various client devices  1312 . The gaming server  1308  will have the capability to enroll a plurality of players. It would certainly be beneficial from a revenue standpoint, to enroll as many players to play the game as possible. However, there may be certain cases in which the game may be limited to a small number of players. This may be due to the physical limitation of a gaming server  1308  or it may simply be the game host&#39;s desire to set a limit the type of players. For example, a school may only allow its students to participate in an instance of the game. In such cases, invite codes may be generated and may be required in order to register and enroll in the game. 
     The gaming sever  1308  also has the capability to receive from players at client devices  1312  at least one token and a selection of at least one grid unit for the current drawing. In response, it will associate each player with his or her respective grid unit as selected. The server will continue to update its database  1320  in a manner previously described in connection with system  400 . Furthermore, by executing the instructions at gaming server  1308 , the tokens of each round are pooled together similarly to the pooling capabilities of gaming server  402 . The gaming server  1308  then has the capability to conduct a drawing to select at least one winning grid unit to win the jackpot. After determining the winning grid unit, the gaming server  1308  will access database  1320  to determine the player associated with the winning grid unit. The gaming server  1308  then has the capability to provide the jackpot to at least one player associated with the at least one winning grid unit. In one embodiment, the financial information of the winning player is updated to include the jackpot. Alternatively, the gaming server may transmit to the player&#39;s bank account at the payment provider  1316  an electronic money transfer order in the various methods known in the art. 
     The gaming server of  1308  additionally has the capability to present the players of the game with advertisements. The advertiser server  1324  of system  1300  stores a plurality of advertisements at the advertiser server  1324 . The advertiser server  13024  may contain a database of advertisements that is publicly accessible to a plurality of computing devices  1312  and the gaming server  1308 . In order to provide the players at the computing devices  1312  advertisements, the gaming server  1308  will transmit to the computing devices  1312  an address to the advertisements at the advertiser server  1324 . Upon receiving this address, the computing devices  1312  then has the capability to access the address and directly download the advertisements from the address for display at the computing device  1312 . In one alternate embodiment, the gaming server  1308  may download any advertisements from the advertiser server  1324  and then transmit these items of advertisements to the computing devices  1312  for display. In another embodiment, the advertiser server  1324  will upload to the database  1320  its advertisements. The computing devices  1312  may then access the advertisements directly from the gaming server  1308  using the various methods well known in the art. 
     The database  1320  may further have the capability to store information related to the advertisements and the advertiser server  1324 . Particularly, in addition to information related to the players (e.g., name, email address, password, preferences), information related to technical functions (e.g., internet protocol address), information related to player financial information (e.g., bank name, bank account number, credit card number, addresses, payment history), information related to the play history (e.g., history of specific grid units chosen, winning data), and information related to the players&#39; current selection of grid units for the current drawing, the database  1320  further contains information related to advertisements including the address of each advertisement, the type of advertisements and various other technical information that may be required to display each advertisement correctly at the computing devices  1312 . 
     As previously discussed, the gaming server  1308  further conduct a drawing to determine a winning grid unit and present to the player that is associated with the winning grid unit the jackpot. In particular, the presented jackpot in these embodiments are at least partly derived from revenue received for presented advertising. From time to time, such as every month, the advertiser server may transmit to the payment provider  1316  an electronic money transfer order intended for the organization associated with the gaming server  1308  in exchange for the gaming server  1308 &#39;s presentation of the various advertisements to the players at computing devices  1312 . 
     The gaming server  1308  further may present advertisements to the players using several different methods. In one exemplary embodiment depicted in  FIG. 14 , advertisements may be presented to the player through the banner advertisements. Thus, the user interface  1400  displayed at a computing device depicts a map  1404  with a banner advertisement  1408 , in this case, to the left side of the screen. This and other depictions are by no means the only manner in which these form of advertisements may be shown as part of user interface  1400 . In certain embodiments, and as shown in  FIG. 14  as well, an advertisement may be presented in the form of an overlaying image over the map  1404 . In the ordinary case, the advertisement  1412  would only take up a small portion of the screen so as to not obstruct the view of the map  1404 . In these disclosed embodiments, selecting the advertisements  1408 ,  1412  or other forms of advertisements results in a pop up screen that displays a related website. In certain embodiments of the disclosed system, a click-through advertisement is presented to the player. In these cases, the player must view the advertisements prior to entering the game, prior to submitting his or her selection of a grid unit or at intermittent periods. 
     In another embodiment illustrated in  FIG. 15 , the user may be required to answer a survey prior to his or her selection of a particular grid unit may be processed by the gaming server  1308 . Thus, when a player selects a grid unit  1508  shown in user interface  1500 , a menu  1504  is shown. An advertisement  1516  may be shown. The advertisement  1516  may be an image, a video clip or an audio clip. A survey  1512  is shown in menu  1504  that asks various questions. Such surveys are often very important and valuable to advertisers and businesses. Once the questions are answered, the user may select the submit button to submit his or her survey and to automatically have the grid unit associated with his account. 
     In several preferred embodiments, advertisements are embedded into the map of the game. An exemplary embodiment is depicted in  FIG. 16 . An interface  1600  is shown depicting a map containing a plurality of grid units.  FIG. 16  further depicts several grid units  1616  that have already been selected by another player.  FIG. 16  also depicts embedded advertisement  1608 ,  1612  and  1616  in the map of the game. Advertisement  1612  is a video advertisement. Upon selecting advertisement  1612 , a video is shown within the grid unit in which the advertisement  1612  resides. In certain embodiments, the video advertisements automatically play when the entire grid unit of the advertisement is entirely depicted in the user interface  1600 .  FIG. 16  further depicts an audio clip  1616  that may play automatically or upon selection. In the preferred embodiment, the players that select an advertisement may be automatically associated with the respective grid unit for at least one drawing. The player would win the jackpot if the grid unit is selected as the winning grid unit. 
     In another embodiment, the map depicts real-world locations such as the map depicted din  FIG. 17 . It contains a plurality of intersecting streets and roads and a plurality of city blocks such as block  1704 . The city blocks, in this embodiment, are equivalent to the grid units. In this embodiment, the street names may be names of advertisers. For example, John Apparel may place their advertisement along the street. The advertisement may be a name, a phrase or even a short announcement. This manner of advertisements allows advertisements to be non-obtrusive while still providing the players with exposure to them. In yet another embodiment, also depicted in  FIG. 17 , a pin or icon may be placed in a map. Each pin or icon may depict an advertiser&#39;s logos or products. The location of these pins or icons may correspond to the real world location the advertiser&#39;s business. In one additional embodiment, the system allows for the presenting of a map that depicts a group of grid units in the form of an island. Each island of grid units may be sponsored by an advertiser such as a business and named as such. 
     GeoSweep Treasure Hunt 
     One embodiment of GeoSweep™, called the GeoSweep Treasure Hunt, will now be described. In this variation of the GeoSweep game, at least one prize, or “treasure,” may be hidden in a map and in particularly, a grid unit. The goal of the game is for the players to find the one or more treasures hidden somewhere in the map. Generally, when the game begins, players take turns choosing grid units to determine whether that grid unit contains a prize. This continues until all of the prizes have been found on the map, whereupon the game ends. The game may then be restarted. Unlike traditional lottery games, the presently disclosed embodiments establish a game that may have increasing chances to win even while the jackpot is also increasing. In addition, the presently disclosed embodiments may require strategies in order to maximize one&#39;s winnings, unlike traditional lottery games which are based on chance only. 
       FIG. 18  depicts one particular embodiment of the GeoSweep Treasure Hunt. At a first step  1800 , an online game is established containing map that includes a plurality of grid units. The disclosed map may be similar to those already described with respect to the other embodiments of the present invention including GeoSweep™. Particularly, it may be a map of a real world location or it may be of a fictional place. A plurality of grid patterns may be overlaid on the map, thereby creating a plurality of grid units on the map. Grid units may be any shape or sizes and may even contain multiple layers. In certain embodiments, the grid units may be associated with information about each grid unit including the grid unit ID or the grid unit coordinates on a map. 
     Next, at step  1804 , enrollment of a plurality of players takes place. Players, for example, may load up an Internet web browser to access the game. Before a person may play the game, he or she may have to register as a user with the game. In addition, enrollment to the game may be temporary or permanent. That is, the user may simply be enrolled as a temporary user in order to play the game in that instance. No personal information may be stored in such cases. In the alternative, a user may be enrolled to play the game as a permanent player whereby information about the user is requested, gathered and saved. Such information may include the person&#39;s name, username, login information and any other desired address fields. In certain embodiments, financial information about the user may also be stored as part of the enrollment process. In particular embodiments of the present invention, players are enrolled simply by playing the game and neither registration nor log-in is not required in any manner or form, though some form of age and/or residency validation may nonetheless be required for a player to claim a prize. 
     At step  1808 , the prize&#39;s location on a map is predetermined prior to any player&#39;s selections or token submissions. Thus, prior to any actions by the players, the prizes are hidden throughout the map in grid units. As such, the prizes are not indicated in any way on the map. For example, where there are two prizes available, each prize may be hidden at a different grid unit. However, in certain embodiments, more than one prize may be placed at particular a grid unit. 
     The location of each prize may be randomly generated by a random number generator well known in the art. In such cases, each grid unit may be associated with a particular number. Thus, where there are 100 grid units, the random location of one prize may be determined by generating a randomly generated integer number, n, using the random number generator for a number from 1 to 100. Where the grid units have unique IDs ranging from 1 to 100, the random location, therefore, is determined to be the grid unit with the unique ID equal to the generated number. Where the unique IDs of the grid units are not all in the range from 1 to 100, then they are placed in some canonically ordered list (for instance in ascending order of ID if the IDs are numbers) and the nth grid unit in that list is selected as the random location. Where there are a number of prizes, the generator may be invoked again, for example, to pick from all possible combinations of grid unit locations wherein each combination represents one possible way of hiding the treasures. Another method of generating a number may be based on a predetermined routine that considers various factors including historical user selection data, historical jackpot winning history, the number of numbers to be generated and other factors. Examples of possible number generators that may be used include standard random number generators (RNG), pseudorandom number generators (PRNG), and cryptographically secure PRNG. Some embodiments determine the placement of a prize on the map by generating two numbers that may correspond to the coordinates. In a simple example, where a map comprises of 8 by 10 grid units, the number generator may randomly pick two numbers: one with the range of 1 to 8 and a second number with a range of 1 to 10. This way, a coordinate, such as (5, 2) may be generated. Where the size of grid units varies or they are not in a rectangular configuration, this may introduce bias—i.e., some grid units may grant players a greater or lesser chance of being chosen than others. This bias can either be corrected for in the probability algorithm or retained as a feature of the game—for instance by varying the price and/or prizes for grid units with non-average probabilities of being selected. In some games with real world locations, longitude and latitude coordinates may be used. Upon the generation of the number, the number is then stored for later comparisons. 
     Next, at Step  1812 , a token and a grid selection is received. Each token represents a unit of wager in the game and, in this particular instance, represents a wager that there is a prize hidden at the selected grid unit. In a preferred embodiment, a player may only select grid units that have not been selected (or “unlocked”) by other players and therefore are still available for selection. This may prevent players from wasting their tokens since any prize that may have been at that previously selected grid units would have already been awarded to the other player. In some embodiments, selection of multiple grid units still results in a sequence of individual wagers—one per grid unit selected—and, in the event that the game terminates after one of these wagers, the remaining unplaced wagers will be cancelled and any tokens corresponding to them returned to the player. However, in certain embodiments, players are allowed to select a grid unit that has previously been selected. In these cases, multiple prizes may be available to win at each grid unit. In some embodiments, players may enter multiple tokens per grid unit. If the player ultimately wins the jackpot, the amount of money that he or she receives may be dependent on the number of tokens wagered. Similarly, multiple grid units may be selected at the same time thereby increasing the chances of winning. However, in most embodiments, the selection of multiple grid units will require the player to contribute at least one token to unlock each grid unit. 
     In particular embodiments of the GeoSweep Treasure Hunt game, players may select grid units and play the game for free. Similar to the features of the Free2Play game, the game allows players to receive at least one token for free to be used to select a grid unit. Prizes in the game are supported, at least in part, by the revenue received from advertisements that are presented to the player while playing the game. Any known manners of presenting advertisements to the players may be used including those manners discussed in connection with the Free2Play game discussed previously. Furthermore, players may receive additional tokens by purchasing, completing surveys, entering special codes received from external forms of advertisements, play other games such as GeoSweep™, referring friends, visit retail gaming machines or other methods described herein. Other features of Free2Play may also be incorporated in these free games. 
     Upon receiving the token(s) and the grid selections from the player, the player is then associated with each selected grid unit, as seen in Step  1816 . In one embodiment, a table containing each grid unit and any corresponding associated player is tracked and updated automatically as the game progresses with player selections of grid units. 
     After the player is associated, it is determined whether the player wins the prize based on the player&#39;s selection, as seen at Step  1820 . Specifically, it is determined whether the selected grid unit was the same grid unit at which the prize is “hidden” or “located.” In one embodiment, this may be done by comparing the grid unit ID of the selected grid unit or, as described above, its position in a canonically ordered list of grid unit IDs with the stored generated number from the random number generator. A similar comparison takes place when cases in which the number generator produces coordinates to identify grid units in the map. When there is a match, the player is rewarded the prize. In some embodiments, if this is the jackpot prize, then the game ends at this point. When there is not a match, such that the jackpot was not hidden at the selected grid unit, then, in some embodiments, the token received from the player is added to the jackpot&#39;s total value. Thus, in these embodiments, the jackpot will continue to increase as the game progresses without a winner. 
     One of ordinary skill in the art would appreciate that the probability of winning increases at the same time that the number of available grid units decreases as the game progresses. At the beginning of a game containing M grid units in the map, the probability that a player selects one of the p prizes on the first turn is 
     
       
         
           
             p 
             M 
           
         
       
     
     As the game progresses without a prize being won (or with the number of prizes available at any time being held constant—i.e. not decremented when a prize is one) and the number of available grid units (i.e. those not previously selected in the game) begin to reduce, the probability of winning one of the remaining prizes increases. The probability may be calculated as the following formula, where t is the number of turns already taken since the start of the game: 
     
       
         
           
             p 
             
               M 
               - 
               t 
             
           
         
       
     
     For instance, on a board of 100,000 grid units, with a single top prize, the chance of winning that top prize at on the first turn (i.e. after 0 turns already taken) is: 
     
       
         
           
             
               1 
               
                 100 
                 , 
                 
                   000 
                   - 
                   0 
                 
               
             
             = 
             
               1 
               
                 1000 
                 , 
                 000 
               
             
           
         
       
     
     If the game proceeds for another 99,999 turns without the top prize being one, then the chance of winning that top prize on the one remaining possible turn in the game is: 
     
       
         
           
             
               1 
               
                 100 
                 , 
                 
                   000 
                   - 
                   99 
                 
                 , 
                 999 
               
             
             = 
             1 
           
         
       
     
     More generally, the chance of the game on a board of M grid units with a single top prize being won on or before (WOOB) turn t for t&gt;0 is: 
     
       
         
           
             
               P 
                
               
                 ( 
                 
                   WOOB 
                    
                   
                     ( 
                     t 
                     ) 
                   
                 
                 ) 
               
             
             = 
             
               
                 P 
                  
                 
                   ( 
                   
                     WOOB 
                      
                     
                       ( 
                       
                         t 
                         - 
                         1 
                       
                       ) 
                     
                   
                   ) 
                 
               
               + 
               
                 
                   1 
                   - 
                   
                     P 
                      
                     
                       ( 
                       
                         WOOB 
                          
                         
                           ( 
                           
                             t 
                             - 
                             1 
                           
                           ) 
                         
                       
                       ) 
                     
                   
                 
                 
                   M 
                   - 
                   t 
                 
               
             
           
         
       
     
     Now, suppose there is a t, such that 
     
       
         
           
             
               P 
                
               
                 ( 
                 
                   WOOB 
                    
                   
                     ( 
                     
                       t 
                       - 
                       1 
                     
                     ) 
                   
                 
                 ) 
               
             
             = 
             
               
                 t 
                 M 
               
               . 
             
           
         
       
     
     In that case, we would have: 
     
       
         
           
             
               
                 
                   
                     P 
                      
                     
                       ( 
                       
                         WOOB 
                          
                         
                           ( 
                           t 
                           ) 
                         
                       
                       ) 
                     
                   
                   = 
                     
                    
                   
                     
                       P 
                        
                       
                         ( 
                         
                           WOOB 
                            
                           
                             ( 
                             
                               t 
                               - 
                               1 
                             
                             ) 
                           
                         
                         ) 
                       
                     
                     + 
                     
                       
                         1 
                         - 
                         
                           P 
                            
                           
                             ( 
                             
                               WOOB 
                                
                               
                                 ( 
                                 
                                   t 
                                   - 
                                   1 
                                 
                                 ) 
                               
                             
                             ) 
                           
                         
                       
                       
                         M 
                         - 
                         t 
                       
                     
                   
                 
               
             
             
               
                 
                   = 
                     
                    
                   
                     
                       t 
                       M 
                     
                     + 
                     
                       
                         1 
                         - 
                         
                           t 
                           M 
                         
                       
                       
                         M 
                         - 
                         t 
                       
                     
                   
                 
               
             
             
               
                 
                   = 
                     
                    
                   
                     
                       t 
                       M 
                     
                     + 
                     
                       
                         
                           M 
                           - 
                           t 
                         
                         M 
                       
                       
                         M 
                         - 
                         t 
                       
                     
                   
                 
               
             
             
               
                 
                   = 
                     
                    
                   
                     
                       t 
                       M 
                     
                     + 
                     
                       1 
                       M 
                     
                   
                 
               
             
             
               
                 
                   = 
                     
                    
                   
                     
                       t 
                       + 
                       1 
                     
                     M 
                   
                 
               
             
           
         
       
     
     However, for t=1, we do indeed have 
     
       
         
           
             
               P 
                
               
                 ( 
                 
                   WOOB 
                    
                   
                     ( 
                     
                       t 
                       - 
                       1 
                     
                     ) 
                   
                 
                 ) 
               
             
             = 
             
               
                 P 
                  
                 
                   ( 
                   
                     WOOB 
                      
                     
                       ( 
                       0 
                       ) 
                     
                   
                   ) 
                 
               
               = 
               
                 1 
                 M 
               
             
           
         
       
     
     so by induction: 
     
       
         
           
             
               P 
                
               
                 ( 
                 
                   WOOB 
                    
                   
                     ( 
                     t 
                     ) 
                   
                 
                 ) 
               
             
             = 
             
               
                 
                   t 
                   + 
                   1 
                 
                 M 
               
                
               
                 ∀ 
                 
                   0 
                   ≤ 
                   t 
                   &lt; 
                   M 
                 
               
             
           
         
       
     
     And the probability that the game is won after turn t is just 
     
       
         
           
             
               M 
               - 
               t 
               - 
               1 
             
             M 
           
         
       
     
     The above-described game is just one embodiment of the GeoSweep Treasure Hunt game. It may be considered a “predetermined play” of the game because the treasures are hidden on the map prior to the start of each game. According to one embodiment of the present invention, players may have already been associated with their respective grid unit before the “start” of a Treasure Hunt game is announced. For example, the Treasure Hunt game may be implemented in connection with the original GeoSweep game, for example, either as a bonus round to the regular GeoSweep drawings or being limited to GeoSweep players who have paid for or otherwise qualify for the Treasure Hunt game. At a predetermined time, the Treasure Hunt game operator may randomly hide treasures at one or more grid units and announce the start of a treasure hunt. Each player may then simply check his or her own grid units to see whether he or she is the lucky winner of the treasure. In other cases, each player is further allowed to unlock his or her neighboring unoccupied grid units to win any treasure found therein. 
     One additional embodiment of the GeoSweep Treasure Hunt game, called a “dynamic play” of the game, is shown in  FIG. 19 . Similar to the previously described embodiments, an online game containing a map that includes a plurality of grid units is established at step  1900  in a manner similar to step  1800 . Prizes are also associated with the game. Next, enrollment of a plurality of players is accepted at step  1904 , just as it is in step  1804 . Unlike the embodiment of  FIG. 18 , the embodiments of  FIG. 19  do not determine the placement of a prize on the map prior to a player&#39;s interaction. After the plurality of players is enrolled, the game begins by allowing players to select grid units. At step  1908 , a grid unit selection and a token is received. Just as in  FIG. 18 , a plurality of tokens may be wagered on any number of selected grid units. Once this occurs, the player is associated with the grid units according to step  1912 , for example, by updating the table of grid units and associated players. 
     After the player is associated with each of selected grid units, it is determined whether the player wins by executing a probability algorithm at step  1916 . Thus, in the dynamic play of the game, it is unknown whether the player would win a prize even at the moment the player chooses a particular grid unit. It is not until the probability algorithm is executed that the results of the player&#39;s selections are known. In other words, at the start of each dynamic play game, each grid unit has a chance of containing the prize. In contrast, in the predetermined game, each tile either has a winning prize or it does not, i.e., each grid unit either has a 0% or 100% chance of containing a prize. It should be noted, however, that the player&#39;s chance of selecting a grid unit that contains a prize in the predetermined game may still be given by the probability formulas above. 
     In one basic probability algorithm, the number of not yet won prizes (P), the number of grid units not yet selected (U), and a randomly generated number (R) are considered. The random generated number (R), when generated, will be in the range, 
       0&lt; R≦U    
     Once R has been generated, the following comparison is made to determine whether the player wins:
         The player wins if R≦P   The player loses if P&lt;R
 
A flowchart of the basic probability algorithm is depicted in  FIG. 20 . The above-described basic algorithm may be used in a fair game, where each grid unit has the same chance of winning In an exemplary game where there are 2 known prizes on the map and 10 remaining grid units to be selected, the probability algorithm, when executed, will determine whether the player wins. Each grid unit has a 20 percent chance of winning in a fair game. When executed, the simple algorithm determines that the player will win when the random number generator generates a value of R that is less than or equal to 2 from the possible range of 1 to 10 (i.e. a 20 percent chance of winning). The exemplary function used above is used to demonstrate the one possible function of the probability algorithm and is not meant to be limiting in anyway. After it is determined that a player wins the prize, the player is awarded the prize in any number of known manners such as crediting the player&#39;s associated bank account with the fund or crediting the player&#39;s credit within the game. Once all prizes have been distributed, the game restarts.
       

     In certain embodiments, the chances of winning a prize may vary from grid unit to grid unit. In these games, each grid unit may be associated with predetermined winning factor, F W . The value of F W  may be any number greater than 0. The closer the value of F W  to 1, the closer the algorithm is equivalent to the algorithm in a fair game. Further, when the value of F w  is greater than 1, it is easier to win the prize. Once the value of R has been randomly generated, the determination of whether the player wins the prize may be, 
       The player wins if  R≦F   W   ×P    
       The player loses if  F   W   ×P&lt;R    
     Where the value of F W  is 2, the player has twice the probability of winning the prize. When used in the map-based game, the value of F W  may be known for each grid units or it may be hidden. Further, the value of F W  may be represented by the size of the grid unit relative to the other grid units. A larger grid unit may have a larger value of F W  and therefore the higher chance of winning the prize. In some embodiments, the player may have to contribute a larger number of tokens in order to select these larger grid units. 
     In various embodiments of the GeoSweep Treasure Hunt game, prizes are categorized by a plurality of tiers. Valuable prizes are considered to be in the highest tier while prizes of less value are in the lowest tier. Accordingly, prizes of the highest tiers are much more difficult to win than prizes at the lowest tiers. The number of tiers in the game may either be determined in advance, or can be determined dynamically using a particular probability weighting. 
     In the “dynamic play” of the GeoSweep Treasure Hunt game, a probability algorithm may take into consideration the multiple tiers of prizes with each tier having differing probability of winning a prize. A variance of the basic probability algorithm may be used that further considers a tier adjustment factor (F T ).  FIG. 21  depicts a flowchart of the steps taken in the exemplary probability algorithm. As described above, a value of R is the randomly generated value at step  2100 , where R is within the range, 
       0&lt; R≦U    
     When R is generated, multiple levels of comparisons are made, with a level of comparison made for each tier. First, a step  2104  is taken to determine whether the value of R is within the range 0&lt;R≦F T ×P T , where P T  is the number of not yet won prizes in tier T. If it is within this range, the player wins the prize for that tier and the probability algorithm terminates. In certain embodiments, a player may win prizes from multiple tiers, whereby the determination of the lower tier winnings are still made even after it is determined that the player wins a prize of a higher tier. 
     If the value of R is not within that the range of step  2104 , a step  2108  is taken to determine whether there is a lower tier of prizes. If so, the algorithm adjusts to determine whether the player may win the next tier of prizes. Therefore, the value of T may be incremented at step  2112  and the determination of R within the range is made using the adjustment factor F T  corresponding to the next (lower) tier. 
     The adjustment factor F T  may be any value greater than 0. In the most basic and simple game, an adjustment factor F T  of 1 is used for the highest tier prizes. The adjustment factor may be greater than 1 for lower tiers. The lower the tier, the higher the value of F T  may be. For example, the lowest tier prize may have an adjustment factor of 2. In such cases, the players are twice more likely to win a lowest tier prize than the highest tier prize. 
     In a game with 1 highest tier prize and 2 lowest-tier prizes and 15 remaining grid units on the map, it is first determined whether the player may win the highest tier prize using an adjustment factor F T  of 1. If the value of R, when randomly generated, is no greater than 1, out of a possible range of 1 to 15, the player wins. Otherwise, the player does not win the first tier prize and a determination is made whether the player may win the second tier prize. Specifically, if the value of R is greater than 1 but less than or equal to 2, then the player will win the second tier prize. Otherwise, the algorithm will terminates and the player does not win any prizes for his selection of the grid unit. 
     In the “predetermined game” of the GeoSweep Treasure Hunt game, an adjustment algorithm may be used during a game to dynamically adjust the probability that a prize from a particular tier may be won. This may be especially useful for lower tier prizes, as it would make the probability of winning these lower tier prizes much higher. For example, in a map containing 1,000 grid units, 1 higher tiered prize and 1 lowest tiered prize, it may be desirable to have the probability of winning the lower tier prize to be equivalent to the probability of winning in a game that only has 200 grid units. In other words, it may be desirable to have a predetermined play of GeoSweep Treasure Hunt wherein the initial probability of winning the lower tier prize is 1 out of 200 while the initial probability of winning the highest tier prize is higher, such as 1 out of 1000. 
     The adjustment algorithm thus allows a game with multiple tiers of prizes with varying probabilities of winning, even in a “predetermined game” of the GeoSweep Treasure Hunt game. Such a game may be called a Key Treasure Hunt game. 
     In order to ensure that the probability of winning the lower tiered prize will be the equivalent to that of a game with 200 grid units and one prize, the number of prizes available on the board must be dynamically adjusted after each selection of a grid unit. This may be possible by using “keys” in the grid units of the map to represent a tier of prizes. This is different from the traditional GeoSweep Treasure Hunt game wherein grid units are associated with each available prize. The use of keys allows multiple keys to represent one prize. The discovery of one key will automatically allow the player to win the prize. Once all of the prizes have been won, the game would reset. Thus in a game with 1000 grid units, 1 highest tier prize and 1 lowest tier prize, 1 key may be placed in a grid unit in the map, representing the highest tier prize. Further, 5 keys may be placed in various grid units to represent the 1 lower tiered prize. With 5 keys in the map, the initial probability of winning a lower tiered prize is 1 out of 200, or equivalent to a game with only 200 grid units and 1 prize. 
     The number of keys for each tier of prizes may be adjusted each time a grid unit is selected. This ensures that the probability of winning the lower tiered prize is the same as if the player were searching for the prize in the smaller map. 
     The following formula may be used to determine how many keys are required in the map for a given tier of prizes at turn t. 
     
       
         
           
             
               K 
               t 
             
             = 
             
               ⌊ 
               
                 
                   G 
                   - 
                   t 
                 
                 
                   M 
                   - 
                   t 
                 
               
               ⌋ 
             
           
         
       
     
     The formula takes into consideration the total number of unselected grid units at the start of the game (G), the adjusted total number of unselected grid units at the start of the game (M), and the total number of turns taken since the beginning of the game (t). In one embodiment, the value of M may be calculated using the tier adjustment factor, F T . 
     
       
         
           
             M 
             = 
             
               G 
               
                 F 
                 t 
               
             
           
         
       
     
     When the value of F T  is 2, a player will have twice the probability of finding the prize than when an adjustment algorithm is not used. Thus the chance of winning the top prize once we reach turn t (counting from 0) is 
     
       
         
           
             
               
                 K 
                 t 
               
               
                 G 
                 - 
                 t 
               
             
             = 
             
               
                 
                   ⌊ 
                   
                     
                       G 
                       - 
                       t 
                     
                     
                       M 
                       - 
                       t 
                     
                   
                   ⌋ 
                 
                 
                   G 
                   - 
                   t 
                 
               
               ≈ 
               
                 1 
                 
                   M 
                   - 
                   t 
                 
               
             
           
         
       
     
     As seen, the probability of winning the lower tier prize is the equivalent of the probability of winning on a smaller map with M grid units, even though the game is played on a larger map with G grid units. Self-evidently K t  is a monotonically increasing (but not strictly monotonically increasing) sequence, i.e.: 
     
       
      
       K 
       t 
       ≦K 
       s 
       ∀t&lt;s  
      
     
     In the example, after 100 grid units are selected without finding the prize, there are 900 grid units remaining on the map. The probability of selecting the highest tier prize is 1 out of 900. If keys were not dynamically adjusted as the game progresses, the probability of selecting the lower tier prize is 5 out of 900. However, this probability is not what the probability of finding the lower tier prize would be in a map with only 200 starting grid units. After 100 grid units are selected, there remains only 100 grid units in that map and thus, a probability of finding the prize of one out of 100, or 1 percent. As such, the probability of winning the lower tier prize in a map containing 1000 grid unit map (with 900 grid units remaining) must also be adjusted to be 1 percent. Using the formula above, the following values are used in the formula: 
     
       
         
           
             G 
             = 
             1000 
           
         
       
       
         
           
             M 
             = 
             200 
           
         
       
       
         
           
             t 
             = 
             100 
           
         
       
       
         
           
             
               K 
               100 
             
             = 
             
               
                 ⌊ 
                 
                   
                     1 
                     , 
                     
                       000 
                       - 
                       100 
                     
                   
                   
                     200 
                     - 
                     100 
                   
                 
                 ⌋ 
               
               = 
               
                 
                   ⌊ 
                   
                     900 
                     100 
                   
                   ⌋ 
                 
                 = 
                 9 
               
             
           
         
       
     
     It is determined that a total of 9 keys must be in the map after 100 grid units have been selected. With 9 keys, there is a probability of winning a lower tier prize of 9 out of 900, or a 1 percent. Thus, the number of keys will be dynamically adjusted each time a selection is made in order to ensure a consistent probability of winning lower tier prizes as if played in a smaller map. Other formulas and algorithms may be used in order to determine how many keys may be added and the formula used above is just one of many possibilities. 
     The Key Treasure Hunt game may also be used to limit the number of turns the game may have before all of the prizes are found. This is possible by setting the number of adjusted grid units M to the desired maximum number of turns. For a Key Treasure Hunt game of at most 100,000 turns on a 60,000,000 grid unit map—which for brevity we write KTH(60,000,000, 100,000)—the number of keys hidden once we reach turns 0, 100, 1,000, 50,000, 90,000, 99,000, 99,745, 99,988, 99,989, 99,990, 99,997, 99,998, 99,999 is: 
                                                 Max   Approx. odds   Unsearched   Keys on       Turn   turns left   of winning   Geos   Map                                                    0   100,000   1/100,000   60,000,000   600       100   99,900   1/99,900   59,999,900   600       1,000   99,000   1/99,000   59,999,000   606       50,000   50,000   1/50,000   59,950,000   1,199       90,000   10,000   1/10,000   59,910,000   5,991       99,745   255   1/255   59,900,255   234,902       99,988   12   1/12   59,900,012   4,991,667       99,989   11   1/11   59,900,011   5,445,455       99,990   10   1/10   59,900,010   5,990,001       99,997   3   1/3   59,900,003   19,966,667       99,998   2   1/2   59,900,002   29,950,001       99,999   1   1/1   59,900,001   59,900,001                    
There are several possible variants on the base KTH. One notable one is the Limited Key Treasure Hunt (LKTH). An LKTH is simply a KTH which ends early by putting keys under all unsearched grid units at an earlier turn than in a normal KTH game. Specifically, an LKTH(G, M, e) is a modification of a corresponding KTH(G, M) where at turn M−e, G−M+e keys are hidden on the map (thus forcing a winner on that turn). For instance, for an LKTH(60,000,000, 100,000, 10), the table above would be amended to remove turns 99,990 and beyond, and force the game to end by that turn at the latest:
 
     
       
         
           
               
               
               
               
               
             
               
                   
               
               
                   
                   
                 Approx 
                   
                   
               
               
                   
                   
                 odds of 
                 Unsearched 
                 Keys on 
               
               
                 Turn 
                 Max turns left 
                 winning 
                 Geos 
                 Map 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
               
               
               
            
               
                 0 
                 100,000 − 10 = 99,990 
                 1/100,000 
                 60,000,000 
                 600 
               
               
                 100 
                 99,900 − 10 = 99,890 
                 1/99,900 
                 59,999,900 
                 600 
               
               
                 1,000 
                 99,000 − 10 = 98,990 
                 1/99,000 
                 59,999,000 
                 606 
               
               
                 50,000 
                 50,000 − 10 = 49,990 
                 1/50,000 
                 59,950,000 
                 1,199 
               
               
                 90,000 
                 10,000 − 10 = 9,990 
                 1/10,000 
                 59,910,000 
                 5,991 
               
               
                 99,745 
                 255 − 10 = 245 
                 1/255 
                 59,900,255 
                 234,902 
               
               
                 99,988 
                 12 − 10 = 2 
                 1/12 
                 59,900,012 
                 4,991,667 
               
               
                 99,989 
                 11 − 10 = 1 
                 1 (NB 
                 59,900,011 
                 59,900,011 
               
               
                   
                   
                 not 1/10) 
               
               
                   
               
            
           
         
       
     
     The potential advantages of an LKTH over a KTH are twofold. It simplifies some aspects of implementation because removing a small number of moves from the end of a KTH can dramatically decrease the number of random key positions that need to be generated. And, especially if the exact value of the parameter e is not revealed to players then, for very small loss of revenue, it could increase player excitement that the game could end at any time with a guaranteed winner. 
     Trivially, any KTH(G, M) is also an LKTH(G, M, 0). In other words, KTHs are a subset of LKTHs. In the analysis below, most of what is said about KTHs applies equally to LKTHs with the changes made for the final possible turns of the game. 
     As can be seen, not every turn in a (L)KTH necessarily results in an increase in the number of keys hidden on the game board. Thus a sequence Key Increment Turns, I 0 , I 1 , . . . I n  may be determined, the sequence listing the turn numbers on which the number of keys increases. For convenience, I 0 =0. For example, for KTH(60,000,000, 100,000), I 1 =167. As seen from the following calculation using the above-described formula, the number of keys necessary for the map increments from 600 to 601 on turn 167: 
     
       
         
           
             
               K 
               166 
             
             = 
             
               
                 
                   60 
                   , 
                   000 
                   , 
                   
                     000 
                     - 
                     166 
                   
                 
                 
                   100 
                   , 
                   
                     000 
                     - 
                     166 
                   
                 
               
               = 
               
                 
                   
                     59 
                     , 
                     999 
                     , 
                     834 
                   
                   
                     99 
                     , 
                     834 
                   
                 
                 = 
                 
                   
                     600 
                      
                     
                       
                         99 
                         , 
                         434 
                       
                       
                         99 
                         , 
                         834 
                       
                     
                   
                   = 
                   600 
                 
               
             
           
         
       
       
         
           
             
               K 
               167 
             
             = 
             
               
                 
                   60 
                   , 
                   000 
                   , 
                   
                     000 
                     - 
                     167 
                   
                 
                 
                   100 
                   , 
                   
                     000 
                     - 
                     166 
                   
                 
               
               = 
               
                 
                   
                     59 
                     , 
                     999 
                     , 
                     833 
                   
                   
                     99 
                     , 
                     834 
                   
                 
                 = 
                 
                   
                     601 
                      
                     
                       200 
                       
                         99 
                         , 
                         833 
                       
                     
                   
                   = 
                   601 
                 
               
             
           
         
       
     
     The following Python program outputs (to stdout) a CSV file showing the Key Increment Turns for a KTH of at most T turns on a G Geo board (where G and T are supplied as command-line arguments): 
                                #       # Treasure Hunts Key Increment Calculator       #       # Takes two arguments:       # number of Geos on the game board       # maximum number of turns in the game       #       # Outputs CSV of Increment, Turn, Num Keys       #       importargparse       parser = argparse.ArgumentParser(description=‘Calculate Key       Increment Turns’)       parser.add_argument(‘numGeos’, metavar=‘G’, type=int, nargs=1,       help=‘number of Geos on the game board’)       parser.add_argument(‘maxTurns’, metavar=‘M’, type=int, nargs=1,       help=‘maximum number of turns in the game’)       args = parser.parse_args( )       numGeos = args.numGeos[0]       maxTurns = args.maxTurns[0]       incrementNum = 0       curKeys = 0       print “Increment, Turn, Num Keys”       for turn in range (maxTurns):       thisTurnKeys = (numGeos − turn) / (maxTurns − turn)       ifthisTurnKeys&gt;curKeys:         #print “Increment”, incrementNum, “is at turn”, turn, “when       there are”, thisTurnKeys, “keys”         print incrementNum, “,”, turn, “,”, thisTurnKeys       curKeys = thisTurnKeys       incrementNum += 1                    
Running this program with parameters for KTH(60,000,000, 100,000) produces a list of the 14,880 Key Increment Turns for this game. Running a variant of this code, suggests that, for any value of M (1≦M≦60,000,000) the number of KITs in KTH(60,000,000, M) is always lower than 16,000.
 
     To determine the number of locations that key need to be buried at the start of KTH(G, M) game, the following formula may be used: 
     
       
         
           
             
               
                 K 
                 
                   M 
                   - 
                   2 
                 
               
               + 
               M 
               - 
               2 
             
             = 
             
               
                 
                   ⌊ 
                   
                     
                       G 
                       - 
                       
                         ( 
                         
                           M 
                           - 
                           2 
                         
                         ) 
                       
                     
                     
                       M 
                       - 
                       
                         ( 
                         
                           M 
                           - 
                           2 
                         
                         ) 
                       
                     
                   
                   ⌋ 
                 
                 + 
                 M 
                 - 
                 2 
               
               = 
               
                 
                   ⌊ 
                   
                     
                       G 
                       - 
                       M 
                       + 
                       2 
                       + 
                       
                         2 
                          
                         
                             
                         
                          
                         M 
                       
                       - 
                       4 
                     
                     2 
                   
                   ⌋ 
                 
                 = 
                 
                   ⌊ 
                   
                     
                       G 
                       + 
                       M 
                       - 
                       2 
                     
                     2 
                   
                   ⌋ 
                 
               
             
           
         
       
     
     This is because:
         By turn M−1, every unsearched grid unit contains a key.   By turn M−2, K M-2  keys are hidden.   By turn M−2, there will be M−2 searched grid unit. So there will be up to M−2 grid units originally planned to contain keys that by turn M−2 are no longer valid hiding places.
 
Similarly, for an LKTH(G, M, e) game, to predetermine all locations where keys might be buried, then the number of grid units to be selected is
       

     
       
         
           
             
               
                 K 
                 
                   M 
                   - 
                   e 
                   - 
                   2 
                 
               
               + 
               M 
               - 
               e 
               - 
               2 
             
             = 
             
               
                 
                   ⌊ 
                   
                     
                       G 
                       - 
                       
                         ( 
                         
                           M 
                           - 
                           e 
                           - 
                           2 
                         
                         ) 
                       
                     
                     
                       M 
                       - 
                       
                         ( 
                         
                           M 
                           - 
                           e 
                           - 
                           2 
                         
                         ) 
                       
                     
                   
                   ⌋ 
                 
                 + 
                 M 
                 - 
                 e 
                 - 
                 2 
               
               = 
               
                 
                   ⌊ 
                   
                     
                       G 
                       - 
                       
                         ( 
                         
                           M 
                           - 
                           e 
                           - 
                           2 
                         
                         ) 
                       
                       + 
                       
                         
                           ( 
                           
                             M 
                             - 
                             e 
                             - 
                             2 
                           
                           ) 
                         
                          
                         
                           ( 
                           
                             e 
                             + 
                             2 
                           
                           ) 
                         
                       
                     
                     
                       e 
                       + 
                       2 
                     
                   
                   ⌋ 
                 
                 = 
                 
                   ⌊ 
                   
                     
                       G 
                       + 
                       
                         
                           ( 
                           
                             M 
                             - 
                             e 
                             - 
                             2 
                           
                           ) 
                         
                          
                         
                           ( 
                           
                             e 
                             + 
                             1 
                           
                           ) 
                         
                       
                     
                     
                       e 
                       + 
                       2 
                     
                   
                   ⌋ 
                 
               
             
           
         
       
     
     Predetermining key locations brings up two implementation issues: efficiency of storage and security of storage. 
     For a KTH(60,000,000, 100,000) game, 60,999,998/2=30,049,999 grid units may require ID designations in advance. 
     For an LKTH(60,000,000, 100,000, 10) game, 
     
       
         
           
             
               
                 ⌊ 
                 
                   
                     60 
                     , 
                     000 
                     , 
                     
                       000 
                       + 
                       99 
                     
                     , 
                     
                       988 
                       × 
                       11 
                     
                   
                   12 
                 
                 ⌋ 
               
               = 
               
                 
                   ⌊ 
                   
                     
                       61 
                       , 
                       099 
                       , 
                       868 
                     
                     12 
                   
                   ⌋ 
                 
                 = 
                 5 
               
             
             , 
             091 
             , 
             655 
           
         
       
     
     grid units may require ID designations in advance. 
     In one exemplary embodiment, the approach to storing predetermined key locations may include the following steps:
         Before the game starts, generate sufficient unique grid unit IDs and encrypt the IDs with a two-part public key. The application may require two separate system administrators from a administrator group of at least 2 or 3 administrators to type in their passwords to begin generating the IDs.   Store the encrypted data in the database (DB) and with some external game validator well known in the art. This may be done for numerous games in succession such that there are backlogs of games to be played.   Start two or more instances of a load-balanced Treasure Hunt Key Server (THKS), also known as the “Scratch Server”—again, this may require two separate system administrators to enter encryption codes from the group of administrators.   The THKS may then receive the encrypted grid unit ID list and decrypts the list to memory. It also may receive and store information of the number of turns that have been played in the current game and the grid units have been selected (i.e. searched).   The grid units that have been selected may then be stored in a bitmap in memory. This bitmap may be updated each time a Key Increment Turn (KIT) is reached. Periodically the bitmap may be saved to disk or database along with the latest turn number. This may save numerous database accesses to determine the individual turns.   Based on the last KIT reached and knowledge of which grid units have been selected, the THKS may construct another bitmap in memory, storing which grid units contain hidden Keys. This bitmap may never be written to the disk or database.   For an LKTH(60,000,000, 100,000, 10) game:
           The unencrypted list of grid unit IDs is 5,091,655×4 bytes≈20 MB   Each of the two bitmaps (searched/unsearched grid units, grid units with keys) takes 60,000,000/8 bytes≈7.5 MB   The list of KITs takes (14,880−10)×4 bytes≈60 KB   The mapping of non-sequential grid unit IDs to positions in the bitmap will require an amount of additional memory related to the number of continuous ranges in the IDs   
           Each time a player selects a grid unit in the game, the application server handling her/his session may transmit a request to one of the THKSs to do so. This THKS has write access to a database table listing all turns taken in the game and include information such as the turn number, timestamp, grid unit ID, user ID, and results of each grid unit selection. Application servers have read-only access to this table. By serializing inserts to this table and making grid unit ID a primary key, turn numbers as a result are sequential. Scratch server may update this table and return response to request from an app server such as that described below.       

     Collectively, the unencrypted list of grid unit IDs and the bitmap listing grid units with keys are called the Table of Answers.  FIG. 22  is a block diagram illustrating an exemplary system  2200  for facilitating a GeoSweep Treasure Hunt game in accordance with one embodiment of the present invention.  FIG. 22  depicts a gaming server  2208  connected to a database  2220 , a scratch server  2232  and an app server  2228 , which also communicates with the scratch server  2232 . In addition, the scratch server  2232  and the app server  2228  are connected to a current game database  2236 . The gaming server  2208  is connected to network  2204 , which allows communications with a plurality of computing devices  2212 , payment provider  2216  and advertiser server  2224 . The gaming server  2208 , computing devices  2212 , payment provider  2216 , advertiser server, network  2204  and database  2220  of  FIG. 22  have many of the same capabilities of the corresponding devices described in connection with the systems described with  FIG. 4  and  FIG. 13  The underlying hardware and software structure of each of these devices, therefore, will not be discussed in detail. The capabilities of the devices of  FIG. 4  and their embodiments may be incorporated into the corresponding devices in  FIG. 22 . While the following description of the system  2200  describes the capabilities of the system  2200  in connection with a Key Treasure Hunt game, the various components and capabilities of the components, including those of the scratch server  2232 , the app server  2228 , and the current game database  2236  may be used in establishing any of the other embodiments of games described herein. 
     Generally, players at a plurality of computing devices  2212  may play the Key Treasure Hunt game by interacting and communicating with the gaming server  2208 . Information about the game, such as the map, the prizes, the prizes&#39; location are transmitted to the computing devices  2212  where the players can view the information and make decisions accordingly with regard to the game, such as selecting a particular grid unit or purchasing additional tokens. The selections and requests of the players at the computing devices  2212  are transmitted to the gaming server  2208  for processing. Just as in the systems  1300  and  400 , the gaming system  2208  also communicates with payment providers  2216  to process requests by players to purchase additional tokens in the game. Further, the gaming server  2208  may also communicate with payment providers  2216  to transfer prizes or jackpots won by players to the players&#39; bank accounts. Similar to the system  1300 , the gaming server  2208  has the capability to transmit information containing advertisements to players at computing devices  2212 . This is made possible by its communications with advertiser server  2224  in order to gather data concerning the advertisements. The manner in which these devices communicate in order to process the players&#39; requests are similar to those already described in connection with the systems  1300  and  400  and will not be described in further detail. 
     Unique to the system  2200  is the use of scratch server  2232 , app server  2228  and current game database  2236 . Unlike the systems  1300  and  400 , the database  2220  that is directly accessible by the gaming server  2208  may not contain information concerning the particular iteration of the game. Such information is contained separately in a current game database  2236 . In other words, while the database  2200  contains information related to the players profile, the player&#39;s financial information, the play history, the advertisements and various technical information, the current game database  2236  contains information related to the players&#39; selections grid units for each round of the active current game. This includes information concerning each turn such as the grid unit ID, grid unit location, selection identification, time of selections, user identification of selector, and results of the selections. The current game database will also contain the Table of Answers. In certain embodiments, the database  2220  and the current game database  2236  are contained in one single database. In these embodiments, the gaming server  2208  may have access to all of the information in this single database. Alternatively, the gaming server  2208  may only have permission to read or make changes to certain portions of the database and may only make changes or view the other portions by controlling the scratch server  2232 . 
     As seen in  FIG. 22 , the gaming server does not have direct access to the current game database  2236  but does have access to the general information contained in database  2220 . The gaming server  2208  may transmit instruction signals and information to the scratch servers  2232  and app servers  2228 . The scratch server  2232  has the ability to make changes to the current game database  2236 . In contrast, the app server  2228  may only request information from the current game database  2236  and may not directly make changes to it. Instead, the app server  2228  may only request changes to the database by transmitting a request to the scratch server  2232 . There may be any number of scratch servers  2232  and app servers  2228  in similar embodiments of the presently disclosed invention. Multiple app servers  2228  may be used to handle multiple requests by the gaming server  22208  in parallel. Similarly, multiple app servers may handle multiple requests to make changes to the current game database  2228  in parallel with each scratch server responsible for a portion of the database. 
     In other embodiments, the scratch server  2232  or app server  2228  may be incorporated into the gaming server  2208  such that the gaming server  2208  will have the capabilities of these devices. In yet other embodiments, the scratch server  2232  and the app server  228  may be incorporated into one server. 
     Prior to the start of a Key Treasure Hunt game, the gaming sever  2208  may transmit an instruct signal to the scratch server  2228  to generate the Table of Answers—or else the Table of Answers may be generated on another machine, stored in an encrypted fashion, and subsequently read in and decrypted by the scratch server. In certain embodiments, including embodiments wherein the functions of the scratch server  2228  are incorporated into the gaming server  2208 , this may occur automatically without the requirement of an instruct signal. Using predetermined gaming settings such as the number of grid units in the map, the number of prizes, and the maximum number of turns desired in the game, the scratch server may generate the Table of Answers. In particular, using the number of grid units and the maximum number of turns, the scratch server  2232  can determine the sequence of Key Increment Turns in the game, such as by using the Python code disclosed above. For each turn in which a key is known to be added to the map, the scratch server  2228  may randomly determine the key&#39;s location using any of the known methods including those previously discussed in connection with the other embodiments of the present invention. One of ordinary skill in the art would realize that additional, previously discussed factors may also be used to generate the Table of Answers including the number of tiers of prizes, the desired number of maximum turns for each tier of prizes. 
     After the Table of Answers is generated, it may be encrypted and stored at the current game database  2236 . In one preferred embodiment, the Table of Answers is encrypted with a public key. Any known manner of encryption by one of ordinary skill in the art may be used including the Data Encryption Standard (DES) algorithm, Advanced Encryption Standard (AES) algorithm, Twofish, Serpent, Triple DES, International Data Encryption Algorithm, RC4 or other known symmetric key algorithms. In certain embodiments, asymmetric encryption may also be used. 
     Each scratch server may access the information in the current game database  2232  by downloading the information, decrypting it with a private encryption key well known in the art, and storing the information in its local memory. 
     When a player views information concerning the currently played game, such as map information, previous selection information, current available prizes information, prize award history and all other relevant information, the client&#39;s computing devices  2212  may request the information from the gaming server  2208 . The gaming server then may transmit a signal that requests such information from the app server  2228 . The app server  2228 , with its read-only access to the current game database  2236 , may then receive the information and reply to the gaming server  2208 . Using this information, the gaming server may format the information in a manner that may be received by client device  2212  and displayed to the player. 
     When a player selects a grid unit during a play of the Key Treasure Hunt game, the gaming server  2208  may receive this request and transmit a signal to at least one app server  2228 . At least a portion of the transmitted signal contains information concerning the request including the grid unit ID, grid unit location, selection identification, time of selections, user identification of selector, and results of the selections. Upon receiving this request, the app server  2228  will transmit a request to at least one scratch server  2232 . 
     Using the information contained in the signal, the scratch server  2232  may then record the changes in the current game database including recording the current selections. In addition, the scratch server  2232  may have the capability to determine whether the player wins the prize by using the information contained in the current game database and in particular the information contained in the Table of Answers. Using the known current turn number and the requested grid unit to be selected, the scratch server  2232  may determine that the player wins if the current turn number is greater than or equal to the key increment turn entry for the selected grid unit. The scratch server  2232  may then update the current game database  2236  with the players&#39; winnings along with other information. In certain embodiments, the app server  2232  has the capability to determine whether the player wins. The app server  2232  would then transmit a signal to the scratch server  2232  to make the necessary changes to the current game database to update the winnings of the player. In any case, the app server  2228  and scratch server  2232  ultimately transmit various signals back to the gaming server  2208  disclosing the results of the players&#39; selections. The gaming server may then transmit a signal back to the client device  2212  in a form that the client devices may properly process and display to the players. 
     In certain embodiments, when the scratch server receives a request to change a portion of the current game database  2236 , it places the request in a queue. The requests in the queue may then be processed in the order received. In certain embodiments, certain requests may have priority over all others and therefore may be processed immediately when received. For example, it may be a request by a player who has been given a bonus selection that grants priority over all others. 
     In embodiments in which there are multiple scratch servers  2232 , the scratch servers  2232  work together in order to ensure that the data in the current game database  2236  are updated correctly. In one embodiment, portions of the database  2236  are divided among the scratch servers  2236  with each portion assigned to one server  2236 . This may ensure that data is correctly updated. In another embodiment, there is a primary scratch server  2232  that receives all requests. It may then, in real-time, assign a particular scratch server  2232  to update the database while ensuring that access to the same portion of the database is not, at the same, given to another server. Using these methods, the current game database  2236  may be changed by multiple scratch servers  2236  in parallel. The primary scratch server  2236  will ensure that the results are the equivalent to results when processed sequentially by one scratch server  2236 . 
     In certain embodiments of the disclosed invention, each grid unit may contain a plurality of layers. A layer of a particular grid unit may not be accessed until the layer above that particular layer has been accessed. Therefore, in the play of the game, when a player selects a grid unit, he or she is automatically selecting the next available layer in that grid unit. 
     Prizes are distributed throughout the map in various grid unit layers. In addition, the prizes that are on the lower layer may be more valuable than the prizes in the higher layers. A prize that is hidden at the grid unit might reside in one particular layer and not the other layers. In certain embodiments, the treasure may be found on multiple layers of a grid unit, requiring the player to select successfully all of the adjoining layers that includes portions of the prize without an intervening selection by other players. In addition, the number of layers a grid unit may have may vary from grid unit to grid unit. Even further, in certain embodiments of the present invention, the probability that a prize may be in a layer of a particular grid unit will be higher when there is a prize located in another layer of that same grid unit. 
     There may be various ways in which a map with multiple layers may be presented to the player. For example, there may be no indication that there are layers at all. After a layer has been selected and a prize is awarded (if won), the map may simply depict that the grid unit is still available for selection. It is only when all grid units have been selected that the grid is indicated as not selectable. 
       FIG. 23 , which depicts the game&#39;s interface  2300  showing the map with a plurality of grid units, further shows other manners in which layers may be presented. Each grid units may indicate the number of layers for that particular grid unit that has already been selected. For example, grid unit  2304  shows that the player has selected the grid unit once and accessed the top layer. Further, grid unit  2308  indicates that all of the layers have been selected by the players of the game and cannot be further selected. In certain embodiments, each grid unit may be selectable to find further information about the unit. A menu  2312  may be overlaid on the map in the interface  2300  that shows certain information of the grid, such as how many tiers have been selected, whether prizes have been won in those layers, who selected the layer and other pertinent information. In another embodiment, when a grid unit is selected, a three dimensional depiction of the grid unit is shown with each layer of the grid unit as part of the unit. For example, the three-dimensional grid unit might be a box, representing a square grid unit with a predetermined depth. Where there are three grid layers, the top one third of the box may be depicted as one layer. As one example, it may be shown as water. The next one third of the box may then be shown, for example, as dirt. Finally, the bottom one third of the grid unit may be depicted as bedrock. A previously selected layer may be grayed out or it may be depicted as previously dug. Selecting individual layer may allow the player to learn more about each layer. Thus, the use of layers in the map allows for prizes to be hidden in multiple layers of each grid unit. Players may use these information interfaces to make his or her selection of grid units. 
     In some embodiments of the GeoSweep Treasure Hunt game, prizes may be distributed throughout the map in clusters of grid units. In the predetermined play of the game, prizes are distributed in the map in random clusters prior to the start of the game. These clusters may be of varying sizes, location and distribution. These clusters may also have various shapes. Thus, prizes might be located long a line or in a certain shape such as a box, star or triangle. There may be grid units within these clusters that do not contain prizes. 
     Prizes in games of the disclosed invention may be larger than one grid unit. A player may be required to select successfully all of the adjoining grid units prior to any other players in order to win the entire prize. Alternatively, the player may win portions of the prize for selecting each grid unit containing the portion of the large prize. In these instances, he may also receive a larger prize, such as a jackpot, if he is able to successfully select all of the grid units that contain the entire prize. In certain embodiments, the selection of a grid units results in the display of a portion of picture or shape in the selected grid unit, as seen in  FIG. 24 . Thus, as seen in  FIG. 24 , the portions of these grid units that have been revealed may offer players a hint of where the related portions of the prize may be, in this case, the remains of a dinosaur fossil. In yet another embodiment, portions of a prize may be distributed randomly throughout the map. When the player successfully selects of the grid units associated with the larger prize, he or she may win a bonus prize or the jackpot. 
     In embodiments of the game where the map depicts real world locations, such as the city of New York, prizes may in be placed in grid units of various real world locations. For example, prizes may be placed in grid units of all football stadiums in the map. This manner of distributing prizes may also allow advertisers to sponsor prizes that are located at real world locations of its business. For example, every grid containing a business location or an Automatic Teller Machine of a certain bank in New York City might contain a prize. When a player selects the winning grid unit, an advertisement may be shown to the player in a manner of previously discussed above. The player will then win the prize. Importantly, the placement of prizes in these locations could offer players a hint that other bank locations and ATMs may contain prizes. In certain instances, prizes may be won multiple times at these sponsored locations by different players. As will be later discussed, this also gives players an incentive to play the game using a mobile device with Global Positioning Systems. 
     In other embodiments of the present invention, there is a higher probability that a grid unit contains a prize when one or more proximate grid units have prizes. Thus, in the dynamic play of the game, when a player selects a grid unit, the probability that he or she will win the prize may be greater when players have won prizes in proximately located grid units. In one embodiment, the winning factor, F W , may be greater for these grid units than for grid units that are not near any winning grid units. In the embodiments of the game containing tiers, the probability of finding keys may also be higher when nearby grid units contains keys. In embodiments of the GeoSweep Treasure Hunt game containing layers, the prizes are also clustered in groups of proximate grid units and each grid units&#39; various layers. 
     In certain embodiments of the presently disclosed invention, players may have the ability protect and reserve grid units. In the playing of a game, there are instances in which the player may find it advantageous to hide the results of his selections. For example, in games that includes clusters of prizes and in games that reveal pictures or videos in selected grid units that offer hints of the locations of other prizes, players may be at a disadvantage if his winning results or the underlying portions of a picture were revealed to other players. In such instances, players may have the ability to pay a certain number of tokens in order to delay the revealing of his results for a period of time or for a number of rounds. The player may have to pay more tokens for longer periods of delay. As a more severe measure of protection, the player can also reserve grid units that he or she has not selected yet but plans to select in the future. Using this mechanism in the game allows the player to prevent other players from selecting the grid units for a period of time or number of rounds. The number of tokens that are required in protecting grid units may be even greater than the number of tokens required in hiding the results from the public. 
     In yet another embodiment of the disclosed invention, players may play the game on mobile devices. The mobile devices may be considered a computing device and therefore may have various components and capabilities of the computing device previously discussed in connection with  FIG. 4 . In addition, these mobile devices may contain a Global Positioning System that allows the location of the mobile device to be determined. Any mobile device that contains the ability to determine the location of the mobile device is well within the scope of presently disclosed invention. This may include any assisted global positioning systems (A-GPS), hybrid global positioning systems (HGPS), and also any other systems that may use cellular, radio or other wireless technologies to determine the location of a device. 
     Players of the game using mobile device may have access to features unique to these players. Particularly, in a game with a map of real world locations, players may have access to grid units that are otherwise inaccessible to players that play on non-mobile devices. These grid units may require players to be physically located at the real-world location depicted in the grid unit of the game in order to select the grid unit and therefore determine whether there is a prize at the grid unit. Other grid units may allow players to select the grid unit even when the player is not located at the location, but may offer the a higher tier prize or offer a higher probability of winning a prize for players that are physically located at corresponding location. In certain embodiments, the selection of the grid unit occurs automatically when the player is at the location associated with the grid unit. This feature may be used by businesses to reward players who visit the business&#39;s retail location. For example, a grocery store may reward players who enter its store by giving the players access to the grid unit containing the grocery store. The player may also be rewarded with a coupon for an item in the store. Thus, prizes associated with these locations may be used to further promote the business. 
     Certain embodiments of the disclosed invention allow the use of retail locations and real world tickets in combination with the online map-based game disclosed herein. At retail locations, a gaming machine may allow users to play the game including various embodiments and features discussed herein.  FIG. 25  depicts one such machine, which is shown to have a display  2504  and input devices such as a keyboard  2504  and joystick  2512 . Other manners of input may be used in various other embodiments. The machine may be a computing device containing many of the components well known in the art of a computer. It may also have many of the same capabilities previously discussed as the computing devices of  FIG. 4  including the ability to connect to the network such as the Internet. Users may insert money to receive a token within the game using the money slot  2516 . Alternatively, he or she may log into the machine using his game account. The player may play the game in the same manner previously described, such as by selecting a grid unit and contributing one or more tokens. If the player wins, he or she may be credited with the jackpot or prizes within the game. When the player leaves the game, he or she may have a ticket printed out from the machine that indicates how much the player has won and what other bonuses that he or she may have received from playing the game at the retail location. Alternatively, he may update this account using the machine&#39;s connection to the network such as the network depicted in  FIG. 4 . The player may also redeem his winnings at a retail location either from a winnings bin  2520  or from a cash register at the retail location. The winning bin  2420  may output cash and coins of the player&#39;s winnings. 
     With the ticket, the player may perform a wide variety of actions. For example, the player may use the information contained on the ticket at a computing device, such as those discussed in connection with  FIG. 4 . He might log into his account a computing device and enter the information on the ticket, whereupon his credit winnings may be added to his account. In certain embodiments, computing devices with a camera may be used to enter into the information on the ticket. The camera might be used to take a picture or video of the ticket. The game or computing device may automatically detect information on the ticket and update the user&#39;s account accordingly. This may be possible through any known methods of data detection of an image or video such as Optical Character Recognition and bar code detection. In one embodiment, radio frequencies may be used to detect tickets, such as by way of Radio Frequency Identification (RFID) tags. The game or computing device may, in these cases, contain devices that may detect these tags and process the information accordingly. 
     Additional bonus abilities or tokens may be redeemed on computing devices from the tickets. For example, players may receive free tokens in his account by playing at retail locations. The game may allow players to select grid units that are restricted from other players such as grid units that have been reserved by certain businesses as a means of promotion. In games that use real-world maps, players may be required to receive a ticket from the retail location associated with certain grid units in order to access the grid unit. For example, a bank in New York City may require players to receive a ticket at the real world location that are depicted in the grid unit in order to select the grid unit in the game. Therefore, a player may visit the actual world location depicted in the grid unit, such as the ATMs or bank, to receive a ticket that grants the player access in the game. 
     These grid units might have higher probability of winning a prize or be associated with exclusive prizes. Tickets might also allow players to gain access to exclusive games that are not publicly available to players. These games might have smaller maps with greater number of prizes, thereby giving the players a larger chance of winning 
     Tickets may give players a temporary probability boost in winning a prize, i.e. a “bonus period.” For example, in a “dynamic play” of GeoSweep Treasure Hunt, the player will receive a bonus period that boosts the player&#39;s chances in winning when he or she selects a grid unit. Thus, when the player selects a grid unit and the probability algorithm discussed above is executed, the chance of winning will be greater than during normal play. The value of the winning factor F W , therefore, will be greater than 1 for all grid units that the player selects during the bonus period. In certain embodiments, tickets may grant players a temporary boost for a certain number of selections. In a “predetermined play of the game,” a bonus period may give allow players to see hints of where the prizes may be. Thus for example, in a map of 200 available grid units with one known prize, 100 grid units may be grayed out in the game. Thus, the player&#39;s chance of receiving a grid unit is doubled during these bonus periods. 
     Scratch-card tickets may also be purchased from retail locations. These scratch card tickets may have all of the features of the traditional scratch-card ticket in which players may scratch off portions of the ticket to receive a prize. These scratch cards may grant users access to the various features that tickets from retail machines also grant users. For example, one of the prizes of these tickets may be a code that is redeemable on mobile devices, retail machines or computing devices, giving players extra tokens, access to exclusive games, or even bonus periods, to name a few. 
     Players who are selected as winners in GeoSweep, Free2Play, GeoSweep Treasure Hunt and their embodiments are awarded with prizes and jackpots including cash, game tokens, bonus periods, and physical prizes as previously discussed. In addition, in certain embodiments, winning players may be rewarded with an invitation to access at least one bonus game. The game may be another game of GeoSweep, Free2Play, GeoSweep Treasure Hunt or another game entirely and may be offer players better prizes and larger jackpots. In addition, these games may be exclusive to those who select the grid units containing these invitations. Other bonus games may be accessible to the public but require an entrance free to play the game. The player in these cases, would receive access for free. 
     The presently disclosed invention may also grant users access to a plurality of social networking functions. Because the sweepstake game may contain millions of participating users, these functions allow each player to meet, communicate and interact with other users of the game. Social networking may further promote and sustain the interests of the game over time. In addition to the basic and traditional social networking functions such as the ability to communicate with one another, embodiments of the presently disclosed invention also allow players to keep a list of players who they may know. This list may further allow the player to keep track of the status of those on the list. Thus, a player may know when another player is playing the game. The players may decide to talk with one another and to discuss strategies and recent winning grid units. Certain embodiments also allow a player to determine the grid units that another player has chosen, furthering the social effects. The players may also share media and information with one another. Finally, embodiments of the game also allow players to interact with those outside of the game. This includes the ability to invite others to the game. When a person is referred to the game, he or she may start playing the game with a certain number of tokens. Further, the player who referred the new player may also receive tokens for his efforts. Another feature is the ability to associate the player&#39;s profile to an external site, allowing the players to share the player&#39;s game information and status. Thus, when a player makes an announcement or wins the lottery, this event may be automatically announced to these external websites. 
     Prize Variations and Customizations 
     According to some embodiments of the present invention, in a GeoSweep game or other lottery-style games disclosed herein, the prizes may comprise other things of value. For example, a prize may comprise points or credits exchangeable for merchandise such as music, games, ring tones, entertainment tickets, meals, lodging, transportation fares, and so on. Alternatively, the prize may comprise a software application or game that can be directly downloaded and enjoyed, for example, on the same computing device on which the player plays the GeoSweep game. A prize may additionally or alternatively comprise the ability to customize a winning Geo unit or other Geo unit(s). Examples of customizations may include, but are not limited to, selecting and associating one or more of the following with a Geo unit: a player ID, an image, a background color, a foreground color, a visual pattern, custom text or symbol such as a trademark or logo. The player may have multiple Geo units with different customizations performed on each unit. The player may also be able to form a group of more than one Geo unit owned by them to perform the same customization on all the units in the group. The player may also be able to form multiple groups of units owned by them so that each group of units has a different customization performed on it. 
     The player may also be able to filter the list of available prizes by specifying certain criteria for desired prizes. Examples of such criteria may include, but are not limited to: business partner type, prize type and prize location. Examples of prize type may include: clothing, shoes, music, outdoor equipment, appliances, cars, food, drinks etc. Examples of business partner type may include: large multi-chain vendors, local vendors, designer brands, etc. The player may also be able to choose the prizes location such as where each prize can be redeemed or enjoyed. The location of the prizes could be a physical location, an online location, a virtual location or a fictional location. The player may be able to specify a combination of two or more criteria to filter the list of available prizes. 
     Trade Geos 
     Some embodiments of the GeoSweep games disclosed herein may also allow a player to trade one or more Geo units with another player, with a business partner and/or with the game itself A Geo unit may have multiple ownership rights associated with it just like legal land ownership in the real world. Examples of such rights may include: full use right, partial use right, possession right, product placement right, and mining/hunting rights (e.g., for treasure-hunt activities), etc. The player may be able to trade (e.g., swap, lease, buy, sell, or auction) one or more ownership rights associated with a Geo unit. The player may be able to perform such a trade with another player, with a business partner or with the game itself In exchange for trading the ownership rights associated with the unit, a player may receive in return one or more of the following: a Geo unit, a prize or a token. For one example, a player may trade with a business partner the right to place an advertisement or a brand name/logo on a unit in exchange for a prize such as a discount or a gift card. For another example, one player may temporarily “borrow” another player&#39;s Geo unit(s) to participate in a week&#39;s worth of lottery drawings and agree to share any winning proceeds. 
     Prize Zone and Winner based on Grouping 
       FIG. 26  illustrates another alternative payout structure in an exemplary GeoSweep game in accordance with one embodiment of the present invention. In this embodiment, unit D- 6  is again selected as a winner but it is not occupied by a player. That is, no player “owns” or “occupies” the first-prize-winning D- 6 . However, the game rules may be such that the eight neighbors of unit D- 6  form a prize zone around D- 6  and nevertheless become winners of second prizes due to proximity to the winning Geo. Further away from Geo unit D- 6 , the sixteen next closest neighbors of Geo unit D- 6  may still be winners of third prizes. For example, the second prizes may share 16% of the jackpot (i.e., 2% each), and the third prizes may share 16% of the jackpot (i.e., 1% each). According to other embodiments, additional “rings” of neighbors (or other nearby neighbors) may be included as winners of even lesser prizes. The prize zone feature may encourage GeoSweep players to band together (e.g., by forming a syndicate) and/or to coordinate the locations of their Geo units, in order to collectively achieve a better chance for each player to win something in the game. 
       FIG. 27  illustrates yet another alternative payout structure in an exemplary GeoSweep game in accordance with one embodiment of the present invention. In this embodiment, each Geo unit is associated with a unit indicator. Examples of unit indicators may include a symbol, an image, a region indicator, a business partner indicator, or any other mark that can be assigned to and shared by one or more units. In this embodiment, Geo unit D- 6 , which is associated with a unit indicator of an image of a star, is selected as a single first-prize winner. According to one embodiment of the game, any other Geo units that are also associated with a unit indicator of an image of a star may share in the first-prize with Geo unit D- 6 , or they may become winners of second prizes or other lesser prizes. In another embodiment, the unit indicator may be a region indicator such that all the Geo units with the region indicator represent a community. If unit D- 6 , associated with a region indicator is again selected as a first-prize winner, the other units that are also associated with the same region indicator may share in the first-prize with cell D- 6 , or they may become winners of second prizes. As those skilled in the art would appreciate, other mechanisms other than the unit indicator describe above may also be used to group or associate Geo units for purposes of determining their share of prizes. For example, the game system, one or more players, and/or a third-party sponsor may designate a certain attribute of a winning Geo as the criterion for other Geo units sharing the same attribute to be eligible for a share of the prizes. For instance, a department store chain such as Macy&#39;s may sponsor a game wherein, if the first-prize-winning Geo coincides with a Macy&#39;s store location, then all occupies Geo units at other Macy&#39;s store locations may become eligible for a share of the first prize or a lesser prize. In this example, the prizes may be Macy&#39;s gift cards, coupons, or other Macy&#39;s related things of value. 
     Casino/Terminal Play 
     Apart from being implemented as online games accessed via players&#39; personal computing devices, embodiments of the lottery-style games disclosed herein, such as GeoSweep games (including but not limited to the original GeoSweep games, GeoSweep Treasure Hunt games, and GeoSweep Free2Play games), may be alternatively implemented at a retail point-of-sales or in a casino or arcade environment.  FIG. 28  illustrates an exemplary embodiment of the lottery-style game in a casino or terminal style setting in accordance with one embodiment of the present invention. In this embodiment, the casino-based lottery-style game system  2800  comprises a processor  2805  that is coupled with at least one storage devices  2810 . The processor  2805  is connected through a communications medium over a Network  2815 , such as the internet, an intranet, a local-area-network (LAN), a wide-area-network (WAN), etc, to a user-interface  2820  and one or more terminal devices  2825   a  . . .  2825   n . A player may participate in the casino-based lottery-style game by accessing a terminal device  2825 . Each player may play on an individual terminal device  2825  but the contributions from each player, playing on multiple terminal devices  2825   a  . . .  2825   n  are pooled to form a multi-player game. The players may play against each other, collaborate to play against other teams of player, and/or play against the house. The terminal devices  2825   a  . . .  2825   n  may be placed in only one location or more than one location. An example would be for one set of terminals placed in Casino A and another set of terminals placed in Casino B. Players playing on terminals in Casino A can play among themselves or the house of Casino A, or they can play against the players playing on terminals in Casino B. Players may also form teams and play as a group against an individual player or another team of players. 
     Referring to  FIG. 29 , there is shown a flow chart illustrating an exemplary method of facilitating casino-based lottery-style games in accordance with one embodiment of the present invention. In step  2902 , a casino-based lottery game may be set up. The lottery game may be an ongoing one that is scheduled to have a plurality of lottery drawings over a period of time. For example, the lottery drawings may occur on a periodic basis, such as once or multiple times every hour, or one or more times every calendar day or every business day. As the lottery game is set up, a set of rules, terms and conditions may be published or otherwise communicated to potential participants. The rules may define how the lottery game is operated and how the lottery drawings are conducted, as well as calculation and payout of prizes, as will be described in more detail below. The terms and conditions may specify rights and obligations of persons participating in the lottery game and lottery drawings. 
     In preferred embodiments of the present invention, the lottery game is established in a casino and accessible via one or more terminals located in one or more casinos. The lottery game may be either an add-on or an integrated part of an existing casino game, wherein participation in the lottery game may enhance a player&#39;s experience at the associated casino game or vice versa. In step  2904 , players may be enrolled in the lottery game. Each person wishing to join the lottery game may be required to make a commitment to participate in a number of the scheduled lottery drawings. In one exemplary enrollment process, a player may (a) manifest consent to the set of rules, terms and conditions established in the lottery game and (b) deposit or pledge some amount of money or other things of value to be contributed to the game. The amount of initial deposit or pledge may depend on such factors as how many lottery drawings the player is obligated to participate in, how much wager the player is to enter for each drawing, the player&#39;s credit ratings, and so on. 
     Enrollment of players may be taken via a terminal located in a casino. In step  2906 , each enrolled player may be assigned one or more unique identifiers. Each player identifier (or player ID) may be a text string, a serial number, the terminal number or other symbols. According to one embodiment, each player ID may be associated with a “Lucky Star” of the player&#39;s choice. According to some embodiments, each player ID may comprise a machine readable portion (e.g., an alphanumeric string) and a human recognizable portion (e.g., a logo, icon or catch phrase). The assigned player IDs may be imprinted or encoded on a membership card. 
     In the drawings or games described herein, each registered player can participate with one or multiple player IDs. When participating with multiple player IDs, the rules regarding each of the multiple player IDs are the same as if each player ID is owned and controlled by a single player. For ease of illustration, it is assumed in the following description that each player participates with a single player ID. 
     In step  2908 , each player may designate the number of tokens to enter for each drawing. That is, with respect to each lottery drawing the player is committed to participate in, the player may specify a wager amount that is typically measured in the number of tokens. As used herein, a “token” may be or represent any physical or virtual thing of value that can be counted or quantified. For example, a token may be or represent one or more units of cash or credit. Or, a token may be or represent one or more points that are exchangeable for things of value. According to one embodiment of the present invention, one token may be the equivalent of one cent ( 1/100 of a dollar). According to another embodiment, one token may be or represent one value point that may be used to exchange for music downloads, cell phone ring-tones, or for other online or in-store purchases. According to yet another embodiment, one token may represent one unit of a game score in an online video game or a virtual society. According to still another embodiment, one token may be or can be exchanged for one or more units of mobile telephone airtime or long-distance telephone minutes. 
     The players may purchase tokens with their initial deposits. They may set up electronic fund transfers and/or automatic credit card payments to refill their accounts with tokens. A player&#39;s account may be replenished automatically as soon as its balance falls below a preset lower limit. Apart from winning or purchasing refills, the players may alternatively or additionally obtain tokens through bartering or by engaging in certain activities. For example, a player may exchange credit card cash-back bonus points for tokens. The player may also take part in online surveys, view online advertisements, or increase activity level at social networking or blogger websites to earn tokens. 
     The number of tokens designated for each lottery drawing should typically fall within a certain range. For lottery drawings that take place on an hourly basis, for example, there may be a hourly minimum and a hourly maximum for the number of tokens a player can contribute per player ID. According to one embodiment of the present invention, the hourly minimum may be one token (e.g., one cent or one pence) and the hourly maximum may be one hundred tokens (e.g., one dollar or one pound). The number of tokens that a player designates for each drawing may be any of a fixed value between and including the hourly minimum and the hourly maximum. Alternatively, the player may configure the hourly wager to be a variable amount. To have a minimal level of participation in the lottery game (thus a more predictable revenue from the game), the game system may be configured to prevent players from lowering their preset hourly wager amount for any upcoming drawings. 
     For each lottery drawing, a jackpot prize may be formed, in step  2910 , from two sources: (a) tokens contributed by players who participate in that drawing, and (b) tokens carried over from one or more previous drawings, if available. Tokens from the two sources may be pooled together into one jackpot. The jackpot (or a portion thereof) may account for a maximum payable amount for a winner of that lottery drawing. 
     In step  2912 , a random drawing from the player IDs may be conducted to select at least one winner. Note that the word “random” does not require randomness in the most rigorous statistical sense as such randomness is difficult to achieve. Instead, the word “random” implies a fair drawing process that does not appear to favor any one player more than any other player. The random (fair) drawing from the player IDs may be achieved in a number of computational methods as are well known in the gaming industry. According to some embodiments of the present invention, a single winner may be selected for each lottery drawing. According to some alternative embodiments, two or more winners may be selected for each drawing and they may share a prize fund on equal footings or according to an award hierarchy. 
     Then, in step  2914 , a proportional value may be calculated based on the number of tokens the selected winner(s) contributed versus the maximum number allowed per player ID. Assuming there is only one selected winner, the proportional value (F) may be calculated by dividing the number of tokens the winner contributed (n) with the maximum number a player is allowed to contribute (M) to that individual lottery drawing. That is— 
     
       
         
           
             F 
             = 
             
               n 
               M 
             
           
         
       
     
     If there are multiple winners, the proportional value may be calculated for each winner. For example, if a selected winner contributed the maximum number of tokens for that lottery drawing, the proportional value for that winner would be one (1) or 100%. If the selected winner contributed half of the maximum number of tokens allowed, the proportional value would be ½ or 50%. The proportional value calculated in this step may be represented with either a fraction or a percentage. 
     In step  2916 , a fraction of the jackpot (or maximum payable prize) may be provided to the selected winner(s) according to the proportional value calculated in step  2914  above. That is, whatever the full prize amount (P) a winner might have been entitled to had he or she contributed the maximum number of tokens (M), the actual payout amount (p) may be reduced to a fraction of that full prize amount in proportion to the number of tokens contributed (n). That is— 
     
       
         
           
             p 
             = 
             
               
                 F 
                 × 
                 P 
               
               = 
               
                 
                   n 
                   M 
                 
                 × 
                 P 
               
             
           
         
       
     
     The same proportional payout rule applies to single-winner as well as multiple-winner scenarios. The actual payout may be made by depositing tokens into a winner&#39;s account in the game system. Alternatively, the winner may receive the prize in the form of cash, points, airtime or long-distance minutes, other things of value, or a combination thereof. Other payout arrangements are also possible. 
     In step  2918 , the remainder of the jackpot prize may be rolled over to a next drawing. Unless one or more selected winners happen to have wagered the maximum number of tokens and therefore won the entire jackpot, there would always be some remaining jackpot to add to the jackpot of the next drawing. In addition, the enrollment rule ensures continuous participation in the ongoing lottery drawings. As a result, the jackpot may quickly snowball into a large amount, further increasing players&#39; interest in the game. 
     For business advantages, it may be preferable to set the maximum number of tokens that each player ID can contribute to each drawing at a relatively low value. For example, if the hourly maximum that can be entered for a hourly drawing is one dollar, a player can contribute as little as one cent but never more than one dollar. The player will not feel any significant financial impact or burden to continue playing the lottery game for many hours. By wagering the equivalent of pocket change on an hourly basis, the player may still enjoy a decent chance of winning a substantial amount of money. 
     Mobile Location-Aware Play Of Games 
     Embodiments of the GeoSweep games disclosed herein may also be able to use the player&#39;s physical location to assist in the selection of a unit. The actual, current or projected location of the player may be determined based on the location of the player&#39;s computing device from which the GeoSweep game is being accessed. As an example, the global positioning system (GPS) function on a player&#39;s mobile device may be used to determine the current or projected location of the player. As another example, the Internet Protocol (IP) address of the player&#39;s computing device or the cellular network data related to the player&#39;s mobile device may be translated into an approximate location of the player. The player&#39;s location may also be used for participation in merchant-sponsored events or contests. In an exemplary embodiment of the invention, the longer a player lingers around a particular location, the better the chance that the player may be awarded a Geo unit or other things of value related to the merchant or win a prize sponsored by the merchant. For example, the longer a player lingers around a Bloomingdale&#39;s store, the better the chance that the player may be awarded a Geo unit related to Bloomingdale&#39;s or win a prize sponsored by Bloomingdale&#39;s, such as a discount coupon or a gift card. 
     According to some embodiments, the player may make an in-app selection or purchase of Geo unit(s) on his/her computing device based on his/her physical location. The game app may alternatively generate a quick response (QR) code, a bar code, or other symbol or output based on the location of the player. For example, based on the player&#39;s location and level of participation in the game, a quick response code could be generated and displayed to the player. The player may then visit a lottery retail location, get the quick response code scanned by a point-of-sale device, and receive a corresponding lottery ticket. The lottery ticket may then be entered into a drawing in the game and the player may be eligible to win a prize. 
     Not only is the geolocation capability of a mobile device useful for assisting a player to interact with a GeoSweep game, it is also valuable for various other location-based functions and/or services such as targeted advertising, product/merchant promotions. In other words, GeoSweep on a mobile device may create a captive audience where the system knows the location of the participants. This is a unique opportunity to leverage the real-time location data of the audience for things other than the GeoSweep games, such as marketing for local merchants and the like. For example, if a player uses his mobile device to play a GeoSweep Treasure Hunt game, and it requires him to identify his current location, then that information can be passed back to the GeoSweep server (or other server(s)) and be used to deliver location-based advertisements and offers to the player. In general, according to embodiments of the present invention, where a lottery/gaming service (e.g., GeoSweep Treasure Hunt but not limited to it) requires, detects, or otherwise receives a player&#39;s current location for purposes of the game, that location information can then be used for purposes other than the game, like serving up ads or distributing local coupons, etc. Based on real-time, near real-time, or projected location information of multiple GeoSweep players, a server may determine how many players are at or near a particular location and then serving up location-related offers and other content accordingly. 
     Map Variations 
     The “map” associated with embodiments of the GeoSweep games may comprise any type of a graphical representation of a map or image object. For example, the map may also comprise a geographic or topographical map of a real or fictional location. The map may also comprise a three dimensional representation of a location, with the parcel or unit representing one or more three-dimensional components of the location. Examples of a three dimensional map may include: a building with one or more floors, such as the Empire State Building, where each floor is divided into one or more parcels or Geo units; a multi-level structure, such as the Statute of Liberty, with various sections of the structure represented by parcels or Geo units; or a topographic representation of a mountain with various contour lines dividing the mountain area into parcels or Geo units. 
       FIG. 30  is an exemplary embodiment of an apartment building  3010  where each apartment is represented by a parcel or Geo unit  3015   a ,  3015   b , . . . ,  3015   n . According to one embodiment, the Geo units of the apartment building  3010  may be reserved for its tenants. For example, each tenant may be automatically entered into a next drawing upon paying his or her rent on time. Similar GeoSweep game boards may be implemented for a hotel building with promotional features. 
     According to some embodiments, the GeoSweep map or gameboard may also comprise an image (two dimensional) or a physical object (three dimensional). Examples of an image may include a famous painting (e.g., The Mona Lisa) or a historical document (e.g., The Declaration of Independence), and examples of a physical object may include a mascot, a sculpture, a structure, a building, etc. 
       FIG. 31  is an exemplary embodiment of the GeoSweep™ balloon image  3110  that is divided into multiple units  3115   a ,  3115   b , . . . ,  3115   n , where each parcel or unit may be of a predetermined size and shape. Alternatively, the map may comprise a layout of a predetermined real or fictional location. Examples of a real or fictional location include a stadium, a theater, a ball park, a fictional world such as Atlantis, the bottom of the sea, etc. 
       FIG. 32  is an exemplary embodiment of a stadium  3210  where each seat is represented by a parcel or Geo unit  3215   a ,  3215   b , . . . ,  3215   n . According to one example, a football stadium may promote its ticket sales by associating each ticket or seasonal pass with GeoSweep gameplay. For instance, each ticket may have an add-on lottery component that may either be complementary or cost a small fee in addition to the ticket face value. Prior to, during, or subsequent to the corresponding football match, each ticket (or each participating ticket) may be entered into one or more GeoSweep drawings to win prizes that may be related to the stadium and/or football teams. 
     Second Chance Game System 
     Further variations of the present invention may combine a first game with a second game (hereinafter generally referred to as the “first chance game” and the “second chance game,” respectively). In particular, a preferred embodiment may allow a player to first play a ticket-based first chance game, and upon completion of the first chance game, gain access to play a computer-based, second chance game. Thus, in several examples illustrated below, the first chance game may be referred to as a ticket-based game and the second chance game may be referred to as a computer-based game. These references are meant to be exemplary only and should not be construed to limit the scope of the invention in any way. Indeed, while the second chance game may be a computer-based game according to some embodiments, other embodiments of the present invention allow players to play a second chance game that is simply on a different medium from the first chance game which, likewise, need not be a scratch ticket game. Preferably, the first chance game and the second chance game are played on different media, and they may have respective outcomes that are not correlated between the two games. 
     The player may be given access to a second chance game if the player loses the first chance game, for example. This embodiment of the second chance game system, therefore, offers players a “second chance” through which the player may not only continue to play, but also to win prizes. Potential players are more likely to purchase and play the first chance game if they believe that they may have more than one chance at winning a prize. Furthermore, this particular game system may allow players to feel that that they are getting more for their money—two games for the price of one—even if the players might ultimately lose in both games. 
     Alternatively, the second chance game may be accessible by even players who win in the first chance game. In such embodiments, the second chance game serves as an additional game that any player who participates in the first chance game, regardless of the outcome of the first chance game, can play and win additional prizes in a bonus game. The prize for the second chance game may even be the same as or similar to that prize offered in the first chance game. 
     Furthermore, in another embodiment, whether the player gains access to a second chance game may be randomly determined and need not be correlated to the results of the first chance game at all. Thus, the game design may offer players not only the chance to play the first chance game but also allow players to use a code—win or lose—to determine whether they qualify for, or win a prize in, a second chance game, further increasing excitement for players. 
     The second chance game system may be especially beneficial to game providers as this may be a way to extend player interests and prolong user interaction with the gaming products of the company. This may lead to increased interest in not only the ticket-based game, but also in the computer-based game. Moreover, the second chance game may serve as an effective platform for introducing players to new games or new variations of known games. As a result, the number of participating players in both the ticket-based game and the computer-based game may increase and additional revenue may be earned from increased sales of both games. Additionally, by providing a computer-based second chance game, various social network features may be integrated with the computer-based game so that players may socialize with other players and friends, family and acquaintances on the players&#39; social networks, further increasing interests in both games. 
       FIG. 33  is a flow chart illustrating a method for providing a second chance game in accordance with one embodiment of the present invention. At  3300 , the method begins. At  3304 , a first chance game may be established on a first medium, and the outcome of the first chance game may be predetermined In a preferred embodiment, where the first chance game is a ticket-based lottery-style game, the results of each instance of the ticket-based game may be determined prior to or upon launching of the first chance game. For example, each instance of the game may be represented by a so-called “instant win” lottery ticket that can be individually purchased by players of the first chance game and may reveal the win/lose results on the tickets themselves. The ticket-based game may be a type of scratch-card ticket including any scratch-card ticket implementations of any of the games disclosed herein. Furthermore, the ticket-based game may also be any types of instant win games known in the art, and the medium is not limited to a scratch-type paper ticket. Other types of game media capable of facilitating an instant win game can also be employed, such as pull-tab tickets. In fact, according to one embodiment, the first chance game may even be offered on a personal computing device (e.g., mobile phones) via a software application. For instance, the first chance game may be presented as an instant lottery “virtual ticket” displayed on an iPhone screen with areas that can be “scratched” or flipped to reveal a combination of lotto numbers. Other embodiments of games are further discussed in other portions of this disclosure. 
     According to embodiments of the present invention where the first chance game is a ticket-based game, each game ticket may be associated with a unique identifier, which may be used to identify each instance of the first chance game. In one embodiment, each unique identifier may also be associated with an instance of the second chance game. Thus, in this embodiment, each game ticket that a player plays may be associated with the corresponding second chance game that the player might gain access to. In addition to the associations with the instances of games, each unique identifier may also be associated with various data related to each sets of games, including the determined results of the games, prizes that will be won, attributes of the games, and other game data. In at least one embodiment, this unique identifier will also be printed on the ticket and may be utilized by the player to access the second chance game. Such data may be stored in one or more databases. 
     In general, the first medium of the first chance game, or a play of an instance of the first game, may provide an access mechanism for a player of the first chance game to at least potentially access a second chance game. For example, an alphanumerical code may be printed on a ticket representing an instance of the first chance game. Typically, the code is hidden on the ticket, for example, in a scratch or pull-tab area, and cannot be viewed before a player takes possession of the ticket and plays the first chance game. If the code is not hidden from plain view, then the code may remain inactive until the game ticket on which the code is printed has been purchased by a player. This code may be used to access the second chance game, for example, at a retail terminal or on a personal computing device. As an alternative to the alphanumerical code, the access mechanism provided on the first medium (e.g., game ticket) may comprise a computer-readable symbol (e.g., 1-D or 2-D bar code, quick response (QR) code, or other computer-recognizable image). Such a symbol may be scanned at a retail terminal or directly cause a personal computing device to provide access to the second chance game. 
     At  3308 , a second chance game may be established and the results of the second chance game may be determined using any number of methods. For example, at  3308 , a number of game sessions may be generated, each corresponding to one instance of the second chance game. These game sessions may be arranged in a preset sequence and a definitive result (e.g., win or lose, and what prize) may be pre-assigned to each of the game sessions within the sequence. Alternatively, a collection of unique session numbers may be created for instances of the second chance game, with the total number of unique session numbers matching the number of instances of the first chance game. In other words, a session number may be created for each scratch ticket that is printed at  3304 . With the collection of unique session numbers generated, game results may then be randomly assigned for each session number, thereby pre-assigning a result to each instance of the second chance. 
     A game provider may configure the number of prizes that may be allocated for each collection of session numbers. For example, all possible predetermined results for a collection of unique sessions may be determined and placed in a selection pool for selection. For each session number, one possible result may be selected at random from the selection pool. After all session numbers have been assigned predetermined results, the composition of game results are as exactly as desired by a game provider, just randomly distributed. For example, of 100 session number, the determination procedure may randomly allocate 1 grand prize, 5 secondary prizes, 25 tertiary prizes among the 1,000 session numbers. Thus, session number 1 may be assigned a grand prize game result, session number 2 may be assigned a loss game result, session number 35 may be assigned a 5 points prize game result, and so on. The session number, in a preferred embodiment, may number from 1 to the number of session numbers generated. Thus, where there are 1,000,000 scratch tickets created, 1,000,000 session numbers numbering from 1 to 1,000,000 may be generated. 
     At  3312 , a player may purchase an instance of the first chance game at a point of sale such as at a kiosk, at a cash register, online or at other sources of lottery-style games in order to play the game. For example, the player may purchase a scratch ticket through the use of a scratch-ticket machine well known in the art. In one embodiment, the player may receive a ticket for play from the gaming machine discussed in reference to  FIG. 25 . 
       FIG. 34A  depicts an exemplary scratch ticket  3401  and an exemplary screen  3410  showing a computer-based second chance game in accordance with one embodiment of the present invention. The scratch ticket  3401  allows a purchaser/player to participate in an instance of a “Canadian Daily 5” instant lottery game which may be a first chance game within the context of the present invention. The ticket  3401  may include an annotation area  3411  that explains the rules and conditions (or directs the player to a website for the full terms and conditions) concerning the exemplary “Canadian Daily 5” instant lottery game. The ticket  3401  may also include a first scratch-off area  3422  where the player may reveal a combination of five lotto numbers to see whether he or she wins or loses the first chance game. The ticket  3401  may further include a second scratch-off area  3433  which may reveal an access code or symbol to the player to enable access to a second chance game. As mentioned earlier, the ticket  3401  may alternatively be delivered and presented as a “virtual ticket” on a player&#39;s personal computing device, where the first scratch-off area  3422  may include five buttons or tiles or other icons with which the player may interact to play the first chance game and similarly the second scratch-off area  3433  may be used to interactively provide an access mechanism to the second chance game. 
     Referring to  FIG. 34A , there is also shown an exemplary screen  3410  displaying an interface of a GeoSweep Treasure Hunt game as a second chance game. Corresponding to the exemplary “Canadian Daily 5” first chance game, the exemplary GeoSweep Treasure Hunt second chance game presents a Canadian map as gameboard. The screen  3410  may be a web interface, and the player may have arrived at this interface by typing an URL or by scanning a QR code or other symbol provided on the ticket  3401 . Initially, the grid units of the map on the screen  3410  may be “locked” or deactivate, preventing any play with the GeoSweep Treasure Hunt second chance game. A dialog box  3415  on the screen  3410  may prompt the player to enter the access code from the ticket  3401  in order to activate the gameboard. Alternatively, the ticket  3401  could provide an QR code that embeds both the URL link to the second chance game website and the requisite access code, such that the player will be taken directly to an activated gameboard upon scanning the QR code with a mobile phone, for example. As the player plays the GeoSweep Treasure Hunt second chance game via the screen  3410 , the predetermined result of the second chance game may be revealed to the player as a “treasury” in one or more of the grid units. Although the GeoSweep Treasure Hunt is shown here an exemplary second chance game, one of ordinary skill in the art should appreciate that any other type of map-based or non-map-based games may be suitable as the second chance game. 
       FIG. 34B  depicts another exemplary scratch ticket  3400  in accordance with an embodiment of the present invention. The scratch ticket  3400  facilitates a first chance game of Treasure Hunt where the ticket presents a grid map  3402  overlaid on a map  3404 , dividing the land into grid units. The ticket  3400  may further contain a second chance portion  3408  and instructions  3412 . As depicted, the grid map  3402  on the ticket  3400  contains 36 square shaped grid units overlaid on a map of Canada. Although a map of the Canada is used above as an example, it should be appreciated that maps of other types of geographic regions (e.g., township, city, county, country, ocean, island, and continent) may also be appropriate. It should also be noted that many games (other than Treasure Hunt) may be suitable as the first chance game. 
     Each of the 36 grid units may be made up of a scratchable surface (not shown for figure clarity) well known in the art such that text, drawings and/or other items may be hidden from view underneath the scratchable surface. The instructions  3412  may explain to a player how to the play the game. Additional instructions may be provided on the back of the ticket  3400 , including instructions that explain what prizes are redeemable and what is required to be discovered to win such prizes. 
     In one preferred embodiment, the player may be asked to dig for prizes from the grid units that are shown on the ticket. The player may be able receive prizes if he or she discovers particular treasures, a pattern of treasures, or a certain number of treasure types in one or more of the grid units, for example. If the player digs and discovers that his play results in the winning of a prize, the player may redeem the prize at a gaming machine, at a participating store, or at other locations well known in the art. In another exemplary embodiment, the player may only elect to “dig” up to a certain number squares out of those on the scratch ticket  3400  (e.g., 6 out of 36). If the player digs more than the allowed number of grid units, the scratch ticket may not be redeemable for any prizes. 
     It should be readily apparent that the games available on a scratch ticket is not limited to these exemplary embodiments but, in fact, may be ticket-based implementation of the games discussed in other portions of this disclosure including, but not limited to, GeoSweep, Treasure Hunt, Free2Play scratch-card implementations, including implementations that contains games with multiple layers; different win probabilities algorithms; prize clusters; multiple selection rounds; dynamic play; grade geos; and so on. Additional implementations may include scratch-card games that require the use of use of mobile devices or the visiting of real world retail locations to play (e.g., to redeem specific grid units). Scratch ticket variation of the Key Treasure Hunt game may also be implemented. In fact, the first chance game need not be limited to games disclosed herein may be include other types of games such as variations of a word-search game, tic-tac-toe, bingo, and others. Furthermore, the first chance game, in at least one embodiment, need not be a ticket-based game at all but rather may be a computer-based game, a casino-based game, a kiosk game, a general lottery-style or any types of games of chance on various mediums. 
     Various payout structures may be utilized for the first and second chance games including those disclosed herein, such as proportional payout structures, tiered prizes, prize variations, etc. Indeed, the prizes that are available for the games need not be limited to money or game play points, but may include credits exchangeable for merchandise such as music, games, ring tones, entertainment tickets, meals, lodging, transportation fares; software applications that may be installed on a computing device; and so on. Further, the location of the prize redemption may be restricted to predetermined locations or types of locations. 
     The instructions  3412  may further explain to the player that if he has uncovered all of the available squares and that there were no redeemable prizes, the player may scratch the second chance portion  3408  for a chance at playing a second chance game. In the preferred embodiment, an access code or access phrase may be revealed when the player scratches the second chance portion  3408 . The access code may be the unique identifier associated with the ticket-based game or, in another embodiment, the access code or phrase may simply be associated with the unique identifier, the first chance game, and/or the second chance game. Other embodiments of the present invention do not require the use of an access code or access phrase to access the second chance game at all. In fact, in one embodiment, instructions to access the second chance game may be hidden at the second chance portion  3408  such that when uncovered, the player may simply follow the directions to access the second chance game. For example, a website URL may be uncovered for the user to access the second chance game. 
     In embodiments in which the player only gets to play the second chance game when he or she loses the ticket-based game, there may be no access code or access phrase on the winning tickets. Further, in embodiments in which all players may play a second game, or only winners may play a second game, the instructions  3412  and the second chance portion  3408  may differ accordingly. 
     At  3316 , the player may access the second chance game. In the preferred embodiment, the player may use the access code provided at second chance portion  3408  to access the second chance game. The second chance game may be a computer-based game wherein a player may use a computer to access a webpage for the second chance game. The user may be shown a user interface on the webpage and prompted to enter the access code or phrase from the second chance portion  3408 . The user may be required to register with the game provider before or after the player enters the access code or phrase, such as by creating a user account and entering the user&#39;s information (e.g., the user&#39;s name, address, email address, privacy options, etc.) Where the player already has an account with the game provider, the user may simply enter his or her account information to access the second chance game. 
     The results of the instance of the second chance game may be determined through any number of methods. At  3320 , a game session and associated result of the second chance game may be assigned to the player. In the preferred embodiment, upon signing in, and prior to the game play, the player may be assigned the next session of the second chance game generated at  3308 . For example, if the access code or phrase that is entered by the player is the Nth access code or phrase entered, the player will be assigned the session number N within the preset sequence of game sessions. Based on the assigned session number, the predetermined results associated with the session or session number, as predetermined at  3308 , may be determined. Thus, where the player&#39;s entry is the 35th access code redeemed, for example, the player may be assigned the session number 35, such that, as determined at  3308 , the player will win 5 points through the play of the second chance game. 
     While the determination of assignment for each session or session number may be determined through a true randomized selection and/or determination, other formulas, calculations, or methods may be used to determine the results of each session or session number. 
     In one embodiment, though the final result will be predetermined as soon as the player accesses a game session (as determined according to the session number, for example) but before he or she starts playing the second chance game, how the player ultimately wins a prize may be randomized or determined based on any number of game, player, or other factors. For example, though two or more games may be predetermined to win 5 points, one game may give the players 3 separate prizes of 1, 2 and 2 points (totaling 5), while another game may give another play 1 prize of 5 points. As such, the play of the second chance game instances may still be kept interesting. 
     In some embodiments, several collections of session numbers may be created, with each collection of session numbers corresponding to a particular type of game ticket. Though the session number that a player is assigned when the player enters his access code may still determines his result of the second chance game, the collection that the player will receive a session number from may differ accordingly. Therefore, game providers may allocate more prizes or more valuable prizes to a particular collection, thereby offering a mechanism in which different groups of scratch-ticket types may be given different sets of prizes. Thus, a game provider may use this to provide an incentive for players to purchase more expensive scratch tickets. Furthermore, in some instances, there may be fewer instances of scratch-tickets for expensive tickets, thereby giving players even a greater chance at winning 
     In another embodiment, each collection of session numbers may correspond to a particular time period. For example, one collection of session numbers may be generated for each day of the week, or for each week. Each collection may also correspond to players having particular attributes. Thus, whether a player may be assigned a session number from one collection of session numbers versus another collection of session numbers may be dependent on the player&#39;s gender, age, home address, registration status, salary, social network connectivity, game play history, winning history and so on. Thus, specific types of players may be targeted for prizes (e.g., potentially sponsored by advertising clients with incentive to target the players with different products as prizes). Game providers may use this feature to increase interests of women players, for instance. Furthermore, game providers may ensure that the player&#39;s interest may be maintained by giving players who have lost a lot of games recently a greater chance at winning in their second chance game. The collection that a player may be assigned a session number from may further affect the second chance game instance itself For instance, the map grid that is depicted, the number of prizes that is shown, the type of game (e.g., Treasure Hunt versus GeoSweep) may also vary according to the collection of session numbers. 
     In some embodiments, the results of the second chance game need not be predetermined at all but rather may be dynamically determined as the player plays the game or may be determined according to how the player plays the game. In such cases, a particular instance of the second chance game that is provided to the player may be determined at random or, in at least one embodiment, be determined according to the player&#39;s session number, access code, access phrase, or other factors. 
     At  3324 , the player may play the second chance game. Upon the completion of a game session, the results of the second chance game will be revealed to the player. Where the results of the second chance game are predetermined at  3304  and/or  3312 , such results may be therefore be revealed to the player after the player&#39;s completion of or during the play of the second chance game. Any number of results may be possible from the play of the second chance game. Thus, the player may be given: more plays in the second chance game, codes redeemable to play another instance of the first chance game, cash prizes, as well as other types of prizes disclosed herein or well known in the art. 
     According to embodiments of the present invention, the second chance game, like the first chance game, may be any of the lottery-style games that are disclosed herein, including GeoSweep, Treasure Hunt, Free2Play, Key Treasure Hunt, and variations thereof. 
     For example, the second chance game may be a GeoSweep game. Upon access, the play may be allowed to pick one or more available parcels to become a virtual owner thereof. The player may then be required to make a commitment to participate in one or more of scheduled lottery-style drawings involving the one or more parcels. A plurality of scheduled lottery-style drawings may take place periodically, such as once or more times a day, every other day or every few days, or a number of times per week or month. In each drawing, each participating parcel may be required to contribute a predetermined number of tokens to a prize pool or jackpot. The number of parcels that the player may choose and/or the number of scheduled lottery-style drawings the player may enter in may vary according to the ticket the player used to access the game, may be at random, or may be according to a session number assigned to the player when the player redeemed the access code or phrase, may be according to any number of system, player or external factors. As another example, the second chance game may be a Treasure Hunt game. Upon access to the game, the player may select one or more grid units from which to dig to discover treasures at each grid unit, if any. 
     While in the preferred embodiment of the present invention, the results of the first and second chance game are predetermined, other embodiments of the present invention do not predetermine the results of one or both of the games. 
     After the result of the second chance game is revealed to the player, the player either wins or loses and, if he wins, also learns what prize is won, etc. At  3328 , the method for providing a second chance game ends. 
     The types of game that may be provided to a player in a first chance game may be the same, similar or related to the second chance game. For example, the first chance game may be a ticket-based game, in more specifically, a treasure hunt or prize discovery game wherein the player selects a number of tiles that are each printed on the face of the ticket from which to dig for treasures by scratching off a scratchable top surface of the ticket to reveal the treasures, if any, underneath. After the play of the first chance game, the player may be provided access to a second chance game wherein, using a computer, the player may play a computer-based game to dig for treasures on a generated map in a treasure hunt game, as discussed in other portions of this disclosure. 
     In other embodiments, the games need not be dependent on or otherwise related to one another, and instead, may be completely independent from one another. Thus, the first chance game may be a scratch ticket game wherein player plays a game of word search. Using an access code on the word search game ticket, the player may access a variant of the Key Treasure Hunt game. In one embodiment, one of the words that is found through the first game may be used as the access code to access the second game. 
     Even where both games are similar in type, the games need not be the exactly the same, but instead, may be variants of one another. They may differ in the rules, style of play, theme, and/or in various other manners. For example, while the ticket-based game may be a treasure hunting game related to pirates, the computer-based game may be related to a grand bank heist. Indeed, game providers may utilize the second chance game as a means to introduce players to other types of games that are available, including those that are new, or those that are not yet successful. Furthermore, game providers may customize the second chance game according to sponsors or other promotions. 
     The content of a second chance game may also be at least partly based on the content of the first chance game, and conversely. For example, a treasure map that is provided in a computer-based GeoSweep game may be the same as, substantially similar to, contain, or be a part of the game that is on the ticket-based game. For instance,  FIG. 35  is a flow chart illustrating a method for providing a second chance game in accordance with one embodiment of the present invention. At step  3504 , the results of the first chance game may be predetermined. At the same time, the attributes of the game may also be determined, stored, and associated with a unique identifier. Thus, at  3504 , it may be determined that the scratch ticket game is a GeoSweep game containing a grid map of 49 grid units that is overlaid on a map of a treasure island. Further, the composition of the map may be determined For example, it may be determined that there is hidden a boot at a grid unit with the coordinates (2,4), a coin at a grid unit with the coordinates (6,3) and a treasure chest at a grid unit with the coordinates (4,4). It may be determined that the player will win the first-based game and will be rewarded 5 dollars in return. Such information may be stored at one or more databases of a gaming server, such as at database  2220  at gaming server  2208 . 
     At  3508 , the results of the second chance game may be determined using various methods, as discussed herein (or may not be predetermined at all, whereupon the step is skipped). At  3512 , the player may purchase and play the first chance game in similar fashion as previously discussed in referenced to  FIG. 33  (at  3312 ). As was predetermined at  3504 , the player may determine from the play of the game whether he or she has won or lost. Furthermore, the player may be provided with instructions on the face of the game-ticket, telling the player that he or she may continue playing through a second chance game. The player may scratch a second chance game portion on the game ticket to reveal an access code through which to access the second chance game. 
     At  3516 , the player may access the website of the second chance game and enter the access code or phrase. A second chance game may be generated based on the access code as well as data related to the first chance game. 
     In particular, based on the access code, whether the player wins or loses may be determined accordingly. Further, based on the access code, data related to the first chance game (as determined at  3504 ) may be gathered to generate the instance of the second chance game at  3520 . In other words, based on the data that is stored about the first chance game, the second chance game that is provided to the player may be customized accordingly. For example, based on the data describing the grid units, prize locations, and results of the ticket-based game, the map generated for display in the second chance game may be identical with first chance game, containing a grid map of 49 grid units with the three items of the first chance game (boot, coin, treasure chest) in the same locations. The player, in the second chance game, may be given a chance to dig deeper in those grid units where the items were not found, potentially finding other treasures. The player may play the game at  3524  to reveal the results of the second chance game. The method may then end at  3528 . 
     In another embodiment, the map that is generated and displayed for the player may be a zoomed-in view of the grid unit where the treasure chest was located. In other words, the second chance game may be a game in which the player finds the specific sub-grid unit within the grid unit determined in the first chance game to contain the treasure chest. In yet another embodiment, the map generated may contain the grid map of the first chance game but may contain additional land surrounding the grid map (i.e., a zoomed out view). 
     The use of grid maps and treasure location information is used as just one example of how the first chance game may be utilized to generate the second chance game, and vice versa. Indeed, various other game attributes may be used. Such feature may also be utilized in second chance game systems in which the results of the second chance game is not predetermined Thus, embodiments of the present invention may track the content of the each ticket-based game such that when the user accesses the second chance game, the second chance game may be generated accordingly. 
     While the results of the first chance game may be determined before the first chance game is provided to the player, such as just before a scratch-ticket game is printed, the results of the first chance game may also be predetermined at other points in time, depending on various embodiments. For instance, the results of the first chance game may be determined at the time of ticket purchased, at a predetermined time (e.g., a scheduled drawing) or it may even be determined after the ticket has been purchased, such as after the player plays the first chance game. Indeed, in at least one embodiment, the results of the first chance game are wholly dependent on how the player plays the first chance game. Similarly, the results of the second chance game need not be predetermined, but rather, may be determine at the time the player purchases the ticket, at the time the player plays the game, or at various other point. Just as with the first chance game, in at least one embodiment, the results of the second chance game may be wholly dependent on how the player plays the second chance game. 
     In addition, the results of the two games, as predetermined, may be related to one another. For instance, whether the player wins and, if the player wins, the prizes that the player may receive in the second chance game may be determined based on: whether the player will win the first chance game; on the prizes the player would receive in the first chance game; on the type of game played; and on various other factors. Conversely, in some embodiments of the present invention, whether the player wins in the first chance game may be dependent on whether the player is predetermined to win second chance game. Thus, in several embodiments, the results of the second chance game may be determined prior to the determination of the results of the first chance game. 
     This feature may allow game providers to provide a good mix of game results. Game providers may provide a variety of game results that will keep the games exciting for the players, including games where the players win both games, games where players win the first chance game and loses the second, games where players lose the first chance game but wins the second, or games where the player loses both games. Furthermore, a game provider may increase the number of instances with any one of these results based on market feedback, game performances, company needs, and various other influences. Thus, where player interests are declining in certain ticket-based games, game providers may increase the likelihood in which the players will win at least one or the two games, for example. Similarly, where interests in a particular computer-based game is waning, a game provider may offer the computer-based game as a second chance game for any number of ticket-based game as a means to increase player awareness, participation, and interests in the computer-based game. In one further embodiment, the results of the first chance game may be revealed to the player during the play or at the completion of the play of the second chance game. 
     In one additional embodiment, the ticket-based game may comprise a number of unique access codes or phrases from which the player may access the game. The ticket-based game may allow the player to redeem only one of these access codes. Upon the redemption of one of these access codes, all of the other access codes that are also on the card may no longer allow the player to access additional games. Thus, these embodiments may be implemented for certain types of scratch ticket games. The player may be challenged to pick the correct the access code to gain prizes (or just access to the game). This feature may be integrated into the first chance game rules. For example, the player may be challenged to find all of the treasure chests on a grid map containing four treasure chests. If the ticket contains four treasure chests at all, the player may be required to choose one gain access to the second chance game from which he can win a prize. In another embodiment, whichever access code the player chooses may be associated with a predetermined second chance game result. Thus, of the four access codes that the player may choose from, only one access code will generate a second chance game instance in which he or she will win a prize. The three remaining access codes, while operable, will have a predetermined result of a loss or insubstantial prize. 
     The various embodiments and features of the presently disclosed invention may be used in any combination as the combination of these embodiments and features are well within the scope of the invention. While the foregoing description includes many details and specificities, it is to be understood that these have been included for purposes of explanation only, and are not to be interpreted as limitations of the present invention. It will be apparent to those skilled in the art that other modifications to the embodiments described above can be made without departing from the spirit and scope of the invention. Accordingly, such modifications are considered within the scope of the invention as intended to be encompassed by the following claims and their legal equivalents.