A multi-branch task access method and device, electronic equipment and storage medium

CN116271804BActive Publication Date: 2026-10-20BEIJING PIXEL SOFTWARE TECH
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202211672772.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-12-26
Publication Date
2026-10-20
Estimated Expiration
2042-12-26

AI Technical Summary

Technical Problem

[0002]在游戏项目中,任务系统的每个任务都有自身的接取条件,有的是完成上一个任务接取下一个任务,有的是完成多个任务中的任意就能接取下一个任务,还有的完成多个任务的全部才能接取下一个任务,由于任务数量较多,且目前对于任务管理方式通常需要在任务数据配置列表中查找任务相关的数据,并基于相关数据进行管理,基于任务数据配置列表进行任务管理,造成对任务管理的效率较低,从而影响系统性能,降低玩家游戏体验

Benefits of technology

本申请通过确定目标对象,从任务数据配置列表中确定与目标对象对应的多个任务,从任务数据配置列表中,确定各任务之间的前后关系以及各任务之间的接取关系,其中,任务数据配置列表包括不同目标对象对应的不同任务,以及相同目标对象对应的各任务之间的前后关系和接取关系,基于确定各任务之间的前后关系以及各任务之间的接取关系,生成目标对象的任务节点行为树,基于任务节点行为树,对目标任务进行接取,基于任务节点行为树对任务进行接取和管理,可以提高任务管理的效率,提高系统的性能以及提高玩家的游戏体验。

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116271804B_ABST
    Figure CN116271804B_ABST
Patent Text Reader

Abstract

Embodiments of the present application provide a multi-branch task access method and device, electronic equipment and storage medium, relating to the technical field of data processing. The method comprises determining a target object, determining a plurality of tasks corresponding to the target object from a task data configuration list, determining the sequence relationship between tasks and the access relationship between tasks from the task data configuration list. The task data configuration list comprises different tasks corresponding to different target objects, and the sequence relationship and access relationship between tasks corresponding to the same target object. Based on the determination of the sequence relationship between tasks and the access relationship between tasks, a task node behavior tree of the target object is generated. Based on the task node behavior tree, the target task is accessed. Based on the task node behavior tree, the task is accessed and managed, which can improve the efficiency of task management, improve the performance of the system and improve the gaming experience of the player.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the field of data processing technology, and more specifically, to a method, apparatus, electronic device, and storage medium for receiving multi-branch tasks. Background Technology

[0002] In game projects, each task in the task system has its own conditions for accepting it. Some tasks require completing the previous task to accept the next one, some require completing any one of multiple tasks, and some require completing all of multiple tasks to accept the next one. Due to the large number of tasks, and the current task management method, which usually requires searching for task-related data in the task data configuration list and managing tasks based on that data, the efficiency of task management is low, which affects system performance and reduces the player's gaming experience. Summary of the Invention

[0003] The purpose of this application is to provide a method, apparatus, electronic device, and storage device for receiving multi-branch tasks, which can improve the efficiency of task management.

[0004] To achieve the above objectives, the technical solutions adopted in the embodiments of this application are as follows: In a first aspect, embodiments of this application provide a method for receiving multi-branch tasks, the method comprising: Identify the target object; Determine multiple tasks corresponding to the target object from the task data configuration list; From the task data configuration list, determine the sequential relationship between each task and the access relationship between each task, wherein the task data configuration list includes different tasks corresponding to different target objects, and the sequential relationship and access relationship between each task corresponding to the same target object; Based on the determined sequential relationships between the tasks and the access relationships between the tasks, a task node behavior tree of the target object is generated; Based on the task node behavior tree, the target task is accepted.

[0005] In an optional implementation, the step of accepting the target task based on the task node behavior tree includes: From the task node behavior tree, determine the first prerequisite task for the target task; Determine the status of the first prerequisite task; Based on the status of the first prerequisite task, the target task is accepted.

[0006] In an optional implementation, the step of accepting the target task based on the state of the first prerequisite task includes: If there is one prerequisite task, determine whether the status of the first prerequisite task is completed. When the first prerequisite task is completed, the target task is accepted.

[0007] In an optional implementation, the step of accepting the target task based on the state of the first prerequisite task includes: In the case where there are multiple first prerequisite tasks, determine the access relationship between the multiple first prerequisite tasks; If the access relationship between each of the first pre-tasks is OR, determine the state of each of the first pre-tasks; When any of the first prerequisite tasks is in a completed state, the target task is accepted. When the access relationship between each of the first prerequisite tasks is AND, the target task is accessed when the status of each of the first prerequisite tasks is completed.

[0008] In an optional implementation, the method further includes: Insert a new task into the task node behavior tree; From the task node behavior tree, determine the second preceding task, succeeding task, and parallel task related to the new task: The new task is processed based on the state of the second preceding task and / or the state of the following task and / or the state of the parallel tasks.

[0009] In an optional implementation, the step of processing the new task based on the state of the second preceding task and / or the state of the following task and / or the state of parallel tasks includes: When the parallel tasks are incomplete, the new task is accepted; When the parallel task is in a completed state and the subsequent task is in an incomplete state, the new task is accepted and its state is set to completed.

[0010] Secondly, embodiments of this application provide a multi-branch task receiving device, the device comprising: Determine the module and the receiving module; The determining module is used to determine the target object; Determine multiple tasks corresponding to the target object from the task data configuration list; From the task data configuration list, determine the sequential relationship between each task and the access relationship between each task, wherein the task data configuration list includes different tasks corresponding to different target objects, and the sequential relationship and access relationship between each task corresponding to the same target object; Based on the determined sequential relationships between the tasks and the access relationships between the tasks, a task node behavior tree of the target object is generated; The receiving module is used to receive the target task based on the task node behavior tree.

[0011] Thirdly, embodiments of this application provide an electronic device, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps of the multi-branch task receiving method.

[0012] Fourthly, embodiments of this application provide a storage medium storing a computer program thereon, which, when executed by a processor, implements the steps of the multi-branch task receiving method.

[0013] This application has the following beneficial effects: This application identifies a target object, determines multiple tasks corresponding to the target object from a task data configuration list, and determines the sequential relationships and access relationships between tasks from the task data configuration list. The task data configuration list includes different tasks corresponding to different target objects, as well as the sequential and access relationships between tasks corresponding to the same target object. Based on the determined sequential and access relationships between tasks, a task node behavior tree for the target object is generated. Based on the task node behavior tree, target tasks are accessed and managed, which improves the efficiency of task management, enhances system performance, and improves the player's gaming experience. Attached Figure Description

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

[0015] Figure 1 A block diagram illustrating an electronic device provided in an embodiment of this application; Figure 2 One of the flowcharts for a method of receiving multi-branch tasks provided in an embodiment of this application; Figure 3This is a schematic diagram of the task node behavior tree of the target object provided in the embodiments of this application; Figure 4 A second flowchart illustrating a method for receiving multi-branch tasks provided in an embodiment of this application; Figure 5 The third flowchart illustrates a method for receiving multi-branch tasks provided in this application embodiment; Figure 6 The fourth flowchart illustrates a method for receiving multi-branch tasks provided in this application embodiment; Figure 7 The fifth flowchart illustrates a method for receiving multi-branch tasks provided in this application embodiment; Figure 8 This is a structural block diagram of a multi-branch task receiving device provided in an embodiment of this application. Detailed Implementation

[0016] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. The components of the embodiments of this application described and shown in the accompanying drawings can generally be arranged and designed in various different configurations.

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

[0018] It should be noted that similar labels and letters in the following figures indicate similar items. Therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures.

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

[0020] Furthermore, the terms "first" and "second" are used only to distinguish descriptions and should not be interpreted as indicating or implying relative importance.

[0021] In the description of this application, it should also be noted that, unless otherwise expressly specified and limited, the terms "set up," "install," "connect," and "link" should be interpreted broadly. For example, they can refer to a fixed connection, a detachable connection, or an integral connection; they can refer to a mechanical connection or an electrical connection; they can refer to a direct connection or an indirect connection through an intermediate medium; and they can refer to the internal connection of two components. Those skilled in the art can understand the specific meaning of the above terms in this application based on the specific circumstances.

[0022] Through extensive research, the inventors discovered that in game projects, each task in the task system has its own conditions for accepting it. Some tasks require completing the previous task to accept the next one, some require completing any one of multiple tasks, and some require completing all of multiple tasks to accept the next one. Due to the large number of tasks, and the current task management method which usually requires searching for task-related data in a task data configuration list and managing tasks based on that data, task management is inefficient, thus affecting system performance and reducing the player's gaming experience.

[0023] In view of the above-mentioned problems, this embodiment provides a method, apparatus, electronic device, and storage medium for receiving multi-branch tasks. It can determine multiple tasks corresponding to a target object from a task data configuration list, and determine the sequential relationships and receiving relationships between tasks from the task data configuration list. The task data configuration list includes different tasks corresponding to different target objects, as well as the sequential and receiving relationships between tasks corresponding to the same target object. Based on the determined sequential and receiving relationships, a task node behavior tree of the target object is generated. Based on the task node behavior tree, the target task is received, and the task is received and managed. This improves the efficiency of task management, enhances system performance, and improves the player's gaming experience. The solution provided in this embodiment will be described in detail below.

[0024] This embodiment provides an electronic device capable of processing messages. In one possible implementation, the electronic device can be a user terminal, such as, but not limited to, a server, smartphone, personal computer (PC), tablet computer, personal digital assistant (PDA), mobile internet device (MID), etc.

[0025] Please refer to Figure 1 , Figure 1This is a schematic diagram of the structure of the electronic device 100 provided in the embodiments of this application. The electronic device 100 may further include... Figure 1 The more or fewer components shown, or having the same Figure 1 The different configurations shown. Figure 1 The components shown can be implemented using hardware, software, or a combination thereof.

[0026] The electronic device 100 includes a multi-branch task receiving device 110, a memory 120, and a processor 130.

[0027] The components of the memory 120 and processor 130 are electrically connected directly or indirectly to achieve data transmission or interaction. For example, these components can be electrically connected to each other through one or more communication buses or signal lines. The multi-branch task receiving device 110 includes at least one software function module that can be stored in the memory 120 in the form of software or firmware or embedded in the operating system (OS) of the electronic device 100. The processor 130 is used to execute executable modules stored in the memory 120, such as the software function modules and computer programs included in the multi-branch task receiving device 110.

[0028] The memory 120 may be, but is not limited to, Random Access Memory (RAM), Read Only Memory (ROM), Programmable Read-Only Memory (PROM), Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), etc. The memory 120 is used to store programs, and the processor 130 executes the programs after receiving execution instructions.

[0029] Please refer to Figure 2 , Figure 2 For application Figure 1 The flowchart of a multi-branch task acceptance method for an electronic device 100 is described below, and the method includes each step in detail.

[0030] Step 201: Identify the target object.

[0031] Step 202: Identify multiple tasks corresponding to the target object from the task data configuration list.

[0032] Step 203: From the task data configuration list, determine the sequential relationship between tasks and the receiving relationship between tasks.

[0033] The task data configuration list includes different tasks corresponding to different target objects, as well as the sequential and successive relationships between tasks corresponding to the same target object.

[0034] Step 204: Based on the determined sequential relationships between tasks and the access relationships between tasks, generate the task node behavior tree of the target object.

[0035] Step 205: Accept the target task based on the task node behavior tree.

[0036] It should be noted that the target can be a game player. All of the player's task information is stored in the game server. All players' game information is stored in the game server. Each player has a corresponding task data configuration list. Each task data configuration list contains different tasks, as well as the sequence and acceptance relationships between the tasks.

[0037] For example, the target is player A. The game server retrieves a list of quest data configurations for player A. From this list, all quests for player A are identified, such as level-based quests, main quests, side quests, and dungeon quests. The relationships between these quests, including their order of appearance and their acceptability, are determined. For instance, regarding quests for level 1, level 2, and level 3: when player A is currently at level 2, the level 1 quest is a prerequisite, and the level 3 quest is a subsequent quest. The order of appearance for these quests is as follows: the level 1 quest precedes the level 3 quest, the level 1 quest precedes the level 2 quest, and the level 2 and level 3 quests follow the level 1 quest. The acceptability relationship for these quests is as follows: the level 2 quest can only be accepted after completing the level 1 quest, and the level 3 quest can only be accepted after completing the level 2 quest. When there are multiple parallel tasks corresponding to level 2, the relationship between tasks corresponding to different levels 2 is that completing any task corresponding to level 2 will allow you to accept the task corresponding to level 3.

[0038] Based on the sequential relationships and access relationships between tasks, a task node behavior tree for the target object is generated. For example... Figure 3The diagram shows the task node behavior tree of the target object. In the diagram, the root task is the first task of the target object on a certain branch. Task 1.1 is the successor task of the root task. Tasks 2.1 and 2.2 are the successors of Task 1.1. The access relationship between Task 2.1 and Task 2.2 is OR, that is, after completing either Task 2.1 or Task 2.2, Task 3 can be accessed. Tasks 4.1, 4.2, and 4.3 are the successors of Task 3. The access relationship between Tasks 4.1, 4.2, and 4.3 is OR. Task n is the successor task of Tasks 4.1, 4.2, and 4.3.

[0039] When a target object accepts a target task, it should be noted that, based on the task node structure being a tree, it is determined whether the acceptance conditions are met before accepting the target task.

[0040] For example, when the target task is task 1.1, it is necessary to determine the relationship between task 1.1 and the root task that precedes it. Task 1.1 can only be taken over after the root task is completed.

[0041] There are multiple ways to receive the target task. In one implementation method, such as... Figure 4 As shown, it includes the following steps: Step 205-1: Determine the first prerequisite task for the target task from the task node behavior tree.

[0042] Step 205-2: Determine the status of the first prerequisite task.

[0043] Step 205-3: Based on the status of the first prerequisite task, accept the target task.

[0044] It should be noted that the first prerequisite task for the target task can be determined using the GetPreList() interface.

[0045] For example, when the target task is task A, the first prerequisite task of task A is determined from the task node behavior tree, and the first prerequisite task is task B. Based on the state of task B, the target task is accepted.

[0046] There are several ways to receive the target task based on the state of the first prerequisite task. In one method, such as... Figure 5 As shown, it includes the following steps: Step 301: If there is one prerequisite task, determine whether the status of the first prerequisite task is completed.

[0047] Step 302: When the first prerequisite task is completed, accept the target task.

[0048] For example, when the target task is task A, the first prerequisite task for task A is determined from the task node behavior tree, and the first prerequisite task is task B. Based on the acceptance relationship between task B and task A, task A is accepted.

[0049] For example: If the relationship between task B and task A is that task A can only be accepted after task B is completed, then the status of task B is determined, and task A is accepted when task B is in the completed state.

[0050] Another way to receive the target task based on the state of the first prerequisite task is as follows: Figure 6 As shown, it includes the following steps: Step 401: If there are multiple first prerequisite tasks, determine the access relationship between the multiple first prerequisite tasks.

[0051] Step 402: If the access relationship between each first prerequisite task is OR, determine the status of each first prerequisite task.

[0052] Step 403: When any of the first prerequisite tasks is in the completed state, accept the target task.

[0053] Step 404: When the acceptance relationship between each first prerequisite task is summed, and when the status of each first prerequisite task is completed, accept the target task.

[0054] For example, the target task is task A, and the multiple prerequisite tasks of task A include task B and task C. The access relationship between task A, task B and task C and the status of task B and task C are determined. When the access relationship between task B and task C is an OR relationship, that is, task B and task C are in a parallel relationship, task A is accessed when either task B or task C is in a completed state.

[0055] When the acceptance relationship between task B and task C is AND, the target task is accepted when both task B and task C are in the completed state.

[0056] For inserting a new task into the task node behavior tree, such as Figure 7 As shown, it includes the following steps: Step 501: Insert a new task into the task node behavior tree.

[0057] Step 502: From the task node behavior tree, determine the second predecessor task, successor task, and parallel task of the new task.

[0058] Step 503: Process the new task based on the state of the second preceding task and / or the state of the following task and / or the state of the parallel tasks.

[0059] For example, when a parallel task is in an incomplete state, a new task is accepted; when a parallel task is in a completed state and the subsequent task is in an incomplete state, a new task is accepted and its status is set to completed.

[0060] In another example, the next task is obtained through the node.getNextList interface. If there are tasks that have already been accepted or completed in the next task list, the status of the new task is automatically set to completed.

[0061] When no subsequent task has been accepted, the preceding task needs to be retrieved through node.getPreList. If there is a completed preceding task, the new task will not be processed.

[0062] Please refer to Figure 8 This application embodiment also provides an application for Figure 1 The multi-branch task receiving device 110 of the electronic device 100 includes: Determine module 111 and receiving module 112; The determining module 111 is used to determine the target object; Determine multiple tasks corresponding to the target object from the task data configuration list; From the task data configuration list, determine the sequential relationship between each task and the access relationship between each task, wherein the task data configuration list includes different tasks corresponding to different target objects, and the sequential relationship and access relationship between each task corresponding to the same target object; Based on the determined sequential relationships between the tasks and the access relationships between the tasks, a task node behavior tree of the target object is generated; The receiving module 112 is used to receive the target task based on the task node behavior tree.

[0063] It should be noted that the basic principle and technical effect of the multi-branch task receiving device provided in this embodiment are the same as those of the multi-branch task receiving method embodiment described above. For the sake of brevity, any parts not mentioned in this embodiment can be referred to the corresponding content in the above method embodiment.

[0064] This application also provides an electronic device 100, which includes a processor 130 and a memory 120. The memory 120 stores computer-executable instructions, which, when executed by the processor 130, implement a method for handling multi-branch tasks.

[0065] This application embodiment also provides a computer-readable storage medium storing a computer program, which, when executed by a processor 130, implements the multi-branch task reception method.

[0066] In the embodiments provided in this application, it should be understood that the disclosed apparatus and methods can also be implemented in other ways. The apparatus embodiments described above are merely illustrative. For example, the flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than those marked in the drawings. For example, two consecutive blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram and / or flowchart, and combinations of blocks in block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.

[0067] Furthermore, the functional modules in the various embodiments of this application can be integrated together to form an independent part, or each module can exist independently, or two or more modules can be integrated to form an independent part. If the function is implemented as a software functional module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes: USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, optical disks, and other media capable of storing program code.

[0068] It should be noted that, in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

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

Claims

1. A method for receiving multi-branch tasks, characterized in that, The method includes: Identify the target object; Determine multiple tasks corresponding to the target object from the task data configuration list; From the task data configuration list, determine the sequential relationship between each task and the access relationship between each task, wherein the task data configuration list includes different tasks corresponding to different target objects, and the sequential relationship and access relationship between each task corresponding to the same target object; Based on the determined sequential relationships between the tasks and the access relationships between the tasks, a task node behavior tree of the target object is generated; Based on the task node behavior tree, the target task is accepted; The method further includes: Insert a new task into the task node behavior tree; From the task node behavior tree, determine the second preceding task, succeeding task, and parallel task related to the new task: The new task is processed based on the state of the second preceding task and / or the state of the following task and / or the state of the parallel tasks. The step of processing the new task based on the state of the second preceding task and / or the state of the following task and / or the state of the parallel tasks includes: When the parallel tasks are incomplete, the new task is accepted; When the parallel task is in a completed state and the subsequent task is in an incomplete state, the new task is accepted and the status of the new task is set to completed. The node.getNextList interface is used to retrieve subsequent tasks. If there are already accepted or completed tasks in the subsequent task list, the status of the new task will be automatically set to completed.

2. The method according to claim 1, characterized in that, The step of accepting the target task based on the task node behavior tree includes: From the task node behavior tree, determine the first prerequisite task for the target task; Determine the status of the first prerequisite task; Based on the status of the first prerequisite task, the target task is accepted.

3. The method according to claim 2, characterized in that, The step of accepting the target task based on the state of the first prerequisite task includes: If there is one prerequisite task, determine whether the status of the first prerequisite task is completed. When the first prerequisite task is completed, the target task is accepted.

4. The method according to claim 2, characterized in that, The step of accepting the target task based on the state of the first prerequisite task includes: In the case where there are multiple first prerequisite tasks, determine the access relationship between the multiple first prerequisite tasks; If the access relationship between each of the first pre-tasks is OR, determine the state of each of the first pre-tasks; When any of the first prerequisite tasks is in a completed state, the target task is accepted. When the access relationship between each of the first prerequisite tasks is AND, the target task is accessed when the status of each of the first prerequisite tasks is completed.

5. A multi-branch task receiving device, characterized in that, The apparatus performs the method as described in any one of claims 1-4.

6. An electronic device, characterized in that, It includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program to implement the steps of the method according to any one of claims 1-4.

7. A storage medium having a computer program stored thereon, characterized in that, When executed by a processor, the computer program implements the steps of the method described in any one of claims 1-4.

Citation Information

Patent Citations

  • Node control method based on interactive application and relevant device

    CN110327623A

  • Program inference and execution for automated compilation, testing, and packaging of applications

    US11481245B1

  • Leadership Role Playing Game and Method Therefor

    US20150258454A1

  • Method and systems for dynamic quest generation

    US20220168652A1