CN110694278A

CN110694278A - Game table combining method, game score calculating method and device and intelligent equipment

Info

Publication number: CN110694278A
Application number: CN201810751931.3A
Authority: CN
Inventors: 陈龙; 周欣; 赵良
Original assignee: Online Travel (beijing) Technology Co Ltd
Current assignee: Online Travel (beijing) Technology Co Ltd
Priority date: 2018-07-10
Filing date: 2018-07-10
Publication date: 2020-01-17

Abstract

The invention discloses a game table combining method, which comprises the following steps: monitoring whether a first user with a table to be grouped exists in a first user queue, if so, acquiring information of at least one second user from a target second user queue, and adding the information into the first user queue; and performing table group operation on the users corresponding to the first user queue which join the information of the second user. The method is used for solving the problem that in the prior art, the users at the same level are less and difficult to form the table, so that the users can wait for too long time to successfully form the table. The invention also discloses a game table combining device, a game score calculating method, a game score calculating device and intelligent equipment.

Description

Game table combining method, game score calculating method and device and intelligent equipment

Technical Field

The invention relates to the field of Internet, in particular to a game table combining method, a game point calculating device and game point calculating equipment.

Background

With the rapid development of network technology, network games gradually have a greater proportion in the leisure and entertainment lives of people, and the leisure and entertainment lives of people are greatly enriched. The network game can be divided into a single-player game and a multi-player combined game.

For a multi-player combined game with strong interactivity, at least two user group tables are needed to complete, for example, a landlord game needs 3 user group tables; the mahjong game requires 4 user group tables.

Currently, the table combining method adopted in the prior art is as follows:

the server performs group table allocation on the users according to a group table mode of allocating users with the same level characteristics (the level characteristics include, but are not limited to user levels, base score reference and the like) meeting the total number of the game to the same table and allocating users with different player characteristics to different tables. Wherein, the user level, for example, but not limited to, may be divided according to the amount of virtual money (such as game gold) held by the user, generally, the more the amount of virtual money held, the higher the level of the user; otherwise the user level is lower. The base score reference refers to a starting base score when the game credits are calculated after the single game is finished, for example, a landlord can have different game fields with game base score references of 400 and 1000 respectively. For a casino with a base score of 400, if the "farmer" wins (no "bombs"), the tally is increased by 400.

The problems of the prior art are as follows: under the condition that the number of users at different levels is distributed in a pyramid manner, the number of users at high levels is often relatively small, so that the probability that the users at high levels are difficult to form a table is high, and the users need to wait for a long time to successfully form the table, so that the user experience is influenced.

Similarly, the prior art may also have a situation where the number of users requesting a higher base score benchmark game is relatively small. In this case, the user who plays the high base score reference game also faces a problem that it takes a long time to successfully assemble the table.

Disclosure of Invention

The embodiment of the invention provides a game table assembling method, which is used for solving the problem that a user can successfully assemble a table after waiting for too long time when requesting to play a game.

The embodiment of the application also provides a game point calculating method, a game table combining device, a game point calculating device and intelligent equipment.

Specifically, the following technical scheme is adopted in the embodiment of the application:

a game table assembly method, comprising:

monitoring whether a first user of a table to be grouped exists in a first user queue; the first user queue is used for storing information of users waiting for playing a first game; the users waiting for the first game have the same first level characteristics;

if the first user of the table to be grouped exists in the first user queue, acquiring information of at least one second user from a target second user queue, and adding the information into the first user queue; the target second user queue is used for storing information of users waiting for playing a second game; the users waiting for the second game have the same second level characteristics; the first game and the second game are the same game;

and performing table group operation on the users corresponding to the first user queue which join the information of the second user.

A game point calculation method comprising:

determining a second coefficient of the accumulated change of the base points corresponding to the acquired information of the at least one second user in the process of playing the first game;

and determining a first game point based on the second coefficient of the accumulated change of the base points and the base point reference of the second game, wherein the first game point is used as a point for updating the balance of the user point account point corresponding to the information of the at least one second user.

A gaming group table apparatus comprising:

the monitoring unit is used for monitoring whether a first user of the table to be grouped exists in the first user queue; the first user queue is used for storing information of users waiting for playing a first game; the users waiting for the first game have the same first level characteristics;

the information processing unit is used for acquiring information of at least one second user from a target second user queue and adding the information into the first user queue if the first user of the table to be grouped is monitored to exist in the first user queue; the target second user queue is used for storing information of users waiting for playing a second game; the users waiting for the second game have the same second level characteristics; the first game and the second game are the same game;

and the group table unit is used for executing the operation of group table on the user corresponding to the first user queue added with the information of the second user.

A game point calculating device comprising:

the information processing unit is used for determining a second coefficient of accumulated change of the background corresponding to the acquired information of the at least one second user in the process of playing the first game;

and the point calculating unit is used for determining a first point of the game based on the second coefficient of the accumulated change of the base points and the base point reference of the second game, and the first point is used as a point for updating the point balance of the user point account corresponding to the information of the at least one second user.

A smart device, comprising:

a memory for storing computer program instructions;

a processor, coupled to the memory, for performing the steps of the game group table method or the game credits calculation method as described above.

The embodiment of the invention adopts at least one technical scheme which can achieve the following beneficial effects:

the information of the users can be acquired from the second user queue corresponding to the second game and added into the first user queue corresponding to the first game, so that the operation of 'number-collecting' is performed on the users corresponding to the first user queue, the users corresponding to the first user queue added with the user information can successfully group the table as soon as possible, and the problems that the number of the users corresponding to the first user queue is small, the table is difficult to form, and the table can be successfully grouped only after waiting for a long time are solved.

Drawings

The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the invention and not to limit the invention. In the drawings:

fig. 1 is a schematic flow chart of an implementation of a method for assembling a table game according to an embodiment of the present invention;

FIG. 2 is a schematic structural diagram of a gaming table assembly according to an embodiment of the present invention;

FIG. 3 is a schematic flow chart illustrating an implementation of a game point calculation method according to an embodiment of the present invention;

FIG. 4 is a schematic structural diagram of a game point calculating device according to an embodiment of the present invention;

fig. 5 is a schematic structural diagram of a mobile terminal according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the specific embodiments of the present invention and the accompanying drawings. It is to be understood that the described embodiments are merely exemplary of the invention, and not restrictive of the full scope of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

The technical solutions provided by the embodiments of the present invention are described in detail below with reference to the accompanying drawings.

Example 1

In order to solve the problem that a user may wait for too long time to successfully group tables when requesting to play a game in the prior art, embodiment 1 of the present invention provides a method for game table grouping. The main body of the method is usually but not limited to a game server, or the main body of the method may also be any computing device with a game table function, such as a mobile phone, a tablet computer, or a Personal Computer (PC), and may also be Application software installed on the computing device, such as an Application (APP) installed on a mobile phone.

Taking a game server as an execution subject, please refer to fig. 1, which is a flowchart for implementing a game table assembling method provided by the embodiment of the present invention, and the flowchart includes the following steps:

step 11, the game server monitors whether the first user queue has a table user to be grouped; if the first user queue is monitored to have users of the table to be grouped, executing the step 12, otherwise, continuing to execute the step 11;

the first user queue is used for storing information of users waiting for playing the first game.

Users waiting to play the first game have the same level feature (referred to as a first level feature). Where the first game is, for example, a top level field with a base division of 1000 in a fighter-classic field, then the same first level features that may be provided by a user waiting to play the first game may include: the base score reference for the game requested to be played is 1000.

Step 12, the game server selects a target second user queue;

wherein the target second user queue is used for storing information of users waiting for playing the second game. The users waiting to play the second game have the same level feature (referred to as a second level feature).

The first game and the second game described in the embodiments of the present invention refer to the same game. Along the above example, the first game, for example, may be a top level field with a sub-base of 1000 in a fighter-classic field (or a Sichuan mahjong field); and the second game, for example, may be a high-level field with a base standard of 400 in a landlord-classic field (or a Sichuan mahjong field). The base benchmark 400 may be the same second level characteristic that a user waiting to play the second game has.

Of course, the first level feature and the second level feature may also include, but are not limited to, other level features such as user level.

In the embodiment of the invention, the base score reference of the first game and the base score reference of the second game can be the same or different.

When the base scores of the first game and the second game are different, in one embodiment, the base score of the second game may be lower than the base score of the first game.

Considering that according to the related art, users who request to play different base-score benchmark games tend to store their information in different user queues — for example, game requests of different users who request to enter the top level field of the 1000 base-score benchmark of the georger-classic field (in the embodiment of the present invention, the storage request may be regarded as storing user information) are stored in the first user queue; the game requests of different users requesting to enter the 400-base-score-benchmark high-level field of the field main battle ground-classic field are stored in the target second user queue, so that a mode of selecting users to group tables in a cross-queue mode is provided in the embodiment of the invention. Step 12 is based on the manner in which users are selected "across queues" to determine from which target second user queue the user should be selected.

When selecting the target second user queue, the target second user queue satisfying at least one condition may be selected in consideration of one or more of the following four conditions.

The first condition is: the user queue selects a first condition. The condition is a queue selection condition preset for the attribute of "total number of users corresponding to the user queue".

In one embodiment, the user queue selecting the first condition includes: the total number of users corresponding to the user queue is larger than a preset number threshold, or the total number is relatively maximum.

That is to say, when there are at least two target second user queues available for selection, a target second user queue whose total number is greater than a predetermined number threshold may be selected from the at least two target second user queues according to the total numbers of users respectively corresponding to the at least two target second user queues, or a target second user queue whose total number is relatively the largest may be selected.

The advantage of selecting the corresponding target second user queue with the total number larger than the predetermined number threshold or the maximum number is that the target second user queue with the larger number of corresponding users can be selected as much as possible when the users are selected across the queues, so that on one hand, the risk that the users are difficult to successfully assemble the table due to the small number of the users can be increased when the users are selected from the target second user queue with the small number of the corresponding users; on the other hand, users in the target second user queue with a large number of corresponding users can be selected and combined with the table as soon as possible, the waiting time of the part of users is shortened, and the users are prevented from possibly facing a long waiting time.

In the embodiment of the invention, the user corresponding to the user queue refers to the user to which the user information stored in the user queue belongs. This concept will not be repeated below.

The second condition is: the user queue selects a second condition. The condition is a queue selection condition preset for the attribute of "average user level corresponding to the user queue".

In one embodiment, the user queue selecting the second condition includes: the difference between the average level of the user corresponding to the user queue and the average level of the user corresponding to the first user queue is smaller than a predetermined level difference threshold, or the average level of the user corresponding to the user queue is relatively highest.

That is to say, when there are at least two target second user queues available for selection, a target second user queue whose difference between the user average levels corresponding to the first user queue is smaller than a predetermined level difference threshold value may be selected from the at least two target second user queues according to the user average levels corresponding to the at least two target second user queues, respectively.

Particularly, when the user average level corresponding to the first user queue is higher than the user average levels corresponding to the target second user queues respectively, the target second user queue with the highest user average level can be selected, so that the level of the second user selected by subsequent cross-queue selection is closer to the level of the first user as much as possible, and therefore the first user can play games with users with little level difference as much as possible subsequently, and the game experience and the game fairness of the first user are guaranteed.

The average level of the user corresponding to the user queue in the embodiment of the present invention refers to an average value of "user levels" of the users included in the user queue, and will not be explained repeatedly below.

For example, in a classic floor-fighting primary game, the first user corresponding to the first user queue is the top user, and the target second user queues for selection are: a high-level user queue (the stored user information corresponds to a high-level user), and a medium-level user queue (the stored user information corresponds to a medium-level user). Then, according to the second condition for selecting the user queue, the advanced user queue may be preferentially selected.

The third condition is: the user queue selects a third condition. The condition is a queue selection condition preset for the attribute of "bottom score reference corresponding to the user queue".

In one embodiment, the user queue selecting the third condition includes: the difference between the base score reference of the user corresponding to the user queue and the base score reference corresponding to the first user queue is smaller than a preset base score reference difference threshold value, or the base score reference corresponding to the user queue is relatively highest.

That is to say, when there are at least two target second user queues available for selection, a target second user queue whose difference between the base criteria corresponding to the first user queue is smaller than a predetermined base criteria difference threshold may be selected from the at least two target second user queues according to the base criteria corresponding to the at least two target second user queues respectively.

Particularly, when the base score reference corresponding to the first user queue is higher than the base score references corresponding to the target second user queues respectively, the target second user queue with the highest base score reference can be selected, so that the base score reference of the second user selected by subsequent cross-queues is closer to the base score reference of the first user as far as possible, and therefore the first user can play games with users with slight base score reference differences as far as possible in the following manner-generally, the closer the base score reference is, the closer the user grades are, and therefore the game experience of the first user and the fairness of the games are guaranteed.

For example, in a classic floor-fighting primary game, the base score reference corresponding to the first user queue is 1000, and the target second user queues for selection are: a target second user queue 1 corresponding to the bottom scoring benchmark 800, and a target second user queue 2 corresponding to the bottom scoring benchmark 400. Then, according to the second condition for user queue selection, the target second user queue 1 corresponding to the base standard 800 may be preferentially selected.

The fourth condition is that: the user queue selects a fourth condition. The condition is a queue selection condition preset for the attribute of "average waiting time of a user corresponding to a user queue".

In one embodiment, the user queue selecting the fourth condition includes: the average waiting time of the users corresponding to the user queue is relatively longest.

That is to say, when there are at least two target second user queues available for selection, a target second user queue with the longest average waiting time may be selected from the at least two target second user queues according to the average waiting time of users corresponding to the at least two target second user queues, respectively.

The advantage of selecting the target second user queue with the longest average waiting time is that it can be ensured that the corresponding target second user queue with the longer average waiting time of the users is selected as much as possible when the users are selected across queues, so that on one hand, the users in the target second user queue with the longer average waiting time of the users corresponding to each table group can be selected as soon as possible and combined, and the waiting time of the users is shortened.

In the above, how to select the target second user queue according to one of the four conditions is described, and in the following, how to select the target second user queue according to a combination of at least two of the four conditions is described as an example:

assuming that the average level of the first users in the first user queue of the table to be grouped is 40, the situation of the target second user queue is as follows:

a is a target second user queue with the average user level of 35, and the average user waiting time is 15 seconds;

b is a target second user queue with the user average grade of 30, and the user average waiting time is 5 seconds;

c is a target second user queue with the user average grade of 30, and the user average waiting time is 15 seconds;

and D is the target second user queue with the average user level of 25, and the average user waiting time is 10 seconds.

In addition, it is assumed that a second condition and a fourth condition are selected in combination with the target second user queue to select the target second user queue, and a score calculation formula of any one target second user queue ═ x α + [ (average user waiting duration corresponding to any one target second user queue-average user rating corresponding to all target second user queues/average user rating corresponding to all target second user queues) ] × α + [ (average user waiting duration corresponding to any one target second user queue-average user waiting duration corresponding to all target second user queues)/average user waiting duration corresponding to all target second user queues ] × β. Wherein, according to the actual requirement, α can be set to be larger than β.

Based on the formula, the score of each target second user queue can be calculated, and the target second user queue with the maximum score is selected.

The formula for selecting the target second user queue according to at least two of the four conditions may be analogized, and details thereof are not repeated here.

Step 13, the game server selects a second user from the selected second user queue, and adds second user information corresponding to the selected second user into the first user queue;

when selecting the second user, the second user satisfying at least one condition may be selected in consideration of one or more of the following three conditions.

The specific selection of the second user may consider the user's own conditions, such as the following three conditions:

the user selects a first condition, which is a user selection condition preset aiming at the attribute of 'user level'.

In one embodiment, the user selecting the first condition comprises: the difference between the level corresponding to the user and the user level corresponding to the first user is less than a predetermined level difference threshold.

That is, when there are at least two second users available for selection, according to the user levels respectively corresponding to the at least two second users, a second user whose difference between the user levels corresponding to the first user is smaller than a predetermined level difference threshold value may be selected from the at least two second users.

And the user selects a second condition which is a user selection condition preset aiming at the attribute of the second base standard.

In one embodiment, the user selecting the second condition comprises: the difference between the base score reference corresponding to the user and the base score reference corresponding to the first user is smaller than a preset base score reference difference threshold value.

That is to say, when there are at least two second users available for selection, according to the base score benchmarks respectively corresponding to the at least two second users, a second user whose difference from the base score benchmark corresponding to the first user is smaller than the predetermined base score benchmark difference threshold may be selected from the at least two second users.

The user selects the second condition, which is a queue selection condition preset by the attribute of 'waiting time of the user corresponding to the user'.

In one embodiment, the user queue selecting the third condition includes: the waiting time of the user corresponding to the user is greater than the preset time threshold.

That is to say, when there are at least two second users available for selection, according to the waiting durations of the users corresponding to the at least two second users, the second user whose waiting duration of the user corresponding to the first user is greater than the predetermined time threshold may be selected from the at least two second users.

The second user with the waiting time of the corresponding user being greater than the preset time difference threshold value is selected, so that the second user with the longer waiting time of the corresponding user can be selected as much as possible when the user is selected, on one hand, the second user with the longer waiting time of the corresponding user for each table group can be selected and combined as soon as possible, and the waiting time of the part of users is shortened. Of course, in the embodiment of the present invention, after the target second user queue is selected, the second user may also be directly selected randomly from the selected target second user queue.

In the foregoing step, taking the first game as a classic landlord game as an example, a specific implementation manner of adding the second user information corresponding to the selected second user into the first user queue may include:

if it is assumed that: and if the first user queue has a top level field user X with the base score of 1000, the second users selected from the target second user queue are high level field users Y with the base score of 400 and medium level field users Z with the base score of 150 respectively, adding the second user information corresponding to Y, Z into the first user queue, and at this time, the first user queue stores user information corresponding to X, Y, Z.

On the other hand, the user information corresponding to Y, Z may be deleted from the target second user queue.

And step 14, the game server executes the table grouping operation on the users corresponding to the information of the users in the first user queue according to the number of the table grouping users required by the first game.

Following the example in step 13, if the first game is the classic floor main game and the number of table group users required for the first game is 3, then when the user information corresponding to the user X with the base score of 1000, the user information corresponding to the user Y with the base score of 400, and the user information corresponding to the user Z with the base score of 150 exist in the first user queue, according to the number of table group users 3 required for the first game, the table group operation for the users corresponding to the user information in the first user queue may be performed, for example, the users X, Y and Z are combined into one table for playing the game.

It should be noted that, although the table grouping operation may be performed on the users corresponding to the information of the users in the first user queue when the number of table grouping users required by the first game exists in the first user queue, in order to avoid this problem, in the embodiment of the present invention, before step 14 is performed, it may be monitored whether the total number of users corresponding to the information of the users stored in the first user queue is greater than a predetermined number threshold value, because, when the number of users corresponding to the first user queue is too small and the table grouping operation needs to be performed again after one game is completed, in a case that the number of users is too small, it is likely that the same user forms a table again to play the game when the game is completed, and generally, the user is more likely to group a table with a different player when the game is resumed. If the total number is monitored to be greater than the predetermined number threshold, step 14 is executed, otherwise, the monitoring can be continued. The predetermined number threshold may be an integer multiple of the number of table group persons required for the first game. The predetermined number threshold may be set according to actual requirements, and the specific size of the predetermined number threshold is not limited in the embodiment of the present invention.

By adopting the method provided by the embodiment of the invention, the information of the users can be acquired from the second user queue corresponding to the second game and added into the first user queue corresponding to the first game, so that the operation of 'number-collecting' is performed on the users corresponding to the first user queue, the users corresponding to the first user queue added with the user information can successfully group the table as soon as possible, and the problem that the users corresponding to the first user queue have a small number of people and are difficult to form the table, and the table can be successfully grouped after waiting for a long time is solved.

In view of the same inventive concept as the method provided in embodiment 1 of the present invention, in order to solve the problem that the table grouping can be successfully completed after waiting for too long time when a game is requested in the prior art, an embodiment of the present invention further provides an apparatus 20 for game table grouping, where a specific structural schematic diagram of the apparatus 20 is shown in fig. 2, and the apparatus includes a monitoring unit 21, an information processing unit 22, and a table grouping unit 23. The functions of the units are as follows:

the monitoring unit 21 is configured to monitor whether a first user of the table to be grouped exists in the first user queue; the first user queue is used for storing information of users waiting for playing a first game; the users waiting for the first game have the same first level characteristics;

the information processing unit 22 is configured to, if it is monitored that a first user of the table to be grouped exists in the first user queue, obtain information of at least one second user from a target second user queue, and join the information into the first user queue; the target second user queue is used for storing information of users waiting for playing a second game; the users waiting for the second game have the same second level characteristics; the first game and the second game are the same game;

and the group table unit 23 is configured to perform a group table operation on the user corresponding to the first user queue to which the information of the second user is added.

Optionally, the first level characteristic is different from the second level characteristic.

Optionally, the first ranking characteristic comprises a base score benchmark of the first game; the second level features comprise base scores for a second game;

the base score reference of the second game is lower than the base score reference of the first game.

Optionally, the information processing unit 22 may be specifically configured to: when at least two target second user queues exist, selecting a target second user queue meeting a preset user queue selection condition from the at least two target second user queues; and acquiring information of at least one second user from the selected target second user queue, and adding the information into the first user queue.

Optionally, the predetermined user queue selection condition includes at least one of the following conditions:

the total number of corresponding users meets a first condition for selecting a predetermined user queue;

the average grade of the corresponding user meets a second condition selected by a preset user queue;

the corresponding base score reference of the second game meets a preset user queue selection third condition;

and the average waiting time of the corresponding user meets the fourth condition of the selection of the predetermined user queue.

Optionally, the table grouping unit 23 is specifically configured to, if it is monitored that the total number of users respectively corresponding to the information of the users stored in the first user queue is greater than a predetermined number threshold, perform table grouping operation on the users corresponding to the information of the users in the first user queue according to the number of table grouping people required by the first game.

By adopting the device 20 provided by the embodiment of the invention, the information of the users can be acquired from the second user queue corresponding to the second game and added into the first user queue corresponding to the first game, so that the operation of 'number matching' is performed on the users corresponding to the first user queue, the users corresponding to the first user queue added with the user information can successfully group the table as soon as possible, and the problem that the users corresponding to the first user queue have a small number of users and are difficult to form the table, and the table can be successfully grouped after waiting for a long time is solved.

Example 2

If the first user and the second user perform the group table in the above manner, a game point calculation method is involved.

The following describes in detail a game point calculation scheme of a game table assembling method according to an embodiment of the present invention by describing embodiment 2.

First, a game point calculation method according to an embodiment of the present invention will be described.

Referring to fig. 3, a flowchart of an implementation of the game point calculating method according to the embodiment of the present invention mainly includes the following steps:

step 31: determining a corresponding background cumulative change coefficient (called a second coefficient of point cumulative change for distinguishing description) of a user corresponding to the acquired information of the at least one second user in the process of playing the first game;

here, the acquired information of the second user is information of the second user acquired from the target second user queue selected by performing step 12 and added to the first user queue.

The cumulative coefficient of change of the base score may be, for example, a multiple of doubling the base score reference determined according to the number of bombs (four cards with the same value), rockets (double king), and the like occurring in the course of the field fighter game.

Step 32: and determining a first game point based on the second coefficient of the accumulated change of the base points and the base point reference of the second game, wherein the first game point is used as a point for updating the balance of the user point account point corresponding to the information of the at least one second user.

For example, if the second game is a 400 landlord high-level field, the second coefficient of cumulative variation of the base points generated by the user (which may be referred to as a second user) corresponding to the information of the at least one second user during the game is 3, and if the user wins the identity of the "farmer" in the current round of game, the first score of the game of the second user in the current round is 1200. After the first integral of the game is calculated, the integral balance of the user integral account of the second user can be changed by utilizing the first integral of the game.

It should be noted that, if the first user performs the table game with the user corresponding to the information of the at least one second user in step 31, in order to ensure the game experience of the first user, so that the first user does not know that the first user plays the table game with the second user at a different level, the game score (referred to as a second game score) may be calculated based on the second coefficient of the cumulative change of the base score and the base score reference of the first game, and is used as the user score of the user corresponding to the information of the at least one second user displayed on the game interface of the first user.

Specifically, if the first game is the top field of the main fighting field with the base score of 1000, the second game is the top field of the main fighting field with the base score of 400, and the base score is cumulatively changed by the second coefficient of 6, if the second user wins the game as a "farmer", the second score of the game may be calculated as 1000 × 6 — 6000, and the second user is the user score of the user corresponding to the information of the at least one second user displayed on the game interface of the first user, so that the first user is also the top field of the main fighting field with the base score of 1000 when the first user is played.

And in analogy, the game interface of the second user also displays a third credit, wherein the third credit is used as the user credit of the first user displayed on the game interface of the second user. In the above example, if the first user has failed to take one game as the "landowner" and the corresponding base point cumulative change coefficient (referred to as the base point cumulative change first coefficient) is 12, the base point reference 400 of the second game is 4800 with the third point of 12, and the user points of the first user displayed on the game interface of the second user may be calculated so that the second user may be the first user who is also playing the top field of the battle ground with the base point reference of 400.

It can be known from the above flow that, by adopting the scheme provided by the embodiment of the present invention, two kinds of credits can be respectively displayed on the game interfaces of the first user and the second user, and the first user and the second user can not respectively perceive the user games at different levels.

To solve the problem of game point calculation, an embodiment of the present invention provides a game point calculation device 40, and a specific structural diagram of the device 40 is shown in fig. 4, and includes an information processing unit 41 and a point calculation unit 42. The functions of the units are as follows:

the information processing unit 41 is configured to determine a second coefficient of cumulative variation of the base points corresponding to the obtained information of the at least one second user in the process of playing the first game;

and the point calculating unit 42 is configured to determine a game first point based on the second coefficient of the cumulative change of the base points and the base point reference of the second game, and use the game first point as a point for updating the point balance of the user point account corresponding to the at least one piece of second user information.

Optionally, if the first user and the user corresponding to the at least one second user's information perform a table game, the point calculating unit 42 may further be configured to:

determining a second game point based on the second base point accumulative change coefficient and the base point benchmark of the first game, wherein the second game point is used as the user point of the user corresponding to the information of the at least one second user and displayed on the game interface of the first user;

and determining a third score of the game as the user score of the first user displayed on the game interface of the second user based on the base point accumulated change first coefficient and the base point reference of the second game.

And the base point accumulated change first coefficient is a base point accumulated change coefficient corresponding to the first user in the process of playing the first game.

Example 3

Fig. 5 is a schematic diagram of a hardware structure of a mobile terminal for implementing various embodiments of the present invention, where the mobile terminal 500 includes, but is not limited to: a radio frequency unit 501, a network module 502, an audio output unit 503, an input unit 504, a sensor 505, a display unit 506, a user input unit 507, an interface unit 508, a memory 509, a processor 510, and a power supply 511. Those skilled in the art will appreciate that the mobile terminal architecture shown in fig. 5 is not intended to be limiting of mobile terminals, and that a mobile terminal may include more or fewer components than shown, or some components may be combined, or a different arrangement of components. In the embodiment of the present invention, the mobile terminal includes, but is not limited to, a mobile phone, a tablet computer, a notebook computer, a palm computer, a vehicle-mounted terminal, a wearable device, a pedometer, and the like.

Wherein, the processor 510 is coupled to the memory, and configured to monitor whether a first user of the table to be grouped exists in the first user queue; the first user queue is used for storing information of users waiting for playing a first game; the users waiting for the first game have the same first level characteristics; if the first user of the table to be grouped exists in the first user queue, acquiring information of at least one second user from a target second user queue, and adding the information into the first user queue; the target second user queue is used for storing information of users waiting for playing a second game; the users waiting for the second game have the same second level characteristics; the first game and the second game are the same game; and performing table group operation on the users corresponding to the first user queue which join the information of the second user. Of course, the method can also be used for determining a second coefficient of the cumulative variation of the base points corresponding to the obtained information of the at least one second user in the process of playing the first game; and determining a first game point based on the second coefficient of the accumulated change of the base points and the base point reference of the second game, wherein the first game point is used as a point for updating the balance of the user point account point corresponding to the information of the at least one second user.

A memory 509 for storing a computer program operable on the processor 510, the computer program, when executed by the processor 510, implementing the above-described functionality implemented by the processor 510.

It should be understood that, in the embodiment of the present invention, the radio frequency unit 501 may be used for receiving and sending signals during a message sending and receiving process or a call process, and specifically, receives downlink data from a base station and then processes the received downlink data to the processor 510; in addition, the uplink data is transmitted to the base station. In general, radio frequency unit 501 includes, but is not limited to, an antenna, at least one amplifier, a transceiver, a coupler, a low noise amplifier, a duplexer, and the like. In addition, the radio frequency unit 501 can also communicate with a network and other devices through a wireless communication system.

The mobile terminal provides the user with wireless broadband internet access through the network module 502, such as helping the user send and receive e-mails, browse webpages, access streaming media, and the like.

The audio output unit 503 may convert audio data received by the radio frequency unit 501 or the network module 502 or stored in the memory 509 into an audio signal and output as sound. Also, the audio output unit 503 may also provide audio output related to a specific function performed by the mobile terminal 500 (e.g., a call signal reception sound, a message reception sound, etc.). The audio output unit 503 includes a speaker, a buzzer, a receiver, and the like.

The input unit 504 is used to receive an audio or video signal. The input Unit 504 may include a Graphics Processing Unit (GPU) 5041 and a microphone 5042, and the Graphics processor 5041 processes image data of a still picture or video obtained by an image capturing device (e.g., a camera) in a video capturing mode or an image capturing mode. The processed image frames may be displayed on the display unit 506. The image frames processed by the graphic processor 5041 may be stored in the memory 509 (or other storage medium) or transmitted via the radio frequency unit 501 or the network module 502. The microphone 5042 may receive sounds and may be capable of processing such sounds into audio data. The processed audio data may be converted into a format output transmittable to a mobile communication base station via the radio frequency unit 501 in case of the phone call mode.

The mobile terminal 500 also includes at least one sensor 505, such as a light sensor, motion sensor, and other sensors. Specifically, the light sensor includes an ambient light sensor that adjusts the brightness of the display panel 5061 according to the brightness of ambient light, and a proximity sensor that turns off the display panel 5061 and/or a backlight when the mobile terminal 500 is moved to the ear. As one of the motion sensors, the accelerometer sensor can detect the magnitude of acceleration in each direction (generally three axes), detect the magnitude and direction of gravity when stationary, and can be used to identify the posture of the mobile terminal (such as horizontal and vertical screen switching, related games, magnetometer posture calibration), and vibration identification related functions (such as pedometer, tapping); the sensors 505 may also include fingerprint sensors, pressure sensors, iris sensors, molecular sensors, gyroscopes, barometers, hygrometers, thermometers, infrared sensors, etc., which are not described in detail herein.

The display unit 506 is used to display information input by the user or information provided to the user. The Display unit 506 may include a Display panel 5061, and the Display panel 5061 may be configured in the form of a Liquid Crystal Display (LCD), an Organic Light-Emitting Diode (OLED), or the like.

The user input unit 507 may be used to receive input numeric or character information and generate key signal inputs related to user settings and function control of the mobile terminal. Specifically, the user input unit 507 includes a touch panel 5071 and other input devices 5072. Touch panel 5071, also referred to as a touch screen, may collect touch operations by a user on or near it (e.g., operations by a user on or near touch panel 5071 using a finger, stylus, or any suitable object or attachment). The touch panel 5071 may include two parts of a touch detection device and a touch controller. The touch detection device detects the touch direction of a user, detects a signal brought by touch operation and transmits the signal to the touch controller; the touch controller receives touch information from the touch sensing device, converts the touch information into touch point coordinates, sends the touch point coordinates to the processor 510, and receives and executes commands sent by the processor 510. In addition, the touch panel 5071 may be implemented in various types such as a resistive type, a capacitive type, an infrared ray, and a surface acoustic wave. In addition to the touch panel 5071, the user input unit 507 may include other input devices 5072. In particular, other input devices 5072 may include, but are not limited to, a physical keyboard, function keys (e.g., volume control keys, switch keys, etc.), a trackball, a mouse, and a joystick, which are not described in detail herein.

Further, the touch panel 5071 may be overlaid on the display panel 5061, and when the touch panel 5071 detects a touch operation thereon or nearby, the touch operation is transmitted to the processor 510 to determine the type of the touch event, and then the processor 510 provides a corresponding visual output on the display panel 5061 according to the type of the touch event. Although in fig. 5, the touch panel 5071 and the display panel 5061 are two independent components to implement the input and output functions of the mobile terminal, in some embodiments, the touch panel 5071 and the display panel 5061 may be integrated to implement the input and output functions of the mobile terminal, and is not limited herein.

The interface unit 508 is an interface through which an external device is connected to the mobile terminal 500. For example, the external device may include a wired or wireless headset port, an external power supply (or battery charger) port, a wired or wireless data port, a memory card port, a port for connecting a device having an identification module, an audio input/output (I/O) port, a video I/O port, an earphone port, and the like. The interface unit 508 may be used to receive input (e.g., data information, power, etc.) from external devices and transmit the received input to one or more elements within the mobile terminal 500 or may be used to transmit data between the mobile terminal 500 and external devices.

The memory 509 may be used to store software programs as well as various data. The memory 509 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required by at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data, a phonebook, etc.) created according to the use of the cellular phone, and the like. Further, the memory 509 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid-state storage device.

The processor 510 is a control center of the mobile terminal, connects various parts of the entire mobile terminal using various interfaces and lines, and performs various functions of the mobile terminal and processes data by operating or executing software programs and/or modules stored in the memory 509 and calling data stored in the memory 509, thereby performing overall monitoring of the mobile terminal. Processor 510 may include one or more processing units; preferably, the processor 510 may integrate an application processor, which mainly handles operating systems, user interfaces, application programs, etc., and a modem processor, which mainly handles wireless communications. It will be appreciated that the modem processor described above may not be integrated into processor 510.

The mobile terminal 500 may further include a power supply 511 (e.g., a battery) for supplying power to various components, and preferably, the power supply 511 may be logically connected to the processor 510 via a power management system, so that functions of managing charging, discharging, and power consumption are performed via the power management system.

In addition, the mobile terminal 500 includes some functional modules that are not shown, and thus, are not described in detail herein.

Preferably, an embodiment of the present invention further provides a mobile terminal, which includes a processor 510, a memory 509, and a computer program that is stored in the memory 509 and can be run on the processor 510, and when the computer program is executed by the processor 510, the processes of the above-mentioned message display method embodiment are implemented, and the same technical effect can be achieved, and in order to avoid repetition, details are not described here again.

The embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements each process of the above-mentioned game table combining method or game point calculating method embodiment, and can achieve the same technical effect, and is not described herein again to avoid repetition. The computer-readable storage medium may be a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk.

As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.

Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.

It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

The above description is only an example of the present invention, and is not intended to limit the present invention. Various modifications and alterations to this invention will become apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the scope of the claims of the present invention.

Claims

1. A method of game table assembly, comprising:

2. The method of claim 1, wherein:

the first level characteristic is different from the second level characteristic.

3. The method of claim 2, wherein the first ranking characteristic comprises a base score benchmark for the first game; the second level features comprise base scores for a second game;

4. The method of claim 1, wherein when there are at least two target second user queues, obtaining information of at least one second user from the target second user queues to join the first user queue, comprises:

selecting a target second user queue meeting a preset user queue selection condition from the at least two target second user queues;

and acquiring information of at least one second user from the selected target second user queue, and adding the information into the first user queue.

5. The method of claim 1, wherein the predetermined user queue selection condition comprises at least one of:

6. The method of claim 1, wherein performing a table-grouping operation for users corresponding to the user information in the first user queue based on the required number of table-grouping people for the first game comprises:

and if the monitored total number of the users respectively corresponding to the information of the users stored in the first user queue is greater than a preset number threshold, performing table grouping operation on the users corresponding to the information of the users in the first user queue according to the required table grouping number of the users in the first game.

7. A game point calculation method of the game group table method according to claim 1, wherein the game point calculation method comprises:

8. The method of claim 7, wherein if the first user plays a group table game with the user corresponding to the at least one second user's information; the method further comprises:

determining a third score of the game as the user score of the first user displayed on the game interface of the second user based on the first coefficient of cumulative variation of the base scores and the base score reference of the second game;

9. A gaming table assembly, comprising:

10. The apparatus of claim 9, wherein:

11. The apparatus of claim 10, wherein the first ranking characteristic comprises a base score reference for a first game; the second level features comprise base scores for a second game;

12. The apparatus as claimed in claim 9, wherein said information processing unit is specifically configured to:

when at least two target second user queues exist, selecting a target second user queue meeting a preset user queue selection condition from the at least two target second user queues;

13. The apparatus of claim 12, wherein the predetermined user queue selection condition comprises at least one of:

14. A game point calculation apparatus, comprising:

15. A smart device, the device comprising:

a memory for storing computer program instructions;

a processor, coupled to the memory, for reading the computer program instructions stored by the memory and in response performing the game group table method of any of claims 1 to 6 or performing the game credit calculation method of claim 7 or 8.