WO2011088581A1

WO2011088581A1 - Multi player game with connectable outcomes

Info

Publication number: WO2011088581A1
Application number: PCT/CA2011/050042
Authority: WO
Inventors: Francis K. LALUMIÈRE; Serge Roy
Original assignee: INGENIO, Filiale de Loto-Québec Inc.
Priority date: 2010-01-24
Filing date: 2011-01-24
Publication date: 2011-07-28
Also published as: AU2011207089A1; US20120322546A1; CA2786770A1

Abstract

A system for playing a multi-player game is provided. The system has terminals for receiving entry fees from players, a random number generator for generating a player outcome for each player, an outcome controller for assigning each player outcome to a position within a network displayed on a display, and a filter for identifying connected positions. The system also has a comparator for comparing those of the player outcomes assigned to the connected positions and deleting any undesirable one of the compared outcomes, as well as an account controller for providing a payout to players whose outcomes have remained assigned to a position at the end of a play of the game. Also provided are a method for playing the game is also provided and a system for configuring the network of positions.

Description

MULTI PLAYER GAME WITH CONNECTABLE OUTCOMES

TECHNICAL FIELD

The invention relates to the gaming industry. More specifically, it relates to games of chance.

BACKGROUND

Manufacturers in the casino industry are significantly invested in developing profitable games for their clients, but few of their table games find their way onto their clients' floors. Common shortcomings of failed table games include slow pace, complex rules, poor odds, and unattractive payouts. Yet, some games such as Craps have enjoyed commercial success despite having at least some of the listed shortcomings.

The rules and wager schemes of Craps are relatively complicated, and as a result, new players are reluctant to step up to a table and face embarrassment for not knowing the rules or etiquette. Also, the game can be played at a slow pace because the sequences of dice rolls are repeatedly interrupted by wager and payout phases. Such pace harms the game's profitability. Yet, Craps is one of the most well-known casino games, a popularity partly attributed to the manner in which outcomes are determined, namely by having players roll a pair of dice. It is believed that the involvement of the players in determining the outcome is appealing and has enabled the game to overcome its aforementioned shortcomings.

SUMMARY

It is an object of the present invention to provide a system and method for playing a fast-paced multi-player game having simple rules and wager schemes, attractive odds and payouts, and where players are actively involved in determining outcomes.

It is another object of the present invention to provide a system for dynamically configuring a network of positions of a multi-player game in order to maintain player interest despite fluctuations in parameters of the game.

According to a first aspect of the invention, there is provided a system for playing a multi-player game comprising terminals for receiving entry fees from players, a random number generator for generating a player outcome for each one of the players; a display for displaying a network of positions and a payout for each one of the positions, an outcome controller for assigning each one of the player outcomes to an available one of the positions, a filter for identifying connected ones of the positions, a comparator for comparing those of the player outcomes assigned to the connected positions and deleting any undesirable one of the compared outcomes, an account controller for providing a payout to each of the players whose player outcome has remained assigned to one of the positions at the end of a play of the game as a function of the displayed payout.

According to another aspect of the invention, the system further comprises a network generator for determining a total number of the positions and for generating the network having the determined number of positions.

According to yet another aspect of the invention, the system further comprises a player counter for counting a number of the players, wherein the network generator determines the number of positions as a function of the number of the players.

According to yet another aspect of the invention, the number of positions is a difference between the number of the players and a predetermined number.

According to yet another aspect of the invention, the system further comprises a payout controller for calculating a sum of the entry fees, deducting a house cut from the sum to obtain a pool increment, and distributing the pool increment among the positions to obtain the displayed payout before the outcome controller assigns each one of the player outcomes to an available one of the positions.

According to yet another aspect of the invention, the payout controller is for incrementing each one of the displayed payout by a share of the pool increment before the outcome controller assigns each one of the player outcomes to an available one of the positions, and setting provided ones of the displayed payout to zero after the account controller provides a payout to each of the players whose player outcome has remained assigned to one of the positions at the end of the play of the game.

According to yet another aspect of the invention, the filter is for identifying a reference one of the player outcomes assigned to the connected positions and exposed ones of the player outcomes assigned to the connected positions, and the comparator compares each one of the exposed outcomes to the reference outcome and deletes any one of the exposed outcomes that is less desirable than the reference outcome.

According to yet another aspect of the invention, the network is a grid having a top end and a bottom end, the positions are located between the top end and the bottom end, and the filter is for identifying each one of the player outcomes as a reference outcome and for identifying each one of the player outcomes assigned to one of the positions that is closer to a predetermined one of the top end and the bottom end than the position of the reference outcome upon the assignment of the reference outcome as an exposed outcome.

According to yet another aspect of the invention, the random number generator is for generating a house outcome, a farthest one of the positions from the predetermined end is exclusively for receiving the house outcome, the outcome controller is for assigning the house outcome to the farthest position after all of the player outcomes have been assigned, and the filter is for identifying the house outcome as the reference outcome upon the assignment of the house outcome.

According to yet another aspect of the invention, the account controller provides at the end of the play of the game, and to each one of the players for whom an undeleted outcome was generated, one of the payout of one of the positions to which the undeleted outcome is assigned.

According to yet another aspect of the invention, the filter is for identifying those of the player outcomes assigned to those of the positions belonging to a first group and those of the player outcomes assigned to those of the positions belonging to a second group, and the comparator is for comparing those of the player outcomes assigned to the first group positions and those of the player outcomes assigned to the second group positions to identify a less desirable one of the groups, and for deleting those of the player outcomes assigned to the less desirable group.

According to yet another aspect of the invention, the random number generator is for generating a deciding outcome, the comparator is for calculating a sum of those of the outcomes assigned to the first group of positions, a first group outcome, for calculating a sum of those of the player outcomes assigned to the second group of positions, a second group outcome, and for identifying the less desirable one of the groups as a function of the first group outcome, the second group outcome, and the deciding outcome.

According to yet another aspect of the invention, each one of the groups is assigned one of the displayed payout and the account controller is for providing to each one of the players whose player outcome is assigned to a same one of the groups at the end of the play of the game an equal share of the payout assigned to the same group.

According to yet another aspect of the invention, the random number generator is for generating a house outcome for each one of the groups, the outcome controller is for assigning each one of the house outcome to the group for which the one house outcome was generated, and the comparator is for calculating a sum of those of the player outcomes and the house outcome assigned to the first group of positions, the first group outcome, and for calculating a sum of those of the player outcomes and the house outcome assigned to the second group of positions, the second group outcome.

According to yet another aspect of the invention, the terminals are for receiving a selection of the available position for each one of the player outcomes from the one player for whom the one player outcome was generated.

According to yet another aspect of the invention, there is provided a method of playing a multi-player game comprising receiving entry fees from players, generating a player outcome for each one of the players, displaying a network of positions and a payout for each one of the positions, assigning each one of the player outcomes to an available one of the positions, comparing those of the player outcomes assigned to connected ones of the positions, deleting any undesirable one of the compared outcomes, and providing a payout to each one of the players whose player outcome has remained assigned to one of the positions at the end of a play of the game as a function of the displayed payout.

According to yet another aspect of the invention, the method further comprises determining a total number of the positions and generating the network having the determined number of positions.

According to yet another aspect of the invention, the method further comprises counting a number of the players wherein the determining the number of positions is performed as a function of the number of players.

According to yet another aspect of the invention, the determining the number of positions is performed by subtracting a predetermined number from the number of players.

According to yet another aspect of the invention, the method further comprises calculating a product of the entry fees and a number of the players, deducting a house cut from the product to obtain a pool increment, and distributing the pool increment among the displayed positions to obtain the displayed payout before the assigning each one of the player outcomes.

According to yet another aspect of the invention, the method further comprises incrementing each one of the displayed output by a share of the pool increment before the assigning each one of the player outcomes and setting provided ones of the displayed payout to zero after the provision before the providing a payout.

According to yet another aspect of the invention, the method further comprises identifying a reference one of the player outcomes assigned to the connected positions and exposed ones of the player outcomes assigned to the connected positions, the comparing comprises comparing each one of the exposed outcomes to the reference outcome, and the deleting comprises deleting any one of the exposed outcomes that is less desirable than the reference outcome.

According to yet another aspect of the invention, the network is a grid having a top end and a bottom end, the positions are located between the top end and the bottom end, the identifying the reference outcome comprises identifying each one of the player outcomes as the reference outcome, the identifying the exposed outcomes comprises identifying each one of the player outcomes assigned to one of the positions that is closer to a predetermined one of the top end and the bottom end than the position of the reference outcome upon the assignment of the reference outcome as an exposed outcome.

According to yet another aspect of the invention, the method further comprises generating a house outcome and assigning the house outcome to a farthest one of the positions from the predetermined end, wherein the farthest position is exclusively for receiving the house outcome, and the identifying the reference outcome comprises identifying the house outcome as the reference outcome upon the assigning the house outcome.

According to yet another aspect of the invention, the providing a payout comprises providing at the end of the play of the game, and to each one of the players for whom an undeleted outcome was generated, one of the payout of one of the positions to which the undeleted outcome is assigned.

According to yet another aspect of the invention, the method further comprises identifying those of the player outcomes assigned to those of the positions belonging to a first group and those of the player outcomes assigned to those of the positions belonging to a second group, the comparing comprises comparing those of the player outcomes assigned to the first group positions and those of the player outcomes assigned to the second group positions to identify a less desirable one of the groups, and the deleting comprises deleting those of the player outcomes assigned to the less desirable group.

According to yet another aspect of the invention, the method further comprises generating a deciding outcome, wherein the comparing comprises calculating a sum of those of the outcomes assigned to the first group of positions, a first group outcome, calculating a sum of those of the player outcomes assigned to the second group of positions, a second group outcome, comparing the first group outcome and the second group outcome, and identifying the less desirable one of the groups as a function of the first group outcome, the second group outcome, and the deciding outcome. According to yet another aspect of the invention, the method further comprises assigning each one of the groups one of the displayed payout, wherein the providing a payout comprises providing to each one of the players whose player outcome is assigned to a same one of the groups at the end of the play of the game an equal share of the payout assigned to the same group.

According to yet another aspect of the invention, the method further comprises generating a house outcome for each one of the groups, and assigning each one of the house outcome to the group for which the one house outcome was generated, wherein the comparing comprises calculating a sum of those of the player outcomes and the house outcome assigned to the first group of positions, the first group outcome, and for calculating a sum of those of the player outcomes and the house outcome assigned to the second group of positions, the second group outcome.

According to yet another aspect of the invention, the method further comprises receiving a selection of the available position for each one of the player outcomes from one of the players for whom the one player outcome was generated.

According to yet another aspect of the invention, the generating a player outcome is performed by the one player for whom the player outcome is generated.

According to yet another aspect of the invention, the generating a player outcome comprises throwing a pair of dice by the one player for whom the player outcome is generated.

According to yet another aspect of the invention, there is provided a system for configuring a network of positions for playing a multi-player game on a system for playing the multi-player game, the system for playing the multi-player game comprising terminals for receiving entry fees from players, a random number generator for generating a player outcome for each one of the players, a display for displaying the network of positions and a payout for each one of the positions, an outcome controller for assigning each one of the player outcomes to an available one of the positions, a filter for identifying connected ones of the positions, a comparator for comparing those of the player outcomes assigned to the connected positions and deleting any undesirable one of the compared outcomes, and an account controller for providing a payout to each of the players whose player outcome has remained assigned to one of the positions at the end of a play of the game as a function of the displayed payout, the system for configuring the network of positions comprising a network generator for determining a total number of the positions and for generating the network having the determined number of the positions. According to yet another aspect of the invention, the system for configuring the network of positions further comprises a player counter for counting a number of the players, wherein the network generator determines the number of the positions as a function of the counted number of the players.

According to yet another aspect of the invention, the number of the positions determined by the network generator is a difference between the counted number of the players and a predetermined number.

According to yet another aspect of the invention, the network generator is for accessing a look-up table indicating an optimal number of the positions for each one of a plurality of numbers of the players that can be accommodated by a number of the terminals, and the determined number of the positions is one of the optimal number of the positions corresponding to the counted numbers of the players.

It has been discovered that the aforementioned aspects provide for the play of games where each player is involved in determining whether other players earn a payout. This is achieved by generating an outcome for each player, assigning a position to each generated outcome, comparing outcomes assigned to connected positions, and identifying winners according to the comparisons. Positions are connected if, according to the rules of a game, the outcomes that the positions hold are to be compared and the result of the comparison is to dictate the next game-related action to be performed.

It has also been discovered that the aforementioned aspects provide for a dynamic configuration of a network of positions of a multi-player game in order to maintain player interest despite fluctuations in parameters of the game. This is achieved by having a network generator determine a total number of the positions and generate the network having the determined number of the positions.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be better understood by way of the following detailed description of aspects of the invention with reference to the appended drawings, in which:

FIG. 1 is schematic block diagram of a system for playing a first multi-player game having connectable outcomes according to a first aspect of the invention;

FIG. 2 is a schematic block diagram of a system for playing a second multi- player game having connectable outcomes according to a second aspect of the invention; FIG. 3 illustrates a grid of seven positions and payouts assigned to six of the positions for play of the first game;

FIG. 4 illustrates the grid having a first outcome assigned to one of its positions;

FIG. 5 illustrates the grid having a second outcome assigned to one of its positions;

FIG. 6 illustrates the grid having a third outcome assigned to one of its positions and causing the second outcome to be deleted;

FIG. 7 illustrates the grid having a fourth outcome assigned to the position made available by the deletion of the second outcome;

FIG. 8 illustrates the grid having a house outcome assigned to a predetermined position and causing the fourth outcome to be deleted;

FIG. 9 illustrates the grid where unearned payouts have been incremented;

FIG. 10 illustrates three grids of four positions with a payout assigned to each of the grids for play of the second game;

FIG. 1 1 illustrates the three grids having outcomes assigned to most of their positions;

FIG. 12 illustrates the three grids where unearned payouts have been incremented;

FIG. 13 is a flowchart illustrating a method of playing the first game;

FIG. 14 is the continuation of the flowchart of FIG. 13;

FIG. 15 is a flowchart illustrating a method of playing the second game;

FIG. 16 is a continuation of the flowchart of FIG. 15; and

FIG. 17 is a top plan view of a table for playing the first and second games.

DETAILED DESCRIPTION

Various aspects of the invention are described herein below within the context of two games having connectable outcomes. Nonetheless, it should be apparent to a person skilled in the art that the games are only provided for exemplary purposes and the aspects may be applied to other games without departing from the spirit of the invention.

FIG. 17 is a top plan view of a table for playing any of the two games described herein below. The table comprises a center display 1701 for displaying game events, and four terminals 101 positioned on the periphery of the display 1701 for receiving compulsory bets and game-related decisions.

The terminals 101 are detachably mounted on a same platform and positioned in a substantially circular configuration with respect to the display 1701 , also known in the field of gaming as a communal or central panel. Each of the terminals 101 comprises a touch screen, a set of speakers, a currency acceptor, a prepaid casino card reader, a dedicated ticket-in ticket-out printer, as well as a system that enables the interaction of these various components with a player, with each other, and with components of the display 1701 for the purposes of the game.

As for the display 1701 , it comprises a screen, a set of speakers, as well as a system that enables the interaction of these various components with each other and with components of the terminals 101 . Furthermore, the screens of the terminals 101 and display 1701 are mounted in a substantially horizontal manner and those of the terminals 1701 are positioned in proximity of that of the display 1701 such that a player standing in front of any of the terminals 101 may easily shift his attention between the screen of the terminals 101 and that of the display 1701 . The number of the terminals 101 mounted on the platform may be readily modified as a function of parameters such as spatial constraints and operation costs.

Although the terminals 101 have been described as detachably mounted on the platform, they may be fixedly mounted thereon in order, for instance, to reduce costs associated with the manufacture of such an apparatus. Furthermore, although the terminals 101 have been described as positioned in a substantially circular configuration with respect to the display 1701 , they may be positioned otherwise such as in a substantially semicircular configuration with respect to the display 1701 , wherein the display 1701 is vertically mounted to provide all players with an unobstructed view. Moreover, although each of the terminals 101 has been described as comprising a touch screen, it may alternatively comprise an elaborate set of buttons or a screen coupled with a set of buttons. Also, although the display 1701 has been described as comprising a screen, it may alternatively comprise a display surface upon which images are projected. Finally, although the screens of the terminals 101 and display 1701 have been described as mounted in a substantially horizontal manner, they may be mounted otherwise such as in a substantially vertical manner to comply with spatial constraints.

FIG. 1 is a schematic block diagram of a system for playing a first multi-player game having connectable outcomes according to a first aspect of the invention. The system comprises the terminal 101 for accepting an entry request from a player and providing the entry request to an account controller 103. The entry request includes data indicating whether the entry fee is to be paid using an electronic account or any other form of payment. The terminal 101 is also provided the player's credit balance from the account controller 103 for display. If the player pays the entry fee using an electronic account, the provided balance is decremented by a corresponding amount. If the player pays the entry fee using any other option, a temporary, empty balance is provided by the account controller 103. If at the end of a game, the player turns out to be one of the winners, the provided balance is incremented by the corresponding payout. The terminal 101 also retrieves a payout table from a store of payout tables 1 1 1 for display. The retrieved table informs the player of the various payouts that may be earned over the course of a current play of the game. Also, the terminal 101 is provided player outcomes and house outcomes from an outcome controller 1 17 for display. Following the display of a player outcome, the terminal 101 receives the player's approval or rejection of the displayed outcome as well as the player's selection of a position to be assigned to an approved outcome. The decision to approve or reject the outcome and the selected position are provided to the outcome controller 1 17.

The account controller 103 is provided entry requests from the terminal 101 . For entry requests indicating that the entry fee is to be paid using an existing electronic account, the account controller 103 retrieves the player's credit balance from a store of player credits and determines whether the account holds a sufficient number of credits to cover the entry fee. If the account holds a sufficient number of credits, the account controller 103 decrements the balance by the entry fee and provides an approval signal to the terminal 101 and a payout controller 107. The account controller 103 also provides the player's updated credit balance to the terminal 101 for display. However, if the account does not have a sufficient number of credits to cover the entry fee, the account controller 103 provides a signal to the terminal 101 to inform the player that the entry request has been rejected. At the end of the game, the account controller 103 retrieves winning positions from the store of grids 1 13, namely positions that hold player outcomes, retrieves from the store of payout tables 1 1 1 a payout for each of the winning positions, and increments within the store of player credits 105 the credit balance of each player whose player outcome is assigned to one of the winning positions by the corresponding payout. The account controller 103 subsequently provides the updated credit balance to the appropriate terminal 101 for display.

Upon the provision of an approval signal from the account controller 103, the payout controller 107 increments a player counter 109. Once the time for requesting entry has expired, the payout controller 107 retrieves the total number of participating players from the player counter 109, multiplies the number of participating players by the entry fee, removes the house cut from the product to obtain a pool increment, and distributes the pool increment across the payout table according to a predetermined distribution scheme. A network generator 123 determines a number of positions to be included in a grid as a function of the number of participating players and according to a grid generation scheme. The network generator 123 stores the resulting virgin grid in the store of grids 1 13. At the end of the game, the payout controller 107 retrieves winning positions from the store of grids 1 13 and sets to zero those of the payouts stored within the store of payout tables 1 1 1 corresponding to the winning positions. The combination of the payout controller 107 and the network generator 123 may also be referred to as a pool controller.

A random number generator 1 15 is provided standard requests and optional requests from the outcome controller 1 17. In response to a standard request, the random number generator 1 15 generates two random integers, each of which is greater than zero and smaller than seven. In response to an optional request, the random number generator 1 15 generates two random integers, each of which is greater than zero and smaller than seven, and one random integer that is greater than zero and smaller than three. In both cases, the random number generator provides the generated integers to the outcome controller 1 15.

The outcome controller 1 17 is provided the total number of participating players from the player counter 109 to determine the minimal number of outcomes to be generated. If the number is greater than zero, the outcome controller 1 17 provides a standard request to the random number generator 1 15, which in turn provides two random integers. Once the integers are in its possession, the outcome controller 1 17 compares them, multiplies the greater one by ten, adds the product to the smaller integer to obtain a player outcome, and provides the player outcome to the terminal 101 for display. In cases where the integers are of the same value, the outcome controller 1 17 multiplies any one of the integers by eleven to obtain the player outcome. The outcome controller 1 17 subsequently receives from the same terminal 101 the player's approval or rejection of the outcome along with a selected position in cases where the outcome is approved. If the player approves the outcome, the outcome controller 1 17 decrements the total number of participating players stored in the player counter 109 and stores the approved outcome in the selected position within the store of grids 1 13. Otherwise, the outcome controller 1 17 provides an optional request to the random number generator 1 15, which in turn provides the three random integers. Once the integers are in its possession, the outcome controller 1 17 calculates the player outcome and determines whether the third integer is equal to one, in which case it handles the player outcome as if it had been calculated as a function of integers resulting from a standard request. Otherwise, the outcome controller 1 17 decrements the total number of participating players stored in the player counter 109.

Once the total number of participating players stored in the player counter 109 is decremented to zero the outcome controller 1 17 provides a standard request to the random number generator 1 15, which provides two random integers. Once in possession of the integers, the outcome controller 1 17 compares them, multiplies the greater one by ten, adds the product to the smaller one, and records the sum in a last position within the grid stored in the store of grids 1 13 as the house outcome. In cases where the integers are of the same value, the outcome controller 1 17 multiplies any one of the integers by eleven to obtain the house outcome.

A filter 1 19 retrieves each new entry from the store of grids 1 13, namely the reference outcome, and identifies the position assigned to the reference outcome. According to the rules of the game, the position to which a reference outcome is assigned is considered connected to all positions located above it within the grid stored in the store of grids 1 13. Thus, the filter 1 19 retrieves all outcomes assigned to such positions, namely the exposed outcomes, and provides the reference outcome, the exposed outcomes, and the positions of both the reference and exposed outcomes to a comparator 121 . It is important to note that an entry may be either one of a player outcome and a house outcome.

The comparator 121 compares each one of the exposed outcomes to the reference outcome and deletes those of the exposed outcomes that are equal to or smaller than the reference outcome. In the particular case where the reference outcome is the house outcome, all player outcomes stored within the grid stored in the store of grids 1 13 are considered exposed outcomes as the house outcome is stored in the last position within the grid stored in the store of grids 1 13.

FIG. 13 is a flowchart illustrating a method of playing the first game, and FIG. 14, a continuation of FIG. 13. The steps of the method are explained below with reference to FIG. 1 in order to clarify the correspondence between the steps and the components of the system.

In a step 1301 , the table is activated, in response to which all game parameters are initialized and each of the terminals 101 is ready to accept a player's entry request. The table may be activated by operating a manual switch. Alternatively, it may be activated by operating control software connected to the table through a communications network. In the case where the first game is played online, each of the terminals 101 consists in a device that may be connected to a communications network such as a personal computer or a mobile phone, the table is virtual and activated by operating a software administrator interface.

Once the table is activated, and in a step 1303, the entry fees are received from the players. Referring back to FIG. 1 , the step 1303 involves several components of the system, namely the terminal 101 , the account controller 103, and the store of player credits 105. The terminal 101 accepts entry requests from a player and provides the entry requests to an account controller 103. The entry request includes data indicating whether the entry fee is to be paid using an electronic account or any other form of payment, such as entry of bills in the bill acceptor. For entry requests indicating that the entry fee is to be paid using an existing electronic account, the account controller 103 retrieves the player's credit balance from a store of player credits 105 and determines whether the account holds a sufficient number of credits to cover the entry fee. If the account holds a sufficient number of credits, the account controller 103 decrements the balance by the entry fee and provides an approval signal to the terminal 101 and the payout controller 107. The account controller 103 also provides the player's updated credit balance to the terminal 101 for display. However, if the account does not have a sufficient number of credits to cover the entry fee, the account controller 103 provides a signal to the terminal 101 to inform the player that the entry request has been rejected.

In a step 1305, a pool increment is calculated. Referring back to FIG. 1 , the step 1305 involves several components of the system, namely the account controller 103, the player counter 109, and the payout controller 107. Upon the provision of an approval signal from the account controller 103, the payout controller 107 increments a player counter 109. Once the time for requesting entry has expired, the payout controller 107 retrieves the total number of participating players from the player counter 109, multiplies the number of participating players by the entry fee, and removes the house cut from the product to obtain a pool increment. The house cut may be a percentage of the pool, wherein the percentage is predetermined by a game operator according to business and regulatory requirements.

In a step 1307, the number of positions within the grid is determined as a function of the player count and according to a grid generation scheme. Referring back to FIG. 1 , the step 1307 involves several components, namely the network generator 123, the player counter 109, and the store of grids 1 13. The network generator 123 retrieves the total number of participating players from the player counter 109, determines a number of positions to be included in a grid as a function of the number of participating players and according to a grid generation scheme, and stores the resulting virgin grid in the store of grids 1 13. The number of positions may be determined by subtracting a predetermined number from the retrieved number of players. Alternatively, it may be determined by consulting a look-up table that establishes a correspondence between numbers of participating players and grid positions. In another embodiment, it is determined according to a time schedule. In yet another embodiment, it is determined according to whether the game is played in bonus mode.

Once the virgin grid is generated and stored, and in a step 1309, the pool increment is distributed across a payout table according to a distribution scheme. Referring back to FIG. 1 , the step 1309 involves the payout controller 107 and the store of payout tables 1 1 1 . The payout controller 107 increments each payout within the payout table stored in the store of payout tables 1 1 1 by a share of the pool increment according to a distribution scheme, thereby providing for a progressive payout table. Each unearned payout remains within the table and is incremented by the aforementioned share of the pool increment. Each payout within the table is associated to a distinct position within the grid. According to a preferred aspect, each payout benefits from a greater pool increment share than payouts associated to lower grid positions.

In a step 131 1 , the grid and payouts are displayed. Referring back to FIG. 17, the grid and payouts may be displayed on the terminals 101 , on the center screen 1701 , or on both the terminals 101 and the center screen 1701 . Referring now to FIG. 3, there is illustrated a grid of six player positions 301 , 303, 305, 307, 309, and 31 1 , each of which may be assigned a single player outcome, and a house position 313 that may be assigned a single house outcome, as specified by an indicator 327. The player positions 301 , 303, 305, 307, 309, and 31 1 are respectively associated to payouts 315, 317, 319, 321 , 323, and 325.

In a step 1313, a player outcome is generated and displayed. Referring back to FIG. 1 , the step 1313 involves several components of the system, namely the random number generator 1 15, the outcome controller 1 17, the terminal 101 , and the display 1701 . The outcome controller 1 17 provides a standard request to the random number generator 1 15, which in turn provides two random integers. Once the integers are in its possession, the outcome controller 1 17 compares them, multiplies the greater one by ten, adds the product to the smaller integer to obtain a player outcome, and provides the player outcome to the terminal 101 for display on the display 1701 . In cases where the integers are of the same value, the outcome controller 1 17 multiplies any one of the integers by eleven to obtain the player outcome. For instance, if the random number generator 1 15 provides numbers five and two, the greater of the two numbers, five, is multiplied by ten, and the product, fifty, is added to the smaller integer, namely two, to obtain the player outcome fifty-two. In a step 1315, the player's decision is received regarding the displayed player outcome. Referring back to FIG. 1 , the step 1315 involves the terminal 101 , which receives the player's approval or rejection of the displayed outcome as well as the player's selection of a position to be assigned to the accepted outcome. The decision to approve or reject the outcome and the selected position are provided to the outcome controller 1 17.

In a step 1317, it is determined whether the received player decision is an approval or a rejection of the displayed outcome. Referring back to FIG. 1 , the step 1317 is performed by the outcome controller 1 17, which interprets the decision provided by the terminal 101 .

If the received decision is a rejection of the displayed player outcome, and in a step 1319, another player outcome is generated along with an outcome validity indicator. Referring back to FIG. 1 , the step 1319 involves the random number generator 1 15 and the outcome controller 1 17. If the player rejects the player outcome, the outcome controller 1 17 provides an optional request to the random number generator 1 15. In response to the optional request, the random number generator 1 15 provides the three integers to the outcome controller 1 17, which in turn calculates another player outcome from two of the three integers. More specifically, the outcome controller 1 17 compares the two integers, multiplies the greater one by ten, adds the product to the smaller integer to obtain a player outcome, and provides the player outcome to the terminal 101 for display. In cases where the integers are of the same value, the outcome controller 1 17 multiplies any one of the integers by eleven to obtain the player outcome.

In a step 1321 , it is determined whether the new player outcome is valid. Referring back to FIG. 1 , the step 1321 is performed by the outcome controller 1 17, which determines whether the third integer, namely the outcome validity indicator, is equal to one or two. If the outcome validity indicator is equal to one, the player outcome is valid. Otherwise, the player outcome is invalid.

If the player outcome is valid, and in the step 1315, an approval or rejection of the valid outcome is received from the player. However, if the player outcome is invalid, and in a step 1329, the total number of participating players is decremented by one. Referring back to FIG. 1 , the step 1329 is performed by the outcome controller 1 17, which sends a decrement signal to the player counter 109.

Once the total number of participating players is decremented in the step 1329, it is determined whether that number is equal to zero in a step 1331 . Referring back to FIG. 1 , the step 1331 is performed by the outcome controller 1 17, which retrieves the number of participating players from the player counter 109 and determines whether the retrieved number is equal to zero.

If in the step 1331 , it is determined that the number of participating players is not equal to zero, a player outcome is generated for the following player and displayed on the following player's terminal 101 in the step 1313. However, if in the step 1331 , it is determined that the number of participating players is equal to zero, a house outcome is generated and displayed in a step 1401 . Referring back to FIG. 1 , the step 1401 involves the random number generator 1 15, the outcome controller 1 17, and the store of grids 1 13. The outcome controller 1 17 provides a standard request to the random number generator 1 15, which provides two random integers. Once in possession of the integers, the outcome controller 1 17 compares them, multiplies the greater one by ten, adds the product to the smaller one, and assigns the sum, namely the house outcome, to the last position within the grid stored in the store of grids 1 13. In cases where the integers are of the same value, the outcome controller 1 17 multiplies any one of the integers by eleven to obtain the player outcome.

Once the house outcome is generated and stored, and in a step 1403, the house outcome is identified as a reference outcome, and identifies all player outcomes as exposed outcomes. Referring back to FIG. 1 , the step 1403 involves the filter 1 19 and the store of grids 1 13. The filter 1 19 retrieves the house outcome and player outcomes from the store of grids 1 13, identifies the house outcome as the reference outcome, and the player outcomes, as exposed outcomes. The filter 1 19 subsequently provides the reference outcome and exposed outcomes to the comparator 121 .

After the reference and exposed outcomes have been identified, and in a step 1405, each of the exposed outcomes equal or smaller than the reference outcome is deleted. Referring back to FIG. 1 , the step 1405 is performed by the comparator 121 , which compares each exposed outcome to the reference outcome and deletes those of the exposed outcomes that are smaller than or equal to the reference outcome. Referring back to FIG. 8, the comparator 121 compares each of the exposed outcomes to the reference outcome, determines that the player outcomes 401 and 701 are greater than the house outcome 801 , but the player outcome 703 is not. Consequently, the filter 1 19 deletes the player outcome 703. The deletion of a player outcome is also known as the removal of a player outcome from its assigned position within the store of grids 1 13.

In a step 1407, winning positions and players are identified. Referring back to FIG. 1 , the step 1407 involves the store of grids 1 13, the payout controller 107 and the account controller 103. The payout controller 107 retrieves the grid from the store of grids 1 13 to identify those of the grid positions that hold a player outcome, namely the winning positions. Similarly, the account controller 103 retrieves the grid from the store of grids 1 13 to identify the winning positions, and for each of the winning positions, the player to whom the corresponding player outcome belongs, namely the winning player.

In a step 1409, a payout is added to the credit balance of each winning player identified in the step 1407. Referring back to FIG. 1 , the step 1409 involves the payout table 1 1 1 , the account controller 103, and the store of player credits 105. The account controller 103 retrieves from the store of payout tables 1 1 1 a payout associated to each of the winning positions and increments within the store of player credits 105 the balance of the corresponding winning player by the retrieved payout. The account controller 103 subsequently provides the updated credit balance to the appropriate terminal 101 for display.

In a step 141 1 , each payout that was added to a credit balance in the step 1409 is set to zero. Referring back to FIG. 1 , the step 141 1 is performed by the payout controller 107, which identifies for each of the winning positions identified in a step 1407 a payout within the store of payout tables 1 1 1 and sets the identified payout to zero. The step 141 1 signals the end of a play of the game and is followed by the step 1303 according to which entry fees are received for a subsequent play of the game.

However, if it is determined in the step 1317 that the player outcome is approved, and according to a step 1323, the approved outcome is assigned a player-selected grid position, and the grid display is updated accordingly. Referring back to FIG. 1 , the step 1323 involves the terminal 101 , the outcome controller 1 17, and the store of grids 1 13. The terminal 101 receives the player- selected position and provides it to the outcome controller 1 17, which in turn verifies whether the selected position is available. A player position is considered available if it holds no player outcome or if it holds a player outcome of equal value. In the particular case where all player positions hold player outcomes, any player position holding a smaller player outcome is considered available. If it is available, the outcome controller 1 17 assigns the player outcome to the player-selected position within the store of grids 1 13 and the grid displayed on the center screen 1701 is updated accordingly. If the player- selected position is not available, the outcome controller 1 17 will provide an error signal to the terminal 101 for display. Referring to FIG. 4, there is illustrated the player outcome 401 of value fifty-four, generated for and approved by Player A, and assigned by Player A to the grid position 305.

Once the approved outcome is assigned the player-selected position in the step 1317, the player outcome is identified as a reference outcome and all player outcomes that were previously assigned to higher positions within the grid are identified as exposed outcomes in a step 1325. Referring back to FIG. 1 , the step 1325 involves the filter 1 19 and the store of grids 1 13. The filter 1 19 retrieves the new entry from the store of grids 1 13, identifies the new entry as the reference outcome, and identifies the position assigned to the reference outcome. According to the rules of the game, the position in which a reference outcome is recorded is considered connected to all position located above it within the store of grids 1 13. Thus, the filter 1 19 retrieves all player outcomes recorded in such positions, namely the exposed outcomes, and provides the reference outcome, the exposed outcomes, and the positions of both the reference and exposed outcomes to the comparator 121 .

In a step 1327, those of the exposed outcomes that are equal to or smaller than the reference outcome are deleted. Referring back to FIG. 1 , the step 1327 involves the comparator 121 and the store of grids 1 13. The comparator 121 compares each exposed outcome to the reference outcome and eliminates those of the exposed outcomes that are equal to or smaller than the reference outcome from their assigned positions within the grid stored in the store of grids 1 13. Once all exposed outcomes of smaller or equal value are deleted, and in a step 1329, the total number of participating players is decremented.

Referring now to FIG. 4, there is illustrated the player outcome 401 of value fifty-four, generated for and approved by Player A, and assigned by Player A to the grid position 305. Upon being assigned its position 305, the player outcome 401 is identified as a reference outcome. Two positions are higher than the position 305, namely the positions 301 and 303, but none of them holds a player outcome. As a result, the assignment of the outcome 401 to the grid position 305 does not cause any of the other player outcomes to be deleted.

Referring now to FIG. 5, there is illustrated a second outcome 501 of value sixty-two, generated for and approved by Player C, and assigned by Player C to the position 301 . Upon being assigned a position, the outcome 501 is identified as a reference outcome. However, since the position 301 is the highest one in the grid, no player outcome can be identified as an exposed outcome. As a result, the assignment of the outcome 501 to the position 301 does not cause any player outcome to be deleted.

Referring now to FIG. 6, there is illustrated the grid having a third outcome 601 of value sixty-five, generated for and approved by Player D, and assigned by Player D to the position 303. Upon being assigned its position, the outcome 601 is identified as a reference outcome. There is only one position higher than the position 303, namely the position 301 , which holds the player outcome 501 . Consequently, the player outcome 501 is identified as an exposed outcome. Since the reference outcome is of greater value than the exposed outcome, the player outcome 501 is deleted, and the position 301 becomes available to receive any subsequently generated player outcome.

Referring now to FIG. 7, there is illustrated the grid having a third outcome 701 of value forty-two, generated for and approved by Player E, and assigned by Player E to the position 301 . Upon being assigned its position, the outcome 701 is identified as a reference outcome. There are no positions higher than the position 301 and therefore, no player outcome is identified as an exposed outcome.

Referring now to FIG. 8, there is illustrated the grid having a house outcome 801 of value 44 recorded in its predetermined position 313 and three player outcomes 401 , 701 , and 703 of values fifty-four, sixty-five, and forty-two assigned to the positions 305, 303, and 301 . The filter 1 19 identifies the house outcome 801 as the reference outcome, the player outcomes 401 , 701 , and 703 as the exposed outcomes, and provides the reference and exposed outcomes to the comparator 121 .

Referring now to FIG. 9, there is illustrated a virgin grid generated for a subsequent play of the game along with corresponding payouts. Since there are two winning positions, namely the positions 303 and 305, the payouts 317 and 319 assigned to the positions 303 and 305 are reset to zero before being incremented by their share of the pool increment. However, since the positions 301 , 307, 309, 31 1 , and 313 are not winning positions, their assigned payouts 315, 321 , 323, 325, and 327 are not reset to zero before being incremented by their share of the pool increment, and as a result, they are advantageous with respect to those of the previous play of the game.

FIG. 2 is schematic block diagram of a system for playing a second multi-player game having connectable outcomes according to a third aspect of the invention. The system comprises the terminal 101 for accepting an entry request from a player and providing the entry request to the account controller 103. The entry request includes data indicating whether the entry fee is to be paid using an electronic account or any other form of payment, such as entry of bills in the bill acceptor. The terminal 101 is also provided the player's credit balance from the account controller 103 for display. If the player pays the entry fee using an electronic account, the provided balance is decremented by a corresponding amount. If the player pays the entry fee using any other option, a temporary, empty balance is provided by the account controller 103. If at the end of a play of the game, the player turns out to be one of the winners, the provided balance is incremented by the corresponding payout. The terminal 101 also retrieves a payout table from the store of payout tables 1 1 1 for display. The retrieved table informs the player of the various payouts that may be earned over the course of a current play of the game. Also, the terminal 101 is provided player outcomes and house outcomes from the outcome controller 1 17 for display. Following the display of a player outcome, the terminal 101 receives the player's selection of a position to be assigned to the player outcome. The selected position is provided to the outcome controller 1 17.

The account controller 103 is provided entry requests from the terminal 101 . For entry requests indicating that the entry fee is to be paid using an existing electronic account, the account controller 103 retrieves the player's credit balance from a store of player credits 105 and determines whether the account holds a sufficient number of credits to cover the entry fee. If the account holds a sufficient number of credits, the account controller 103 decrements the balance by the entry fee and provides an approval signal to the terminal 101 and the payout controller 107. The account controller 103 also provides the player's updated credit balance to the terminal 101 for display. However, if the account does not have a sufficient number of credits to cover the entry fee, a signal is provided to the terminal 101 to inform the player that the entry request has been rejected. At the end of the game, the account controller 103 retrieves winning positions from the store of grids 1 13, namely positions that hold player outcomes, retrieves from the store of payout tables 1 1 1 a payout assigned to the winning grid, namely the grid to which the winning positions belong, and increments within the store of player credits 105 the credit balance of each player whose player outcome is recorded in one of the winning positions by an equal share of the retrieved payout. The account controller 103 subsequently provides the updated credit balance to the appropriate terminal 101 for display.

Upon the provision of an approval signal from the account controller 103, the payout controller 107 increments a player counter 109. Once the time for requesting entry has expired, the payout controller 107 retrieves the total number of participating players from the player counter 109, multiplies the number of participating players by the entry fee, removes the house cut from the product to obtain a pool increment, and distributes the pool increment across the payout table according to a predetermined distribution scheme. The network generator 123 determines a number of grids and a number of positions to be included in each of the grids as a function of the number of participating players and according to a grid generation scheme. The network generator 123 stores the resulting virgin grids in the store of grids 1 13. At the end of the play of the game, the payout controller 107 retrieves winning positions from the store of grids 1 13 and resets the payout assigned to the winning grid to zero within the store of payout tables 1 1 1 . The random number generator 1 15 is provided standard requests from the outcome controller 1 17 and a comparator 121 . In response to a request, the random number generator 1 15 generates two random integers, each of which is greater than zero and smaller than seven and provides the generated numbers to the outcome controller 1 17. The random number generator 1 15 is also provided deciding outcome requests from the comparator 121 , in response to which the random number generator 1 15 provides two random integers, each of which is greater than zero and smaller than seven, to the comparator 121 .

The outcome controller 1 17 retrieves the total number of grids from the store of grids 1 13 and, for each of the grids, provides a request to the random number generator 1 15, which in turn provides two random integers. For each provided pair of integers, the outcome controller 1 17 calculates their sum, namely the house outcome, provides the house outcome to the terminal 101 for display, and stores the house outcome within one of the grids stored in the store of grids 1 13. The outcome controller 1 17 is also provided the total number of participating players from the player counter 109. If the number is greater than zero, the outcome controller 1 17 provides a standard request to the random number generator 1 15, which in turn provides two random integers. Once the integers are in its possession the outcome controller 1 17 calculates their sum, namely the player outcome, and provides the player outcome to the terminal 101 for display. The outcome controller 1 17 subsequently receives the player's selected position for the displayed player outcome, stores the approved outcome in the selected position within the store of grids 1 13 and decrements the player counter 109. If the outcome controller 1 17 receives any pair of integers from the random number generator 1 15 when the player counter 1 19 equals zero, the outcome controller 1 17 calculates their sum, namely the additional house outcome, and stores the house outcome in a dedicated one of the available positions within the store of grids 1 13.

The filter 1 19 retrieves all house outcomes and player outcomes from the store of grids 107 and, for each of the grids, calculates the sum of the house outcome and all player outcomes that have been assigned positions belonging thereto, namely a grid outcome. The filter 1 19 subsequently provides the grid outcomes along with the last stored player outcome to the comparator 121 . The comparator 121 compares all grid outcomes to identify the one having the greatest grid outcome, namely the max grid, and the one having the smallest grid outcome, namely the min grid. If the last player outcome is stored in neither one of the max and min grids, the comparator 121 determines whether the player outcome could have been assigned to an available position belonging to a grid that would have been identified as either one of the min and max grids. If this is not the case, the comparator 121 sends a request to the random number generator 1 15, waits for a new set of grid outcomes from the filter 1 19 and identifies the min and max grids. If the last player outcome is stored in either one of the first max and min grids, or if the min and max grids are identified following a request provided to the random number generator 1 15 by the comparator 121 , the comparator 121 deletes all player and house outcomes stored in positions within the store of grids 1 13 belonging to any grid other than the min and max grids. Afterward, the comparator 121 provides a request for a deciding outcome to the random number generator 1 15 which, in return, provides the two random integers to the comparator 121 . The comparator 121 calculates the sum of the provided integers, namely the deciding outcome, deletes all remaining outcomes from the store of grids 1 13 if the deciding outcome equals seven, deletes all outcomes assigned to positions belonging to the max grid if the deciding outcome is smaller than seven, and deletes all outcomes assigned to positions belonging to the min grid if the deciding outcome is greater than seven.

FIG. 15 is a flowchart illustrating a method of playing the second game, and FIG. 16, a continuation of FIG. 15. The steps of the method are explained below with reference to FIG. 2 in order to clarify the correspondence between the steps and the components of the system.

In a step 1501 , the table is activated, in response to which all game parameters are initialized and each of the terminals 101 is ready to accept a player's entry request. The table may be activated by operating a manual switch. Alternatively, it may be activated by operating control software connected to the table through a communications network. In the case where the second game is played online, each of the terminals 101 consists in a device that may be connected to a communications network such as a personal computer or a mobile phone, the table is virtual and activated by operating a software administrator interface.

Once the table is activated, and in a step 1503, the entry fees are received from the players. Referring back to FIG. 2, the step 1503 involves several components of the system, namely the terminal 101 , the account controller 103, and the store of player credits 105. The terminal 101 accepts entry requests from a player and provides the entry requests to an account controller 103. The entry request includes data indicating whether the entry fee is to be paid using an electronic account or any other form of payment. For entry requests indicating that the entry fee is to be paid using an existing electronic account, the account controller 103 retrieves the player's credit balance from the store of player credits 105 and determines whether the account holds a sufficient number of credits to cover the entry fee. If the account holds a sufficient number of credits, the account controller 103 decrements the balance by the entry fee and provides an approval signal to the terminal 101 and the payout controller 107. The account controller 103 also provides the player's updated credit balance to the terminal 101 for display. However, if the account does not have a sufficient number of credits to cover the entry fee, a signal is provided to the terminal 101 to inform the player that the entry request has been rejected.

In a step 1505, a pool increment is calculated. Referring back to FIG. 2, the step 1505 involves several components of the system, namely the account controller 103 and the payout controller 107. Upon each provision of an approval signal from the account controller 103, the payout controller 107 increments a player counter 109. Once the time for requesting entry has expired, the payout controller 107 retrieves the total number of participating players from the player counter 109, multiplies the number of participating players by the entry fee, and removes the house cut from the product to obtain a pool increment. The house cut may be a percentage of the pool, wherein the percentage is predetermined by a game operator according to business and regulatory requirements.

In a step 1507, the number of grids and positions within the grids are determined as a function of the player count and according to a grid generation scheme. Referring back to FIG. 2, the step 1507 involves several components, namely the network generator 123, the player counter 109, and the store of grids 1 13. The network generator 123 retrieves the total number of participating players from the player counter 109, determines a number of grids and a number of positions per grid as a function of the number of participating players and according to a grid generation scheme, and stores the resulting virgin grids in the store of grids 1 13. The number of positions may be determined by adding a predetermined number from the retrieved number of players, such as one. Alternatively, it may be determined by consulting a look-up table that establishes a correspondence between numbers of participating players and grid positions.

Once the virgin grids are generated and stored, and in a step 1509, the pool increment is distributed across a payout table according to a distribution scheme. Referring back to FIG. 2, the step 1509 involves the payout controller 107 and the store of payout tables 1 1 1 . The payout controller 107 increments each payout within the payout table by a share of the pool increment according to a distribution scheme, thereby providing for a progressive payout table. Each unearned payout remains within the table and is incremented by the aforementioned share of the pool increment. Each payout within the table is associated to a distinct grid. In a step 151 1 , the grids and payouts are displayed. Referring back to FIG. 17, the grid and payouts may be displayed on the terminals 101 , on the center screen 1701 , or on both the terminals 101 and the center screen 1701 . Referring now to FIG. 12, there are illustrated three grids 1001 , 101 1 , and 1021 . The grid 1001 comprises three positions 1005 dedicated to player outcomes and one position 1003 dedicated to a house outcome. Associated to the grid 1001 are a payout indicator 1007 and a grid outcome indicator 1009. The grid 101 1 comprises three positions 1015 dedicated to player outcomes, and one position 1013 dedicated to a house outcome. Associated to the grid 101 1 are a payout indicator 1017 and a grid outcome indicator 1019. The grid 1021 comprises three positions 1025 dedicated to player outcomes and one position 1023 dedicated to a house outcome. Associated to the grid 1021 are a payout indicator 1027 and a grid outcome indicator 1029.

In a step 1513, and for each of the virgin grids, a house outcome is generated and assigned to a dedicated position. Referring back to FIG. 2, the step 1513 involves the store of grids 1 13, the outcome controller 1 17, and the random number generator 1 15. The outcome controller 1 17 retrieves the total number of grids from the store of grids 1 13 and, for each of the grids, provides a request to the random number generator 1 15, which in turn provides two random integers. For each provided pair of integers, the outcome controller 1 17 calculates their sum, namely the house outcome, and stores the house outcome within one of the grids stored in the store of grids 1 13.

In a step 1515, a player outcome is generated and displayed. Referring back to FIG. 2, the step 1515 involves several components of the system, namely the random number generator 1 15, the outcome controller 1 17, and the terminal 101 . The outcome controller 1 17 provides a request to the random number generator 1 15, which in turn provides the two random integers. Once the integers are in its possession, the outcome controller 1 17 adds them to obtain a player outcome and provides the player outcome to the terminal 101 for display. For instance, if the random number generator 1 15 provides numbers five and two, their sum, seven, is the corresponding player outcome.

In a step 1517, the outcome is assigned a player-selected grid position, and the grids display is updated accordingly. Referring back to FIG. 2, the step 1517 involves the terminal 101 , the outcome controller 1 17, and the store of grids 1 13. The terminal 101 receives the player-selected position and provides it to the outcome controller 1 17, which in turn verifies whether the selected position is available. A player position is considered available if it holds no player outcome. If it is available, the outcome controller 1 17 assigns the player outcome to the player-selected position within the store of grids 1 13, and increments the grid outcome of the corresponding grid by the player outcome. The grids displayed on the center screen 1701 are updated accordingly.

In a step 1519, the total number of participating players is decremented by one. Referring back to FIG. 2, the step 1519 is performed by the outcome controller 1 17, which sends a decrement signal to the player counter 109. Subsequently, and in a step 1521 , it is determined whether that number is equal to zero. Referring back to FIG. 2, the step 1521 is performed by the outcome controller 1 17, which retrieves the number of participating players from the player counter 109 and determines whether the retrieved number is equal to zero.

If in the step 1521 , it is determined that the total number of participating players is not equal to zero, a player outcome is generated and displayed in the step 1515. Otherwise, and in a step 1601 , it is determined whether the last player was provided at least one winning option. Referring back to FIG. 2, the step 1601 involves the comparator 121 , which compares all grid outcomes to identify the one having the greatest grid outcome, namely the max grid, and the one having the smallest grid outcome, namely the min grid. If the last player outcome is stored in neither one of the max and min grids, the comparator 121 determines whether the player outcome could have been assigned to an available position belonging to a grid that would have been identified as either one of the min and max grids.

If in the step 1601 , it is determined that the player outcome could not have been assigned to an available position belonging to a grid that would have been identified as either one of the min and max grids, and in a step 1603, a house outcome is generated and assigned to an available player position. Referring back to FIG. 2, the step 1603 involves the comparator 121 , the random number generator 1 15, and the store of grids 1 13. The comparator 121 sends a request to the random number generator 1 15, which generates the pair of integers and provides the pair to the outcome controller 1 17, which in turn generates a house outcome from the pair of integers, stores the house outcome in an available player position within the store of grids 1 13, and updates the grid outcome of the grid to which the house outcome is assigned. The filter 1 19 retrieves the new grid outcomes and provides them to the comparator 121 .

After the house outcome is generated and assigned to an available player position in the step 1603, and in a step 1605, a min grid outcome and a max grid outcome are identified. Referring back to FIG. 2, the step 1605 is performed by the comparator 121 , which compares the grid outcomes provided by the filter 1 19 and identifies the greatest and the smallest grid outcomes. In order to identify the winning grids, and in a step 1607, a deciding outcome is generated. Referring back to FIG. 2, the step 1609 involves the comparator 121 and the random number generator 1 15. The comparator 121 provides a request for a deciding outcome to the random number generator 1 15 which, in return, provides two random integers to the comparator 121 . The comparator 121 calculates the sum of the provided integers, namely the deciding outcome.

In a step 1609, it is determined whether the deciding outcome generated in step 1607 is greater than seven. If the deciding outcome is not greater than seven, and in a step 161 1 , it is determined whether the deciding outcome is smaller than seven. Referring back to FIG. 2, the steps 1609 and 161 1 are performed by the comparator 121 , which determines whether the deciding outcome calculated in the step 1607 is greater than seven, and if not, whether it is smaller than seven.

If it is determined in the step 161 1 that the deciding outcome equals seven, and according to a step 1613, all outcomes stored in the store of grids 1 13 are deleted. Referring back to FIG. 2, the step 1613 is performed by the comparator 121 , which deletes all player outcomes from the store of grids 1 13.

However, if it is determined in the step 161 1 that the deciding outcome is strictly smaller than seven, and in a step 1615, all grids benefitting form the min grid outcome are identified as winning grids and all players whose player outcomes are assigned to positions belonging to the winning grid are identified as winning players. Referring back to FIG. 2, the step 1615 involves the account controller 103, the payout controller 107, and the store of grids 1 13. The account controller 103 identifies the grids that benefit from the min grid outcome as winning grids and all players whose player outcomes are assigned to positions within the winning grids as winning players. Similarly the payout controller 107 identifies the grids that benefit from the min grid outcome as the winning grids.

In a step 1617, the balance of winning players is incremented by an equal share of the payout assigned to their winning grid. Referring back to FIG. 2, the step 1617 involves the account controller 103, the store of payout tables 1 1 1 , and the store of player credits 105. The account controller 103 retrieves from the store of payout tables 1 1 1 a payout assigned to the winning grid, namely the grid to which the winning positions belong, and increments within the store of player credits 105 the credit balance of each player whose player outcome is recorded in one of the winning positions by an equal share of the retrieved payout. The account controller 103 subsequently provides the updated credit balance to the appropriate terminal 101 for display. In a step 1613, the payout of the winning grids is set to zero, the grid outcomes are set to zero, and all player and house outcomes are deleted in preparation for a subsequent play of the game. Referring back to FIG. 2, the step 1613 is performed by the payout controller 107, the comparator 121 , and the outcome controller 1 17. The payout controller 107 identifies for each of the winning grids a payout within the store of payout tables 1 1 1 and sets the identified payout to zero. The comparator 121 deletes all house and player outcomes. The outcome controller 1 17 resets all grid outcomes to zero within the store of grids 1 13. The step 1613 signals the end of a play of the game and is followed by the step 1503 according to which entry fees are received for a subsequent play of the game.

However, if in the step 1609, it is determined that the deciding outcome is greater than seven, and in a step 1619, all grids benefitting from the max grid outcome are identified as the winning grids, and all players whose player outcomes are assigned to positions belonging to the winning grids are identified as winning players. Referring back to FIG. 2, the step 1619 involves the account controller 103, the payout controller 107, and the store of grids 1 13. The account controller 103 identifies the grids that benefit from the max grid outcome as winning grids and all players whose player outcomes are assigned to positions within the winning grids as winning players. Similarly the payout controller 107 identifies the grids that benefit from the max grid outcome as winning grids.

If in the step 1601 , it is determined that the player outcome is or could have been assigned to an available position belonging to a grid that is or would have been identified as either one of the min and max grids, and in the step 1605, a min grid outcome and a max grid outcome are identified.

Referring now to FIG. 1 1 , there are illustrated the three grids 1001 , 101 1 , and 1021 at the end of a play of the game. The grid 1001 is assigned the payout 1007 in the amount of seventy-five dollars. A house outcome of value 3 is assigned to the house position 1003, and player outcomes of value six and eight are assigned to distinct ones of the positions 1005 by players A and F. As a result, the grid outcome 1009 is set to seventeen. The grid 101 1 is assigned the payout 1017 in the amount of fifty dollars. A house outcome of value ten is assigned to the house position 1013, and player outcomes of value nine, twelve, and seven are assigned distinct ones of the player positions 1015 by players C, D, and G. As a result, the grid outcome 1019 is set to thirty-eight. The grid 1021 is assigned the payout 1027 in the amount of twenty-five dollars. A house outcome of value seven is assigned to the house position 1023, and player outcomes of value two, four, and three are assigned to distinct ones of the player positions 1025 by players B, E, and H. As a result, the grid outcome 1029 is set to sixteen. If the deciding outcome is greater than seven, the grid 101 1 , which benefits from the greatest grid outcome, namely the grid outcome 1019, is identified as the winning grid, and players C, D, and G, whose player outcomes are assigned to distinct ones of the positions 1015 of the grid 101 1 are identified as the winning players. Consequently, the credit balance of the players C, D, and G is incremented by an equal share of the payout 1017, which is in the amount of fifty dollars, and the payout 1017 is set to zero.

Referring now to FIG. 12, there are illustrated the grids 1001 , 101 1 , and 1021 generated in a subsequent play of the game. The payout 1017 was set to zero before being incremented by its share of the pool increment. As a result, the payout 1017 is in the amount of fifty dollars. However, since the payouts 1007 and 1027 were not set to zero before being incremented by their share of the pool increment, they compare advantageously with those of the previous play. The payout 1007 is in the amount of one hundred and fifty dollars while the payout 1027 is in the amount of one hundred dollars.

However, if the deciding outcome is smaller than seven, the grid 1021 , which benefits from the smallest grid outcome, namely the grid outcome 1029, is identified as the winning grid, and players B, E, and H, whose player outcomes are assigned to distinct ones of the positions 1025 of the grid 1021 are identified as the winning players. Consequently, the credit balance of the players B, E, and H is incremented by an equal share of the payout 1027, which is in the amount of twenty-five dollars, and the payout 1027 is set to zero.

Finally, if the deciding outcome is equal to seven, none of the grids 1001 , 101 1 , and 1021 are identified as winning grids and none of the payouts are reset to zero. As a result, the payouts 1007, 1017, and 1027 of the current play of the game are incremented by an equal share of the pool increment for the subsequent play of the game, thereby resulting in advantageous payouts.

While the first and second games have been described as providing players with the opportunity of assigning their player outcomes to positions within the grids, the assignment may be performed randomly or in accordance with a predetermined sequence by the outcome controller 1 17.

While the first and second games have been described as involving the customization of the grids as a function of a number of participating players, the number of grids and grid positions may very well be fixed, regardless of the number of participating players.

While the filter 1 19 and the comparator 121 have been described as two separate components for clarity, they may be integrated within a single software or hardware component capable of performing the same functions within the system.

While the first game has been described as connecting a reference outcome to all outcomes assigned to higher positions within the grid, the connections may be established in accordance with other schemes. For instance, in accordance with one aspect of the invention, only outcomes assigned to positions immediately adjacent to that of the reference outcome are connected to the reference outcome. In accordance with another aspect of the invention, the connections are determined randomly by the filter 1 19 after each assignment of a player outcome. In accordance with yet another aspect of the invention, several grids are generated, and a reference outcome is connected to all player outcomes assigned to the same grid.

While the house and player outcomes have been described as calculated by the outcome controller 1 17 as a function of numbers provided by the random number generator 1 15, they may be generated by dice throws, card draws, wheel spins, or any other device suitable for random generation of values. For instance the house and player outcomes may be generated by manually drawing physical cards and having drawn cards read by a scanner connected to the game system. Alternatively, the house and player outcomes may be generated by manually throwing a pair of dice and having a scanner such as an overhead camera read the upper surface of each die.

Also, while the house and player outcomes have been described as calculated by the outcome controller 1 17 as a function of numbers provided by the random number generator 1 15 and according to specific arithmetical operations, they may be calculated using other operations.

While the first and second game have been described as having a progressive payout table, they may have a fixed payout table, namely one where unearned payouts of one play are not kept within the table for subsequent plays of the game. Also, while the distribution of the pool across payout tables has been described as following a predetermined scheme, it may be performed at least partially randomly by the payout controller 107.

While the second game has been described as involving a generation of an additional house value in cases where the last player is not presented with at least one winning option, it may, according to another aspect of the invention, be played without the additional house value. According to yet another aspect, the additional house value is always generated, regardless of the options presented to the last player. While the first game has been described as involving the removal of any exposed outcome that is smaller than the reference outcome, other actions may be performed. For instance, the exposed outcome may be downgraded to a next available position within the grid, if any. According to another aspect, it may be downgraded to a next available position beneath the one to which the reference outcome is assigned. According to yet another aspect, it may be upgraded to a next available position.

While the first and second games have been described as main games, they may be played as auxiliary games where an outcome generated for the purposes of the main game may be recycled in the second game. For instance, a Blackjack hand or a dice throw in Craps can be used to calculate the player's outcome in any of the first and second games. Alternatively, auxiliary games such as side-bets may be readily incorporated in the first and second games. For instance, a side-bet may be placed on the highest player outcome.

While the games have been described as involving fixed entry fees, they may be played with variable entry fees. For instance, according to one aspect, the entry fee may vary according to the desirability of the playing positions, wherein players benefitting from an advantageous position are charged a greater entry fee. According to another aspect, the entry may vary according to the size of the existing pool, wherein players seated at tables benefitting from greater pools are charged greater entry fees. According to yet another aspect, players that join a table or switch seats on a same table are charged a greater entry fee than those that have kept their seat from the previous play of the game.

Claims

What is claimed is:

1 . A system for playing a multi-player game comprising:

terminals for receiving entry fees from players;

a random number generator for generating a player outcome for each one of the players;

a display for displaying a network of positions and a payout for each one of the positions;

an outcome controller for assigning each one of the player outcomes to an available one of the positions;

a filter for identifying connected ones of the positions;

a comparator for comparing those of the player outcomes assigned to the connected positions and deleting any undesirable one of the compared outcomes; and

an account controller for providing a payout to each of the players whose player outcome has remained assigned to one of the positions at the end of a play of the game as a function of the displayed payout.

2. The system of claim 1 further comprising a network generator for determining a total number of the positions and for generating the network having the determined number of positions.

3. The system of claim 2 further comprising a player counter for counting a number of the players, wherein the network generator determines the number of positions as a function of the number of the players.

4. The system of claim 3 wherein the number of positions is a difference between the number of the players and a predetermined number.

5. The system of claims 1 , 2, 3, or 4 further comprising a payout controller for calculating a sum of the entry fees, deducting a house cut from the sum to obtain a pool increment, and distributing the pool increment among the positions to obtain the displayed payout before the outcome controller assigns each one of the player outcomes to an available one of the positions.

6. The system of claim 5 wherein the payout controller is for incrementing each one of the displayed payout by a share of the pool increment before the outcome controller assigns each one of the player outcomes to an available one of the positions, and setting provided ones of the displayed payout to zero after the account controller provides a payout to each of the players whose player outcome has remained assigned to one of the positions at the end of the play of the game.

7. The system of claims 1 , 2, 3, 4, 5, or 6 wherein the filter is for identifying a reference one of the player outcomes assigned to the connected positions and exposed ones of the player outcomes assigned to the connected positions, and the comparator compares each one of the exposed outcomes to the reference outcome and deletes any one of the exposed outcomes that is less desirable than the reference outcome.

8. The system of claim 7 wherein the network is a grid having a top end and a bottom end, the positions are located between the top end and the bottom end, and the filter is for identifying each one of the player outcomes as a reference outcome and for identifying each one of the player outcomes assigned to one of the positions that is closer to a predetermined one of the top end and the bottom end than the position of the reference outcome upon the assignment of the reference outcome as an exposed outcome.

9. The system of claim 8 wherein the random number generator is for generating a house outcome, a farthest one of the positions from the predetermined end is exclusively for receiving the house outcome, the outcome controller is for assigning the house outcome to the farthest position after all of the player outcomes have been assigned, and the filter is for identifying the house outcome as the reference outcome upon the assignment of the house outcome.

10. The system of claims 1 , 2, 3, 4, 5, 6, 7, 8, or 9 wherein the account controller provides at the end of the play of the game, and to each one of the players for whom an undeleted outcome was generated, one of the payout of one of the positions to which the undeleted outcome is assigned.

1 1 . The system of claims 1 , 2, 3, 4, 5, or 6 wherein the filter is for identifying those of the player outcomes assigned to those of the positions belonging to a first group and those of the player outcomes assigned to those of the positions belonging to a second group, and the comparator is for comparing those of the player outcomes assigned to the first group positions and those of the player outcomes assigned to the second group positions to identify a less desirable one of the groups, and for deleting those of the player outcomes assigned to the less desirable group.

12. The system of claim 1 1 wherein the random number generator is for generating a deciding outcome, the comparator is for calculating a sum of those of the outcomes assigned to the first group of positions, a first group outcome, for calculating a sum of those of the player outcomes assigned to the second group of positions, a second group outcome, and for identifying the less desirable one of the groups as a function of the first group outcome, the second group outcome, and the deciding outcome.

13. The system of claim 12 wherein each one of the groups is assigned one of the displayed payout and the account controller is for providing to each one of the players whose player outcome is assigned to a same one of the groups at the end of the play of the game an equal share of the payout assigned to the same group.

14. The system of claims 12 or 13 wherein the random number generator is for generating a house outcome for each one of the groups, the outcome controller is for assigning each one of the house outcome to the group for which the one house outcome was generated, and the comparator is for calculating a sum of those of the player outcomes and the house outcome assigned to the first group of positions, the first group outcome, and for calculating a sum of those of the player outcomes and the house outcome assigned to the second group of positions, the second group outcome.

15. The system of claims 1 , 2, 3, 4, 5, 6, 7, 8, 9, 10, 1 1 , 12, 13, or 14 wherein the terminals are for receiving a selection of the available position for each one of the player outcomes from the one player for whom the one player outcome was generated.

16. A method of playing a multi-player game comprising:

receiving entry fees from players;

generating a player outcome for each one of the players;

displaying a network of positions and a payout for each one of the positions; assigning each one of the player outcomes to an available one of the positions;

comparing those of the player outcomes assigned to connected ones of the positions;

deleting any undesirable one of the compared outcomes; and

providing a payout to each one of the players whose player outcome has remained assigned to one of the positions at the end of a play of the game as a function of the displayed payout.

17. The method of claim 16 further comprising determining a total number of the positions and generating the network having the determined number of positions.

18. The method of claim 17 further comprising counting a number of the players wherein the determining the number of positions is performed as a function of the number of players.

19. The method of claims 16 or 18 wherein the determining the number of positions is performed by subtracting a predetermined number from the number of players.

20. The method of claims 16, 17, 18, or 19 further comprising calculating a product of the entry fees and a number of the players, deducting a house cut from the product to obtain a pool increment, and distributing the pool increment among the displayed positions to obtain the displayed payout before the assigning each one of the player outcomes.

21 . The method of claim 20 further comprising incrementing each one of the displayed output by a share of the pool increment before the assigning each one of the player outcomes and setting provided ones of the displayed payout to zero after the provision before the providing a payout.

22. The method of claim 16, 17, 18, 19, 20, or 21 further comprising identifying a reference one of the player outcomes assigned to the connected positions and exposed ones of the player outcomes assigned to the connected positions, the comparing comprises comparing each one of the exposed outcomes to the reference outcome, and the deleting comprises deleting any one of the exposed outcomes that is less desirable than the reference outcome.

23. The method of claim 22 wherein the network is a grid having a top end and a bottom end, the positions are located between the top end and the bottom end, the identifying the reference outcome comprises identifying each one of the player outcomes as the reference outcome, the identifying the exposed outcomes comprises identifying each one of the player outcomes assigned to one of the positions that is closer to a predetermined one of the top end and the bottom end than the position of the reference outcome upon the assignment of the reference outcome as an exposed outcome.

24. The method of claim 23 further comprising generating a house outcome and assigning the house outcome to a farthest one of the positions from the predetermined end, wherein the farthest position is exclusively for receiving the house outcome, and the identifying the reference outcome comprises identifying the house outcome as the reference outcome upon the assigning the house outcome.

25. The method of claims 15, 16, 17, 18, 19, 20, 21 , 22, 23, or 24 wherein the providing a payout comprises providing at the end of the play of the game, and to each one of the players for whom an undeleted outcome was generated, one of the payout of one of the positions to which the undeleted outcome is assigned.

26. The method of claims 16, 17, 18, 19, 20, 21 , or 22 further comprising identifying those of the player outcomes assigned to those of the positions belonging to a first group and those of the player outcomes assigned to those of the positions belonging to a second group, the comparing comprises comparing those of the player outcomes assigned to the first group positions and those of the player outcomes assigned to the second group positions to identify a less desirable one of the groups, and the deleting comprises deleting those of the player outcomes assigned to the less desirable group.

27. The method of claim 26 further comprising generating a deciding outcome, wherein the comparing comprises calculating a sum of those of the outcomes assigned to the first group of positions, a first group outcome, calculating a sum of those of the player outcomes assigned to the second group of positions, a second group outcome, comparing the first group outcome and the second group outcome, and identifying the less desirable one of the groups as a function of the first group outcome, the second group outcome, and the deciding outcome.

28. The method of claim 27 further comprising assigning each one of the groups one of the displayed payout, wherein the providing a payout comprises providing to each one of the players whose player outcome is assigned to a same one of the groups at the end of the play of the game an equal share of the payout assigned to the same group.

29. The method of claims 27 or 28 further comprising generating a house outcome for each one of the groups, and assigning each one of the house outcome to the group for which the one house outcome was generated, wherein the comparing comprises calculating a sum of those of the player outcomes and the house outcome assigned to the first group of positions, the first group outcome, and for calculating a sum of those of the player outcomes and the house outcome assigned to the second group of positions, the second group outcome.

30. The method of claims 16, 17, 18, 19, 20, 21 , 22, 23, 24, 25, 26, 27, 28, or 29 further comprising receiving a selection of the available position for each one of the player outcomes from one of the players for whom the one player outcome was generated.

31 . The method of claims 16, 17, 18, 19, 20, 21 , 22, 23, 24, 25, 26, 27, 28, 29, or 30 wherein the generating a player outcome is performed by the one player for whom the player outcome is generated.

32. The method of claim 31 wherein the generating a player outcome comprises throwing a pair of dice by the one player for whom the player outcome is generated.

33. A system for configuring a network of positions for playing a multi- player game on a system for playing the multi-player game, the system for playing the multi-player game comprising terminals for receiving entry fees from players, a random number generator for generating a player outcome for each one of the players, a display for displaying the network of positions and a payout for each one of the positions, an outcome controller for assigning each one of the player outcomes to an available one of the positions, a filter for identifying connected ones of the positions, a comparator for comparing those of the player outcomes assigned to the connected positions and deleting any undesirable one of the compared outcomes, and an account controller for providing a payout to each of the players whose player outcome has remained assigned to one of the positions at the end of a play of the game as a function of the displayed payout, the system for configuring the network of positions comprising:

a network generator for determining a total number of the positions and for generating the network having the determined number of the positions.

34. The system for configuring the network of positions of claim 33 further comprising a player counter for counting a number of the players, wherein the network generator determines the number of the positions as a function of the counted number of the players.

35. The system for configuring the network of positions of claim 33 wherein the number of the positions is a difference between the counted number of the players and a predetermined number.

36. The system for configuring the network of positions of claim 34 wherein the network generator is for accessing a look-up table indicating an optimal number of the positions for each one of a plurality of numbers of the players that can be accommodated by a number of the terminals, and the determined number of the positions is one of the optimal number of the positions corresponding to the counted numbers of the players.