WO2024036915A1

WO2024036915A1 - Interaction processing method and apparatus in game, and electronic device and storage medium

Info

Publication number: WO2024036915A1
Application number: PCT/CN2023/079118
Authority: WO
Inventors: 陈璋君; 赵振涛
Original assignee: 网易（杭州）网络有限公司
Priority date: 2022-08-16
Filing date: 2023-03-01
Publication date: 2024-02-22
Also published as: CN115328354A; CN115328354B

Abstract

Provided in the present disclosure are an interaction processing method and apparatus in a game, and an electronic device and a storage medium. The method comprises: receiving a trigger operation, which is executed by a user for a target node, wherein the target node is a node in a target strategy tree in a game; in response to the trigger operation, determining a guide node of the target node, and entering a first operation interface for the guide node; and displaying, in the first operation interface, a first trigger control for the guide node, wherein the first trigger control is a control for executing, in the game, a predetermined function for a virtual element corresponding to the guide node. By means of the present disclosure, the operation complexity of a user for each node in a target strategy tree can be reduced, such that the interaction efficiency is improved.

Description

Interactive processing methods, devices, electronic devices and storage media in games

Cross-references to related applications

This disclosure requires the priority of the Chinese patent application with application number 202210986090.0 and titled "Interactive processing method, device, electronic device and storage medium in games" submitted to the State Intellectual Property Office of China on August 16, 2022, all of which The contents are incorporated by reference into this disclosure.

Technical field

The present disclosure relates to the field of computer application technology, and in particular, to an interactive processing method, device, electronic device and storage medium in a game.

Background technique

In games, a certain gameplay is often displayed in the form of a tree structure, such as the technology tree, talent tree, weapon tree, prop tree, etc. in the game.

Currently, when players view the tree structure interface, all tree nodes will be displayed in the tree structure interface. When players want to operate each tree node, they need to first find the corresponding tree node, and then open the tree nodes one by one. Operating each tree node makes the player's operation process of each tree node cumbersome and complex, and the processing efficiency is low.

Contents of the invention

In view of this, embodiments of the present disclosure at least provide an interaction processing method, device, electronic device, and storage medium in a game, which can reduce the complexity of user operations on each node in the target strategy tree and improve interaction efficiency.

In a first aspect, exemplary embodiments of the present disclosure provide an interaction processing method in a game. The method includes: receiving a trigger operation performed by a user on a target node, where the target node is a node in a target strategy tree in the game. ; In response to the trigger operation, determine the guide node of the target node, and enter the first operation interface for the guide node; display the first trigger control for the guide node on the first operation interface, the The first trigger control is a control used to perform a predetermined function on the virtual element corresponding to the guidance node in the game.

In a second aspect, embodiments of the present disclosure also provide an interactive processing device in a game. The device includes: a receiving module that receives a trigger operation performed by a user on a target node. The target node is a target node in the target strategy tree in the game. A node; a conversion module, in response to the trigger operation, determines the guide node of the target node, and enters the first operation interface for the guide node; the display control module, displays the guide node on the first operation interface; A first trigger control, the first trigger control is a control used to perform a predetermined function for the virtual element corresponding to the guidance node in the game.

In a third aspect, embodiments of the present disclosure also provide an electronic device, including: a processor, a memory, and a bus. The memory stores machine-readable instructions executable by the processor. When the electronic device is running, the processing Communication is carried out between the processor and the memory through the bus, and the machine-readable instructions are executed by the processor when executing the interaction in the game of the first aspect or any of the possible implementations of the first aspect. Processing method steps.

In a fourth aspect, embodiments of the present disclosure also provide a computer-readable storage medium. A computer program is stored on the computer-readable storage medium. The computer program executes the above-mentioned first aspect or aspects when run by a processor. The steps of the interactive processing method in the game in any possible implementation.

The interactive processing method, device, electronic device and storage medium in the game provided by the embodiments of the present disclosure are helpful to reduce the complexity of the user's operations on each node in the target strategy tree, so as to improve the efficiency of interaction. Specifically, the interactive processing method, device, electronic device, and storage medium provided by the embodiments of the present disclosure provide at least the following technical effects: by introducing an automatic guidance mechanism, the user's operation process on each node in the target policy tree is simplified, To improve interaction efficiency; each node is used as a target node in turn to trigger the automatic selection mechanism of the guidance node. Based on the combination of automatic guidance and manual triggering, it can not only avoid users' frequent operations on each node, but also avoid missing targets. Nodes in the strategy tree; due to the automatic guidance and manual triggering methods, while reducing the complexity of the user's operation of each node, it retains the user's interactive experience of obtaining virtual elements from the game, and also helps to improve user stickiness; it also It can reduce interactive experience breakpoints caused by users' frequent sliding and clicking, improve the smoothness of gameplay; further reduce the operating cost and running time of the game in the terminal device, and save the power of the terminal device.

In order to make the above-mentioned objects, features and advantages of the present disclosure more obvious and understandable, preferred embodiments are given below and described in detail with reference to the accompanying drawings.

Description of drawings

In order to explain the technical solutions of the embodiments of the present disclosure more clearly, the drawings needed to be used in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of the present disclosure and therefore do not It should be regarded as a limitation of the scope. For those of ordinary skill in the art, other relevant drawings can be obtained based on these drawings without exerting creative efforts.

Figure 1 shows a flowchart of an interaction processing method in a game provided by an exemplary embodiment of the present disclosure;

Figure 2 shows a flow chart of the steps of entering the second operation interface provided by an exemplary embodiment of the present disclosure;

Figure 3 shows a flowchart of the steps of determining a guide node of a target node provided by an exemplary embodiment of the present disclosure;

Figure 4 shows a schematic diagram of traversal rules for a target policy tree provided by an exemplary embodiment of the present disclosure;

5 illustrates a flowchart of steps for forming a boot sequence provided by an exemplary embodiment of the present disclosure;

Figure 6 shows a schematic diagram of determining a boot sequence provided by an exemplary embodiment of the present disclosure;

Figure 7 shows another schematic diagram of determining the boot sequence provided by an exemplary embodiment of the present disclosure;

Figure 8 shows another schematic diagram of determining the boot sequence provided by an exemplary embodiment of the present disclosure;

Figure 9 shows a flow chart of steps of displaying a first operation interface provided by an exemplary embodiment of the present disclosure;

Figure 10 shows a schematic diagram of a first operation interface provided by an exemplary embodiment of the present disclosure;

Figure 11 shows a flowchart of steps for triggering a boot node provided by an exemplary embodiment of the present disclosure;

Figure 12 shows a schematic structural diagram of an interactive processing device in a game provided by an exemplary embodiment of the present disclosure;

FIG. 13 shows a schematic structural diagram of an electronic device provided by an exemplary embodiment of the present disclosure.

Detailed ways

In order to make the purpose, technical solutions and advantages of the embodiments of the present disclosure clearer, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. It should be understood that the technical solutions in the embodiments of the present disclosure The drawings are for purposes of illustration and description only and are not intended to limit the scope of the present disclosure. Additionally, it should be understood that the schematic drawings are not drawn to scale. The flowcharts used in this disclosure illustrate operations implemented in accordance with some embodiments of the disclosure. It should be understood that the operations of the flowchart may be implemented out of sequence, and steps without logical context may be implemented in reverse order or simultaneously. In addition, those skilled in the art can add one or more other operations to the flowchart, and can also remove one or more operations from the flowchart under the guidance of this disclosure.

The terms "a", "an", "the" and "said" are used in this specification to indicate the existence of one or more elements/components/etc.; the terms "include" and "have" are used to indicate an open-ended Inclusive is intended and means that there may be additional elements/components/etc. in addition to the listed elements/components/etc.; the terms "first" and "second" etc. are used as labels only and do not refer to The number of its objects is limited.

It should be understood that in the embodiments of the present disclosure, “at least one” refers to one or more, and “plurality” refers to two or more. "And/or" is just an association relationship that describes related objects. It means that there can be three kinds of relationships. For example, A and/or B can mean: A exists alone, A and B exist simultaneously, and B exists alone. Condition. The character "/" generally indicates that the related objects are in an "or" relationship. "Including A, B and/or C" means including any one, any two or three of A, B and C.

It should be understood that in the embodiment of the present disclosure, "B corresponding to A", "B corresponding to A", "A corresponding to B" or "B corresponding to A" means that B is associated with A, B can be determined based on A. Determining B based on A does not mean determining B only based on A, but can also determine B based on A and/or other information.

In addition, the described embodiments are only some, not all, of the embodiments of the present disclosure. The components of the embodiments of the present disclosure generally described and illustrated in the figures herein may be arranged and designed in a variety of different configurations. Therefore, the following detailed description of the embodiments of the disclosure provided in the appended drawings is not intended to limit the scope of the claimed disclosure, but rather to represent selected embodiments of the disclosure. Based on the embodiments of the present disclosure, all other embodiments obtained by those skilled in the art without any creative efforts fall within the scope of protection of the present disclosure.

In games, a certain gameplay is often displayed in the form of a tree structure, such as the technology tree, talent tree, Weapon tree, prop tree, etc.

In response to at least one of the above-mentioned problems, the present disclosure proposes an interactive processing method, device, electronic device and storage medium in a game, which simplifies the user's operation process of each node in the target strategy tree by introducing an automatic guidance mechanism, so as to Improve interaction efficiency.

First, a brief introduction is given to the names involved in the embodiments of the present disclosure.

In embodiments of the present disclosure, a graphical user interface may be provided through a terminal device, where:

Terminal Equipment:

The terminal device involved in the embodiment of the present disclosure mainly refers to an intelligent device used to provide a game interface (presenting game scenes in the game interface) and capable of controlling virtual characters. The terminal device may include but is not limited to the following devices: Any one: smartphone, tablet, laptop, desktop computer, game console, personal digital assistant (PDA), e-book reader, MP4 (Moving Picture Experts Group Audio Layer IV, Moving Picture Experts Compression Standard Audio Layer 4) player etc. Applications supporting game scenes, such as applications supporting three-dimensional game scenes, are installed and run in the terminal device. The application may include but is not limited to any one of virtual reality applications, three-dimensional map programs, military simulation programs, MOBA games, multiplayer gun battle survival games, and third-person shooting games (TPS, Third-Personal Shooting Game). Optionally, the application may be a stand-alone version of the application, such as a stand-alone 3D game program, or may be a network online version of the application.

GUI:

It is an interface display format for human-computer communication that allows users to use input devices such as a mouse or keyboard to manipulate icons, logos or menu options on the screen. It also allows users to manipulate by performing touch operations on the touch screen of a touch terminal. An on-screen icon or menu option to select a command, launch a program, or perform some other task.

Game scene:

It is a virtual scene displayed (or provided) when the application is running on the terminal or server. Optionally, the virtual game is a simulation environment of the real world, or a semi-simulation and semi-fictional virtual environment, or a purely fictitious virtual environment. The virtual scene is any one of a two-dimensional virtual scene and a three-dimensional virtual scene. The virtual environment can be the sky, land, ocean, etc., where the land includes environmental elements such as deserts and cities. Among them, the game scene is a scene where the user controls the complete game logic of the virtual character.

Virtual character:

Refers to a virtual character in a virtual environment. The virtual character can be a virtual character controlled by a player, including but not limited to at least one of virtual characters, virtual animals, and animation characters. It can also be a virtual character controlled by a non-player (NPC). ). Optionally, when the virtual environment is a three-dimensional virtual environment, the virtual characters may be three-dimensional virtual models. Each virtual character has its own shape and volume in the three-dimensional virtual environment and occupies a part of the space in the three-dimensional virtual environment. Optionally, the virtual character is a three-dimensional character constructed based on three-dimensional human skeleton technology, and the virtual character achieves different external images by wearing different skins. In some implementations, the virtual character can also be implemented using a 2.5-dimensional or 2-dimensional model, which is not limited in the embodiments of the present disclosure.

There may be multiple virtual characters in the virtual scene. The virtual character is a virtual character controlled by the player (that is, a character controlled by the player through an input device), or an artificial intelligence (Artificial Intelligence) set in the virtual environment battle through training. , AI). Optionally, the virtual character is a virtual character competing in a game scene. Optionally, the number of virtual characters in the game scene battle is preset or dynamically determined based on the number of terminal devices participating in the virtual game, which is not limited in the embodiments of the present disclosure. In one possible implementation, the user can control the virtual character to move in the virtual scene, for example, control the virtual character to run, jump, crawl, etc., and can also control the virtual character to use virtual skills and virtual props provided by the application. Wait for battles with other virtual characters.

In an optional implementation, the terminal device may be a local terminal device. Taking games as an example, the local terminal device Game programs are stored and used to present game screens. The local terminal device is used to interact with players through a graphical user interface, that is, conventionally downloading, installing and running game programs through electronic devices. The local terminal device may provide the graphical user interface to the player in a variety of ways. For example, it may be rendered and displayed on the display screen of the terminal device, or provided to the player through holographic projection. For example, the local terminal device may include a display screen and a processor. The display screen is used to present a graphical user interface. The graphical user interface includes a game scene screen. The processor is used to run the game, generate a graphical user interface, and control the graphical user interface. The display of the interface on the display screen.

The applicable application scenarios of this disclosure are introduced. The present disclosure can be applied to the field of game technology. In the game, multiple players participating in the game join the same virtual game.

Before entering the virtual game, players can choose different character attributes for their virtual characters in the virtual game, such as identity attributes. By assigning different character attributes to determine different camps, players can choose different character attributes in this virtual game. In different game stages, players can win the game by performing tasks assigned by the game. For example, multiple virtual characters with character A attributes can win the game by "eliminating" virtual characters with character B attributes in the game stage. victory. Here, when entering the virtual game, character attributes can also be randomly assigned to each virtual character participating in this virtual game.

An implementation environment provided in an embodiment of the present disclosure may include: a first terminal device, a server, and a second terminal device. The first terminal device and the second terminal device communicate with the server respectively to implement data communication. In this embodiment, the first terminal device and the second terminal device are each installed with an application program that executes the interactive processing method in the game provided by the present disclosure, and the server is a server that executes the interactive processing method in the game provided by the present disclosure. end. Through the application program, the first terminal device and the second terminal device can respectively communicate with the server.

Taking the first terminal device as an example, the first terminal device establishes communication with the server by running an application program. In an optional implementation, the server establishes a virtual game based on the application's game request. The parameters of the virtual game may be determined based on the parameters in the received game request. For example, the parameters of the virtual game may include the number of people participating in the virtual game, the level of the characters participating in the virtual game, etc. When the first terminal device receives the response from the game server, the game scene corresponding to the virtual game is displayed through the graphical user interface of the first terminal device. The first terminal device is a device controlled by the first user. The graphical user of the first terminal device The virtual character displayed in the interface is the player character (ie, the first virtual character) controlled by the first user. The first user inputs operating instructions through the graphical user interface to control the player character to perform corresponding operations in the game scene.

Taking the second terminal device as an example, the second terminal device establishes communication with the server by running an application program. In an optional implementation, the server establishes a virtual game based on the application's game request. The parameters of the virtual game may be determined based on the parameters in the received game request. For example, the parameters of the virtual game may include the number of people participating in the virtual game, the level of the characters participating in the virtual game, etc. When the second terminal device receives the response from the server, the game scene corresponding to the virtual game is displayed through the graphical user interface of the second terminal device. The second terminal device is a device controlled by the second user, and the virtual character displayed in the graphical user interface of the second terminal device is the player character (ie, the second virtual character) controlled by the second user. The second user uses the graphical user interface to Input operation instructions to control the player character to perform corresponding operations in the virtual scene.

The server performs data calculation based on the game data reported by receiving the first terminal device and the second terminal device, and synchronizes the calculated game data to the first terminal device and the second terminal device, so that the first terminal device and the second terminal device The device controls the graphical user interface to render corresponding game scenes and/or virtual characters based on the synchronized data sent by the game server.

In this embodiment, the first virtual character controlled by the first terminal device and the second virtual character controlled by the second terminal device are virtual characters in the same virtual game. Wherein, the first virtual character controlled by the first terminal device and the second virtual character controlled by the second terminal device may have the same character attributes, or may have different character attributes. The first virtual character controlled by the first terminal device and the second virtual character controlled by the second terminal device may have the same character attributes. The second virtual character controlled by the second terminal device belongs to the same camp.

It should be noted that a virtual game can include two or more virtual characters, and different virtual characters can correspond to different terminal devices. That is to say, in a virtual game, there are more than two virtual characters. The terminal device sends and synchronizes game data with the game server respectively.

In order to facilitate understanding of the present disclosure, the interactive processing method, device, electronic device and storage medium in the game provided by the embodiments of the present disclosure are introduced in detail below.

Please refer to Figure 1, which is a flow chart of an interactive processing method in a game provided by an exemplary embodiment of the present disclosure. The interactive processing method specifically includes:

Step S101: Receive the trigger operation performed by the user on the target node.

Here, there is at least one strategy tree in the game, each strategy tree has at least one fork, and each fork has at least one node. The nodes with associated relationships are connected by a connection, and the two nodes connected by a connection are connected by a connection. There may or may not be a sequential relationship between nodes.

For example, each node in the strategy tree corresponds to a virtual element in the game scene. By operating the virtual element, the state of the game world can be changed.

As examples, the strategy tree may include, but is not limited to: technology tree, talent tree, weapon tree, prop tree, building tree (which may refer to the tree structure used to create buildings in the game scene), etc. In other words, the technology, weapons, props, etc. in the game can be displayed in the form of a tree structure. By operating the nodes in the tree structure, the virtual elements corresponding to the operated nodes can be applied in the game scene to change the game. The state of the world.

In the exemplary embodiment of the present disclosure, the tree structure interface corresponding to the policy tree can be entered in various ways to operate each node in the policy tree.

In one example, players in the game can obtain a game box through various methods. For example, the obtaining method can include at least one of the following items: paying for virtual electronic resources, picking up from game scenes, and killing enemies. Virtual characters in the camp and complete virtual tasks in the game. When an opening operation for the game box is received, a strategy tree corresponding to the game box is generated, and each node of the strategy tree is displayed on the tree structure interface. It should be understood that the above-mentioned ways of generating a policy tree are only examples, and the present disclosure is not limited thereto.

In the embodiment of the present disclosure, the target node is a node in the target strategy tree in the game, and the target strategy tree is one of at least one strategy tree existing in the game.

As an example, the above trigger operation is an operation for triggering a predetermined function corresponding to the target node. For example, the trigger operation may include a selection operation performed by the user on the second trigger control on the second operation interface for the target node. Here, the third The second operation interface is an interface used to display the description information of the target node and operate the target node. The second trigger control is a control used to perform a predetermined function for the virtual element corresponding to the target node in the game.

For example, each node in the strategy tree corresponds to a virtual element in the game. Taking the target strategy tree as a building tree as an example, each node in the building tree corresponds to a building. At this time, the above-mentioned method for the target node The second trigger control is a control used to create the building in the game scene. Taking the target strategy tree as a prop tree as an example, each node in the prop tree corresponds to a prop. The above-mentioned second trigger control for the target node is used. To enable the virtual character to have the control of the prop in the game.

For example, virtual elements may include virtual items and virtual skills used to improve the combat ability of the virtual character. Virtual items may refer to virtual props in games. Virtual items are virtual props used to increase the virtual abilities of virtual characters.

As an example, virtual items may include, but are not limited to, at least one of the following items: a virtual weapon held by a virtual character, a virtual accessory equipped on a virtual character, or attached to a virtual weapon. Among them, virtual accessories can refer to accessories such as gems and gun stocks that can be attached to weapons.

The process of entering the second operation interface for the target node is introduced below with reference to Figure 2. It should be understood that the method shown in Figure 2 is only an example, and the present disclosure is not limited thereto.

FIG. 2 shows a flowchart of the steps of entering the second operation interface provided by an exemplary embodiment of the present disclosure.

In step S201, a tree structure interface for the target policy tree is displayed.

Here, the target node in the target strategy tree is displayed in the tree structure interface. For example, you can display all nodes in the target strategy tree in the tree structure interface to display the target node in the tree structure interface, or you can also perform an interface zoom operation on the tree structure interface to display only the target in the tree structure interface. The policy tree includes some nodes of the target node.

In step S202, in response to the selection operation performed on the target node on the tree structure interface, enter the process of selecting the target node. Click the second operation interface.

In an optional embodiment of the present disclosure, the above interactive processing method may further include: determining whether the target node is the first triggered node after entering the tree structure interface. If it is determined that the target node is the first triggered node after entering the tree structure interface, triggered node, the above selection operation is a manual operation. For example, the selection operation is a click operation performed by the user on the target node. If it is determined that the target node is not the first triggered node after entering the tree structure interface, then the above selection operation is a manual operation. The selection operation is an automatic operation. For example, the selection operation is an operation of automatically selecting the target node after entering the tree structure interface.

In a preferred embodiment of the present disclosure, the target node is a node in the target policy tree that satisfies the following conditions: each node on the specified node path in the target policy tree has been triggered, and the trigger condition corresponding to the target node belongs to the target constraint condition. .

Here, the above specified node path may refer to the path from the parent node of the target node to the root node. The node being triggered means that a predetermined function has been performed in the game for the virtual element corresponding to the node. For example, the node being triggered may refer to each The trigger controls corresponding to the nodes have been selected.

In the embodiment of the present disclosure, each node in the target strategy tree corresponds to its own trigger condition. When the trigger condition is satisfied, the virtual element corresponding to the node performs a predetermined function in the game. When the trigger condition is not satisfied, The virtual element corresponding to this node does not perform predetermined functions in the game.

The triggering conditions corresponding to each node may be various constraint conditions for node triggering. For example, the triggering conditions corresponding to each node in the target policy tree may include at least one of the following items: constraints on triggering time, Constraints on the production materials of virtual elements, and task constraints on virtual elements (for example, associating the completion degree of at least one task in the game with the virtual element corresponding to the node).

When the trigger condition corresponding to a node is met, it means that the virtual element corresponding to the node can perform a predetermined function in the game. Here, the trigger condition corresponding to the node also includes the condition of completing the execution of the predetermined function on the virtual element corresponding to the node.

In the embodiment of the present disclosure, for the case where the trigger condition corresponding to the node is a constraint on the trigger time, the constraint on the trigger time corresponding to each node may include a first time constraint and a second time constraint. As an example, The first time constraint condition means that the trigger time corresponding to the node is 0, and the second time constraint condition means that the trigger time corresponding to the node is not 0. The above-mentioned trigger time may refer to the waiting time for the virtual element corresponding to the trigger node to perform a predetermined function. For example, for a node with a trigger time of 0, when the trigger control corresponding to the node is selected, the virtual element corresponding to the node is immediately displayed in the game. Elements perform predetermined functions. For nodes whose trigger time is not 0, when the trigger control corresponding to the node is selected, the predetermined function must be executed after the trigger time has elapsed for the virtual element corresponding to the node in the game.

Returning to Figure 1, step S102: In response to the user's triggering operation on the target node, determine the guide node of the target node, and enter the first operation interface for the guide node.

In the embodiment of the present disclosure, the method of entering the first operation interface for the boot node includes: automatically selecting the boot node to enter the first operation interface for the boot node.

Here, when the target node is triggered, an automatic guidance mechanism is introduced to automatically select the guidance node that needs to be operated without the user having to click, which to a certain extent simplifies the user's operation process of each node in the target policy tree. .

In one case, the guide node is the first candidate node in the target policy tree. Here, the first candidate node is a node in the target policy tree whose trigger condition belongs to the first time constraint condition.

FIG. 3 illustrates a flowchart of steps of determining a boot node of a target node provided by an exemplary embodiment of the present disclosure.

In step S301, the first candidate node is selected from the nodes of the target policy tree according to the target constraint condition.

Here, the trigger condition corresponding to the node includes at least one constraint condition triggered for the node, and the target constraint condition is one of the at least one constraint condition mentioned above. The target policy tree can be filtered for nodes based on the determined target constraint condition to obtain the first candidate node. As one example embodiment, the target constraint may be a first time constraint in which the trigger time corresponding to the node is 0, or a first material constraint in which the material loss value corresponding to the node is lower than a preset loss value, or It may be a first task constraint condition in which the task correlation degree of the node is greater than the second preset threshold.

That is to say, the first candidate node is the node in the target policy tree that satisfies the target constraint.

In step S302, a boot sequence is determined based on the first candidate node.

Here, the guidance sequence is a predetermined triggering sequence for each node in the target policy tree. For example, the guidance sequence is a determined sequence for automatically guiding the user to the target node after traversing each first candidate node in the target policy tree. The order in which nodes perform function triggering.

In this embodiment, the triggering sequence for the first candidate node is determined as the guidance sequence for the target policy tree. For example, a first sub-sequence of the first candidate node may be determined, and the first sub-sequence may be determined as the boot sequence.

For the case where the trigger condition corresponding to the node is a constraint on the trigger time, the target constraint includes a first time constraint.

In this case, the first sub-sequence of the first candidate node is determined in the following way: according to the preset traversal rules, the traversal order for the target policy tree is determined, and according to the determined traversal order, each first sub-sequence in the target policy tree is determined. The candidate nodes are traversed to form the first sub-sequence corresponding to all first candidate nodes. Here, the first candidate node is a node in the target policy tree whose trigger condition belongs to the first time constraint condition.

Here, the preset traversal rules can be various traversal methods. Examples include but are not limited to pre-order traversal methods, mid-order traversal methods, post-order traversal methods, etc. for the target policy tree. In addition, they can also be It is another customized traversal method.

FIG. 4 shows a schematic diagram of traversal rules for a target policy tree provided by an exemplary embodiment of the present disclosure.

In this example, the figure shows an example of a target policy tree, which includes A to K10 nodes.

The process of determining the traversal order for the target policy tree based on the pre-order traversal method, the in-order traversal method, and the post-order traversal method will be described below.

Taking the pre-order traversal method as an example, this traversal method traverses each node in the target policy tree in the middle and left order. In this traversal method, the traversal order of the target policy tree shown in Figure 4 is: ABDHECFJKG.

Taking the in-order traversal mode as an example, this traversal mode traverses each node in the target policy tree in the order of left, middle and right. In this traversal mode, the traversal order of the target policy tree shown in Figure 4 is: DHBEAJFKCG.

Taking the post-order traversal mode as an example, this traversal mode traverses each node in the target policy tree in the order of left, right and middle. In this traversal mode, the traversal order of the target policy tree shown in Figure 4 is: HDEBJKEGCA.

Through the determined preset traversal method, each candidate node in the target policy tree can be traversed to avoid omissions.

In this embodiment of the present disclosure, the target policy tree includes candidate nodes and non-candidate nodes. The candidate nodes are selectable nodes in the target policy tree, and the non-candidate nodes are unselectable nodes in the target policy tree. For example, the node status of each node includes an unlocked state and a locked state. The node in the unlocked state can be selected, and the node in the locked state cannot be selected.

In the embodiment of the present disclosure, only nodes in the unlocked state in the target policy tree are determined as candidate nodes for traversal.

Here, the candidate node includes a first candidate node and a second candidate node. The first candidate node is a node in the target policy tree whose trigger condition belongs to the first time constraint. The second candidate node is a node in the target policy tree whose trigger condition belongs to the second time constraint. Nodes for constraints.

In the embodiment of the present disclosure, only the first candidate node with the first time constraint may be traversed to form a guidance sequence.

In step S303, based on the guidance sequence, the guidance node of the target node is determined from the nodes of the target policy tree.

Here, the boot node is the node located next to the target node in the boot sequence under the target policy tree, that is, the node located next to the target node in the boot sequence is the boot node.

For example, when the target node has a node that is not the last level, then the next boot node may be a node at the next level of the target node. When the target node is the last-level leaf node of fork A in the target policy tree, the next guide node can start by returning to the root node of fork B, that is, using another root node as the next guide node.

In embodiments of the present disclosure, the first candidate node is positioned earlier than other nodes in the boot sequence.

Through the above embodiment, the first candidate nodes are selected from the target policy tree, and only the first candidate nodes are guided, and the second candidate nodes may not be guided. In this embodiment, each of the above-mentioned first candidate nodes belonging to the first time constraint can be triggered immediately. Therefore, automatic guidance of such nodes can make it easier for subsequent users to operate the nodes, so as to further improve the accuracy of the operations on the nodes. The operating efficiency of nodes helps improve the smoothness of game operations.

In the other case, the guide node is a candidate node in the target policy tree. Here, the candidate node as the guide node may be the first candidate node or the second candidate node.

In this embodiment, the boot node is a node located next to the target node in the boot sequence under the target policy tree. That is, the node located next to the target node in the boot sequence is the boot node. Here, the guidance sequence is a predetermined triggering sequence for each node in the target policy tree. For example, the guidance sequence is a determined sequence for automatically guiding the user to perform operations on the node after traversing each candidate node in the target policy tree. The order in which functions are triggered.

FIG. 5 illustrates a flowchart of steps of forming a boot sequence provided by an exemplary embodiment of the present disclosure.

In step S310, a first sub-order of the first candidate node and a second sub-order of the second candidate node are determined.

Here, the method of determining the first sub-order of the first candidate node is the same as the method of determining the first sub-order of the first candidate node in step S302, and this part will not be described again in this disclosure.

For the case where the trigger condition corresponding to the node is a constraint condition on the trigger time, the constraint condition includes a second time constraint condition. In this case, each second candidate node in the target policy tree can be traversed according to the traversal order determined above to form a second sub-sequence corresponding to all second candidate nodes. The first sub-sequence and the second sub-sequence may be determined by the same traversal rule, or may be determined by different traversal rules respectively, which is not limited in this example embodiment.

In step S320, a boot sequence is constructed according to the first sub-sequence and the second sub-sequence. Here, after traversing all selectable nodes in the target policy tree, the boot sequence is formed.

For example, the arrangement order between the first sub-sequence and the second sub-sequence may be determined according to actual requirements.

In a preferred embodiment, the arrangement order between the first sub-sequence and the second sub-sequence may be determined based on historical operating habits.

In the embodiment of the present disclosure, the traversal form for the candidate nodes is determined based on the historical operation data of each candidate node in the strategy tree in the game. Illustratively, the above historical operation data includes the operation sequence of each candidate node. For example, if based on the historical operation data, it is determined that each first candidate node and each second candidate node in the policy tree should be intensively processed respectively (for example, in After all first candidate nodes in the policy tree are triggered and then all second candidate nodes are triggered), it is determined to traverse each first candidate node and each second candidate node respectively.

In the embodiment of the present disclosure, candidate nodes with different trigger conditions are traversed respectively, and their respective corresponding sub-sequences are determined to meet the user's personalized operating habits.

For example, the selection order of the first candidate node and the second candidate node by different users in the game can be collected, and the arrangement order between the first sub-sequence and the second sub-sequence is determined according to the above-mentioned selection order. If based on historical operating habits, it is determined that the number of users who select the first candidate node first is greater than the number of users who select the second candidate node first, then it is determined that the first sub-sequence is before the second sub-sequence. If based on historical operating habits, it is determined that the number of users who select the second candidate node first is If the number of users who selected the second candidate node is greater than the number of users who first selected the first candidate node, it is determined that the first sub-order is located after the second sub-order.

Here, based on the collected selection order of the first candidate node and the second candidate node by different users in the game, when it is determined that the number of users who select the first candidate node first is greater than the number of users who select the second candidate node first , to select a solution that determines the boot sequence only for the first candidate node.

In addition, you can also only obtain the historical operating habits of the current user (that is, the user who performed the triggering operation of S101 above), and determine the first sub-sequence according to the user's selection order of the first candidate node and the second candidate node. and the second sub-order.

In a preferred embodiment of the present disclosure, the second sub-sequence in the guidance sequence is located after the first sub-sequence, that is, the user is first guided to operate the first candidate node, and then the user is guided to operate the second candidate node. In simplifying While improving the operating process and operating efficiency, it also takes into account the user's operating habits, which helps to improve the user operating experience and increase user stickiness.

The following describes the process of determining the boot sequence with reference to the examples in Figures 6-8.

FIG. 6 shows one of the schematic diagrams for determining the boot sequence provided by an exemplary embodiment of the present disclosure.

In this example, assume that the preset traversal rule is a left-to-right, top-to-bottom traversal order for the target policy tree. In the target policy tree shown in Figure 6, nodes T, T1, T2, T3, and T5 , T6 and T7 are candidate nodes, that is, nodes that can be selected, and node T4 is a non-candidate node, that is, a node that cannot be selected.

Specifically, nodes T, T1, T2, T5, T6, and T7 are nodes in the target policy tree whose trigger conditions belong to the first time constraint, and node T3 is a node in the target policy tree whose trigger condition belongs to the second time constraint. For example, if the target strategy tree is a prop tree, the virtual element corresponding to the node belonging to the first time constraint can be a game object with a research time of 0 in the game, and the virtual element corresponding to the node belonging to the second time constraint can be a game object. Game objects that require research time, such as ship technical values. The above-mentioned game objects may include game props, game skills, virtual buildings, etc.

In this solution, the first candidate nodes T, T1, T2, T5, T6, and T7 can be traversed according to the above traversal order to determine the first subsequence (T→T1→T2→T5→T6→T7), according to In the above traversal sequence, the second candidate node T3 is traversed to obtain the second subsequence (T3). The boot sequence formed by the first subsequence and the second subsequence is T→T1→T2→T5→T6→T7→T3.

After receiving the trigger operation on node T of the target policy tree, according to the above boot sequence, the boot node of node T is determined to be T1. At this time, exit the operation interface for node T, return to the tree structure interface, and automatically select the boot node T1, enter the operation interface of node T1.

After that, if the trigger operation on node T1 is received, the above process is repeated, that is, according to the above boot sequence, the boot node of node 1T is determined to be T2. At this time, the operation interface for node T1 is exited and the tree structure interface is returned. , and automatically selects the boot node T2 to enter the operation interface of node T2.

By analogy, the above process is repeated for each of the above nodes in the order of T5→T6→T7→T3.

That is to say, after the boot sequence for the target policy tree is determined, each node will be automatically selected in sequence according to the boot sequence to guide the user to operate the selected node.

FIG. 7 shows the second schematic diagram of determining the boot sequence provided by an exemplary embodiment of the present disclosure.

In this example, it is assumed that the preset traversal rule is still the left-to-right, top-to-bottom traversal order of the target policy tree. In the target policy tree shown in Figure 7, nodes W, W1, W2, W3, W4 is the candidate node. Among them, W, W1, W2, and W4 belong to the first candidate node, and W3 belongs to the second candidate node.

In this solution, the first candidate nodes W, W1, W2, W4 and the second candidate node W3 can be traversed respectively according to the above traversal order, and the resulting boot sequence is W→W1→W2→W4→W3.

According to the above boot sequence, the process of automatic selection + manual triggering is performed on each node in turn.

FIG. 8 shows the third schematic diagram of determining the boot sequence provided by an exemplary embodiment of the present disclosure.

In this example, it is assumed that the preset traversal rule is still the left-to-right, top-to-bottom traversal order of the target policy tree. In the target policy tree shown in Figure 8, nodes Y, Y1, Y2, Y3, Y4 and Y5 are candidate nodes. Among them, Y, Y1, Y2, Y3, Y4 belong to the first candidate node, and Y5 belongs to the second candidate node.

In this solution, the first candidate nodes Y, Y1, Y2, Y3, Y4 and the second candidate node Y5 can be traversed respectively according to the above traversal order. The resulting guidance sequence is Y→Y1→Y2→Y3→Y4→ Y5.

It should be understood that the above traversal order can also be parent node first, then child node, that is, traversal is performed in the order of parent node-child node, parent node-child node. This disclosure does not limit this, and it can also be randomly determined.

In the embodiment of the present disclosure, the above-mentioned processing process shown in Figure 1 can be executed one by one for each node in the boot sequence according to the above-mentioned boot sequence, that is, each node is used as a target node in turn to trigger the automatic selection of the boot node. The mechanism, based on the above-mentioned combination of automatic guidance + manual triggering, can not only avoid users' frequent operations on each node, but also avoid missing nodes in the target policy tree.

In addition, based on the automatic guidance + manual triggering method, it can reduce the complexity of the user's operation of each node while retaining the user's interactive experience of obtaining virtual elements from the game, which helps to improve user stickiness. In addition, it can also reduce interactive experience breakpoints caused by users' frequent sliding and clicking, improving the smoothness of gameplay.

The following describes the process of entering the first operation interface for the boot node with reference to Figure 9. It should be understood that the process shown in Figure 9 The processing is only an example, and the present disclosure is not limited thereto.

FIG. 9 shows a flowchart of steps of displaying a first operation interface provided by an exemplary embodiment of the present disclosure.

In step S401, the interface is switched in response to a trigger operation performed by the user on the target node.

Here, the trigger operation may be a selection operation performed by the user on the second trigger control on the second operation interface for the target node. In this case, in response to the selection operation, exit the second operation interface for the target node, and Display the tree structure interface to switch interfaces.

In step S402, the tree structure interface is controlled to move on the screen, so that the guidance nodes in the target strategy tree are displayed on the screen.

Here, the above-mentioned tree structure interface can be displayed in the graphical user interface provided by the terminal device, and the tree structure interface is controlled to slide relative to the screen of the terminal device to display the guide node on the screen. This is because in order to facilitate the user to operate the nodes in the target policy tree, the tree structure interface will be enlarged, resulting in the tree structure interface not being able to fully display all the nodes of the target policy tree. At this time, after operating a node, The tree structure interface needs to be moved to reveal another node on the screen.

In step S403, the guide node is automatically selected on the displayed tree structure interface.

Here, the selection operation of the boot node is automatically performed, and the user does not need to manually click on the boot node.

In step S404, a window is created, and the first operation interface for the boot node is displayed in the created window.

In an example, after the boot node is automatically selected, the first operation interface can be directly displayed in the graphical user interface.

In another example, after the boot node is automatically selected, the first operation interface can be displayed in the created window.

Preferably, the window can be displayed suspended above the tree structure interface, and the display position of the window on the tree structure interface can be changed by receiving the user's movement operation on the window.

Exemplarily, the above interactive processing method of the embodiment of the present disclosure may further include: receiving a positioning operation performed on the window, and in response to the positioning operation, determining the positioning node corresponding to the window from the target policy tree, if the positioning node belongs to the first If the positioning node is a candidate node, the ranking of the positioning node in the boot sequence will be adjusted. If the positioning node belongs to the second candidate node or a non-candidate node, the boot sequence will not be adjusted.

For example, a positioning control may be provided within the window or at the edge of the window. As an example, the positioning operation may include a selection operation of the positioning control of the window. In addition, the above-mentioned positioning node may refer to a node in the target policy tree that is closest to the window, or may refer to a node covered by the area where the window is located.

As an example, the manner of adjusting the ordering of the positioning node in the boot sequence may include: determining the positioning node as a node located next to the boot node in the boot sequence.

Here, the above-mentioned steps S401 to S404 are a series of actions performed after receiving a trigger operation performed by the user on the target node to realize automatic guidance for the user.

Returning to Figure 1, step S103: Display the first trigger control for the boot node on the first operation interface.

In the embodiment of the present disclosure, the first trigger control is a control used to perform a predetermined function for the virtual element corresponding to the guide node in the game. For example, the first operation interface may also display introduction information for the virtual element corresponding to the boot node to facilitate the user to confirm the virtual element.

Based on the above interactive processing solution of the present disclosure, the automatic guidance mechanism for the guidance node can be triggered for the target node in the policy tree, which can avoid the user's frequent operations on each node, simplify the operation process, and help improve the smoothness of the operation.

In one case, the guide node is a node in the target policy tree whose trigger condition belongs to the first time constraint condition.

At this time, the first operation interface is a simplified interface including the first trigger control for the guide node, that is, the virtual element corresponding to the guide node is unique, and the first operation interface may include the first trigger control for the guide node and the first trigger control for the guide node. Introduction information of the corresponding virtual element.

In this case, in response to the selection operation on the first trigger control, it is determined that the node is next to the boot node in the boot sequence under the target policy tree, and the third operation interface for this node is entered.

Here, it is equivalent to using the boot node as the target node, and returning to the above step S101 until each node in the boot sequence is triggered.

In another case, the guide node is a node in the target policy tree whose trigger condition belongs to the second time constraint.

At this time, the first operation interface is an editing interface including the first trigger control for the guide node and multiple candidate virtual elements. That is, the virtual element corresponding to the guide node is not unique and needs to be processed through the operations performed on the first operation interface. To determine the virtual element corresponding to the boot node.

In this case, a selection operation on any candidate virtual element among the plurality of candidate virtual elements is received on the first operation interface, and any selected candidate virtual element is determined in response to the selection operation on the first trigger control. A virtual element corresponding to the boot node is used to perform a predetermined function on the virtual element corresponding to the boot node.

FIG. 10 shows a schematic diagram of a first operation interface provided by an exemplary embodiment of the present disclosure.

As shown in FIG. 10 , below the first operation interface 10 is a candidate virtual element display area. At least some of the candidate virtual elements are displayed in the candidate virtual element display area. When all candidate virtual elements cannot be displayed in the candidate virtual element display area, , you can click the arrow on the far right to scroll the display.

When the candidate virtual element 11 is selected, the selected candidate virtual element 11 is displayed in the preview area of the first operation interface 10. If a selection operation on the first trigger control 12 on the first operation interface 10 is received, the candidate virtual element 11 is displayed in the preview area of the first operation interface 10. The virtual element 11 is determined as the virtual element corresponding to the boot node, and performs a predetermined function for the virtual element corresponding to the boot node.

For example, after receiving a selection operation on the first trigger control 12 on the first operation interface 10, the virtual element confirmation interface is entered. The triggering condition of the virtual element corresponding to the guide node includes a first time constraint and a second time constraint. At this time, the first condition option and the second condition option are displayed in the virtual element confirmation interface, and the first condition option is used to indicate The first time constraint condition, the second condition option is used to indicate the second time constraint condition, receive the user's selection operation on one of the first condition option and the second condition option, and determine the selected time constraint condition as the trigger of the virtual element Conditions, and based on the triggering conditions, predetermined functions are performed in the game for the virtual elements corresponding to the guidance nodes.

FIG. 11 shows a flowchart of steps for triggering a boot node provided by an exemplary embodiment of the present disclosure.

In step S501, a user's selection operation on the first trigger control is received.

For example, the selection operation may include a click operation on the first trigger control.

In step S502, in response to the selection operation of the first trigger control, the trigger condition corresponding to the guidance node is determined.

Here, it can be determined whether the trigger condition corresponding to the guide node belongs to the first time constraint condition or the second time constraint condition.

In step S503, when the trigger condition is met, a predetermined function is executed for the virtual element corresponding to the guide node.

For example, if the trigger condition corresponding to the guide node belongs to the first time constraint condition, then in response to the selection operation of the first trigger control, a predetermined function is directly executed in the game for the virtual element corresponding to the guide node. If the trigger condition corresponding to the guide node belongs to the second time constraint, then in response to the selection operation of the first trigger control, after waiting for the trigger time corresponding to the second time constraint, execution is performed on the virtual element corresponding to the guide node in the game Booking function.

Exemplarily, the above-mentioned predetermined functions may include but are not limited to at least one of the following items: unlocking (or activating) the corresponding virtual element in the game, applying (or assembling, using) the corresponding game element in the game, in-game Improve the attribute parameters of the corresponding game elements.

Based on the above interactive processing solution of the embodiment of the present disclosure, the user can be assisted to operate each node in the policy tree, that is, only the node is automatically selected, and it is still up to the user to decide whether to trigger the node.

Based on the same application concept, the embodiments of the present disclosure also provide an interactive processing device in the game corresponding to the method provided in the above embodiments. Since the problem-solving principle of the device in the embodiments of the present disclosure is different from that in the game of the above embodiments of the present disclosure, The interaction processing methods are similar, so the implementation of the device can be referred to the implementation of the method, and repeated details will not be repeated.

Figure 12 is a schematic structural diagram of an interactive processing device in a game provided by an exemplary embodiment of the present disclosure. As shown in Figure 12, the interactive processing device 200 in the game includes:

The receiving module 210 receives the trigger operation performed by the user on the target node, where the target node is a node in the target strategy tree in the game;

The conversion module 220, in response to the triggering operation, determines the boot node of the target node, and enters the The first operation interface of the node;

The display control module 230 displays a first trigger control for the guidance node on the first operation interface, where the first trigger control is a control used to perform a predetermined function for the virtual element corresponding to the guidance node in the game.

In a possible implementation of the present disclosure, the trigger operation includes a selection operation performed by the user on a second trigger control on the second operation interface for the target node, and the second trigger control is used to select the target node in the game. The virtual element corresponding to the target node performs a predetermined function.

In a possible implementation of the present disclosure, the target node is a node in the target policy tree that satisfies the following conditions: each node on the designated node path in the target policy tree has been triggered, and the designated node path is from The path from the parent node of the target node to the root node. When a node is triggered, it means that a predetermined function has been performed on the virtual element corresponding to the node in the game; the trigger conditions corresponding to the target node belong to the target constraints.

In a possible implementation manner of the present disclosure, the display control module 230 displays a tree structure interface for the target policy tree, in which the target nodes in the target policy tree are displayed; the receiving module 210 responds to the request in the tree structure. The selection operation performed on the target node on the interface will enter the second operation interface for the target node.

In a possible implementation of the present disclosure, each node in the target policy tree has a corresponding constraint, wherein the conversion module 220 determines the guide node of the target node in the following manner: according to the target constraint, from the Filter out the first candidate node from the nodes of the target policy tree; determine the boot sequence based on the first candidate node; determine the boot node of the target node from the nodes of the target policy tree based on the boot sequence, wherein, The boot node is the node next to the target node in the boot sequence under the target policy tree.

In a possible implementation of the present disclosure, the conversion module 220 determines the boot sequence based on the first candidate node in the following manner: determines a first sub-sequence of the first candidate node, and determines the first sub-sequence as Boot sequence.

In a possible implementation of the present disclosure, the target constraint includes a first time constraint, wherein the conversion module 220 determines the first sub-sequence of the first candidate node in the following manner: according to a preset traversal rule, Determine the traversal order for the target policy tree; traverse each first candidate node in the target policy tree according to the determined traversal order to form a first sub-sequence corresponding to all first candidate nodes, where the first candidate node is The node in the target policy tree whose trigger condition belongs to the first time constraint.

In a possible implementation manner of the present disclosure, the first candidate node is positioned earlier than other nodes in the boot sequence.

In a possible implementation of the present disclosure, the conversion module 220 determines the boot sequence based on the first candidate node in the following manner: determining a first sub-sequence of the first candidate node and a second sub-sequence of the second candidate node, where , the second candidate node is a node in the target policy tree whose trigger condition belongs to the second time constraint; a boot sequence is constructed based on the first sub-sequence and the second sub-sequence, where the second sub-sequence is located after the first sub-sequence.

In a possible implementation of the present disclosure, the constraints include a second time constraint, wherein the conversion module 220 determines the second sub-sequence of the second candidate node in the following manner: according to the preset traversal rules, determines the target The traversal order of the policy tree; according to the determined traversal order, each second candidate node in the target policy tree is traversed to form a second sub-sequence corresponding to all second candidate nodes.

In a possible implementation manner of the present disclosure, the conversion module 220 enters the first operation interface for the boot node by automatically selecting the boot node to enter the first operation interface for the boot node.

In a possible implementation of the present disclosure, the conversion module 220 enters the first operation interface in the following manner: in response to the trigger operation, switching the interface to exit the second operation interface for the target node and displaying the tree structure interface; The guide node is automatically selected on the displayed tree structure interface to enter the first operation interface for the guide node.

In a possible implementation of the present disclosure, the conversion module 220 is also configured to perform the following processing: after switching the interface, control the movement of the tree structure interface on the screen to display guidance in the target strategy tree on the screen. node; and/or, after automatically selecting the boot node, create a window, and display the first operation interface for the boot node in the created window.

In a possible implementation of the present disclosure, the receiving module 210 receives the user's selection operation on the first trigger control; In response to the selection operation of the first trigger control, the trigger condition corresponding to the guide node is determined; when the trigger condition is satisfied, the predetermined function is executed for the virtual element corresponding to the guide node.

In a possible implementation of the present disclosure, the guide node is a node in the target policy tree whose trigger condition belongs to the first time constraint, and the first operation interface is a simplified interface including a first trigger control for the guide node , wherein, in response to the selection operation of the first trigger control, the conversion module 220 determines that the node is next to the boot node in the boot sequence under the target policy tree, and enters the third operation interface for this node.

In a possible implementation of the present disclosure, the guide node is a node in the target policy tree whose trigger condition belongs to the second time constraint, and the first operation interface includes a first trigger control for the guide node and a plurality of An editing interface for candidate virtual elements, in which the receiving module 210 receives a selection operation on any of the plurality of candidate virtual elements on the first operation interface. The above device also includes: a triggering module, in response to the selection of the first virtual element. A selection operation of the trigger control determines any selected candidate virtual element as the virtual element corresponding to the guide node, so as to perform the predetermined function for the virtual element corresponding to the guide node.

According to the solutions of the embodiments of the present disclosure, users can avoid frequent operations on each node, reduce the complexity of users' operations on each node, and improve interaction efficiency.

Please refer to FIG. 12 , which is a schematic structural diagram of an electronic device according to an exemplary embodiment of the present disclosure. As shown in FIG. 12 , the electronic device 300 includes a processor 310 , a memory 320 and a bus 330 .

The memory 320 stores machine-readable instructions executable by the processor 310. When the electronic device 300 is running, the processor 310 and the memory 320 communicate through the bus 330, and the machine-readable instructions are When the processor 310 is executed, it may perform the steps of the interactive processing method in the game in any of the above embodiments, specifically as follows:

Receive the trigger operation performed by the user on the target node, which is a node in the target strategy tree in the game;

In response to the triggering operation, determine the boot node of the target node, and enter the first operation interface for the boot node;

A first trigger control for the guide node is displayed on the first operation interface, and the first trigger control is a control used to perform a predetermined function for the virtual element corresponding to the guide node in the game.

In a possible implementation of the present disclosure, the processor 410 is further configured to perform the following processing: display a tree structure interface for the target policy tree, in which the target node in the target policy tree is displayed; in response to The selection operation performed on the target node on the tree structure interface enters the second operation interface for the target node.

In a possible implementation of the present disclosure, each node in the target policy tree has a corresponding constraint, wherein the processor 410 is further configured to perform the following processing to determine the guide node of the target node: according to the target constraint , filter out the first candidate node from the nodes of the target policy tree; determine the boot sequence based on the first candidate node; determine the boot node of the target node from the nodes of the target policy tree based on the boot sequence, Wherein, the boot node is the next node of the target node in the boot sequence under the target policy tree.

In a possible implementation of the present disclosure, the processor 410 is further configured to perform the following processing to determine a boot sequence based on the first candidate node: determine a first sub-sequence of the first candidate node, convert the first The suborder is determined as the boot order.

In a possible implementation of the present disclosure, the target constraint includes a first time constraint, wherein the processor 410 is further configured to perform the following processing to determine the first sub-sequence of the first candidate node: according to a predetermined Assume the traversal rule Then, determine the traversal order for the target policy tree; according to the determined traversal order, traverse each first candidate node in the target policy tree to form a first sub-sequence corresponding to all first candidate nodes. The node is the node whose trigger condition belongs to the first time constraint in the target policy tree.

In a possible implementation of the present disclosure, the processor 410 is further configured to perform the following processing to determine a boot sequence based on the first candidate node: determine a first sub-sequence of the first candidate node and a second sub-sequence of the second candidate node. Sub-sequence, wherein the second candidate node is a node in the target policy tree whose trigger condition belongs to the second time constraint; construct a guidance sequence based on the first sub-sequence and the second sub-sequence, wherein the second sub-sequence is located in the first after suborder.

In a possible implementation of the present disclosure, the constraint condition includes a second time constraint condition, wherein the processor 410 is further configured to perform the following processing to determine the second sub-sequence of the second candidate node: according to the preset traversal rule , determine the traversal order for the target policy tree; according to the determined traversal order, traverse each second candidate node in the target policy tree to form a second sub-sequence corresponding to all second candidate nodes.

In a possible implementation of the present disclosure, the processor 410 is further configured to perform the following processing to enter the first operation interface for the boot node: automatically select the boot node to enter the first operation interface for the boot node. Operation interface.

In a possible implementation of the present disclosure, the processor 410 is also configured to enter the first operation interface in the following manner: in response to the trigger operation, switch the interface to exit the second operation interface for the target node, and display the tree Structure interface: automatically select the guide node on the displayed tree structure interface to enter the first operation interface for the guide node.

In a possible implementation of the present disclosure, the processor 410 is also configured to perform the following processing: after switching the interface, control the movement of the tree structure interface on the screen to display guidance in the target strategy tree on the screen. node; and/or, after automatically selecting the boot node, create a window, and display the first operation interface for the boot node in the created window.

In a possible implementation of the present disclosure, the processor 410 is further configured to perform the following processing: receiving the user's selection operation on the first trigger control; in response to the selection operation on the first trigger control, determining the corresponding boot node. Trigger condition; when the trigger condition is satisfied, the predetermined function is executed for the virtual element corresponding to the guide node. .

In a possible implementation of the present disclosure, the guide node is a node in the target policy tree whose trigger condition belongs to the first time constraint, and the first operation interface is a simplified interface including a first trigger control for the guide node , wherein the processor 410 is also configured to perform the following processing: in response to the selection operation of the first trigger control, determine the node next to the boot node in the boot sequence under the target policy tree, and enter the third operation for this node interface.

In a possible implementation of the present disclosure, the guide node is a node in the target policy tree whose trigger condition belongs to the second time constraint, and the first operation interface includes a first trigger control for the guide node and a plurality of An editing interface for candidate virtual elements, wherein the processor 410 is further configured to perform the following processing: receiving a selection operation on any of the plurality of candidate virtual elements on the first operation interface; responding to a selection operation on the first virtual element; A selection operation of the control is triggered, and any selected candidate virtual element is determined as a virtual element corresponding to the guide node, so as to perform the predetermined function for the virtual element corresponding to the guide node.

Embodiments of the present disclosure also provide a computer-readable storage medium. A computer program is stored on the storage medium. When the computer program is run by a processor, the computer program can perform the steps of the interactive processing method in the game in any of the above embodiments. Specifically, as follows:

In a possible implementation of the present disclosure, the processor is further configured to perform the following processing: display a tree structure interface for the target policy tree, in which the target node in the target policy tree is displayed; in response to The selection operation performed on the target node on the tree structure interface enters the second operation interface for the target node.

In a possible implementation of the present disclosure, each node in the target policy tree has a corresponding constraint, wherein the processor is further configured to perform the following processing to determine the guide node of the target node: according to the target constraint, Filter out the first candidate node from the nodes of the target policy tree; determine the boot sequence based on the first candidate node; determine the boot node of the target node from the nodes of the target policy tree based on the boot sequence, where , the boot node is the next node of the target node in the boot sequence under the target policy tree.

In a possible implementation manner of the present disclosure, the processor is further configured to perform the following processing to determine a boot sequence based on the first candidate node: determine a first sub-sequence of the first candidate node, convert the first sub-sequence The order is determined as boot order.

In a possible implementation of the present disclosure, the target constraint includes a first time constraint, wherein the processor is further configured to perform the following processing to determine the first sub-sequence of the first candidate node: according to a preset Traverse rules to determine the traversal order for the target policy tree; according to the determined traversal order, traverse each first candidate node in the target policy tree to form a first sub-sequence corresponding to all first candidate nodes, the first The candidate node is the node whose trigger condition belongs to the first time constraint in the target policy tree.

In a possible implementation manner of the present disclosure, the processor is further configured to perform the following processing to determine a boot sequence based on the first candidate node: determine a first sub-sequence of the first candidate node and a second sub-sequence of the second candidate node. Sequence, wherein the second candidate node is a node in the target policy tree whose trigger condition belongs to the second time constraint; the guidance sequence is constructed according to the first sub-sequence and the second sub-sequence, wherein the second sub-sequence is located in the first sub-sequence. After the order.

In a possible implementation of the present disclosure, the constraint condition includes a second time constraint condition, wherein the processor is further configured to perform the following processing to determine the second sub-sequence of the second candidate node: according to the preset traversal rule, Determine the traversal order for the target policy tree; traverse each second candidate node in the target policy tree according to the determined traversal order to form a second sub-sequence corresponding to all second candidate nodes.

In a possible implementation of the present disclosure, the processor is further configured to perform the following processing to enter the first operation interface for the boot node: automatically select the boot node to enter the first operation for the boot node interface.

In a possible implementation of the present disclosure, the processor is further configured to enter the first operation interface in the following manner: in response to the triggering operation, switch the interface to exit the second operation interface for the target node and display the tree structure Interface; automatically select the guide node on the displayed tree structure interface to enter the first operation interface for the guide node.

In a possible implementation of the present disclosure, the processor is further configured to perform the following processing: after switching the interface, control the movement of the tree structure interface on the screen to display the guidance node in the target strategy tree on the screen ; and/or, after automatically selecting the boot node, create a window, and display the first operation interface for the boot node in the created window.

In a possible implementation manner of the present disclosure, the processor is further configured to perform the following processing: receiving the user's response to the first trigger Select operation of the control; in response to the selection operation of the first trigger control, determine the trigger condition corresponding to the guide node; when the trigger condition is satisfied, execute the predetermined function for the virtual element corresponding to the guide node. .

In a possible implementation of the present disclosure, the guide node is a node in the target policy tree whose trigger condition belongs to the first time constraint, and the first operation interface is a simplified interface including a first trigger control for the guide node , wherein the processor is also configured to perform the following processing: in response to the selection operation of the first trigger control, determine the node next to the boot node in the boot sequence under the target policy tree, and enter the third operation interface for this node .

In a possible implementation of the present disclosure, the guide node is a node in the target policy tree whose trigger condition belongs to the second time constraint, and the first operation interface includes a first trigger control for the guide node and a plurality of An editing interface for candidate virtual elements, wherein the processor is further configured to perform the following processing: receiving a selection operation on any of the plurality of candidate virtual elements on the first operation interface; responding to the first trigger The selection operation of the control determines any selected candidate virtual element as the virtual element corresponding to the guide node, so as to perform the predetermined function for the virtual element corresponding to the guide node.

Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working processes of the systems and devices described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be described again here. In the several embodiments provided by this disclosure, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. The device embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components may be combined or can be integrated into another system, or some features can be ignored, or not implemented. On the other hand, the coupling or direct coupling or communication connection between each other shown or discussed may be through some communication interfaces, and the indirect coupling or communication connection of the devices or units may be in electrical, mechanical or other forms.

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

In addition, each functional unit in various embodiments of the present disclosure may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.

If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a non-volatile computer-readable storage medium that is executable by a processor. Based on this understanding, the technical solution of the present disclosure is essentially or the part that contributes to the relevant technology or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, It includes several instructions to cause a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present disclosure. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disk and other media that can store program code. .

The interactive processing method, device, electronic device and storage medium in the game provided by the embodiments of the present disclosure simplify the user's operation process of each node in the target strategy tree by introducing an automatic guidance mechanism to improve the interaction efficiency; each node is They are used as target nodes in turn to trigger the automatic selection mechanism of the guidance node. Based on the combination of automatic guidance and manual triggering, it can not only avoid the user's frequent operations on each node, but also avoid missing nodes in the target policy tree; due to the automatic The guidance and manual triggering methods not only reduce the complexity of the user's operation of each node, but also retain the user's interactive experience of obtaining virtual elements from the game. It also helps to improve user stickiness; it can also reduce the problems caused by users' frequent sliding and clicking. The interactive experience breakpoints improve the smoothness of the gameplay; and further reduce the operating costs and running time of the game in the terminal device, saving the power of the terminal device.

The above are only specific embodiments of the present disclosure, but the protection scope of the present disclosure is not limited thereto. Any person familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present disclosure, and they should be covered by within the scope of this disclosure. Therefore, the protection scope of the present disclosure should be subject to the protection scope of the claims.

Claims

An interactive processing method in a game, the method includes:

Receive the trigger operation performed by the user on the target node, which is a node in the target strategy tree in the game;

In response to the triggering operation, determine the boot node of the target node, and enter the first operation interface for the boot node;

A first trigger control for the guide node is displayed on the first operation interface, and the first trigger control is a control used to perform a predetermined function for the virtual element corresponding to the guide node in the game.
The method according to claim 1, wherein the trigger operation includes a selection operation performed by the user on a second trigger control on the second operation interface for the target node, and the second trigger control is used to control the target node in the game. The virtual element corresponding to the target node performs a predetermined function.
The method according to claim 1 or 2, wherein the target node is a node in the target policy tree that meets the following conditions:

Each node on the specified node path in the target strategy tree has been triggered. The specified node path is the path from the parent node of the target node to the root node. The node being triggered means that the virtual element corresponding to the node has been targeted in the game. Performed a predetermined function;

The trigger conditions corresponding to the target node belong to the target constraints.
The method of claim 2, further comprising:

Display a tree structure interface for the target policy tree, and the target node in the target policy tree is displayed in the tree structure interface;

In response to the selection operation performed on the target node on the tree structure interface, a second operation interface for the target node is entered.
The method according to claim 1, wherein each node in the target policy tree has corresponding constraints,

Wherein, the step of determining the boot node of the target node includes:

According to the target constraints, select the first candidate node from the nodes of the target policy tree;

Determine a boot sequence based on the first candidate node;

Based on the boot sequence, the boot node of the target node is determined from the nodes of the target policy tree, where the boot node is the next node of the target node in the boot sequence under the target policy tree.
The method of claim 5, wherein determining a boot sequence based on the first candidate node includes:

Determine the first sub-sequence of the first candidate node;

The first sub-sequence is determined as the boot sequence.
The method of claim 6, wherein the target constraint includes a first time constraint, and wherein determining the first sub-sequence of the first candidate node includes:

Determine the traversal order for the target policy tree according to the preset traversal rules;

According to the determined traversal order, each first candidate node in the target policy tree is traversed to form a first sub-sequence corresponding to all first candidate nodes. The first candidate node is the first candidate node whose trigger condition belongs to the first node in the target policy tree. Nodes for time constraints.
The method of claim 5, wherein the first candidate node is positioned earlier than other nodes in the boot sequence.
The method of claim 8, wherein determining a boot sequence based on the first candidate node includes:

Determine the first sub-sequence of the first candidate node and the second sub-sequence of the second candidate node, wherein the second candidate node is a node in the target policy tree whose trigger condition belongs to the second time constraint;

The boot sequence is constructed based on the first subsequence and the second subsequence, where the second subsequence is located after the first subsequence.
The method of claim 9, wherein the constraints include a second time constraint,

Wherein, the step of determining the second sub-sequence of the second candidate node includes:

Determine the traversal order for the target policy tree according to the preset traversal rules;

According to the determined traversal order, each second candidate node in the target policy tree is traversed to form a second sub-sequence corresponding to all second candidate nodes.
The method according to claim 1, wherein the step of entering the first operation interface for the boot node includes:

The boot node is automatically selected to enter the first operation interface for the boot node.
The method according to claim 4, wherein the first operation interface is entered in the following manner:

In response to the triggering operation, switch the interface to exit the second operation interface for the target node and display the tree structure interface;

The guide node is automatically selected on the displayed tree structure interface to enter the first operation interface for the guide node.
The method of claim 12, further comprising:

After switching the interface, control the tree structure interface to move on the screen to display the guide node in the target strategy tree on the screen;

And/or, after the boot node is automatically selected, a window is created, and the first operation interface for the boot node is displayed in the created window.
The method of claim 1, further comprising:

Receive the user's selection operation on the first trigger control;

In response to the selection operation on the first trigger control, determine the trigger condition corresponding to the guide node;

When the trigger condition is met, the predetermined function is executed for the virtual element corresponding to the boot node.
The method according to claim 1, wherein the guide node is a node in the target policy tree whose trigger condition belongs to a first time constraint, and the first operation interface is a simplified interface including a first trigger control for the guide node ,

Among them, it also includes:

In response to the selection operation of the first trigger control, it is determined that the node is next to the boot node in the boot sequence under the target policy tree, and the third operation interface for the node is entered.
The method according to claim 1, wherein the guide node is a node in the target policy tree whose trigger condition belongs to the second time constraint, and the first operation interface includes a first trigger control for the guide node and a plurality of Editing interface for candidate virtual elements,

Among them, it also includes:

Receive a selection operation on any candidate virtual element among the plurality of candidate virtual elements on the first operation interface;

In response to the selection operation on the first trigger control, any selected candidate virtual element is determined as a virtual element corresponding to the guide node, so as to perform the predetermined function for the virtual element corresponding to the guide node.
An interactive processing device in a game, the device includes:

The receiving module receives the trigger operation performed by the user on the target node, where the target node is a node in the target strategy tree in the game;

A conversion module, in response to the triggering operation, determines the boot node of the target node, and enters the first operation interface for the boot node;

A display control module displays a first trigger control for a guidance node on the first operation interface, where the first trigger control is a control used to perform a predetermined function for a virtual element corresponding to the guidance node in the game.
An electronic device, including: a processor, a storage medium and a bus, the storage medium stores the Machine-readable instructions executable by a processor. When the electronic device is running, the processor communicates with the storage medium through a bus, and the processor executes the machine-readable instructions to perform the tasks of claims 1 to 1. 16. Steps of any of the methods.
A computer-readable storage medium. A computer program is stored on the computer-readable storage medium. When the computer program is run by a processor, the steps of the method according to any one of claims 1 to 16 are executed.