Recommended lineup methods, devices, terminal equipment and storage media

Abstract

This invention provides a method, apparatus, terminal device, and storage medium for recommending team lineups, relating to the field of game technology. The method includes: responding to a trigger event for an optimal lineup, iteratively calculating the highest total score of the i-th virtual player among the candidate virtual players of the current game account in each vacant position of a preset formation, obtaining the i-th highest total score for each position arrangement; taking the highest total score between the i-th and (i-1)-th highest total scores under each position arrangement as the i-th target highest total score under each position arrangement; determining the optimal position arrangement from each position arrangement based on the N-th target highest total score for each position arrangement, and taking the virtual players placed in the optimal position arrangement as target virtual players; determining the arrangement of the target virtual players under the optimal position arrangement as the optimal lineup; and displaying the optimal lineup on the graphical user interface of the terminal device. This invention can quickly recommend the best lineup to players and reduce system performance overhead.

Description

Technical Field

[0001] This invention relates to the field of game technology, and more specifically, to a method, apparatus, terminal device, and storage medium for recommending team compositions. Background Technology

[0002] In sports games, the player's choice of team lineup will directly affect the game's outcome.

[0003] In existing sports games, such as football or basketball games, the virtual players owned by players have different ratings for different positions based on their attributes. In order to obtain a lineup with a high overall rating, players need to manually place the players one by one into the formation through an exhaustive method to select a lineup with a relatively high rating.

[0004] However, due to the large amount of computation involved in the exhaustive search method, when the virtual player lineup in the game account is huge, even if the exhaustive search method is used to provide players with the function of generating the best lineup with one click, the efficiency of its calculation process is very low, which brings too much performance overhead to the system.

[0005] If players first perform an initial player selection to reduce system performance overhead, and then use an exhaustive search to calculate the best lineup, the result will be affected by the players selected in the initial selection, and will only yield the best lineup from the initial selection. If a high-rated virtual player does not make it into the initial selection, the resulting best lineup will not be the best lineup from all virtual players in the game account. Summary of the Invention

[0006] The purpose of this invention is to address the shortcomings of the prior art by providing a team composition recommendation method, apparatus, terminal device, and storage medium to improve computational efficiency, reduce system performance overhead, and provide players with the best game team compositions.

[0007] To achieve the above objectives, the technical solutions adopted in the embodiments of the present invention are as follows:

[0008] In a first aspect, embodiments of the present invention provide a lineup recommendation method, the method comprising:

[0009] In response to the best lineup trigger event, iterate through and calculate the highest total score of the i-th virtual player among the candidate virtual players of the current game account in the empty positions of each position arrangement in the preset formation, and obtain the i-th highest total score of each position arrangement; i is an integer less than N and greater than 1, and N is the number of candidate virtual players in the current game account;

[0010] The highest total score among the i-th highest total score and the (i-1)-th highest total score under each position arrangement is taken as the first target highest total score under each position arrangement.

[0011] Based on the highest total score of the Nth time under each position arrangement, determine the optimal position arrangement from each position arrangement, and take each virtual player placed in the optimal position arrangement as the target virtual player;

[0012] The optimal lineup is determined by arranging the target virtual players in the optimal position arrangement.

[0013] The optimal lineup is displayed on the graphical user interface of the terminal device.

[0014] Optionally, before calculating the highest total score of the i-th virtual player among the candidate virtual players of the current game account in the vacant positions of each position arrangement in the preset formation, and obtaining the i-th highest total score of each position arrangement, the method further includes:

[0015] If the number of virtual players in the current game account exceeds the number of positions in the preset formation, the candidate virtual players are selected from the virtual players in the current game account.

[0016] Optionally, the step of filtering the candidate virtual players from the virtual players owned by the current game account includes:

[0017] Obtain the player rating set for each position in the preset formation. The player rating set for each position includes: the matching score of each virtual player with each position.

[0018] Based on the player rating set for each position, select the number of virtual players corresponding to each position from the virtual players available in the current game account;

[0019] The candidate virtual player is selected from the virtual players corresponding to the number of positions in multiple positions.

[0020] Optionally, before obtaining the player rating set for each position in the preset formation, the method further includes:

[0021] Based on the attributes of each virtual player, calculate the matching score between each virtual player and each position.

[0022] Optionally, before calculating the highest total score of the i-th virtual player among the candidate virtual players of the current game account in the vacant positions of each position arrangement in the preset formation, and obtaining the i-th highest total score of each position arrangement, the method further includes:

[0023] If the number of virtual players in the current game account is equal to the number of positions in the preset formation, then the virtual players in the current game account are determined as candidate virtual players.

[0024] Optionally, selecting the number of virtual players corresponding to each position from the virtual players possessed by the current game account based on the player rating set for each position includes:

[0025] The matching scores of each virtual player in the player rating set for each position are sorted to obtain the player rating ranking set for each position;

[0026] Based on the player rating sorting set for each position, select the number of virtual players corresponding to each position from the virtual players owned by the current game account.

[0027] Optionally, selecting the candidate virtual player from the virtual players corresponding to the number of positions across multiple positions includes:

[0028] Duplicate virtual players are removed from the virtual players corresponding to the number of positions for the multiple positions to obtain the deduplicated virtual players corresponding to the multiple positions.

[0029] From the virtual players corresponding to the multiple positions after deduplication, select the candidate virtual players.

[0030] Second, embodiments of the present invention also provide a lineup recommendation device, the device comprising:

[0031] The calculation module is used to respond to the triggering event of the best lineup, iterate through and calculate the highest total score of the i-th virtual player among the candidate virtual players of the current game account in the empty positions of each position arrangement in the preset formation, and obtain the i-th highest total score of each position arrangement; i is an integer less than N and greater than 1, and N is the number of candidate virtual players in the current game account.

[0032] The comparison module is used to take the highest total score among the i-th highest total score and the (i-1)-th highest total score under each position arrangement as the target highest total score for the first time under each position arrangement;

[0033] The optimal position arrangement determination module is used to determine the optimal position arrangement from the position arrangements based on the target maximum total score in the Nth time under each position arrangement, and to take each virtual player placed in the optimal position arrangement as the target virtual player.

[0034] The optimal lineup determination module is used to determine the optimal lineup by arranging the target virtual players in the optimal position arrangement.

[0035] The best lineup display module is used to display the best lineup on the graphical user interface of the terminal device.

[0036] Optionally, prior to the computing module, the device further includes:

[0037] The player filtering module is used to filter candidate virtual players from the virtual players in the current game account if the number of virtual players in the current game account exceeds the number of positions in the preset formation.

[0038] Optionally, the player screening module includes:

[0039] The player rating set acquisition unit is used to acquire the player rating set for each position in the preset formation. The player rating set for each position includes: the matching score of each virtual player with each position.

[0040] The position player selection unit is used to select the number of virtual players corresponding to each position from the virtual players owned by the current game account, based on the player rating set for each position.

[0041] The player selection unit is used to select the candidate virtual player from the number of virtual players corresponding to the multiple positions.

[0042] Optionally, before the player rating set acquisition unit, the device further includes:

[0043] The player rating unit is used to calculate the matching score between each virtual player and each position based on the attributes of each virtual player.

[0044] Optionally, prior to the computing module, the device further includes:

[0045] The player determination module is used to determine the virtual players in the current game account as candidate virtual players if the number of virtual players in the current game account is equal to the number of positions in the preset formation.

[0046] Optional, position player selection unit, including:

[0047] The player rating sorting subunit is used to sort the matching scores of each virtual player in the player rating set for each position with each position, so as to obtain the player rating sorting set for each position;

[0048] The position player sorting and selection subunit is used to select the number of virtual players corresponding to each position from the virtual players owned by the current game account, based on the player rating sorting set for each position.

[0049] Optionally, the player selection unit includes:

[0050] The player deduplication subunit is used to remove duplicate virtual players from the virtual players corresponding to the number of positions for the multiple positions, so as to obtain the deduplicated virtual players corresponding to the multiple positions.

[0051] The player selection subunit is used to select the candidate virtual player from the virtual players corresponding to the multiple positions after deduplication.

[0052] Thirdly, embodiments of the present invention also provide a terminal device, including: a processor, a storage medium, and a bus, wherein the storage medium stores program instructions executable by the processor, and when the terminal device is running, the processor communicates with the storage medium via the bus, and the processor executes the program instructions to perform the steps of the lineup recommendation method as described in any of the above embodiments.

[0053] Fourthly, embodiments of the present invention also provide a computer-readable storage medium storing a computer program, which, when executed by a processor, performs the steps of the lineup recommendation method as described in any of the above embodiments.

[0054] The beneficial effects of this invention are:

[0055] This invention provides a lineup recommendation method, apparatus, terminal device, and storage medium. The method responds to a trigger event for the optimal lineup by iterating through and calculating the highest total score of the i-th virtual player among the candidate virtual players of the current game account in each empty position of a preset formation, obtaining the i-th highest total score for each position arrangement; the highest total score between the i-th and (i-1)-th highest total scores for each position arrangement is taken as the i-th target highest total score for each position arrangement; based on the N-th target highest total score for each position arrangement, the optimal position arrangement is determined from each position arrangement, and the virtual players placed in the optimal position arrangement are taken as target virtual players; the arrangement of the target virtual players in the optimal position arrangement is determined as the optimal lineup; and the optimal lineup is displayed on the graphical user interface of the terminal device. This invention uses dynamic programming to solve for the arrangement corresponding to the highest scores of virtual players in any few positions of the preset formation to determine a local optimum. Then, by iterating through all players, it extends to the arrangement corresponding to the highest scores of virtual players in all positions of the preset formation. This method has low computational complexity, effectively reducing system performance overhead and enabling rapid recommendation of the optimal lineup to players. Attached Figure Description

[0056] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of the present invention and should not be regarded as a limitation on the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0057] Figure 1 A flowchart illustrating an optional embodiment of the lineup recommendation method of the present invention;

[0058] Figure 2 This is a schematic diagram of the lineup arrangement interface according to an embodiment of the present invention;

[0059] Figure 3 This is a flowchart of another optional embodiment of the lineup recommendation method described in this invention;

[0060] Figure 4 This is a flowchart of another optional embodiment of the lineup recommendation method described in this invention;

[0061] Figure 5 This is a flowchart of another optional embodiment of the lineup recommendation method described in this invention;

[0062] Figure 6 This is a flowchart of another optional embodiment of the lineup recommendation method described in this invention;

[0063] Figure 7 This is a schematic diagram of the lineup recommendation device according to an embodiment of the present invention;

[0064] Figure 8 This is a schematic diagram of a terminal device provided in an embodiment of the present invention. Detailed Implementation

[0065] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are some embodiments of the present invention, but not all embodiments.

[0066] Therefore, the following detailed description of the embodiments of the invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely to illustrate selected embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the invention without inventive effort are within the scope of protection of the invention.

[0067] In the description of this invention, it should be noted that if terms such as "upper" or "lower" are used to indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings, or the orientation or positional relationship in which the product is usually placed during use, they are only for the convenience of describing this invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation, and therefore should not be construed as a limitation of this invention.

[0068] Furthermore, the terms "first," "second," etc., used in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Additionally, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0069] It should be noted that, where there is no conflict, the features in the embodiments of the present invention can be combined with each other.

[0070] In sports games, especially those involving multiplayer teamwork, players need to choose appropriate formations and lineups before the game starts. These choices have a crucial impact on the outcome of the game.

[0071] In existing sports games, such as football or basketball games, players' game accounts have multiple virtual players, each with different attributes. That is, different virtual players have different ratings in different positions. In order to get a lineup with a high overall rating, players need to manually place the players one by one into the formation through exhaustive search to select a lineup with a relatively high rating.

[0072] However, due to the large amount of computation involved in the exhaustive search method, when the virtual player lineup in the game account is huge, even if the game uses the exhaustive search method to provide players with the function of generating the best lineup with one click, the efficiency of the calculation process is very low. At the same time, the huge amount of computation also brings excessive performance overhead to the system.

[0073] If players first perform an initial player selection to reduce system performance overhead, and then use an exhaustive search to calculate the best lineup, the result will be affected by the players selected in the initial selection, and will only yield the best lineup from the initial selection. If a high-rated virtual player does not make it into the initial selection, the resulting best lineup will not be the best lineup from all virtual players in the game account.

[0074] To address the problems in the existing technology, this invention proposes the following technical concept: Each virtual player has a specific rating in each position. The highest total score for the vacant position in each position arrangement of the i-th virtual player is calculated. The highest total score between the i-th and (i-1)-th highest total scores in the same position arrangement is taken as the target highest total score for that position arrangement. This process is repeated until all virtual players are traversed, resulting in the N-th target highest total score. The position arrangement with the target highest total score in each position arrangement without vacant positions is determined as the optimal position arrangement. The virtual players in this optimal position arrangement are the target virtual players. The arrangement of the target virtual players in the optimal position arrangement is taken as the optimal lineup. This optimal lineup is displayed on the graphical user interface of the terminal device. The optimal lineup is calculated using dynamic programming, reducing computational efficiency, effectively reducing system performance overhead, and quickly providing players with the optimal lineup.

[0075] Based on the above introduction, the lineup recommendation method, apparatus, terminal device and storage medium provided by the present invention will be described in detail below.

[0076] It should be noted that the following process uses a football game as an example, but the solution provided by this invention is not limited to football games. It can be applied to any game that requires lineup arrangement and combination similar to football games, and this application does not limit it in this regard.

[0077] First, this invention provides a method for recommending team compositions.

[0078] Please refer to Figure 1 The above is a flowchart of an optional embodiment of the lineup recommendation method of the present invention. In this embodiment, the lineup recommendation method includes:

[0079] S20: In response to the best lineup trigger event, iterate through and calculate the highest total score of the i-th virtual player among the candidate virtual players of the current game account in the empty positions of each position arrangement in the preset formation, and obtain the i-th highest total score of each position arrangement; i is an integer less than N and greater than 1, and N is the number of candidate virtual players in the current game account.

[0080] Generally, please refer to Figure 2 This is a schematic diagram of the lineup arrangement interface according to an embodiment of the present invention, as shown below. Figure 2As shown, the lineup arrangement interface displays at least the following: a candidate virtual player list 11, a preset formation position slot 12, and a total score for the current position arrangement 13; the candidate virtual player list 11 includes candidate virtual players of the current game account, and the number of candidate virtual players must be at least equal to the minimum number of players required for the competition. Players can drag and drop candidate virtual players into the position slots to create lineups and can view the total score of the current lineup combination.

[0081] In this embodiment of the invention, the lineup arrangement interface also has a one-click best lineup generation control 14. After the player selects the preset formation needed for their match, they can operate on the one-click best lineup generation control 14. The terminal device responds to the trigger event of the best lineup and provides the player with the best lineup for the preset formation.

[0082] Using a football game as an example, this describes the process of determining the best lineup for players on a mobile device. In football games, player positions are generally divided into 15 types: Goalkeeper (GK), Center Back (CB), Left Back (LB), Right Back (RB), Left Wing Back (LWB), Right Wing Back (RWB), Defensive Mid-Fielder (CDM), Midfielder (CM), Left Mid-Fielder (LM), Right Mid-Fielder (RM), Attacking Mid-Fielder (CAM), Left Wing Forward (LW), Right Wing Forward (RW), Forward (CF), and Striker (ST).

[0083] For example, the current game account has 18 candidate virtual players. The default formation is 4-4-2, which is a common formation in football. The full name is "1+4+4+2". The 4-4-2 formation includes 8 types of positions: 1 goalkeeper, 1 left-back, 2 center-backs, 1 right-back, 1 left midfielder, 2 midfielders, 1 right midfielder, and 2 center forwards. Table 1 shows the types of each position under the 4-4-2 formation. Table 2 shows the ratings of the 18 candidate virtual players in the 8 types of positions. -1 indicates that the virtual player has no rating in that position, meaning that the player is not suitable for that position.

[0084] Table 1. Types of positions under the 442 formation

[0085]

[0086] Table 2. Ratings of 18 candidate virtual players in 8 position types.

[0087]

[0088] First, it should be noted that the default formation in the football game includes 11 positions. Each position has two possibilities: with a player and without a player. Therefore, the 11 positions have 2... 11 There are several ways to arrange the positions, namely 00000000000-11111111111, where 0 indicates that there is no player in that position and 1 indicates that there is a player in that position.

[0089] Because the positional arrangement has 2 11 = There are 2048 possible arrangements, which cannot all be listed and described in this embodiment of the invention. Table 3-1 shows the scores of the first 9 candidate virtual players in some position arrangements, and Table 3-2 shows the scores of the last 9 candidate virtual players in some position arrangements.

[0090] Table 3-1 Scores of the top 9 candidate virtual players in certain positional arrangements

[0091]

[0092] Table 3-2 shows the scores of the last 9 candidate virtual players in certain positional arrangements.

[0093]

[0094]

[0095] Based on Tables 3-1 and 3-2, before the traversal begins, the unique positional arrangement of this formation is 00000000000. When traversing player 1, since all positions in the unique positional arrangement of this formation are empty, player 1 has two choices: to arrange or not to arrange in each empty position. If player 1 does not arrange in any empty position, the positional arrangement will still be position 0 (00000000000), and the highest total score for this positional arrangement is -1.

[0096] If player 1 is placed in the first empty position, then the arrangement for that position is position 1, 00000000001. Since player 1's score in position 1GK is 77, the highest total score for player 1 in position 1 is 77. However, player 1's scores in all other positions are -1, so the highest total score for player 1 in any other single position is -1. For the case where players are placed in two or more other positions, such as position 3, 00000000011, since only the first player has been traversed, the number of players in these arrangements is insufficient, and the highest total score is also -1.

[0097] When iterating through player 2, if all positions are empty and player 2 is not placed in any of the empty positions, the highest total score for that position is -1. If player 2 is placed in the first empty position, then that position is arranged as position 1 (00000000001). Since player 2's score in position 1 (GK) is 62, the highest total score for player 2 in position 1 is recorded as 62. However, player 2's scores in other empty positions are all -1, so the highest total score for player 2 in positions 2, 4, etc., is recorded as -1.

[0098] For position 3, arrangement 00000000011, it could be that after traversing player 1, in position 1 arrangement 00000000001, player 2 is placed in the second empty position. In this case, player 1 scores 77 in position 1GK, and player 2 scores -1 in position 2LB. Therefore, the total score for this arrangement is 77 + (-1) = 77. Alternatively, after traversing player 1, in position 2 arrangement 00000000010, player 2 is placed in the first empty position. In this case, player 1 scores -1 in position 2LB, and player 2 scores 62 in position 1GK. Therefore, the total score for this arrangement is (-1) + 62 = 62. Thus, the highest total score for position 3 is 77. Similarly, the same calculation method is used for the highest total score of position arrangements 5 and 6.

[0099] When iterating through player 3, for all empty positions, if player 3 is not placed in any of the empty positions, the highest total score for that position is -1. If player 3 is placed in the first empty position, then the position is arranged as position 1, 00000000001. Since player 3's score in position 1GK is 15, the highest total score for player 3 in position 1 is recorded as 15. If player 3 is placed in the second empty position, then the position is arranged as position 2, 00000000010. Since player 3's score in position 2LB is 66, the highest total score for player 3 in position 2 is recorded as 66. Similarly, the highest total score for player 3 in position 4 is recorded as 81.

[0100] For position 3, arranged in sequence 00000000011, it could be that after traversing player 2, in position 1 (sequence 00000000001), player 3 is placed in the second empty position. In this case, the highest total score for position 1 is 77, and player 3 scores 66 in position 2LB, so the total score for this position arrangement is 77 + 66 = 143. Alternatively, after traversing player 2, in position 2 (sequence 00000000010), player 3 is placed in the first empty position. In this case, the highest total score for position 1 is -1, and player 3 scores 15 in position 1GK, so the total score for this position arrangement is (-1) + 15 = 15. Therefore, the highest total score for position 3 is max{143, 15} = 143. Similarly, the same calculation method is used for the highest total scores of position arrangements 5 and 6.

[0101] Regarding the arrangement 00000000111 for position 7, it could mean that after iterating through player 2, player 3 is placed in the third vacant position under the arrangement 00000000011 for position 3. In this case, the highest total score for the arrangement of position 3 is 77, and player 3's score in position 3CB is 81, so the total score for this arrangement is 77 + 81 = 158. Alternatively, it could mean that after iterating through player 2, player 3 is placed in the second vacant position under the arrangement 00000000101 for position 5. There are vacant positions. In this case, the highest total score for position 5 is 77. Player 3 scores 66 in position 2LB, so the total score for this position is 77 + 66 = 143. Alternatively, after traversing position 6 (00000000110) for player 2, if player 3 is placed in the first vacant position, the highest total score for position 6 is -1. Player 3 scores 15 in position 1GK, so the total score for this position is (-1) + 15 = 15. Therefore, the highest total score for position 7 (00000000111) is max{158,143,15} = 158.

[0102] Similarly, when iterating through player 8, the arrangement for position 7 (00000000111) could mean that after iterating through player 7, position 3 (00000000011) is used to arrange player 8 in the third empty position. In this case, the highest total score for position 3 is 143, and player 8's score in position 3CB is 69, so the total score for this position arrangement is 143 + 69 = 212. Alternatively, after iterating through player 7, position 5 (00000000101) could be used to arrange player 8... Arranging player 8 in the second empty position, the highest total score for position 5 is 158. Player 8 scores 73 in position 2LB, so the total score for this position is 158 + 73 = 231. Alternatively, after traversing position 6 (00000000110) for player 7, placing player 8 in the first empty position, the highest total score for position 6 is 134. Player 8 scores 11 in position 1GK, so the total score for this position is 134 + 11 = 145. Therefore, the highest total score for position 8 (00000000111) is max{212,231,145} = 231.

[0103] Similarly, when iterating through player 11, arranging the position of number 2047 as 111111111111 results in the following order after iterating through player 10: 11111111110, 11111111101, 11111111011, 1111110111, 1111101111, 1111011111, 1110111111, 1101111111, 1101111111, 110111111. Under the following conditions: 1111, 10111111111, 011111111111, players 11 are arranged in various empty positions. The highest total score is max{603+11, 680+(-1), 671+(-1), 671+(-1), 676+(-1), 664+(-1), 680+(-1), 680+(-1), 664+(-1), 658+63, 658+63}=721.

[0104] Similarly, when iterating through player 14, arranging the position of number 2047 as 111111111111 results in the following order after iterating through player 13: 1111111110, 11111111101, 11111111011, 11111110111, 11111101111, 1111011111, 1110111111, 1110111111, 1 Under the following conditions: 10111111111, 10111111111, and 011111111111, players 11 are arranged in various vacant positions. The highest total score is max{747+(-1), 775+79, 766+65, 766+65, 771+75, 756+63, 763+65, 763+65, 756+63, 757+52, 757+52}=854.

[0105] As can be seen from the above traversal process, when traversing the i-th player, the highest total score of the i-th player in each position can be obtained directly by adding the highest total score of the i-th player in each position after traversing the first i-1 players in each position to the score of the i-th player in the empty position, without the need to use an exhaustive method to determine the highest total score of the first i players in each position. This calculation method can effectively reduce the amount of computation and reduce the performance overhead of the system.

[0106] S30: Take the highest total score between the i-th highest total score and the (i-1)-th highest total score under each position arrangement as the target highest total score under each position arrangement.

[0107] Specifically, according to the above traversal process, when traversing player 1, since there is only one player, the score of player 1 in the empty position in the position arrangement is the first highest total score under each position arrangement. Among them, for position arrangement 00000000000, the highest total score of player 1 in the first empty position arrangement 00000000001 is 77, and the highest total score of player 1 in other empty positions is -1.

[0108] When iterating through player 2, the position number 0 is arranged as 000000000000. The highest total score for player 2 in the first vacant position is 00000000001, which is 62. Therefore, the target highest total score for position arrangement 00000000001 is 77. According to the scores of the 18 candidate virtual players in position 1GK in Table 2, the target highest total score for position arrangement 00000000001 remains at 77.

[0109] Based on the above analysis, when traversing player 2, the highest score for position 3 (00000000011) is 77. When traversing player 3, the highest score for position 3 (00000000011) is 77. Therefore, when traversing player 3, the target highest score for position 3 (00000000011) is 143. When traversing player 8, the target highest score for position 3 (00000000011) is updated to 150. When traversing player 14, the target highest score for position 3 (00000000011) is updated to 156. After that, the target highest total score for position 00000000011 remains at 156.

[0110] Similarly, according to the above calculation process, when traversing player 3, the highest score of position 7 in arrangement 00000000111 is 158. When traversing player 4, the highest score of position 7 in arrangement 00000000111 is updated to 204. When traversing player 6, the highest score of position 7 in arrangement 00000000111 is updated to 211. When traversing player 8, the highest score of position 7 in arrangement 00000000111 is updated to 231. When traversing player 14, the highest score of position 7 in arrangement 00000000111 is updated to 237. After that, the target maximum total score of position arrangement 00000000111 remains at 237.

[0111] Similarly, when iterating through player 11, the highest score for position 2047 arranged in the sequence 111111111111 is 721. When iterating through player 12, the highest score for position 2047 arranged in the sequence 111111111111 is updated to 787. When iterating through player 13, the highest score for position 2047 arranged in the sequence 111111111111 is updated to 824. When iterating through player 14, the highest score for position 2047 arranged in the sequence 111111111111 is updated to 854. After that, the target maximum total score for position arrangement 111111111111 remains at 854.

[0112] Based on this process, the target maximum total score for the i-th time can be determined under each position arrangement, thus obtaining the local optimal solution for the i-th time.

[0113] S40: Based on the highest total score of the Nth time under each position arrangement, determine the optimal position arrangement from each position arrangement, and use each virtual player placed in the optimal position arrangement as the target virtual player.

[0114] In this embodiment of the invention, during the traversal process, for each player, the target maximum total score under each position arrangement is determined. Although Tables 3-1 and 3-2 only record the target maximum total score during the traversal process, the terminal device will simultaneously record and save the positions of the candidate virtual players under each position arrangement corresponding to the target maximum total score when updating the target maximum total score. This is so that after traversing all candidate virtual players, the position arrangement corresponding to the target maximum total score is determined as the optimal position arrangement, and each virtual player placed in the optimal position arrangement is taken as the target virtual player.

[0115] For example, when traversing player 1, the highest total score is recorded as 77, and the position is recorded as player 1 being in the first empty position. When traversing players 2-18, the target highest total score for position 1 remains 77, and the position remains as player 1 being in the first empty position.

[0116] For position arrangement of player number 3, when iterating through player 2, the highest total score is recorded as 77, and the position arrangement is recorded as player 1 in the first empty position and player 2 in the second empty position. When iterating through player 3, the target highest total score is recorded as 143, and the position arrangement is recorded as player 1 in the first empty position and player 3 in the second empty position. When iterating through players 4 to 7, the target highest total score remains at 143, and the position arrangement remains player 1 in the first empty position and player 2 in the second empty position. When iterating through player 8, the target highest total score is recorded as 150, and the position arrangement is recorded as player 1 in the first empty position and player 8 in the second empty position.

[0117] Regarding the position arrangement of player number 7, when iterating through player 3, the highest total score is recorded as 158. As mentioned earlier, this highest total score is obtained by placing player 3 in the third empty position after iterating through player 2, with player 3 in the first empty position. Since the position arrangement of player number 3 is player 1 in the first empty position and player 2 in the second empty position, the position arrangement of player number 7 is player 1 in the first empty position, player 2 in the second empty position, and player 3 in the third empty position. When iterating through player 4, the target highest total score is recorded as 204. This highest total score is obtained by placing player 4 in the second empty position after iterating through player 3, with player 4 in the second empty position. Since the position arrangement of player number 5 is player 1 in the first empty position and player 3 in the third empty position, the position arrangement of player number 7 is player 1 in the first empty position, player 4 in the second empty position, and player 3 in the third empty position.

[0118] The same principle applies to the arrangement of other positions, so I will not elaborate further here.

[0119] As can be seen from the above process, when recording the target maximum total score for each position arrangement, the player arrangement corresponding to the target maximum total score is also recorded. When traversing each virtual player, there is no need to exhaustively sort them sequentially. It is only necessary to refer to the previous virtual player's sorting, place the current virtual player in the empty position, and compare the maximum total score to determine the current position arrangement. By determining the latest position arrangement based on the previous virtual player's sorting and the current virtual player's maximum total score in the empty position, the amount of computation can be effectively reduced, and the system's performance overhead can be lowered.

[0120] S50: Determine the optimal lineup by arranging the target virtual players in their best positions.

[0121] In this embodiment of the invention, during the traversal process, the arrangement of each virtual player corresponding to the highest total score in each position is recorded synchronously. After traversing all candidate virtual players, the target virtual player in the best position arrangement corresponding to the highest total score, as well as the arrangement of the target virtual player in the best position arrangement, can be determined, and the arrangement is taken as the best lineup.

[0122] Furthermore, if, when traversing the i-th candidate virtual player, the highest total score in the i-th position arrangement is equal to the highest total score in the (i-1)-th position arrangement, then there are two different arrangements of virtual players under that position arrangement. Similarly, after traversing N candidate virtual players, if the target highest total score corresponds to at least two optimal position arrangements, then at least two optimal lineups can be determined. Based on the starting lineup strategy, one of them can be selected as the optimal starting lineup, and the other optimal lineups can be selected as alternative optimal lineups.

[0123] S60: Displays the best lineup on the graphical user interface of the terminal device.

[0124] In this embodiment of the invention, after determining the optimal lineup, in Figure 2 In the lineup arrangement interface shown, the target virtual players are placed in their corresponding position slots according to their positions to display the best lineup to the player.

[0125] Furthermore, if there are at least two optimal lineups, a lineup switching control can be provided to the player on the graphical user interface, which switches the display of alternative optimal lineups in response to the lineup switching trigger event.

[0126] The lineup recommendation method provided in the above embodiments, in response to the triggering event of the best lineup, iterates and calculates the highest total score of the i-th virtual player among the candidate virtual players of the current game account in the empty positions of each position arrangement in the preset formation, obtaining the i-th highest total score of each position arrangement; the highest total score between the i-th highest total score and the (i-1)-th highest total score under each position arrangement is taken as the i-th target highest total score under each position arrangement; based on the N-th target highest total score under each position arrangement, the optimal position arrangement is determined from each position arrangement, and each virtual player placed in the optimal position arrangement is taken as the target virtual player; the arrangement of the target virtual players under the optimal position arrangement is determined as the best lineup; the best lineup is displayed on the graphical user interface of the terminal device. This embodiment of the invention uses dynamic programming to solve for the arrangement of the highest scores of virtual players in any few positions in the preset formation to determine the local optimum, and then extends to the arrangement of the highest scores of virtual players in all positions of the preset formation by traversing all players. This method has low computational complexity, effectively reduces system performance overhead, and can quickly recommend the best lineup to players.

[0127] Based on the above embodiments of the present invention, another optional embodiment of the lineup recommendation method of the present invention is further proposed.

[0128] Please refer to Figure 3 The above is a flowchart of another optional embodiment of the lineup recommendation method described in this invention, as shown below. Figure 3 As shown, in this embodiment, the lineup recommendation method includes S11, S12, and S20-S60, where S20-S60 are the same as those in the above embodiment and will not be described again here.

[0129] Specifically, the recommended lineup method includes:

[0130] S11: If the number of virtual players in the current game account exceeds the number of positions in the preset formation, select candidate virtual players from the virtual players in the current game account.

[0131] In this embodiment of the invention, the current game account will have multiple virtual players. To participate in a match, the number of virtual players owned by the current game account must be at least equal to the number of positions in the preset formation. If the number of virtual players owned by the current game account exceeds the number of positions in the preset formation, in order to reduce the amount of calculation, or if the player wants to choose their favorite virtual player to play the match, N candidate virtual players can be selected from the virtual players owned by the current game account. The number of N candidate virtual players must be greater than or equal to the number of positions in the preset formation.

[0132] S12: If the number of virtual players in the current game account is equal to the number of positions in the preset formation, determine the virtual players in the current game account as candidate virtual players.

[0133] In this embodiment of the invention, if the number of virtual players in the current game account is exactly equal to the number of positions in the preset formation, and there are no additional virtual players to choose from, then the virtual players in the current game account are the candidate virtual players.

[0134] S20: In response to the best lineup trigger event, iterate through and calculate the highest total score of the i-th virtual player among the candidate virtual players of the current game account in the empty positions of each position in the preset formation, and obtain the i-th highest total score of each position arrangement.

[0135] S30: Take the highest total score between the i-th highest total score and the (i-1)-th highest total score under each position arrangement as the target highest total score under each position arrangement.

[0136] S40: Based on the highest total score of the Nth time under each position arrangement, determine the optimal position arrangement from each position arrangement, and use each virtual player placed in the optimal position arrangement as the target virtual player.

[0137] S50: Determine the optimal lineup by arranging the target virtual players in their best positions.

[0138] S60: Displays the best lineup on the graphical user interface of the terminal device.

[0139] The lineup recommendation method provided in the above embodiments, if the number of virtual players in the current game account exceeds the number of positions in the preset formation, filters candidate virtual players from the virtual players in the current game account; if the number of virtual players in the current game account is equal to the number of positions in the preset formation, determines the virtual players in the current game account as candidate virtual players. On the one hand, this ensures that there are enough virtual players for lineup arrangement, and on the other hand, it reduces the amount of calculation and improves calculation efficiency by filtering.

[0140] Based on the above embodiments of the present invention, another optional embodiment of the lineup recommendation method of the present invention is further proposed.

[0141] Please refer to Figure 4 The above is a flowchart of another optional embodiment of the lineup recommendation method described in this invention, as shown below. Figure 4 As shown, in this embodiment, S11 of the lineup recommendation method in the above embodiment includes:

[0142] S111: Obtain the player rating set for each position in the preset formation. The player rating set for each position includes: the matching score of each virtual player with each position.

[0143] In this embodiment of the invention, the virtual players of the current game account are matched with multiple positions in advance to determine the matching score of each virtual player with each position. The virtual players are then grouped according to multiple positions to obtain a player rating set for multiple positions. From the player rating set for multiple positions, the player rating set for each position corresponding to the preset formation is obtained.

[0144] For example, as mentioned earlier, there are 15 player positions in a football game, but the formation selected for each game will not include all player positions. For example, the 442 formation only has 8 types of positions. Therefore, it is necessary to obtain the player rating set for the 8 positions corresponding to the 442 formation from the player rating set for the 15 positions.

[0145] In one alternative implementation, before obtaining the player rating set, the matching score of each virtual player with each position is calculated based on the attributes of each virtual player.

[0146] In this embodiment of the invention, to ensure that the players selected from each position are the virtual players with the highest matching degree to that position, it is necessary to calculate the matching score between each virtual player and each position based on the attributes of each virtual player. The attributes of the virtual players include at least: stamina, passing ability, movement speed, defensive ability, and offensive ability. For different types of games, there may be some specific attributes, such as shooting ability in a football game or shooting accuracy in a basketball game. Different positions require different abilities from the players. Based on the attributes of the virtual players and the ability requirements of each position, the matching score between each virtual player and each position is calculated.

[0147] S112: Based on the player rating set for each position, select the corresponding number of virtual players for each position from the virtual players available in the current game account.

[0148] In this embodiment of the invention, since the virtual players in the player rating sets of different positions may overlap, duplicate players may be selected when selecting players from the player rating sets of each position. In order to ensure that the number of virtual players selected from the player rating sets of multiple positions is at least equal to the number of positions in the preset formation, it is necessary to select the corresponding number of virtual players from the player rating sets of each position.

[0149] S113: Select candidate virtual players from virtual players corresponding to multiple positions.

[0150] Specifically, if there are many virtual players corresponding to multiple positions, the computational efficiency may decrease. To reduce the computational load and improve efficiency, a secondary selection can be performed on the virtual players corresponding to multiple positions to select N candidate virtual players. The secondary selection can still be performed by grouping the virtual players selected in the first selection according to their positions, and then selecting virtual players from each position's group that are less than the number of positions. The final number of candidate virtual players should be greater than or equal to the number of positions in the preset formation.

[0151] For example, using a football game as an example, for a 4-4-2 formation, based on the player rating sets for 8 positions, 11 virtual players are selected from each player rating set. If the current game account has only 11 virtual players, the total number of virtual players selected from the 8 player rating sets is still 11; if the current game account has more than 88 virtual players, the maximum number of virtual players selected from the 8 player rating sets is 88, meaning that the virtual players selected from each player rating set are not overlapping.

[0152] It should be noted that, referring to Table 2, after obtaining 11 virtual players from the player rating set for each position, the final number of virtual candidate players is 18. Therefore, for these 18 virtual players, only 11 players have a score in the corresponding position, and the remaining 7 players have a score of -1 in the corresponding position.

[0153] The lineup recommendation method provided in the above embodiments obtains a set of player ratings for each position in a preset formation. The set of player ratings for each position includes the matching score of each virtual player with each position. Based on the set of player ratings for each position, virtual players corresponding to the number of positions are selected from the virtual players owned by the current game account. Candidate virtual players are selected from the virtual players corresponding to the number of positions. By matching the virtual players with positions and scores, players with more suitable abilities are selected for each position, so that the resulting lineup is better.

[0154] Based on the above embodiments of the present invention, another optional embodiment of the lineup recommendation method of the present invention is further proposed.

[0155] Please refer to Figure 5 The above is a flowchart of another optional embodiment of the lineup recommendation method described in this invention, as shown below. Figure 5 As shown, in this embodiment, S112 of the lineup recommendation method in the above embodiment includes:

[0156] S112a: Sort the matching scores of each virtual player with each position in the player rating set for each position to obtain the player rating sorted set for each position.

[0157] In this embodiment of the invention, in order to ensure that the players selected for each position are the best players, the matching scores of the virtual players in the player rating set for each position are sorted according to the matching scores of each virtual player with each position, so as to obtain the player rating ranking set for each position.

[0158] S112b: Sort the set of players by their ratings for each position, and select the number of virtual players corresponding to each position from the virtual players available to the current game account.

[0159] In this embodiment of the invention, after obtaining the player rating ranking set, the top n virtual players equal to the number of positions are directly selected from the player rating ranking set, so that the selected virtual players for that position are the n best virtual players for that position, ensuring that excellent players are not left out.

[0160] The lineup recommendation method provided in the above embodiments sorts the matching scores of each virtual player in the player rating set for each position with each position to obtain a player rating ranking set for each position. Based on the player rating ranking set for each position, virtual players corresponding to the number of positions are selected from the virtual players owned by the current game account. By sorting the virtual players for each position according to the matching results, the virtual players selected from each position are the best players, so that the final lineup obtained when recommending lineups is the absolute best lineup.

[0161] Based on the above embodiments of the present invention, another optional embodiment of the lineup recommendation method of the present invention is further proposed.

[0162] Please refer to Figure 6 The above is a flowchart of another optional embodiment of the lineup recommendation method described in this invention, as shown below. Figure 6 As shown, in this embodiment, S113 of the lineup recommendation method in the above embodiment includes:

[0163] S113a: Remove duplicate virtual players from the virtual players corresponding to multiple positions to obtain the virtual players corresponding to multiple positions after deduplication.

[0164] In this embodiment of the invention, since the virtual players in the player rating sets of different positions may overlap, when selecting players from the player rating sets of each position, duplicate players may be selected. Therefore, after selecting virtual players for multiple positions, it is necessary to remove the duplicate virtual players to obtain the virtual players corresponding to multiple positions after deduplication, so as to avoid traversing the same player twice during traversal and causing errors in the results.

[0165] S113b: Select candidate virtual players from the virtual players corresponding to multiple positions after deduplication.

[0166] In this embodiment of the invention, after deduplication, if the computational load or the number of virtual players corresponding to multiple positions meets the requirements, the virtual players are directly used as candidate virtual players. If it is necessary to reduce the computational load, a secondary selection can be performed from the number of virtual players corresponding to multiple positions to obtain candidate virtual players. The secondary selection process can be referred to the above and will not be repeated here.

[0167] The lineup recommendation method provided in the above embodiment removes duplicate virtual players from the virtual players corresponding to multiple positions, obtaining a list of virtual players corresponding to multiple positions after deduplication. From the list of virtual players corresponding to multiple positions after deduplication, candidate virtual players are selected. By removing duplicate virtual players, the method avoids the same player being traversed twice, which would result in an incorrect lineup in the final recommendation.

[0168] Secondly, the present invention also provides a lineup recommendation device.

[0169] Please refer to Figure 7 This is a schematic diagram of the lineup recommendation device according to an embodiment of the present invention, as shown below. Figure 7 As shown, the recommended equipment for this lineup includes:

[0170] The calculation module 10 is used to respond to the triggering event of the best lineup, and iterate through and calculate the highest total score of the i-th virtual player in the candidate virtual players of the current game account in the empty positions of each position arrangement in the preset formation, to obtain the i-th highest total score of each position arrangement; i is an integer less than N and greater than 1, and N is the number of candidate virtual players in the current game account.

[0171] Comparison module 20 is used to take the highest total score between the i-th highest total score and the (i-1)-th highest total score under each position arrangement as the target highest total score for the first time under each position arrangement;

[0172] The optimal position arrangement determination module 30 is used to determine the optimal position arrangement from each position arrangement based on the target maximum total score in the Nth time under each position arrangement, and to take each virtual player placed in the optimal position arrangement as the target virtual player.

[0173] The Best Lineup Determination Module 40 is used to determine the best lineup by arranging the target virtual players in their optimal positions.

[0174] The best lineup display module 50 is used to display the best lineup on the graphical user interface of the terminal device.

[0175] Optionally, prior to the computing module 10, the device further includes:

[0176] The player filtering module is used to filter candidate virtual players from the virtual players in the current game account if the number of virtual players in the current game account exceeds the number of positions in the preset formation.

[0177] Optional player filtering module, including:

[0178] The player rating set acquisition unit is used to acquire the player rating set for each position in the preset formation. The player rating set for each position includes: the matching score of each virtual player with each position;

[0179] The position player selection unit is used to select the corresponding number of virtual players for each position from the virtual players available in the current game account, based on the player rating set for each position.

[0180] The player selection unit is used to select candidate virtual players from virtual players for multiple positions.

[0181] Optionally, prior to the player rating set acquisition unit, the device also includes:

[0182] The player rating unit is used to calculate the matching score of each virtual player with each position based on the attributes of each virtual player.

[0183] Optionally, prior to the computing module 10, the device further includes:

[0184] The player determination module is used to determine the virtual players in the current game account as candidate virtual players if the number of virtual players in the current game account is equal to the number of positions in the preset formation.

[0185] Optional, position player selection unit, including:

[0186] The player rating sorting subunit is used to sort the matching scores of each virtual player in the player rating set for each position with each position, so as to obtain the player rating sorting set for each position.

[0187] The position player sorting selection subunit is used to sort the set of players for each position according to their ratings and select the number of virtual players corresponding to each position from the virtual players available to the current game account.

[0188] Optional player selection unit, including:

[0189] The player deduplication subunit is used to remove duplicate virtual players from the virtual players corresponding to multiple positions, so as to obtain the deduplicated virtual players corresponding to multiple positions.

[0190] The player selection subunit is used to select candidate virtual players from the virtual players corresponding to multiple positions after deduplication.

[0191] The above-described device is used to execute the method provided in the foregoing embodiments, and its implementation principle and technical effect are similar, so they will not be described again here.

[0192] These modules can be one or more integrated circuits configured to implement the above methods, such as one or more Application Specific Integrated Circuits (ASICs), one or more microprocessors, or one or more Field Programmable Gate Arrays (FPGAs). Alternatively, when a module is implemented using processing element scheduler code, the processing element can be a general-purpose processor, such as a Central Processing Unit (CPU) or other processor capable of calling program code. Furthermore, these modules can be integrated together as a system-on-a-chip (SOC).

[0193] Furthermore, the present invention also provides a terminal device.

[0194] Please refer to Figure 8 This is a schematic diagram of a terminal device provided in an embodiment of the present invention, such as... Figure 8 As shown, the terminal device 100 includes a processor 101, a storage medium 102, and a bus. The storage medium 102 stores program instructions that can be executed by the processor 101. When the terminal device 100 is running, the processor 101 and the storage medium 102 communicate through the bus. The processor 101 executes the program instructions to perform the above-described method embodiment. The specific implementation and technical effects are similar and will not be described again here.

[0195] Finally, optionally, the present invention also provides a computer-readable storage medium storing a computer program, which is executed by a processor as described in the above method embodiments. The specific implementation and technical effects are similar, and will not be repeated here.

[0196] In the several embodiments provided by this invention, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0197] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0198] Furthermore, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or in the form of hardware plus software functional units.

[0199] The integrated units implemented as software functional units described above can be stored in a computer-readable storage medium. These software functional units, stored in a storage medium, include several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) or processor to execute some steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0200] The above are merely specific embodiments of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A lineup recommendation method characterized by comprising: The method comprises: in response to a triggering event of the optimal lineup, traversing to calculate the highest total score of an i th virtual player in the candidate virtual players of the current game account at a vacant position in each position arrangement in the preset formation, to obtain an i th highest total score of the each position arrangement; i is an integer less than N and greater than 1, N is the number of the candidate virtual players possessed by the current game account; taking the highest total score of the i th highest total score and the i-1 th highest total score in the each position arrangement as an i th target highest total score in the each position arrangement; wherein, if the i th highest total score and the i-1 th highest total score in the target position arrangement are equal, it is determined that there are two different virtual player combination arrangement modes in the target position arrangement; determining an optimal position arrangement from the each position arrangement according to an N th target highest total score in the each position arrangement, and taking each virtual player placed in the optimal position arrangement as a target virtual player; determining that the arrangement mode of the target virtual player in the optimal position arrangement is an optimal lineup; displaying the optimal lineup on a graphical user interface of a terminal device.

2. The method of claim 1, wherein, Before the traversing to calculate the highest total score of an i th virtual player in the candidate virtual players of the current game account at a vacant position in each position arrangement in the preset formation, to obtain an i th highest total score of the each position arrangement, the method further comprises: if the number of virtual players possessed by the current game account exceeds the number of positions in the preset formation, screening the candidate virtual players from the virtual players possessed by the current game account.

3. The method of claim 2, wherein, The screening of the candidate virtual players from the virtual players possessed by the current game account comprises: obtaining a player score set of each position in the preset formation, the player score set of each position comprising: a matching score of each virtual player and the each position; selecting the number of virtual players corresponding to the each position from the virtual players possessed by the current game account according to the player score set of the each position; selecting the candidate virtual players from the number of virtual players corresponding to a plurality of positions.

4. The method of claim 3, wherein, Before the obtaining of the player score set of each position in the preset formation, the method further comprises: calculating the matching score of each virtual player and the each position according to the attributes of the each virtual player.

5. The method of claim 1, wherein, Before the traversing to calculate the highest total score of an i th virtual player in the candidate virtual players of the current game account at a vacant position in each position arrangement in the preset formation, to obtain an i th highest total score of the each position arrangement, the method further comprises: if the number of virtual players possessed by the current game account is equal to the number of positions in the preset formation, determining that the virtual players possessed by the current game account are the candidate virtual players.

6. The method of claim 3, wherein, The selecting of the number of virtual players corresponding to the each position from the virtual players possessed by the current game account according to the player score set of the each position comprises: sorting the matching score of the each virtual player and the each position in the player score set of the each position, to obtain a player score sorting set of the each position; According to the player score ranking set of each position, a virtual player corresponding to the position number of each position is selected from the virtual players possessed by the current game account.

7. The method of claim 3, wherein, The selecting the candidate virtual player from the virtual players corresponding to the position number of the plurality of positions comprises: The repeated virtual players in the virtual players corresponding to the position number of the plurality of positions are removed to obtain the virtual players corresponding to the position number of the plurality of positions after the removal of the repeated players; The candidate virtual player is selected from the virtual players corresponding to the position number of the plurality of positions after the removal of the repeated players.

8. A lineup recommendation apparatus characterized by comprising: The apparatus comprises: A computing module configured to, in response to a trigger event of the optimal formation, traverse to calculate a highest total score of an i th virtual player in the candidate virtual players of the current game account at a vacant position in each position arrangement in a preset formation, to obtain an i th highest total score of the each position arrangement; i is an integer less than N and greater than 1, and N is a quantity of the candidate virtual players possessed by the current game account; A comparing module configured to take a highest total score of the i th highest total score and an (i-1) th highest total score in the each position arrangement as a 1 st target highest total score in the each position arrangement; wherein, if the i th highest total score and the (i-1) th highest total score in the target position arrangement are equal, it is determined that there are two different virtual player combination arrangement modes in the target position arrangement; An optimal position arrangement determining module configured to determine an optimal position arrangement from the each position arrangement according to a N th target highest total score in the each position arrangement, and take each virtual player placed in the optimal position arrangement as a target virtual player; An optimal formation determining module configured to determine an arrangement mode of the target virtual player in the optimal position arrangement as an optimal formation; An optimal formation display module configured to display the optimal formation on a graphical user interface of a terminal device.

9. A terminal device, comprising: Comprise: A processor, a storage medium and a bus, the storage medium stores program instructions executable by the processor, when the terminal device is running, the processor and the storage medium communicate through the bus, the processor executes the program instructions to execute the steps of the formation recommendation method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, The storage medium stores a computer program, and the computer program is executed by the processor to execute the steps of the formation recommendation method according to any one of claims 1 to 7.

Images