Game information processing method, program product and electronic equipment

By providing a virtual practice interface in strategy games, players can preview the expedition process, adjust team configuration and expedition time, solving the problem of failure caused by calculation errors for novice players and improving the success rate of expeditions.

CN120900204APending Publication Date: 2025-11-07NETEASE (HANGZHOU) NETWORK CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202511029584.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-07-25
Publication Date
2025-11-07

AI Technical Summary

Technical Problem

In strategy games, novice players often fail when conquering high-level territories due to miscalculations, resulting in serious injuries to generals, troop losses, and wasted resources. This increases the uncertainty of expeditions and reduces the success rate of the team's campaigns.

Method used

A method for processing game information is provided, which displays a virtual training interface on a terminal, showing the team scheduling slot and virtual teams, and generates combat progress information based on the association parameters between the target virtual team and the target plot, allowing players to preview the expedition process in the virtual training interface and adjust team configuration and expedition time.

Benefits of technology

It reduced the computational complexity of expeditions, improved the accuracy of strategic decisions, and increased the success rate of expeditions.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120900204A_ABST
    Figure CN120900204A_ABST
Patent Text Reader

Abstract

According to the game information processing method provided by the invention, the graphical user interface is provided through the terminal, and the graphical user interface displays the game scene; the method comprises the steps that in response to a sign rehearsal operation for a target plot in a game scene, a virtual drilling interface is displayed, and the virtual drilling interface displays a team scheduling slot and a virtual team; in response to a configuration operation of adding the virtual team to the team scheduling slot, determining a target virtual team, and generating combat process information based on correlation parameters of the target virtual team and the target land parcel; and displaying the combat process information on the virtual drilling interface. Therefore, the player can preview the combat condition of each team and the final land occupation condition in real time, the calculation pressure is effectively reduced, and the success rate of takeout is improved.
Need to check novelty before this filing date? Find Prior Art

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of computer, and particularly relates to a game information processing method, a program product and an electronic device. BACKGROUND

[0002] This section is intended to provide background information to the embodiments of the present disclosure recited in the claims. The description herein does not constitute admission that the information provided herein is prior art to the present disclosure.

[0003] In some strategy games, players need to mobilize multiple teams to jointly attack high-level lands. This process needs to be calculated carefully before the attack instruction is launched. For novice players, if they do not understand the combat situation of each team and the final land occupation situation, they are likely to fail due to calculation errors, resulting in heavy casualties of Wujiang, loss of soldiers and resources, and increasing uncertainty of the attack, and reducing the success rate of the attack.

[0004] Therefore, there is an urgent need for a more efficient attack rehearsal method to improve the success rate of the attack. SUMMARY

[0005] The present disclosure provides a game information processing method, a program product and an electronic device to at least partially solve the above problems in the related art.

[0006] The present disclosure provides a game information processing method, a program product and an electronic device to at least partially solve the above problems in the related art.

[0007] According to a first aspect of the present disclosure, a game information processing method is provided, a graphical user interface is provided by a terminal, and the graphical user interface displays a game scene; the method comprises: in response to an attack rehearsal operation on a target land in the game scene, displaying a virtual rehearsal interface, the virtual rehearsal interface displays a team scheduling slot and a virtual team; in response to a configuration operation of adding the virtual team to the team scheduling slot, determining a target virtual team, generating combat process information based on an association parameter of the target virtual team and the target land; and displaying the combat process information in the virtual rehearsal interface.

[0008] According to a second aspect of the present disclosure, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the method of the first aspect and possible implementation manners thereof.

[0009] According to a third aspect of the present disclosure, an electronic device is provided, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the executable instructions to perform the method of the first aspect and possible implementation manners thereof.

[0010] In an information processing method of a game in at least one embodiment of the present disclosure, a graphical user interface is provided by a terminal, and the graphical user interface displays a game scene; the method comprises: in response to a mobilization preview operation on a target plot in the game scene, displaying a virtual drill interface, the virtual drill interface displays a team scheduling slot and a virtual team; in response to a configuration operation of adding the virtual team to the team scheduling slot, determining a target virtual team, generating combat process information based on an association parameter of the target virtual team and the target plot; and displaying the combat process information in the virtual drill interface. In this way, the player can preview the cooperative combat effect of multiple teams in real time, reduce the mobilization calculation complexity, and improve the accuracy of strategic decision-making.

[0011] In order to make the above objectives, characteristics and advantages of the present application more obvious and easy to understand, the following preferred embodiments are specifically described below, and the accompanying drawings are described in detail as follows. BRIEF DESCRIPTION OF DRAWINGS

[0012] The above and other objects, features and advantages of the exemplary embodiments of the present disclosure will be more apparent from the following detailed description taken in conjunction with the accompanying drawings, in which: Figure 1 A schematic diagram of a system architecture in an embodiment of the present disclosure is schematically shown.

[0013] Figure 2 A flowchart of an information processing method of a game in an embodiment of the present disclosure is schematically shown.

[0014] FIG. 3 schematically shows an interface diagram in an embodiment of the present disclosure.

[0015] FIG. 4 schematically shows a combat process preview diagram in an embodiment of the present disclosure.

[0016] Figure 5 A structural diagram of an electronic device provided in an embodiment of the present disclosure is schematically shown.

[0017] In the drawings, the same or corresponding reference numerals denote the same or corresponding parts. DETAILED DESCRIPTION

[0018] The exemplary embodiments of the present disclosure will be described more fully hereinafter with reference to the accompanying drawings.

[0019] In order to better understand the present disclosure, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, rather than all the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by those skilled in the art without creative work should fall within the scope of protection of the present disclosure.

[0020] It should be noted that the terms "first", "second", and the like in the description and claims of the present disclosure and the above drawings are used to distinguish similar objects, and do not necessarily have to describe a specific order or sequence. It should be understood that the data thus used can be interchanged under appropriate circumstances, so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. In addition, 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.

[0021] The accompanying drawings are schematic illustrations of the present disclosure and are not necessarily drawn to scale. Some of the block diagrams shown in the drawings can be functional entities, which do not necessarily have to correspond to physically or logically independent entities. These functional entities can be implemented in the form of software, or in hardware modules or integrated circuits, or in networks, processors or microcontrollers. The embodiments can be implemented in various forms and should not be understood as being limited to the examples set forth herein. The features, structures or characteristics described in the present disclosure can be combined in any suitable manner in one or more embodiments. In the following description, many specific details are provided to give a sufficient understanding of the embodiments of the present disclosure. However, those skilled in the art should realize that one or more specific details can be omitted from the implementation of the technical solutions of the present disclosure, or other methods, components, devices, steps, etc. can be used instead of one or more specific details.

[0022] Figure 1A system architecture diagram showing the running environment of the present exemplary embodiment is shown. The system architecture can include a terminal device 110, a server 120. The terminal device 110 can be a mobile phone, a tablet computer, a personal computer, a smart wearable device, a game console, etc. The terminal device 110 has a display function and can display a graphical user interface, which can include an interface of an operating system or an interface of an application program, etc. The terminal device 110 is installed with an application program, which can be a game program. The server 120 generally refers to a background system providing a game service in the present exemplary embodiment, which can be a server or a cluster of multiple servers. For example, the server 120 is deployed with a game server program for performing game data processing on the server side. The terminal device 110 and the server 120 can be connected through a wired or wireless communication link to perform data transmission. The method in one exemplary embodiment of the present disclosure can be performed by any one or more of the terminal device 110 and the server 120.

[0023] In an embodiment, the above method can be implemented and executed based on a cloud interaction system. The cloud interaction system can be the above system architecture. Various cloud applications can be run under the cloud interaction system, for example, cloud gaming. Taking cloud gaming as an example, cloud gaming can be a game mode based on cloud computing. In the running mode of cloud gaming, the running subject of the game program and the presentation subject of the game picture are separated, and the storage and running of the control and interaction method in the game are completed on the cloud gaming server (which can be the above server 120), and the cloud gaming client (which can be the above terminal device 110) functions to receive and send data and present game pictures. For example, the cloud gaming client can be a display device close to the user side with a data transmission function, such as a mobile terminal, a television, a computer, a palmtop computer, etc.; and the information processing is performed by the cloud gaming server in the cloud. When playing the game, the user operates the cloud gaming client to send operation instructions to the cloud gaming server, the cloud gaming server runs the game according to the operation instructions, encodes and compresses the game picture data, returns the data to the cloud gaming client through the network, and finally decodes and outputs the game picture through the cloud gaming client.

[0024] In an embodiment, the above method can be implemented by the terminal device 110 alone. For example, without deploying the server 120, the terminal device 110 can run the application program in a single machine environment to realize the game function and execute the above method.

[0025] According to an embodiment of the present disclosure, a game information processing method is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described herein can be executed in a different order.

[0026] According to an embodiment of the present disclosure, a game information processing method can include the following steps: S1: in response to a deployment preview operation on a target plot in a game scene, a virtual rehearsal interface is displayed, the virtual rehearsal interface displays a team scheduling slot and a virtual team.

[0027] S2: in response to a configuration operation of adding a virtual team to the team scheduling slot, a target virtual team is determined, and battle process information is generated based on the association parameters of the target virtual team and the target plot.

[0028] S3: the battle process information is displayed on the virtual rehearsal interface.

[0029] Through the embodiments of the present disclosure, the player can preview the deployment process in the virtual rehearsal interface, adjust the team configuration and the deployment time, so as to improve the success rate of deployment.

[0030] Optionally, the graphical user interface (GUI) provided by the terminal is the main interface for the player to interact with the game, through which the player can intuitively see the virtual team and the target plot in the game scene. The virtual team in the game scene can be a unit controlled by the player, and the target plot is a plot that the player needs to obtain through a deployment operation. These plots can be plots controlled by the enemy forces, or neutral plots not controlled by any force.

[0031] Optionally, the deployment preview operation is an interactive operation for triggering the display of the virtual rehearsal interface. The deployment preview operation can be a long press, a double press, a click, a drag, etc. In an optional embodiment, the deployment preview operation is a trigger operation on a troop display control. After detecting the selection of the target plot in the game scene, the interface displays the troop display control, and after further detecting the trigger operation of the user on the troop display control, the virtual rehearsal interface is displayed. The troop display control is an interactive component for triggering the virtual rehearsal interface.

[0032] For example, the troop display control can be a button, a menu, a pop-up window, etc. Figure 3aAs shown, the target plot 301 is displayed in the game map, and the player selects the target plot 301 to display the troop control control. After clicking the control, the virtual drill interface is entered, the virtual drill interface displays the team head portrait owned by the player, and a plurality of team scheduling slots. After the player drags the team to different scheduling slots, the interface displays the combat progress information of the team, including marching time, battle time point with the garrison, force change, garrison recovery period and combat result. The player can further adjust the time of the team by dragging the team identifier on the team bar, observe the real-time updated combat result, and finally select the optimal scheme to execute the expedition.

[0033] Among them, the virtual drill interface is an interactive interface for the player to perform expedition strategy pre-rehearsal, integrating team scheduling and real-time feedback function of combat process demonstration.

[0034] Exemplarily, as shown in the figure, Figures 3b-3c As shown, the layout of the virtual drill interface can display the head identifier of all the expedition teams of the player in the side area, supporting quick drag operation; a plurality of horizontally arranged team scheduling slots 305 are arranged in the middle bottom area, each slot corresponds to a team; after dragging the team to the slot, the marching, combat and garrison recovery events of the team are displayed through the time axis 307, and different event types are distinguished by color coding (such as green for marching, red for combat, and blue for garrison recovery); the upper middle area also provides a result preview area 309 to summarize the final occupation state, force loss and combat result of each stage in the form of text.

[0035] Optionally, the virtual drill interface can also provide more auxiliary functions, such as displaying detailed information of the target plot, including the number of garrison, recovery time, endurance, etc. These information can help the player to understand the situation of the target plot more comprehensively, so as to make more reasonable expedition decision.

[0036] Among them, the team scheduling slot is a core interactive component in the virtual drill interface for carrying virtual team configuration, and its core function is to realize flexible allocation of multi-team expedition time and collaborative strategy adjustment.

[0037] Optionally, each slot supports adding or removing virtual teams by dragging, and the number of slots matches the number of teams that can be scheduled by the player at the same time, usually supporting 2-4 slots.

[0038] Among them, the combat progress information is dynamic prediction data generated by the system based on the parameters of the virtual team and the target plot.

[0039] Optionally, the combat progress information can be calculated by associated parameters, which can include (1) the moving speed of the virtual team and the departure location to determine the marching time; (2) the initial troop strength, recovery period and battle rules (such as 5 minutes of rest after a draw) of the target plot garrison; (3) the matching degree of the combat attribute (such as attack value and defense value) of the virtual team and the endurance of the garrison. The system will calculate the marching time, combat time with the garrison, and troop strength change of each team according to these parameters, so as to generate detailed combat progress information.

[0040] Optionally, the combat progress information can be displayed in the following ways: (1) time axis in minutes, supporting zoom-in view of details; (2) battle results marked with icons (such as red △ for defeat and green ○ for victory); (3) troop strength change curve in the form of line chart superimposed below the time axis; (4) garrison recovery period marked with blue shadow area. For example, when the departure time of the two teams is adjusted, the time axis will be dynamically updated: the first team wins over garrison 1 at 11:05, and the recovery period (11:10-11:15) of garrison 2 is displayed in shadow, and when the second team launches an attack at 11:16, the troop strength of garrison 2 is only restored to 50% of the initial value, and the battle result is predicted as "victory, garrison 2 is destroyed".

[0041] In an optional embodiment, the associated parameters include at least one of the following: departure location information of the target virtual team; moving speed parameter of the target virtual team; defense team configuration information of the target plot; combat attribute parameter of the target virtual team. By comprehensively considering the correlation of multi-dimensional parameters, the system can accurately generate combat progress prediction that conforms to the actual game rules.

[0042] The departure location information refers to the coordinate position where the virtual team is initially located.

[0043] The moving speed parameter represents the displacement ability of the virtual team per unit time, which is used to quantitatively calculate the time span required for the team to march.

[0044] The defense team configuration information refers to the formation structure and attribute parameters of the garrison in the target plot, which is used to simulate the confrontation conditions in real combat.

[0045] Optionally, the defense team configuration information can include a hierarchical structure. For example, the target plot is provided with two layers of garrison: the first layer of garrison has 10000 troop strength and attack attribute of 800; the second layer of garrison has 5000 troop strength but defense attribute of 1200. The system needs to generate a phased confrontation process according to the battle rules (such as defeating the first layer of garrison to trigger the second layer of battle). If the virtual team is defeated by the first layer of garrison, the battle will be directly terminated; if the first layer of garrison is defeated, the second layer of garrison will automatically enter the combat phase.

[0046] Optionally, the defense team configuration information is associated with a recovery mechanism. For example, the garrison is defeated and enters a 5-minute recovery period, during which it cannot fight again. The system needs to clearly mark the garrison recovery period in the timeline and prompt the player to adjust the subsequent team's departure time. For example, if the first team defeats the garrison at 10:00, the garrison will recover its strength at 10:05. If the second team departs at 10:04, the system needs to accurately calculate whether it can arrive before the garrison recovers.

[0047] Optionally, the defense team configuration information can include dynamic adjustment rules. For example, if the target plot belongs to a strategic fortress, the garrison configuration will increase with the number of player attacks. The system needs to preset a configuration upgrade formula (such as increasing the garrison strength by 5% for each attack), and automatically calculate the real-time attribute value of the garrison when multiple teams are working together. For example, the first team's attack causes the garrison strength to increase to 10500, and the second team needs to calculate the battle result prediction data based on the updated configuration.

[0048] Among them, the battle attribute parameter refers to the quantitative value of the virtual team in the attack, defense, speed and other dimensions.

[0049] Optionally, the battle attribute parameter can include a composite calculation formula. For example, the battle result determination formula is: total damage of the attacking side = attack value × (1 + critical hit rate) - defense value × defense coefficient. The system needs to substitute each parameter into the formula to calculate the specific value, for example, when the virtual team's attack value is 800, the critical hit rate is 20%, the garrison's defense value is 700, and the defense coefficient is 0.8, the total damage is 800 × 1.2 - 700 × 0.8 = 960 - 560 = 400. If the current strength of the garrison is 500, the attack will directly defeat the garrison.

[0050] Optionally, the battle attribute parameter can also be equipped with system linkage calculation. For example, the virtual team equips a weapon that can enhance the attack value by 15%, and wears a defense accessory that can increase the defense value by 20%. The system needs to identify the equipment attributes and add them to the base parameters. For example, if the base attack value is 700, the equipment addition is 15% after the attack value becomes 805; and without the defense accessory, the defense value remains at 600. At this time, the system needs to update the parameter combination in real time and regenerate the battle result prediction data.

[0051] For example, when the player adds a virtual team to the dispatch slot in the battle mode, the system calculates the marching time of the team according to its departure location (such as a camp 50 kilometers away from the target plot) and moving speed (such as moving 10 kilometers per hour); at the same time, combined with the defense configuration of the target plot (such as garrison 1 having 2000 strength and garrison 2 having 3000 strength), and the attack attribute of the team (such as attack value 800 and defense value 600), the specific time axis and strength change prediction of the team fighting with the garrison are generated.

[0052] In an optional embodiment, the combat process information is displayed in a time axis, and the combat process information includes: a marching time period of the target virtual team; a combat time period of the target virtual team and a defense force of the target plot; a recovery time period of the defense force; and combat result prediction data of the target virtual team and the defense force. By displaying multiple dimensions of the combat process in the time axis, the player can intuitively grasp the deployment rhythm and risk distribution, and reduce the complexity of multi-condition collaborative calculation.

[0053] For example, the time axis is displayed in the form of a horizontal coordinate axis, with time information marked on the left side and event types marked on the right side. For example, when the virtual team A is dragged into the dispatch slot, the time axis displays: 10:00 departure (start of the marching time period), 10:15 arrival at the target plot and battle with the garrison 1 (combat time period), 10:18 defeat and retreat (result prediction data), and the recovery time of the garrison 1 is from 10:23 to 10:33 (recovery time period). If a second team B is added, the time axis synchronously displays the action trajectories of the two teams and marks the conflict points. For example, if team B departs at 10:10, it will arrive at 10:25 and be able to battle with the garrison 1 in the recovery period, realizing coordinated suppression.

[0054] The time axis is an icon for visualizing the interaction process of the virtual team and the defense force of the target plot. By displaying the combat time axis, discrete marching, combat, and recovery events are integrated into a continuous time sequence, helping users quickly identify key time nodes and event correlations.

[0055] Optionally, the time axis can be designed in a hierarchical structure, with the upper layer displaying the basic time scale, the middle layer distinguishing the marching / combat / recovery stages with different color blocks, and the lower layer marking specific events with text. For example, the marching stage is represented by a blue gradient color block, the combat stage is distinguished by red (defeat), green (victory), and yellow (tie) according to the result prediction data, and the recovery stage is marked with a gray background. The time axis supports zooming operation, and users can double-finger slide to expand the local time interval and view the event details with 0.5-minute precision. This hierarchical design allows players to observe the accurate matching relationship between the marching time and the garrison recovery period when adjusting the deployment time.

[0056] Optionally, the timeline event annotations can adopt a dynamic prioritization mechanism. When multiple events occur at the same time point, the system ranks them according to their importance: the combat result prediction data is displayed at the top layer, the marching time period annotations are in the middle, and the recovery time period information is displayed at the bottom layer in a semi-transparent manner. For example, if the end of the garrison recovery and the arrival of the team at the combat occur at 10:20, the system will highlight the "end of garrison recovery" event, and the team arrival event will be annotated below in a smaller font. This mechanism avoids visual confusion caused by information stacking and ensures that the core decision basis is always the focus of user attention.

[0057] wherein the marching time period is a specific time interval from triggering to arrival of the virtual team at the target plot.

[0058] Optionally, the marching time period is dynamically presented on the timeline as a gradient color block. The starting point of the color block corresponds to the departure time, and the ending point marks the arrival time. The transparency of the color block gradually deepens over time. For example, when the user adjusts the team departure time to 10:00, the color block gradually changes from light blue from 10:00 to 10:02, and the color block reaches full transparency at 10:02 and triggers the "arrival" event annotation. This visual feedback mechanism allows users to intuitively perceive the cascading impact of the departure time adjustment on subsequent combat events.

[0059] wherein the combat time period is a specific time interval during which the virtual team fights the defense forces of the target plot.

[0060] Optionally, the calculation of the combat time period is based on a battle simulation engine. The system performs real-time confrontation deduction based on the attack attributes of the virtual team and the defense parameters of the garrison, generating the duration of the battle and the probability distribution of the result. For example, if the attack power of the virtual team is 800 and the defense power of the garrison is 600, the system simulates a 1.5-minute battle duration with a 75% chance of victory. This engine supports multi-round battle calculation, and when a tie occurs, a 5-minute rest period is automatically extended and the battle simulation is retriggered.

[0061] wherein the recovery time period is a time interval during which the defense forces of the target plot enter a rest state after continuous combat.

[0062] wherein the combat result prediction data is a battle simulation result derived based on the attribute parameters of the virtual team and the defense forces of the target plot. Its role is to quantitatively display key indicators such as force changes and occupation success rates, assisting users in assessing the risk-reward ratio of the expedition plan.

[0063] In an optional implementation, the combat result prediction data includes at least one of the following: the combat results of the defense forces in each combat time period; the force changes of the target virtual team; the occupation status of the target plot.

[0064] Optionally, the battle result prediction is based on the dynamic calculation of the attack and defense attribute values of the target virtual team and the configuration parameters of the defense force. For example, when the attack attribute of the target virtual team is higher than the defense value of the defense force, the system determines that the battle result is a victory; if the attributes are similar, it is determined as a draw, triggering the defense force recovery mechanism.

[0065] Optionally, the prediction of the battle result considers the synergistic effect of multiple teams. For example, when the first team fails in the battle with the defense force but causes significant damage to the defense force, if the second team launches an attack within the defense force recovery period, it will win. At this time, the system automatically calculates the defense force recovery time window by analyzing the time difference between the two teams, and marks the operable synergy period on the time axis. For example, if the defense force recovery time is 5 minutes, an attack launched within 2 minutes of the defense force recovery period can win, then the interface will highlight the area where the time difference between the two teams is within 2 minutes, guiding the player to choose this period to maximize the synergistic effect.

[0066] Among them, the force change situation refers to the system's quantitative prediction of the target virtual team's force loss or recovery in different combat stages.

[0067] Optionally, the force change data is generated by real-time calculation of the initial force value of the target virtual team and the damage value of each stage. For example, when the team encounters the defense force 1, the system calculates the damage ratio according to the difference between the attack and defense attributes: if the attack attribute is 10% higher than the defense value, the defense force causes 80% damage; if the attributes are the same, the damage ratio is 50%. This calculation logic needs to consider the team's recovery ability parameters such as "5% force recovery after battle" and other settings. For example, if the team enters a rest state after a draw, the system will automatically add the recovery value and mark the force recovery period on the time axis.

[0068] Optionally, the visualization form of force change adopts the dynamic numerical bar mode. For example, set a force percentage progress bar below the time axis, which shortens in real time as the battle stage advances; at the same time, display the force value of the key nodes on the right side of the team bar, such as "10:15 encounters defense force 1, force remaining 70%; 10:20 rest ends, restored to 75%". When the battle causes the force to be lower than 20%, the system automatically triggers a red warning prompt.

[0069] Optionally, the basis for determining the occupation state includes whether all defending forces are completely defeated, whether the synergy effect of multiple teams meets the conditions, and the like. For example, when both defending force 1 and defending force 2 are defeated by at least one team, and the surviving team does not retreat, it is determined that the occupation is successful. The system calculates the final state by traversing all battle results on the time axis: if there is a defending force that is not defeated, it is marked as a failure; if all defending forces are eliminated and at least one team survives, it is marked as a success. This logic needs to exclude the scenario where the occupation fails due to the complete defeat of the team.

[0070] As shown in FIG. 10, the virtual drill interface displays an example of one of the battle process drill examples in which two teams successfully occupy one of the target plots through coordinated operations: team 1 departs at 10:44, and team 2 departs at 10:47; team 1 encounters defending force 1 at 10:50 and fights to a draw, with a loss of 2500 troops, and enters a recuperation phase; at 10:55, team 1 encounters defending force 1 again and wins, with a loss of 500 troops; at 10:56, team 1 encounters defending force 2 and loses, with a loss of 4800 troops, and begins to retreat; defending force 2 enters a recovery period; at 10:56, team 2 fights and wins against defending force 2, which is in a recovery state, and the recovery time of defending force 2 has not yet ended. Finally, it is displayed that the target plot is successfully occupied, and a prompt message “Occupation state: success” is displayed. Figure 4a As shown in FIG. 11, the virtual drill interface displays another example of a battle process drill example in which two teams successfully occupy one of the target plots through coordinated operations: team 2 departs at 10:41, and team 1 departs at 10:44. At 10:50, team 1 encounters defending force 1 and fights to a draw, with a loss of 2500 troops, and enters a recuperation phase; at this time, team 2 marches to the target plot and fights against defending force 2 at 10:50. Defending force 2 has just fought to a draw with team 1, so the strength of defending force 2 is reduced, and team 2 can easily win. Team 2 encounters defending force 2 at 10:51 and enters a recuperation state. After team 1 recovers from the previous battle, team 1 fights against defending force 2 at 10:55. At this time, because defending force 2 is still in the recuperation state after fighting to a draw with team 2, the strength of defending force 2 has not been fully recovered, so team 1 easily wins against defending force 2. Finally, it is displayed that the target plot is successfully occupied, and a prompt message “Occupation state: success” is displayed.

[0071] Figure 4b In an optional embodiment, it further includes: in response to an operation of adjusting the departure time of a target virtual team in the team scheduling slot, updating the departure time of the target virtual team; and regenerating the battle process information based on the updated departure time. In this way, the player can adjust the departure time of the team in real time and preview the battle result.

[0072] In an optional embodiment, it further includes: in response to an operation of adjusting the departure time of a target virtual team in the team scheduling slot, updating the departure time of the target virtual team; and regenerating the battle process information based on the updated departure time. In this way, the player can adjust the departure time of the team in real time and preview the battle result.

[0073] ​The out-of-battle time adjustment operation refers to an operation of modifying the out-of-battle time of the virtual team by the user through the graphical interface interaction behavior. The function is to enable the player to dynamically modify the preset out-of-battle time to explore the influence of different time points on the combat result.

[0074] Optionally, the out-of-battle time adjustment operation can be realized through a multi-level interaction mode. For example, the user can directly drag the team identifier on the time axis, or input the specific time value manually by clicking the time node input box on the time axis, or realize time jump adjustment in combination with a shortcut key combination (such as Ctrl + drag). The operation needs to respond to the user input in real time to avoid interface feedback lag caused by operation delay.

[0075] For example, when the player drags the team identifier in the team bar of a certain team to the right by 3 minutes in the virtual training interface, the system automatically updates the out-of-battle time of the team to a new time point, and recalculates the marching time period, the combat time window with the garrison, and the force change prediction. For example, if team 1 is originally scheduled to start at 10:00 and encounter the recovery period of the garrison, after adjustment, the system displays that it will start at 10:03, and generates a detailed process simulation of the combat between the team and the garrison at 10:08 in real time.

[0076] In an optional embodiment, the combat progress information is displayed on a time axis, and the time axis displays the team identifier of the target virtual team. The out-of-battle time adjustment operation includes a drag operation on the team identifier in the time axis.

[0077] Optionally, the out-of-battle time point and progress state of each virtual team are represented by graphical elements (such as bars, icons or labels) on the time axis. For example, different teams are distinguished by color, the marching time span is represented by the length of the bar, or the current operation object is prompted by dynamic animation. For example, when the user hovers the mouse over a team identifier, the time axis highlights the combat time node of the team and the garrison, and a window pops up to display the combat attribute parameters thereof.

[0078] Optionally, the time axis supports multi-level zooming function. When the user zooms in the time axis to a shorter time period (such as 1 minute accuracy), the out-of-battle time point of the team identifier can be accurately adjusted; when zoomed to a longer time period (such as 10 minute accuracy), the coordinated combat stages of multiple teams in the same time period are displayed in an aggregated form. For example, when zoomed to 5 minute accuracy, the time axis combines the rest states of multiple teams in the same time period to avoid information overload.

[0079] Optionally, the drag operation of the team identifier in the timeline can be to drag the identifier of the target virtual team, change its time of departure in real time, and trigger the system to recalculate the battle progress. When the user starts to drag the identifier of a team, the timeline displays the moving speed parameter and the distance to the target plot of the team, and estimates the marching time; during the dragging process, the system dynamically draws the battle timeline of the team and the garrison, and immediately refreshes the data in the result preview area when the mouse is released.

[0080] For example, when the player drags the identifiers of two teams to different positions in the virtual training interface, the system updates the marching time, the battle result prediction, and the force change data of the two teams in real time. For example, if the player drags the identifier of the second team to the right for 3 minutes, the system displays that the team will launch an attack exactly during the garrison recovery period, thereby improving the overall success rate of the battle.

[0081] In an optional embodiment, there are multiple virtual teams, and there are multiple team scheduling slots. Further comprising: when multiple virtual teams are added to multiple team scheduling slots, analyzing the coordinated battle feasibility of the target virtual teams in the multiple team scheduling slots; and adjusting the time of departure of the multiple target virtual teams based on the coordinated battle strategy. Through intelligent adjustment of the multi-team coordination strategy, the success probability of multi-team coordinated battle can be improved, and the player's dependence on complex time calculation can be reduced.

[0082] The coordinated battle strategy is a time of departure adjustment rule designed by the system for multiple virtual teams, aiming to optimize the battle sequence on the timeline to form tactical coordination among multiple teams.

[0083] Optionally, the implementation of the coordinated battle strategy includes the following steps: Establish a garrison recovery cycle model: generate a recovery window marker on the timeline according to the garrison recovery time parameter of the target plot (e.g., 10 minutes per time); Predict the battle result sequence of each team: based on the team battle attributes and the garrison configuration, calculate the battle result probability distribution of each team at different times of departure; Generate a time conflict matrix: compare the overlapping situations of the marching time period, the battle time period, and the garrison recovery window of multiple teams, and mark the conflict or coordination nodes; Through a dynamic programming algorithm, search for a combination of times of departure on the timeline that meets the following conditions: The first battle time of the subsequent team falls within the garrison recovery window caused by the previous team; The total force loss of multiple teams is lower than the superimposed loss of separate departures; The marching path of each team does not cause new conflicts due to time adjustment.

[0084] Optionally, the visualization of the coordinated battle strategy includes: The timeline is superimposed with the battle events of each team and the garrison recovery markers; When the multi-team dispatch slot is selected, the system recommends a deployment time interval; If the player manually adjusts beyond the recommended interval, the interface will real-time mark the strategy deviation (e.g. display a warning icon when the deviation is > 30%).

[0085] Optionally, the coordinated battle strategy supports player-defined tactical preferences. For example: When the "minimize troop loss" mode is selected, the system prioritizes adjusting the deployment time to reduce the probability of battle failure; When the "shortest total time" mode is selected, the system focuses on compressing the total time span for multiple teams to complete the battle; The system provides preset strategy templates (e.g. "encirclement tactics", "wave suppression"), which can be loaded and fine-tuned by the player with one key.

[0086] For example, after the player drags two virtual teams to different dispatch slots in the virtual training interface, the system analyzes the matching relationship between the movement speed, deployment time, and target plot garrison recovery period of the two teams in real time. If the system determines that the two teams will fight independently and possibly fail at the current deployment time, it will automatically pop up a coordination suggestion, prompting to delay the deployment time of the second team by 4 minutes. After the player adjusts, the interface displays the two teams' battle timelines in real time: the first team retreats at 10:56 due to defeat, causing the garrison to recover to 11:01; the second team deploys at 11:00 and launches an attack during the garrison recovery period, ultimately successfully occupying the plot.

[0087] In an optional implementation, the coordinated battle strategy includes: making subsequent virtual teams fight after the preceding virtual teams weaken the garrison; making multiple virtual teams fight in sequence during the garrison recovery period.

[0088] Among them, the subsequent virtual team refers to the virtual team that deploys after the preceding team in the coordinated battle strategy according to the timeline order. The preceding virtual team refers to the virtual team that deploys first in the coordinated battle strategy according to the timeline order.

[0089] Optionally, the deployment time of the subsequent virtual team is dynamically calculated by the system according to the battle results of the preceding team. For example, if the preceding team ends the battle with the garrison at 10:00 and causes it to enter a 5-minute recovery period, the system will recommend a deployment window of 10:05 to 10:06 for the subsequent team. Within this time period, although the garrison has recovered, it has not fully recovered its initial strength, and the subsequent team can take advantage of the time difference to win. If the player manually adjusts the deployment time of the subsequent team beyond the recommended window (e.g. to 10:07), the system will display the negative result in real time: the garrison fully recovers to fight, causing the subsequent team to fail due to strength disadvantage.

[0090] Optionally, the battle attributes of the prequel virtual team need to match the garrison characteristics. For example, if the garrison is known for high defense attributes, the system will prefer to recommend a prequel team with high siege value; if the garrison has a long recovery period, the system will select a prequel team with high troop strength but low attack speed to delay time. In the virtual drill interface, the team slot of the prequel team will display its attribute comparison data with the garrison: such as "siege value 6000 vs garrison defense value 5500", and mark the expected percentage of garrison troop loss (such as 70%). Help players intuitively evaluate the adaptability of the prequel team.

[0091] Among them, the garrison recovery period refers to the passive rest time period that the garrison enters after being attacked, during which the garrison cannot actively fight and the combat effectiveness is not fully recovered.

[0092] Optionally, the length and triggering conditions of the garrison recovery period are preset by game rules. For example, if the garrison is drawn with the virtual team, it enters a 5-minute recovery period; if it is completely defeated, the recovery period is extended to 10 minutes.

[0093] For example, when two teams participate in the drill, the system first analyzes the battle results of the prequel team and the garrison: if the prequel team successfully weakens the garrison troops, the departure time of the subsequent team will be adjusted to the critical point of the garrison recovery period. For example, if the garrison recovery time is 10 minutes, the prequel team fights with the garrison after 10:00 and makes it enter the recovery period, and the subsequent team is set to depart at 10:05, at this time the garrison is not fully recovered and the combat effectiveness is reduced, so the subsequent team can have a higher probability of victory. At the same time, the operation time axis of multiple teams will be dynamically adjusted to ensure that the attack actions of each team closely link the interval period of the garrison recovery.

[0094] In an optional implementation, it also includes: in response to the departure confirmation operation, controlling the target virtual team to perform a departure behavior on the target plot according to the departure time indicated by the departure process information.

[0095] Among them, the departure confirmation operation refers to the operation of the user triggering the team departure execution instruction through the graphical interface, which is used to convert the strategy in the virtual drill stage into actual game behavior.

[0096] Optionally, the departure confirmation operation can be triggered through a separate control in the interface, such as a "one-key departure" button or a confirmation gesture.

[0097] Among them, the departure behavior refers to the process of automatically controlling the virtual team to move to the target plot and participate in the battle according to the preset departure time.

[0098] For example, when the player adjusts the departure time of the two teams to the recommended coordination window by dragging in the virtual rehearsal interface, the interface displays the "one-key departure" control. After the player triggers the control, the system automatically controls the first team to depart at 10:50 and the second team to depart at 11:00. The marching routes and the defense combat results of the two teams are completely consistent with the rehearsal results, and finally the target land is successfully occupied without the real-time monitoring or manual intervention of the player.

[0099] In an optional implementation, when the combat progress information indicates that the target land is successfully occupied, a departure execution control is displayed in the virtual rehearsal interface; wherein, the departure confirmation operation is a triggering operation on the departure execution control.

[0100] For example, as shown in Figure 4a When the system determines that the simulation result of the certain strategic land is successful occupation, a "one-key departure" control is dynamically displayed at the bottom of the virtual rehearsal interface. At this time, the player clicks the control, and the system automatically executes the departure time scheduling of the multiple virtual teams to ensure that each team strictly executes the marching and combat according to the time axis node in the rehearsal, thereby avoiding the failure caused by manual operation delay.

[0101] The departure execution control is an interactive component in the virtual rehearsal interface for triggering the actual departure behavior.

[0102] In an optional implementation, the target virtual team executes the departure behavior on the target land according to the departure time indicated by the departure progress information, including: when there are multiple target virtual teams, controlling the multiple target virtual teams to execute the departure behavior on the target land according to the departure time indicated by the departure progress information in sequence.

[0103] Optionally, the sequential execution of the departure behavior can be that multiple virtual teams successively launch attacks on the target land according to a predetermined time sequence, so as to ensure that the departure time of each team is connected to each other to achieve the coordinated combat effect.

[0104] In an optional implementation, in response to the departure rehearsal operation on the target land in the game scene, the virtual rehearsal interface is displayed, including: in response to the selection operation on the target land in the game scene, the simulation control is displayed; and in response to the triggering operation on the simulation control, the virtual rehearsal interface is displayed.

[0105] For example, when the player clicks a high-level land (target land) on the game map, the interface pops up a simulation control. The control prompts the availability in a dynamic highlight form. When the player clicks the control, the game interface automatically switches to the virtual rehearsal interface.

[0106] The exemplary embodiments of the present disclosure also provide a computer program product. The computer program product includes a computer program, which, when executed by a processor, implements the above method.

[0107] In an embodiment, the computer program product can be a tangible product containing the computer program, such as a computer-readable storage medium storing the computer program. The readable storage medium can be a storage medium based on electrical, magnetic, optical, electromagnetic, infrared, and the like signals, including but not limited to: random access memory (RAM), read-only memory (ROM), magnetic tape, floppy disk, flash memory (Flash), mechanical hard disk (HDD), solid state disk (SSD), and the like. For example, the computer program product can be implemented as a non-volatile storage medium storing the computer program, such as a read-only memory, a Nand Flash, and the like.

[0108] In an embodiment, the computer program product can be an intangible product containing the computer program. For example, the computer program product can be implemented as a virtual digital product, such as an executable file, an installation package, and the like digital file storing the computer program.

[0109] The code of the computer program can be written in one or more programming languages. The programming languages include C, Java, C++, and the like. The program code can be executed entirely on the user computing device, or partially on the user computing device, or as a separate software package, or partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case involving a remote computing device, the remote computing device can be connected to the user computing device through any kind of network, such as a local area network (LAN), a wide area network (WAN), and the like, or can be connected to an external computing device (for example, through an Internet connection provided by an operator).

[0110] The computer program can be carried or transmitted by electrical, magnetic, optical, electromagnetic, infrared, and the like signals. The electronic device can convert the signals carrying the computer program into digital signals, and then run the computer program. When the computer program is running on the electronic device, its code is used to make the electronic device execute (more specifically, can make the processor of the electronic device execute) the method steps of various exemplary embodiments of the present disclosure, for example: an information processing method of a game, a graphical user interface is provided by a terminal, and the graphical user interface displays a game scene; the method includes: in response to a deployment preview operation on a target plot in the game scene, displaying a virtual rehearsal interface, the virtual rehearsal interface displays a team scheduling slot and a virtual team; in response to a configuration operation of adding the virtual team to the team scheduling slot, determining a target virtual team, generating battle process information based on the association parameters of the target virtual team and the target plot; and displaying the battle process information in the virtual rehearsal interface.

[0111] An exemplary embodiment of the present disclosure also provides an electronic device. The electronic device can include a processor and a memory. The memory stores executable instructions of the processor, such as a computer program. The processor executes the method steps of various exemplary embodiments of the present disclosure by executing the executable instructions. In addition, the electronic device can also include a display for displaying a graphical user interface.

[0112] The following will be described with reference to Figure 5 The electronic device is exemplarily illustrated in the form of a general computing device. It should be understood that Figure 5 The electronic device 600 shown is merely an example and should not limit the functions and use range of the embodiments of the present disclosure.

[0113] As Figure 5 shown, the electronic device 600 can include a processor 610, a memory 620, a bus 630, an I / O (Input / Output) interface 640, a network adapter 650, and a display 660.

[0114] The memory 620 can include a volatile memory, such as a RAM 621, a cache unit 622, and can also include a non-volatile memory, such as a ROM 623. The memory 620 can also include one or more program modules 624, which include but are not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination thereof can include implementation of a network environment. For example, the program modules 624 can include the modules in the above-described apparatus.

[0115] The processor 610 can include one or more processing units, such as: an AP (Application Processor), a modem processor, a GPU (Graphics Processing Unit), an ISP (Image Signal Processor), a controller, an encoder, a decoder, a DSP (Digital Signal Processor), a baseband processor, and / or a NPU (Neural-Network Processing Unit) and the like processing units.

[0116] The processor 610 can be used to execute executable instructions stored in the memory 620 to execute the above-described methods of the present disclosure, such as to execute the following method steps: In response to a deployment preview operation on a target plot in a game scene, a virtual training interface is displayed, the virtual training interface displays a team scheduling slot and a virtual team; In response to a configuration operation of adding a target virtual team to the team scheduling slot, the target virtual team is determined, and battle process information is generated based on an association parameter of the target virtual team and the target plot; The battle process information is displayed on the virtual training interface.

[0117] In an optional implementation, the association parameter includes at least one of the following: departure location information of the target virtual team; movement speed parameter of the target virtual team; defense team configuration information of the target plot; and battle attribute parameter of the target virtual team.

[0118] In an optional implementation, the battle process information is displayed in a time axis, and the battle process information includes: marching time period of the target virtual team; battle time period of the target virtual team and a defense force of the target plot; recovery time period of the defense force; and battle result prediction data of the target virtual team and the defense force.

[0119] In an optional implementation, the battle result prediction data includes at least one of the following: battle result of the defense force in each battle time period; force change of the target virtual team; and occupation state of the target plot.

[0120] In an optional implementation, the method further includes: In response to a deployment time adjustment operation on a target virtual team in the team scheduling slot, the deployment time of the target virtual team is updated, and the battle process information is regenerated based on the updated deployment time.

[0121] In an optional implementation, the battle process information is displayed in a time axis, and the time axis displays a team identifier of the target virtual team; The deployment time adjustment operation includes a drag operation on the team identifier in the time axis.

[0122] In an optional implementation, there are multiple virtual teams, and there are multiple team scheduling slots; the method further includes: When the multiple virtual teams are added to the multiple team scheduling slots, a cooperative battle feasibility of target virtual teams in the multiple team scheduling slots is analyzed, and the deployment times of the multiple target virtual teams are adjusted based on a cooperative battle strategy.

[0123] In an optional implementation, the cooperative battle strategy includes: enabling a subsequent virtual team to fight after a previous virtual team weakens a garrison; and enabling multiple virtual teams to fight in sequence during a garrison recovery period.

[0124] In an optional implementation, the method further includes: In response to the confirmation operation, the target virtual team performs the expedition on the target plot according to the expedition time indicated in the expedition progress information.

[0125] In an optional implementation, the method further includes: When the combat progress information indicates that the target plot is successfully occupied, the expedition execution control is displayed on the virtual drill interface; and the confirmation operation is a triggering operation on the expedition execution control.

[0126] In an optional implementation, the target virtual team performs the expedition on the target plot according to the expedition time indicated in the expedition progress information, including: when there are multiple target virtual teams, the multiple target virtual teams perform the expedition on the target plot according to the expedition time indicated in the expedition progress information in sequence.

[0127] In an optional implementation, in response to the expedition rehearsal operation on the target plot in the game scene, the virtual drill interface is displayed, including: in response to the selection operation on the target plot in the game scene, the troop display control is displayed; and in response to the triggering operation on the troop display control, the virtual drill interface is displayed.

[0128] The bus 630 is used to realize the connection between different components of the electronic device 600, and can include a data bus, an address bus, and a control bus.

[0129] The electronic device 600 can communicate with one or more external devices 700 (such as a keyboard, a mouse, an external controller, etc.) through the I / O interface 640.

[0130] The electronic device 600 can communicate with one or more networks through the network adapter 650, for example, the network adapter 650 can provide a mobile communication solution such as 3G / 4G / 5G, or provide a wireless communication solution such as a wireless local area network, Bluetooth, near field communication, etc. The network adapter 650 can communicate with other modules of the electronic device 600 through the bus 630.

[0131] The electronic device 600 can display a graphical user interface through the display 660, such as displaying a virtual scene, a virtual character, etc.

[0132] Although Figure 5 Other hardware and / or software modules can also be provided in the electronic device 600, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID (Redundant Arrays of Independent Disks) systems, tape drives, and data backup storage systems, etc.

[0133] From the above, it can be seen that the technical solutions of the present disclosure can be implemented as a method, device, system, computer program product, storage medium, electronic device, etc. Those skilled in the art can understand that various aspects of the present disclosure can be specifically implemented in the following forms: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or an implementation combining hardware and software aspects, which can be referred to as "circuitry", "module" or "system" respectively.

[0134] It should be understood that the present disclosure is not limited to the specific method steps or structures described above and shown in the drawings, and various modifications and changes can be made without departing from the scope thereof. Based on the specific embodiments provided by the present disclosure, those skilled in the art will easily think of other embodiments. Therefore, the specific embodiments provided by the present disclosure are only exemplary, and the scope and spirit of the present disclosure are indicated by the claims, and should cover any variations, uses or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or conventional technical means in the technical field not disclosed by the present disclosure.

Claims

1. An information processing method of a game, characterized by, The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps:

2. The method of claim 1, wherein, The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps:

3. The method of claim 1, wherein, The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps:

4. The method of claim 3, wherein, The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps:

5. The method of claim 1, wherein, The method comprises the following steps: The method comprises the following steps: The method comprises the following steps:

6. The method of claim 5, wherein, The method comprises the following steps: The method comprises the following steps:

7. The method of claim 1, wherein, The method comprises the following steps: The method comprises the following steps: The method comprises the following steps:

8. The method of claim 7, wherein, The method comprises the following steps: The method comprises the following steps: The method comprises the following steps:

9. The method of claim 1, wherein, The method comprises the following steps: The method comprises the following steps:

10. The method of claim 9, wherein, The method comprises the following steps: The method comprises the following steps:

11. The method of claim 9, wherein, The method comprises the following steps: The method comprises the following steps:

12. The method of claim 1, wherein, The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the following steps: The method comprises the In response to a selection operation on a target plot in a game scene, display a troop deployment control; In response to a triggering operation on the troop deployment control, display the virtual drill interface.

13. A computer program product comprising a computer program, characterized in that, The computer program, when executed by a processor, implements the method of any one of claims 1-12.

14. An electronic device, comprising: Comprise: a processor; a memory for storing executable instructions of the processor; wherein the processor is configured to implement the method of any one of claims 1-12 via execution of the executable instructions.