Multi-level game competition

The described system addresses the complexity of managing player participation and prize distribution in competitive events by using a computing device to track selections and award prizes across multiple rounds, ensuring fairness and enhancing the gaming experience.

JP7693862B2Active Publication Date: 2025-06-17CFPH LLC

Patent Information

Application Number
JP2024015330
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Priority Date
2012-11-01
Filing Date
2024-02-05
Publication Date
2025-06-17
Estimated Expiration
2033-03-08

AI Technical Summary

Technical Problem

Existing gaming systems do not efficiently manage player participation and prize distribution in competitive events based on multiple rounds, leading to complexities in tracking player selections and awarding prizes.

Method used

A computing device accepts bets from players for a competition with multiple rounds, allows players to select winning participants for each round, and awards prizes based on correct selections, while excluding players who did not correctly select the winner from subsequent rounds.

Benefits of technology

This solution enables seamless management of player participation and prize distribution across multiple rounds, ensuring that correct selections are rewarded and incorrect selections are accounted for, thereby enhancing the gaming experience and fairness.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007693862000001
    Figure 0007693862000001
  • Figure 0007693862000002
    Figure 0007693862000002
  • Figure 0007693862000003
    Figure 0007693862000003
Patent Text Reader

Abstract

To provide a device and a method related to competitions.SOLUTION: A device related to competitions includes a database storing video images, a network interface and at least one processor. The at least one processor performs the following steps of: recording a plurality of video images of a plurality of recorded races to the database; replaying the video images of a first recorded race of the plurality of recorded races; preventing a player who is likely to be a winner from being clear before a bet made on a winner of the first recorded race by partially hiding a selected part of the first recorded race during replay of the video image; storing information indicating a plurality of difficulties of the first recorded race at a time when the bet on the winner is received in the first recorded race; and receiving data indicating the bet on the winner of the first recorded race from a first set of remote mobile device.SELECTED DRAWING: Figure 1
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] Cross - Reference to Related Applications This application is a non - provisional application of U.S. Provisional Application No. 61 / 721,181, filed on November 1, 2012, U.S. Provisional Application No. 61 / 715,972, filed on October 19, 2012, and U.S. Provisional Application No. 61 / 618,182, filed on March 30, 2012, all of which are hereby incorporated by reference.

[0002] Some embodiments generally relate to competition.

Background Art

[0003] A game may involve risking a certain amount of money on whether or not an event will occur. A variety of events such as horse racing, other sports events, casino games, events other than sports, etc. form the basis of the game.

Summary of the Invention

[0004] The following should be understood as exemplary embodiments, not as claims.

[0005] A computing device accepts bets from a first set of players to participate in a competition that includes a maximum number of rounds, and the computing device accepts, for each round, the respective selections of the respective winning participants of the respective events on which each round is based from the remaining players in the competition, and stops accepting the selections from the remaining players at some point between the start and end of each event, and determines that one or more players who correctly select the winner of each event are the one or more players, and conducts successive rounds of the competition by conducting successive rounds of the competition until at least one of no player correctly selects the winner, only one player correctly selects the winner, and the maximum number of rounds is completed, and excludes players who did not correctly select the winner from subsequent rounds of the successive rounds, including conducting successive rounds of the competition, and the computing device awards a prize to each of one player who correctly selects the winner before the final successive round, one player, and the remaining players after the maximum number of rounds is completed, including a method.

[0006] A.1. The method according to claim A, wherein accepting a bet includes accepting a buy-in into the competition. A.2. The method according to claim A, including enabling a player excluded from a previous round to buy into a subsequent round by making another bet. A.3. The method according to claim A, including determining the event for each round by selecting a recorded event from a library of recorded events. A.4. The method according to claim A, wherein selecting a recorded event includes determining the desired difficulty level for each round and selecting the recorded event tagged with that difficulty level. A.5. The method according to claim A, wherein each event includes a race. A.6. The method according to claim A, wherein each event includes a portion of a single race. A.7. The method according to claim A, wherein accepting each selection includes pausing the presentation of each event for a period of time so that a player can enter the selection, and stopping acceptance includes resuming the presentation. A.8. The method according to claim A, wherein conducting successive rounds includes displaying the first portion of each event before accepting each selection. A.9. The method according to claim A, including pooling bets together and awarding prizes from the pool.

[0007] B. A computing device accepts a buy-in to the competition from each of a plurality of players, and for a first player in a first round, the computing device determines a recorded first event stored in an event library and tagged with a difficulty level associated with the first round, for a second player in the first round, the computing device determines a recorded second event stored in the event library and tagged with a difficulty level, the computing device presents a first portion of the first event to the first player and a first portion of the second event to the second player, the computing device receives a first selection of a winner in the first event from the first player and a second selection of a winner in the second event from the second player, and the computing device determines whether the first player advances to a second round of the competition depending on whether the first selection is correct based on a second portion of the first event, and whether the second player advances to the second round of the competition depending on whether the second selection is correct based on a second portion of the second event.

[0008] The method according to claim B, comprising tagging and grading each event in the event library based on the proximity of event supporters at the end of each respective first part of each event. The method according to claim B, comprising presenting the second part of the first event to the first player and the second part of the second event to the second player. The method according to claim B.2, comprising pausing the presentation of each of the first event and the second event between each respective first part and second part, and while the presentation is paused, requiring the first player to make the first selection, and while the presentation is paused, requiring the second player to make the second selection. The method according to claim B, wherein each respective second part is presented in response to receiving each respective selection. The method according to claim B, wherein the first and second events each comprise a respective horse race. The method according to claim B, comprising concealing the presentation of the first part of the first event and the first part of the second event. The method according to claim B.4, wherein concealing comprises at least one of making an adjustment to the recording, changing the color of the recording, and changing the sound of the recording. The method according to claim B, comprising determining that the first and second players are in the same competition based on when a buy-in is received from each of the first and second players such that the players are in competition in response to the players submitting buy-ins at similar times.

[0009] A device, comprising: a computing device; and a non-transitory medium storing thereon a plurality of instructions, including instructions to cause the device to: accept bets from a first set of players to participate in a competition including a maximum number of rounds; for each round, accept selections of respective winning participants of respective events on which each round is based from the remaining players of the competition; stop accepting the selections from the remaining players at some point between the start and end of each event; determine that one or more winning players are the one or more players who correctly select the winner of each event, thereby causing consecutive rounds of the competition to be conducted, where conducting consecutive rounds continues until at least one of: there is no player who has guessed the selection of the winner, only one player has guessed the selection of the winner, and the maximum number of rounds has been completed; exclude players from rounds subsequent to consecutive rounds in which the selection of the winner was not guessed; and award prizes to each of: a player who guessed the selection of the winner before the final consecutive round, the only one player, and the remaining players after the maximum number of rounds has been completed.

[0010] A device comprising a computing device and a non-transitory medium storing thereon a plurality of instructions for causing the device to: accept bindings to the competition from each of a plurality of players; determine, for a first player in a first round, a recorded first event stored in an event library and tagged with a difficulty associated with the first round; determine, for a second player in the first round, a recorded second event stored in the event library and tagged with a difficulty; present a first portion of the first event to the first player and a first portion of the second event to the second player; receive a first selection of a winner in the first event from the first player and a second selection of a winner in the second event from the second player; and determine whether the first player advances to a second round of the competition depending on whether the first selection is correct based on a second portion of the first event, and whether the second player advances to the second round of the competition depending on whether the second selection is correct based on a second portion of the second event.

Brief Description of the Drawings

[0011]

Figure 1

Figure 2

Figure 3

Figure 4

Modes for Carrying Out the Invention

[0012] I. Exemplary Embodiments Generally, a game may be referred to as gambling, but embodiments are not limited to the legal definition of gambling that is limited to games of chance. Instead, embodiments can include contests that require skill, fantasy games, games of chance, and / or any other type of game. Thus, the term "game" may be used when considering some embodiments, rather than the term "gambling". A game may involve risking a certain amount of money on whether some event occurs. Such risk may be skill and / or risk-based, ledger-based, and / or pari-mutuel, and / or may take any desired form. A game may also involve paying a fee to participate in a competition based on the occurrence of an event. A prize (e.g., money based on the sum of the competition entry fees) may be provided to the winner of such a competition. Gambling may be used in this specification to refer to such skill or risk-based games in some instances, but should not be understood to be limited to one or the other type of game unless otherwise specified. A game can include gambling, wagering, risking money, paying an entry fee to a competition, and / or any other form of game as desired. Various embodiments can apply to any type of game in any combination and / or arrangement.

[0013] Some embodiments can facilitate games regarding the results of multiple events. In some embodiments, one or more events may be arranged in one round of a multi-level competition. Some embodiments may enable multiple players to play against each other across multiple levels of a multi-level competition. In some embodiments, a win at a lower level may enable a player to move to the next level of the multi-level competition. In some embodiments, a loss at a certain level may remove the player from the multi-level competition. The winner may be determined based on one or more of the remaining players in the competition.

[0014] While some examples in this specification may be given with respect to a horse racing environment and wagering on horse races, it should be recognized that such environments are given as non-limiting examples only. Various embodiments can include any kind of event, such as political events, casino games, sports events, card games, board games, the results of reality shows, fantasy games, etc.

[0015] Some embodiments can include a game provider. The game provider can include a casino, a sportsbook, a racetrack facility, a bookmaker, etc. The game provider can receive money at risk in the game, receive entry fees for competitions, determine wagers, audit events, verify users, determine results, track results, receive information, maintain account information, transmit information, maintain a pari-mutuel pool, determine payout rates, and / or perform any desired action, and can include one or more computing devices. Such computing devices can include servers that operate in place of the game provider.

[0016] Some embodiments can include one or more user devices. Such devices can enable a user to interface with a game operator, play a game, display information about the game, access account information, display results, select a race winner, etc. in order to perform game actions (e.g., wager). Such user devices can include smartphones, mobile phones, tablets, personal computers, kiosks, devices operated by game provider personnel, etc.

[0017] FIG. 1 shows an exemplary method that may be implemented in some embodiments. It should be recognized that this exemplary method is given only as a non-limiting example. Other embodiments may not include a method at all and may include different methods, methods in different orders, methods including alternative actions, methods including different actions, methods including additional actions, etc. Such methods may be implemented by a game operator, some component thereof, and / or any desired entity alone, or in combination with any other entity.

[0018] Some embodiments may include hosting a competitive game. For example, FIG. 1 illustrates an exemplary hosting of a game that includes, at block 101, accepting bets from a plurality of players to participate in the competition. Hosting a game can include determining an event for the competition, enabling players to risk money to participate in the competition, tracking the game and / or game actions being performed in the competition, enabling a user to access information and / or perform actions related to the competition, etc. For example, in some embodiments, the game operator can determine that a portion of the competition can be, for example, a horse race held on a track for a day, a month, a week, and / or other period, a set-off horse race, a previously held horse race, the number of times held, or a race to be held in the future with no limit or limitation, and can start accepting money from the user to participate in that competition.

[0019] The computing device of the game provider can determine that the risks of the first competitive money and / or other game actions must be accepted, and can store such money and / or other actions, as well as information about the competition (for example, events that are part of the competition, database entries identifying players who participated in the competition, audit information identifying the parameters of a pari-mutuel pool, determining the selection of the winner of the competition, etc.). The user device may be controlled to display game options for the competition (for example, buttons or other controls may be enabled and / or displayed in the user interface to allow the player to perform game actions of the competition, select the winner of a round of the competition, etc.). It should be understood that any desired action may be taken to start a game related to the competition (for example, display information to the user, identify rules to the user, accept money from the user, inform the user, store audit information, determine events to include in the competition, determine the parameters of the competition, determine the eligibility to participate in the competition, etc.).

[0020] Some embodiments can include accepting one or more entries into a competition. For example, a player can give money to a game provider to participate in a competition (e.g., transfer funds from an electronic game account, deposit money with the game provider, bet, etc.). Participation in the competition can include paying a fixed amount, or otherwise taking a risk, which may be common to all players in the competition (e.g., purchasing entry into the competition for $1, $10, etc.). Paying such a fee and / or otherwise risking such an amount of money can include a variable amount that may be selected by the player and that may affect the amount won by the player if the player wins the competition (e.g., the player may receive a portion of a pari-mutuel pool proportional to the amount paid in some manner). Information regarding entry into the competition may be stored by a game operator's computing device, for example, for auditing purposes and / or to assist in promoting the competition.

[0021] In some embodiments, in response to receiving an entry into a competition, a player may be provided access to a function that enables the player to participate in the competition and / or view information regarding the competition. In some embodiments, such information and / or function may otherwise be denied to the player. For example, a player may be provided access to a user interface where the player can select the winner of one future event (e.g., a round of that competition).

[0022] Some embodiments can include accepting a selection of a winner from one or more players for a first round of competition. Block 103 shows an example of this occurrence in FIG. 1. For example, in Block 103, all players remaining in the competition for the current round of competition may be able to submit a selection of a winner for the round of competition. In some embodiments, the selection may be accepted by the game operator only before the round of competition begins. In some embodiments, the selection may be accepted by the game operator only after the round of competition has begun. In some embodiments, the selection may be accepted by the game operator both before and after the round of competition begins. In a round of competition, each player may submit such a selection and / or may be required to submit such a selection in order to have a chance to move on to the next round of the competition.

[0023] Selecting a winner includes selecting one horse from the horses participating in the event, selecting a group of horses from a series of groups of horses participating in such an event where any one of them may win, selecting some horses from among the horses participating in such an event where any one of them may win, selecting any participant, series of participants, group of participants, team, etc. that may win the event, etc.

[0024] Although various examples are given with respect to selecting a winner, it should be recognized that these examples are non-limiting. For example, some embodiments include selecting a loser, a particular ranking, and the particular participant who attains that ranking (e.g., the fourth horse comes in fourth), a particular order of participants, and / or any characteristic that may be determined at the end of the round.

[0025] Some embodiments may include receiving a selection of a winner of one round of a competition (e.g., an event). For example, in some embodiments, a player may be presented with a user interface of a user device that enumerates options for selecting a single winner of one round of the competition. Such a user interface may, for example, enumerate valid winners and allow the player to select among these valid winners (e.g., a single possibility, some maximum number of which one number is desired to win, a pre-determined group of possible winners among which one of the group is desired to win, etc.). The player may select one or more winners and submit that information to the game operator through the user device (e.g., transmitted through a communication network). The game operator may receive that information and, if desired, store and / or otherwise analyze it to determine the result of the round of the competition and / or the competition as a whole. It should be recognized that selecting one or more winners, receiving information, processing information, and / or the operation of the user interface are given only as non-limiting examples.

[0026] In some embodiments, it may be required that the winner be selected by a player of the competition during a predefined period (e.g., before the start of the round, before a predetermined point of the round, before the end of the round, after the start of the round, etc.). In some embodiments, if the selection is not received and / or submitted by the player during that period, the player may be treated as having lost that round, may lose eligibility to win the competition, and / or may be given an opportunity to remedy the lack of submission. For example, in some embodiments, a player who does not submit a round victory selection may be treated as having selected a losing participant of the round.

[0027] Some embodiments can include starting a first round of a competition (e.g., an event where a player makes a winner selection). Block 105 illustrates this example in FIG. 1. For example, in some embodiments, a horse race is started. In some embodiments, the horse race may be started by a game operator (e.g., by indicating that the gate would open, by indicating to the jockey that the race has started, by playing a pre - recorded video of the horse race, by playing a virtual presentation of the horse race, etc.). It should be recognized that there are any number of ways to start an event, which may or may not respond to an event related to the competition. In some embodiments, a player may be notified of the start and / or future start of an event related to the competition (e.g., notified of the time and / or location of the event, guided to the route to the event, shown a video display of the event, shown a countdown related to the start of the event, shown the start portion of an event paused to accept a winner selection, asked to make a winner selection, etc.).

[0028] In some embodiments, the period during which a bet may be placed to participate in the competition may end at the start of the first round. In some embodiments, the period during which the winner of a round may be selected may end at the start of that round. In some embodiments, the period during which a winner may be selected may start at the start of the first round. Information about the start of the first round may be collected by a game operator (e.g., through the use of an electronic system monitoring the race event or other event, through the input of user information, through the reading of an information data feed, etc.).

[0029] Some embodiments can include determining that a first round of a competition has reached a certain point. For example, a certain point can include an intermediate point, a leading horse reaching a predetermined location on the track, a predetermined time having elapsed since the start of a race, a certain amount of points having been acquired, a point difference exceeding a certain amount, the first part of the recording of an event being displayed, etc. Such reached points can trigger one or more actions. Determining that such a point has been reached may be done in response to information collected and / or analyzed by a game operator (e.g., a data feed describing the event, input of information about the event into a computer interface by a person observing the event, an electronic event tracking system, etc.).

[0030] In response to determining that the threshold point of the first round has been reached, the time period during which a player can select the winner of the first round may end. Block 107 of FIG. 1 illustrates an example of this occurrence. For example, the game operator may stop accepting the selection of a winner from the players remaining in the competition in response to reaching the threshold point. In other embodiments, such a selection may be received until the end of the event, until the start of the event, etc.

[0031] In some embodiments, after a partial display of an event, it may then be paused to allow a winner selection time period. The pause may take any period of time (e.g., 1 minute, 30 seconds, 5 minutes, etc.). When that period has elapsed, the winner selection time period may be determined to have ended. The players of the competition may need to select a winner before the pause period ends. In some embodiments, the players may be able to select a winner before the pause period, and / or there may be no pause period at all. After the pause period, the remainder of the event may be displayed and may form the basis for determining the winner. Thus, the threshold point may not necessarily be a point of the event itself, but may be some related point such as the pause period ending 30 seconds after reaching that point.

[0032] In some embodiments, the time period for accepting money to participate in the competition may end in response to reaching a threshold point. In other embodiments, such a point may be unrelated to such participation in the competition. Different points may be used for different actions and / or different competitions that may involve the same event (e.g., one competition may be able to use a first point to end a time period, a second competition using an overlapping event may use a different point, and the payment to participate in either competition may be before or after either of the other two points and may even be able to end with a third point).

[0033] Examples of points within rounds and / or actions related to these points are given by way of example only and are to be recognized as not limiting in any way. For example, any point before, during, or after that may be used in various embodiments and may be the same or different in different rounds and / or different competitions. Such points may be linked to a pause point (e.g., in a video gambling environment) and / or may not be so related (e.g., in a live on-site environment).

[0034] In some embodiments, as shown by block 109, one round may end and one or more wins may be determined for that round. For example, one round may end when the event associated with that round ends (e.g., when the winner of the event is determined, when all participants in the event end, etc.). A win in one round of a competition may be determined based on a match between the selected winner (e.g., block 103) and the actual winner of the round. For example, if a player selects that horse number 4 will win the round and horse number 4 wins the round, the player may be a winner in that round. Conversely, if a player selects that horse number 4 will win the round and horse number 4 does not win the round, the player may not be a winner in that round. The determination may be made for each player as to whether that player won the round or may not be based on a comparison between the selection made for the winner of that round and the actual winner of that round.

[0035] In some embodiments, depending on the conditions of the competition and the wins of the rounds of that competition, various actions may be taken as shown by decision blocks 111, 113, and 115.

[0036] For example, some embodiments can include determining whether any remaining player in the competition has hit and ended the round of the competition. Such determination can include determining whether the number of hits determined at block 109 is at least one (e.g., whether at least one player in the competition has selected the correct winner of the round or some other number desired to be some of the finalists).

[0037] As shown in block 117, if there is no hit in the round, an action may be taken (e.g., in response to the determination that there are no remaining players who made the correct selection in the round of the competition). One illustrated action can include awarding a prize to all players remaining in the competition at the time of that round in which there was no hit. For example, if at a certain point in a round there are two players remaining in the competition and neither selected the correct winner of that round, both players may be awarded a prize in some manner. Those players to whom the prize is awarded may be considered the winners of the competition. Various examples of prizes and / or victories may be described throughout this specification.

[0038] As another exemplary action that may be taken in some embodiments not illustrated in FIG. 1, some embodiments can include conducting a further round of the competition in which players who participated in the previous round of the competition are involved (e.g., if two players did not select the winning horse in the round of the competition, those two players may be able to select a horse in another round of the competition). Such subsequent rounds may act as a redo of the previous round. In some embodiments, some maximum number of redos may be possible. For example, a maximum total number of rounds may be possible, and redos may be possible until that number is reached. When the maximum is reached, the remaining players may be treated as the winners and / or losers of the competition, as desired and based on the rules of the competition.

[0039] In some embodiments, as shown in FIG. 1, if there is one or more hits from a round, an action may be taken (e.g., in response to a determination that at least one remaining player has made the correct selection in a round of competition).

[0040] One exemplary illustrated action can be to determine whether the round is the final round of competition, as shown at block 113. Such a determination may be a determination that the competition has ended. For example, some competitions may be limited to a maximum number of rounds (e.g., rounds on a particular day, n rounds from the start of the competition, etc.).

[0041] It should be recognized that the round when the maximum is reached being the maximum number of rounds and the final round is given only as an example. For example, some embodiments may not be limited to a maximum number of rounds. Such embodiments may continue, for example, until some other end condition is reached (e.g., only one player remains in the competition, there is no player who has selected the correct winner of a round of the competition, etc.).

[0042] As shown at block 119, if the final round has ended, an action may be taken (e.g., in response to a determination that the final round has ended and / or that one or more remaining players have made the correct selection in the final round). One exemplary illustrated action can include awarding a prize to all players remaining in the competition at the time of the final round. These players to whom the prize is awarded may be considered the winners of the competition. Various examples of prizes and / or victories may be described throughout this specification.

[0043] In some embodiments, as shown in FIG. 1, if the round is not the final round, an action may be taken (e.g., in response to a determination that the round is not the maximum number of rounds permitted in the competition, in response to at least one remaining player making the correct choice in that round of the competition).

[0044] One exemplary illustrated action, as shown in block 115, is that only one player can determine whether the correct choice was made in that round of the competition. For example, such a determination can include counting the number of players who made the correct choice to determine if that number is greater than 1. 1 is given as a non-limiting example only, and it should be recognized that some embodiments may include any number of players (e.g., 5, 2, 10, etc.).

[0045] As shown in block 121, if there is only one player who made the correct choice, an action may be taken (e.g., in response to a determination that only one player made the correct choice). One exemplary illustrated action can include awarding a prize to the player who made the correct choice. For example, if at a certain point in the round there are two players remaining in the competition and only one made the correct choice, that one player may be awarded a prize in some manner. The player to whom the prize is awarded may be considered the winner of the competition. Various examples of prizes and / or victories may be described throughout this specification.

[0046] As an example not shown, some embodiments may continue the competition and / or may require that some round of the competition be completed by a player. For example, a player may not be considered the winner and / or may not be awarded a prize unless the player completes the minimum number of rounds of the competition (e.g., the same as, or different from, the maximum number of rounds, which may be included in some embodiments).

[0047] As another example not shown in the figures, the player may not be required to continue to select the winner in subsequent rounds (e.g., to obtain additional bonuses), although it is possible. For example, the player may be given a prize for being the only winning player in the competition and / or may be able to accept the prize. The player may be able to increase the prize by forgoing the prize and / or continuing to select the winner of subsequent events. For example, for each subsequent win (e.g., up to a maximum or without a maximum), an additional prize may be added (e.g., the player's prize may be doubled, a larger percentage of the pool up to the entire pool may be awarded if a certain number of wins are reached, etc.). If the player fails to make the correct selection in such subsequent events, in some implementations, the player may remain without receiving a prize (e.g., the player can risk a smaller prize for a larger prize amount from subsequent rounds). In other implementations, if the player fails to make the correct selection in such subsequent events, the player may be given some prize (e.g., the original prize for winning the competition, the prize amount from previous subsequent rounds after winning the competition, the buy-in amount, some other amount, etc.). Conducting such subsequent rounds may be similar to conducting rounds of the competition if other players remain (e.g., accepting selections during the event, treating the inability to make a selection as an incorrect selection) and / or may differ from such rounds as desired.

[0048] As shown in block 123, if there are two or more players who made the correct choice, an action may be taken (for example, in response to the determination that two or more players made the correct choice, and in response to the determination that the round is not the final maximum round of the competition, one player is given here only as an example). One illustrated action can include eliminating from the competition the players who did not make the correct choice in that round. For example, each player who did not make the correct choice in that round may be eliminated from future rounds of the competition. Such players may be considered the losers of the competition. In some cases, if all players made the correct choice in the round, there may be no players to be eliminated.

[0049] It should be recognized that the elimination of players who did not make the correct choice is only a non-limiting example. For example, in some embodiments, players who made an incorrect choice may be eliminated (for example, allowing players who did not make a choice to continue). For example, in some embodiments, a player may be able to skip several rounds of the competition without being eliminated from the competition (for example, if a player is not confident about a particular round, they may skip it and remain in the competition for the next round). As another exemplary alternative, some embodiments may allow a player to remain in the competition even if they make several incorrect choices (for example, each player is given a single incorrect choice and may remain in the competition), and thus can include eliminating from the competition players who made more incorrect choices than the permitted number f.

[0050] Some embodiments may include repeating back to play another round of competition. For example, as illustrated in FIG. 1, after excluding a player from the competition, the method may repeat back to block 103 to receive a selection from the remaining players of the competition for the next round of the competition. The rounds of competition may be for the same event as the previous round of competition or a different event. The rounds of competition may proceed in the same or different manner as the previously described rounds of competition. For example, some embodiments may include receiving a selection, starting a round, ending a round, determining which players made the correct selection in the round, and performing different actions based on the situation at the end of the round and / or the number of players who made the correct selection in the round. Whether limited or not, any number of rounds may continue until the maximum number of rounds (if applicable) is reached, there are no players who made the correct selection in the round, only one player makes the correct selection (or otherwise remains in the competition after the round), and / or any other desired competition end condition is reached.

[0051] It should be recognized that receiving a selection and conducting a round in the sequential loop illustrated in FIG. 1 are provided only as non-limiting examples. For example, in some embodiments, one round may overlap with another round. The previous round of competition may be selected as the previous round even if it starts, occurs, ends, etc. after the latter rounds of the competition. For example, players can make selections for rounds (e.g., all rounds of the competition, some sets of rounds of the competition) simultaneously so that elimination can occur as desired regardless of the order of the actual execution, end, start, etc. of the rounds. As another example, the rounds may include pre-recorded rounds that are randomized, rather than a live event, to prevent improper conduct.

[0052] As another example, a player may not play rounds based on the same event, or similar events occurring simultaneously, but may instead select the winner of events that are different from each other, and / or events at different times, and / or events that occur and / or are displayed at different times from each other. In any case, such a player can still participate in the play together in this competition. Each play selection may be tracked as part of a specific round of the competition even if it occurs at different times. Thus, in some embodiments, even if a player is going to win the competition, that player may not be aware of their victory until after the rounds of the competition that occur later within the time limit from the round of the competition in which that player is going to win the competition, until the other players lose the competition.

[0053] It should be recognized that FIG. 1 is illustrated only as a non-limiting example. Other embodiments can include actions that are alternatives to, different from, the same as, more than, less than, in a different order than, not at all included in, all of, etc. the actions illustrated in FIG. 1. For example, the determination and / or exclusion of blocks 111, 113, 115, 123 may occur simultaneously, in a different sequential order, etc.

[0054] In accordance with some embodiments that can include a method as illustrated in FIG. 1, a player can participate in a competition that includes a selection decision for a plurality of rounds. The selection decision may occur for that round during the event on which the round is based. An incorrect selection may result in the elimination of the player. A player can win the competition by remaining until the last round and / or by being the last player remaining in the competition. Thus, at the start of the competition, the player may not know how long the competition will last. Thus, a player may participate in the competition to select the maximum number of consecutive winners of an event (e.g., a race) that includes a plurality (e.g., two, two or more) of participants.

[0055] Some embodiments can include awarding a prize to one or more winners. For example, the winner may be given a monetary prize, a non-monetary prize, recognition, the ability to take some action, etc.

[0056] In some embodiments, the money at risk and / or otherwise paid to participate in the competition may be pooled into a pari-mutuel pool. In some embodiments, a prize may be awarded to one or more winners of the competition from the pari-mutuel pool. For example, each winner of the competition may receive a share of the pari-mutuel pool proportional to the amount spent to participate in the competition. In embodiments where the entry amounts are equal (e.g., there is a single buy-in or entry fee amount for the competition), for example, the winners may receive equal shares. In embodiments where the entry amounts may vary, a winner who paid a higher amount to participate in the competition may receive a larger share of the pool than a winner who paid a lower amount to participate in the competition.

[0057] In some embodiments, the money spent to participate in the competition can include, in addition to and / or other than pari-mutuel wagering, ledger wagering. For example, such money spent may be spent at a sportsbook. Such ledger wagering can include a payout rate and / or other characteristics (e.g., 2-1 payout rate, 10-1 payout rate, 100-1 payout rate, etc.) that may be defined by the sportsbook and / or other game operator.

[0058] Giving a prize to a player can include adjusting the account balance of the game account, providing money to the player, and the like. For example, in some embodiments, a game account in which a user risks money regarding a competition may be adjusted to include a refund in response to the winner winning the competition (e.g., through an electronic device such as a kiosk, a mobile device, etc.). In some embodiments, the winner may present a physical ticket to a window clerk to receive a physical cash refund.

[0059] In various embodiments, any desired type of refund or prize may be provided in a pari-mutuel manner, a ledger-based manner, or any other, and it should be recognized that these examples of giving prizes to the winner are non-limiting.

[0060] Some embodiments can include providing a second chance to the loser to continue playing the competition. For example, some embodiments may provide a prize to one or more second-place finishers of the competition. Such a prize can include a prize smaller than the winner's prize (e.g., 10% of such a prize). In some embodiments, the second chance may allow the player to buy back into the competition (e.g., pay some fee that may be greater than, equal to, or less than the original buy-in to prevent elimination from the competition). Such a buy-back amount may be available only in the first half of the competition and / or the second half of the competition. Such a buy-back amount may increase as the competition continues.

[0061] Some embodiments may execute a second competition that starts at a time later than the first competition or may include the losers of the first competition. For example, the last n (e.g., 5) races may be a different competition in which the losers of the competition may participate (e.g., may not have to pay, may be able to pay, may be only for those losers, etc.). The second competition may overlap with that competition (e.g., the competition may continue in all races of the day, and the second competition may be for the last n races of the day such that the last n races may overlap). Thus, a loser of one of the overlapping races may or may not be able to participate in the second competition. For example, the loser of the second-to-last race of the day may participate in the second competition as if having won from the round before the second competition to the last round of the second competition. In other embodiments, participation in the second competition may be cut off at the start of the second competition. The second competition may be executed substantially similarly to the above competition. Such a second competition may include a mix of all the losers of the first competition and / or losers and new players who did not participate in the first competition. Some or all participants may be required to pay a fee that depends or does not depend on their status as a loser of the first competition (e.g., losers may participate for free or with a lower bet than new players). The game operator may provide and / or track progress and / or participation in the second competition in response to the actions and / or results of the competition to provide the losers of the competition (e.g., losers who reached some point in the competition) with an opportunity to continue playing.

[0062] Some embodiments may allow a player to forfeit during the course of a competition. For example, if a player reaches the second-to-last round of a competition, the player may take some prize in order to forego the chance to win the competition. Such a prize may be determined based on the potential size of the prize for victory, the number of players remaining in the competition, and / or the probability that the player will win the competition. For example, the game operator may offer the player 90%, 110%, etc. of the expected value of remaining in the competition to forfeit immediately.

[0063] Some embodiments are provided with respect to performing game actions prior to a competition or a round of a competition, but it should be recognized that such examples are non-limiting. For example, some embodiments can include enabling a player to participate in a competition by risking money during the first and / or subsequent rounds of the competition (e.g., before the cutoff for selecting the winner of the first round). As an example of participating in a later round, the player may pay some additional fee to participate in the competition in a round after the first round. Such a fee may be determined by the game operator and / or based on the expected benefits the player will obtain for participating in a later round (e.g., may increase as the round progresses and / or as other players lose).

[0064] Some embodiments can include live events and / or events at a single game venue. For example, some embodiments can include competitions related to a one-day or weekend race at a single race track. As another example, some embodiments can include rounds related to the innings of a baseball game held at a single stadium (each round relates to who scores more runs in an inning, what events occur in that inning, etc.). Such events can include live events that may occur simultaneously with such a competition. Such examples are non-limiting.

[0065] Some embodiments can include events that are not live events and / or not a single game venue (e.g., a race track). For example, some embodiments can include competitions involving events from multiple venues (e.g., competitions including races at multiple race tracks, multiple arenas, etc.). Some embodiments can include events that are not live events and / or not events concurrent with a competition. For example, some embodiments can include selecting pre-recorded events and presenting them as competition events (e.g., playing portions of the event through a display device).

[0066] Some embodiments are described as including a single set of events for a competition relevant to all users, but such examples are non-limiting. For example, some embodiments can include different sets of events for at least some different players. For example, players at one venue may participate in a competition related to an event at that venue, and players at another venue may participate in a competition including an event at that venue. As another example, different pre-recorded events may be presented to different players. Needless to say, the competition may be the same, and may relate to the same pool and / or victory conditions.

[0067] In some embodiments, a player may use a mobile device to participate in the competition and / or make selections. For example, the user may be present at the race track while watching the race and may enter selections from the mobile device through a game interface presented on the mobile device. Using such a method, the user can gain an advantage if the user is able to make selections during the race. For example, the user may be able to view a larger portion of the race than if the user had to move far away from the race to make a selection. Such additional race information can provide an advantage to the mobile device user (e.g., this user can know more about the race situation than other users by being able to view more of the race before making a selection). In some embodiments, if there is a live event that includes multiple selections for the competition in a single event (e.g., selecting a leader at multiple points in the race), a player playing on a mobile device can also have an advantage here by being able to observe the race without having to move to a kiosk or other game play device that is far away from the event in order to perform a game action.

[0068] In some embodiments, a race track and / or other game operator may be able to obtain a pool and / or other portion of the payment to provide the service. For example, in a ledger-based game environment, the game operator may obtain the losing bets and / or may set the payout rate such that a larger amount of money is expected to be obtained for payment.

[0069] Figure 2 shows an example among several embodiments. For example, Figure 2 shows a venue 201 (e.g., a racetrack) where one or more rounds of competition may occur. Figure 2 shows an exemplary game system 203. Such a game system may be operated by a game operator such as a racetrack operator, multiple venue operators, a bookmaker, etc. to provide functions related to competition. Figure 2 shows a mobile device 205 on which one or more players can take actions related to the competition. Figure 2 shows one or more other devices 207 on which actions related to the competition may be taken.

[0070] The venue 201 can include a racetrack, a casino, a sportsbook, a game facility, a sports venue, an arena, etc. It should be recognized that the various embodiments are not limited to any particular venue. It should be recognized that the various embodiments are not limited to a single venue, but rather may include multiple venues (e.g., related to a single game operator that may provide competition through a bookmaker, an event occurs, etc.).

[0071] The game system 203 can include a game server, a totalizer, a processor, any computing device. The game system can include a server operated by a game provider that provides the competition. Such a game system may determine payout rates, maintain account information, maintain audit information, determine results, take actions related to the competition (e.g., implement the method of Figure 1), execute one or more competitions, accept input from players, control the device to display an interface that enables entry of information related to one or more competitions, resolve payout rates, select pre-recorded events, track buy-ins, etc. It should be recognized that such a system may execute software and / or perform any actions that can promote a competition as described herein.

[0072] In some embodiments, where multiple venues may exist, system 203 can include a system associated with multiple venues in some manner. For example, such a system can include a totalizer as operated by AmTote International. Such a totalizer, or other systems, that can operate across multiple venues to enable games at multiple venues can interact with, and / or include, local systems at the venue (e.g., mobile devices, fixed devices, servers, etc.). For example, a local system can receive a buy-in or other game action and transfer the buy-in or other game action to a mediator server (e.g., a racetrack server can receive a buy-in or other game action and transfer it to the totalizer). It should be recognized that any arrangement of multiple computing systems into an integrated game system may be used as desired and that various embodiments are not limited to any particular arrangement.

[0073] Mobile device 205 can interface with game system 203 to facilitate games by one or more players. For example, mobile device 205 can display information, transmit information, and / or receive information regarding the competition. Such information may be received and / or transmitted to game system 203. Game system 203 can control the mobile device to perform desired actions (e.g., enable a player to select a winner, show a list of possible winners, display an account balance, enable a player to buy into a competition and / or a second competition, display a payout rate determined by the game system to the player, display an event and / or portions thereof, etc.). Such communication may occur through dedicated and / or public communication systems (e.g., the Internet, a cellular network, a venue Wi-Fi network).

[0074] The other device 207 can include fixed devices such as kiosks, devices outside the venue (e.g., devices outside a game venue, devices in a user's home, etc.), devices operated by a staff member at a window in the venue, and the like. Such devices can include computing devices that may be used to interface with the game system 203 in any manner (e.g., similar to and / or different from the device 205).

[0075] It should be recognized that the arrangement in FIG. 2 is given only as a non-limiting example, and that various embodiments can include such components, arrangements, and functions as additional, different, alternative, more, less, different, none, all, etc. in any combination as desired.

[0076] It will be understood that the techniques described herein for creating, using, or practicing various embodiments are only a part of the possible techniques that may be used for the same or similar purposes. The specific techniques described herein should not be construed as limitations. Instead, various embodiments contemplate alternative techniques for creating, using, or practicing various embodiments.

[0077] Past exclusion examples Some embodiments can include one or more elements that can increase the speed of competition, facilitate disconnection from a race or other event environment, and / or sever competition from a live event. For example, some embodiments can include events recorded as a basis for competition rather than live events. As another example, some embodiments can include competitions that depend on portions of one or more events rather than an entire event.

[0078] In one example, at least a portion of one or more recorded events can form the basis of a competition. For example, the events may be selected from a set of possible past events to form the basis for each round of the competition. For example, a horse race from 10 years ago may be selected as the basis for the first round of the competition. Such selection may be a random selection, a selection in response to the start of the competition, a selection of a set of events of the competition together, or a selection of the events of a round in response to the start of the round. Such events (e.g., event IDs) may or may not be known to the players before and / or during the competition (e.g., the competition may or may not be announced prior to the competition, and the event IDs may or may not be hidden during the competition). Any combination of selections, such as methods, live and recorded events, complete events and parts of events, etc., may be used together to form the basis of the competition in any arrangement.

[0079] Some embodiments can include determining the end of each event in each round of the competition. For example, the end of the events of a round may be the past end of the events that actually occurred. In other embodiments, the end may be some intermediate point of the event. For example, the end may be the first lap, the first halon, a random point, the first half, etc. For example, each round can include a first, middle, last, random, etc. portion of a recorded race. The portion may include a random time between 1 second and 50 seconds, and the portion may include a random or fixed end point or time, such as a random point during the race when the leading horse reaches a random point.

[0080] Some embodiments can include determining the start of each event in each round of competition. For example, the start of a round event may be the past start of an event that actually occurred. In other embodiments, the start may be some intermediate point of the event. For example, the start may be the final lap, the final halon, a random point, the second half, etc. For example, each round can include the first, middle, last, random, etc. parts of a recorded race. The part may include a random time between 1 second and 50 seconds, and the part may include a random or fixed start point or time, such as a random point during the race when the leading horse reaches a random point, etc.

[0081] Some embodiments can include determining a pause or selection time for each event in each round of competition. For example, in some embodiments, the recording of an event may be paused once at some point where a round selection is required, and / or the selection may need to be made before reaching some point of the event. The determination can include determining when that point should be. That point may be a fixed point and / or a variable point. For example, such a point may include the last minute of the event, the last lap of the race, the last halon of the race, the last part of the event, etc.

[0082] In some embodiments, a competition using a recorded or simulated event may be operated in the same manner as other embodiments described herein. Some embodiments can include live events of such a method (e.g., a live event that ends at a random point). By using such a method, a faster competition may be played (e.g., in 10 minutes, many rounds of 30 seconds each may be executed by running the rounds of the recorded event or live event for their length, etc.).

[0083] In another example, the competition can include two or more rounds of one or more events. For example, one round can include a portion of the event (e.g., random, intermediate, first, last, etc.). The next round can include a subsequent portion of the same event. In a single event, any number of rounds may be played. For example, the entire competition may be run as a single event. In such an example, at each of a plurality of points in the race, each player may be asked to select the winning participant at that point. The rounds are similar to the rounds described elsewhere, but may be run in the same event, potentially at a faster speed. Using such an embodiment, players may be stimulated to pay more attention not only at the end of the event or round, and thus may focus more on the race event, and may participate in competitions involving multiple points throughout the race, not just at the end of the race or event.

[0084] Figure 3 shows an exemplary method that may be implemented in some embodiments. The exemplary method may be used, for example, in playing a game based on past events. Examples are given with respect to past events, but it should be recognized that the exemplary method may be used in combination with other embodiments as desired (e.g., live events, simulated events, combinations of event types, etc.). The game may be played through a mobile device, kiosk, slot machine-like machine, computer, server, client device, and / or any other desired device. A game according to one or more embodiments described herein may be referred to as an elimination and / or survival game.

[0085] As shown in block 301, some embodiments can include determining players of an elimination game. For example, a plurality of players may risk money and / or otherwise participate in a particular elimination game, and those players may be determined to be participating in the elimination game. The elimination game may start at a predetermined time such that players who perform game actions during a period of time prior to that time can participate in the elimination game. Players may participate in the next elimination game to start when they perform a first game action (e.g., pay an entry fee), and / or may be given a choice of elimination games as to when to participate in the game.

[0086] In some embodiments, the elimination game can have a first event. For example, players who participate in the elimination game during some period of time before the elimination game starts may be assigned to the same game with the same first event. In some embodiments, the elimination game may not have a fixed time or event. For example, different players may play the same elimination game, but display different events and / or start at different times. For example, the next group of people (e.g., 100 people, 10 people) may all be considered to be participating in the same elimination game even if they start playing at different times. Such a group of players can play the same event and / or different events. Thus, it should be appreciated that any manner of determining which players are in the elimination game together may be used.

[0087] As shown in block 303, some embodiments can include determining a race event for use in one round of an elimination game. In some embodiments, the same race event may be used for all of the determined players. In some embodiments, different race events may be used for some of the participants (e.g., all of the participants). Determining the race event can include selecting a race event from a library of race events stored in a race event database. The determination may be made randomly, procedurally, sequentially, based on a desired difficulty level, etc., as desired. For example, in some embodiments, the race events may be tagged with a difficulty level. For each event determination, an event tagged with the desired difficulty level may be selected. The difficulty level may increase as the competition progresses. In a particular round, if players play based on different events, each event may be selected such that each player has the same difficulty level.

[0088] As shown in block 305, some embodiments can include presenting a portion of a determined race event to one or more players. For example, some embodiments can show displaying 10 seconds of a race event to a player. The 10 seconds can be at the start, middle, end, etc. of the race event. For example, in some embodiments, the first 10 seconds of the last eighth of a race may be selected. The same portion of the same event may be displayed to each player. The same amount of the race event may be shown to each player, or it may be different events. Different portions, different times, and / or different events may be displayed to different players. Presenting a portion can include the server reading a database of race information and transmitting that information to a device for display. For example, the server can maintain race information, and the information may be transmitted to a kiosk, mobile device, etc. for display. A portion may include between a determined start and a determined end, a portion between a determined start and a determined pause and / or selection point, a fixed portion stored in a video library, etc.

[0089] Some embodiments can include synchronous presentation of that portion (e.g., controlled by a central server such that a client device displays that portion at a desired synchronous system time). In some embodiments, information regarding the race may be stored locally for display, and the central server may instruct the client server which information from that local information is to be displayed, rather than transmitting the information itself. It should be recognized that any manner of presenting the desired event information regarding a portion may be used in a variety of embodiments as desired.

[0090] Some embodiments can include presenting handicap information of a race participant to one or more players. For example, as it stores race data, the game server may maintain past handicap data (e.g., pari-mutuel pools of actual events, expert predictions made for actual events, information about race participants that can be used to educate bettors, etc.). Such handicap information can be presented to one or more players to assist in placing bets on one or more elimination rounds (e.g., through a device, in addition to the game interface, and / or in addition to the first part of the race event, by displaying the information).

[0091] As shown in block 307, some embodiments can include pausing the presentation and / or otherwise ending that part of the presentation. For example, after that part is presented, a selection from the player may be requested. For example, the video of the race part may be paused, and the betting interface may allow selection of the winner of the race after that part is displayed. Each (non-eliminated / remaining) player may be requested to make such a selection. The selection may need to be made within a certain period (e.g., 10 seconds before the presentation resumes, etc.). If the selection is not made, in some embodiments, the player may forfeit the entry, and thereby may be eliminated. In some embodiments, after that period and / or after all players have made their selections, the game may continue. In some embodiments, the presentation may not need to be paused, and instead, the selection interface may allow selections during the presentation up to some point in the event. A display of the remaining time or distance for the selection may be shown.

[0092] As shown in block 309, some embodiments can include receiving a selection of a respective winner from each of the players remaining in the elimination game. Such a selection may be made through the game interface of the device. Such a selection can identify which race participant the player selected to win the event based on the portion of the event shown to the player. With a correct selection, the player may win this round of the elimination game. An incorrect selection may result in the player being a loser in that round and potentially being eliminated from the elimination game.

[0093] As shown in block 311, some embodiments can include presenting the remaining portion of the event (and / or, in some embodiments, multiple events) to the player. For example, the event, considered to be at the end of the selection period, or the event from when some point where a bet is required occurs, may be presented to the player. This portion may be the remainder until the end of the race and / or until some other determined and / or fixed end point. The point at which the presentation ends may be the point at which the winner of the race is evaluated against the player's selection. In some embodiments, the end point may be some intermediate point. Presenting such information can include presenting it similar to the presentation of the first half of the race. Presenting the information may be for the same or different events to the player based on the desire of the game operator (e.g., different final portions of different events may be presented in embodiments where the player is playing regarding different events). The presentation may be synchronized or may occur at different times depending on the desire of the game operator.

[0094] As shown in block 313, some embodiments can include eliminating players who made an incorrect selection. For example, players who did not correctly select the winner of the just - shown race may be eliminated. Other players may move on to the next round, win the game, etc. Special situations where all players are eliminated will be considered separately. Eliminating can include excluding a player from the game (e.g., ending a player's game, a player losing the game, etc.).

[0095] As shown in block 315, some embodiments can include determining whether the elimination game has ended. The game can end when there are no remaining players, one player remains, and / or some other end trigger is reached (e.g., some other number of players remain, such as 10, some number of rounds have passed, etc.). If the game has not yet ended, the game can return to block 303 and repeat for one or more subsequent elimination rounds, involving players who have not yet been eliminated from the completed rounds.

[0096] As shown in block 317, if the game is determined to have ended, in some embodiments, one or more players remaining in the game may be awarded a prize. For example, such one or more players may be given money from a pool of buy - in money that the players of the game paid to participate in the game. Some embodiments can include a store that gives some prize, prize amount, etc.

[0097] In some embodiments, the round and the player selection may occur simultaneously and / or substantially simultaneously (e.g., transmission, processing, and synchronization errors are ignored). In some embodiments, the presentation and the selection may occur at any desired time, in proximity to each other, and / or at different times. In some embodiments, one or more methods may be used to conceal the video and / or prevent collusion from one player to another player when the timings are not similar or the same.

[0098] It should be recognized that various embodiments can include actions that are different, not included at all, similar, more than this, less than this, in a different order, etc., as desired. For example, in some embodiments, the first portion may not be displayed before the selection is required. The various embodiments may be employed together in any combination. A game according to some embodiments may allow a player to play a quick elimination game using past game data rather than waiting for a new race to be run to play, and / or may play in a manner that allows numerous players in various locations to participate.

[0099] Event Selection Example Some embodiments can include maintaining a library of races (and / or other events). For example, video footage from a racecourse may be transmitted to and / or received by a server. The information may be stored in a database and tagged in any manner for future retrieval.

[0100] Some embodiments can include classifying race data for future use. For example, some embodiments can include tagging race data based on a difficulty assessment so that races of a particular difficulty can be accessed when desired in the future. For example, in some embodiments, three levels of difficulty may be maintained. Each level of difficulty may correspond to how closely race participants are proximate at a point in the race when a selection is required. Each race may have multiple levels of difficulty based on different points throughout the race. The closer the participants are together at that point, the higher the difficulty of selecting a winner may be. For example, if one horse is far ahead at a certain selection point, the race may be an easy race because the information at that point provides a large amount of information to the player. If all the horses are the same at the selection point of the race, the race may be a difficult race because the information at that selection point may provide little information to facilitate the selection. Other ways of assessing difficulty may be used (e.g., if misleading information that can increase the difficulty is provided at the selection point).

[0101] Some embodiments can select the difficulty of the elimination round. For example, the difficulty may be randomly selected, the difficulty may be selected to increase with each round, the difficulty may be selected according to some desired order, and / or in any desired manner.

[0102] In some embodiments, the races of that difficulty may be randomly selected from a library of races tagged with that difficulty. In some embodiments, if these are available for selection, higher quality videos may be preferred over lower quality videos.

[0103] It should be recognized that maintaining, obtaining, classifying, and / or selecting events may be performed in any desired manner, and the examples in this specification are merely non-limiting.

[0104] Some embodiments may include actual past races, while other embodiments may include fake races and / or virtual races. For example, in some embodiments, a difficulty level may be determined and the virtual race may be created to simulate a race at that difficulty level.

[0105] Concealment Example Presenting a portion of a race prior to a player's selection may allow for cheating to occur. For example, a computer algorithm may be used to analyze a portion of a race and determine which actual race the portion originated from. A similar process may be implemented using a smartphone application known as Shazam for analyzing portions of music. With knowledge of which race the presented portion originated from, a user may then know who the winner of the race is and be able to cheat at the selection point.

[0106] Accordingly, some embodiments can include obscuring and / or selecting portions and / or races in order to suppress such improper acts. One way to obscure can include removing the original sound from the race so that the sound cannot be used as an input for improper acts (e.g., replacing with a new game sound or not including the sound). One way to obscure can include adjusting the presentation to include different colors or additional information / removed information that was originally present (e.g., replacing orange with yellow, removing information from an area of the screen, changing the dimensions of the screen, manipulating the video to display only a predetermined portion of the recording). One way to obscure can include adjusting the quality of the video (e.g., reducing the quality from the original, reducing the resolution, reducing the frames, etc.). One way can include prioritizing new races and / or not reusing races for a certain period of time. One way to obscure can include selecting random selection points instead of fixed selection points so that the analysis time for detecting the race can be unknown. One way to conceal can include ending the race at a random or otherwise unfixed time (e.g., the last eighth of the race instead of the actual end of the race). These are only examples and it should be recognized that they are not limiting in any way.

[0107] Single race exclusion example As described above, the exclusion game can occur over the entire single event (live or past). For example, various portions of the race can be one round of the exclusion game. This portion can be continuous (e.g., like eight consecutive portions of the race where one portion ends and the next starts immediately) and / or non - continuous (e.g., an eighth - of - a - lap interruption after an eighth - of - a - lap where the user can select for the next eighth - of - a - lap). The selection period can end an eighth of a race before the decision point of the selection (e.g., when the first participant reaches the start of the eighth - of - a - lap). It should be recognized that the eight - division is given only as an example and any desired portion, such as a lap of a NASCAR race, can be used.

[0108] Example of walking event A computing device (e.g., a server) can receive information regarding an event, receive a winner selection by a player, and determine a winner of a round and / or a competition, etc. Since the information regarding the event may be received from any information source, the device can determine which player made a correct selection and / or which player made an incorrect selection.

[0109] The information may be received from a person identifying the event (e.g., a person pressing a button on a computing interface). For example, an employee of a game operator may input the ranking of race participants at the end of a race, may input when the race starts, may input when a participant reaches a certain point of the race, may input which participant becomes the first in a part of the race, etc.

[0110] The information may be received from some kind of computing device. For example, a GPS may be installed on each participant, and GPS data may be used to determine locations and events (e.g., where each participant is in a walk, when they reach various points, etc.). The information may be determined based on video monitoring and / or analysis of the race. Various electronic means for determining the location of race participants may be used. An exemplary system is the Trakus system.

[0111] Example of free participation Some embodiments can include optional free - for - all participation. For example, during the play of an elimination game (e.g., for any round of the game), one or more players may bet on that particular round. The player can be a player of the elimination game (e.g., previously eliminated, not eliminated) or any other player not participating in the elimination round. The player may then play in a single round of the elimination game, similar to the other players in that round. The difference between this mode of play and the elimination game mode of play is that the free - for - all mode may be a single - round mode. The winner of the free - for - all mode may split the prize pool with the other players in that free - for - all mode, but may not affect the elimination game. Thus, through single - round play, multiple games and / or pools may be played based on a single event. In some embodiments, different bets may be placed in the free - for - all mode, and the face value amount of each bet may be pooled into its own pool together with other bets of the same face value amount (e.g., for the same free - for - all round, a $5 pool, a $20 pool, etc.).

[0112] N Elimination Selection Example Figure 4 shows an exemplary method that may be implemented in some embodiments. Such a method may enable an elimination game to include the ability to re - participate in the game after elimination. Such a game may be particularly useful in longer events such as NASCAR races where players eliminated in the first half may desire the option to re - participate in the game in the second half. Such a method may be implemented by a game server, a computing device, a client device, etc.

[0113] As shown in block 401, some embodiments may include accepting a buy-in for an elimination game from a plurality of players. The player may buy in at the start of the race. Some embodiments may require that players who plan to participate in the game must buy in at the start of the race. Some embodiments may allow a player to buy in during the race (e.g., after some number of race selections in the elimination game have already been exceeded and before some maximum number of race selections is exceeded). The buy-in can include risking a certain amount of money against the chance of winning the game (e.g., in cash, from a game account, etc.). For example, at the start of a car race, a player may use a mobile device to place a bet on the race-based competition from a game account and / or a credit card.

[0114] As shown in block 403, some embodiments can include pooling the accepted buy-ins into a prize pool for the elimination game. Such a pool can include a pari-mutuel pool maintained by the game operator. The game operator may receive some portion of the pool as compensation for running the event. The prize pool may be paid out to one or more winners of the elimination game.

[0115] As shown in block 405, some embodiments can include receiving, from a plurality of players, their respective selections for the first part of an event. For example, before a car race starts, players can select who will be in the lead after the first lap, a set of laps, a portion of a lap, etc. The first part can be any part of the race and is not limited to the starting part of the race (e.g., it can be a later lap). The selection may or may not be required from all players, depending on the desired implementation, and / or may not be required for a particular part. The selection may be made through the mobile devices of players who may be watching the race. The parts may be the same or different for each player (e.g., all players may be required to make a selection regarding a particular part, or players may choose which parts from a set of possible parts they desire to make a selection for). For example, players may be required to make at least one selection every 5 laps instead of every lap, and / or may be required to make a selection every lap.

[0116] As shown in block 407, some embodiments can include eliminating, from an elimination game, players who made an incorrect selection for the first part. For example, if a player selects that the wrong car will be in the lead at the end of the first lap, that player may be eliminated from the game. Some embodiments may allow a certain number of incorrect selections before elimination.

[0117] As shown in block 409, some embodiments can include enabling the correct player to make a selection for the second part of the elimination game without the need for an additional buy-in. For example, because the player made the correct selection, it may be possible to proceed to the next round of the game for free. In some embodiments, the second part may be the next part, and each correct player may be required to make such a selection. In other embodiments, the player may be able to select their own next part by skipping some of the parts where selection is possible (e.g., selections are required every 5 laps, at least a few selections are required throughout the race, etc.).

[0118] As shown in block 411, some embodiments can include enabling an eliminated player to re-enter the elimination game and make a selection for the second part of the elimination game by making a buy-in to the prize pool. For example, the player can use the mobile device interface to put money into the prize pool from the game account and / or credit card in order to buy back into the elimination game after being eliminated. In some embodiments, the player may be required to buy back into the next part of the game after their elimination or forgo a possible future buy-in. In some embodiments, the player may be able to buy back in a future part when desired. In some embodiments, the player may be prevented from buying back into the elimination game at some point in the game. For example, the final X (e.g., 10, 5) parts (e.g., laps) may not allow a buy-back. This may provide a sufficient final part of the elimination game to eliminate the player. Otherwise, the player could buy back in the final lap and win the game without having to fully participate. Some embodiments include determining that the final set of parts has been reached, and after reaching that final set, a buy-in can be prevented.

[0119] The device may continue to receive such selections, evaluate them, and eliminate players, etc., until the end of the elimination game. Depending on the rules of the game operator, any number of elimination rounds may be performed or required in various embodiments. For example, the elimination game may continue from the start of the race to the end of the race, or until only one player remains in the elimination game. Throughout the game, eliminated players may re-enter the elimination game (e.g., any number of times, a limited number of times, up to the last set portion, etc., according to any operator restrictions).

[0120] As shown in block 413, some embodiments can include distributing a prize pool among the players remaining in the elimination game at the end of the elimination game. The pool can include the original buy-in and all subsequent re-buy-ins from eliminated players.

[0121] The winner may be determined in a variety of ways. For example, in some embodiments, if the final player(s) are considered the winner in the final round, the methods described above may be used. In some embodiments, some correct selections by the player may be used to determine the winner (e.g., the winner may be the player with the most correct selections during the game who also remains at the end of the game, or even if that player does not remain last, the player with the most correct selections, etc.). Such embodiments may encourage the player to make selections often and may continue to give feedback to make more selections. Some embodiments may select the winner such that the winner has made at least some minimum number of correct selections. Such embodiments may allow the player to qualify for the final part of the game by making a minimum number of correct selections. Some such embodiments may require selections in the last part of the game (e.g., the last X, the last 10 parts where no backtracking is allowed), but may not require selections between all other parts (e.g., as long as the minimum has been reached). Some embodiments may include giving the player a bonus based on the number of correct selections (e.g., for each correct selection, getting a larger percentage of the prize pool at the end, getting some amount of money for each correct selection, etc.).

[0122] Some embodiments may include a counter for correct vs. incorrect selections. For example, the player may be able to remain in the game as long as the correct selections are more than the incorrect selections in some manner (e.g., at least greater, greater than some threshold, etc.). Thus, in some implementations, the player may not be eliminated for all incorrect selections.

[0123] It should be recognized that the various embodiments and the illustration of FIG. 4 are given by way of example only.

[0124] It should be recognized that the various examples in this specification are given only as non-limiting examples. For example, a race is described, but it should be recognized that some embodiments may not be so limited. Instead, any event may be used. For example, a player may be asked to select a winner of an ongoing soccer game, a single soccer game at various points, any event, any series of events, a fantasy game, a real game, etc.

[0125] Without departing from the scope of the present invention, changes, additions, or omissions may be made to the method. The method can include more, fewer, or other steps. In addition, the steps may be performed in any suitable order without departing from the scope of the present invention.

[0126] This disclosure is described with respect to certain embodiments, but in general, related methods, alternatives, and rearrangements of embodiments and methods will be apparent to those skilled in the art. Accordingly, the above description of exemplary embodiments does not limit this disclosure. Other changes, substitutions, and alternatives are also possible without departing from the spirit and scope of this disclosure as defined by the claims herein.

[0127] The following sections provide guidance in interpreting this specification.

[0128] II. Terms The term "product" means any machine, manufacture, and / or composition of matter, unless otherwise expressly stated.

[0129] The term "process" means any process, algorithm, method, etc., unless otherwise expressly stated.

[0130] Each process (whether called a method, algorithm, or otherwise) essentially includes one or more steps. Thus, any reference to a "step" (singular or plural) of a process has an essential antecedent basis in the mere description of terms such as "process". Therefore, the reference to a "step" (singular or plural) of a process in a claim has a sufficient antecedent basis.

[0131] The term "invention" and the like, unless otherwise specifically stated, means "one or more inventions disclosed herein".

[0132] The terms "an embodiment", "embodiment", "embodiments", "the embodiment", "the embodiments", "one or more embodiments", "some embodiments", "a given embodiment", "an embodiment", "another embodiment", etc., unless otherwise specifically stated, mean "one or more (but not all) embodiments of the disclosed invention".

[0133] The term "variant" of the present invention, unless otherwise specifically stated, means an embodiment of the present invention.

[0134] A reference to "another embodiment" when describing an embodiment does not, unless otherwise specifically stated, imply that the referenced embodiment is mutually exclusive with another embodiment (e.g., an embodiment described before the referenced embodiment).

[0135] The terms "comprising", "including" and their variants mean "including but not necessarily limited to", unless otherwise specifically stated. Thus, for example, the sentence "The portfolio includes red widgets and blue widgets" means that the portfolio includes red widgets and blue widgets, but may include something else.

[0136] The term "consisting of" and its variations mean, unless otherwise expressly stated, "including and limited to". Thus, for example, the sentence "The portfolio consists of red widgets and blue widgets" means that the portfolio includes red widgets and blue widgets and nothing else.

[0137] The term "comprising" and its variations mean, unless otherwise expressly stated, "making up its components, its constituent parts, or its elements". Thus, for example, the sentence "Red widgets and blue widgets comprise the portfolio" means that the portfolio includes red widgets and blue widgets.

[0138] The term "exclusively comprising" and its variations mean, unless otherwise expressly stated, "exclusively making up its components, being only its constituent parts, or being only its elements". Thus, for example, the sentence "Red widgets and blue widgets exclusively comprise the portfolio" means that the portfolio consists only of red widgets and blue widgets.

[0139] The terms "a", "an", and "the" mean, unless otherwise expressly stated, "one or more".

[0140] The term "plurality" means, unless otherwise expressly stated, "two or more".

[0141] The term "as used herein" means, unless otherwise expressly stated, "as used herein, including any matter that may be incorporated by reference".

[0142] The phrase "at least one of" means, when such phrase modifies a plurality of items (a list of enumerated items), any combination of one or more of those items, unless otherwise explicitly stated. For example, the phrase "at least one of widget, car, handle" means (i) widget, (ii) car, (iii) handle, (iv) widget and car, (v) widget and handle, (vi) car and handle, or (vii) widget, car, and handle. The phrase "at least one of" does not mean "one of each" of the plurality of items when such phrase modifies a plurality of items.

[0143] Numerical terms such as "one", "two", etc., when used as cardinal numbers to indicate some quantity (e.g., one widget, two widgets), mean the quantity indicated by that numerical term, but not at least the quantity indicated by that numerical term. For example, the phrase "one widget" does not mean "at least one widget", and thus the phrase "one widget" does not cover, for example, two widgets.

[0144] The phrase "based on" does not mean "based only on", unless otherwise explicitly stated. That is, the phrase "based on" describes both "based only on" and "based at least on". The phrase "based at least on" is equivalent to the phrase "based at least in part on".

[0145] Terms such as "represent" are not exclusive, unless otherwise explicitly stated. For example, the term "represent" does not mean "represent only", unless otherwise explicitly stated. That is, the phrase "the data represents a credit card number" describes both "the data represents only the credit number" and "the data represents the credit card number and the data represents something else as well".

[0146] The term "thereby" is used in this specification only when preceding a clause or other set of words that express only an intended result, objective, or consequence of something previously set forth explicitly. Thus, when the term "thereby" is used within a claim, the clause or other words modified by the term "thereby" do not establish a further limitation of the claim, nor do they limit the claim or its meaning.

[0147] The term "for example" and similar terms mean "for instance," and thus do not limit the terms or phrases they describe. For example, in the sentence "A computer transmits data (for example, instructions, data structures) via the Internet," the term "for example" explains that "instructions" are an example of "data" that a computer can transmit via the Internet, and also explains that "data structures" are an example of "data" that a computer can transmit via the Internet. However, both "instructions" and "data structures" are merely examples of "data," and other things besides "instructions" and "data structures" can also be "data."

[0148] The term "respectively" and similar terms mean "individually." Thus, when two or more things each "respectively" have a characteristic, each such thing has its own characteristic, and these characteristics may be different from each other, but they do not have to be different from each other. For example, the phrase "Each of two machines has its respective function" means that the first such machine has a function and the second such machine also has a function. The function of the first machine may or may not be the same as the function of the second machine.

[0149] The term "i.e." and similar terms mean "that is," and thus limit the terms or phrases they explain. For example, in the sentence "A computer transmits data (i.e., instructions) via the Internet," the term "i.e." explains that "instructions" are the "data" that the computer transmits via the Internet.

[0150] Any given numerical range shall be deemed to include integers and decimals within that range. For example, the range "1 to 10" shall be specifically construed to include integers from 1 to 10 (e.g., 1, 2, 3, 4, …, 9) and non-integers (e.g., 1.1, 1.2, …, 1.9).

[0151] If two or more terms or phrases are synonyms (e.g., due to an explicit statement that the terms or phrases are synonyms), an instance of one such term / phrase does not mean that another such term / phrase must have a different meaning. For example, if a sentence indicates that the meaning of "comprising" is synonymous with "including but not limited to," the mere use of the phrase "including but not limited to" does not mean that the term "comprising" means anything other than "including but not limited to."

[0152] III. Determining The term "determining" and its grammatical variations (e.g., determining a price, determining a value, determining an object that meets a particular criterion) are used in a very broad sense. Since the term "determining" encompasses a wide range of actions, "determining" can include calculating, computing, processing, deriving, inspecting, referring to (e.g., referring to a table, database, or another data structure), specifying, etc. "Determining" can also include receiving (e.g., receiving information), accessing (e.g., accessing data in memory), etc. Additionally, "determining" can include solving, selecting, choosing, establishing, etc.

[0153] The term "determine" does not imply certainty or absolute accuracy, and thus, "determine" can include, for example, estimating, inferring, predicting, speculating, etc.

[0154] The term "determine" does not imply that a mathematical process must be carried out, does not imply that a numerical method must be used, and does not imply that an algorithm or process is used.

[0155] The term "determine" does not imply that any particular apparatus must be used. For example, it is not necessarily required that a computer perform the determining.

[0156] IV. Form of the Claims If the limitation of the first claim includes one of the features as well as two or more of the features (for example, a limitation such as "at least one widget" includes one widget as well as two or more widgets), and in a second claim that depends on the first claim, when the second claim uses the definite article "the" to refer to that limitation (for example, "the widget"), this does not imply that the first claim includes only one of the features, nor does it imply that the second claim includes only one of the features (for example, "the widget" can include both one widget and two or more widgets).

[0157] When an ordinal number (such as "first", "second", "third", etc.) is used as an adjective before a term, that ordinal number is used (unless otherwise explicitly specified) simply to indicate a particular feature, such as to distinguish a particular feature from another feature described by the same or a similar term. For example, a "first widget" may have such a name simply to distinguish it from, for example, a "second widget". Thus, simply using the ordinal numbers "first" and "second" before the term "widget" does not indicate any other relationship between the two widgets, nor does it indicate any other characteristics of either or both of the widgets. For example, simply using the ordinal numbers "first" and "second" before the term "widget" does not (1) indicate that the order or location of either widget comes before or after any other widget, (2) indicate that either widget occurs or operates either temporally before or after any other widget, and (3) indicate that either widget is ranked above or below any other widget in terms of importance or quality. In addition, the mere use of an ordinal number does not define a numerical limitation on the feature identified by the ordinal number. For example, the mere use of the ordinal numbers "first" and "second" before the term "widget" does not indicate that there must be two or fewer widgets.

[0158] When a single device, article, or other product is described herein, alternatively, two or more devices / articles (regardless of whether they cooperate) may be used instead of the single device / article described. Thus, the functions described as being possessed by a device may alternatively be possessed by two or more devices / articles (regardless of whether they cooperate).

[0159] Similarly, if two or more devices, articles, or other products are described herein (regardless of whether they cooperate), alternatively, a single device / article may be used in place of the two or more devices or articles described. For example, multiple computer-based devices may be replaced by a single computer-based device. Accordingly, the various functions described as being processed by two or more devices or articles may alternatively be owned by a single device / article.

[0160] The functions and / or features of the single device described may alternatively be implemented by one or more other devices that are described but not explicitly described as having such functions / features. Accordingly, other embodiments need not include the device itself that is described; rather, these other embodiments may include one or more other devices having such functions / features.

[0161] V. The disclosed examples and terms are non-limiting Neither the title (set forth at the beginning of the first page of this specification) nor the abstract (set forth at the end of this specification) should be construed as limiting the scope of one or more of the inventions disclosed, nor should they be used in construing the meaning of any claim or in limiting the scope of any claim. The abstract is included in this specification only for the reason that it is required under 37 C.F.R. 1.72(b).

[0162] The title of the invention of this application and the headings of the sections provided in this application are for convenience only and should never be construed as limiting the present disclosure.

[0163] Numerous embodiments are described in this application and presented for illustrative purposes only. The described embodiments are in no way limiting and not intended to be limiting. One or more inventions disclosed herein are widely applicable to numerous embodiments, as will be readily apparent from this disclosure. Those skilled in the art will recognize that various modifications and changes, such as structural, logical, software, and electrical modifications, may be made to implement one or more of the disclosed inventions. Specific features of one or more of the disclosed inventions may be described with reference to one or more specific embodiments and / or drawings, but it should be understood that such features are not limited to their usage within the one or more specific embodiments or drawings to which they are referred, absent a separate explicit stipulation.

[0164] One embodiment may be disclosed as including several features, but other embodiments of the invention may include fewer features than all such features. Thus, for example, one claim may relate to fewer features than the overall set of features in the disclosed embodiment, and such a claim shall not include features other than those explicitly recited in the claim.

[0165] Embodiments of method steps or product elements described in this application do not constitute the invention claimed herein, are not essential for the invention claimed herein, or do not have the same scope as the invention claimed herein, except as explicitly described as such herein or as explicitly recited within the scope of the claims.

[0166] The preambles of the following claims merely state the objectives, advantages, and possible uses of the claimed invention and do not limit the claimed invention.

[0167] This disclosure is not an exact description, word for word, of all embodiments of one or more of the inventions. Nor is this disclosure an enumeration of features of one or more of the inventions that must be present in all embodiments.

[0168] Not all disclosed embodiments are necessarily covered by the claims (including all claims that have been filed, amended, published, and cancelled). Additionally, an embodiment may be covered by some of the claims (but not necessarily). Thus, the fact that one claim (regardless of filing, amendment, publication, or cancellation) relates to a particular embodiment is not evidence that the scope of other claims also relates to that embodiment.

[0169] Devices described as communicating with each other need not necessarily communicate continuously with each other, absent a separate express stipulation. Conversely, such devices need only transmit to each other as necessary or desired, and in fact may not exchange data most of the time. For example, a machine communicating with another machine over the Internet may not transmit data to the other machine for an extended period (e.g., several weeks at a time). In addition to this, devices communicating with each other may communicate directly or indirectly through one or more intermediaries.

[0170] The description of an embodiment having several components or features does not imply that all or any of such components / features are required. Conversely, various optional components are described to show one or more possible embodiments of the broad scope of the present invention. Absent a separate express stipulation, components / features are not essential or required.

[0171] Process steps, algorithms, etc. may be described or claimed in a particular sequential order, but such processes can be configured to operate in a different order. In other words, any order or sequence of steps that may be explicitly described or claimed does not necessarily indicate a requirement to perform the steps in that order. The steps of the processes described herein can be performed in any order possible. Further, even though some steps are not described or implied as being performed simultaneously (for example, because one step is described after another step), some steps may be performed simultaneously. Additionally, the illustration of a process in the drawings does not imply that the illustrated process excludes other variations and modifications, does not imply that any of the illustrated processes or steps thereof are necessary for one or more of the present inventions, and does not exemplify that the illustrated process is preferred.

[0172] A process may be described as including a plurality of steps, but this does not imply that all or any of the steps are preferred, essential, or required. A variety of other embodiments within the scope of one or more of the present inventions include other processes that omit some or all of the described steps. Unless otherwise specifically stated, no step is important or necessary.

[0173] A process may be described alone, i.e., without reference to other products or methods, but in one embodiment, the process may interact with other products or methods. For example, such interaction may include linking one business model to another business model. Such interaction can be provided to improve the flexibility or desirability of the process.

[0174] The product may be described as including a plurality of components, aspects, quantities, characteristics, and / or features, but this does not indicate that some or a plurality of these are preferred, essential, or required. Other various embodiments within the scope of one or more of the present invention described include other products that omit some or all of the plurality described.

[0175] An enumerated list of items (whether numbered or not) does not imply that any or all of the items are mutually exclusive unless otherwise explicitly specified. Similarly, an enumerated list of items (whether numbered or not) does not imply that any or all of the items subsume any category unless otherwise explicitly specified. For example, the enumerated list "computer, laptop, PDA" does not imply that any or all of the three items in the list are mutually exclusive, nor does it imply that any or all of the three items in the list subsume any category.

[0176] An enumerated list of items (whether numbered or not) does not imply that any or all of the items are equivalent to each other or are easily substitutable for each other.

[0177] All embodiments are illustrative and, in some cases, do not imply that the present invention or any embodiment has been made or implemented.

[0178] VI. Computing Those skilled in the art will readily understand that the various processes described herein may be implemented, for example, by a general-purpose computer, a dedicated computer, and a computing device appropriately programmed. Generally, a processor (e.g., one or more microprocessors, one or more microcontrollers, one or more digital signal processors) receives instructions (e.g., from a memory or a similar device), executes those instructions, thereby executing one or more processes defined by the instructions. The instructions can be implemented, for example, by one or more computer programs, one or more scripts.

[0179] "Processor" means one or more microprocessors, a central processing unit (CPU), a computing device, a microcontroller, a digital signal processor, a similar device, or any combination thereof, regardless of architecture (e.g., chip-level multiprocessing / multicore, RISC, CISC, a microprocessor without interlocked pipeline stages, pipeline configuration, simultaneous multithreading).

[0180] Therefore, the description of a process is likewise a description of an apparatus for implementing the process. The apparatus for implementing the process can include, for example, a processor and input / output devices suitable for implementing the process.

[0181] Furthermore, a program (as well as other types of data) for implementing such a method can be stored and transmitted in several ways using various media (e.g., computer-readable media). Depending on the embodiment, instead of or in combination with some or all of the software instructions capable of implementing the processes of the various embodiments, hardwired circuitry or custom hardware may be used. Therefore, various combinations of hardware and software may be used instead of software alone.

[0182] The term "computer-readable medium" refers to any medium, multiple identical media, or combination of different media that participates in providing data (e.g., instructions, data structures) that can be read by a computer, processor, or similar device. Such media can take many forms including, but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical disks, magnetic disks, and other permanent memories. Volatile media typically includes dynamic random access memory (DRAM) that constitutes main memory. Transmission media includes coaxial cables, copper wire, and fiber optics, including the wires that make up the system bus coupled to a processor. Transmission media can include or can transmit electromagnetic emissions such as those generated during acoustic, optical, and radio frequency (RF) and infrared (IR) data communications. Common forms of computer-readable media include, for example, floppy disks, flexible disks, hard disks, magnetic tape, any other magnetic media, CD-ROM, DVD, any other optical media, punch cards, paper tape, any other physical media with patterned holes, RAM, PROM, EPROM, flash EEPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other media readable by a computer.

[0183] Various forms of computer-readable media can participate in carrying data (e.g., instruction sequences) to a processor. For example, the data can be (i) sent from RAM to the processor, (ii) carried via a wireless transmission medium, (iii) formatted and / or transmitted according to many forms, standards, or protocols such as Ethernet (registered trademark) (or IEEE802.3), SAP, ATP, Bluetooth (registered trademark), and TCP / IP, TDMA, CDMA, and 3G, and / or (iv) encrypted in any of a variety of ways well known in the art to secure privacy and prevent unauthorized access.

[0184] Accordingly, the description of the process is equally a description of a computer-readable medium storing a program for implementing the process. The computer-readable medium can store program elements suitable for the implementation of the method (in any suitable form).

[0185] Similar to how the description of the various steps of a process does not indicate that all of the steps described are required, an embodiment of an apparatus includes a computer / computing device operable to perform some (but not necessarily all) of the processes described.

[0186] Similarly, similar to how the description of the various steps of a process does not indicate that all of the steps described are required, an embodiment of a computer-readable medium storing a program or data structure includes a computer-readable medium storing a program that, when executed, can cause a processor to perform some (but not necessarily all) of the processes described.

[0187] When a database is described, one of ordinary skill in the art will understand that (i) alternative database structures to the described structure can be readily utilized, and (ii) other memory structures besides databases can also be readily utilized. Any illustration or description of any database sample presented herein is an exemplary configuration of the stored information representation. For example, any number of other configurations other than those suggested by the tables shown in the drawings or elsewhere may be utilized. Similarly, one of ordinary skill in the art will understand that any of the illustrated entries of the database are merely illustrative of the information, and the number and content of the entries may differ from those described herein. Further, notwithstanding any description of the database as a table, other forms (including relational databases, object-based models, and / or distributed databases) may be used to store and manipulate the data types described herein. Similarly, the methods or behaviors of the objects of the database can be used to implement various processes as described herein. In addition, the database can be stored in a known manner locally or remotely to the device or to the device accessing the data within such a database.

[0188] Various embodiments can be configured to operate in a network environment that includes a computer communicating with one or more devices (e.g., via a communication network). The computer can communicate directly or indirectly with the devices via wired or wireless media (e.g., the Internet, a LAN, a WAN, or Ethernet, Token Ring, telephone lines, cable lines, wireless channels, optical communication lines, commercial online service providers, electronic bulletin board systems, satellite communication links, any combination of the foregoing). Each device can itself include a computer or other computing device configured to communicate with a computer, such as one based on an Intel® Pentium® or Centrino® processor. Any number and type of devices may be in communication with the computer.

[0189] In one embodiment, a server computer or central authority may not be necessary or may be undesirable. For example, in one embodiment, the present invention may be implemented on one or more devices without a central authority. In such an embodiment, any function described herein as being performed by a server computer or data described as being stored on a server computer may be performed or stored on such one or more devices instead of the server computer.

[0190] When a process is described, in one embodiment, the process is capable of operating without any user intervention. In another embodiment, the process includes some human intervention (e.g., steps are performed by or with the assistance of a human).

[0191] VII. Continuation Applications This disclosure provides those skilled in the art with descriptions of some embodiments and / or enabling requirements of the invention. Some of these embodiments and / or aspects of the invention may not be claimed in this application but may still be claimed in one or more continuation applications claiming the benefit of the priority of this application.

[0192] The applicant intends to file additional applications to claim patents for the subject matter disclosed in this application and for which enabling requirements are presented but not claimed.

[0193] VIII. 35 U.S.C. § 112, Paragraph 6 In a claim, a claim limitation that includes the phrase "means for" or the phrase "step for" means that 35 U.S.C. § 112, Paragraph 6 applies to that limitation.

[0194] In a claim, a claim limitation that does not include the phrase "means for" or the phrase "steps for" means that 35 U.S.C. § 112, paragraph 6 does not apply to that limitation, regardless of whether the limitation recites a function without reciting a structure, material, or act for performing that function. For example, in a claim, the mere use of the phrase "steps (singular or plural)" when referring to one or more steps of that claim or another claim does not mean that 35 U.S.C. § 112, paragraph 6 applies to that step (singular or plural).

[0195] With respect to a means or step for performing a particular function in accordance with 35 U.S.C. § 112, paragraph 6, the corresponding structure, material, or act described in the specification, and equivalents thereof, can perform the additional functions, as well as the specified function.

[0196] Computers, processors, computing devices, and like products are structures that can perform a wide variety of functions. Such products can be operable to perform a specified function by executing one or more programs, such as a program stored in a memory device of the product or a memory device accessed by the product. Unless otherwise specifically recited, such programs need not be based on any particular program, such as any particular algorithm, that may be disclosed herein. It is well known to those of ordinary skill in the art that the specified function may be implemented via different algorithms, and that any one of several different algorithms is merely a design choice for performing the specified function.

[0197] Thus, with respect to means or steps for performing a particular function in accordance with 35 U.S.C. § 112, paragraph 6, the structure corresponding to the specified function includes any product programmed to perform the specified function. Such a structure includes a programmed product that performs the function whether such product is programmed with (i) the disclosed algorithm for performing the function, (ii) an algorithm similar to the disclosed algorithm, or (iii) a different algorithm for performing the function.

[0198] If means for performing a function that is a method are described, the structure for performing the method includes a computing device (e.g., a general-purpose computer) programmed and / or configured using appropriate hardware to perform the function.

[0199] Also included is a computing device (e.g., a general-purpose computer) programmed and / or configured using appropriate hardware to perform the function via other algorithms that would be understood by one of ordinary skill in the art to perform the function.

[0200] IX. Disclaimers Many references to particular embodiments do not indicate a disclaimer or denial of additional different embodiments, and similarly, all references to descriptions of embodiments that include a particular feature do not indicate a disclaimer or denial of embodiments that do not include that particular feature. An express disclaimer or denial in this application shall be prefaced by the phrase "does not include" or the phrase "is not capable of being implemented".

[0201] X. Incorporation by Reference All patents, patent applications, or other documents referenced herein are incorporated by reference into this patent application as part of the present disclosure, but only for the purposes of the written description under 35 U.S.C. § 112, first paragraph, and the enablement requirement under 35 U.S.C. § 112, first paragraph, and should never be used to limit, define, or construe any term of this application unless the ordinary meaning could not be ascertained by one of ordinary skill in the art without such incorporation by reference. Thus, one of ordinary skill in the art should never be limited by any of the embodiments provided by reference.

[0202] Incorporation by reference in and of itself does not imply any admission, approval, or acquiescence of any description, opinion, argument, or feature contained in any patent, patent application, or other document incorporated by reference, unless otherwise expressly provided in this patent application.

[0203] XI. Prosecution History In construing this application (including the claims), one of ordinary skill in the art shall refer to the prosecution history of this application, rather than the prosecution history of any other patent or patent application, regardless of whether there are other patent applications considered relevant to this application and regardless of whether there are other patent applications sharing a claim of priority with this application.

[0204] [Appendix 1] accepting bets from a first set of players for a competition that includes a maximum number of rounds by a computing device; for each round, by the computing device, accepting selections of respective winning participants of respective events on which each round is based from the remaining players of the competition; halting acceptance of the selections from the remaining players at some point between the start and end of each respective event; Implementing the consecutive rounds of the competition by determining that the players per hit are one or more players who have correctly selected the winner of each of the respective events, Implementing the consecutive rounds includes continuing to implement the consecutive rounds until at least one of there being no player who has guessed the winner, only one player guessing the winner, and the maximum number of rounds being completed, and excluding players who have not guessed the winner from subsequent rounds of the consecutive rounds. A method including awarding prizes to each of the players who have guessed the winner before the final consecutive round, the one player, and the remaining players after the maximum number of rounds are completed, by the computing device. 〔Appendix 2〕 Accepting bets includes accepting buy-ins to the competition, the method according to Appendix 1. 〔Appendix 3〕 The method according to Appendix 1, including enabling players excluded from a previous round to buy into subsequent rounds by placing another bet. 〔Appendix 4〕 The method according to Appendix 1, including determining the event for each round by selecting a recorded event from a library of recorded events. 〔Appendix 5〕 Selecting a recorded event includes determining the desired difficulty level for each round and selecting a recorded event tagged with that difficulty level, the method according to Appendix 1. 〔Appendix 6〕 Each event includes one race, the method according to Appendix 1. 〔Appendix 7〕 Each event includes a part of a single race, the method according to Appendix 1. 〔Appendix 8〕 Accepting each selection includes pausing the presentation of each event for a period of time so that the player can enter the selection, and stopping acceptance includes resuming the presentation, the method according to Appendix 1. [Appendix 9] Conducting consecutive rounds includes displaying the first part of each event before accepting each selection, the method according to Appendix 1. [Appendix 10] The method according to Appendix 1, including pooling the bets together and awarding a prize from the pool. [Appendix 11] Accepting a buy-in to the competition from each of a plurality of players by a computing device, Determining, for a first player in a first round, a recorded first event stored in an event library and tagged with a difficulty level associated with the first round by the computing device, Determining, for a second player in the first round, a recorded second event stored in the event library and tagged with the difficulty level by the computing device, Presenting, by the computing device, a first part of the first event to the first player and a first part of the second event to the second player, Receiving, by the computing device, a first selection of a winner of the first event from the first player and a second selection of a winner of the second event from the second player, Determining, by the computing device, whether the first player advances to a second round of the competition depending on whether the first selection is correct based on a second part of the first event, and whether the second player advances to the second round of the competition depending on whether the second selection is correct based on a second part of the second event, the method. 〔Appendix 12〕 The method according to Appendix 11, comprising tagging the difficulty level based on the proximity of event supporters at the end of each first part of each event in the event library. 〔Appendix 13〕 The method according to Appendix 11, comprising presenting the second part of the first event to the first player and the second part of the second event to the second player. 〔Appendix 14〕 The method according to Appendix 13, comprising pausing the presentation of each of the first event and the second event between their respective first parts and second parts, and during the pause, requiring the first player to make the first selection and the second player to make the second selection. 〔Appendix 15〕 The method according to Appendix 13, wherein each of the second parts is presented in response to receiving each selection. 〔Appendix 16〕 The method according to Appendix 11, wherein the first and second events each include a horse race. 〔Appendix 17〕 The method according to Appendix 11, comprising concealing the presentation of the first part of the first event and the first part of the second event. 〔Appendix 18〕 The method according to Appendix 17, wherein concealing includes at least one of adjusting the recording, changing the color of the recording, and changing the sound of the recording. 〔Appendix 19〕 The method according to Appendix 11, comprising determining that the first and second players are in the same competition based on when bids are received from each of the first player and the second player such that the players are in the competition in response to submitting bids at similar times. 〔Appendix 20〕 An apparatus, A computing device, and causing the apparatus to accept bets from a first set of players to participate in a competition including a maximum number of rounds; for each round, accepting from the remaining players in the competition each selection of each winning participant of each event on which each round is based; stopping accepting the selections from the remaining players at some point between the start and end of each respective event; determining that one or more winning players are one or more players who correctly selected the winner of each respective event; and by doing so, causing the competition to conduct consecutive rounds, conducting the consecutive rounds includes continuing to conduct the consecutive rounds until at least one of there is no player who guessed the selection of the winner, only one player guessed the selection of the winner, and the maximum number of rounds has been completed; and excluding players who did not guess the selection of the winner from subsequent rounds of the consecutive rounds, causing the consecutive rounds of the competition to be conducted, a non - transitory medium storing a plurality of instructions for causing each of a player who guessed the selection of the winner before the final consecutive round, the one player, and each of the remaining players after the maximum number of rounds has been completed to be awarded a prize, an apparatus comprising. 〔Appendix 21〕 An apparatus, a computing device, and causing the apparatus to accept an entry from each of a plurality of players into a competition; for a first player in a first round, determining a recorded first event stored in an event library and tagged with a difficulty level associated with the first round; Causing the second player in the first round to determine a recorded second event stored in the event library and tagged with the difficulty level; Presenting the first part of the first event to the first player and the first part of the second event to the second player; Receiving a first selection of the winner of the first event from the first player and a second selection of the winner of the second event from the second player; A non-transitory medium storing a plurality of instructions including determining whether the first player advances to the second round of the competition depending on whether the first selection is correct based on the second part of the first event, and determining whether the second player advances to the second round of the competition depending on whether the second selection is correct based on the second part of the second event; and an apparatus comprising the same.

Claims

1. A database for storing video footage; A network interface; At least one processor; The at least one processor recording a plurality of video images of a plurality of recorded races in said database; playing video footage of a first recorded race of the plurality of recorded races; concealing selected portions of the first recorded race that reveal a likely winner before bets on a winner of the first recorded race are accepted; storing information representative of a plurality of difficulty levels of the first recorded race based at least in part on a time at which bets on the winner were accepted within the first recorded race; accepting, via the network interface, data representing bets on the winner of the first recorded race from a first set of remote mobile devices; and blocking the acceptance of further data representing bets on a winner of the first recorded race at a time before an actual winner of the first recorded race is revealed; the first recorded race has finished before bets on the winner of the first recorded race are accepted; Device.

2. The apparatus of claim 1, wherein the selected portion is hidden from all of the first set of remote mobile devices.

3. A method for recording, by at least one processor, a plurality of video images of a plurality of recorded races in a database; playing, by the at least one processor, video footage of a first recorded race of the plurality of recorded races; concealing, by the at least one processor, selected portions of the first recorded race that reveal a likely winner before bets are accepted on a winner of the first recorded race; storing, by the at least one processor, information representative of a plurality of difficulty levels of the first recorded race based at least in part on a time when bets on the winner were accepted within the first recorded race; accepting, by the at least one processor, via a network interface, data representing bets on the winner of the first recorded race from a first set of remote mobile devices; and blocking, by the at least one processor, the acceptance of further data representing bets on a winner of the first recorded race at a time before an actual winner of the first recorded race is revealed; the first recorded race has finished before bets on the winner of the first recorded race are accepted; method.

4. The method of claim 3, wherein the selected portion is hidden from all of the first set of remote mobile devices.

5. A non-transitory computer-readable medium storing a plurality of executable instructions, wherein execution of the plurality of executable instructions by at least one processor comprises: recording a plurality of video images of a plurality of recorded races in a database; playing video footage of a first recorded race of the plurality of recorded races; concealing selected portions of the first recorded race that reveal a likely winner before bets on a winner of the first recorded race are accepted; storing information representative of a plurality of difficulty levels of the first recorded race based at least in part on a time at which bets on the winner were accepted within the first recorded race; accepting, via a network interface, data representing bets on the winner of the first recorded race from a first set of remote mobile devices; blocking the acceptance of further data representing bets on a winner of the first recorded race at some point before an actual winner of the first recorded race is revealed; the first recorded race has finished before bets on the winner of the first recorded race are accepted; Non-transitory computer-readable medium.

6. The non-transitory computer-readable medium of claim 5, wherein the selected portion is hidden from all of the first set of remote mobile devices.

Citation Information

Patent Citations

  • Video game device

    JP1981139780A

  • Race game method

    JP1998216355A

  • Service providing method

    JP2001357166A

  • Race information providing system

    JP2005293073A

  • Game apparatus

    JP2007044128A

Cited By

  • Multilevel game competition

    JP2025124847A