US2014135110A1PendingUtilityA1

Data access and communication system

Assignee: ARISTOCRAT TECHNOLOGIES AUPriority: Oct 29, 2002Filed: Jan 20, 2014Published: May 15, 2014
Est. expiryOct 29, 2022(expired)· nominal 20-yr term from priority
Inventors:Stephen Johnson
G07F 17/3244G07F 17/3267G07F 17/32
56
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A gaming machine has a display and a game controller arranged to control images of symbols displayed on the display. The game controller is arranged to play a game wherein at least one random event is caused to be displayed on the display and, if a predefined winning event occurs, the machine awards a prize. The gaming machine includes a determining module for determining whether or not at least one further prize, following the awarding of an initial prize, is to be awarded, the determining module using the value of that initial prize in determining the probability of the player successfully winning the at least one further prize.

Claims

exact text as granted — not AI-modified
1 - 36 . (canceled) 
     
     
         37 . A method for use with a gaming machine playing a game, said game having a plurality of sequential stages, each stage having an associated prize, the method comprising:
 determining an outcome of a current stage;   accumulating a current prize from a plurality of prizes each of which is associated with a unique one of the stages;   determining an average prize based on said current prize and at least one probability value via at least one mathematical function; and   awarding said average prize and progressing to a next stage if said outcome of said current stage is a successful outcome.   
     
     
         38 . The method as claimed in  claim 37 , wherein determining a current prize comprises obtaining a randomly selected integer and comparing the randomly selected integer to a range of integers. 
     
     
         39 . The method as claimed in  claim 37 , wherein the average value is one of a plurality of average values, further comprising associating each of the average values with one of the stages. 
     
     
         40 . The method as claimed in  claim 39  wherein each of the average values is different from any other of the average values. 
     
     
         41 . The method as claimed in  claim 37 , wherein the at least one mathematical function comprises:
   (Prize 0* P   s0 )+Prize 1*( P   s1   + . . . +P   sn )= NC   1 ;     (Prize 0* P   s0 )+Prize 1*( P   s1   + . . . +P   sn )+Prize 2*( P   s2   + . . . +P   sn )=NC 2        (Prize 0* P   s0 )+Prize 1*( P   s1   + . . . +P   sn )+Prize 2*( P   s2   + . . . +P   sn )+ . . . +Prize  n* ( P   sn )= NC   n .       P   s0   +P   s1   +P   s2   + . . . +P   sn =1;   wherein P s1  to P sn  are, respectively, probabilities of the associated stage outcome corresponding to a successful outcome; P s0  is the probability of the stage outcome for a first of the stages corresponding to the unsuccessful outcome; Prize 0 is a value of a consolation prize that may be awarded to the player if the stage outcome for the first of the stages corresponds to an unsuccessful outcome; NC 1  to NC n  each represents an average value of a respective prize.

Join the waitlist — get patent alerts

Track US2014135110A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.