SYSTEM FOR MONITORING THE STATE OF BINGO GRIDS
The present invention relates to a system for operating a bingo game. Play cells are organized into a pair of linked M×N grids, where each one of M and N is greater than two. Each one of the play cells bears one of a predetermined set of symbols. At least some of the symbols are selected by a means for randomly selecting different symbols from the set. The symbol selection designates the play cells to be daubed. A predetermined pattern spanning two grids is displayed by a means for displaying the pattern. The pattern is to be formed by combining different sub-patterns formed within each of the linked grids using the daubed play cells.
Latest INGENIO, FILIALE DE LOTO-QUEBEC INC. Patents:
The present invention relates to bingo games. More specifically, it relates to bingo gaming equipment.
BACKGROUND OF THE INVENTIONBingo is a game of chance in which players are required to match numbers drawn by a random number generator to those printed on their respective bingo cards over the course of a bingo session.
The random number generator draws one number at a time, between one and seventy-five, until a player claims to have won, at which point the draw is temporarily interrupted in order for the claim to be verified. Once the verification is complete, the draw resumes, unless the claim is accurate and signals the end of the session in progress, in which case the random number generator is reset for the following session. The random number generator typically consists in a blower, namely a device that produces a current of air within a chamber until a ball contained therein and assigned to a number between one and seventy-five is ejected through a tube. Some of the more recent alternatives consist in computer programs designed to randomly output one number at a time, between one and seventy-five.
Each bingo card comprises at least one grid, namely a grid of five rows and five columns, wherein the centermost one of the twenty-five cells is a free space and each of the remaining ones is assigned a distinct number between one and seventy-five. More specifically, each cell within the first column, namely column B, is assigned a distinct number between one and fifteen, each cell within the second column, namely column I, is assigned a distinct number between sixteen and thirty, each cell within the third column, namely column N, is assigned a distinct number between thirty-one and forty-five, each cell within the fourth column, namely column G, is assigned a distinct number between forty-six and sixty, and each cell within the fifth and last column, namely column O, is assigned a distinct number between sixty-one and seventy-five. A same number can not be assigned to more than one cell within a same grid, but can very well be assigned to more than one cell within a same card.
Over the course of a bingo session, the operator announces eight to twelve distinct patterns of cells and for each of the patterns, a number of draws within which it is to be completed as well as a prize assigned thereto. The patterns are readily identifiable and constrained within the boundaries of a single grid. One such pattern consists in the letter T. Another such pattern consists in the four corners of a same grid.
As numbers are drawn, players daub matching cells on their cards in a race to daub any one of the announced patterns. Every time a player claims to have won the race for one of the patterns within the corresponding number of draws, the random number generator is interrupted and the claimant is invited to present the bingo card to the operator. If the claim is confirmed by the presented card, the claimant is awarded the corresponding prize and the random number generator resumes its operation as the players vie for the remaining patterns.
The distribution of numbers within bingo grids across tagged columns is such that drawn numbers are readily identifiable within a grid, and the visual impact of bingo patterns is such that patterns of daubed numbers are readily identifiable within a grid. As a matter of fact, it has been noted that experienced players can run several simultaneous grids during a same session, and readily identify drawn numbers as well as patterns of daubed numbers within the grids. Conversely, while novice players can readily keep track of the state of a single grid, they are typically overwhelmed when running several grids within a same session. Since a prize is only redeemable by the first player to rightfully claim a winning pattern, as opposed to the first person to have a winning pattern, a novice player can miss patterns that an experienced player would have likely identified.
SUMMARY OF THE INVENTIONAs players grow accustomed to bingo patterns, their interest in the game diminishes. The patterns become repetitive and the monitoring of several grids during a same session becomes effortless. There is therefore a need for a new line of bingo games that offers greater variety to novice and experienced players, and a greater challenge to experienced players, particularly those that run several grids simultaneously during a same session.
At least some novice and experienced players look to increase the odds of winning a prize by purchasing a greater number of grids. There is therefore a need for a system that allows novice and experienced players to track the state of a greater number of grids running simultaneously within a same session, particularly within the context of games wherein the state of a grid or a card is not readily identifiable.
In accordance with one aspect of the invention, there is provided a system for operating a bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising a pair of linked M×N grids of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols, means for randomly selecting different ones of the set of symbols, and means for displaying a predetermined pattern spanning two grids, an objective of the game comprising forming the pattern using the daubed play cells belonging to any one of the pair of linked grids, wherein the daubed play cells used in forming the pattern form a different sub-pattern in each one of the pair of linked grids.
In accordance with another aspect of the invention, there is provided a system for operating a bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising a pair of linked M×N grids of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols, means for randomly selecting different ones of the set of symbols, and means for displaying a predetermined arithmetic function to be satisfied by a first count of each one of the daubed play cells belonging to a first one of the pair of grids, and a second count of each one of the daubed play cells belonging to a second one of the pair of grids according to an objective of the game, wherein the arithmetic function is selected from a group consisting of the first count being a product of the second count and a multiplier, the multiplier being an integer greater than one, and the first count being greater than the second count by a predetermined spread, the spread being greater than zero.
In accordance with another aspect of the invention, there is provided a system for operating a bingo game played by daubing play cells bearing selected ones of a predetermined set of numbers, the system comprising an M×N grid of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of numbers, means for randomly selecting different ones of the set of numbers, and means for displaying a predetermined arithmetic function to be satisfied by a count of each one of the daubed play cells belonging to the grid of play cells and a last selected one of the selected numbers borne by any one of the play cells belonging to the grid of play cells according to an objective of the game.
In accordance with another aspect of the invention, the method of playing a bingo game on an M×N grid of play cells, each of M and N being strictly greater than two, and each one of the play cells bearing one of a predetermined set of symbols, the method comprising providing the grid of play cells, providing a grid of at least three conversion cells, randomly selecting different ones of the set of symbols, play daubing those of the play cells bearing one of the selected symbols, and conversion daubing a predetermined count of different ones of the conversion cells for each one of the daubed play cells satisfying at least one predetermined criterion, an objective of the game comprising daubing each one of the conversion cells.
In accordance with another aspect of the invention, the card for playing a bingo game by daubing play cells bearing selected ones of a predetermined set of symbols, the card comprising one M×N grid of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols, each one of the play cells bearing one of the selected symbols for receiving a play daub, and one grid of at least three tracking cells, each one of the tracking cells for receiving a tracking daub for each one of the daubed play cells satisfying a predetermined criterion, the tracking daubs indicating a count of those of the daubed play cells satisfying the criterion, an objective of the game comprising daubing each one of the tracking cells.
In accordance with another aspect of the invention, there is provided a system for operating a bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising a console for electronically displaying a grid of M×N of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols, a symbol selector for periodically and randomly selecting a different one of the set of symbols, a dauber for daubing each one of the play cells bearing one of the selected symbols, and a random attribute generator for modifying the displayed grid by randomly assigning an attribute designation to at least one of the play cells, the attribute designation designating each one of the play cells having special attributes in meeting an objective of the game.
In accordance with another aspect of the invention, there is provided a system for operating a bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising two different grids of M×N of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols, a symbol selector for periodically and randomly selecting a different one of the set of symbols, a dauber for daubing each one of the play cells bearing one of the selected symbols, a progress tracker for identifying a most desirable one of the two grids as a function of the daubed cells and an objective of the game, the more desirable grid being closer to a game objective, and a feature controller for identifying the most desirable grid.
In accordance with another aspect of the invention, there is provided a system for operating an auxiliary feature of a bingo game, the bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising a pair of linked M×N grids of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols, and means for displaying a predetermined pattern spanning two grids, wherein an incentive prize is awarded upon forming the pattern using the daubed play cells belonging to any one of the pair of linked grids.
In accordance with another aspect of the invention, there is provided a system for operating an auxiliary feature of a bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising a pair of linked M×N grids of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols, and means for displaying a predetermined arithmetic function to be satisfied by a first count of each one of the daubed play cells belonging to a first one of the pair of grids, and a second count of each one of the daubed play cells belonging to a second one of the pair of grids, wherein an incentive prize is awarded upon satisfaction of the arithmetic function.
In accordance with another aspect of the invention, there is provided a system for operating an auxiliary feature of a bingo game played by daubing play cells bearing selected ones of a predetermined set of numbers, the system comprising an M×N grid of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of numbers, and means for displaying a predetermined arithmetic function to be satisfied by a count of each one of the daubed play cells belonging to the grid of play cells and a last selected one of the selected numbers borne by any one of the play cells belonging to the grid of play cells, wherein an incentive prize is awarded upon satisfaction of the arithmetic function.
In accordance with another aspect of the invention, there is provided a method of playing a bingo game having an auxiliary feature on an M×N grid of play cells, each one of M and N being strictly greater than two, and each one of the play cells bearing one of a predetermined set of numbers, the bingo game played by play daubing each one of the play cells bearing a selected one of the set of numbers, the method comprising providing a grid of at least three conversion cells, and conversion daubing a predetermined count of different ones of the conversion cells for each one of the daubed play cells satisfying at least one predetermined criterion, wherein an incentive prize is awarded when each one of the conversion cells is daubed.
In accordance with another aspect of the invention, there is provided a system for operating a bingo game having an auxiliary feature, the bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising a console for electronically displaying a grid of M×N of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols, and a random attribute generator for modifying the displayed grid by randomly assigning an attribute designation to at least one of the play cells, the attribute designation designating each one of the play cells satisfying a predetermined criterion, wherein an incentive prize is awarded when a predetermined count of the daubed play cells satisfy the criterion.
The invention as well as a preferred mode of use, further objectives and advantages thereof, will best be understood by reference to the following detailed description of illustrative embodiments when read in conjunction with the accompanying drawings, wherein:
The present invention will be described more fully hereinafter with reference to the accompanying drawings, in which like numerals refer to like elements throughout.
Principal Bingo Game
The following embodiments relate to systems for operating and methods of playing new bingo games. The objective of bingo games is traditionally established as a function of readily identifiable patterns of cells to be daubed within a same grid, also known as a face, each of which is defined by a predetermined count of cells that clearly distinguish themselves from the others by their positional relationships. One of the most popular patterns consists in five horizontally aligned cells. Another one consists in four corner cells. As players grow accustomed to such patterns, their interest in the game diminishes; the patterns become repetitive and the monitoring of several grids during a same session becomes effortless.
Disclosed herein is a bingo game, the objective of which is defined as a function of a predetermined pattern of cells to be daubed, the pattern extending over more than one of several linked grids and forming different sub-patterns therein. As a result, different contributions are expected from more than one of several linked grids towards the pattern. Within the context of such a game, in order to establish the state of the linked grids, the player must assess the individual contribution of each of the grids towards the pattern, and subsequently determine whether the assessed contributions collectively lead to the desired pattern. As a result, such patterns are not as readily identifiable as their traditional counterparts.
According to one embodiment, the first player that rightfully claims to have daubed four, three, and two corner play cells within three linked grids is awarded a corresponding prize. Referring to
The predetermined pattern is to be formed using daubed play cells, namely play cells bearing selected ones of a predetermined set of symbols such as numbers. Symbols are selected by a means for randomly selecting different ones of the set of symbols, such as computer program implementing a random number generator. Alternatively, and referring to
The play cells for receiving daubs are organized into grids, which can be displayed on electronic consoles that are portable or embedded into play tables. Alternatively, the grids can be printed on bingo cards. Referring to
In order to establish the state of the bingo card 100, the player determines whether at least two corner cells are daubed within the grid 102. In this particular case, only one of the four corner cells are daubed, namely the play cell 112. Since the prize is assigned to the first player that rightfully claims to have daubed four, three, and two corner cells within the grid 102, the grid 104, and the grid 106, and since only one of the four corner cells has been daubed within the grid 102, the player concludes that the objective is yet to be reached within the bingo card 100, regardless of the cells daubed within the grid 104 and grid 106. If not rushed in time, the player can determine whether all corner cells of the grid 104 and grid 106 are daubed to establish the complete state of the card 100 in anticipation of subsequent draws. The player would conclude that two of the four corner cells of the grid 104, namely the cells 114, and three corner cells 116 of the grid 106 are daubed. Furthermore, the player would conclude that daubing an additional corner cell of each one of the grids 102, 104, and 106 would lead to the objective. Conversely, if rushed in time, the player can forego this process in order to determine whether the objective is reached within other active cards before the subsequent draw.
Within the context of the latter embodiment, the contributions expected from the linked grids involve corner cells exclusively. However, according to other embodiments, the contributions involve a greater number of play cells. Such embodiments present distinct challenges with respect to state monitoring as greater contributions are expected from the linked grids.
According to a preferred embodiment, the first player that rightfully claims to have daubed cells forming a pattern in the shape of the letter “Y” within a rightmost one of three linked and horizontally aligned grids, in the shape of the letter “E” within a centermost one of the grids, and in the shape of the letter “S” within a leftmost one of the grids, the combination of which spells the word “YES” within the bingo card on which all three grids are printed, is awarded a corresponding prize. Referring to
Referring to
In order to establish the state of the bingo card 200, the player determines whether cells daubed within the grid 202 form a pattern in the shape of the letter “Y”, and concludes that such a pattern is indeed formed. Subsequently, the player determines whether cells daubed within the grid 204 form a pattern in the shape of the letter “E” and concludes that no such pattern is formed. More specifically, an additional cell, namely a cell 212 bearing the number twenty, needs to be daubed within the grid 202 in order for such a pattern to be formed. Since the objective consists in daubing cells that form a pattern in the shape of the letter “Y” within the grid 202, in the shape of the letter “E” within the grid 204, and in the shape of the letter “S” within the grid 206, the player further concludes that the objective is yet to be reached within the card 200. If not rushed in time, the player can determine whether cells daubed within the grid 206 form a pattern in the shape of the letter “S” to establish the complete state of the card 200 in anticipation of subsequent draws. If the player chooses to do so, the player concludes that such a pattern is indeed formed within the grid 206 and the cell 212 is the only one left in order for the objective to be reached within the card 200. Conversely, if rushed in time, the player can forego this process in order to determine whether the objective is reached within other active cards before the subsequent draw.
Within the context of the latter embodiment, a different and specific contribution is expected from each one of three linked grids. However, according to other embodiments, different contributions are expected from some of linked grids, but no contribution is assigned to a specific one of the grids. Such embodiments present distinct challenges with respect to state monitoring as each one of the contributions can be provided by any one of the linked grids.
According to a preferred embodiment, the first player that rightfully claims to have daubed cells forming a pattern in the shape of the letter “O” within a first of three linked and horizontally aligned grids, and in the shape of the letter “N” within another one of the linked grids, the combination of which spells either one of the words “NO” and “ON” within the bingo card in which the grids are presented, is awarded a corresponding prize. Referring to
In order to establish the state of the bingo card 300, the player determines whether cells daubed within the grid 302 form a pattern in the shape of the letter “O” or the letter “N” and concludes that no such pattern is formed. More specifically, an additional cell bearing the number forty-two needs to be daubed in order for a pattern in the shape of the letter “O” to be formed, and two additional cells, namely the ones bearing the numbers twenty-five and fifty-five, need to be daubed in order for a pattern in the shape of the letter “N” to be formed within the grid 302. Subsequently, the player determines whether cells daubed within the grid 302 form a pattern in the shape of the letter “O” or the letter “N”, and concludes that no such pattern is formed. Since the objective consists in daubing cells that form a pattern in the shape of the letter “O” and another in the shape of the letter “N” within any two of the grid 302, grid 304, and grid 306, the player further concludes that the objective is yet to be reached within the card 300. If not rushed in time, the player can determine whether cells daubed within the grid 306 form a pattern in the shape of the letter “O” or the letter “N” to establish the complete state of the card 300 in anticipation of subsequent draws. The player would conclude that the cells daubed within the grid 306 form a pattern in the shape of the letter “N” and therefore only the cell bearing the number forty-two needs to be daubed in order for the objective to be reached within the card 300. Conversely, if rushed in time, the player can forego this process in order to determine whether the objective is reached within other active cards before the subsequent draw.
If the next number to be drawn is indeed forty-two, the player daubs the corresponding cell, determines whether cells daubed within the grid 302 form a pattern in the shape of the letter “O” or the letter “N”, and concludes that cells daubed within the grid 302 form a pattern in the shape of the letter “O”.
Subsequently, the player determines whether cells daubed within the grid 304 form a pattern in the shape of the letter “O” or the letter “N” and concludes that no such pattern is formed. Finally, the player determines whether cells daubed within the grid 306 form a pattern in the shape of the letter “O” or the letter “N” and concludes that cells daubed within the grid 306 form a pattern in the shape of the letter “N”. Consequently, the player can rightfully claim to have daubed cells forming a pattern in the shape of the letter “O” and another in the shape of the letter “N” within any two of linked grids printed on the card 300.
Referring now to
In a step 700, three linked grids of play cells are provided to a player. The linked grids can be displayed on an electronic console or printed on a bingo card. While the method is described as providing three linked grids to the player, it can provide a different number of linked grids in accordance with rules of the game. More than one set of linked grids can be displayed on an electronic console or printed on a bingo card, in which case those of the grids belonging to a same set are visually distinguished from others. For instance, each set of linked grids can be of a different colour.
In a step 702, a pattern spanning three linked grids is displayed. A pattern is said to span several grids if it extends over several grids. The pattern is displayed on a means for displaying such as an electronic console, an electronic display, or a board on which the bingo operator can draw. Such a display informs the players of the pattern to be formed using daubed cells belonging to a same set of linked grids.
In a step 704, one of a predetermined set of numbers is randomly selected. The number can be automatically selected by a computer program implementing a random number generator or by an operator activating a blower. In embodiments where at least one play cell can bear one of a predetermined set of non-numerical symbols, one of the non-numerical symbols can alternatively be selected in the step 704.
In a step 706, the linked grids are verified to determine whether any of the play cells bear the number selected in the step 704. In embodiments where the grids are printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, and communicating with the means for selecting can automatically search the play cells for the selected number.
If in the step 706, at least one of the play cells is identified as bearing the selected number, and in a step 708, the identified play cell is daubed. In embodiments where the grids are printed on bingo cards, the player can daub the identified cell by applying a dauber over the surface of the bingo card on which the identified cell is printed. The dauber leaves an ink mark on the bingo card distinguishing the identified play cell from those bearing a yet to be selected one of the set of numbers. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to player input to the identified cell for it to be distinguished from those of the cells bearing a yet to be selecting one of the set of numbers.
In a step 710, it is verified whether a predetermined pattern is formed by the daubed play cells belonging of the linked grids. In embodiments where the grids are printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically search the play cells for the predetermined pattern.
If according to the verification performed in the step 710, the daubed play cells of the linked grids form the predetermined pattern, the player holding the linked grids is awarded a payout in a step 712. The payout can be of monetary or non-monetary nature. The prize can be awarded manually, by a representative of the bingo operator, or electronically, by a computer program having access to player accounts and triggered upon completion of the pattern.
Once the payout is awarded, the game ends in a step 714 and all grids become invalid. Alternatively, only the linked grids in which the predetermined pattern was formed become invalid and the other grids remain valid for a subsequent game having a same or different objective. According to yet another embodiment, all grids remain valid for a subsequent game having a different objective.
However, if according to the verification performed in the step 710, the daubed play cells of the linked grids have yet to form the predetermined pattern, a count of number selections is incremented by one in a step 716. The count is updated in order to ensure that the predetermined pattern is formed within a maximum established in accordance with rules of the game. However, according to another embodiment, the rules of the game do not establish such a restriction and no count of number selections is recorded.
In a step 718, it is verified whether the count of number selections has reached the predetermined maximum. The verification can be performed by a representative of the bingo operator or by a computer program communicating with the selection means. If the maximum is reached, the game ends in the step 714. Otherwise, the game resumes with the selection of a new number in the step 704.
Disclosed herein is a bingo game, the objective of which is defined as a function of an arithmetic function to be satisfied by the count of cells daubed within each of several linked grids. The game presents distinct challenges with respect to state monitoring as the contribution of any one of the linked grids can not be assessed independently from those of its brethren. According to a preferred embodiment, the first player that rightfully claims to have a triple-faced bingo card wherein one of the grids has precisely four daubed cells more than the least daubed grid, and another one of the grids has precisely eight daubed cells more than the least daubed grid, is awarded a corresponding prize. Referring to
Referring to
In order to establish the state of the bingo card 800, the player determines the count of cells daubed within each of the grid 802, grid 804, and grid 806. Unlike a readily identifiable pattern, such a number cannot be ascertained from a quick glance at the card 800. Therefore, the player either counts or updates a memorized count of the cells daubed within each of the grids 802, 804, and 806, compares the resulting counts to determine whether the desired arithmetic function is satisfied, and concludes that the objective is yet to be reached within the card 800. Indeed, while the grid 804 has four daubed cells more than the grid 802, the grid 806 has only seven daubed cells more than the grid 802, and therefore, one additional cell needs to be daubed within the grid 806 before the player can rightfully claim to have three linked grids satisfying the desired arithmetic function.
If the next number to be drawn is borne by a cell within the grid 806, and not borne by any of the cells within the grids 802 and 804, the player daubs the corresponding cell, either counts or updates a memorized count of the cells daubed within the grids 802, 804, and 806, compares the resulting counts to determine whether the desired arithmetic function is satisfied, and concludes that the objective is reached within the card 800. Indeed, while the grid 804 has four daubed cells more than the grid 802, the grid 806 has eight daubed cells more than the grid 802.
If however, the next number to be drawn is not exclusively borne by a cell within the grid 806, the player daubs the corresponding cells, if any, either counts or updates a memorized count of the cells daubed within the grids 802 and 804, compares the resulting counts to determine whether the desired arithmetic function is satisfied, and concludes that the objective is yet to be reached within the card 800, regardless of the count of cells daubed within the grid 806. If not rushed in time, the player can determine the count of cells daubed within the grid 806 to assess the complete state of the card 800 in anticipation of subsequent draws. Conversely, if rushed in time, the player can forego this process in order to determine whether the objective is reached within other active cards before the subsequent draw.
It is important to note that within the context of traditional bingo games, a grid either stagnates or progresses towards an objective over the course of a session, whereas in the context of this particular game, a single daub can pull a card away from the objective. For instance, in the case illustrated in
Referring now to
In a step 1100, three linked grids of play cells are provided to a player. The linked grids can be displayed on an electronic console or printed on a bingo card. While the method is described as provided three linked grids to the player, it can provide a different number of linked grids in accordance with rules of the game. More than one set of linked grids can be displayed on an electronic console or printed on a bingo card, in which case those of the grids belonging to a same set are visually distinguished from others. For instance, each set of linked grids can be of a different colour.
In a step 1102, an arithmetic function to be satisfied by a count of the daubed play cells belonging to a first of three linked grids, a count of the daubed play cells belonging to a second of the linked grids, and a count of the daubed play cells belonging to a third of the linked grids is displayed. The function is displayed on a means for displaying such as an electronic console, an electronic display, or a board on which the bingo operator can draw using chalk or a felt-tip pen. Such a display informs the players of the arithmetic function to be satisfied.
In a step 1104, one of a predetermined set of numbers is randomly selected. The number can be automatically selected by a computer program implementing a random number generator or by an operator activating a blower. In embodiments where at least one play cell can bear one of a predetermined set of non-numerical symbols, one of the non-numerical symbols can alternatively be selected in the step 1104.
In a step 1106, the linked grids are verified to determine whether any of the play cells bear the number selected in the step 1104. In embodiments where the grids are printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, and communicating with the means for selecting can automatically search the play cells for the selected number.
If in the step 1106, at least one of the play cells is identified as bearing the selected number, and in a step 1108, the identified play cell is daubed. In embodiments where the grids are printed on bingo cards, the player can daub the identified cell by applying a dauber over the surface of the bingo card on which the identified cell is printed. The dauber leaves an ink mark on the bingo card distinguishing the identified play cell from those bearing a yet to be selected one of the set of numbers. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to play input to the identified cell for it to be distinguished from those of the cells bearing a yet to be selecting one of the set of numbers.
In a step 1110, for each play cell daubed in the step 1108, a corresponding grid count is incremented. A grid count represents a total count of daubed play cells belonging to one of the linked grids. In embodiments where the grids are printed on a bingo card, the grid counts can be calculated by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically increment the grid counts.
In a step 1112, it is verified whether the three grid counts corresponding to the set of linked grids satisfy the arithmetic function. In embodiments where the grids are printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically compare the grid counts according to the predetermined arithmetic function.
If according to the verification performed in the step 1112, the grid counts of the linked grids satisfy the predetermined arithmetic function, the player holding the linked grids is awarded a payout in a step 1114. The payout can be of monetary or non-monetary nature. The prize can be awarded manually, by a representative of the bingo operator, or electronically, by a computer program having access to player accounts and triggered upon satisfaction of the predetermined arithmetic function.
Once the payout is awarded, the game ends in a step 1116 and all grids become invalid. Alternatively, only the linked grids whose grid counts satisfy the predetermined arithmetic function become invalid and the other grids remain valid for a subsequent game having a same or different objective. According to yet another embodiment, all grids remain valid for a subsequent game having a different objective.
However, if according to the verification performed in the step 1112, the grid counts of the linked grids have yet to satisfy the predetermined arithmetic function, a count of number selections is incremented by one in a step 1118. The count is updated in order to ensure that the predetermined arithmetic function is satisfied within a maximum established in accordance with rules of the game. However, according to another embodiment, the rules of the game do not establish such a restriction and no count of number selections is recorded.
In a step 1120, it is verified whether the count of number selections has reached the predetermined maximum. The verification can be performed by a representative of the bingo operator or by a computer program communicating with the selection means. If the maximum is reached, the game ends in the step 1116. Otherwise, the game resumes with the selection of a new number in the step 1104.
Disclosed herein is another novel bingo game, the objective of which is defined as a function of a count of cells to be daubed within a same grid and a last number daubed within the same grid. Within the context of such a game, in order to establish the state of a grid, the player either counts or keeps a count of the number of daubed cells within the grid, and compares the resulting number with the number borne by the last cell daubed within the same grid. Both alternatives are challenging within the context of simultaneously active grids, but for different reasons. The first tries the speed at with which is counted the number of daubed cells within each active grid, and the second, the ability to memorize an evolving count for each active grid.
According to a preferred embodiment, the first player that rightfully claims to have daubed a count of cells equal to the number borne by the last daubed cell over the course of a same session is awarded a corresponding prize. Referring to
Referring now to
In order to establish the state of the grid 1202, the player counts daubed ones of the cells 1204 daubed. Unlike a readily identifiable pattern, such a number cannot be accurately ascertained from a quick glance at the grid 1202. Therefore, the player either counts or updates a memorized count of daubed ones of the cells 1204 daubed. Subsequently, the player compares the resulting count, namely five, with the number borne by the last cell to be daubed, namely twenty-eight, to conclude that the objective is yet to be reached within the grid 1202.
If the next number to be drawn is six, the player daubs the corresponding cell 1206, either counts or increments a memorized count of the cells 1204 daubed, and compares the count, namely six, with the number borne by the last daubed cell 1206, namely six, to conclude that the objective is reached within the grid 1202.
However, if the next number to be drawn is borne by one of the cells 1204 other than the cell 1206, the player daubs the corresponding one of the cells 1204 and counts or increments a memorized count of the cells 1204 daubed. Since the resulting count is greater than six, the cell 1206 can no longer be the sixth cell to be daubed within the grid 1202, and consequently, the objective for this particular grid shifts to the smallest number greater than six and borne by a yet to be daubed cell. For instance, in the particular case illustrated in
Alternatively, if the next number to be drawn is not borne by any of the cells 1204, the player does not daub any of the cells 1204. Since the count of cells 1204 daubed within the grid 1202 remains unchanged and smaller than six, the cell 1206 can still turn out be the sixth cell to be daubed within the grid 1202, and consequently, the objective for this particular grid remains hinged on the number six. Consequently, the player would only count the cells 1204 daubed to identify the number upon which the objective hinges in anticipation of subsequently drawn numbers. If rushed in time, and knowing that the objective has not been reached within the grid 1202, the player can forego this process in order to determine whether the objective is reached within other active grids before the subsequent draw.
While the game has been described as presenting an objective to be reached within an individual grid, it can very well present an objective to be reached within several linked grids, wherein the objective is defined as a function of a total count of cells daubed within the grids and a number borne by the last cell daubed within the linked grids. In this particular embodiment, the player encounters greater difficulty in establishing the state of the grids as the objective can be reached by combining contributions provided by more than one grid.
Referring now to
In a step 1500, a grid of play cells is provided to a player. The grid can be displayed on an electronic console or printed on a bingo card. While the method is described as providing a grid to the player, it can provide a greater number of grids in accordance with rules of the game. More than one grid can be displayed on an electronic console or printed on a bingo card.
In a step 1502, an arithmetic function to be satisfied by a grid count and a number borne by a last daubed cell is displayed. The function is displayed on a means for displaying such as an electronic console, an electronic display, or a board on which the bingo operator can draw using chalk or a felt-tip pen. Such a display informs the players of the arithmetic function to be satisfied.
In a step 1504, one of a predetermined set of numbers is randomly selected. The number can be automatically selected by a computer program implementing a random number generator or by an operator activating a blower. In embodiments where at least one play cell can bear one of a predetermined set of non-numerical symbols, one of the non-numerical symbols can alternatively be selected in the step 1504.
In a step 1506, the grid is verified to determine whether any of the play cells bear the number selected in the step 1504. In embodiments where the grid is printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, and communicating with the means for selecting can automatically search the play cells for the selected number.
If in the step 1506, at least one of the play cells is identified as bearing the selected number, and in a step 1508, the identified play cell is daubed. In embodiments where the grid is printed on a bingo card, the player can daub the identified cell by applying a dauber over the surface of the bingo card on which the identified cell is printed. The dauber leaves an ink mark on the bingo card distinguishing the identified play cell from those bearing a yet to be selected one of the set of numbers. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to play input to the identified cell for it to be distinguished from those of the cells bearing a yet to be selecting one of the set of numbers.
In a step 1510, for each play cell daubed in the step 1508, a corresponding grid count is incremented. A grid count represents a total count of daubed play cells belonging to the grid. In embodiments where the grid is printed on a bingo card, the grid count can be calculated by the player. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically increment the grid count.
In a step 1512, it is verified whether the grid count and the number selected in the step 1504 satisfy the predetermined arithmetic function. In embodiments where the grid is printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically compare the grid count and the number selected in the step 1504 according to the predetermined arithmetic function.
If according to the verification performed in the step 1512, the grid count and the number selected in the step 1504 satisfy the predetermined arithmetic function, the player holding the grid is awarded a payout in a step 1514. The payout can be of monetary or non-monetary nature. The prize can be awarded manually, by a representative of the bingo operator, or electronically, by a computer program having access to player accounts and triggered upon satisfaction of the predetermined arithmetic function.
Once the payout is awarded, the game ends in a step 1516 and all grids become invalid. Alternatively, only the grid whose grid count satisfies the predetermined arithmetic function with the number selected in the step 1504 becomes invalid and the other grids remain valid for a subsequent game having a same or different objective. According to yet another embodiment, all grids remain valid for a subsequent game having a different objective.
However, if according to the verification performed in the step 1512, the grid count has yet to satisfy the predetermined arithmetic function along with the number selected in the step 1504, a count of number selections is incremented by one in a step 1518. The count is updated in order to ensure that the predetermined arithmetic function is satisfied within a maximum established in accordance with rules of the game. However, according to another embodiment, the rules of the game do not establish such a restriction and no count of number selections is recorded.
In a step 1520, it is verified whether the count of number selections has reached the predetermined maximum. The verification can be performed by a representative of the bingo operator or by a computer program communicating with the selection means. If the maximum is reached, the game ends in the step 1516. Otherwise, the game resumes with the selection of a new number in the step 1504.
At least some novice and experienced players look to increase the odds of winning a prize by purchasing a greater number of grids. There is therefore a need for a system that allows novice and experienced players to monitor the state of a greater number of simultaneously active grids, particularly within the context of games such as those described herein above, wherein states are not readily identifiable within cards.
Disclosed herein is a system for recording and displaying values of one or more parameters defining the state of a grid or several linked grids. Herein below, the system is described within the context of a bingo game, the objective of which is defined as a function of a number of daubed cells bearing a same attribute designation, also known as an auxiliary symbol, but can very well be applied within the context of other games.
Referring now to
The attribute designation 408 and attribute designation 410 are displayed within the grids 402, 404, and 406 for the purposes of a particular bingo game, the objective of which consists in being the first to have daubed ten cells bearing a same one of the attribute designation 408 and attribute designation 410 within a same series of linked grids. Within the context of such a game, the parameter values defining the states of the grids 402, 404, and 406 consist in the count of daubed cells bearing the attribute designation 408, and the count of daubed cells bearing the attribute designation 410.
In order to establish the state of the bingo card 400, the player determines the number of daubed cells bearing a same one of the attribute designations 408 and 410 within the grids 402, 404, and 406. Unlike a readily identifiable pattern, such a number cannot be ascertained from a quick glance at the card 400, at least partially because there are two types of attribute designations, namely the attribute designations 408 and 410, and because the attribute designations are randomly scattered across the grids 402, 404, and 406. Therefore, the player either counts or updates memorized counts of daubed cells bearing a same one of the attribute designations 408 and 410 within the grids 402, 404, and 406, and determines whether any of the resulting counts have reached the number ten.
Alternatively, the player can monitor the state of the bingo card 400 by daubing a cell within a corresponding one of the grids 412 and 414 for each cell daubed within one of the grids 402, 404, and 406 bearing one of the attribute designations 408 and 410. For instance, if the number ten is drawn, the player daubs the cell within the grid 402 bearing the number ten and a first cell within the grid 412. Subsequently, the player daubs the cell within the grid 406 bearing the number ten and a second cell within the grid 412.
Not only is the action of daubing cells within the grids 412 and 414 entertaining, but it also enables players to readily monitor within the grids 412 and 414 the number of daubed cells bearing a same one of the attribute designation 408 and attribute designation 410, as well as the count of cells bearing a same one of the attribute designation 408 and attribute designation 410 to be daubed in order for the desired objectives to be reached within the card 400. As a result, in cases where few cells need to be daubed in order for the objective to be reached, the corresponding near win situation is brought to the attention of the player within the grids 412 and 414, thereby increasing interest in subsequent draws in anticipation of an eventual win.
According to one embodiment, the count of cells bearing the attribute designation 408 equals the count of cells of the grid 412, and the count of cells bearing the number 410 equals the count of cells of the grid 414. The objective of the game is defined as a function of a predetermined number of daubed cells within a first predetermined subset of cells, namely those to which the attribute designation 408 is assigned, and as a function of a predetermined number of daubed cells within a second predetermined subset of cells, namely those to which the attribute designation 410 is assigned.
According to another embodiment, the count of cells bearing the attribute designation 408 is greater than the count of cells of the grid 412, and the count of cells bearing the attribute designation 410 is greater than the count of cells of the grid 414. The objective of the game is defined as a function of two predetermined patterns extending over more than one of several linked grids, the first predetermined pattern consisting in cells to which the attribute designation 408 is assigned, and the second predetermined pattern consisting in cells to which the attribute designation 410 is assigned.
According to one embodiment, an equal count of cells bear a same one of the attribute designations 408 and 410. However, according to another embodiment, the count of cells bearing a first one of the attribute designation 408 and 410 is greater than the count of cells bearing the second one of the attribute designations 408 and 410.
According to one embodiment, the grids 412 and 414 include an equal count of cells. However, according to another embodiment, a first one of the grids 412 and 414 includes a greater count of cells than the second one of the grids 412 and 414.
The cells of the grids 412 and 414 have been described as tracking cells, namely ones that provide an indication as to a count of daubed cells endowed with a corresponding one of the symbols 408 and 410. However, according to another embodiment, the cells of the grids 412 and 414 can be used as conversion cells, namely ones that reflect the value of each one of the symbols 408 and 410 with respect to an objective of the game.
According to the embodiments where the cells of the grids 412 and 414 are used as conversion cells instead of tracking cells, the player daubs a first predetermined count of different ones of the cells of the grid 412 for each daubed play cell endowed with the attribute designation 408 according to the rules of the game. Similarly, the player daubs a second predetermined count of different ones of the cells of the grid 414 for each daubed play cell endowed with the attribute designation 410 according to the rules of the game. A first prize is awarded when each one of the cells of the grid 412 is daubed. A second prize is awarded when each one of the cells of the grid 414 is daubed. The first and second predetermined counts are established in accordance with rules of the game, and can be equal or unequal. The first and second prizes are established in accordance with rules of the game and can be equal or unequal. For instance, the first predetermined count can be greater than the second predetermined count, and the second prize can be greater than the first prize.
While the game has been described as involving two types of attribute designations, namely the attribute designations 408 and 410, it can very well involve a single attribute designation or more than two attribute designations. Also, while a single attribute designation, namely the attribute designation 408, is assigned to all cells of the grid 412, and a single attribute designation, namely the attribute designation 410, is assigned to all cells of the grid 414, more than one attribute designation can be assigned to a single cell.
While a same attribute designation, namely the attribute designation 408, is assigned to all cells of the grid 412, and a single attribute designation, namely the attribute designation 410, is assigned to all cells of the grid 414, a different attribute designation can be assigned to at least some of the cells of a same grid. According to one embodiment, a different attribute designation is assigned to at least some of the cells of a same grid, and when the player daubs a grid cell bearing an attribute designation, the player can daub no more than one grid cell, or no more than a predetermined count of cells to which the attribute designation is assigned. According to one embodiment, a different attribute designation is assigned to at least some of the cells of a same grid, and when the player daubs a grid cell bearing an attribute designation, the player can daub all grid cells to which the attribute designation is assigned.
According to one embodiment, a word is selected by the bingo operator, each letter of the word is assigned to a cell of the grid 412 such that the cells of the grid 412 spell the word, and each letter of the alphabet included in the word corresponds to a type of attribute designation borne by cells of the grids 402, 404, and 406. For instance, if the selected word is CHOCOLATE, the grid 412 would include nine cells, one for each letter of the word, and the cells of the grids 402, 404, and 406 would involve seven types of attribute designations, one for each letter of the alphabet included in CHOCOLATE. According to one embodiment, when the player daubs a cell of any one of the grids 402, 404, and 406 bearing the letter C or O, the player can daub only one of the two cells of the grid 412 to which the letter was assigned. However, according to another embodiment, the player can daub both cells of the grid 412 to which the letter is assigned.
The cells of the grids 412 and 414 have been described as tracking cells, namely ones that provide an indication as to a count of daubed cells endowed with a corresponding one of the symbols 408 and 410. However, according to another embodiment, the cells of the grids 412 and 414 can be used as conversion cells, namely ones that reflect the value of each one of the symbols 408 and 410 with respect to an objective of the game.
According to the embodiments where the cells of the grids 412 and 414 are used as conversion cells instead of tracking cells, the player daubs a first predetermined count of different ones of the cells of the grid 412 for each daubed play cell endowed with the attribute designation 408 according to the rules of the game. Similarly, the player daubs a second predetermined count of different ones of the cells of the grid 414 for each daubed play cell endowed with the attribute designation 410 according to the rules of the game. A first prize is awarded when each one of the cells of the grid 412 is daubed. A second prize is awarded when each one of the cells of the grid 414 is daubed. The first and second predetermined counts are established in accordance with rules of the game, and can be equal or unequal. The first and second prizes are established in accordance with rules of the game and can be equal or unequal. For instance, the first predetermined count can be greater than the second predetermined count, and the second prize can be greater than the first prize.
Referring now to
In a step 1700, the grids of play cells and tracking cells are provided to a player. The grids can be displayed on an electronic console or printed on a bingo card. While the method is described as providing one grid of play cells to the player, it can provide a greater number of grids of play cells in accordance with rules of the game. Similarly, while the method is described as providing one grid of tracking cells to the player, it can provide a greater number of grids of tracking cells in accordance with rules of the game. More than one grid of play cells can be displayed on an electronic console or printed on a bingo card. Similarly, more than one grid of play cells can be displayed on an electronic console or printed on a bingo card.
In a step 1702, a pattern spanning three linked grids is displayed. A pattern is said to span several grids if it extends over several grids. The pattern is displayed on a means for displaying such as an electronic console, an electronic display, or a board on which the bingo operator can draw. Such a display informs the players of the pattern to be formed using daubed cells belonging to a same set of linked grids.
In a step 1704, one of a predetermined set of numbers is randomly selected. The number can be automatically selected by a computer program implementing a random number generator or by an operator activating a blower. In embodiments where at least one play cell can bear one of a predetermined set of non-numerical symbols, one of the non-numerical symbols can alternatively be selected in the step 1704.
In a step 1706, the grid is verified to determine whether any of the play cells bear the number selected in the step 1704. In embodiments where the grid is printed on a bingo card, the verification can be performed by the player.
However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, and communicating with the means for selecting can automatically search the play cells for the selected number.
If in the step 1706, at least one of the play cells is identified as bearing the selected number, and in a step 1708, the identified play cell is daubed. In embodiments where the grid is printed on a bingo card, the player can daub the identified cell by applying a dauber over the surface of the bingo card on which the identified cell is printed. The dauber leaves an ink mark on the bingo card distinguishing the identified play cell from those bearing a yet to be selected one of the set of numbers. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to play input to the identified cell for it to be distinguished from those of the cells bearing a yet to be selecting one of the set of numbers.
In a step 1710, for each play cell daubed in the step 1708, it is determined whether the play cell daubed in the step 1708 is endowed with an attribute designation. In embodiments where the grid is printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically perform the verification.
If in the step 1710, the play cell is identified as bearing the attribute designation, and in a step 1712, one of the tracking cells is daubed. In embodiments where the grid is printed on a bingo card, the player can daub a tracking cell by applying a dauber over the surface of the bingo card on which an available one of the tracking cells is printed. The dauber leaves an ink mark on the bingo card distinguishing the tracking cell from those that have yet to be daubed. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to play input to an available tracking cell for it to be distinguished from those of the tracking cells that remain available.
In a step 1714, it is verified whether each one of the tracking cells has been daubed. In embodiments where the grids are printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically search for an available tracking cell.
If according to the verification performed in the step 1714, each one of the tracking cells has been daubed, the player holding the grid is awarded a payout in a step 1716. The payout can be of monetary or non-monetary nature. The prize can be awarded manually, by a representative of the bingo operator, or electronically, by a computer program having access to player accounts and triggered once the last one of the available tracking cells has been daubed.
Once the payout is awarded, the game ends in a step 1718 and all grids of play cells become invalid. Alternatively, only the grid of play cells for which all tracking cells have been daubed becomes invalid, and the other grids remain valid for a subsequent game having a same or different objective. According to yet another embodiment, all grids remain valid for a subsequent game having a different objective.
However, if according to the verification performed in the step 1714, at least one of the tracking cells remains available, a count of number selections is incremented by one in a step 1720. The count is updated in order to ensure that the predetermined arithmetic function is satisfied within a maximum established in accordance with rules of the game. However, according to another embodiment, the rules of the game do not establish such a restriction and no count of number selections is recorded.
In a step 1722, it is verified whether the count of number selections has reached the predetermined maximum. The verification can be performed by a representative of the bingo operator or by a computer program communicating with the selection means. If the maximum is reached, the game ends in the step 1718. Otherwise, the game resumes with the selection of a new number in the step 1704.
Referring now to
In a step 1600, the grids of play cells and conversion cells are provided to a player. The grids can be displayed on an electronic console or printed on a bingo card. While the method is described as providing one grid of play cells to the player, it can provide a greater number of grids of play cells in accordance with rules of the game. Similarly, while the method is described as providing one grid of conversion cells to the player, it can provide a greater number of grids of conversion cells in accordance with rules of the game. More than one grid of play cells can be displayed on an electronic console or printed on a bingo card. Similarly, more than one grid of play cells can be displayed on an electronic console or printed on a bingo card.
In a step 1602, a pattern spanning three linked grids is displayed. A pattern is said to span several grids if it extends over several grids. The pattern is displayed on a means for displaying such as an electronic console, an electronic display, or a board on which the bingo operator can draw. Such a display informs the players of the pattern to be formed using daubed cells belonging to a same set of linked grids.
In a step 1604, one of a predetermined set of numbers is randomly selected. The number can be automatically selected by a computer program implementing a random number generator or by an operator activating a blower. In embodiments where at least one play cell can bear one of a predetermined set of non-numerical symbols, one of the non-numerical symbols can alternatively be selected in the step 1604.
In a step 1606, the grid is verified to determine whether any of the play cells bear the number selected in the step 1604. In embodiments where the grid is printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, and communicating with the means for selecting can automatically search the play cells for the selected number.
If in the step 1606, at least one of the play cells is identified as bearing the selected number, and in a step 1608, the identified play cell is daubed. In embodiments where the grid is printed on a bingo card, the player can daub the identified cell by applying a dauber over the surface of the bingo card on which the identified cell is printed. The dauber leaves an ink mark on the bingo card distinguishing the identified play cell from those bearing a yet to be selected one of the set of numbers. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to play input to the identified cell for it to be distinguished from those of the cells bearing a yet to be selecting one of the set of numbers.
In a step 1610, for each play cell daubed in the step 1608, it is determined whether the play cell daubed in the step 1608 is endowed with an attribute designation. In embodiments where the grid is printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically perform the verification.
If in the step 1610, the play cell is identified as bearing the attribute designation, and in a step 1612, a predetermined count of the conversion cells is daubed. In embodiments where the grid is printed on a bingo card, the player can daub conversion cells by applying a dauber over the surface of the bingo card on which available ones of the conversion cells is printed. The dauber leaves an ink mark on the bingo card distinguishing the conversion cells from those that have yet to be daubed. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to play input to available conversion cells for them to be distinguished from those of the conversion cells that remain available.
In a step 1614, it is verified whether each one of the conversion cells has been daubed. In embodiments where the grids are printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically search for an available conversion cell.
If according to the verification performed in the step 1614, each one of the conversion cells has been daubed, the player holding the grid is awarded a payout in a step 1616. The payout can be of monetary or non-monetary nature. The prize can be awarded manually, by a representative of the bingo operator, or electronically, by a computer program having access to player accounts and triggered once the last one of the available conversion cells has been daubed.
Once the payout is awarded, the game ends in a step 1618 and all grids of play cells become invalid. Alternatively, only the grid of play cells for which all conversion cells have been daubed becomes invalid, and the other grids remain valid for a subsequent game having a same or different objective. According to yet another embodiment, all grids remain valid for a subsequent game having a different objective.
However, if according to the verification performed in the step 1614, at least one of the conversion cells remains available, a count of number selections is incremented by one in a step 1620. The count is updated in order to ensure that the predetermined arithmetic function is satisfied within a maximum established in accordance with rules of the game. However, according to another embodiment, the rules of the game do not establish such a restriction and no count of number selections is recorded.
In a step 1622, it is verified whether the count of number selections has reached the predetermined maximum. The verification can be performed by a representative of the bingo operator or by a computer program communicating with the selection means. If the maximum is reached, the game ends in the step 1618. Otherwise, the game resumes with the selection of a new number in the step 1604.
The systems for operating the bingo games and the method of playing the bingo games have been described within the context of both paper and electronic versions. While the paper versions provide for a static bingo card, electronic versions enable dynamic evolution of a same bingo card over the course of a game. Within the context of an electronic version, each player can be provided with a client device, such as an electronic console, connected to a game server. The connection can be established over a public network such as the Internet, or a private network maintained by the bingo operator.
Referring now to
Prior to the activation of a bingo session, the player purchases a bingo ID number from the bingo operator and enters the ID number within the interface of a client 1802. A user interface controller 1804 provides the entered ID number to a server interface controller 1806, which retrieves the client numbers from a bingo card numbers database 1808, and stores the retrieved client numbers within a client numbers database 1814. Each client number identifies the card 400, one of the linked grids 402, 404, and 406, a cell within the identified one of the grids 402, 404, and 406, as well as a number borne by the identified cell. Furthermore, the user interface controller 1804 retrieves the client attribute designations from a bingo card attribute designations database 1810 and stores the retrieved client attribute designations within the client attribute designations database 1816. Each client attribute identifies the card 400, one of the linked grids 402, 404, and 406, a cell within the identified grid, as well as one of the attribute designations 408 and attribute designation 410. The user interface controller 1804 retrieves the client numbers from the client numbers database 1814, retrieves the client attribute designations from the client attribute designations database 1816, and displays the linked grids 402, 404, and 406 within the interface of the client 1802.
Once the bingo operator activates the game session, a random number generator 1818 provides a random number between one and seventy-five to a number dauber 1820 and an attribute search engine 1822. The random number generator 1818 does not provide the same number twice within the course of a same session. The number dauber 1820 searches through the client numbers stored within the client numbers database 1814 and assigns an electronic daub to each cell bearing the drawn number. As for the attribute search engine 1822, it searches through the client attribute designations stored within the client attribute designations database 1816 and provides an increment signal to an attribute counter 1824 for each identified one of the attribute designations 408 and 410 associated to the drawn number. The attribute counter 1824 holds a count of the count of daubed cells bearing the attribute designation 408 as well as a count of those bearing the attribute designation 410. It is important to note that the increment signal identifies the count to be incremented. The user interface controller 1804 retrieves the daubs stored within the client numbers database 1814, and for each retrieved daub, displays a visual indicator within the interface of the client 1802. Furthermore, the user interface controller 1804 retrieves the attribute counts from the attribute counter 1824 and, for each retrieved count, displays a corresponding number of daubs within a corresponding one of the grids 412 and 414.
The server 1800 also comprises a random attribute generator 1812 periodically triggered by a timer 1826 over the course of a session to retrieve from the bingo card numbers database 1808 grid daub positions, and store random client attribute designations in the bingo card attribute designations database 1810 to some of those of the play cells that have yet to be daubed. The server interface controller 1806 retrieves newly stored client attribute designations and stores them in the client attribute designations database 1816. The user interface controller 1804 retrieves the newly stored client attribute designations from the client attribute designations database 1816 and updates the display of the linked grids 402, 404, and 406 accordingly within the interface of the client 1802. As a result, the linked grids 402, 404, and 406 dynamically evolve over the course of a session, thereby presenting players with a greater variety of content.
According to one embodiment, the random attribute generator 1812 stores random client attribute designations in the bingo card attribute designations database 1810 over the course of a session without any restrictions with respect to the number of client attribute designations assigned within a grid or a series of linked grids, or the positions of the attribute designations within a grid or a set of linked grids.
According to another embodiment, the random attribute generator 1812 stores random client attribute designations in the bingo card attribute designations database 1810 according to a set of restrictions. According to one embodiment, the restrictions limit the number of client attribute designations that can be assigned to a grid or a series of linked grids. According to one embodiment, the restriction limits the grid cells to which client attribute designations can be assigned. According to one embodiment, the restrictions prevent the probability of a favourable outcome within a grid or a series of linked grids from deviating in a substantial manner. According to one embodiment, the restrictions ensure that all grids or series of grids enjoy an equal probability of reaching the desired objective before the first number is drawn. According to one embodiment, an event over the course of a session such as a bonus trigger alters the restrictions or their applicability, thereby enabling the random number generator 1812 to store client attribute designations in a manner that substantially increases the probably of a favourable outcome within a grid or a series of linked grids.
Referring now to
The user interface controller 1804 of each client connected to the server 1800, such as the client 1802, provides the grid daubs and attribute counts to the server interface controller 1806, which in turn stores the daubs and the ID number in a grid daubs database 1900 and stores the attribute counts and ID number in an attribute counts database 1918, wherein each daub identifies the card 400, a specific one of the grids 402, 404, and 406, as well as a specific cell within the identified one of the grids 402, 404, and 406.
A progress tracker 1920 retrieves the daubs and ID numbers from the daubs database 1900, the attribute counts and ID numbers from the attribute counts database 1918, the attribute positions and ID numbers from the bingo card attribute designations database 1810, as well as a current pattern from a patterns database 1922, wherein the current pattern defines the objective of the game. For each retrieved ID number, the tracker 1920 determines the corresponding probability of a favourable outcome, namely the near win value, and provides the latter value along with the corresponding ID number to a feature controller 1924. The aforementioned probability is determined by comparing the progress of a card towards the current pattern with that of the other cards.
The feature controller 1924 retrieves a visual feature representative of the near win value from a features database 1926 and provides the retrieved feature to the server interface controller 1806 of the appropriate client, namely the one running the bingo card having a matching ID number. The server interface controller 1806 provides the feature to the user interface controller 1804 in order for the interface of the client to be updated accordingly.
According to another embodiment, the client 1802 is a code scanner mounted on a table at a specific play position. The code scanner reads ID numbers of bingo cards held by a player seated at the corresponding play position, and provides the ID number to the server 1800. The feature controller 1924 provides the feature signal to the scanner, in order for the play position to be distinguished from others according to the near win value of the card held by the player seated at the play position.
According to one embodiment, the feature controller 1924 provides the feature signal to a seat corresponding to the play position in order for the seat to light up. The feature controller 1924 can also provide the feature signal to a seat corresponding to the play position in order for the seat to emit a distinctive sound signal. The feature controller 1924 can also provide the feature to a spotlight controller in order for a lamp to be directed towards the play position, and where the play position would be distinguished by a spotlight.
According to a preferred embodiment, the feature consists in a specific colour, and the cards found to be in near win situations are displayed in red. According to another embodiment, the feature consists in a blinking indicator displayed on cards that are found to be in a near win situation. According to yet another embodiment, the feature consists in a scale to be displayed on the cards, wherein the scale provides an indication as to the probability of a favourable outcome. According to another embodiment, the feature consists in an audio-visual signal.
The traditional bingo game can be perceived as a race to a predetermined pattern, wherein each active grid competes with all other active grids. Understandably, the player that runs several grids simultaneously loses interest in those that fall significantly behind the others. Consequently, over the course of a session, the game becomes less challenging as fewer grids are monitored. However, within the context of the game illustrated in
The grids 412 and 414 enable the player to readily compare the number of play cells bearing the attribute designation 408 and the count of cells bearing the attribute designation 410, thereby bringing the race between the attribute designations 408 and 410 to the attention of the player, and simplifying the manner in which the race is monitored. The two aforementioned advantages are accentuated in the embodiment illustrated in
According to one embodiment, the cells to which attribute designations are assigned can be selected or configured to customize the manner in which the number of daubed cells bearing a same attribute progresses towards the desired objective. For instance, in the context of the game illustrated in
According to one embodiment, the grids 412 and 414 are comprised of an equal count of cells and the count of cells is adjusted in order to customize the probability of a favourable outcome with respect to a maximum count of drawn numbers within which the objectives are to be reached, the minimal count of drawn numbers before the objective can be reached, the average count of drawn numbers required before the objective is reached, or the probability that a favourable outcome is reached within any one of the grids 412 and 414 before it is reached within another one of the grids 412 and 414. According to another embodiment, the count of cells comprised within the grid 412 is different from the count of cells comprised within the grid 414 in order for the aforementioned customization to be achieved.
In traditional bingo games, the player can only claim to have reached a desired objective by calling out “BINGO”, a limitation that contributes to the redundancy of the game. Furthermore, within the context of bingo games wherein several objectives are available simultaneously, as opposed to sequentially, the call-out does not identify the objective that has been allegedly reached.
Disclosed herein is a novel method of operating a bingo game wherein different call-outs are used over the course of a same session. The method comprises providing players with a plurality of call-outs over the course of a bingo session, identifying a player that uses one of the call-outs, and verifying the active bingo cards of the identified caller to determine whether an objective is reached within one of the cards of the caller.
According to one embodiment, the call-outs are provided at the beginning of a session and valid for the entire session. According to another embodiment, the call-outs are provided at the beginning of a session, each of which is valid for the entire session until it is rightfully used by a player. In other words, when a player rightfully claims to have reached an objective, the call-out used by the player is retired for the remainder of the session. However, when a player mistakenly claims to have reached a desired objective, the call-out used by the player remains valid for the remainder of the session.
According to yet another embodiment, a different call-out is assigned to each of two objectives that are simultaneously available over the course of a session. For instance, within the context of the embodiment illustrated in
According to yet another embodiment, participating players are divided into groups, each of which is assigned a different call-out, or a series thereof, wherein a player can only claim to have reached a desired objective by using the call-out assigned to the group to which the player belongs. For instance, players can be divided as a function of their gender or the position of their seat within a bingo hall.
As mentioned herein above, bingo games are typically hosted in bingo halls wherein each player purchases a bingo kit comprised of several bingo cards, joins other players at one of several tables, and lays the purchased cards on the table in a configuration adapted for monitoring purposes. In other versions of bingo games, each player is provided with a client device on which purchased bingo cards are displayed. In both cases, the surface of bingo cards, and therefore, that of bingo grids, is limited by logistical considerations such as the table surface made available to players or the display surface of client devices provided thereto. Considering the aforementioned limitations, the count of cells to be displayed within a grid, and the importance of readability within the context of bingo games, each number occupies most of the surface of the cell to which it is assigned, leaving little room for attribute designations. However, the addition of such attribute designations is desirable as it provides for a greater variety of bingo games.
Disclosed herein is a bingo card with a grid having twenty-five cells, twenty-four of which bear numbers, and some of which bear an attribute that neither interferes with the readability of the numbers nor necessitates a substantial amount of additional surface. This is achieved by stretching the outer boundary of peripheral cells outwardly with respect to the grid, and displaying the attribute within the stretched boundaries, wherein the peripheral cells are those of the cells that are located at the periphery of the grid, the attribute is sized for readability, the outer boundary is sufficiently stretched to receive the attribute, and the outer boundary is not stretched beyond the needs of the attribute.
According to one embodiment, the outer boundary of each peripheral cell is stretched outwardly. This embodiment is particularly advantageous for the purposes of printing bingo cards wherein those of the peripheral cells to which the attribute is added vary from one card to the next. According to another embodiment, only those of the peripheral cells that receive an attribute have their outer boundary stretched, thereby minimizing the surface occupied by the grid. In the particular embodiment illustrated in
Auxiliary Feature of a Main Bingo Game
The following embodiments relate to systems for operating and methods of playing auxiliary features of existing bingo games. The features are designed to complement existing bingo games in order to improve the provided entertainments over the course of one or several game session.
The objective of bingo games is traditionally established as a function of readily identifiable patterns of cells to be daubed within a same grid, also known as a face, each of which is defined by a predetermined count of cells that clearly distinguish themselves from the others by their positional relationships. One of the most popular patterns consists in five horizontally aligned cells. Another one consists in four corner cells. As players grow accustomed to such patterns, their interest in the game diminishes; the patterns become repetitive and the monitoring of several grids during a same session becomes effortless.
Disclosed herein is an auxiliary feature of a bingo game. The feature awards a prize upon completion of a predetermined pattern using daubed cells, the pattern extending over more than one of several linked grids and forming different sub-patterns therein. As a result, different contributions are expected from more than one of several linked grids towards the pattern. Within the context of such a feature, in order to establish the state of the linked grids, the player must assess the individual contribution of each of the grids towards the pattern, and subsequently determine whether the assessed contributions collectively lead to the desired pattern. As a result, such patterns are not as readily identifiable as their traditional counterparts.
According to one embodiment, the first player that rightfully claims to have daubed four, three, and two corner play cells within three linked grids is awarded a corresponding prize. Referring to
The predetermined pattern is to be formed using daubed play cells, namely play cells bearing selected ones of a predetermined set of symbols such as numbers. Symbols are selected by a means for randomly selecting different ones of the set of symbols, such as computer program implementing a random number generator. Alternatively, and referring to
The play cells for receiving daubs are organized into grids, which can be displayed on electronic consoles that are portable or embedded into play tables. Alternatively, the grids can be printed on bingo cards. Referring to
In order to establish the state of the bingo card 100, the player determines whether at least two corner cells are daubed within the grid 102. In this particular case, only one of the four corner cells are daubed, namely the play cell 112. Since the prize is assigned to the first player that rightfully claims to have daubed four, three, and two corner cells within the grid 102, the grid 104, and the grid 106, and since only one of the four corner cells has been daubed within the grid 102, the player concludes that the objective is yet to be reached within the bingo card 100, regardless of the cells daubed within the grid 104 and grid 106. If not rushed in time, the player can determine whether all corner cells of the grid 104 and grid 106 are daubed to establish the complete state of the card 100 in anticipation of subsequent draws. The player would conclude that two of the four corner cells of the grid 104, namely the cells 114, and three corner cells 116 of the grid 106 are daubed. Furthermore, the player would conclude that daubing an additional corner cell of each one of the grids 102, 104, and 106 would lead to the objective. Conversely, if rushed in time, the player can forego this process in order to determine whether the objective is reached within other active cards before the subsequent draw.
Within the context of the latter embodiment, the contributions expected from the linked grids involve corner cells exclusively. However, according to other embodiments, the contributions involve a greater number of play cells. Such embodiments present distinct challenges with respect to state monitoring as greater contributions are expected from the linked grids.
According to a preferred embodiment, the first player that rightfully claims to have daubed cells forming a pattern in the shape of the letter “Y” within a rightmost one of three linked and horizontally aligned grids, in the shape of the letter “E” within a centermost one of the grids, and in the shape of the letter “S” within a leftmost one of the grids, the combination of which spells the word “YES” within the bingo card on which all three grids are printed, is awarded a corresponding prize. Referring to
Referring to
In order to establish the state of the bingo card 200, the player determines whether cells daubed within the grid 202 form a pattern in the shape of the letter “Y”, and concludes that such a pattern is indeed formed. Subsequently, the player determines whether cells daubed within the grid 204 form a pattern in the shape of the letter “E” and concludes that no such pattern is formed. More specifically, an additional cell, namely a cell 212 bearing the number twenty, needs to be daubed within the grid 202 in order for such a pattern to be formed. Since the prize is awarded upon daubing cells that form a pattern in the shape of the letter “Y” within the grid 202, in the shape of the letter “E” within the grid 204, and in the shape of the letter “S” within the grid 206, the player further concludes that the prize is yet to be awarded within the card 200. If not rushed in time, the player can determine whether cells daubed within the grid 206 form a pattern in the shape of the letter “S” to establish the complete state of the card 200 in anticipation of subsequent draws. If the player chooses to do so, the player concludes that such a pattern is indeed formed within the grid 206 and the cell 212 is the only one left in order for the prize to be awarded. Conversely, if rushed in time, the player can forego this process in order to determine whether the predetermined pattern is formed within other active cards before the subsequent draw.
Within the context of the latter embodiment, a different and specific contribution is expected from each one of three linked grids. However, according to other embodiments, different contributions are expected from some of linked grids, but no contribution is assigned to a specific one of the grids. Such embodiments present distinct challenges with respect to state monitoring as each one of the contributions can be provided by any one of the linked grids.
According to a preferred embodiment, the first player that rightfully claims to have daubed cells forming a pattern in the shape of the letter “O” within a first of three linked and horizontally aligned grids, and in the shape of the letter “N” within another one of the linked grids, the combination of which spells either one of the words “NO” and “ON” within the bingo card in which the grids are presented, is awarded a corresponding prize. Referring to
In order to establish the state of the bingo card 300, the player determines whether cells daubed within the grid 302 form a pattern in the shape of the letter “O” or the letter “N” and concludes that no such pattern is formed. More specifically, an additional cell bearing the number forty-two needs to be daubed in order for a pattern in the shape of the letter “O” to be formed, and two additional cells, namely the ones bearing the numbers twenty-five and fifty-five, need to be daubed in order for a pattern in the shape of the letter “N” to be formed within the grid 302. Subsequently, the player determines whether cells daubed within the grid 302 form a pattern in the shape of the letter “O” or the letter “N”, and concludes that no such pattern is formed. Since the prize is awarded upon daubing cells that form a pattern in the shape of the letter “O” and another in the shape of the letter “N” within any two of the grid 302, grid 304, and grid 306, the player further concludes that the predetermined pattern is yet to be completed within the card 300. If not rushed in time, the player can determine whether cells daubed within the grid 306 form a pattern in the shape of the letter “O” or the letter “N” to establish the complete state of the card 300 in anticipation of subsequent draws. The player would conclude that the cells daubed within the grid 306 form a pattern in the shape of the letter “N” and therefore only the cell bearing the number forty-two needs to be daubed in order for the objective to be reached within the card 300. Conversely, if rushed in time, the player can forego this process in order to determine whether the predetermined pattern is completed within other active cards before the subsequent draw.
If the next number to be drawn is indeed forty-two, the player daubs the corresponding cell, determines whether cells daubed within the grid 302 form a pattern in the shape of the letter “O” or the letter “N”, and concludes that cells daubed within the grid 302 form a pattern in the shape of the letter “O”. Subsequently, the player determines whether cells daubed within the grid 304 form a pattern in the shape of the letter “O” or the letter “N” and concludes that no such pattern is formed. Finally, the player determines whether cells daubed within the grid 306 form a pattern in the shape of the letter “O” or the letter “N” and concludes that cells daubed within the grid 306 form a pattern in the shape of the letter “N”. Consequently, the player can rightfully claim to have daubed cells forming a pattern in the shape of the letter “O” and another in the shape of the letter “N” within any two of linked grids printed on the card 300.
Referring now to
In a step 700, three linked grids of play cells are provided to a player. The linked grids can be displayed on an electronic console or printed on a bingo card. While the method is described as provided three linked grids to the player, it can provide a different number of linked grids in accordance with rules of the auxiliary feature. More than one set of linked grids can be displayed on an electronic console or printed on a bingo card, in which case those of the grids belonging to a same set are visually distinguished from others. For instance, each set of linked grids can be of a different colour.
In a step 702, a pattern spanning three linked grids is displayed. A pattern is said to span several grids if it extends over several grids. The pattern is displayed on a means for displaying such as an electronic console, an electronic display, or a board on which the bingo operator can draw. Such a display informs the players of the pattern to be formed using daubed cells belonging to a same set of linked grids.
In a step 704, one of a predetermined set of numbers is randomly selected. The number can be automatically selected by a computer program implementing a random number generator or by an operator activating a blower. In embodiments where at least one play cell can bear one of a predetermined set of non-numerical symbols, one of the non-numerical symbols can alternatively be selected in the step 704.
In a step 706, the linked grids are verified to determine whether any of the play cells bear the number selected in the step 704. In embodiments where the grids are printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, and communicating with the means for selecting can automatically search the play cells for the selected number.
If in the step 706, at least one of the play cells is identified as bearing the selected number, and in a step 708, the identified play cell is daubed. In embodiments where the grids are printed on bingo cards, the player can daub the identified cell by applying a dauber over the surface of the bingo card on which the identified cell is printed. The dauber leaves an ink mark on the bingo card distinguishing the identified play cell from those bearing a yet to be selected one of the set of numbers. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to play input to the identified cell for it to be distinguished from those of the cells bearing a yet to be selecting one of the set of numbers.
In a step 710, it is verified whether a predetermined pattern is formed by the daubed play cells belonging of the linked grids. In embodiments where the grids are printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically search the play cells for the predetermined pattern.
If according to the verification performed in the step 710, the daubed play cells of the linked grids form the predetermined pattern, the player holding the linked grids is awarded a payout in a step 712. The payout can be of monetary or non-monetary nature. The prize can be awarded manually, by a representative of the bingo operator, or electronically, by a computer program having access to player accounts and triggered upon completion of the pattern.
Once the payout is awarded, the auxiliary feature ends in a step 714 and all grids become invalid for that particular feature. Alternatively, only the linked grids in which the predetermined pattern was formed become invalid and the other grids remain valid for a same or different auxiliary feature. According to yet another embodiment, all grids remain valid for a different auxiliary feature.
However, if according to the verification performed in the step 710, the daubed play cells of the linked grids have yet to form the predetermined pattern, a count of number selections is incremented by one in a step 716. The count is updated in order to ensure that the predetermined pattern is formed within a maximum established in accordance with rules of the auxiliary feature.
However, according to another embodiment, the rules of the auxiliary feature do not establish such a restriction and no count of number selections is recorded.
In a step 718, it is verified whether the count of number selections has reached the predetermined maximum. The verification can be performed by a representative of the bingo operator or by a computer program communicating with the selection means. If the maximum is reached, the auxiliary feature ends in the step 714. Otherwise, the auxiliary feature remains valid for the subsequent number selection performed in the step 704.
Disclosed herein is an auxiliary feature that awards a prize upon satisfaction of arithmetic relationships by counts of daubed cells belonging to each of several linked grids. The auxiliary feature presents distinct challenges with respect to state monitoring as the contribution of any one of the linked grids can not be assessed independently from those of its brethren.
According to a preferred embodiment, the first player that rightfully claims to have a triple-faced bingo card wherein one of the grids has precisely four daubed cells more than the least daubed grid, and another one of the grids has precisely eight daubed cells more than the least daubed grid, is awarded a corresponding prize. Referring to
Referring to
In order to establish the state of the bingo card 800, the player determines the count of cells daubed within each of the grid 802, grid 804, and grid 806.
Unlike a readily identifiable pattern, such a number cannot be ascertained from a quick glance at the card 800. Therefore, the player either counts or updates a memorized count of the count of cells daubed within each of the grid 802, the grid 804, and the grid 806, compares the resulting counts to determine whether the desired arithmetic function is satisfied, and concludes that the objective is yet to be reached within the card 800. Indeed, while the grid 804 has four daubed cells more than the grid 802, the grid 806 has only seven daubed cells more than the grid 802, and therefore, one additional cell needs to be daubed within the grid 806 before the player can rightfully claim to have three linked grids satisfying the desired arithmetic function.
If the next number to be drawn is borne by a cell within the grid 806, and not borne by any of the cells within the grid 802 and grid 804, the player daubs the corresponding cell, either counts or updates a memorized count of the count of cells daubed within the grid 802, grid 804, and grid 806, compares the resulting counts to determine whether the desired arithmetic function is satisfied, and concludes that the arithmetic function is yet to be reached within the card 800. Indeed, while the grid 804 has four daubed cells more than the grid 802, the grid 806 has eight daubed cells more than the grid 802.
If however, the next number to be drawn is not exclusively borne by a cell within the grid 806, the player daubs the corresponding cells, if any, either counts or updates a memorized count of daubed cells belonging to the grid 802 and grid 804, compares the resulting counts to determine whether the desired arithmetic function is satisfied, and concludes that the arithmetic function is yet to be satisfied within the card 800, regardless of the count of cells daubed within the grid 806. If not rushed in time, the player can determine the count of cells daubed within the grid 806 to assess the complete state of the card 800 in anticipation of subsequent draws. Conversely, if rushed in time, the player can forego this process in order to determine whether the objective is reached within other active cards before the subsequent draw.
It is important to note that within the context of traditional bingo games, a grid either stagnates or progresses towards an objective over the course of a session, whereas in the context of this particular auxiliary feature, a single daub can pull a card away from the prize. For instance, in the case illustrated in
Referring now to
In a step 1100, three linked grids of play cells are provided to a player. The linked grids can be displayed on an electronic console or printed on a bingo card. While the method is described as providing three linked grids to the player, it can provide a different number of linked grids in accordance with rules of the auxiliary feature. More than one set of linked grids can be displayed on an electronic console or printed on a bingo card, in which case those of the grids belonging to a same set are visually distinguished from others. For instance, each set of linked grids can be of a different colour.
In a step 1102, an arithmetic function to be satisfied by a count of the daubed play cells belonging to a first of three linked grids, a count of the daubed play cells belonging to a second of the linked grids, and a count of the daubed play cells belonging to a third of the linked grids is displayed. The function is displayed on a means for displaying such as an electronic console, an electronic display, or a board on which the bingo operator can draw using chalk or a felt-tip pen. Such a display informs the players of the arithmetic function to be satisfied.
In a step 1104, one of a predetermined set of numbers is randomly selected. The number can be automatically selected by a computer program implementing a random number generator or by an operator activating a blower. In embodiments where at least one play cell can bear one of a predetermined set of non-numerical symbols, one of the non-numerical symbols can alternatively be selected in the step 1104.
In a step 1106, the linked grids are verified to determine whether any of the play cells bear the number selected in the step 1104. In embodiments where the grids are printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, and communicating with the means for selecting can automatically search the play cells for the selected number.
If in the step 1106, at least one of the play cells is identified as bearing the selected number, and in a step 1108, the identified play cell is daubed. In embodiments where the grids are printed on bingo cards, the player can daub the identified cell by applying a dauber over the surface of the bingo card on which the identified cell is printed. The dauber leaves an ink mark on the bingo card distinguishing the identified play cell from those bearing a yet to be selected one of the set of numbers. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to play input to the identified cell for it to be distinguished from those of the cells bearing a yet to be selecting one of the set of numbers.
In a step 1110, for each play cell daubed in the step 1108, a corresponding grid count is incremented. A grid count represents a total count of daubed play cells belonging to one of the linked grids. In embodiments where the grids are printed on a bingo card, the grid counts can be calculated by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically increment the grid counts.
In a step 1112, it is verified whether the three grid counts corresponding to the set of linked grids satisfy the arithmetic function. In embodiments where the grids are printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically compare the grid counts according to the predetermined arithmetic function.
If according to the verification performed in the step 1112, the grid counts of the linked grids satisfy the predetermined arithmetic function, the player holding the linked grids is awarded a payout in a step 1114. The payout can be of monetary or non-monetary nature. The prize can be awarded manually, by a representative of the bingo operator, or electronically, by a computer program having access to player accounts and triggered upon satisfaction of the predetermined arithmetic function.
Once the payout is awarded, the auxiliary feature ends in a step 1116 and all grids become invalid with respect to the auxiliary feature. Alternatively, only the linked grids whose grid counts satisfy the predetermined arithmetic function become invalid and the other grids remain valid for a same or different auxiliary feature. According to yet another embodiment, all grids remain valid for a different auxiliary feature.
However, if according to the verification performed in the step 1112, the grid counts of the linked grids have yet to satisfy the predetermined arithmetic function, a count of number selections is incremented by one in a step 1118. The count is updated in order to ensure that the predetermined arithmetic function is satisfied within a maximum established in accordance with rules of the auxiliary feature. However, according to another embodiment, the rules of the auxiliary feature do not establish such a restriction and no count of number selections is recorded.
In a step 1120, it is verified whether the count of number selections has reached the predetermined maximum. The verification can be performed by a representative of the bingo operator or by a computer program communicating with the selection means. If the maximum is reached, the auxiliary feature ends in the step 1116. Otherwise, the auxiliary feature remains valid for the subsequent number selection performed in the step 1104.
Disclosed herein is another novel auxiliary feature of an existing bingo game. The feature awards a prize upon satisfaction of an arithmetic relationship by a count of the daubed cells belonging to a grid and a last number daubed within the same grid. Within the context of such an auxiliary feature, in order to establish the state of a grid, the player either counts or keeps a count of daubed cells within the grid, and compares the resulting number with the number borne by the last cell daubed within the same grid. Both alternatives are challenging within the context of simultaneously active grids, but for different reasons. The first tries the speed at with which is counted the number of daubed cells within each active grid, and the second, the ability to memorize an evolving count for each active grid.
According to a preferred embodiment, the first player that rightfully claims to have daubed a count of cells equal to the number borne by the last daubed cell over the course of a same session is awarded a corresponding prize. Referring to
Referring now to
In order to establish the state of the grid 1202, the player counts the cells 1204 daubed. Unlike a readily identifiable pattern, such a number cannot be accurately ascertained from a quick glance at the grid 1202. Therefore, the player either counts or updates a memorized count of daubed ones of the cells 1204. Subsequently, the player compares the resulting count, namely five, with the number borne by the last cell to be daubed, namely twenty-eight, to conclude that the objective is yet to be reached within the grid 1202.
If the next number to be drawn is six, the player daubs the corresponding cell 1206, either counts or increments a memorized count of the cells 1204 daubed, and compares the count, namely six, with the number borne by the last daubed cell 1206, namely six, to conclude that the objective is reached within the grid 1202.
However, if the next number to be drawn is borne by one of the cells 1204 other than the cell 1206, the player daubs the corresponding one of the cells 1204 and counts or increments a memorized count of the cells 1204 daubed. Since the resulting count is greater than six, the cell 1206 can no longer be the sixth cell to be daubed within the grid 1202, and consequently, the objective for this particular grid shifts to the smallest number greater than six and borne by a yet to be daubed cell. For instance, in the particular case illustrated in
Alternatively, if the next number to be drawn is not borne by any of the cells 1204, the player does not daub any of the cells 1204. Since the count of cells 1204 daubed within the grid 1202 remains unchanged and smaller than six, the cell 1206 can still turn out be the sixth cell to be daubed within the grid 1202, and consequently, satisfaction of the arithmetic function for this particular grid remains hinged on the number six. Consequently, the player would only count the cells 1204 daubed to identify the number upon which satisfaction of the arithmetic function hinges in anticipation of subsequently drawn numbers. If rushed in time, and knowing that the arithmetic function has not been satisfied within the grid 1202, the player can forego this process in order to determine whether the arithmetic function is satisfied within other active grids before the subsequent draw.
While the auxiliary feature has been described as involving an individual grid, it can very well involve several linked grids, wherein the arithmetic function is to be satisfied by a total count of daubed play cells belonging to the grids and a number borne by the last cell daubed within the linked grids. In this particular embodiment, the player encounters greater difficulty in establishing the state of the grids as satisfaction of the arithmetic function requires contribution from more than one grid.
Referring now to
In a step 1500, a grid of play cells is provided to a player. The grid can be displayed on an electronic console or printed on a bingo card. While the method is described as providing a grid to the player, it can provide a greater number of grids in accordance with rules of the auxiliary feature. More than one grid can be displayed on an electronic console or printed on a bingo card.
In a step 1502, an arithmetic function to be satisfied by a grid count and a number borne by a last daubed cell is displayed. The function is displayed on a means for displaying such as an electronic console, an electronic display, or a board on which the bingo operator can draw using chalk or a felt-tip pen. Such a display informs the players of the arithmetic function to be satisfied.
In a step 1504, one of a predetermined set of numbers is randomly selected. The number can be automatically selected by a computer program implementing a random number generator or by an operator activating a blower. In embodiments where at least one play cell can bear one of a predetermined set of non-numerical symbols, one of the non-numerical symbols can alternatively be selected in the step 1504.
In a step 1506, the grid is verified to determine whether any of the play cells bear the number selected in the step 1504. In embodiments where the grid is printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, and communicating with the means for selecting can automatically search the play cells for the selected number.
If in the step 1506, at least one of the play cells is identified as bearing the selected number, and in a step 1508, the identified play cell is daubed. In embodiments where the grid is printed on a bingo card, the player can daub the identified cell by applying a dauber over the surface of the bingo card on which the identified cell is printed. The dauber leaves an ink mark on the bingo card distinguishing the identified play cell from those bearing a yet to be selected one of the set of numbers. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to play input to the identified cell for it to be distinguished from those of the cells bearing a yet to be selecting one of the set of numbers.
In a step 1510, for each play cell daubed in the step 1508, a corresponding grid count is incremented. A grid count represents a total count of daubed play cells belonging to the grid. In embodiments where the grid is printed on a bingo card, the grid count can be calculated by the player. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically increment the grid count.
In a step 1512, it is verified whether the grid count and the number selected in the step 1504 satisfy the predetermined arithmetic function. In embodiments where the grid is printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically compare the grid count and the number selected in the step 1504 according to the predetermined arithmetic function.
If according to the verification performed in the step 1512, the grid count and the number selected in the step 1504 satisfy the predetermined arithmetic function, the player holding the grid is awarded a payout in a step 1514. The payout can be of monetary or non-monetary nature. The prize can be awarded manually, by a representative of the bingo operator, or electronically, by a computer program having access to player accounts and triggered upon satisfaction of the predetermined arithmetic function.
Once the payout is awarded, the auxiliary feature ends in a step 1516 and all grids become invalid with respect to the auxiliary feature. Alternatively, only the grid whose grid count satisfies the predetermined arithmetic function with the number selected in the step 1504 becomes invalid and the other grids remain valid for a same or different auxiliary feature. According to yet another embodiment, all grids remain valid for a different auxiliary feature.
However, if according to the verification performed in the step 1512, the grid count has yet to satisfy the predetermined arithmetic function along with the number selected in the step 1504, a count of number selections is incremented by one in a step 1518. The count is updated in order to ensure that the predetermined arithmetic function is satisfied within a maximum established in accordance with rules of the auxiliary feature. However, according to another embodiment, the rules of the auxiliary feature do not establish such a restriction and no count of number selections is recorded.
In a step 1520, it is verified whether the count of number selections has reached the predetermined maximum. The verification can be performed by a representative of the bingo operator or by a computer program communicating with the selection means. If the maximum is reached, the auxiliary feature ends in the step 1516. Otherwise, the auxiliary feature resumes with the selection of a new number in the step 1504.
At least some novice and experienced players look to increase the odds of winning a prize by purchasing a greater number of grids. There is therefore a need for a system that allows novice and experienced players to monitor the state of a greater number of simultaneously active grids, particularly within the context of games such as those described herein above, wherein states are not readily identifiable within cards.
Disclosed herein is a system for recording and displaying values of one or more parameters defining the state of a grid or several linked grids. Herein below, the system is described within the context of a bingo game, the objective of which is defined as a function of a number of daubed cells bearing a same attribute designation, but can very well be applied within the context of other games.
Referring now to
The attribute designations 408 and 410 are displayed within the grids 402, 404, and 406 for the purposes of a particular bingo game, the objective of which consists in being the first to have daubed ten cells bearing a same one of the attribute designation 408 and attribute designation 410 within a same series of linked grids. Within the context of such a game, the parameter values defining the states of the grids 402, 404, and 406 consist in the count of daubed cells bearing the attribute designation 408, and the count of daubed cells bearing the attribute designation 410.
In order to establish the state of the bingo card 400, the player determines the number of daubed cells bearing a same one of the attribute designations 408 and 410 within the grids 402, 404, and 406. Unlike a readily identifiable pattern, such a number cannot be ascertained from a quick glance at the card 400, at least partially because there are two types of symbols, namely the attribute designations 408 and 410, and because the symbols are randomly scattered across the grids 402, 404, and 406. Therefore, the player either counts or updates memorized counts of daubed cells bearing a same one of the attribute designations 408 and 410 within the grids 402, 404, and 406, and determines whether any of the resulting counts have reached the number ten.
Alternatively, the player can monitor the state of the bingo card 400 by daubing a cell within a corresponding one of the grids 412 and 414 for each cell daubed within one of the grids 402, 404, and 406 bearing one of the attribute designations 408 and 410. For instance, if the number ten is drawn, the player daubs the cell within the grid 402 bearing the number ten and a first cell within the grid 412. Subsequently, the player daubs the cell within the grid 406 bearing the number ten and a second cell within the grid 412.
Not only is the action of daubing cells within the grids 412 and 414 entertaining, but it also enables players to readily monitor within the grids 412 and 414 the number of daubed cells bearing a same one of the attribute designations 408 and 410, as well as the count of cells bearing a same one of the attribute designations 408 and 410 to be daubed in order for the desired objectives to be reached within the card 400. As a result, in cases where few cells need to be daubed in order for the objective to be reached, the corresponding near win situation is brought to the attention of the player within the grids 412 and 414, thereby increasing interest in subsequent draws in anticipation of an eventual win.
According to one embodiment, the count of cells bearing the attribute designation 408 equals the count of cells of the grid 412, and the count of cells bearing the number 410 equals the count of cells of the grid 414. The objective of the game is defined as a function of a predetermined number of daubed cells within a first predetermined subset of cells, namely those to which the attribute designation 408 is assigned, and as a function of a predetermined number of daubed cells within a second predetermined subset of cells, namely those to which the attribute designation 410 is assigned.
According to another embodiment, the count of cells bearing the attribute designation 408 is greater than the count of cells of the grid 412, and the count of cells bearing the attribute designation 410 is greater than the count of cells of the grid 414. The objective of the game is defined as a function of two predetermined patterns extending over more than one of several linked grids, the first predetermined pattern consisting in cells to which the attribute designation 408 is assigned, and the second predetermined pattern consisting in cells to which the attribute designation 410 is assigned.
According to one embodiment, an equal count of cells bear a same one of the attribute designations 408 and 410. However, according to another embodiment, the count of cells bearing a first one of the attribute designations 408 and 410 is greater than the count of cells bearing the second one of the attribute designations 408 and 410.
According to one embodiment, the grid 412 and the grid 414 include an equal count of cells. However, according to another embodiment, a first one of the grid 412 and the grid 414 includes a greater count of cells than the second one of the grid 414.
The cells of the grids 412 and 414 have been described as tracking cells, namely ones that provide an indication as to a count of daubed cells endowed with a corresponding one of the symbols 408 and 410. However, according to another embodiment, the cells of the grids 412 and 414 can be used as conversion cells, namely ones that reflect the value of each one of the attribute designations 408 and 410 with respect to an objective of the game.
According to the embodiments where the cells of the grids 412 and 414 are used as conversion cells instead of tracking cells, the player daubs a first predetermined count of different ones of the cells of the grid 412 for each daubed play cell endowed with the attribute designation 408 according to the rules of an auxiliary feature. Similarly, the player daubs a second predetermined count of different ones of the cells of the grid 414 for each daubed play cell endowed with the attribute designation 410 according to the rules of the auxiliary feature. A first prize is awarded when each one of the cells of the grid 412 is daubed. A second prize is awarded when each one of the cells of the grid 414 is daubed. The first and second predetermined counts are established in accordance with rules of the auxiliary feature, and can be equal or unequal. The first and second prizes are established in accordance with rules of the auxiliary feature and can be equal or unequal. For instance, the first predetermined count can be greater than the second predetermined count, and the second prize can be greater than the first prize.
While the auxiliary features have been described as involving two types of attribute designations, namely the attribute designations 408 and 410, it can very well involve a single attribute designation or more than two attribute designations. Also, while a single attribute designation, namely the attribute designation 408, is assigned to all cells of the grid 412, and a single attribute designation, namely the attribute designation 410, is assigned to all cells of the grid 414, more than one attribute designation can be assigned to a single cell.
While a same attribute designation, namely the attribute designation 408, is assigned to all cells of the grid 412, and a single attribute designation, namely the attribute designation 410, is assigned to all cells of the grid 414, a different attribute designation can be assigned to at least some of the cells of a same grid. According to one embodiment, a different attribute designation is assigned to at least some of the cells of a same grid, and when the player daubs a grid cell bearing an attribute designation, the player can daub no more than one grid cell, or no more than a predetermined count of cells to which the attribute designation is assigned. According to one embodiment, a different attribute designation is assigned to at least some of the cells of a same grid, and when the player daubs a grid cell bearing an attribute designation, the player can daub all grid cells to which the attribute designation is assigned.
According to one embodiment, a word is selected by the bingo operator, each letter of the word is assigned to a cell of the grid 412 such that the cells of the grid 412 spell the word, and each letter of the alphabet included in the word corresponds to a type of attribute designation borne by cells of the grids 402, 404, and 406. For instance, if the selected word is CHOCOLATE, the grid 412 would include nine cells, one for each letter of the word, and the cells of the grids 402, 404, and 406 would involve seven types of attribute designations, one for each letter of the alphabet included in CHOCOLATE. According to one embodiment, when the player daubs a cell of any one of the grids 402, 404, and 406 bearing the letter C or O, the player can daub only one of the two cells of the grid 412 to which the letter was assigned. However, according to another embodiment, the player can daub both cells of the grid 412 to which the letter is assigned.
The cells of the grids 412 and 414 have been described as tracking cells, namely ones that provide an indication as to a count of daubed cells endowed with a corresponding one of the attribute designations 408 and 410. However, according to another embodiment, the cells of the grids 412 and 414 can be used as conversion cells, namely ones that reflect the value of each one of the attribute designations 408 and 410 with respect to an auxiliary feature.
According to the embodiments where cells of the grids 412 and 414 are used as conversion cells instead of tracking cells, the player daubs a first predetermined count of different ones of the cells of the grid 412 for each daubed play cell endowed with the attribute designation 408 according to the rules of an auxiliary feature. Similarly, the player daubs a second predetermined count of different ones of the cells of the grid 414 for each daubed play cell endowed with the attribute designation 410 according to the rules of the auxiliary feature. A first prize is awarded when each cell of the grid 412 is daubed. A second prize is awarded when each cell of the grid 414 is daubed. The first and second predetermined counts are established in accordance with rules of the auxiliary feature, and can be equal or unequal. The first and second prizes are established in accordance with rules of the auxiliary feature and can be equal or unequal. For instance, the first predetermined count can be greater than the second predetermined count, and the second prize can be greater than the first prize.
Referring now to
In a step 1700, the grids of play cells and tracking cells are provided to a player. The grids can be displayed on an electronic console or printed on a bingo card. While the method is described as providing one grid of play cells to the player, it can provide a greater number of grids of play cells in accordance with rules of the game. Similarly, while the method is described as providing one grid of tracking cells to the player, it can provide a greater number of grids of tracking cells in accordance with rules of the game. More than one grid of play cells can be displayed on an electronic console or printed on a bingo card. Similarly, more than one grid of play cells can be displayed on an electronic console or printed on a bingo card.
In a step 1702, a pattern spanning three linked grids is displayed. A pattern is said to span several grids if it extends over several grids. The pattern is displayed on a means for displaying such as an electronic console, an electronic display, or a board on which the bingo operator can draw. Such a display informs the players of the pattern to be formed using daubed cells belonging to a same set of linked grids.
In a step 1704, one of a predetermined set of numbers is randomly selected. The number can be automatically selected by a computer program implementing a random number generator or by an operator activating a blower. In embodiments where at least one play cell can bear one of a predetermined set of non-numerical symbols, one of the non-numerical symbols can alternatively be selected in the step 1704.
In a step 1706, the grid is verified to determine whether any of the play cells bear the number selected in the step 1704. In embodiments where the grid is printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, and communicating with the means for selecting can automatically search the play cells for the selected number.
If in the step 1706, at least one of the play cells is identified as bearing the selected number, and in a step 1708, the identified play cell is daubed. In embodiments where the grid is printed on a bingo card, the player can daub the identified cell by applying a dauber over the surface of the bingo card on which the identified cell is printed. The dauber leaves an ink mark on the bingo card distinguishing the identified play cell from those bearing a yet to be selected one of the set of numbers. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to play input to the identified cell for it to be distinguished from those of the cells bearing a yet to be selecting one of the set of numbers.
In a step 1710, for each play cell daubed in the step 1708, it is determined whether the play cell daubed in the step 1708 is endowed with an attribute designation. In embodiments where the grid is printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically perform the verification.
If in the step 1710, the play cell is identified as bearing the attribute designation, and in a step 1712, one of the tracking cells is daubed. In embodiments where the grid is printed on a bingo card, the player can daub a tracking cell by applying a dauber over the surface of the bingo card on which an available one of the tracking cells is printed. The dauber leaves an ink mark on the bingo card distinguishing the tracking cell from those that have yet to be daubed. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to play input to an available tracking cell for it to be distinguished from those of the tracking cells that remain available.
In a step 1714, it is verified whether each one of the tracking cells has been daubed. In embodiments where the grids are printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically search for an available tracking cell.
If according to the verification performed in the step 1714, each one of the tracking cells has been daubed, the player holding the grid is awarded a payout in a step 1716. The payout can be of monetary or non-monetary nature. The prize can be awarded manually, by a representative of the bingo operator, or electronically, by a computer program having access to player accounts and triggered once the last one of the available tracking cells has been daubed.
Once the payout is awarded, the game ends in a step 1718 and all grids of play cells become invalid. Alternatively, only the grid of play cells for which all tracking cells have been daubed becomes invalid, and the other grids remain valid for a subsequent game having a same or different objective. According to yet another embodiment, all grids remain valid for a subsequent game having a different objective.
However, if according to the verification performed in the step 1714, at least one of the tracking cells remains available, a count of number selections is incremented by one in a step 1720. The count is updated in order to ensure that the predetermined arithmetic function is satisfied within a maximum established in accordance with rules of the game. However, according to another embodiment, the rules of the game do not establish such a restriction and no count of number selections is recorded.
In a step 1722, it is verified whether the count of number selections has reached the predetermined maximum. The verification can be performed by a representative of the bingo operator or by a computer program communicating with the selection means. If the maximum is reached, the game ends in the step 1718. Otherwise, the game resumes with the selection of a new number in the step 1704.
Referring now to
In a step 1600, the grids of play cells and conversion cells are provided to a player. The grids can be displayed on an electronic console or printed on a bingo card. While the method is described as providing one grid of play cells to the player, it can provide a greater number of grids of play cells in accordance with rules of the auxiliary feature. Similarly, while the method is described as providing one grid of conversion cells to the player, it can provide a greater number of grids of conversion cells in accordance with rules of the auxiliary feature. More than one grid of play cells can be displayed on an electronic console or printed on a bingo card. Similarly, more than one grid of play cells can be displayed on an electronic console or printed on a bingo card.
In a step 1602, a pattern spanning three linked grids is displayed. A pattern is said to span several grids if it extends over several grids. The pattern is displayed on a means for displaying such as an electronic console, an electronic display, or a board on which the bingo operator can draw. Such a display informs the players of the pattern to be formed using daubed cells belonging to a same set of linked grids.
In a step 1604, one of a predetermined set of numbers is randomly selected. The number can be automatically selected by a computer program implementing a random number generator or by an operator activating a blower. In embodiments where at least one play cell can bear one of a predetermined set of non-numerical symbols, one of the non-numerical symbols can alternatively be selected in the step 1604.
In a step 1606, the grid is verified to determine whether any of the play cells bear the number selected in the step 1604. In embodiments where the grid is printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, and communicating with the means for selecting can automatically search the play cells for the selected number.
If in the step 1606, at least one of the play cells is identified as bearing the selected number, and in a step 1608, the identified play cell is daubed. In embodiments where the grid is printed on a bingo card, the player can daub the identified cell by applying a dauber over the surface of the bingo card on which the identified cell is printed. The dauber leaves an ink mark on the bingo card distinguishing the identified play cell from those bearing a yet to be selected one of the set of numbers. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to play input to the identified cell for it to be distinguished from those of the cells bearing a yet to be selecting one of the set of numbers.
In a step 1610, for each play cell daubed in the step 1608, it is determined whether the play cell daubed in the step 1608 is endowed with an attribute designation. In embodiments where the grid is printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically perform the verification.
If in the step 1610, the play cell is identified as bearing the attribute designation, and in a step 1612, a predetermined count of the conversion cells is daubed. In embodiments where the grid is printed on a bingo card, the player can daub conversion cells by applying a dauber over the surface of the bingo card on which available ones of the conversion cells is printed. The dauber leaves an ink mark on the bingo card distinguishing the conversion cells from those that have yet to be daubed. However, in embodiments where the grid is displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can assign a visual indicator automatically or in response to play input to available conversion cells for them to be distinguished from those of the conversion cells that remain available.
In a step 1614, it is verified whether each one of the conversion cells has been daubed. In embodiments where the grids are printed on a bingo card, the verification can be performed by the player. However, in embodiments where the grids are displayed on electronic consoles, a computer program running on the console, or on a server managed by the bingo operator and communicating with the console, can automatically search for an available conversion cell.
If according to the verification performed in the step 1614, each one of the conversion cells has been daubed, the player holding the grid is awarded a payout in a step 1616. The payout can be of monetary or non-monetary nature. The prize can be awarded manually, by a representative of the bingo operator, or electronically, by a computer program having access to player accounts and triggered once the last one of the available conversion cells has been daubed.
Once the payout is awarded, the auxiliary feature ends in a step 1618 and all grids of play cells become invalid with respect to the auxiliary feature. Alternatively, only the grid of play cells for which all conversion cells have been daubed becomes invalid, and the other grids remain valid for a same or different auxiliary feature. According to yet another embodiment, all grids remain valid for a different auxiliary feature.
However, if according to the verification performed in the step 1614, at least one of the conversion cells remains available, a count of number selections is incremented by one in a step 1620. The count is updated in order to ensure that the predetermined arithmetic function is satisfied within a maximum established in accordance with rules of the auxiliary feature. However, according to another embodiment, the rules of the auxiliary feature do not establish such a restriction and no count of number selections is recorded.
In a step 1622, it is verified whether the count of number selections has reached the predetermined maximum. The verification can be performed by a representative of the bingo operator or by a computer program communicating with the selection means. If the maximum is reached, the auxiliary feature ends in the step 1618. Otherwise, the auxiliary feature remains valid for the subsequent number selection performed in the step 1604.
The systems for operating the auxiliary features and the method of playing the auxiliary features have been described within the context of both paper and electronic versions. While the paper versions provide for a static bingo card, electronic versions enable dynamic evolution of a same bingo card over the course of a game. Within the context of an electronic version, each player can be provided with a client device, such as an electronic console, connected to a game server. The connection can be established over a public network such as the Internet, or a private network maintained by the bingo operator.
Referring now to
Prior to the activation of a bingo session, the player purchases a bingo ID number from the bingo operator and enters the ID number within the interface of a client 1802. A user interface controller 1804 provides the entered ID number to a server interface controller 1806, which retrieves the client numbers from a bingo card numbers database 1808, and stores the retrieved client numbers within a client numbers database 1814. Each client number identifies the card 400, one of the linked grids 402, 404, and 406, a cell within the identified one of the grids 402, 404, and 406, as well as a number borne by the identified cell. Furthermore, the user interface controller 1804 retrieves the client attribute designations from a bingo card attribute designations database 1810 and stores the retrieved client attribute designations within the client attribute designations database 1816. Each client attribute identifies the card 400, one of the linked grids 402, 404, and 406, a cell within the identified grid, as well as one of the attribute designations 408 and 410. The user interface controller 1804 retrieves the client numbers from the client numbers database 1814, retrieves the client attribute designations from the client attribute designations database 1816, and displays the linked grids 402, 404, and 406 within the interface of the client 1802.
Once the bingo operator activates the game session, a random number generator 1818 provides a random number between one and seventy-five to a number dauber 1820 and an attribute designations search engine 1822. The random number generator 1818 does not provide the same number twice within the course of a same session. The number dauber 1820 searches through the client numbers stored within the client numbers database 1814 and assigns a daub to each cell bearing the drawn number. As for the attribute designations search engine 1822, it searches through the client attribute designations stored within the client attribute designations database 1816 and provides an increment signal to an attribute designations counter 1824 for each identified one of the attribute designations 408 and 410 associated to the drawn number. The attribute designations counter 1824 holds a count of the count of daubed cells bearing the attribute designation 408 as well as a count of those bearing the attribute designation 410. It is important to note that the increment signal identifies the count to be incremented. The user interface controller 1804 retrieves the daubs stored within the client numbers database 1814, and for each retrieved daub, displays a visual indicator within the interface of the client 1802. Furthermore, the user interface controller 1804 retrieves the attribute designation counts from the attribute designation counter 1824 and, for each retrieved count, displays a corresponding count of daubs within a corresponding one of the grids 412 and 414.
The server 1800 also comprises a random attribute designation generator 1812 periodically triggered by a timer 1826 over the course of a session to retrieve from the bingo card numbers database 1808 grid daub positions, and store random client attribute designations in the bingo card attribute designations database 1810 for some of those of the play cells that have yet to be daubed. The server interface controller 1806 retrieves newly stored client attribute designations and stores them in the client attribute designations database 1816. The user interface controller 1804 retrieves the newly stored client attribute designations from the client attribute designations database 1816 and updates the display of the linked grids 402, 404, and 406 accordingly within the interface of the client 1802. As a result, the linked grids 402, 404, and 406 dynamically evolve over the course of a session, thereby presenting players with a greater variety of content.
According to one embodiment, the random attribute designation generator 1812 stores random client attribute designations in the bingo card attribute designations database 1810 over the course of a session without any restrictions with respect to the number of client attribute designations assigned within a grid or a series of linked grids, or the positions of the attribute designations within a grid or a set of linked grids.
According to another embodiment, the random attribute designation generator 1812 stores random client attribute designations in the bingo card attribute designations database 1810 according to a set of restrictions. According to one embodiment, the restrictions limit the number of client attribute designations that can be assigned to a grid or a series of linked grids. According to one embodiment, the restriction limits the grid cells to which client attribute designations can be assigned. According to one embodiment, the restrictions prevent the probability of a favourable outcome within a grid or a series of linked grids from deviating in a substantial manner. According to one embodiment, the restrictions ensure that all grids or series of grids enjoy an equal probability of reaching the desired objective before the first number is drawn. According to one embodiment, an event over the course of a session such as a bonus trigger alters the restrictions or their applicability, thereby enabling the random number generator 1812 to store client attribute designations in a manner that substantially increases the probably of a favourable outcome within a grid or a series of linked grids.
Referring now to
The user interface controller 1804 of each client connected to the server 1800, such as the client 1802, provides the grid daubs and attribute designation counts to the server interface controller 1806, which in turn stores the daubs and the ID number in a grid daubs database 1900 and stores the attribute designation counts and ID number in a designation counts database 1918, wherein each daub identifies the card 400, a specific one of the grids 402, 404, and 406, as well as a specific cell within the identified one of the grids 402, 404, and 406.
A progress tracker 1920 retrieves the daubs and ID numbers from the daubs database 1900, the attribute designation counts and ID numbers from the attribute designation counts database 1918, the attribute designation positions and ID numbers from the bingo card attribute designations database 1810, as well as a current pattern from a patterns database 1922, wherein the current pattern defines the objective of the auxiliary feature. For each retrieved ID number, the tracker 1920 determines the corresponding probability of a favourable outcome, namely the near win value, and provides the latter value along with the corresponding ID number to a feature controller 1924. The aforementioned probability is determined by comparing the progress of a card towards the current pattern with that of the other cards.
The feature controller 1924 retrieves a visual feature representative of the near win value from a features database 1926 and provides the retrieved feature to the server interface controller 1806 of the appropriate client, namely the one running the bingo card having a matching ID number. The server interface controller 1806 provides the feature to the user interface controller 1804 in order for the interface of the client to be updated accordingly.
According to another embodiment, the client 1802 is a code scanner mounted on a table at a specific play position. The code scanner reads ID numbers of bingo cards held by a player seated at the corresponding play position, and provides the ID number to the server 1800. The feature controller 1924 provides the feature signal to the scanner, in order for the play position to be distinguished from others according to the near win value of the card held by the player seated at the play position.
According to one embodiment, the feature controller 1924 provides the feature signal to a seat corresponding to the play position in order for the seat to light up. The feature controller 1924 can also provide the feature signal to a seat corresponding to the play position in order for the seat to emit a distinctive sound signal. The feature controller 1924 can also provide the feature to a spotlight controller in order for a lamp to be directed towards the play position, and where the play position would be distinguished by a spotlight.
According to a preferred embodiment, the feature consists in a specific colour, and the cards found to be in near win situations are displayed in red. According to another embodiment, the feature consists in a blinking indicator displayed on cards that are found to be in a near win situation. According to yet another embodiment, the feature consists in a scale to be displayed on the cards, wherein the scale provides an indication as to the probability of a favourable outcome. According to another embodiment, the feature consists in an audio-visual signal.
The traditional bingo game can be perceived as a race to a predetermined pattern, wherein each active grid competes with all other active grids. Understandably, the player that runs several grids simultaneously loses interest in those that fall significantly behind the others. Consequently, over the course of a session, the game becomes less challenging as fewer grids are monitored. However, within the context of the game illustrated in
The grids 412 and 414 enable the player to readily compare the count of play cells bearing the attribute designation 408 and the count of play cells bearing the attribute designation 410, thereby bringing the race between the attribute designations 408 and 410 to the attention of the player, and simplifying the manner in which the race is monitored. The two aforementioned advantages are accentuated in the embodiment illustrated in
According to one embodiment, the cells to which attribute designations are assigned can be selected or configured to customize the manner in which the number of daubed cells bearing a same attribute designation progresses towards the desired objective. For instance, in the context of the auxiliary feature illustrated in
According to one embodiment, the grids 412 and 414 are comprised of an equal count of cells and the count of cells is adjusted in order to customize the probability of a favourable outcome with respect to a maximum number of drawn numbers within which the objectives are to be reached, the minimal number of drawn number before the objective can be reached, the average number of drawn numbers required before the objective is reached, or the probability that a favourable outcome is reached within any one of the grids 412 and 414 before it is reached within another one of the grids 412 and 414. According to another embodiment, the count of cells comprised within the grid 412 is different from the count of cells comprised within the grid 414 in order for the aforementioned customization to be achieved.
In traditional bingo games, the player can only claim to have reached a desired objective by calling out “BINGO”, a limitation that contributes to the redundancy of the game. Furthermore, within the context of bingo games wherein several objectives are available simultaneously, as opposed to sequentially, the call-out does not identify the objective that has been allegedly reached.
Disclosed herein is a novel method of operating a bingo game wherein different call-outs are used over the course of a same session. The method comprises providing players with a plurality of call-outs over the course of a bingo session, identifying a player that uses one of the call-outs, and verifying the active bingo cards of the identified caller to determine whether an objective is reached within one of the cards of the caller.
According to one embodiment, the call-outs are provided at the beginning of a session and valid for the entire session. According to another embodiment, the call-outs are provided at the beginning of a session, each of which is valid for the entire session until it is rightfully used by a player. In other words, when a player rightfully claims to have reached an objective, the call-out used by the player is retired for the remainder of the session. However, when a player mistakenly claims to have reached a desired objective, the call-out used by the player remains valid for the remainder of the session.
According to yet another embodiment, a different call-out is assigned to each of two objectives that are simultaneously available over the course of a session. For instance, within the context of the embodiment illustrated in
According to yet another embodiment, participating players are divided into groups, each of which is assigned a different call-out, or a series thereof, wherein a player can only claim to have reached a desired objective by using the call-out assigned to the group to which the player belongs. For instance, players can be divided as a function of their gender or the position of their seat within a bingo hall.
As mentioned herein above, bingo games are typically hosted in bingo halls wherein each player purchases a bingo kit comprised of several bingo cards, joins other players at one of several tables, and lays the purchased cards on the table in a configuration adapted for monitoring purposes. In other versions of bingo games, each player is provided with a client device on which purchased bingo cards are displayed. In both cases, the surface of bingo cards, and therefore, that of bingo grids, is limited by logistical considerations such as the table surface made available to players or the display surface of client devices provided thereto. Considering the aforementioned limitations, the count of cells to be displayed within a grid, and the importance of readability within the context of bingo games, each number occupies most of the surface of the cell to which it is assigned, leaving little room for attribute designations. However, the addition of such attribute designations is desirable as it provides for a greater variety of bingo games.
Disclosed herein is a bingo card with a grid having twenty-five cells, twenty-four of which bear numbers, and some of which bear an attribute designation that neither interferes with the readability of the numbers nor necessitates a substantial amount of additional surface. This is achieved by stretching the outer boundary of peripheral cells outwardly with respect to the grid, and displaying the attribute designation within the stretched boundaries, wherein the peripheral cells are those of the cells that are located at the periphery of the grid, the attribute designation is sized for readability, the outer boundary is sufficiently stretched to receive the attribute designation, and the outer boundary is not stretched beyond the needs of the attribute designation.
According to one embodiment, the outer boundary of each peripheral cell is stretched outwardly. This embodiment is particularly advantageous for the purposes of printing bingo cards wherein those of the peripheral cells to which the attribute designation is added vary from one card to the next. According to another embodiment, only those of the peripheral cells that receive an attribute designation have their outer boundary stretched, thereby minimizing the surface occupied by the grid. In the particular embodiment illustrated in
Claims
1. A system for operating a bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising:
- a pair of linked M×N grids of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols;
- means for randomly selecting different ones of the set of symbols; and
- means for displaying a predetermined pattern spanning two grids, an objective of the game comprising forming the pattern using the daubed play cells belonging to any one of the pair of linked grids, wherein the daubed play cells used in forming the pattern form a different sub-pattern in each one of the pair of linked grids.
2. The system of claim 1, further comprising a third M×N grid of the play cells, each of the play cells bearing one of the set of symbols, the third grid being linked to the pair of linked grids, wherein the displayed pattern spans three grids, and the game objective comprises forming the pattern using the daubed play cells belonging to any one of the three linked grids.
3. The system of claim 1, further comprising a third M×N grid of the play cells, each one of the play cells bearing one of the symbols, the third grid being linked to the pair of linked grids, wherein the game objective comprises forming the pattern using the daubed play cells belonging to any one of two of the three linked grids.
4. The system of claim 3, wherein the three linked grids are presented as aligned, the game objective comprises forming the pattern using the daubed play cells belonging to any one of two contiguous ones of the three linked grids.
5. The system of claim 1 or 2, wherein some of the play cells belonging to the linked grids bear an attribute designation, wherein the game objective comprises forming the pattern using the daubed play cells belonging to any one of the linked grids and bearing the attribute designation.
6. The system of claim 1, 2, 3, or 5, further comprising a dauber for daubing each one of the play cells bearing one of the selected symbols, and a grid of at least three tracking cells, each one of the tracking cells for receiving a daub for each one of the daubed play cells aligned with the pattern, whereby a count of those of the daubed play cells belonging to one of the linked grids and aligned with the pattern can be readily tracked to determine whether the game objective is met.
7. A system for operating a bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising:
- a pair of linked M×N grids of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols;
- means for randomly selecting different ones of the set of symbols; and
- means for displaying a predetermined arithmetic function to be satisfied by a first count of each one of the daubed play cells belonging to a first one of the pair of grids, and a second count of each one of the daubed play cells belonging to a second one of the pair of grids according to an objective of the game, wherein the arithmetic function is selected from a group consisting of:
- the first count being a product of the second count and a multiplier, the multiplier being an integer greater than one; and
- the first count being greater than the second count by a predetermined spread, the spread being greater than zero.
8. The system of claim 7, further comprising a third M×N grid of the play cells, each one of the play cells bearing one of the set of symbols, the third grid being linked to the pair of grids, wherein the arithmetic function is to be satisfied by the first and second counts, as well as by a third count of those of the daubed play cells belonging to the third grid, wherein the arithmetic function is selected from a group consisting of:
- each one of the first and third counts being a product of the second count and the multiplier; and
- the first count being greater than the second count by the predetermined spread, and the first count being greater than the second count by a second predetermined spread, the second spread being greater than zero.
9. The system of claim 7, further comprising a third M×N grid of the play cells, each one of the play cells bearing one of the set of symbols, the third grid being linked to the pair of grids, wherein the arithmetic function is to be satisfied by any two of the two counts and a third count of each one of the daubed play cells belonging to the third grid, wherein the arithmetic function is selected from a group consisting of:
- one of the first, second, and third counts being a product of the multiplier and one of the first, second, and third counts; and
- one of the first, second, and third counts being greater than one of the first, second, and third counts by the predetermined spread.
10. The system of claim 7, wherein some of the play cells belonging to the linked grids bear an attribute designation in addition to one of the set of symbols, the first count comprises a count of each one of the daubed cells belonging to the first grid and bearing the designation, the second count comprises a count of each one of the daubed cells belonging to the second grid and bearing the designation, and the arithmetic function is to be satisfied by the first and second counts.
11. The system of claim 8, wherein some of the play cells belonging to the linked grids bear an attribute designation, the first count comprises a count of each one of the daubed cells belonging to the first grid and bearing the designation, the second count comprises a count of each one of the daubed cells belonging to the second grid and bearing the designation, the third count comprises a count of each one of the daubed cells belonging to the third grid and bearing the designation, and the arithmetic function is to be satisfied by the first, second, and third counts.
12. The system of claim 7, 8, 9, 10, or 11, further comprising a dauber for daubing each one of the play cells bearing one of the selected symbols, and a grid of at least three tracking cells for each corresponding one of the grids of play cells, each one of the tracking cells for receiving a daub for each one of the daubed play cells belonging to the corresponding grid of play cells, whereby each one of the counts can be readily tracked to determine whether the game objective is met.
13. The system of claim 1 or 7, further comprising:
- a second pair of linked M×N grids of the play cells, each one of the play cells belonging to the grids of the second pair bearing one of the set of symbols;
- a progress tracker for identifying a most desirable one of the pairs as a function of the game objective and each one of the daubed play cells belonging to any one of the linked grids, the most desirable pair being closer to the game objective; and
- a feature controller for identifying the most desirable pair.
14. The system of claim 13, further comprising a console for displaying the pairs, wherein the feature controller distinguishes the most desirable pair on the console.
15. The system of claim 13, further comprising two consoles, each one of the consoles for displaying a different one of the pairs, wherein the feature controller identifies one of the consoles displaying the most desirable pair and distinguishes the identified console.
16. The system of claim 7, wherein the arithmetic function is satisfied when the first count is a product of the second count and a predetermined multiplier, the multiplier being an integer greater than one.
17. The system of claim 7, wherein the arithmetic function is satisfied when the first count is greater than the second count by a predetermined spread, the spread being greater than zero.
18. A system for operating a bingo game played by daubing play cells bearing selected ones of a predetermined set of numbers, the system comprising:
- an M×N grid of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of numbers;
- means for randomly selecting different ones of the set of numbers; and
- means for displaying a predetermined arithmetic function to be satisfied by a count of each one of the daubed play cells belonging to the grid of play cells and a last selected one of the selected numbers borne by any one of the play cells belonging to the grid of play cells according to an objective of the game.
19. The system of claim 18, further comprising a second M×N grid of the play cells, each one of the play cells belonging to the second grid bearing one of the set of numbers, the grids of play cells being linked, wherein the arithmetic function is to be satisfied by a count of each one of the daubed play cells belonging to any one of the two linked grids and a last selected one of the selected numbers borne by any one of the play cells belonging to any one of the two linked grids.
20. The system of claim 18, further comprising a dauber for daubing each one of the play cells bearing one of the selected symbols, and a grid of at least three tracking cells, each one of the tracking cells for receiving a daub for each one of the daubed play cells, whereby a count of the daubed play cells can be readily tracked to determine whether the game objective is met.
21. The system of claim 18, wherein the arithmetic function is satisfied when the last selected number borne by one of the play cells belonging to the grid of play cells equals the count.
22. A method of playing a bingo game on an M×N grid of play cells, each of M and N being strictly greater than two, and each one of the play cells bearing one of a predetermined set of symbols, the method comprising:
- providing the grid of play cells;
- providing a grid of at least three conversion cells;
- randomly selecting different ones of the set of symbols;
- play daubing those of the play cells bearing one of the selected symbols; and
- conversion daubing a predetermined count of different ones of the conversion cells for each one of the daubed play cells satisfying at least one predetermined criterion, an objective of the game comprising daubing each one of the conversion cells.
23. The method of claim 22, further comprising providing a second M×N grid of play cells, each one of the play cells bearing one of the set of symbols, the grids of play cells being linked, wherein the play daubing comprises daubing each one of the play cells belonging to any one of the two grids of play cells and bearing one of the selected symbols, and the conversion daubing comprises daubing a predetermined count of different ones of the conversion cells for each one of the daubed play cells satisfying the criterion and belonging to any one of the two grids of play cells.
24. The method of claim 22 or 23, further comprising assigning an attribute designation to each one of some of the play cells, wherein the attribute designation designates each one of the play cells satisfying the criterion, and whereby each one of the play cells satisfying the criterion can be readily identified.
25. The method of claim 24, wherein the attribute designation comprises a first attribute designation and a second attribute designation, and further comprising assigning the first attribute designation to each one of some of the play cells, and assigning a second attribute designation to each one of some of the play cells, and wherein the conversion daubing comprises daubing a first predetermined count of different ones of the conversion cells for each one of the daubed play cells bearing a first one of the two designations, and daubing a second predetermined count of different ones of the conversion cells for each one of the daubed play cells bearing a second one of the two designations, the first count being greater than the second count.
26. The method of claim 24, further comprising:
- assigning a second attribute designation to each one of the play cells, the second attribute designation designating those of the cells satisfying a second predetermined criterion; and
- providing a second grid of at least three conversion cells, wherein the conversion daubing comprises daubing a first predetermined count of different ones of the conversion cells belonging to a first one of the two grids of conversion cells for each one of the daubed play cells bearing a first one of the two designations, and daubing a second predetermined count of different ones of the conversion cells belonging to a second one of the two grids of conversion cells for each one of the daubed play cells bearing a second one of the two designations.
27. The method of claim 26, further comprising providing a first prize when each one of the conversion cells of the first grid of conversion cells are daubed, and providing a second prize when each one of the conversion cells of the second grid of conversion cells are daubed, wherein the first prize is of greater value than the second prize.
28. The method of claim 25, 26, or 27, wherein the second designation is assigned to a greater count of the play cells than the first designation.
29. The method of claim 22, 23, 24, 25, or 26, further comprising providing a prize when the game objective is met.
30. The method of claim 29, wherein the prize is a cash prize.
31. A card for playing a bingo game by daubing play cells bearing selected ones of a predetermined set of symbols, the card comprising:
- one M×N grid of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols, each one of the play cells bearing one of the selected symbols for receiving a play daub; and
- one grid of at least three tracking cells, each one of the tracking cells for receiving a tracking daub for each one of the daubed play cells satisfying a predetermined criterion, the tracking daubs indicating a count of those of the daubed play cells satisfying the criterion, an objective of the game comprising daubing each one of the tracking cells.
32. The card of claim 31, further comprising a second M×N grid of the play cells, each one of the play cells of the second grid of play cells bearing one of the set of symbols, each one of the play cells of the second grid of play cells bearing a selected one of the set of symbols for receiving a daub, the two grids of play cells being linked, wherein each one of the tracking cells is for receiving a daub for each one of the daubed play cells belonging to any one of the two linked grids and satisfying the criterion.
33. The card of claim 31 or 32, wherein an attribute designation is assigned to at least some of those of the play cells satisfying the criterion, and whereby at least some of those of the play cells satisfying the criterion can be readily identified.
34. The card of claim 33, further comprising a second grid of at least three tracking cells, wherein a second attribute designation is assigned to at least some of the play cells satisfying the criterion, each one of the tracking cells of a first one of the two grids of tracking cells is for receiving a daub for each of the daubed play cells bearing a first of the two designations, and each one of the tracking cells of a second one of the two grids of tracking cells is for receiving a daub for each of the daubed play cells bearing a second of the two designations.
35. The card of claim 34, wherein the second of the two designations is assigned to a greater count of the play cells than the first of the two designations.
36. The card of claim 33, wherein at least one of peripheral ones of the play cells has a main surface for displaying one of the set of symbols, and a protuberance surface extending outwardly for displaying the attribute designation, whereby readability of the symbols is not hindered by the display of the attribute designation.
37. A system for operating a bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising:
- a console for electronically displaying a grid of M×N of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols;
- a symbol selector for periodically and randomly selecting a different one of the set of symbols;
- a dauber for daubing each one of the play cells bearing one of the selected symbols; and
- a random attribute generator for modifying the displayed grid by randomly assigning an attribute designation to at least one of the play cells, the attribute designation designating each one of the play cells having special attributes in meeting an objective of the game.
38. The system of claim 37, wherein the attribute generator randomly assigns the attribute designation to a predetermined count of the play cells.
39. The system of claim 37, wherein the attribute generator randomly assigns the attribute designation to a random count of the play cells.
40. The system of claim 37, wherein the attribute generator assigns the designation to an increasing count of the play cells.
41. The system of claim 37, wherein the attributor generator identifies each one of the play cells that are yet to be daubed and assigns the attribute designation to at least one of the identified play cells.
42. The system of claim 37, 38, 39, 40, or 41, further comprising a timer for triggering the attribute generator according to a predetermined schedule.
43. The system of claim 37, 38, 39, 40, or 41, further comprising a timer for triggering the attribute generator periodically.
44. A system for operating a bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising:
- two different grids of M×N of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols;
- a symbol selector for periodically and randomly selecting a different one of the set of symbols;
- a dauber for daubing each one of the play cells bearing one of the selected symbols;
- a progress tracker for identifying a most desirable one of the two grids as a function of the daubed cells and an objective of the game, the more desirable grid being closer to a game objective; and
- a feature controller for identifying the most desirable grid.
45. The system of claim 44, further comprising a first console for displaying the grids, wherein the feature controller distinguishes the most desirable grid on the console.
46. The system of claim 44, further comprising two consoles, each one of the consoles for displaying a different one of the grids, wherein the feature controller identifies one of the consoles displaying the most desirable grid and distinguishes the identified console.
47. The system of claim 44 or 46, wherein the most desirable grid is identified by a sound signal.
48. The system of claim 44, further comprising:
- two bingo cards, each one of the bingo cards displaying a different one of the grids and having a different validation code; and
- two code scanners mountable on a table at different ones of two play positions, each one of the scanners for reading the validation code of a different one of the two bingo cards and for providing the read validation code to the feature controller, wherein the feature controller identifies one of the play positions corresponding to the most desirable grid and distinguishes the identified play position.
49. The system of claim 1, 7, 18, 37, or 44, further comprising a payout controller for providing a prize when the game objective is met.
50. The system of claim 49, wherein the prize is a cash prize.
51. The system of claim 1, 7, 18, 37, or 44, further comprising a dauber for daubing those of the play cells bearing one of the selected symbols, whereby those of the play cells belonging to any one of the linked grids and bearing one of the selected symbols can be readily tracked to determine whether the game objective is met.
52. The system of claim 1, 7, 18, 37, or 44, wherein the means for selecting comprises a blower.
53. The system of claim 1, 7, 37, or 44, wherein the symbols are numbers.
54. A system for operating an auxiliary feature of a bingo game, the bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising:
- a pair of linked M×N grids of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols; and
- means for displaying a predetermined pattern spanning two grids, wherein an incentive prize is awarded upon forming the pattern using the daubed play cells belonging to any one of the pair of linked grids.
55. The system of claim 54, further comprising a third M×N grid of the play cells, each of the play cells bearing one of the set of symbols, the third grid being linked to the pair of linked grids, wherein the displayed pattern spans three grids, and the incentive prize is awarded upon forming the pattern using the daubed play cells belonging to any one of the three linked grids.
56. The system of claim 54, further comprising a third M×N grid of the play cells, each one of the play cells bearing one of the symbols, the third grid being linked to the pair of linked grids, wherein the incentive prize is awarded upon forming the pattern using the daubed play cells belonging to any one of two of the three linked grids.
57. The system of claim 56, wherein the three linked grids are presented as aligned, and the incentive prize is awarded upon forming the pattern using the daubed play cells belonging to any one of two contiguous ones of the three linked grids.
58. The system of claim 54 or 55, wherein some of the play cells belonging to the linked grids bear an attribute designation, wherein the incentive prize is awarded upon forming the pattern using the daubed play cells belonging to any one of the linked grids and bearing the attribute designation.
59. The system of claim 54, 55, 56, or 57, further comprising a dauber for daubing each one of the play cells bearing one of the selected symbols, and a grid of at least three tracking cells, each one of the tracking cells for receiving a daub for each one of the daubed play cells aligned with the pattern, whereby a count of those of the daubed play cells belonging to one of the linked grids and aligned with the pattern can be readily tracked to determine whether the incentive prize is earned.
60. A system for operating an auxiliary feature of a bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising:
- a pair of linked M×N grids of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols; and
- means for displaying a predetermined arithmetic function to be satisfied by a first count of each one of the daubed play cells belonging to a first one of the pair of grids, and a second count of each one of the daubed play cells belonging to a second one of the pair of grids, wherein an incentive prize is awarded upon satisfaction of the arithmetic function.
61. The system of claim 60, further comprising a third M×N grid of the play cells, each one of the play cells bearing one of the set symbols, the third grid being linked to the pair of grids, wherein the arithmetic function is to be satisfied by the first and second counts, as well as by a third count of each one of the daubed play cells belonging to the third grid.
62. The system of claim 60, further comprising a third M×N grid of the play cells, each one of the play cells bearing one of the set symbols, the third grid being linked to the pair of grids, wherein the arithmetic function is to be satisfied by any two of the two counts and a third count of each one of the daubed play cells belonging to the third grid.
63. The system of claim 60, wherein some of the play cells belonging to the linked grids bear an attribute designation in addition to one of the symbols, the first count comprises a count of those of the daubed cells belonging to the first grid and bearing the designation, the second count comprises a count of those of the daubed cells belonging to the second grid and bearing the designation, and the arithmetic function is to be satisfied by the first and second counts.
64. The system of claim 62, wherein some of the play cells belonging to the linked grids bear an attribute designation, the first count comprises a count of each one of the daubed cells belonging to the first grid and bearing the designation, the second count comprises a count of each one of the daubed cells belonging to the second grid and bearing the designation, the third count comprises a count of each one of the daubed cells belonging to the third grid and bearing the designation, and the arithmetic function is to be satisfied by the first, second, and third counts.
65. The system of claim 60, 61, 62, 63, or 64, further comprising a dauber for daubing each one of the play cells bearing one of the selected symbols, and a grid of at least three tracking cells for each corresponding one of the grids of play cells, each one of the tracking cells for receiving a daub for each one of the daubed play cells belonging to the corresponding grid of play cells, whereby each one of the counts can be readily tracked to determine whether the game objective is met.
66. The system of claim 54 or 60, further comprising:
- a second pair of linked M×N grids of the play cells, each one of the play cells belonging to the grids of the second pair bearing one of the set of symbols;
- a progress tracker for identifying a most desirable one of the pairs as a function of the game objective and each one of the daubed play cells belonging to any one of the linked grids, the most desirable pair being closer to satisfaction of the arithmetic function; and
- a feature controller for identifying the most desirable pair.
67. The system of claim 66, further comprising a console for displaying the pairs, wherein the feature controller distinguishes the most desirable pair on the console.
68. The system of claim 66, further comprising two consoles, each one of the consoles for displaying a different one of the pairs, wherein the feature controller identifies one of the consoles displaying the most desirable pair and distinguishes the identified console.
69. The system of claim 60, wherein the arithmetic function is satisfied when the first count is a multiple of the second count.
70. The system of claim 60, wherein the arithmetic function is satisfied when the first count is greater than the second count by a predetermined spread.
71. A system for operating an auxiliary feature of a bingo game played by daubing play cells bearing selected ones of a predetermined set of numbers, the system comprising:
- an M×N grid of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of numbers; and
- means for displaying a predetermined arithmetic function to be satisfied by a count of each one of the daubed play cells belonging to the grid of play cells and a last selected one of the selected numbers borne by any one of the play cells belonging to the grid of play cells, wherein an incentive prize is awarded upon satisfaction of the arithmetic function.
72. The system of claim 71, further comprising a second M×N grid of the play cells, each one of the play cells belonging to the second grid bearing one of the set of numbers, the grids of play cells being linked, wherein the arithmetic function is to be satisfied by a count of each one of the daubed play cells belonging to any one of the two linked grids and a last selected one of the selected numbers borne by any one of the play cells belonging to any one of the two linked grids.
73. The system of claim 71, further comprising a dauber for daubing each one of the play cells bearing one of the selected symbols, and a grid of at least three tracking cells, each one of the tracking cells for receiving a daub for each one of the daubed play cells, whereby a count of the daubed play cells can be readily tracked to determine whether the incentive prize is earned.
74. The system of claim 71, wherein the arithmetic function is satisfied when the last selected number borne by one of the play cells belonging to the grid of play cells equals the count.
75. A method of playing a bingo game having an auxiliary feature on an M×N grid of play cells, each one of M and N being strictly greater than two, and each one of the play cells bearing one of a predetermined set of numbers, the bingo game played by play daubing each one of the play cells bearing a selected one of the set of numbers, the method comprising:
- providing a grid of at least three conversion cells; and
- conversion daubing a predetermined count of different ones of the conversion cells for each one of the daubed play cells satisfying at least one predetermined criterion, wherein an incentive prize is awarded when each one of the conversion cells is daubed.
76. The method of claim 75, further comprising providing a second M×N grid of play cells, each one of the play cells bearing one of the set of symbols, the grids of play cells being linked, wherein the play daubing comprises daubing those of the play cells belonging to any one of the two grids of play cells and bearing one of the selected symbols, and the conversion daubing comprises daubing a predetermined count of different ones of the conversion cells for each one of the daubed play cells satisfying the criterion and belonging to any one of the two grids of play cells.
77. The method of claim 75 or 76, further comprising assigning an attribute designation to each one of some of the play cells, wherein the attribute designation designates each one of the play cells satisfying the criterion, and whereby each one of the play cells satisfying the criterion can be readily identified.
78. The method of claim 77, wherein the attribute designation comprises a first attribute designation and a second attribute designation, and further comprising assigning the first attribute designation to each one of some of the play cells, and assigning a second attribute designation to each one of some of the play cells, and wherein the conversion daubing comprises daubing a first predetermined count of different ones of the conversion cells for each one of the daubed play cells bearing a first one of the two designations, and daubing a second predetermined count of different ones of the conversion cells for each one of the daubed play cells bearing a second one of the two designations, the first count being greater than the second count.
79. The method of claim 77, further comprising:
- assigning a second attribute designation to each one of the play cells, the second attribute designation designating those of the cells satisfying a second predetermined criterion; and
- providing a second grid of at least three conversion cells, wherein the conversion daubing comprises daubing a first predetermined count of different ones of the conversion cells belonging to a first one of the two grids of conversion cells for each one of the daubed play cells bearing a first one of the two designations, and daubing a second predetermined count of different ones of the conversion cells belonging to a second one of the two grids of conversion cells for each one of the daubed play cells bearing a second one of the two designations.
80. The method of claim 79, wherein the incentive prize comprises a first incentive prize awarded when each one of the conversion cells of the first grid of conversion cells are daubed, and a second incentive prize awarded when each one of the conversion cells of the second grid of conversion cells are daubed, wherein the first prize is of greater value than the second prize.
81. The method of claim 78, 79, or 80, wherein the second designation is assigned to a greater count of the play cells than the first designation.
82. The method of claim 75, 76, 77, 78, or 79, further comprising providing a prize when the game objective is met.
83. The method of claim 82, wherein the incentive prize is a cash prize.
84. A system for operating a bingo game having an auxiliary feature, the bingo game played by daubing play cells bearing selected ones of a predetermined set of symbols, the system comprising:
- a console for electronically displaying a grid of M×N of the play cells, each of M and N being strictly greater than two, each one of the play cells bearing one of the set of symbols; and
- a random attribute generator for modifying the displayed grid by randomly assigning an attribute designation to at least one of the play cells, the attribute designation designating each one of the play cells satisfying a predetermined criterion, wherein an incentive prize is awarded when a predetermined count of the daubed play cells satisfy the criterion.
85. The system of claim 84, wherein the attribute generator randomly assigns the attribute designation to a predetermined count of the play cells.
86. The system of claim 84, wherein the attribute generator randomly assigns the attribute designation to a random count of the play cells.
87. The system of claim 84, wherein the attribute generator assigns the designation to an increasing count of the play cells.
88. The system of claim 84, wherein the attributor generator identifies each one of the play cells that are yet to be daubed and assigns the attribute designation to at least one of the identified play cells.
89. The system of claim 84, 85, 86, 87, or 88, further comprising a timer for triggering the attribute generator according to a predetermined schedule.
90. The system of claim 84, 85, 86, 87, or 88, further comprising a timer for triggering the attribute generator periodically.
91. The system of claim 54, 60, 71, 75, or 84, wherein the incentive prize is a cash prize.
92. The system of claim 54, 60, 71, 75, or 84, further comprising a dauber for daubing those of the play cells bearing one of the selected symbols, whereby those of the play cells belonging to any one of the linked grids and bearing one of the selected symbols can be readily tracked to determine whether the incentive prize is earned.
93. The system of claim 54, 60, 75, or 84, wherein the symbols are numbers.
94. The system of claim 4 or 57, further comprising a console for displaying the aligned grids.
95. The system of claim 1, 7, 18, 54, 60, or 71, wherein the means for displaying is an electronic screen.
Type: Application
Filed: Mar 23, 2010
Publication Date: Jan 12, 2012
Applicant: INGENIO, FILIALE DE LOTO-QUEBEC INC. (Montreal, QC)
Inventors: Suzie Dumont (Brossard), Marta Zalewska (Montreal)
Application Number: 13/257,815
International Classification: A63F 9/24 (20060101);
