Multi-pattern online bingo

Abstract

A multi-pattern bingo game is provided. Using matrix multiplication, a selected bingo card is compared against multiple patterns that are played for simultaneously in a bingo game. If a pattern match is detected, the card is a winning card. In an online version of the game, winning cards may be determined and the information forwarded to individual player computers for simulation of the bingo game.

1 . A method for determining a winning card in a multi-pattern computerized bingo game, comprising: 
 a. setting multiple patterns to be played for simultaneously in the bingo game, each said pattern being stored in a computer memory as a pattern matrix;    b. generating call numbers from a range of available numbers, and a sequence in which the call numbers are to be called, the call numbers and the sequence being stored in the computer memory;    c. providing at least one bingo card for selection by a player, the card comprising card numbers from the range, the card numbers being associated with virtual positions on a grid, and, storing the card numbers and the grid positions thereof in the computer memory;    d. calling the call numbers in the sequence to construct, for each card, a daub matrix of grid positions corresponding to any card numbers which match the called number, and, for each called number: 
 (i) multiplying the daub matrix by each pattern matrix to produce a product matrix for each pattern; and  
 (ii) determining from each product matrix whether the card matches the pattern; and  
   e. repeating steps (i) and (ii) at least until such time as a pattern match is determined for any pattern, the card being thereby determined as a winning card, and determining how many called numbers must be called to generate said winning card.    
   
   
       2 . The method of  claim 1 , wherein steps (i) and (ii) are repeated in a game until a predetermined number of winning cards is reached.  
   
   
       3 . The method of  claim 1 , wherein steps (i) and (ii) are repeated in a game until a predetermined number of called numbers is called in the sequence, regardless of the number of winning cards determined.  
   
   
       4 . The method of  claim 1 , wherein each daub matrix comprises a matrix of 0s and 1s, each 1 representing a match in the grid position.  
   
   
       5 . The method of  claim 4 , wherein the determining step comprises evaluating each grid position in the product matrix and, finding a pattern match if values stored in the grid positions making up the pattern are greater than zero.  
   
   
       6 . The method of  claim 1 , wherein only one winning card is determined per game.  
   
   
       7 . The method of  claim 1 , wherein the method continues after one winning card is determined.  
   
   
       8 . The method of  claim 2 , wherein the number of winning cards is predetermined by an operator.  
   
   
       9 . The method of  claim 3 , wherein the number of called numbers is predetermined by an operator.  
   
   
       10 . The method of  claim 1 , wherein the sequence comprises 75 call numbers.  
   
   
       11 . The method of  claim 1 , wherein the sequence comprises 90 call numbers.  
   
   
       12 . The method of  claim 1 , wherein the bingo game is accessible to players over a distributed network, a game server being programmed to determine the winning card or cards for communication to a plurality of client computers, and each client computer being programmed for displaying a game re-creation and announcing the winning card or cards.  
   
   
       13 . The method of  claim 12 , wherein the game re-creation is interactive.  
   
   
       14 . The method of  claim 1 , wherein the multiple patterns are set by an operator.  
   
   
       15 . The method of  claim 1 , wherein the multiple patterns are set by a player.  
   
   
       16 . The method of  claim 12 , wherein the multiple patterns are displayed graphically during the game re-creation on the client computers.  
   
   
       17 . The method of  claim 12 , wherein the game re-creation includes displaying, for each card, a “number away” indication.  
   
   
       18 . The method of  claim 13 , wherein the game re-creation provides an auto-daub feature.  
   
   
       19 . The method of  claim 13 , wherein the game re-creation provides a manual daub feature.  
   
   
       20 . The method of  claim 19 , wherein the game re-creation provides a catch-up feature.  
   
   
       21 . A method for determining whether any winning cards have been selected in a multi-pattern computerized bingo game, comprising: 
 a. setting multiple patterns to be played for simultaneously in the bingo game, each said pattern being stored in a computer memory as a pattern matrix;    b. generating call numbers from a range of available numbers, and a sequence in which the call numbers are to be called, the call numbers and the sequence being stored in the computer memory;    c. providing at least one bingo card for selection by a player, the card comprising card numbers from the range, the card numbers being associated with virtual positions on a grid, and, storing the card numbers and the grid positions thereof in the computer memory;    d. calling the call numbers in the sequence to construct, for each selected card, a daub matrix of grid positions corresponding to any card numbers which match the called number, and, for each called number: 
 (i) multiplying the daub matrix by each pattern matrix to produce a product matrix for each pattern; and  
 (ii) determining from each product matrix whether the card matches the pattern, the card being thereby determined to be a winning card; and  
   e. repeating step (d) until a predetermined number of call numbers have been called, and determining how many called numbers must be called to generate a winning card, if any winning cards can be determined in the predetermined number of call numbers.    
   
   
       22 . A method for determining a winning card in a multi-pattern online bingo game accessible to players over a distributed network, comprising programmed steps for execution on a server, the steps including: 
 a. setting multiple patterns to be played for simultaneously in the bingo game, each said pattern being stored in a computer memory as a pattern matrix;    b. generating call numbers from a range of available numbers, and a sequence in which the call numbers are to be called, the call numbers and the sequence being stored in the computer memory;    c. providing at least one bingo card for selection by a player, the card comprising card numbers from the range, the card numbers being associated with virtual positions on a grid, and, storing the card numbers and the grid positions thereof in the computer memory;    d. calling the call numbers in the sequence to construct, for each card, a daub matrix of grid positions corresponding to any card numbers which match the called number, and, for each called number: 
 (i) multiplying the daub matrix by each pattern matrix to produce a product matrix for each pattern; and  
 (ii) determining from each product matrix whether the card matches the pattern; and  
   e. repeating steps (i) and (ii) at least until such time as a pattern match is determined for any pattern, the card being thereby determined as a winning card, and determining how many called numbers must be called to generate said winning card, wherein said server is programmed for communicating the winning card or cards to a plurality of client computers, each said client computer being programmed for displaying a game re-creation to announce the winning card or cards.