IP Library Granted Patent US 12,536,877
Granted Patent B2
US 12,536,877 · App. 18/799,032 · Granted Jan 27, 2026

Gaming method and apparatus using cluster based awards

Inventors: Ryan Paul Hawkins (Henderson, NV); Yanis Tsombanidis (Las Vegas, NV); Stephanie Johns (Las Vegas, NV); Robert Honeycutt (Henderson, NV)
Assignee: Aristocrat Technologies, Inc.
G07F17/34G07F17/32G07F17/3211G07F17/3213G07F17/3244
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,536,877
App. No.
18/799,032
Granted
Jan 27, 2026
Kind
B2
Abstract

The present invention relates to gaming machines, systems and methods of gaming. There are a number of different ways available for determining an award by current gaming machines and systems. In this embodiment, a game controller is arranged to determine an award depending on the number of columns spanned by a cluster of symbols and the number of symbol positions in the cluster.

Claims (34)

1 . A game server, comprising:

a communications interface;

a memory; and

a processor executing instructions stored in the memory, wherein execution of the instructions causes the processor to transmit one or more signals via the communications interface that cause a computing device to:

present, via a display of the computing device, a game outcome comprising a plurality of symbols at a plurality of display positions of the display, wherein each winning symbol cluster in the plurality of symbols comprises a respective same symbol at each display position in the respective winning symbol cluster, wherein each display position in the respective winning symbol cluster is adjacent to at least one other display position in the respective winning symbol cluster, and wherein no display position of the plurality of display positions is shared by multiple winning symbol clusters; and

present, for each winning symbol cluster, a respective cluster award that is based on a quantity of the respective same symbol in the respective winning symbol cluster.

2 . The game server of claim 1 , wherein execution of the instructions causes the processor to determine each cluster award by multiplying a respective base award by the quantity of the respective same symbol in the respective winning symbol cluster.

3 . The game server of claim 2 , wherein execution of the instructions causes the processor to determine the respective base award for each winning symbol cluster based on a quantity of rows spanned by the respective winning symbol cluster.

4 . The game server of claim 3 , wherein execution of the instructions causes the processor to:

determine that the respective base award for each winning symbol cluster has a first value in response to the quantity of rows spanned by the respective winning symbol cluster being a first quantity; and

determine that the respective base award for each winning symbol cluster has a second value greater than the first value in response to the quantity of rows spanned by the respective winning symbol cluster being a second quantity that is greater than the first quantity.

5 . The game server of claim 2 , wherein execution of the instructions causes the processor to determine the respective base award for each winning symbol cluster based on a quantity of columns spanned by the respective winning symbol cluster.

6 . The game server of claim 5 , wherein execution of the instructions causes the processor to:

determine that the respective base award for each winning symbol cluster has a first value in response to the quantity of columns spanned by the respective winning symbol cluster being a first quantity; and

determine that the respective base award for each winning symbol cluster has a second value greater than the first value in response to the quantity of columns spanned by the respective winning symbol cluster being a second quantity that is greater than the first quantity.

7 . A method of a computing device, the method comprising:

receiving, from a game server, a game outcome comprising a plurality of symbols;

presenting, via a display of the computing device, the plurality of symbols of the game outcome at a plurality of display positions; and

presenting, via the display, a respective cluster award for each winning symbol cluster that is based on a quantity of the respective same symbol in the respective winning symbol cluster, wherein each winning symbol cluster comprises a respective same symbol at each display position in the respective winning symbol cluster, wherein each display position in the respective winning symbol cluster is adjacent to at least one other display position in the respective winning symbol cluster, and wherein no display position of the plurality of display positions is shared by multiple winning symbol clusters.

8 . The method of claim 7 , comprising determining, with the computing device, the respective cluster award for each winning symbol cluster.

9 . The method of claim 7 , comprising receiving, from the game server, the respective cluster award for each winning symbol cluster.

10 . The method of claim 7 , comprising determining, with computing device, a first cluster award for a first winning symbol cluster based on a quantity of rows spanned by the first winning symbol cluster.

11 . The method of claim 7 , comprising determining, with the computing device, a first cluster award for a first winning symbol cluster by multiplying a base award for the first winning symbol cluster by a quantity of the display positions in the first winning symbol cluster.

12 . The method of claim 11 , comprising determining, with the computing device, the base award for the first winning symbol cluster based on a quantity of rows spanned by the first winning symbol cluster.

13 . The method of claim 12 , determining, with the computing device, that the base award for the first winning symbol cluster has a first value in response to the first winning symbol cluster spanning a first quantity of rows and has a second value greater than the first value in response to the first winning symbol cluster spanning a second quantity of rows that is greater than the first quantity of rows.

14 . The method of claim 11 , comprising determining, with computing device, the base award for the first winning symbol cluster based on a quantity of columns spanned by the first winning symbol cluster.

15 . The method of claim 14 , comprising determining, with the computing device, that the base award for the first winning symbol cluster has a first value in response to the first winning symbol cluster spanning a first quantity of columns and has a second value greater than the first value in response to the first winning symbol cluster spanning a second quantity of columns that is greater than the first quantity of columns.

16 . One or more non-transitory computer readable media comprising instructions, which when executed, cause a game server to transmit one or more signals that cause a computing device to at least:

present, via a display of the computing device, a game outcome comprising a plurality of symbols at a plurality of display positions; and

present, via the display of the computing device, a respective cluster award for each winning symbol cluster in the game outcome, wherein each winning symbol cluster comprises a respective same symbol at each display position in the respective winning symbol cluster, wherein each display position in the respective winning symbol cluster is adjacent to at least one other display position in the respective winning symbol cluster, and wherein no display position of the plurality of display positions is shared by multiple winning symbol clusters.

17 . The one or more non-transitory computer readable media of claim 16 , wherein the instructions, when executed, cause the game server to calculate a cluster award for each winning symbol cluster by multiply a base award for the respective winning symbol cluster by a quantity of display positions in the respective winning symbol cluster.

18 . The one or more non-transitory computer readable media of claim 16 , wherein the instructions, when executed, cause the game server to calculate a cluster award for each winning symbol cluster based on a quantity of rows spanned by the respective winning symbol cluster.

19 . The one or more non-transitory computer readable media of claim 16 , wherein the instructions, when executed, cause the game server to calculate a cluster award for each winning symbol cluster based on a quantity of columns spanned by the respective winning symbol cluster.

20 . The one or more non-transitory computer readable media of claim 19 , wherein the instructions, when executed, cause the game server to determine that a respective base award for the each winning symbol cluster has a first value in response to the quantity of columns spanned by the respective winning symbol cluster being a first quantity and has a second value greater than the first value in response to the quantity of columns spanned by the respective winning symbol cluster being a second quantity that is greater than the first quantity.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 9, 2024
From: HAWKINS, RYAN PAUL; TSOMBANIDIS, YANIS; JOHNS, STEPHANIE; HONEYCUTT, ROBERT
To: ARISTOCRAT TECHNOLOGIES AUSTRALIA PTY LIMITED
Reel/Frame 068235/0388 →
Priority Claims (1)
AU 2014903909 · Sep 29, 2014 · national
Continuity (4)
Continuation 17953781 · Sep 27, 2022
Continuation 17201137 · Mar 15, 2021
Continuation 14869660 · Sep 29, 2015
Related Publication 20240404373A1 · Dec 5, 2024
References Cited (55)
US 4448419A · Telnaes · 1984 [cited by applicant]
US 5275400A · Weingardt · 1994 [cited by applicant]
US 6142872A · Walker · 2000 [cited by applicant]
US 6146271A · Kadlic · 2000 [cited by applicant]
US 6244958B1 · Acres · 2001 [cited by applicant]
US 6413162B1 · Baerlocher · 2002 [cited by applicant]
US 7070502B1 · Bussick · 2006 [cited by applicant]
US 7819742B2 · Chamberlain · 2010 [cited by applicant]
US 10720007B2 · Hawkins · 2020 [cited by applicant]
US 10839638B2 · Hawkins · 2020 [cited by applicant]
US 10964173B2 · Hawkins · 2021 [cited by applicant]
US 11468746B2 · Hawkins · 2022 [cited by applicant]
US 11887434B2 · Berman · 2024 [cited by examiner]
US 12094305B2 · Hawkins · 2024 [cited by examiner]
US 20010031659A1 · Perrie · 2001 [cited by applicant]
US 20020043759A1 · Vancura · 2002 [cited by applicant]
US 20020045474A1 · Singer · 2002 [cited by applicant]
US 20020155882A1 · Baerlocher · 2002 [cited by applicant]
US 20030045345A1 · Berman · 2003 [cited by applicant]
US 20030060259A1 · Mierau · 2003 [cited by applicant]
US 20030216165A1 · Singer · 2003 [cited by applicant]
US 20060073879A1 · Baerlocher · 2006 [cited by applicant]
US 20060128456A1 · Berman · 2006 [cited by applicant]
US 20070060255A1 · Baerlocher · 2007 [cited by applicant]
US 20100222127A1 · Finch · 2010 [cited by applicant]
US 20100304833A1 · Berman · 2010 [cited by applicant]
US 20110098100A1 · Tsombanidis · 2011 [cited by applicant]
US 20130065664A1 · Clemens · 2013 [cited by applicant]
US 20130296018A1 · Aida · 2013 [cited by applicant]
US 20140162751A1 · Ryan · 2014 [cited by applicant]
US 20140274289A1 · Dunn · 2014 [cited by applicant]
US 20140274294A1 · Baerlocher · 2014 [cited by applicant]
US 20150087382A1 · Gilbertson · 2015 [cited by applicant]
US 20150221176A1 · Meyer · 2015 [cited by applicant]
US 20160093151A1 · Hawkins · 2016 [cited by applicant]
US 20160093153A1 · Hawkins · 2016 [cited by applicant]
US 20170024973A1 · Montenegro · 2017 [cited by applicant]
US 20170316646A1 · Hawkins · 2017 [cited by applicant]
US 20210201629A1 · Hawkins · 2021 [cited by applicant]
US 20210398393A1 · Honeycutt · 2021 [cited by applicant]
US 20220028216A1 · Hawkins · 2022 [cited by applicant]
US 20220044527A1 · Hawkins · 2022 [cited by applicant]
US 20220092920A1 · Hawkins · 2022 [cited by applicant]
US 20230021862A1 · Hawkins · 2023 [cited by applicant]
US 20240169797A1 · Berman · 2024 [cited by examiner]
US 20240404373A1 · Hawkins · 2024 [cited by examiner]
Examination Report for AU2017203303, dated Dec. 13, 2017, 3 pages. [cited by applicant]
Examination Report for AU2018278994, dated Feb. 11, 2020, 3 pages. [cited by applicant]
Office Action dated Jul. 24, 2020 for U.S. Appl. No. 14/869,660 (pp. 1-16). [cited by applicant]
Notice of Allowance dated Jan. 29, 2021 for U.S. Appl. No. 14/869,660 (pp. 1-7). [cited by applicant]
Office Action (Non-Final Rejection) dated Feb. 3, 2022 for U.S. Appl. No. 17/201,137 (pp. 1-13). [cited by applicant]
Office Action (Notice of Allowance and Fees Due (PTOL-85)) dated Jun. 23, 2022 for U.S. Appl. No. 17/201,137 (pp. 1-13). [cited by applicant]
Office Action dated Jun. 29, 2023 for U.S. Appl. No. 17/953,781 (pp. 1-17). [cited by applicant]
Office Action (Final Rejection) dated Jan. 22, 2024 for U.S. Appl. No. 17/953,781 (pp. 1-14). [cited by applicant]
Office Action (Notice of Allowance and Fees Due (PTOL-85)) dated Jun. 10, 2024 for U.S. Appl. No. 17/953,781 (pp. 1-5). [cited by applicant]