Game progress graph generation method and device, electronic equipment and storage medium

Abstract

The application discloses a game progress graph generation method and device, electronic equipment and a storage medium. The method comprises the following steps: obtaining game match data of a target game match; the game match data comprises the identities of a plurality of virtual roles, the survival time lengths of the virtual roles, and the elimination relationships between the virtual roles; sorting the plurality of virtual roles according to a preset rule to obtain a target role sequence; for each virtual role in the plurality of virtual roles, at least one eliminated virtual role directly eliminated by the virtual role is sequentially sorted on the target side of the virtual role in the target role sequence according to the survival time lengths of the eliminated virtual roles from short to long; the target direction corresponds to the target side; and a game progress graph of the target game match is generated according to the target role sequence. In the game progress graph drawn by the application, the battle schematic line segments of different battle groups do not cross each other, and the readability of the game progress graph is improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of computer, in particular to a game progress chart generation method and device, electronic equipment and computer readable storage medium. BACKGROUND

[0002] As a kind of elimination game, competitive game is realized by one-on-one confrontation or team confrontation of multi-person team, and the winning party continues the game and the losing party is eliminated. For this kind of competitive game, the elimination relationship between players or teams and other game progress information are visualized by drawing game progress chart.

[0003] In the prior art, first, the players are randomly sorted, and for the case that two players fight and one is eliminated by the other, the fight schematic line segment is drawn between the two players, until only the winning player is left in the game, to generate the game progress chart of this game. Taking a game including 4 players as an example, first, player 1 fights player 2 and player 1 wins, and player 3 fights player 4 and player 3 wins. Then, player 1 fights player 3 and player 1 wins, and player 1 becomes the winning player of this game. As shown in Figure 1 , first, the 4 players are randomly sorted, for example, the order is player 1, player 2, player 3 and player 4, and the players are arranged in the order of the above position of the progress chart. Draw the fight schematic line segment 101 of player 1 and player 2, since player 2 is eliminated by player 1 and player 1 wins, draw player 1 behind the fight schematic line segment; similarly, draw the fight schematic line segment of player 3 and player 4, since player 4 is eliminated by player 3 and player 3 wins, draw player 3 behind the fight schematic line segment; then, draw the fight schematic line segment of player 1 and player 3. Since player 3 is eliminated by player 1 and player 1 wins to become the winning player of this game, draw the winning schematic box chart 102, i.e. champion-player 1, behind the fight schematic line segment of player 3 and player 1.

[0004] However, for games with more complex fight situations, using the progress chart drawing method provided by the prior art, the fight schematic line segments of different two-fight groups in the progress chart are prone to cross each other, resulting in poor readability of the game progress chart. As shown in Figure 2 , the fight schematic line segment 201 of player 6 and player 2 and the fight schematic line segment 202 of player 4 and player 7 cross each other. SUMMARY

[0005] The application provides a game progress diagram generation method and device, electronic equipment and a computer readable storage medium, to solve the problem that the progress diagram drawn for a game with a complex battle situation is prone to intersecting between battle schematic lines of different two-versus-two battle groups.

[0006] In a first aspect, the embodiments of the application provide a game progress diagram generation method, which comprises:

[0007] obtaining game session data of a target game session; the game session data comprises identifiers of a plurality of virtual roles, survival time lengths of the virtual roles, and elimination relationships between the virtual roles; wherein a winning virtual role is a virtual role with the longest survival time length among the plurality of virtual roles, a first virtual role group comprises virtual roles directly eliminated and indirectly eliminated by the winning virtual role, and the indirectly eliminated by the winning virtual role comprises being eliminated by a virtual role having an elimination relationship with the winning virtual role;

[0008] sorting the plurality of virtual roles according to a preset rule to obtain a target role sorting; wherein for each virtual role in the plurality of virtual roles, at least one eliminated virtual role directly eliminated by the virtual role is sequentially sorted in a target direction on a target side of the virtual role in the target role sorting according to the survival time length of the eliminated virtual role from short to long; the target direction corresponds to the target side;

[0009] generating a game progress diagram of the target game session according to the target role sorting.

[0010] In a second aspect, the embodiments of the application provide a game progress diagram generation device, which comprises:

[0011] an obtaining module configured to obtain game session data of a target game session; the game session data comprises identifiers of a plurality of virtual roles, survival time lengths of the virtual roles, and elimination relationships between the virtual roles; wherein a winning virtual role is a virtual role with the longest survival time length among the plurality of virtual roles, a first virtual role group comprises virtual roles directly eliminated and indirectly eliminated by the winning virtual role, and the indirectly eliminated by the winning virtual role comprises being eliminated by a virtual role having an elimination relationship with the winning virtual role;

[0012] determining a target role sequence according to a preset rule, wherein for each virtual role in the plurality of virtual roles, at least one eliminated virtual role directly eliminated by the virtual role is sequentially arranged in a target direction according to a survival time length of the eliminated virtual role from short to long in the target role sequence on a target side of the virtual role; the target direction corresponds to the target side;

[0013] generating a game progress graph of the target game session according to the target role sequence.

[0014] In a third aspect, an embodiment of the present application provides an electronic device, which comprises:

[0015] a memory and a processor, and the memory and the processor are coupled;

[0016] the memory is configured to store one or more computer instructions;

[0017] the processor is configured to execute the one or more computer instructions to implement the game progress graph generation method in any one of the first aspect.

[0018] In a fourth aspect, an embodiment of the present application provides a computer readable storage medium, which stores one or more computer instructions, and the instructions are executed by a processor to implement the game progress graph generation method in any one of the first aspect.

[0019] In a fifth aspect, an embodiment of the present application provides a computer program product, which comprises a computer program, and the computer program is executed by a processor to implement the game progress graph generation method in any one of the first aspect.

[0020] Compared with the prior art, the present application has the following advantages:

[0021] The game process diagram generation method provided in the application obtains game match data of a target game match; the game match data comprises the identities of a plurality of virtual characters, the survival time lengths of the virtual characters, and the elimination relationships between the virtual characters; wherein, the winning virtual character is the virtual character with the longest survival time length among the plurality of virtual characters, the first virtual character group comprises the virtual characters directly eliminated and indirectly eliminated by the winning virtual character, and the indirect elimination by the winning virtual character comprises elimination by the virtual character having an elimination relationship with the winning virtual character; the plurality of virtual characters are sorted according to a preset rule to obtain a target character order; wherein, for each virtual character in the plurality of virtual characters, at least one eliminated virtual character directly eliminated by the virtual character is sequentially sorted on the target side of the virtual character in the target direction according to the survival time lengths of the eliminated virtual characters from short to long; the target direction corresponds to the target side; and a game process diagram of the target game match is generated according to the target character order.

[0022] Compared with the prior art, the game process diagram drawn in the application does not have the problem of mutual intersection between the battle schematic line segments of different battle groups, thereby improving the readability of the game process diagram. In addition, taking the right side as the target side as an example, the left end of the second line connecting the first lines of the two virtual characters is always the killing virtual character in the two battle virtual characters, and the right end is always the eliminated virtual character. In this way, the problem of needing to mark the winner of the battle by other means in the game process diagram is avoided, especially for games with a large number of battles and complex battle situations, frequent annotations in the game process diagram will greatly reduce the readability of the game process diagram, thereby further improving the readability of the game process diagram. BRIEF DESCRIPTION OF DRAWINGS

[0023] The accompanying drawings used to provide further understanding of the application and form a part of the application, and the illustrative embodiments of the application and the description thereof are used to explain the application, and do not constitute improper limitations on the application. In the drawings:

[0024] Figure 1 One of the process diagrams drawn by using the prior art provided for the embodiments of the application;

[0025] Figure 2 The second one of the process diagrams drawn by using the prior art provided for the embodiments of the application;

[0026] Figure 3 The flowchart of the game process diagram generation method provided for the first embodiment of the application;

[0027] Figure 4 One of the initial game process diagrams provided for the first embodiment of the application;

[0028] Figure 5 Fig. 2 is a schematic diagram of an initial game progress chart provided by the first embodiment of the present application;

[0029] Figure 6 Fig. 3 is a schematic diagram of a game progress chart provided by the first embodiment of the present application;

[0030] Figure 7 Fig. 4 is a schematic diagram of a game progress chart provided by the first embodiment of the present application;

[0031] Figure 8 Fig. 5 is a schematic diagram of a game progress chart provided by the first embodiment of the present application;

[0032] Figure 9 Fig. 6 is a schematic diagram of a game progress chart provided by the first embodiment of the present application;

[0033] Figure 10 Fig. 7 is a schematic diagram of a game progress chart provided by the first embodiment of the present application;

[0034] Figure 11 Fig. 8 is a schematic diagram of a game progress chart generation device provided by the second embodiment of the present application;

[0035] Figure 12 Fig. 9 is a schematic diagram of the hardware structure of an electronic device provided by the third embodiment of the present application.

[0036] The specific embodiments of the present application have been shown in the above-mentioned drawings, and will be described in more detail hereinafter. These drawings and written descriptions are not intended to limit the scope of the concept of the present application by any means, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION

[0037] In order to make the purposes, advantages and features of the present application more clear, the present application will be described clearly and completely in the following in combination with the drawings and specific embodiments. In the following description, a lot of specific details are set forth in order to facilitate a full understanding of the present application. However, the described embodiments are only part of the embodiments of the present application, and all other embodiments obtained by those skilled in the art without any creative work fall within the scope of protection of the present application.

[0038] It should be noted that in the description of the present application, the terms "first", "second" and the like are used only for the purpose of description, and cannot be understood as indicating or implying relative importance, and a specific order or sequence. For those of ordinary skill in the art, the specific meaning of the above terms in the present application can be understood according to the specific circumstances. In addition, in the description of the present application, unless otherwise specified, the term "a plurality of" means two or more. The term "and / or" describes the association between the associated objects, which means that there can be three relationships, for example, A and / or B can represent the following three cases: A exists alone, A and B exist together, and B exists alone. The character " / " generally represents an "or" relationship between the associated objects. The terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusion, for example, a process, method, system, product or device that includes a series of steps or units does not have to be limited to those steps or units clearly listed, but can include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0039] To solve the above-mentioned problems, the present application provides a game progress chart generation method, a game progress chart generation device corresponding to the method, an electronic device capable of implementing the game progress chart generation method, and a computer readable storage medium. The following embodiments are provided to explain the above-mentioned method, device, electronic device and computer readable storage medium in detail.

[0040] In order to make the purpose, technical scheme of the present application more clear and intuitive, the following will combine the drawings and embodiments to explain the method provided by the embodiments of the present application in detail. It should be understood that the specific embodiments described herein are only used to explain the present application, and are not used to limit the present application. It can be understood that the following embodiments can exist independently, and the embodiments described below and the features in the embodiments can be combined with each other without conflict between the embodiments provided by the present application. For the same or similar content, it is not repeated in different embodiments. In addition, the step sequence in each method embodiment described below is only an example, not a strict limitation. In some cases, the steps shown or described can be executed in different order.

[0041] The application provides a game progress graph generation method and device, electronic equipment and a computer storage medium. Specifically, the game progress graph generation method of one embodiment of the application can be executed by a computer device, which can be a terminal or a server. The terminal can be a smart phone, a tablet computer, a notebook computer, a touch screen, a game console, a personal computer, and the like. The terminal can also include a client, which can be an application client, a browser client, an instant messaging client, or the like. The server can be a standalone physical server, a server cluster composed of multiple physical servers, or a distributed system. It can also be a cloud server that provides cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, and basic cloud computing services such as big data and artificial intelligence platforms.

[0042] In the following, the game progress graph generation method provided by the first embodiment of the application will be described in combination with Figure 3 Figure 3 The flowchart of the game progress graph generation method provided by the first embodiment of the application is shown in the following.

[0043] As Figure 3 shown, the method includes the following steps S301-S303:

[0044] S301, obtaining game match data of a target game match.

[0045] In the embodiment of the application, the game match data includes the identities of the virtual characters, the survival time of each virtual character, and the elimination relationship between the virtual characters. The winning virtual character is the virtual character with the longest survival time among the multiple virtual characters. The first virtual character group includes the virtual characters directly eliminated and indirectly eliminated by the winning virtual character. The indirect elimination by the winning virtual character includes elimination by a virtual character having an elimination relationship with the winning virtual character.

[0046] In the embodiment of the application, the game to which the target game match belongs is a competitive game in which the virtual characters compete with each other, or multiple virtual characters form teams and compete with each other. It should be noted that in the process of team vs. team competition, the member virtual characters of one team compete with the member virtual characters of another team. When all the member virtual characters in any team are eliminated, the team is determined to be eliminated.

[0047] ​It should be noted that in the embodiments of the present application, the game process graph generation method provided by the present application is exemplarily illustrated by taking the game scene of the confrontation between virtual characters as an example. The example game scene is only one example game scene in many competitive games to which the game process graph generation method provided by the present application can be applied, and the example game scene cannot constitute a limitation. In actual application, the game process graph generation method can also be used to generate a game process graph according to game data of other game scenes in competitive games.

[0048] In the embodiments of the present application, as the target game session proceeds, the elimination events (i.e., a virtual character is eliminated by another virtual character at a certain time) occurring between virtual characters at a certain time after the start of the target game session are recorded in real time until the winning virtual character is generated and the target game session ends, so that complete game session data is obtained. Wherein, a virtual character is eliminated by another virtual character at a certain time, and there is a direct elimination relationship between the two virtual characters, i.e., the former is directly eliminated by the latter, and the latter directly eliminates the former. The winning virtual character in the target game session is the virtual character with the longest survival time among all virtual characters included in the target game session. The first virtual character group includes virtual characters directly and indirectly eliminated by the winning virtual character. Wherein, the indirectly eliminated virtual character includes a virtual character eliminated by a virtual character having an elimination relationship with the winning virtual character.

[0049] It should be noted that all virtual characters included in the target game session except the winning virtual character are eliminated virtual characters. The survival time of the eliminated virtual character is the time length from the start time of the target game session to the time when the eliminated virtual character is eliminated. For example, virtual character 1 is killed and eliminated by virtual character 2 at the 5th second after the start of the target game session, and the survival time of virtual character 1 in the target game session is 5 seconds.

[0050] Next, the game session data in the embodiments of the present application is exemplarily illustrated in combination with Table 1.

[0051] Table 1

[0052]

[0053]

[0054] Wherein, the elimination time of the eliminated virtual character is the time corresponding to the time when the eliminated virtual character is eliminated, counted from zero starting from the start time of the target game session. That is, the time length between the time corresponding to the start of the target game session and the elimination time of the eliminated virtual character is the survival time of the eliminated virtual character in the target game session.

[0055] As shown in Table 1, the last row of data is the data of the winning virtual character, indicating that the survival time of the winning virtual character in the target game match is 473 seconds. Each row of data except the last row of data indicates a elimination event, and each row of data includes the identification of the killing virtual character in the elimination event, the identification of the eliminated virtual character, and the time when the eliminated virtual character is eliminated after the start of the target game match. For example, the eliminated virtual character identified as '930F4' in the second row of Table 1 is eliminated by the killing virtual character identified as '4EC15' at the 170th second after the start of the target game match, that is, the survival time of the eliminated virtual character identified as '930F4' in the target game match is 170 seconds.

[0056] In the embodiments of the present application, the eliminated virtual characters directly eliminated by the winning virtual character include virtual characters eliminated out of the game due to attack operations of the winning virtual character. Taking Table 1 as an example, the winning virtual character of the target game match is the virtual character identified as '4EC15', and the identifications of the eliminated virtual characters directly eliminated by the winning virtual character '4EC15' are '930F4', '343B1', and '76CA5', respectively.

[0057] In the embodiments of the present application, the eliminated virtual characters indirectly eliminated by the winning virtual character include virtual characters eliminated by virtual characters having an elimination relationship with the winning virtual character. The virtual characters having an elimination relationship with the winning virtual character refer to virtual characters directly eliminated and indirectly eliminated by the winning virtual character. Specifically, the eliminated virtual characters directly eliminated by the winning virtual character are referred to as first-type virtual characters, and the virtual characters indirectly eliminated by the winning virtual character include virtual characters directly eliminated by the first-type virtual characters (referred to as second-type virtual characters), virtual characters directly eliminated by the second-type virtual characters (referred to as third-type virtual characters), virtual characters directly eliminated by the third-type virtual characters (referred to as fourth-type virtual characters),..., and virtual characters directly eliminated by the (N-1)-th-type virtual characters without directly eliminating any virtual character (referred to as N-th-type virtual characters). That is, the virtual characters indirectly eliminated by the winning virtual character include the second-type virtual characters, the third-type virtual characters,..., and the N-th-type virtual characters.

[0058] For example, assuming that in the target game match, the winning virtual character directly eliminates virtual character 3, virtual character 3 directly eliminates virtual character 4, virtual character 4 directly eliminates virtual character 5 and virtual character 6, and virtual character 5 and virtual character 6 do not eliminate any virtual character, then the virtual characters indirectly eliminated by the winning virtual character include virtual character 4, virtual character 5, and virtual character 6.

[0059] S302, sort the plurality of virtual roles according to a preset rule to obtain a target role order; wherein, for each virtual role in the plurality of virtual roles, at least one eliminated virtual role directly eliminated by the virtual role is sequentially sorted in a target direction on a target side of the virtual role in the target role order according to the survival time length of the eliminated virtual role from short to long. Wherein, the target direction corresponds to the target side.

[0060] In the embodiments of the present application, the preset rule can be that for each virtual role, the virtual role directly eliminated by each virtual role is sequentially arranged on the target side of each virtual role in the target direction from short to long survival time. Wherein, the target direction includes but is not limited to from top to bottom, from bottom to top, from left to right, from right to left. The target side includes but is not limited to below, above, right side, left side. The correspondence between the target direction and the target side is shown in Table 2.

[0061] Table 2

[0062] Target direction Target side From top to bottom Below From bottom to top Above From left to right Right side From right to left Left side

[0063] Taking the target direction as from left to right and the target side as right side as an example, the sorting of the plurality of virtual roles according to the preset rule is described in detail. For each virtual role in the game match data, the following steps are performed: the virtual role directly eliminated by the virtual role is sequentially arranged on the right side of each virtual role in the order from left to right according to the survival time length from short to long, to obtain the role order corresponding to each virtual role. All virtual roles in the role order corresponding to the winning virtual role except the winning virtual role are determined as the first virtual role. For each first virtual role, the first virtual role in the role order corresponding to the winning virtual role is replaced by the role order corresponding to the first virtual role to update the role order corresponding to the winning virtual role. By analogy, finally all the role orders corresponding to the virtual roles are replaced into the updated role order corresponding to the winning virtual role, and the sorting is completed to obtain the target role order.

[0064] Next, the above sorting process is exemplarily described in combination with a specific example.

[0065] Suppose that the target game match includes 8 virtual characters, namely virtual character 1, virtual character 2, …, virtual character 10. Among them, suppose that the winning virtual character in the target game match is virtual character 3, and virtual characters 3, 4, and 5 directly eliminated other virtual characters, and virtual characters other than virtual characters 3, 4, and 5 did not eliminate any virtual characters. Assume that the role ranking corresponding to the winning virtual character-virtual character 3 is: virtual character 3, virtual character 4, virtual character 2, virtual character 6, the role ranking corresponding to virtual character 4 is: virtual character 4, virtual character 5, virtual character 7, and the role ranking corresponding to virtual character 5 is: virtual character 5, virtual character 8, virtual character 1. Then, first, replace virtual character 4 in the role ranking corresponding to the winning virtual character-virtual character 3 with the role ranking corresponding to virtual character 4, to obtain the updated role ranking corresponding to the winning virtual character: virtual character 3, virtual character 4, virtual character 5, virtual character 7, virtual character 2, virtual character 6. Next, replace virtual character 5 in the updated role ranking corresponding to the winning virtual character with the role ranking corresponding to virtual character 5, to obtain the updated role ranking corresponding to the winning virtual character: virtual character 3, virtual character 4, virtual character 5, virtual character 8, virtual character 1, virtual character 7, virtual character 2, virtual character 6, that is, the target role ranking is obtained.

[0066] S303, generating a game progress graph of the target game match according to the target role ranking.

[0067] In a possible implementation, generating the game progress graph of the target game match according to the target role ranking includes steps S3031-S3034.

[0068] S3031, determining first dimension data according to the target role ranking and the role identifiers in the game match data.

[0069] In the embodiment of the present application, the identifiers of all virtual characters in the target game match are sorted according to the target role ranking.

[0070] Optionally, the virtual character identifier includes any one of the following: a number of the virtual character, a survival time ranking of the virtual character, and a role identifier of the virtual character. The role identifier of the virtual character includes but is not limited to an image of a virtual hero played by the virtual character, and the present application does not make any limitation in this regard.

[0071] S3032, determining second dimension data according to the survival time in the game match data.

[0072] In the embodiments of the present application, the maximum value of the second dimension data is determined according to the survival time length of the winning virtual role in the game match data. For example, the maximum value of the second dimension data can be equal to the survival time length of the winning virtual role, or greater than a preset number threshold compared with the survival time length of the winning virtual role. For example, the survival time length of the winning virtual role in the game match data is 470 seconds, and the maximum value of the second dimension data can be determined as 500, and the data range of the second dimension data can be 0-500. The equal interval or non-equal interval division can be performed between the maximum value and the minimum value of the second dimension data. Taking the equal interval as an example, for example, the second dimension data range 0-500 is equally divided by an interval of 100, and a plurality of numerical points are obtained, which are 0, 100, 200, 300, 400 and 500. For another example, when the survival time length of the winning virtual role in the game match data is 470 seconds (about 7.83 minutes), taking the unit of the second dimension data as minutes as an example, the maximum value of the second dimension data is determined as 10 minutes, and the data range of the second dimension data can be 0-10. The equal interval division can be performed between the maximum value and the minimum value of the second dimension data, for example, the second dimension data range 0-10 is equally divided by an interval of 1, and a plurality of numerical points are obtained, which are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 and 10.

[0073] S3033, generating an initial game progress graph according to the first dimension data and the second dimension data, the initial game progress graph being a two-dimensional graph including the first dimension and the second dimension.

[0074] In the embodiments of the present application, a two-dimensional graph including the first dimension and the second dimension is drawn. The first dimension data is the virtual role identifier arranged according to the target role sorting, and the second dimension data is used to represent the survival time length.

[0075] Next, the initial game progress graph is exemplarily illustrated by combining Table 4 and Figure 5 , the initial game progress graph provided by the first embodiment of the present application is illustrated, Figure 4 , the initial game progress graph provided by the first embodiment of the present application is illustrated, Figure 5 , the initial game progress graph provided by the first embodiment of the present application is illustrated.

[0076] For example, according to the game match data in Table 1, the target role ranking corresponding to each virtual role identifier is: '4EC15', '930F4', '343B1', '76CA5', '8518B', '9EF6F', 'EE628', '1A9A6', '8BBDE', '8A87F', '63EF5', '74E46', that is, the first dimension data. As shown in Table 1, the survival time of the winning virtual role is 470 seconds, the unit of the second dimension data is minute, and the data range of the second dimension data is 0-10 minutes with an interval of 1 minute. The first dimension data can be horizontally distributed or vertically distributed, and correspondingly, the second dimension data can be vertically distributed or horizontally distributed. For example, the initial game progress graph drawn with the first dimension data horizontally distributed and the second dimension data vertically distributed is as shown in FIG. 1A, and the initial game progress graph drawn with the first dimension data vertically distributed and the second dimension data horizontally distributed is as shown in FIG. 1B. Figure 4 Figure 5

[0077] S3034, drawing a first mark line and a second mark line in the initial game progress graph according to the game match data.

[0078] In the embodiments of the present application, the first mark line is a line segment drawn in parallel with the second dimension with the first dimension data corresponding to the virtual role as the starting point, the second mark line is a line segment drawn connecting two end points in parallel with the first dimension with the end points being the end points of the first mark line corresponding to the virtual roles having the elimination and eliminated relationship, and the second dimension data corresponding to the end points of the line segment of the first mark line is the survival time of the eliminated virtual role among the virtual roles having the elimination and eliminated relationship.

[0079] Optionally, the implementation manner of the step S3034 of "drawing a first mark line and a second mark line in the initial game progress graph according to the game match data" includes the following steps K1-K2.

[0080] K1, for each virtual role in the plurality of virtual roles, in the case that the virtual role is a virtual role that has not eliminated any virtual role, drawing a first mark line in parallel with the second dimension with the first dimension data corresponding to the virtual role as the initial starting point, and the length of the line segment reaches the survival time corresponding to the virtual role.

[0081] K2, for each virtual role in the plurality of virtual roles, in the case that the virtual role directly eliminates M virtual roles, determining the first dimension data corresponding to the virtual role as the initial starting point, and performing the first step for M times, M being an integer greater than or equal to 1.

[0082] The first step includes S1-S5:

[0083] ​​S1, determine the i-th virtual character eliminated directly by the virtual character after the arrangement position of the virtual character in the target order as the target virtual character, i is a variable greater than or equal to 1, and the initial value of i is 1.

[0084] S2, judge whether it is the first time to execute the first step, if yes, draw a first scale line parallel to the second dimension along the initial starting point, and the length of the line segment reaches the second dimension data corresponding to the survival time of the target virtual character; if not, draw a first scale line parallel to the second dimension along the starting point determined by the last execution of the first step, and the length of the line segment reaches the second dimension data corresponding to the survival time of the target virtual character.

[0085] S3, draw a second scale line parallel to the first dimension with the end point of the first scale line of the virtual character as the starting point and the end point of the first scale line of the target virtual character as the terminal point.

[0086] S4, determine a point on the second scale line as the starting point.

[0087] S5, increase i by 1.

[0088] For example, combined with the game match data shown in Table 1, the steps K1-K2 draw the first scale line and the second scale line in the initial game progress graph, and the final game progress graph obtained is as shown in Figure 6 . Figure 6 is one of the schematic diagrams of the game progress graph provided by the first embodiment of the application.

[0089] The game process diagram generation method provided in the embodiments of the present application obtains game session data of a target game session. The game session data includes the identities of a plurality of virtual characters, the survival time lengths of the virtual characters, and the elimination relationships between the virtual characters. The plurality of virtual characters are sorted according to a preset rule to obtain a target character order. For each virtual character in the plurality of virtual characters, at least one eliminated virtual character directly eliminated by the virtual character is sequentially sorted on a target side of the virtual character in a target direction according to the survival time lengths of the eliminated virtual characters from short to long. The target direction corresponds to the target side. A game process diagram of the target game session is generated according to the target character order. In the game process diagram drawn by the present application, the battle schematic line segments of different battle groups do not cross each other, thereby improving the readability of the game process diagram. A battle group is composed of two virtual characters having a direct elimination relationship. The battle schematic line segment of the battle group includes part of the first marks corresponding to the two virtual characters and a second mark connecting the two first marks. In addition, taking the right side of the target side as an example, the left end of the second mark connecting the first marks of the two virtual characters is always the killing virtual character in the two battle virtual characters, and the right end is always the eliminated virtual character. In this way, the problem of needing to note the winner of the battle parties in the game process diagram through other means is avoided, especially for games with a large number of battle parties and complex battle situations. Frequent annotations in the game process diagram greatly reduce the readability of the game process diagram. Therefore, the present application can greatly improve the readability of the game process diagram.

[0090] On the basis of the above embodiments, optionally, a possible implementation of step S302 is exemplarily described below, including steps S3021-S3022.

[0091] S3021, according to the survival time length of the virtual character from short to long, the virtual character directly eliminated by the winning virtual character is sequentially arranged after the winning virtual character to obtain a first character order.

[0092] Taking the data shown in Table 1 as an example, step S3021 is exemplarily described. The winning virtual character in the game session data shown in Table 1 is '4EC15', and the virtual characters directly eliminated by the winning virtual character include '76CA5', '930F4', and '343B1'. According to the survival time length of the virtual character from short to long, the virtual characters directly eliminated by the winning virtual character are sequentially arranged after or on the right side of the winning virtual character to obtain a first character order: '4EC15', '930F4', '343B1', and '76CA5'.

[0093] S3022, for each virtual role in the first virtual role group, sorting the eliminated virtual roles directly eliminated by the virtual role according to the survival time length of the eliminated virtual role from short to long, to obtain a second role sorting corresponding to the virtual role.

[0094] In the embodiment of the present application, the first virtual role group includes virtual roles directly eliminated and indirectly eliminated by the winning virtual role, and the indirect elimination by the winning virtual role includes elimination by a virtual role having an elimination relationship with the winning virtual role.

[0095] Next, taking the virtual role '76CA5' directly eliminated by the winning virtual role in the data shown in Table 1 as an example, the determination of the second role sorting corresponding to the virtual role '76CA5' is exemplarily explained.

[0096] As shown in Table 1, the identifiers of the virtual roles directly eliminated by the virtual role '76CA5' are '9EF6F', '8518B', and 'EE628' respectively. According to the survival time length of the eliminated virtual roles from short to long, the eliminated virtual roles directly eliminated by the virtual role '76CA5' are sorted, and the second role sorting corresponding to the virtual role '76CA5' is obtained: '9EF6F', '8518B', 'EE628'.

[0097] S3023, for each virtual role in the first virtual role group, adding the second role sorting corresponding to the virtual role to the first role sorting after the virtual role, to obtain a target role sorting.

[0098] In the embodiments of the present application, the eliminated virtual characters directly eliminated by the winning virtual character are arranged after the winning virtual character according to the survival time length of the eliminated virtual characters from short to long, to obtain the first role sequence. In addition, for each virtual character in the first virtual character group, the eliminated virtual characters directly eliminated by the virtual character are sorted according to the survival time length of the eliminated virtual characters from short to long, to obtain the second role sequence corresponding to the virtual character. For each virtual character in the first virtual character group, the second role sequence corresponding to the virtual character is added to the first role sequence after the virtual character, to obtain the target role sequence. In the target role sequence determined by the present application, for each virtual character, the eliminated virtual characters directly eliminated by the virtual character are arranged on the right side of the virtual character according to the survival time length of the eliminated virtual characters from short to long. For each virtual character, the battle schematic line segment between the virtual character and the eliminated virtual character is drawn, and the battle schematic line segment between the virtual character and the eliminated virtual character with shorter survival time is drawn first. The survival time length of the eliminated virtual character in the battle schematic line segment determines the extension length of the first scale line in the battle schematic line segment. In the game progress diagram, the battle schematic line segment between the virtual character and the eliminated virtual character with shorter survival time is drawn first, and the battle schematic line segment between the virtual character and the eliminated virtual character with longer survival time is drawn later. The former battle schematic line segment is always located on one side of the latter battle schematic line segment, and the former battle schematic line segment and the latter battle schematic line segment always do not cross. Therefore, this can ensure that the game progress diagram drawn in the embodiments of the present application does not appear the situation that the battle schematic line segments of different battle groups cross each other, and improves the readability of the game progress diagram.

[0099] Alternatively, another possible implementation of the step S3034 of "drawing the first scale line and the second scale line in the initial game progress diagram according to the game match data" includes the following steps Q1-Q3:

[0100] Q1, for each virtual character in the plurality of virtual characters, a first scale line parallel to the second dimension and with a line segment length corresponding to the survival time length of the virtual character is drawn from the first dimension data corresponding to the virtual character as a starting point.

[0101] Q2, for each virtual character directly eliminated by the winning virtual character, a second scale line parallel to the first dimension and with an end point being an intersection point intersecting with the first scale line of the winning virtual character is drawn from the end point of the first scale line of the virtual character as a starting point.

[0102] Q3, for each virtual character in the first virtual character group, draw a second mark line parallel to the first dimension, with the end point of the first mark line of the virtual character directly eliminated by the virtual character as the starting point, and the end point as the intersection point intersecting with the first mark line of the virtual character.

[0103] For example, in combination with the game match data provided in Table 1, the game progress chart drawn by steps Q1-Q3 is as shown in Figure 7 Figure 7 The second schematic diagram of the game progress chart provided by the first embodiment of the present application.

[0104] Optionally, the implementation manner of the step "S4, determining a point on the second mark line as the starting point" can include the following steps: for two virtual characters having a direct elimination relationship connected by each second mark line, the virtual character eliminating the other virtual character is referred to as the target virtual character corresponding to the second mark line. A point between the midpoint of the second mark line and the end point of the first mark line of the target virtual character is determined as the starting point. For example, a point on the second mark line deviating from the end point of the first mark line of the target virtual character is determined as the starting point. Specifically, a point 1 / 3 position of the second mark line deviating from the end point of the first mark line of the target virtual character is determined as the starting point.

[0105] Optionally, in the game progress chart, a target symbol is marked at the starting point other than the initial starting point, and the target symbol is used to indicate that the virtual character directly eliminates the target virtual character.

[0106] Optionally, a target symbol is marked at the starting point other than the initial starting point, and the target symbol is used to indicate that the virtual character directly kills the target virtual character. For example, the target symbol includes but is not limited to one or more of the following: ×, Δ, *, etc., and the embodiments of the present application do not make any limitation on the marked target symbol.

[0107] Optionally, the first mark line of the winning virtual character and the first mark line of the virtual character other than the winning virtual character are displayed in different colors, and / or the first mark lines of different types of virtual characters are displayed in different degrees of solid and dashed lines. The types of virtual characters include at least one of the following: player virtual characters and non-player virtual characters. The player virtual character is a virtual character controlled by a player through a terminal, and the non-player character is a game character in an electronic game that is not manipulated by a real human player, such as an NPC.

[0108] ​For example, in combination with the game session data provided in Table 1, it is assumed that the types of the virtual characters identified as '8BBDE', '9EF6F', '74E46' in the target game session are non-player virtual characters, and the other virtual characters are player virtual characters, a target symbol 'X' is marked at the starting point except the initial starting point, and the game progress diagram drawn by using steps K1-K2 and the optional implementation manners described above is as shown in Figure 8 Figure 8 This is the third schematic diagram of the game progress diagram provided for the first embodiment of the present application.

[0109] As Figure 8 shown, in the game progress diagram, the first mark lines of the non-player virtual characters '8BBDE', '9EF6F', '74E46' are displayed as dotted lines, the first mark lines of the player virtual characters in the target game session are displayed as solid lines, a target symbol 'X' is marked at a point between the end points of the first mark line of the target virtual character on each second mark line, the first mark line of the winning virtual character, and the line segment between the lower end point of the first mark line and the target symbol on the adjacent second mark line are displayed as thick lines. Finally, the winner identification block 801 for indicating the end of the game progress diagram is drawn.

[0110] Further, optionally, when the target game session includes a naturally eliminated virtual character that does not exist a killer, the implementation manner of step S302 "sorting the plurality of virtual characters according to the preset rule to obtain a target character sorting" specifically includes steps S901-S903.

[0111] S901, according to the preset rule, the first type of virtual characters directly eliminated and indirectly eliminated by the winning virtual character are sorted, and the first type of eliminated virtual characters are arranged after the winning virtual character to obtain a third character sorting.

[0112] S902, according to the preset rule, the second type of eliminated virtual characters directly eliminated and indirectly eliminated by the naturally eliminated virtual character are sorted, and the second type of eliminated virtual characters are arranged after the naturally eliminated virtual character to obtain a fourth character sorting.

[0113] In the embodiments of the present application, the naturally eliminated virtual character is eliminated by a non-player virtual character.

[0114] The naturally eliminated situation includes: insufficient own blood volume, damage by the environment (such as poison circle, fire, etc.), which is not limited in the embodiments of the present application.

[0115] Optionally, for the description and explanation of steps S901-S902, reference can be made to the description and explanation of steps K1-K2 described above, and the same technical effects can be achieved. To avoid repetition, they will not be described here again.​

[0116] S903, obtaining the target role sequence according to the third role sequence and the fourth role sequence.

[0117] In the embodiment of the present application, when the target game session includes one naturally eliminated virtual role, the fourth role sequence is arranged before or after the third role sequence.

[0118] Optionally, when the target game session includes multiple naturally eliminated virtual roles, the third role sequence is arranged between the multiple fourth role sequences; or the third role sequence is arranged before or after a fifth role sequence composed of the multiple fourth role sequences.

[0119] In the embodiment of the present application, the first type of virtual roles directly eliminated and indirectly eliminated by the winning virtual role are sequenced according to the preset rule, and the first type of eliminated virtual roles are arranged after the winning virtual role to obtain the third role sequence. The second type of eliminated virtual roles directly eliminated and indirectly eliminated by the naturally eliminated virtual role are sequenced according to the preset rule, and the second type of eliminated virtual roles are arranged after the naturally eliminated virtual role to obtain the fourth role sequence. The target role sequence is obtained according to the third role sequence and the fourth role sequence. Since there is no direct elimination or indirect elimination relationship between the virtual roles in the third role sequence and the virtual roles in each fourth role sequence, and there is no direct elimination or indirect elimination relationship between the virtual roles included in different fourth role sequences, it can be ensured that the process diagram corresponding to the third role sequence and the process diagrams corresponding to each fourth role sequence do not cross each other in the drawn process diagram, and the process diagrams corresponding to each fourth role sequence do not cross each other, thereby improving the readability of the game process diagram.

[0120] Next, the implementation of the above steps S901-S903 will be exemplarily described in combination with Table 3 and a specific example. For the convenience of understanding, Table 3 is obtained by modifying Table 1.

[0121] Table 3

[0122]

[0123] It should be noted that, compared with Table 1, the difference of Table 3 is that the identification of the third-to-last row of the killed virtual role is empty, which indicates that the eliminated virtual role 'EE628' in the row is naturally eliminated (i.e., eliminated by a non-virtual role).

[0124] According to steps K1-K2, the third role ranking is obtained as: '4EC15', '930F4', '343B1', '76CA5', '8518B', '9EF6F', based on the data shown in Table 1. The fourth role ranking is 'EE628', '1A9A6', '8BBDE', '8A87F', '63EF5', '74E46'. The fourth role ranking is arranged after the third role ranking, and the target role ranking is obtained as: '4EC15', '930F4', '343B1', '76CA5', '8518B', '9EF6F', 'EE628', '1A9A6', '8BBDE', '8A87F', '63EF5', '74E46'.

[0125] Based on the method of the step "generating a game progress chart of a target game session according to a target role ranking", a game progress chart of the target game session shown in Table 3 is generated as shown in Figure 9 . Figure 9 This is the fourth schematic diagram of the game progress chart provided by the first embodiment of the present application.

[0126] As shown in Figure 9 , the game progress chart is drawn according to the game session data in Table 3. The game progress chart includes a progress chart part corresponding to the third role ranking and a progress chart part corresponding to the fourth role ranking. As shown in Figure 9 , the progress chart part corresponding to the third role ranking and the progress chart part corresponding to the fourth role ranking do not cross each other, which improves the readability of the game progress chart.

[0127] Further, the areas corresponding to different game starting periods in the game progress chart are drawn in different colors. For example, the game progress chart drawn according to the game session data shown in Table 3 is shown in Figure 10 The game period corresponding to the area 1001 can be the period corresponding to "shrinking the poison circle" in the target game session. It can be seen that in the case of shrinking the poison circle, the virtual role is eliminated, Figure 10 This is the fifth schematic diagram of the game progress chart provided by the first embodiment of the present application.

[0128] The game progress chart generation device provided by the present application is described below. The game progress chart generation device described below can be correspondingly referred to the game progress chart generation method described above.

[0129] Figure 11 This is a structural schematic diagram of the game progress chart generation device provided by the second embodiment of the present application. As shown in Figure 11 , the game progress chart generation device includes an acquisition module 1101, a determination module 1102, and a processing module 1103.

[0130] The acquisition module 1101 is configured to acquire game session data of a target game session, wherein the game session data comprises identification of a plurality of virtual roles, survival time length of each virtual role, and elimination relationship between the virtual roles; wherein a winning virtual role is a virtual role with the longest survival time length among the plurality of virtual roles, and a first virtual role group comprises virtual roles directly eliminated and indirectly eliminated by the winning virtual role, and the indirectly eliminated by the winning virtual role comprises elimination by a virtual role having an elimination relationship with the winning virtual role;

[0131] The determination module 1102 is configured to sort the plurality of virtual roles according to a preset rule to obtain a target role sorting; wherein for each virtual role in the plurality of virtual roles, at least one eliminated virtual role directly eliminated by the virtual role is sequentially sorted in a target direction along a target side of the virtual role according to survival time length of the eliminated virtual role from short to long in the target role sorting; the target direction corresponds to the target side;

[0132] The processing module 1103 is configured to generate a game progress graph of the target game session according to the target role sorting.

[0133] Optionally, the determination module 1102 is specifically configured to:

[0134] arrange the virtual roles directly eliminated by the winning virtual role in sequence after the winning virtual role according to survival time length of the virtual roles from short to long to obtain a first role sorting;

[0135] for each virtual role in the first virtual role group, sort the eliminated virtual roles directly eliminated by the virtual role according to survival time length of the eliminated virtual roles from short to long to obtain a second role sorting corresponding to the virtual role;

[0136] for each virtual role in the first virtual role group, add the second role sorting corresponding to the virtual role to the first role sorting after the virtual role to obtain a target role sorting.

[0137] Optionally, the processing module 1103 is specifically configured to:

[0138] determine first dimension data according to the target role sorting and role identification in the game session data;

[0139] determine second dimension data according to survival time length in the game session data;

[0140] According to the first dimension data and the second dimension data, an initial game progress graph is generated, the initial game progress graph being a two-dimensional graph including a first dimension and a second dimension;

[0141] According to the game match data, a first mark line and a second mark line are drawn in the initial game progress graph, the first mark line being a line segment drawn in parallel to the second dimension with the first dimension data corresponding to the virtual character as a starting point, the second mark line being a line segment connecting two end points of the first mark line corresponding to the virtual characters having an elimination and being eliminated relationship and drawn in parallel to the first dimension, the second dimension data corresponding to the end point of the first mark line being the survival time length of the eliminated virtual character among the virtual characters having the elimination and being eliminated relationship.

[0142] Optionally, the processing module 1103 is specifically configured to:

[0143] For each virtual character in the plurality of virtual characters, in a case where the virtual character is a virtual character that has not eliminated any virtual character, a first mark line is drawn in parallel to the second dimension with the first dimension data corresponding to the virtual character as an initial starting point, and the length of the line segment reaches the survival time length corresponding to the virtual character.

[0144] For each virtual character in the plurality of virtual characters, in a case where the virtual character directly eliminates M virtual characters, the first dimension data corresponding to the virtual character is determined as an initial starting point, and the M first steps are executed in a loop, the M being an integer greater than or equal to 1.

[0145] The first step includes:

[0146] The i-th virtual character directly eliminated by the virtual character located after the arrangement position of the virtual character in the target order is determined as a target virtual character, the i being a variable with a numerical value greater than or equal to 1, and the initial value of the i being 1.

[0147] It is judged whether the first step is executed for the first time, if yes, a first mark line is drawn in parallel to the second dimension with the initial starting point, and the length of the line segment reaches the second dimension data corresponding to the survival time length of the target virtual character; if not, a first mark line is drawn in parallel to the second dimension with the starting point determined by the last execution of the first step, and the length of the line segment reaches the second dimension data corresponding to the survival time length of the target virtual character.

[0148] A second mark line is drawn in parallel to the first dimension with the end point of the first mark line of the virtual character as a starting point and the end point of the first mark line of the target virtual character as an end point.

[0149] A point on the second marking line is designated as the starting point;

[0150] Increment i by 1.

[0151] Optionally, the processing module 1103 is specifically used for:

[0152] For each of the plurality of virtual characters, a first marker line is drawn, parallel to the second dimension, with the first dimension data corresponding to the virtual character as the starting point, and the length of the line segment is the second dimension data corresponding to the survival time of the virtual character;

[0153] For each virtual character that is directly eliminated by the winning virtual character, a second line is drawn, starting from the endpoint of the first line of the virtual character, parallel to the first dimension, and ending at the intersection point with the first line of the winning virtual character.

[0154] For each virtual character in the first virtual character group, starting from the endpoint of the first line of the virtual character that is directly eliminated by the virtual character, draw a second line parallel to the first dimension, with the endpoint being the intersection point of the first line of the virtual character.

[0155] Optionally, the target game match includes virtual characters that are naturally eliminated without any killers, and the processing module 1103 is specifically used for:

[0156] According to preset rules, the first type of virtual characters that are directly and indirectly eliminated by the winning virtual character are sorted, and the first type of eliminated virtual characters are placed after the winning virtual character to obtain the third character sorting.

[0157] According to the preset rules, the second type of eliminated virtual characters, which were directly and indirectly eliminated by natural elimination, are sorted, and the second type of eliminated virtual characters are placed after the naturally eliminated virtual characters to obtain the fourth character sorting.

[0158] The target role ranking is obtained based on the third role ranking and the fourth role ranking.

[0159] Optionally, the target game match includes multiple naturally eliminated virtual characters, each naturally eliminated virtual character corresponding to a fourth character sorting; the processing module 1103 is specifically used for:

[0160] Arrange the third role among the multiple fourth roles; or...

[0161] The third role sequence is arranged before or after a fifth role sequence composed of a plurality of fourth role sequences.

[0162] Optionally, the processing module 1103 is specifically configured to:

[0163] A point between the midpoint of the second reticle and the endpoint of the first reticle of the virtual role is determined as the starting point.

[0164] Optionally, the processing module 1103 is further configured to:

[0165] A target symbol is marked at the starting point other than the initial starting point, and the target symbol is used to indicate that the virtual role directly eliminates the target virtual role.

[0166] Optionally, the processing module 1103 is further configured to:

[0167] The first reticle of the winning virtual role is displayed in a different color from the first reticle of the virtual role other than the winning virtual role, and / or the first reticle of different types of virtual roles is displayed in different degrees of solid and dashed lines.

[0168] The type of virtual role includes at least one of the following: a player virtual role and a non-player virtual role.

[0169] Optionally, the identification of the virtual role includes any one of the following: a number of the virtual role, a survival time length ranking of the virtual role, and a role identification of the virtual role.

[0170] The game progress graph generation device provided in the embodiment can be used to execute the technical solutions of the game progress graph generation method embodiments described above, and has similar implementation principles and technical effects, which will not be described here again.

[0171] Figure 12 The hardware structure schematic diagram of the electronic device provided in the third embodiment of the present application is shown in FIG. 12, and the electronic device 1200 of the embodiment includes a processor 1201 and a memory 1202. Figure 12

[0172] The memory 1202 is used to store computer execution instructions.

[0173] The processor 1201 is used to execute the computer execution instructions stored in the memory to implement each step executed by the game progress graph generation method in the above-mentioned embodiments. For details, please refer to the related description in the foregoing method embodiments.

[0174] Optionally, the memory 1202 can be independent or integrated with the processor 1201. ​

[0175] When the memory 1202 is independently provided, the electronic device further includes a bus 1203 for connecting the memory 1202 and the processor 1201.

[0176] The fourth embodiment of the present application further provides a computer readable storage medium, and the computer readable storage medium stores computer execution instructions. When a processor executes the computer execution instructions, the corresponding technical solutions of the game progress graph generation method in any one of the above embodiments executed by the electronic device are implemented.

[0177] The fifth embodiment of the present application further provides a computer program product, and the program product includes a computer program. The computer program is stored in a readable storage medium. At least one processor of an electronic device can read the computer program from the readable storage medium. The at least one processor executes the computer program to enable the electronic device to execute the corresponding technical solutions of the game progress graph generation method in any one of the above embodiments.

[0178] It should be noted that the detailed description of the apparatus, the electronic device, the computer readable storage medium, and the computer program product provided in the second embodiment, the third embodiment, the fourth embodiment, and the fifth embodiment of the present application can refer to the related description of the first embodiment of the present application, which will not be described here.

[0179] The present application is disclosed in the preferred embodiments as above, but it is not intended to limit the present application. Any person skilled in the art can make possible changes and modifications without departing from the spirit and scope of the present application. Therefore, the protection scope of the present application should be subject to the scope defined by the claims of the present application.

[0180] In the several embodiments provided by the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. The division of the modules is only a logical function division. There can be another division manner in actual implementation. For example, a plurality of modules can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the modules shown or discussed can be indirect coupling or communication connection through some interfaces, devices or modules, and can be electrical, mechanical or other forms.

[0181] The integrated modules implemented in the form of software functional modules can be stored in a computer readable storage medium. The software functional modules stored in the storage medium include a plurality of instructions for enabling an electronic device (which can be a personal computer, a server, or a network device, etc.) or a processor (English: processor) to perform some steps of the methods described in the various embodiments of the present application.

[0182] It should be understood that the above processor can be a central processing module (English: Central Processing Unit, for short: CPU), and can also be other general-purpose processors, digital signal processors (English: Digital Signal Processor, for short: DSP), application specific integrated circuits (English: Application Specific Integrated Circuit, for short: ASIC), etc. The general-purpose processor can be a microprocessor, or the processor can also be any conventional processor, etc. The steps of the method disclosed in combination with the application can be directly embodied as hardware processor execution, or executed by a combination of hardware and software modules in the processor.

[0183] The memory can include a high-speed RAM memory, and can also include a non-volatile storage NVM, such as at least one disk memory, and can also be a U disk, a mobile hard disk, a read-only memory, a magnetic disk or an optical disk, etc.

[0184] The bus can be an industry standard architecture (Industry Standard Architecture, ISA) bus, a peripheral component interconnect (Peripheral Component, PCI) bus, or an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. For the convenience of representation, the bus in the drawings of the present application does not limit only one bus or one type of bus.

[0185] The above storage medium can be realized by any type of volatile or non-volatile storage device or their combination, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic storage, flash memory, magnetic disk or optical disk. The storage medium can be any available medium that can be accessed by a general-purpose or special-purpose computer.

[0186] Those skilled in the art can understand that all or part of the steps of the above-mentioned method embodiments can be completed by program instruction related hardware. The above-mentioned program can be stored in a computer readable storage medium. The program executes to execute the steps of the above-mentioned method embodiments; and the above-mentioned storage medium includes ROM, RAM, magnetic disk or optical disk and various storage medium that can store program code.

[0187] Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, but not to limit them; although the present application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that: it can still modify the technical solutions recorded in the foregoing embodiments, or make equivalent replacement for part or all of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the scope of the technical solutions of the embodiments of the present application.

Claims

1. A game progress map generation method characterized by comprising: The method comprises: obtaining game session data of a target game session; the game session data comprises identification of a plurality of virtual roles, survival time length of each virtual role, and elimination relationship between the virtual roles; wherein a winning virtual role is a virtual role with the longest survival time length among the plurality of virtual roles, a first virtual role group comprises virtual roles directly eliminated and indirectly eliminated by the winning virtual role, and indirect elimination by the winning virtual role comprises elimination by a virtual role having an elimination relationship with the winning virtual role; sorting the plurality of virtual roles according to a preset rule to obtain a target role sorting; wherein for each virtual role in the plurality of virtual roles, at least one eliminated virtual role directly eliminated by the virtual role is sequentially sorted in a target direction along a target side of the virtual role in the target role sorting according to survival time length of the eliminated virtual role from short to long; the target direction corresponds to the target side; generating a game progress graph of the target game session according to the target role sorting.

2. The method of claim 1, wherein, The sorting of the plurality of virtual roles according to the preset rule to obtain the target role sorting comprises: arranging the virtual roles directly eliminated by the winning virtual role in sequence after the winning virtual role according to survival time length of the virtual roles from short to long to obtain a first role sorting; for each virtual role in the first virtual role group, sorting the eliminated virtual roles directly eliminated by the virtual role according to survival time length of the eliminated virtual roles from short to long to obtain a second role sorting corresponding to the virtual role; for each virtual role in the first virtual role group, adding the second role sorting corresponding to the virtual role to the first role sorting after the virtual role to obtain a target role sorting.

3. The method of claim 1, wherein, The generating of the game progress graph of the target game session according to the target role sorting comprises: determining first dimension data according to the target role sorting and role identification in the game session data; determining second dimension data according to survival time length in the game session data; generating an initial game progress graph according to the first dimension data and the second dimension data, the initial game progress graph being a two-dimensional graph comprising a first dimension and a second dimension; drawing a first mark line and a second mark line in the initial game progress graph according to the game session data, the first mark line being a line segment drawn in parallel with the second dimension with the first dimension data corresponding to the virtual role as a starting point, and the second mark line being a line segment connecting two endpoints of the first mark line corresponding to virtual roles having an elimination and elimination relationship and parallel with the first dimension, the second dimension data corresponding to the endpoints of the line segment of the first mark line being survival time length of the eliminated virtual roles among the virtual roles having the elimination and elimination relationship.

4. The method of claim 3, wherein, The drawing of the first mark line and the second mark line in the initial game progress graph according to the game session data comprises: For each of the plurality of virtual characters, in the case that the virtual character has not eliminated any virtual character, a first scale line is drawn in parallel to the second dimension and with a length reaching the survival time length corresponding to the first dimension data of the virtual character, starting from the first dimension data of the virtual character; For each of the plurality of virtual characters, in the case that the virtual character has eliminated M virtual characters, the first dimension data of the virtual character is determined as the initial starting point, and the M first steps are executed in a loop, where M is an integer greater than or equal to 1; The first step includes: The i-th virtual character eliminated by the virtual character after the arrangement position of the virtual character in the target order is determined as a target virtual character, where i is a variable with a value greater than or equal to 1, and the initial value of i is 1; It is determined whether the first step is executed for the first time. If yes, a first scale line is drawn in parallel to the second dimension and with a length reaching the second dimension data corresponding to the survival time length of the target virtual character, starting from the initial starting point. If no, a first scale line is drawn in parallel to the second dimension and with a length reaching the second dimension data corresponding to the survival time length of the target virtual character, starting from the starting point determined in the last execution of the first step. A second scale line is drawn in parallel to the first dimension, starting from the endpoint of the first scale line of the virtual character and ending at the endpoint of the first scale line of the target virtual character. A point on the second scale line is determined as the starting point. The i is incremented by 1.

5. The method of claim 3, wherein, The first scale line and the second scale line are drawn in the initial game progress diagram according to the game session data, including: For each of the plurality of virtual characters, a first scale line is drawn in parallel to the second dimension and with a length reaching the second dimension data corresponding to the survival time length of the virtual character, starting from the first dimension data of the virtual character. For each of the virtual characters eliminated by the winning virtual character, a second scale line is drawn in parallel to the first dimension, starting from the endpoint of the first scale line of the virtual character and ending at the intersection point intersecting with the first scale line of the winning virtual character. For each of the virtual characters in the first virtual character group, a second scale line is drawn in parallel to the first dimension, starting from the endpoint of the first scale line of the virtual character and ending at the intersection point intersecting with the first scale line of the virtual character.

6. The method of claim 1, wherein, The target game session includes natural eliminated virtual characters without killers, and the plurality of virtual characters are sorted according to a preset rule to obtain a target character order, including: The first type of virtual characters directly and indirectly eliminated by the winning virtual character are sorted according to a preset rule, and the first type of eliminated virtual characters are arranged after the winning virtual character to obtain a third character order. According to the preset rule, the second type of eliminated virtual characters directly eliminated and indirectly eliminated by the naturally eliminated virtual characters are sorted, and the second type of eliminated virtual characters are arranged after the naturally eliminated virtual characters, to obtain a fourth character ranking; According to the third character ranking and the fourth character ranking, a target character ranking is obtained.

7. The method of claim 6, wherein, The target game session includes a plurality of naturally eliminated virtual characters, and each naturally eliminated virtual character corresponds to a fourth character ranking; and the target character ranking is obtained according to the third character ranking and the fourth character ranking, including: The third character ranking is arranged between a plurality of fourth character rankings; or The third character ranking is arranged before or after a fifth character ranking composed of a plurality of fourth character rankings.

8. The method of claim 4, wherein, The point on the second mark line is determined as the starting point, including: A point between the midpoint of the second mark line and the endpoint of the first mark line of the virtual character is determined as the starting point.

9. The method of claim 8, wherein, After the point on the endpoint of the first mark line of the virtual character on the second mark line is determined as the starting point, the method further includes: A target symbol is marked at the starting point other than the initial starting point, and the target symbol is used to indicate that the virtual character directly eliminates the target virtual character.

10. The method of claim 3, wherein, The method further includes: The first mark line of the winning virtual character and the first mark line of the virtual character other than the winning virtual character are displayed in different colors, and / or the first mark lines of different types of virtual characters are displayed in different degrees of solid and dashed lines; Wherein, the type of virtual character includes at least one of the following: player virtual character and non-player virtual character.

11. The method of claim 1, wherein, The identification of the virtual character includes any one of the following: the number of the virtual character, the survival time of the virtual character, and the role identification of the virtual character.

12. A game progress map generating apparatus characterized by comprising: The device includes: An acquisition module is configured to acquire game session data of a target game session; the game session data includes identification of a plurality of virtual characters, survival time of each virtual character, and elimination relationship between the virtual characters; wherein, a winning virtual character is a virtual character with the longest survival time among the plurality of virtual characters, a first virtual character group includes virtual characters directly eliminated and indirectly eliminated by the winning virtual character, and the indirectly eliminated by the winning virtual character includes being eliminated by a virtual character having an elimination relationship with the winning virtual character; A determination module is configured to sort the plurality of virtual characters according to a preset rule to obtain a target character ranking; wherein, for each virtual character in the plurality of virtual characters, at least one eliminated virtual character directly eliminated by the virtual character is sequentially sorted on a target side of the virtual character along a target direction according to survival time of the eliminated virtual character from short to long in the target character ranking; the target direction corresponds to the target side; A processing module is configured to generate a game progress chart of the target game session according to the target character ranking.

13. An electronic device, comprising: The electronic device includes: A processor; and A memory for storing a data processing program, which, when executed by the processor of the electronic device, performs the game flow chart generation method of any one of claims 1-11.

14. A computer-readable storage medium, characterized in that, A memory for storing a data processing program, which, when executed by the processor of the electronic device, performs the game flow chart generation method of any one of claims 1-11.

Images