CN111659126A

CN111659126A - Distribution method, device, server, terminal and storage medium of matching process

Info

Publication number: CN111659126A
Application number: CN202010653029.5A
Authority: CN
Inventors: 成贤斌
Original assignee: Tencent Technology Shenzhen Co Ltd
Current assignee: Tencent Technology Shenzhen Co Ltd
Priority date: 2020-07-08
Filing date: 2020-07-08
Publication date: 2020-09-15
Anticipated expiration: 2040-07-08
Also published as: CN111659126B

Abstract

The embodiment of the application provides a matching process distribution method, a matching process distribution device, a server, a terminal and a storage medium, and relates to the technical field of computers. The method comprises the following steps: receiving office matching requests from n user accounts, wherein the office matching requests are used for requesting office matching distribution of the user accounts, and n is a positive integer; acquiring capability information corresponding to the n user accounts respectively, wherein the capability information is used for indicating the competitive capacity of the user accounts; sorting the n user accounts according to the capability information corresponding to the n user accounts respectively; and sequentially distributing the n user accounts to at least one matching process according to the sorting result of the n user accounts, wherein the matching process is used for carrying out office matching distribution on the user accounts in the same matching process. The technical scheme provided by the embodiment of the application can improve the fairness of the game.

Description

Distribution method, device, server, terminal and storage medium of matching process

Technical Field

The embodiment of the application relates to the technical field of computers, in particular to a matching process distribution method, a matching process distribution device, a server, a terminal and a storage medium.

Background

In some multiplayer online competitive games, multiple user accounts need to be distributed into multiple matching processes, and each matching process is used for carrying out game-match distribution on the multiple user accounts distributed into the matching process.

In the related technology, when a plurality of user accounts need to be distributed to different matching processes, the first N user accounts are distributed to one matching process according to the time sequence of sending matching requests by a client; and then distributing the first N user accounts in the rest user accounts to another matching process, and distributing the user accounts to the corresponding matching process in the same way, wherein N is a positive integer.

In the related art, the user accounts are allocated to the corresponding matching processes only according to the time sequence of the requests, so that the allocation of the matching processes is unreasonable, and the fairness of the office is reduced.

Disclosure of Invention

The embodiment of the application provides a matching process distribution method, a matching process distribution device, a server, a terminal and a storage medium, which can improve the distribution rationality of a matching process and improve the fairness of a game. The technical scheme is as follows:

in one aspect, an embodiment of the present application provides a method for allocating a matching process, where the method includes:

receiving a matching request from n user accounts for matching bureaus, wherein the matching request is used for requesting to distribute the bureaus to the user accounts, and n is a positive integer;

acquiring capability information corresponding to the n user accounts respectively, wherein the capability information is used for indicating competitive capacity of the user accounts;

sorting the n user accounts according to the capability information corresponding to the n user accounts respectively;

and according to the sorting result of the n user accounts, sequentially distributing the n user accounts to at least one matching process, wherein the matching process is used for carrying out office matching distribution on the user accounts in the same matching process.

On the other hand, the embodiment of the application provides a method for displaying the result of the distribution of the game, which comprises the following steps:

displaying a match participation interface, wherein the match participation interface comprises a match matching operation control;

responding to a trigger signal which is received for the game matching operation control, and sending a game matching request to a server, wherein the game matching request comprises a target user account and capacity information corresponding to the target user account, and the capacity information is used for indicating the competitive capacity of the target user account;

receiving a game-matching distribution result from the server, wherein the game-matching distribution result is used for indicating the game to which the target user account is distributed;

and displaying the game distribution result in a game distribution result display interface.

In another aspect, an embodiment of the present application provides an apparatus for allocating a matching process, where the apparatus includes:

a request receiving module, configured to receive a matching request for matching bureaus from n user accounts, where the matching request for matching bureaus is used to request that the user accounts be allocated for matching bureaus, and n is a positive integer;

the information acquisition module is used for acquiring capability information corresponding to the n user accounts respectively, and the capability information is used for indicating the competitive power of the user accounts;

the account sorting module is used for sorting the n user accounts according to the capability information corresponding to the n user accounts respectively;

and the process distribution module is used for distributing the n user accounts to at least one matching process in sequence according to the sorting result of the n user accounts, and the matching process is used for carrying out office matching distribution on the user accounts in the same matching process.

On the other hand, the embodiment of the present application provides a device for displaying the result of office allocation, the device includes:

the interface display module is used for displaying a game-matching participation interface, and the game-matching participation interface comprises a game-matching operation control;

the request sending module is used for responding to a trigger signal which is received for the game matching operation control and sending a game matching request to a server, wherein the game matching request comprises a target user account and capacity information corresponding to the target user account, and the capacity information is used for indicating the competitive capacity of the target user account;

a result receiving module, configured to receive a result of office allocation from the server, where the result of office allocation is used to indicate the office to which the target user account is allocated;

and the result display module is used for displaying the game distribution result in a game distribution result display interface.

In still another aspect, an embodiment of the present application provides a server, where the server includes a processor and a memory, where the memory stores at least one instruction, at least one program, a code set, or a set of instructions, and the at least one instruction, the at least one program, the code set, or the set of instructions is loaded and executed by the processor to implement the allocation method of the matching process on the server side.

In another aspect, an embodiment of the present application provides a terminal, where the terminal includes a processor and a memory, where the memory stores at least one instruction, at least one program, a code set, or an instruction set, and the at least one instruction, the at least one program, the code set, or the instruction set is loaded and executed by the processor to implement the method for showing the result of the assignment to the bureau at the terminal side.

In a further aspect, an embodiment of the present application provides a computer-readable storage medium, where at least one instruction, at least one program, a code set, or an instruction set is stored in the computer-readable storage medium, and the at least one instruction, the at least one program, the code set, or the instruction set is loaded and executed by a processor to implement the allocation method of the matching process on the server side, or to implement the method for displaying the result of the office allocation on the terminal side.

According to an aspect of the application, a computer program product or a computer program is provided, comprising computer instructions, which are stored in a computer readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium, and executes the computer instructions to cause the computer device to perform the methods provided in the various alternative implementations of one aspect or the other aspect described above or to perform the methods provided in the various alternative implementations of the other aspect or the other aspect described above.

The technical scheme provided by the embodiment of the application can have the following beneficial effects:

the competitive power corresponding to the user account is used as the basis for distributing the matching process, the n user accounts are sorted according to the capacity information corresponding to the n user accounts respectively, the sorting result obtained by the n user accounts according to the competitive power corresponding to the n user accounts is obtained, and the n user accounts are distributed into the corresponding matching process according to the sorting sequence of the competitive power corresponding to the n user accounts, so that the difference of the competitive power between the user accounts distributed into the same matching process is reduced as much as possible, the distribution rationality of the matching process is improved, and the fairness of the game is improved.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

FIG. 1 is a schematic illustration of an implementation environment provided by one embodiment of the present application;

FIG. 2 is a flow chart of a method for allocating a matching process according to an embodiment of the present application;

FIG. 3 is a schematic diagram illustrating a distribution of skill competition forces for a user account according to an embodiment of the present application;

FIG. 4 is a flow chart of a method for assigning a matching process according to another embodiment of the present application;

FIG. 5 is a diagram illustrating a method for allocating a matching process according to an embodiment of the present application;

FIG. 6 is a flow chart of a method for assigning a matching process according to another embodiment of the present application;

FIG. 7 is a flowchart of a method for presenting the result of office allocation according to another embodiment of the present application;

FIG. 8 is a schematic illustration of a session participation interface provided by one embodiment of the present application;

FIG. 9 is a diagram of a match-to-match-wait interface provided by one embodiment of the present application;

FIG. 10 is a schematic diagram of a game assignment result presentation interface provided in accordance with an embodiment of the present application;

FIG. 11 is a block diagram of an apparatus for distributing a matching process according to an embodiment of the present application;

FIG. 12 is a block diagram of an apparatus for distributing a matching process according to another embodiment of the present application;

FIG. 13 is a block diagram of a device for presenting the result of office assignment provided in another embodiment of the present application;

FIG. 14 is a block diagram of a server according to an embodiment of the present application;

fig. 15 is a block diagram of a terminal according to an embodiment of the present application.

Detailed Description

Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of methods consistent with aspects of the present application, as detailed in the appended claims.

Referring to fig. 1, a schematic diagram of an implementation environment that can be implemented as a distribution system for matching processes is shown according to an embodiment of the present application. Optionally, as shown in fig. 1, the distribution system 10 of the matching process includes: a server 11 and a terminal 12.

The server 11 is an electronic device with data computing, processing and storage capabilities. The server 11 may be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server providing cloud computing services. A server cluster is a system of servers that work together to perform computing work with a high degree of closeness by connecting together a set of loosely inherited computer software or hardware. In the method provided by the embodiment of the present application, the execution subject of each step at the server side may be the server 11.

The terminal 12 is a terminal used by a user. The terminal 12 may be, for example, a smartphone, a tablet, a PC (Personal Computer), a wearable device, or the like. The terminal 12 has a target application installed and running therein, such as a client of the target application, and a user account is logged in the client. A communication connection (e.g., a network connection) is established between the terminal 12 and the server 11, and the server 11 provides a background service for the target application. In some embodiments, the target application is a game application, such as a MOBA (Multiplayer Online Battle Arena) game application, a shooting game application, a multi-player gunfight survival game application, and a big-fleeing survival game application, which is not limited in this embodiment. Of course, in some other examples, the target application may also be other applications besides the game application, such as any application provided with an assignment function of a matching process and an assignment function of a game, for example, a social application, a shopping application, a payment application, a video application, a music application, a news application, and the like, which is not limited in this embodiment. In some embodiments, the target application may be a native application or a sub-application, which is not limited in this application embodiment. A native application is an application that can run directly on the operating system, and a child application is an application that runs dependent on the parent application. The sub-application can be called as an applet, which cannot run independently but can be used without downloading and installation. The user can directly open the sub-application program by scanning the graphic code (such as two-dimensional code, bar code and the like) corresponding to the sub-application program or searching the name or related vocabulary entry of the sub-application program. The child application can be conveniently acquired and propagated in the parent application. The parent application is an application for bearing the child applications, and provides an operating environment for the child applications. Optionally, the parent application is a native application. The parent application may be a social application, a dedicated application that specifically supports the child applications, a file management application, a mail application, or a gaming application, among others. The Social application program includes an instant messaging application, an SNS (Social Network Service) application, or a live application. Optionally, the distribution system 10 of matching processes further comprises a server 11. In some embodiments, the terminal 12 can receive the matching request and send the matching request to the server 11, and the server 11 allocates the corresponding user account to each matching process according to the received matching request. In the method provided by the embodiment of the present application, the execution subject of each step at the terminal side may be the terminal 12 (e.g., a client of a target application program in the terminal 12).

The technical solution of the present application will be described below by means of several embodiments.

Referring to fig. 2, a flowchart of an allocation method of a matching process according to an embodiment of the present application is shown. The method comprises the following steps (201-204):

step 201, receiving a match request from n user accounts.

Optionally, the office matching request is used to request office matching allocation for the user account, where n is a positive integer. The game play distribution means that the user account is distributed to corresponding game plays, such as game play. In some embodiments, the local match requests for n user accounts are from n clients. Each office includes at least two user accounts, and the user accounts in the same office have competition relationship or cooperation relationship.

In some embodiments, the n user accounts include user accounts for which the sending time of the office match request belongs to the target time period. The matching request carries sending time information (such as a timestamp) used for indicating the sending time of the matching request. Optionally, the target time period is a time at or before a first specified time, and if the received match information is sent at or before the first specified time, the user account corresponding to the match information belongs to the n user accounts. If the received match information of the game is sent after the first appointed time, the user account corresponding to the match information of the game does not belong to the n user accounts; after the n user accounts are distributed to the corresponding matching processes, the corresponding matching processes are distributed to the user accounts corresponding to the pair of office matching information. The first designated time is set by a related technician according to actual conditions, and the embodiment of the present application is not limited thereto.

In other embodiments, the n user accounts include the user account whose sending time of the office matching request belongs to the target time period. The server records receiving time information corresponding to the match request of the opposite station, and the receiving time information is used for indicating the receiving time of the match request of the opposite station. Optionally, the target time period is a time before a second specified time or a second specified time, and if the match information is received before the second specified time or the second specified time, the user account corresponding to the match information belongs to the n user accounts. If the match information of the game is received after the second designated time, the user account corresponding to the match information of the game does not belong to the n user accounts; after the n user accounts are distributed to the corresponding matching processes, the corresponding matching processes are distributed to the user accounts corresponding to the pair of office matching information. The second designated time is set by a related technician according to actual conditions, and the embodiment of the present application is not limited thereto.

Step 202, acquiring capability information corresponding to the n user accounts respectively.

Optionally, the capability information is used to indicate the athletic capabilities that the user account has. In some embodiments, the local alignment matching request carries a corresponding user account and capability information corresponding to the user account, and the server obtains the corresponding capability information by analyzing the local alignment matching request. In other embodiments, the local matching request carries a corresponding user account, and the server can query the capability information corresponding to the user account from a storage unit (e.g., a database) according to the user account. In the game play of the competitive game, the competitive power may be used to indicate the ability of the corresponding user account to defeat other user accounts or enemy teams in the same game play, may also be used to indicate the ability of the corresponding user account to complete a specified game task, and may also be used to indicate the ability of the corresponding user account to obtain a game award, which is not limited in the embodiment of the present application.

In some embodiments, the capability information includes at least one of: general account grade, special account grade under appointed game mode, payment grade, prop quantity and prop attribute.

Optionally, the general account level is used to indicate the overall game level of the user account in various game modes, the general account level is obtained by integrating game conditions of the user account in various game modes according to the level evaluation rule of the target application program, and the general account level may also be referred to as a segment level. Each of the universal account levels may be numbered, such as level 1, level 2, level 3, level 4, and so forth. Each of the universal account number levels may also be represented by a code, such as bronze, silver, gold, diamond, and the like. Each level in the universal account number levels may also be represented in other manners, which is not limited in this embodiment of the application. Optionally, each level may be further classified, for example, level 1 may be classified into level 1 star, level 2 star, level 1 star, level 3 star, level 1 star, level 4 star, etc.; for another example, the silver grade may be divided into silver 1 segment, silver 2 segment, silver 3 segment, etc., which is not limited in the embodiments of the present application.

Optionally, the target application includes a plurality of game modes, and the user's competitive ability in different game modes may be different. The special account grade in the appointed game mode is used for indicating the game level of the user account in the appointed game mode, the special account grade in the appointed game mode is obtained by integrating game conditions of the user account in the appointed game mode according to grade evaluation rules of a target application program, and the special account grade in the appointed game mode can also be called a special segment level in the appointed game mode. The representation manner of the special account level in the designated office mode can refer to the representation manner of the general account level, and is not described herein again.

Optionally, the payment rating is used to indicate the payment capability of the user account. The payment grade is obtained by integrating the historical payment condition of the user account and the balance of the user account according to the payment grade evaluation rule. In some embodiments, the target application is a game application, and the user can increase the competitive power corresponding to the user account by paying, such as purchasing more items by paying, purchasing items with higher attributes by paying, increasing attributes of the items by paying, acquiring more game task time by paying, paying to reduce game task difficulty, acquiring game prompt information by paying, and the like, and can also acquire competitive advantages by paying in other manners, which is not limited in this embodiment of the present application. In some embodiments, the fee paid for the user account may be in real currency. In other embodiments, the fee paid for the user account may also be a virtual currency in the target application, such as a virtual gold coin, a virtual diamond, and so forth. The user can obtain the virtual currency by completing the game task, and can also obtain the virtual currency by recharging.

Step 203, sorting the n user accounts according to the capability information corresponding to the n user accounts respectively.

In some embodiments, after the capability information corresponding to the n user accounts is obtained, the n user accounts are sorted in a descending order (i.e., from high to low) or an ascending order (i.e., from low to high) according to the corresponding athletic capabilities, so as to obtain a sorting result of the n user accounts. Alternatively, as shown in fig. 3, the athletic ability is divided into different levels 31, and the number of distributions of the n user accounts in each level 31 of the athletic ability is not the same. The user accounts with the corresponding athletic ability at the same level can be sorted out of order, so that the sorting pressure of the server is reduced, and the processing resources of the server are saved.

And step 204, sequentially distributing the n user accounts to at least one matching process according to the sorting result of the n user accounts.

In some embodiments, the user accounts allocated to each matching process are determined according to the sorting order of the n user accounts and the carrying capacity of the single matching process, and the n user accounts are allocated to each matching process. The matching process is used for carrying out office matching distribution on the user accounts in the same matching process. The carrying capacity of a single matching process refers to the maximum number of user accounts that can be processed by the single matching process when the office is distributed.

In some embodiments, the server performs load balancing technology to distribute the overall process of office allocation to a plurality of operation units (such as a plurality of processes, a plurality of servers, etc.) for execution when receiving office matching requests from a plurality of user accounts. Due to the large number of received local matching requests, a large processing pressure is generated if the local matching requests are completely processed by one operation unit. In the embodiment of the application, the process of distributing n user accounts to each office by the server is divided into a transfer process and a plurality of matching processes. The transfer process distributes the user accounts to each matching process according to the office matching requests from the n user accounts, and then each matching process carries out office matching distribution on the user accounts distributed to the transfer process. The transfer process only needs to roughly distribute the n user accounts according to the competitive capacity of the user accounts and the bearing capacity of the matching process, and then the matching process distributes the user accounts to specific game. On one hand, because the number of the user accounts required to be distributed by a single matching process is within the bearing capacity range of the single matching process, errors or breakdown of the matching process due to overlarge processing data amount can be avoided; on the other hand, because the matching processes are independent and do not influence each other, when one matching process has an error, the opposite distribution of the user accounts in other matching processes is not influenced, and the error probability of the opposite distribution is reduced. The method provided by the embodiment of the application mainly improves the process of distributing the user account to the matching process (namely, the transfer process).

To sum up, in the technical solution provided in this application, the competitive power corresponding to the user account is used as a basis for allocating the matching process, the n user accounts are sorted according to the capability information corresponding to the n user accounts, so as to obtain a sorting result obtained by the n user accounts according to the level of the competitive power, and the n user accounts are allocated to the corresponding matching process according to the sorting order of the competitive power corresponding to the n user accounts, thereby reducing the difference in competitive power between the user accounts allocated to the same matching process as much as possible, improving the allocation rationality of the matching process, and improving the fairness of the game.

In the embodiment of the application, the n user accounts comprise the user accounts of which the sending time or the receiving time of the match request belongs to the target time period, and the value of n is ensured not to be too small as much as possible, so that the difference of the competitive capacities corresponding to the user accounts in the same match process is reduced as much as possible, the probability of overlarge difference of the competitive capacities corresponding to the user accounts distributed to the same match is further reduced, and the fairness of the match is improved.

Referring to fig. 4, a flowchart of an allocation method of a matching process according to another embodiment of the present application is shown. The method comprises the following steps (401-408):

step 401, receiving a match request from n user accounts.

The content of step 401 is the same as or similar to that of step 201 in the embodiment of fig. 2, and is not described here again.

And step 402, rounding the result obtained by dividing n by x to obtain the minimum matching process number.

In some embodiments, the account number m corresponding to each matching process has the same value. And taking the nearest latter integer from the calculation result obtained by dividing n by x, wherein x is the maximum number of the user accounts carried by a single matching process, and x is a positive integer. That is, when the calculation result is an integer, the calculation result is taken as the minimum matching process number; and when the decimal part which is not 0 exists in the calculation result, adding 1 to the integer part of the calculation result and truncating the decimal part to obtain the rounding result of the calculation result. Thus, the minimum number of matching processes is greater than or equal to the calculation of n divided by x. In one example, the calculation of n divided by x is 20, and the minimum number of matching processes is 20. In another example, the calculation of n divided by x is 20.25, and the minimum number of matching processes is 21.

And 403, rounding a result obtained by dividing n by the minimum matching process number to obtain m.

In some embodiments, the result of dividing n by the minimum number of matching processes takes the nearest latter integer to yield m. For the explanation of the rounding process, reference may be made to the content of step 402, which is not described herein again.

Step 404, acquiring capability information corresponding to the n user accounts respectively.

This step 404 is the same as or similar to the step 202 in the embodiment of fig. 2, and is not described here again.

Step 405, acquiring the account number m corresponding to the ith matching process.

Wherein m is a positive integer, the initial value of i is 1 and i is a positive integer. For the ith matching process, before allocating the user account to the ith matching process, the account number m of the user account allocated to the ith matching process needs to be determined. In some embodiments, the account number m corresponding to each matching process has the same value, and the account number m is m obtained through

steps

402 and 403. In other embodiments, the number m of accounts corresponding to each matching process is not completely the same, for example, if the carrying capacity of some matching processes is large, the number of user accounts that can be carried is large, and the number m of accounts corresponding to the matching processes may be large; for another example, some matching processes have smaller carrying capacity, and the number of user accounts that can be carried is smaller, and the number m of corresponding accounts may be smaller.

Step 406, judging whether the number of the user accounts to be distributed is greater than m; if yes, go to step 407; if not, the following step 408 is performed.

Step 407, according to the sorting result, allocating the first m user accounts in the user accounts to be allocated to the ith matching process.

As shown in fig. 5, if the number of the user accounts to be allocated is greater than m, the first m user accounts 51 in the user accounts to be allocated are allocated to the ith matching process 52 according to the sorting result.

The user account to be allocated refers to a user account which is not allocated to the matching process. For example, when none of the n user accounts is allocated to the matching process, the user account to be allocated is the n user accounts; and when the first m user accounts in the n user accounts are distributed to the matching process, the user accounts to be distributed are the rest (n-m) user accounts. Optionally, when the number of the user accounts to be allocated is greater than m, which indicates that the number of the user accounts to be allocated is sufficient to fully utilize the ith matching process 52, the first m user accounts 51 in the user accounts to be allocated are allocated to the ith matching process 52.

After step 407, let i be i +1, and execution starts again from step 405. Alternatively, after the ith matching process 52 is assigned to the corresponding user account, let i be i +1, update the value of i, and start execution from step 405 again; that is, the corresponding user account is assigned for the next matching process.

In some embodiments, the code for implementing steps 405-407 is as follows:

and each matching process carries out match matching on the tomatch user accounts.

And step 408, distributing the account number of the user to be distributed to the ith matching process.

In some embodiments, for the ith matching process, when the number of the user accounts to be allocated is less than or equal to m, since other user accounts in the n user accounts are already allocated, the user accounts to be allocated are allocated to the ith matching process, so as to reduce the waiting time for the office-to-office allocation of the user accounts to be allocated.

Optionally, if the number of the user accounts to be allocated is greater than or equal to y, allocating the user accounts to be allocated to the ith matching process; and if the number of the user accounts to be distributed is less than y, integrating the user accounts to be distributed with other user accounts except the n user accounts and distributing the user accounts to the ith matching process. And y is the minimum number of user accounts carried by a single matching process, and is a positive integer smaller than m. Therefore, a certain number of accounts exist in the ith matching process, and the utilization rate of processing resources of the ith matching process is further ensured.

In one example, as shown in fig. 6, n is 100, and the maximum bearer capacity of a single matching process is 35 user accounts. Another 100 is divided by 35 and rounded to give a minimum number of matching processes of 3, and 100 is divided by 3 and rounded to give m of 34. The distribution process of the matching process comprises the following steps (61-65):

step 61, receiving a match request from 100 user accounts;

step 62, sorting the 100 user accounts according to the capability information corresponding to the 100 user accounts respectively;

step 63, distributing the first 34 user accounts in the 100 user accounts to the matching process 1;

step 64, distributing the first 34 user accounts in the remaining 66 user accounts to the matching process 2;

step 65, the first 34 user accounts of the remaining 32 user accounts are allocated to the matching process 3.

To sum up, in the embodiment of the present application, through steps 302 and 303, while the number of user accounts allocated in the matching process is ensured to be within the range of the carrying capacity of each matching process, the utilization rate of each matching process is improved as much as possible, so that the occupied number of the matching processes is reduced. When the traffic is large, the matching requests of the opposite parties as many as possible can be processed in time, and the waiting time of the user before the opposite parties is reduced.

In some embodiments, according to the sorting result, before allocating the first m user accounts in the user accounts to be allocated to the ith matching process, the method further includes the following steps:

1. under the condition that the user accounts are distributed to corresponding matching processes according to the sequencing result of the competitive power from high to low, determining the user account with the highest competitive power in the first m user accounts;

2. determining the number of first user accounts in the first m user accounts, wherein the first user account refers to the user account with the competitive power difference value between the user account with the highest competitive power and the user account with the competitive power larger than a first difference threshold value;

3. and if the number of the first user accounts is less than or equal to the first threshold value, distributing the first user accounts to the next matching process.

In some embodiments, the first difference threshold refers to a difference between levels of athletic ability of the user account. In other embodiments, the athletic ability is represented by a score, and the first difference threshold refers to a difference between scores corresponding to the athletic ability of the user account. In this embodiment, if the user accounts are sorted according to the competitive power from high to low, by comparing the competitive power of each user account in the first m user accounts with the user account with the highest competitive power, when there is a first user account with a larger difference in competitive power from the user account with the highest competitive power and the number of the first user accounts is small (smaller than or equal to the first threshold), the first user account is allocated to the next matching process, and there is no user account with higher competitive power than that of the first user account in the next matching process, so that while ensuring a certain utilization rate of processing resources of the matching process, the probability of the user accounts with too large difference in competitive power in the matching process is reduced as much as possible, and thus fairness of the game is improved.

1. under the condition that the user accounts are distributed to corresponding matching processes according to the sequencing result of the competitive ability from low to high, determining the user account with the lowest competitive ability in the first m user accounts;

2. determining the number of second user accounts in the first m user accounts, wherein the second user accounts refer to user accounts with the competitive power difference value between the user account with the lowest competitive power and the user account with the competitive power larger than a second difference threshold value;

3. and if the number of the second user accounts is less than or equal to a second threshold value, distributing the second user accounts to the next matching process.

In some embodiments, the second difference threshold refers to a difference between levels of athletic ability of the user account. In other embodiments, the athletic ability is represented by a score, and the second difference threshold refers to a difference between scores corresponding to the athletic ability of the user account. In this embodiment, if the user accounts are sorted from low to high according to the competitive power, by comparing the competitive power of each user account in the first m user accounts with the user account with the lowest competitive power, when there is a second user account with a larger difference in competitive power from the user account with the lowest competitive power and the number of the second user accounts is small (smaller than or equal to the second threshold), the second user account is allocated to the next matching process, and there is no user account with competitive power higher than that of the second user account in the next matching process, so that while ensuring a certain utilization rate of processing resources of the matching process, the probability of user accounts with too large difference in competitive power in the matching process is reduced as much as possible, and thus fairness of the game is improved.

Referring to fig. 7, a flowchart of a method for showing a result of office allocation according to another embodiment of the present application is shown. The execution subject of each step of this embodiment may be the terminal described above, such as a client running in the terminal. The method comprises the following steps (701-704):

step 701, displaying a game participation interface.

Optionally, as shown in fig. 8, an opposite-office participation interface 81 includes an opposite-office matching operation control 82, which is used for triggering the terminal to generate and send an opposite-office matching request.

Step 702, in response to receiving a trigger signal for the matching operation control, sending a matching request to the server.

And when receiving a trigger signal aiming at the matching operation control of the matching bureau, the terminal generates a matching request of the matching bureau and sends the matching request of the matching bureau to the server. Optionally, the match request includes a target user account and capability information corresponding to the target user account, where the capability information is used to indicate a competitive capability of the target user account. For explanation of the capability information, reference may be made to the content of step 201 described above, and details are not described here. The trigger signal may be a click signal (e.g., a single click, a double click, etc.), a long-press signal, or a slide signal, which is not limited in this embodiment of the present application. As shown in fig. 9, a match-to-match request is sent to the server, and the client displays a match-to-match waiting interface 91 to prompt the user that the match-to-match assignment is being performed. For the matching process of the office at the server side, refer to the above embodiments, and are not described herein again.

Step 703, receiving the result of the office allocation from the server.

After the server completes the office allocation, the client can receive the office allocation result sent by the server, and the office allocation result is used for indicating the office allocated by the target user account. The result of the game-play comprises a game-play mode, user account information in the same game-play (such as user account information in an enemy team, user account information in a self team, and the number of accounts in the same game-play), and the like.

Step 704, displaying the result of the distribution of the game in the display interface of the result of the distribution of the game.

Optionally, as shown in fig. 10, the game allocation result display interface 101 includes user account information 102 and game mode information 103.

To sum up, in the technical solution provided in the embodiment of the present application, when sending the matching request to the server, the server can allocate the matching processes based on the capability information by including the capability information in the request, so that the allocation reasonableness of the matching processes is improved, and meanwhile, the fairness of the matching processes is improved.

The following are embodiments of the apparatus of the present application that may be used to perform embodiments of the method of the present application. For details which are not disclosed in the embodiments of the apparatus of the present application, reference is made to the embodiments of the method of the present application.

Referring to fig. 11, a block diagram of an apparatus for distributing a matching process according to an embodiment of the present application is shown. The device has the function of realizing the distribution method example of the matching process at the server side, and the function can be realized by hardware or by hardware executing corresponding software. The device may be the server described above, or may be provided on the server. The apparatus 1100 may include: a request receiving module 1110, an information obtaining module 1120, an account sorting module 1130, and a process assigning module 1140.

The request receiving module 1110 is configured to receive a matching request for matching bureaus from n user accounts, where the matching request for matching bureaus is used to request that the user accounts be distributed for matching bureaus, and n is a positive integer.

The information obtaining module 1120 is configured to obtain capability information corresponding to the n user accounts, where the capability information is used to indicate athletic capabilities of the user accounts.

The account sorting module 1130 is configured to sort the n user accounts according to the capability information corresponding to the n user accounts respectively.

The process allocating module 1140 is configured to sequentially allocate the n user accounts to at least one matching process according to the sorting result of the n user accounts, where the matching process is configured to perform office allocation on user accounts in the same matching process.

In some embodiments, as shown in FIG. 12, the process assignment module 1140 includes: a quantity acquisition submodule 1141 and a process allocation submodule 1142.

The number obtaining sub-module 1141 is configured to, for an ith matching process, obtain an account number m corresponding to the ith matching process, where m is a positive integer, an initial value of i is 1, and i is a positive integer.

The process allocating sub-module 1142 is configured to, if the number of the user accounts to be allocated is greater than m, allocate, according to the sorting result, the first m user accounts in the user accounts to be allocated to the ith matching process; the user account to be distributed refers to a user account which is not distributed to the matching process; and setting i to i +1, and starting to execute the step of acquiring the account number m corresponding to the ith matching process again.

The process allocating sub-module 1142 is further configured to allocate the user account to be allocated to the ith matching process if the number of the user accounts to be allocated is less than or equal to m.

In some embodiments, the number m of accounts corresponding to each matching process has the same value. As shown in fig. 12, the apparatus 1100 further includes: result rounding module 1150.

The result rounding module 1150 is configured to round the result obtained by dividing n by x to obtain the minimum number of matching processes, where x is the maximum number of user accounts carried by a single matching process, and x is a positive integer;

the result rounding module 1150 is further configured to round a result obtained by dividing the n by the minimum matching procedure number to obtain the m.

In some embodiments, as shown in fig. 12, the process allocation module 1140 further comprises: an account number determination sub-module 1143 and a quantity determination sub-module 1144.

The account determining submodule 1143 is configured to determine, under the condition that the user accounts are allocated to corresponding matching processes according to the ranking result of the athletic ability from high to low, a user account with the highest athletic ability among the first m user accounts.

The number determining submodule 1144 is configured to determine the number of first user accounts in the first m user accounts, where the first user account is a user account with a difference value of the competitive power between the user account with the highest competitive power and the user account with the highest competitive power being greater than a first difference threshold.

The process allocating sub-module 1142 is further configured to allocate the first user account to the next matching process if the number of the first user accounts is less than or equal to a first threshold.

The account determining sub-module 1143 is further configured to determine a user account with the lowest competitive power among the first m user accounts under the condition that the user accounts are allocated to corresponding matching processes according to the ranking result of the competitive powers from low to high.

The number determining sub-module 1144 is further configured to determine the number of second user accounts in the first m user accounts, where the second user account is a user account with a difference value of the competitive power between the user account with the lowest competitive power and the user account with the highest competitive power being greater than a second difference threshold.

The process allocating sub-module 1142 is further configured to allocate the second user account to a next matching process if the number of the second user accounts is less than or equal to a second threshold.

In some embodiments, as shown in fig. 12, the process allocation submodule 1142 is further configured to:

if the number of the user accounts to be distributed is larger than or equal to y, distributing the user accounts to be distributed to the ith matching process;

if the number of the user accounts to be distributed is less than y, integrating the user accounts to be distributed with other user accounts except the n user accounts and distributing the user accounts to the ith matching process;

and y is the minimum number of user accounts carried by a single matching process, and is a positive integer smaller than m.

In some embodiments, the n user accounts include a user account whose sending time or receiving time of the local match request belongs to a target time period.

In some embodiments, the capability information comprises at least one of: general account grade, special account grade under appointed game mode, payment grade, prop quantity and prop attribute.

Referring to fig. 13, a block diagram of a device for displaying the result of office allocation according to an embodiment of the present application is shown. The device has the function of realizing the example of the method for displaying the result of the local allocation on the terminal side, and the function can be realized by hardware or by hardware executing corresponding software. The device may be the terminal described above, or may be provided on the terminal. The apparatus 1300 may include: an interface display module 1310, a request sending module 1320, a result receiving module 1330, and a result display module 1340.

The interface display module 1310 is configured to display a match participation interface, where the match participation interface includes a match matching operation control.

The request sending module 1320 is configured to send, in response to receiving a trigger signal for the match operation control, a match request to the game to the server, where the match request includes a target user account and capability information corresponding to the target user account, and the capability information is used to indicate a competitive capability of the target user account.

The result receiving module 1330 is configured to receive a result of the office allocation from the server, where the result of the office allocation is used to indicate the office to which the target user account is allocated.

The result display module 1340 is configured to display the result of the distribution of the game in a game distribution result display interface.

It should be noted that, when the apparatus provided in the foregoing embodiment implements the functions thereof, only the division of the functional modules is illustrated, and in practical applications, the functions may be distributed by different functional modules according to needs, that is, the internal structure of the apparatus may be divided into different functional modules to implement all or part of the functions described above. In addition, the apparatus and method embodiments provided by the above embodiments belong to the same concept, and specific implementation processes thereof are described in the method embodiments for details, which are not described herein again.

Referring to fig. 14, a block diagram of a server according to an embodiment of the present application is shown. The server is configured to implement the method for allocating the matching process on the server side provided in the above embodiment. Specifically, the method comprises the following steps:

the computer apparatus 1400 includes a CPU (Central Processing Unit) 1401, a system Memory 1404 including a RAM (Random Access Memory) 1402 and a ROM (Read-Only Memory) 1403, and a system bus 1405 connecting the system Memory 1404 and the Central Processing Unit 1401. The computer device 1400 also includes a basic I/O (Input/Output) system 1406 that facilitates transfer of information between devices within the computer, and a mass storage device 1407 for storing an operating system 1413, application programs 1414, and other program modules 1412.

The basic input/output system 1406 includes a display 1408 for displaying information and an input device 1409, such as a mouse, keyboard, etc., for user input of information. Wherein the display 1408 and input device 1409 are both connected to the central processing unit 1401 via an input-output controller 1410 connected to the system bus 1405. The basic input/output system 1406 may also include an input/output controller 1410 for receiving and processing input from a number of other devices, such as a keyboard, mouse, or electronic stylus. Similarly, input-output controller 1410 also provides output to a display screen, a printer, or other type of output device.

The mass storage device 1407 is connected to the central processing unit 1401 through a mass storage controller (not shown) connected to the system bus 1405. The mass storage device 1407 and its associated computer-readable media provide non-volatile storage for the computer device 1400. That is, the mass storage device 1407 may include a computer readable medium (not shown) such as a hard disk or CD-ROM (Compact disk Read-Only Memory) drive.

Without loss of generality, the computer-readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes RAM, ROM, EPROM (Erasable Programmable Read-Only Memory), EEPROM (Electrically Erasable Programmable Read-Only Memory), flash Memory or other solid state Memory technology, CD-ROM, DVD (Digital Video Disc) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices. Of course, those skilled in the art will appreciate that the computer storage media is not limited to the foregoing. The system memory 1404 and mass storage device 1407 described above may collectively be referred to as memory.

According to various embodiments of the present application, the computer device 1400 may also operate as a remote computer connected to a network via a network, such as the Internet. That is, the computer device 1400 may be connected to the network 1412 through the network interface unit 1411 connected to the system bus 1405, or may be connected to other types of networks or remote computer systems (not shown) using the network interface unit 1411.

Referring to fig. 15, a block diagram of a terminal according to an embodiment of the present application is shown. The terminal 1500 may be an electronic device such as a mobile phone, a tablet computer, a game console, an electronic book reader, a multimedia player, a wearable device, a PC, etc. The terminal is used for implementing the method for displaying the game allocation result on the terminal side provided by the embodiment. The terminal may be the terminal 30 in the implementation environment shown in fig. 3. Specifically, the method comprises the following steps:

in general, terminal 1500 includes: a processor 1501 and memory 1502.

Processor 1501 may include one or more processing cores, such as a 4-core processor, an 8-core processor, or the like. The processor 1501 may be implemented in at least one hardware form of a DSP (Digital Signal Processing), an FPGA (field Programmable Gate Array), and a PLA (Programmable Logic Array). Processor 1501 may also include a main processor and a coprocessor, where the main processor is a processor for processing data in an awake state, and is also called a Central Processing Unit (CPU); a coprocessor is a low power processor for processing data in a standby state. In some embodiments, the processor 1501 may be integrated with a GPU (Graphics Processing Unit), which is responsible for rendering and drawing the content required to be displayed on the display screen. In some embodiments, processor 1501 may also include an AI (Artificial Intelligence) processor for processing computational operations related to machine learning.

The memory 1502 may include one or more computer-readable storage media, which may be non-transitory. The memory 1502 may also include high-speed random access memory, as well as non-volatile memory, such as one or more magnetic disk storage devices, flash memory storage devices. In some embodiments, a non-transitory computer readable storage medium in the memory 1502 is used for storing at least one instruction, at least one program, a set of codes, or a set of instructions, and is configured to be executed by one or more processors to implement the terminal-side local distribution result presentation method described above.

In some embodiments, the terminal 1500 may further include: a peripheral interface 1503 and at least one peripheral. The processor 1501, memory 1502, and peripheral interface 1503 may be connected by buses or signal lines. Various peripheral devices may be connected to peripheral interface 1503 via buses, signal lines, or circuit boards. Specifically, the peripheral device includes: at least one of radio frequency circuitry 1504, touch screen display 1505, camera 1506, audio circuitry 1507, positioning assembly 1508, and power supply 1509.

Those skilled in the art will appreciate that the configuration shown in fig. 15 does not constitute a limitation of terminal 1500, and may include more or fewer components than shown, or some components may be combined, or a different arrangement of components may be employed.

In some embodiments, there is also provided a computer-readable storage medium having stored therein at least one instruction, at least one program, a set of codes, or a set of instructions, which when executed by a processor, implements the above-described method of allocation of a matching process on a server side.

In some embodiments, there is further provided a computer-readable storage medium, in which at least one instruction, at least one program, a code set, or a set of instructions is stored, and when executed by a processor, the at least one instruction, the at least one program, the code set, or the set of instructions implements the terminal-side presentation method of the game distribution result.

Optionally, the computer-readable storage medium may include: ROM (Read-Only Memory), RAM (Random-Access Memory), SSD (Solid State drive), or optical disk. The Random Access Memory may include a ReRAM (resistive Random Access Memory) and a DRAM (Dynamic Random Access Memory).

In some embodiments, there is also provided a computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer readable storage medium, and executes the computer instructions to cause the computer device to execute the method provided in the above-mentioned allocation method of the matching process or the various alternative implementations of the allocation method of the matching process.

In some embodiments, there is also provided a computer program product or computer program comprising computer instructions stored in a computer readable storage medium. A processor of the computer device reads the computer instructions from the computer-readable storage medium, and executes the computer instructions, so that the computer device executes the method provided in the above method for showing the distribution result of the game or various optional implementations of the method for showing the distribution result of the game.

It should be understood that reference to "a plurality" herein means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.

The above description is only exemplary of the present application and should not be taken as limiting the present application, and any modifications, equivalents, improvements and the like that are made within the spirit and principle of the present application should be included in the protection scope of the present application.

Claims

1. A method for allocating matching processes, the method comprising:

2. The method according to claim 1, wherein said sequentially distributing said n user accounts into at least one matching process according to the result of said sorting of said n user accounts comprises:

for an ith matching process, acquiring the number m of accounts corresponding to the ith matching process, wherein m is a positive integer, the initial value of i is 1, and i is a positive integer;

if the number of the user accounts to be distributed is larger than the m, distributing the first m user accounts in the user accounts to be distributed to the ith matching process according to the sorting result; the user account to be distributed refers to a user account which is not distributed to the matching process; making i equal to i +1, and starting to execute the step of obtaining the account number m corresponding to the ith matching process again;

and if the number of the user accounts to be distributed is less than or equal to the m, distributing the user accounts to be distributed to the ith matching process.

3. The method according to claim 2, wherein the account number m corresponding to each matching process has the same value;

after receiving the office matching requests from the n user accounts, the method further comprises the following steps:

rounding the result obtained by dividing n by x to obtain the minimum number of matching processes, wherein x is the maximum number of user accounts borne by a single matching process, and x is a positive integer;

and rounding a result obtained by dividing the n by the least matching process number to obtain the m.

4. The method according to claim 2, wherein said allocating the first m user accounts of said user accounts to be allocated to the ith matching process according to said sorting result further comprises:

under the condition that the user accounts are distributed to corresponding matching processes according to the sequencing result of the competitive power from high to low, determining the user account with the highest competitive power in the first m user accounts; determining the number of first user accounts in the first m user accounts, wherein the first user account refers to a user account with a difference value of competitive power between the user account with the highest competitive power and the user account with the highest competitive power larger than a first difference threshold value; if the number of the first user accounts is smaller than or equal to a first threshold value, distributing the first user accounts to the next matching process;

or the like, or, alternatively,

under the condition that the user accounts are distributed to corresponding matching processes according to the sequencing result of the athletic ability from low to high, determining the user account with the lowest athletic ability in the first m user accounts; determining the number of second user accounts in the first m user accounts, wherein the second user accounts refer to user accounts with the competitive power difference value between the user account with the lowest competitive power and the user account with the competitive power larger than a second difference threshold value; and if the number of the second user accounts is less than or equal to a second threshold value, distributing the second user accounts to the next matching process.

5. The method according to claim 2, wherein the allocating the user account to be allocated to the ith matching process comprises:

6. The method according to any one of claims 1 to 5, wherein the n user accounts include a user account whose sending time or receiving time of the office matching request belongs to a target time period.

7. The method according to any of claims 1 to 5, wherein the capability information comprises at least one of: general account grade, special account grade under appointed game mode, payment grade, prop quantity and prop attribute.

8. A method for displaying a game distribution result is characterized by comprising the following steps:

9. An apparatus for distributing matching processes, the apparatus comprising:

10. An apparatus for displaying the result of game assignment, the apparatus comprising:

11. A server, characterized in that it comprises a processor and a memory, in which at least one instruction, at least one program, set of codes or set of instructions is stored, which is loaded and executed by the processor to implement the method of allocation of matching processes according to any of the claims 1 to 7.

12. A terminal, characterized in that it comprises a processor and a memory, in which at least one instruction, at least one program, a set of codes or a set of instructions is stored, which is loaded and executed by the processor to implement the method for showing the result of office allocation as claimed in claim 8.

13. A computer-readable storage medium having stored therein at least one instruction, at least one program, a set of codes, or a set of instructions, which is loaded and executed by a processor to implement the method of any one of claims 1 to 7 or the method of presenting the result of a paring distribution according to claim 8.