IP Library Granted Patent US 9,852,587
Granted Patent B2
US 9,852,587 · App. 14/977,007 · Granted Dec 26, 2017

Method and system for operating instances of a game

Inventors: Serguei Bourenkov (Toronto, CA); Vadim Sheikhman (Woodbridge, CA); Dmitri Ligoum (Aurora, CA)
Assignee: RATIONAL INTELLECTUAL HOLDINGS LIMITED
G07F17/3276G07F17/323G07F17/3225G07F17/3237G07F17/3269G07F17/3293H04L67/141H04L67/42
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 9,852,587
App. No.
14/977,007
Granted
Dec 26, 2017
Kind
B2
Abstract

Disclosed is a computer-implemented method of (and system for) operating instances of a game having a plurality of game positions that can be occupied by players, such as a poker-type game. The method comprises assigning a player a plurality of weights relating to game positions, where each weight indicates a bias towards placement of the player at a game position. When a player has played in a first game at a given position, the weights are updated to indicate an altered bias towards placement at each position. The player is then assigned to a second game based on the updated weights.

Claims (71)

1. A computer-implemented method of operating instances of a game having a plurality of game positions that can be occupied by players, the method comprising:

associating with a player a plurality of weights relating to respective game positions, each weight indicative of a respective bias towards placement of the player at the respective game position;

in response to participation of a player in a first game instance at a given game position, updating each of the plurality of weights to indicate an altered bias towards placement at each respective position; and

assigning the player to a second game instance based on one or more of the updated weights and a comparison of the player's updated weights with corresponding weights of other players.

2. A method according to claim 1 , wherein the updating step is performed in dependence on the given game position occupied by the player in the first game instance.

3. A method according to claim 1 , wherein the updating step comprises updating the weight for the given game position to indicate a reduced bias towards placement at that position.

4. A method according to claim 1 , comprising updating the weights for one or more of the positions other than the given game position to indicate an increased bias towards placement at the one or more positions.

5. A method according to claim 4 , wherein updating weights for positions other than the given game position maintains an ordering of those weights relative to each other.

6. A method according to claim 1 , wherein the weights are updated so that, after updating, the weight for the given game position indicates a lowest bias towards placement at that position relative to the weights for the other positions.

7. A method according to claim 1 , wherein updating a weight comprises multiplying the weight by an update factor.

8. A method according to claim 1 , wherein updating a weight corresponding to the given game position comprises one or both of: multiplying the weight by an update factor, and adding a predetermined weight value.

9. A method according to claim 8 , wherein the update factor is selected in dependence on a number of game positions in the game.

10. A method according to claim 1 , comprising initialising the weights prior to participation of the player in a game.

11. A method according to claim 10 , wherein initialising comprises setting the weight for a selected starting position to a given value indicating a first bias towards placement of the player at the starting position, and setting the weights for other positions to one or more other values indicating a lower bias towards placement at those positions relative to the first bias.

12. A method according to claim 11 , wherein setting the weight for the selected starting position comprising calculating the average weight for that starting position, where

AvgWeight

=

1

N

(

1

-

(

(

N

-

1

N

)

TableSize

)

)

where N is a configurable parameter and TableSize is the number of players at a full table.

13. A method according to claim 12 , wherein N is equal to three times TableSize.

14. A method according to claim 12 , wherein setting the weight for subsequent game positions, following play order comprises setting the weight as follows:

SW j+1 =(N−1)SW j /N.

15. A method according to claim 10 , wherein initialising comprises setting the weights to respective values indicating a bias ordering of the game positions matching a predetermined game position order.

16. A method according to claim 1 , wherein the assigning step comprises:

for each game position in the second game instance, comparing the player's updated weight for the given game position to weights for the given position associated with the other players, and

assigning the player to a game position where the player's updated weight is greater than the weights for the given position associated with the other players.

17. A method according to claim 1 , wherein the assigning step comprises assigning the player further based on a time value associated with the player.

18. A method according to claim 1 , wherein the assigning step comprises: for a given game position in the second game instance, computing a bias measure indicating a bias towards placement of the player at the given game position in dependence on the player weight for the given game position and a time value associated with the player.

19. A method according to claim 18 , wherein the bias measure is computed such that an increase in the time value results in an increased bias towards placement of the player.

20. A method according to 17 , wherein the time value indicates a player idle time or wait time, preferably a time since the player ceased participating in the first game instance.

21. A method according to claim 1 , comprising, for a given game position in the second game instance, computing a bias measure relating to the game position for each of a plurality of players; selecting the player having a bias value indicating the greatest bias towards placement at the given game position; and assigning the selected player to the second game instance at the given game position.

22. A method according to claim 1 , comprising assigning the player to the second game instance in response to a player action in the first game instance.

23. A method according to claim 22 , wherein the player action comprises withdrawal from the game or a game round.

24. A method according to claim 1 , comprising connecting the player to the second game instance while maintaining the player's connection to the first game instance.

25. A method according to claim 1 , wherein the assigning step is performed in accordance with a placement algorithm.

26. A method according to claim 22 , wherein the placement algorithm is selected, or one or more parameters of the placement algorithm are varied, in dependence on a number of participating players.

27. A method according to claim 22 , wherein the placement algorithm is initiated in response to a triggering condition, the triggering condition preferably comprising one or both of: expiry of a time limit; and a number of idle players exceeding a threshold.

28. A computer-implemented method of operating instances of a game having a plurality of game positions that can be occupied by players, the method comprising:

initiating a game instance;

for each game position in the game instance, assigning a player to the game position, wherein the assigning comprises, for a given game position:

for each of a plurality of players available for assignment to the given game position, calculating a bias measure indicating a bias towards placement of the player in the respective position, wherein the bias measure is calculated in dependence on (i) position weighting information associated with the player, and (ii) wait time information indicating a time the player has been waiting to be assigned to a game;

selecting one of the plurality of available players based on a comparison of the player's calculated bias measures for the given game position; and

assigning the one selected player to the given game position.

29. A method according to claim 28 , wherein the selecting step comprises selecting the player having a bias measure indicating the greatest bias towards placement at the given game position.

30. A method according to claim 28 , wherein the selecting step comprises selecting the player having the lowest or highest bias measure.

31. A computer-implemented method of operating instances of a game having a plurality of game positions that can be occupied by players, the method comprising:

for each of a plurality of players, associating with the player:

a plurality of weights relating to a plurality of respective game positions, each weight indicative of a respective bias towards placement of the player at the respective game position; and

an idle indicator for indicating whether the player is currently participating in a game or is idle;

initiating an instance of the game;

for each game position associated with the game instance, selecting one of the plurality of players based on a comparison of the players' idle indicators and weights for the game position, and assigning the selected player to the game position; and

updating each of the plurality of weights associated with an assigned player to indicate an altered bias towards placement of the assigned player at each respective position.

32. A method according to claim 31 , comprising:

in response to cessation of a given player's participation in the game instance, setting the idle indicator for the player to indicate that the player is idle.

33. A method according to claim 31 , wherein the selecting step selects only idle players according to their idle indicators.

34. A method according to claim 29 , further comprising associating an idle time with players indicated as being idle by the idle indicator, and wherein the selecting step selects a player for a game position further in dependence on the players' idle times.

Assignments (8)
RELEASE OF SECURITY INTEREST Recorded Apr 30, 2024
From: LLOYDS BANK PLC, AS SUCESSOR TO DEUTSCHE BANK AG NEW YORK BRANCH AS COLLATERAL AGENT
To: RATIONAL INTELLECTUAL HOLDINGS LIMITED
Reel/Frame 067268/0738 →
RELEASE OF SECURITY INTEREST Recorded Apr 30, 2024
From: LLOYDS BANK PLC, AS COLLATERAL AGENT
To: RATIONAL INTELLECTUAL HOLDINGS LIMITED
Reel/Frame 067269/0442 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 16, 2022
From: BOURENKOV, SERGUEI; SHEIKHMAN, VADIM; LIGOUM, DMITRI
To: RATIONAL INTELLECTUAL HOLDINGS LIMITED
Reel/Frame 060818/0758 →
FIRST LIEN PATENT SECURITY AGREEMENT Recorded Jul 1, 2020
From: RATIONAL INTELLECTUAL HOLDINGS LIMITED
To: LLOYDS BANK PLC
Reel/Frame 053096/0438 →
ASSIGNMENT OF SECURITY INTEREST IN PATENT COLLATERAL RECORDED AT R/F 047245/0708 Recorded Jun 30, 2020
From: DEUTSCHE BANK AG NEW YORK BRANCH
To: LLOYDS BANK PLC
Reel/Frame 053093/0490 →
FIRST LIEN SECURITY AGREEMENT Recorded Jul 11, 2018
From: RATIONAL INTELLECTUAL HOLDINGS LIMITED
To: DEUTSCHE BANK AG NEW YORK BRANCH
Reel/Frame 047245/0708 →
RELEASE OF SECURITY INTEREST Recorded Jul 10, 2018
From: DEUTSCHE BANK AG NEW YORK BRANCH
To: RATIONAL INTELLECTUAL HOLDINGS LIMITED
Reel/Frame 046308/0870 →
FIRST LIEN SECURITY AGREEMENT Recorded Apr 10, 2018
From: RATIONAL INTELLECTUAL HOLDINGS LIMITED
To: DEUTSCHE BANK AG NEW YORK BRANCH, AS COLLATERAL AGENT
Reel/Frame 045872/0670 →
Priority Claims (1)
GB 1202370.1 · Feb 10, 2012 · national
Continuity (2)
Continuation 14378055
Related Publication 20160110961A1 · Apr 21, 2016