A method for task allocation in games under the metaverse

By designing a task allocation module in a meta-universe game, the fairness and efficiency of virtual player task allocation are solved, and various ways of task allocation and management are realized, improving the game experience and management efficiency.

CN114849245BActive Publication Date: 2025-05-02LINGSHU TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202210352581.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-04-06
Publication Date
2025-05-02
Estimated Expiration
2042-04-06

AI Technical Summary

Technical Problem

In the game under the Metaverse, how to effectively assign tasks to virtual players to ensure fairness and efficiency of task allocation?

Method used

The task allocation module is adopted that includes modules such as dual-mode controller, task queuer, function selector, etc., and the task allocation and management is realized through the setting of parallel processing count, time buffer and label selection functions.

Benefits of technology

It realizes efficient allocation of tasks in meta-universe games, can allocate tasks at fixed frequency or predetermined time, supports batch allocation and task allocation of players with similar attributes, and improves game experience and management efficiency.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The present invention proposes a method for task allocation in a game under the metaverse. The method designs a variety of ways of extracting tasks for task allocation; the present invention can allocate tasks at a fixed frequency, can allocate tasks at a predetermined time, and can allocate tasks within a specified time. In addition, the present invention can not only allocate tasks in batches to virtual players in multiple ways, but also allocate tasks to players with similar attributes; the present invention adopts a method of multiple module collaboration, has clear functions, and has a great reference value for other applications.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of game applications and is a method for allocating tasks in games under a metaverse. Background Art

[0002] When the Metaverse becomes more and more "real" around us, it means that everyone will be a "player" in the future. The most important feature of the Metaverse era after the Internet era is to create a new life experience that allows people to be in a virtual and real parallel world. In short, work and life in the Metaverse era are inseparable from virtual game scenes. How to plan the task allocation for virtual players in the game is a research point worth planning. Summary of the invention

[0003] In view of this, the present invention provides a method for allocating tasks in a game under a metaverse that solves or partially solves the above-mentioned problems;

[0004] In order to achieve the effect of the above technical steps, the technical steps of the present invention are: the method is applied in a virtual world, and after being called a virtual player in the game, the method assigns tasks to the virtual player, and the virtual player obtains the tasks. After completing the tasks, the virtual player can obtain game points or extend the game time;

[0005] The implementation of the method is carried out by the task allocation module, which includes a dual-mode controller, a timer refresher, a function selector, a coordinate inputter, a queue storage area, a task queuer, and a coordinator; the method sets a parallel processing number, and the parallel processing number R is used to represent the number of tasks assigned simultaneously, which is a natural number; the task allocation module is used for specific task allocation in the game;

[0006] The task queuer contains tasks waiting for the virtual player to do. The task queuer contains a data import and a data export. The data import is the entrance for tasks to enter the task queuer, and the data export is the exit for tasks to exit the task queuer. By default, R tasks enter the task queuer at the same time or R tasks exit the task queuer at the same time. The task queuer is used to queue and allocate tasks for the virtual player to do.

[0007] The dual-mode controller includes a horizontal enable bit, a vertical enable bit, a shift enable bit, a tag enable bit, and a carry enable bit. The dual-mode controller sets a time buffer, and the time buffer can contain cycle numbers, predetermined numbers, and combination numbers. The cycle number is used to represent the time period for assigning tasks to virtual players, and is a certain real number. There is one and only one cycle number in the time buffer; the predetermined number is used to represent the time interval for assigning tasks to virtual players, and the combination number is a combination of the cycle value and the interval number. The combination number is used to represent that within the time interval represented by the interval number, tasks are assigned to players with the cycle value as the time period, and the interval number is a time interval. , the interval number is used to indicate the time interval in which the combination number is valid; within the time interval indicated by the interval number, the cycle number is invalid, and no task is assigned to the virtual player periodically with the cycle number as the value; the predetermined number is placed in the time buffer, and the controller is notified within the time interval of the predetermined number, and the controller is responsible for setting the values ​​of the horizontal enable bit, vertical enable bit, shift enable bit, label enable bit, and carry enable bit of the dual-mode controller, and allocating the coordinates in the queue storage area; the dual-mode controller is used to control the function of task allocation; the time buffer is used to specifically store the time period and the predetermined time of task allocation;

[0008] Among them, the horizontal enable bit is used to trigger the selection of the task card whose x coordinate value in the queue storage area is equal to the x coordinate number, and the vertical enable bit is used to trigger the selection of the task card whose y coordinate value in the queue storage area is equal to the y coordinate number; the horizontal enable bit and the vertical enable bit can be 1 at the same time, but when the horizontal enable bit is 0, the vertical enable bit cannot be 1; the horizontal enable bit, the vertical enable bit, the shift enable bit, the carry enable bit, and the label enable bit are connected to the function selector, and the function selector is used to switch the function; the shift enable bit and the carry enable bit cannot be 1 at the same time. When the shift enable bit is 1, the horizontal enable bit must be 1 and the vertical enable bit is 0; when the shift enable bit is 1, the function selector activates the clearing function, and the clearing function is used Instructions for clearing the task card in the storage cell of the specified x coordinate in the queue storage area; the specified x coordinate is provided by the coordinate input device, and the coordinate input device accepts the input x coordinate number as the specified x coordinate, and the function selector triggers the clearing mark to start working, and the clearing mark clears the task card with the value of the x coordinate number as the x coordinate in the queue storage area; when the carry enable bit is 1, the horizontal enable bit, the vertical enable bit, the shift enable bit, and the label enable bit are invalid, and the queue storage area accepts the storage of task cards; the carry enable bit is used to illustrate the storage of receiving task cards; the shift enable bit is used to illustrate the clearing of task cards in the queue storage area, and the label enable bit is used to illustrate finding virtual players to assign tasks according to the requirements of the label;

[0009] When the shift enable bit is 0, the tag enable bit is 0, and the carry enable bit is 0, the horizontal enable bit and the vertical enable bit combination control the allocation of the task card at the specified position, the horizontal enable bit is 1, and the vertical enable bit is 0, the x coordinate number input by the coordinate input device is received, and the function selector turns on the row task allocation function, the row task allocation function is used to extract the task card with the same x coordinate as the value of the x coordinate number, and allocate it in ascending order according to the size of the y coordinate value, and the task queuer allocates R tasks to the extracted task card at the same time each time, and allocates M times in total;

[0010] When the shift enable bit is 0, the tag enable bit is 0, the carry enable bit is 0, the horizontal enable bit is 1, and the vertical enable bit is 1, the x coordinate number and the y coordinate number input by the coordinate input device are received. If the input y coordinate number is invalid, the function selector starts the row task allocation function; if both the x coordinate number and the y coordinate number are valid, the function selector starts the position task allocation function, and the position task allocation function is used to extract the task card with the same x coordinate value as the x coordinate number and the same y coordinate value as the y coordinate number, and the task queuer simultaneously allocates R tasks to the extracted task cards, for a total of 1 allocation;

[0011] When the tag enable bit is 1, the function selector turns on the tag selection function, which is used to allocate task cards according to tags in the queue storage area. The tag selector draws 3 times from all task cards with z coordinates equal to 1 in the queue storage area, and draws R task cards at the same time each time; the tag selector accepts the input of the tag, and when the tag is the value of the level, the tag selector searches for the task card closest to the tag among the drawn task cards. If there is more than one task card closest to the value of the tag, the task card with the highest credibility is selected; when the tag is the credibility value, the tag selector searches for the task card closest to the tag among the drawn task cards. The task card with the closest tag is selected. If there is more than one task card with the closest tag value, the task card with the highest level is selected; when there are more than one task cards with the same level and the same reputation value among the selected task cards, the tag selector selects the task card that enters the queue storage area first in time. After the task card is selected by the queue storage area, the tag selector simultaneously extracts all task cards with the same x coordinate and y coordinate as the selected task card, and the task is extracted from the task queue and assigned to the task card; after the task is assigned to the task card, the task card is taken out from the queue storage area, and the virtual player who owns the task card is assigned to the task;

[0012] The coordinate input device is used to receive input x-coordinates and y-coordinates, which are named x-coordinate number and y-coordinate number respectively. When the horizontal enable bit is 1 and the vertical enable bit is 0, the coordinate input device only accepts the input of one number, which is the x-coordinate number and is valid; when the horizontal enable bit is 1 and the vertical enable bit is 1, the coordinate input device accepts the input of two numbers, and the first number input is the x-coordinate number and the second number input is the y-coordinate number by default, and a control parameter is set in the coordinate input device, and the control parameter is used to limit the time difference between the input of the first number and the input of the second number, that is, after the first number is input, the second number is input after the time does not exceed the value of the control parameter; if the difference between the time of inputting the second number and the time of inputting the first number exceeds the value of the control parameter, the input of the second number is invalid, and only the x-coordinate number is valid; the x-coordinate number and the y-coordinate number are used to specify the x-coordinate and y-coordinate of the task card respectively;

[0013] The function selector can specify to take out the task card in the storage grid of the specified x coordinate and y coordinate in the queue storage area; the information in the task card can be expanded in the present invention, and the content of the label and the strategy of finding the label in the queue storage area can be specified; all the units involving time and time period in the present invention are the same;

[0014] The queue storage area is used to store the task cards of virtual players, and the task cards are used to indicate the identities of the virtual players when assigning tasks. The task cards identify the ID, level, role, and reputation value of the virtual players, and the initial values ​​of the level and reputation value are respectively equal to the level and reputation value of the virtual players when the task cards are made. After being assigned and stored in the queue storage area, the reputation value and level in the task cards point to the addresses where the reputation value and level are stored through content change pointers. The content change pointer indicates that after the storage content in the address pointed to is changed, the reputation value and level in the task cards will change accordingly. The task cards have x in the queue storage area. coordinates, y coordinates, and z coordinates, and the x coordinates, y coordinates, and z coordinates are all positive integers greater than or equal to 1; the queue storage area is divided into storage cells, one storage cell stores a task card, and the coordinates of the task card are equal to the coordinates of the storage cell; after the task card is made, the x coordinates and y coordinates are visible to the virtual player who owns the task card, and the z coordinate is invisible, that is, the virtual player obtains the x coordinates and y coordinates of the task card in the queue storage area; the coordinator first assigns coordinates to the storage cells, and assigns them in ascending order from 1 according to the order in which the task cards are generated and according to the value of the x coordinate, and preferentially assigns the task cards to the storage cells with the same x coordinates;

[0015] When the level and role of a task card are the same as those of the previously assigned task card, or the difference between the reputation value of a task card and the reputation value of the previously assigned task card is less than or equal to w, the coordinator preferentially assigns the task card to a storage cell with the same x coordinate and y coordinate as the previously assigned task card; the value of w is set by the administrator, and w is a real number greater than 0; the maximum values ​​of the x coordinate and the y coordinate are the same, which is M, and the maximum value of the z coordinate is R; M is an integer greater than 1; the queue storage area is configured with a clearing mark and a label selector, the clearing mark is used to clear the task card in the storage cell of the specified x coordinate; the label selector accepts label input and performs label selection functions.

[0016] The beneficial results of the present invention are: a method for task allocation in a game under the metaverse proposed by the present invention designs a variety of ways of extracting tasks for task allocation. The present invention can allocate tasks at a fixed frequency, can allocate tasks at a predetermined time, and can allocate tasks within a specified time. The present invention can not only assign tasks to virtual players in batches in multiple ways, but also can assign tasks to players with similar attributes. The present invention adopts a method of multiple module collaboration, has clear functions, and has a great reference value for other applications. DETAILED DESCRIPTION

[0017] In order to make the technical problems, technical steps and beneficial effects to be solved by the present invention more clearly understood, the present invention is described in detail below in conjunction with the embodiments. It should be noted that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention. Products that can achieve the same functions are equivalent replacements and improvements, and are all included in the protection scope of the present invention. The specific method is as follows:

[0018] Example 1: The rise of the Metaverse will be accompanied by the evolution of technologies such as AR / VR, cloud computing, AI, and 5G, where users can appear with people in digital space, and users can access the Metaverse from different devices, where they can play games, work, create, and so on with friends. In fact, as early as three years ago, despite the continuous introduction of regulatory policies, the global game industry continued to soar. The global game market is currently worth $180 billion, making it the fastest growing form of entertainment in the world. In contrast, the global film industry is worth only $100 billion, and the annual revenue of all sports in North America is only $73 billion.

[0019] Among all game players, mobile players account for more than 90%. In 2021, of the nearly 3 billion gamers worldwide, about 2.8 billion will play games through mobile devices. In contrast, the number of PC and console players is about 1.4 billion and 900 million, respectively. Affected by the cross-game behavior of gamers, there is a problem of overlap in this part of the data, but this cannot stop the development trend of mobile games. In the long run, the market demand for the mobile game market will still have a lot of room for development for a period of time. Due to its virtual attributes and interactive gameplay with immersive situational experience, games are naturally easy to gather a large number of fans and consolidate the foundation of the community. This has also made games the top model in the Internet era, and it has also spawned giants such as Tencent, Blizzard, and Steam. With the successful operation of business giants and the continuous derivation and radiation of game IPs, the scale of the global game market has gradually expanded in recent years.

[0020] Example 2: Games face many challenges and bottlenecks in the metaverse. The first is the issue of user privacy tracking. The continuous changes in the tracking of user information on mobile devices, as well as cross-media experiments or integration activities in the film and television industry, will also be the next trend worth noting in the game market. Publishers continue to consolidate their position through integration and acquisitions, and continue to work on cross-cutting and platform agnosticism. Some publishers challenge the platform's profit-sharing rules. These are also new trends that may change the game market ecology in the future.

[0021] In traditional games, game companies have too much control over player accounts, virtual assets do not belong to users, and players can only conduct internal transactions, unable to create value and share profits by participating in the game; game data is not transparent, and the algorithms for core data such as the content, quantity, and draw probability of virtual props are not fully disclosed, which affects the playability and fairness of the game and increases the cost of trust; the security of virtual goods and virtual assets cannot be guaranteed: based on centralized game products, game manufacturers have absolute control and can release game props and change game rules at will, damaging the interests of players; at the same time, theft, hacker attacks and other incidents in virtual transactions also damage the interests of players to a certain extent.

[0022] Step 1. The method is applied in a virtual world through a computer. After the virtual player is called a virtual player in the game, the method assigns tasks to the virtual player. The virtual player obtains the tasks. After completing the tasks, the virtual player can obtain game points or extend the game time; Step 2. The implementation of the method is carried out by a task assignment module. The task assignment module includes a dual-mode controller, a timer refresher, a function selector, a coordinate inputter, a queue storage area, a task queuer, and a coordinator; The method sets the parallel processing number, and the parallel processing number R is used to represent the number of tasks assigned at the same time, which is a natural number; The task assignment module is used for specific task assignment in the game; Step 3. Tasks waiting for virtual players to do are placed in the task queuer. There are data imports and data exports in the task queuer. Data imports are any The data outlet is the outlet for tasks to go out of the task queuer. The default is that R tasks enter the task queuer at the same time or R tasks go out of the task queuer at the same time. The task queuer is used to queue and allocate tasks for virtual players. Step 4: The dual-mode controller includes a horizontal enable bit, a vertical enable bit, a shift enable bit, a tag enable bit, and an advance enable bit. The dual-mode controller sets a time buffer. The time buffer can contain cycle numbers, predetermined numbers, and combination numbers. The cycle number is used to indicate the time period for assigning tasks to virtual players. It is a certain real number. There is one and only one cycle number in the time buffer. The predetermined number is used to indicate the time interval for assigning tasks to virtual players. The combination number is a combination of the cycle value and the interval number. In summary, the combination number is used to indicate that within the time interval represented by the interval number, tasks are assigned to players with the period value as the time period. The interval number is a time interval, and the interval number is used to indicate the time interval in which the combination number is valid; within the time interval represented by the interval number, the period number is invalid, and no tasks are assigned to virtual players with the period value as the period; a predetermined number is placed in the time buffer, and the controller is notified within the time interval of the predetermined number. The controller is responsible for setting the values ​​of the horizontal enable bit, the vertical enable bit, the shift enable bit, the label enable bit, and the carry enable bit of the dual-mode controller, and allocating the coordinates in the queue storage area; the dual-mode controller is used to control the function of task allocation; the time buffer is used to specifically store the time period of task allocation and the predetermined time; Step 5, wherein the horizontal enable bit is used to trigger the selection of the task card whose x coordinate value is equal to the x coordinate number in the queue storage area, and the vertical enable bit is used to trigger the selection of the task card whose y coordinate value is equal to the y coordinate number in the queue storage area; the horizontal enable bit and the vertical enable bit can be 1 at the same time, but when the horizontal enable bit is 0, the vertical enable bit cannot be 1; the horizontal enable bit, the vertical enable bit, the shift enable bit, the carry enable bit, and the label enable bit are connected to the function selector, and the function selector is used to switch the function; the shift enable bit and the carry enable bit cannot be 1 at the same time, when the shift enable bit is 1, the horizontal enable bit must be 1, and the vertical enable bit is 0; when the shift enable bit is 1, the function selector activates the clearing function, and the clearing function is used to explain the clearing of the task card in the storage grid of the specified x coordinate in the queue storage area;The designated x-coordinate is provided by the coordinate input device, and the coordinate input device accepts the input x-coordinate number as the designated x-coordinate. The function selector triggers the clearing mark to start working, and the clearing mark clears the task card with the value of the x-coordinate number as the x-coordinate in the queue storage area; when the carry enable bit is 1, the horizontal enable bit, the vertical enable bit, the shift enable bit, and the label enable bit are invalid, and the queue storage area accepts the storage of task cards; the carry enable bit is used to indicate the storage of receiving task cards; the shift enable bit is used to indicate the clearing of task cards in the queue storage area, and the label enable bit is used to indicate the search for virtual players to assign tasks according to the requirements of the label; step six, when the shift enable bit is 0, the label enable bit is 0, and the carry enable bit is 0, the horizontal enable bit and the vertical enable bit combination control the task of the designated position Task card allocation, the horizontal enable bit is 1, the vertical enable bit is 0, the x-coordinate number input by the coordinate input device is received, and the function selector turns on the row task allocation function. The row task allocation function is used to extract the task card with the same x-coordinate value as the x-coordinate number, and allocate it in ascending order according to the size of the y-coordinate value. The task queuer allocates R tasks to the extracted task card at the same time each time, and allocates a total of M times; Step 7, when the shift enable bit is 0, the label enable bit is 0, the carry enable bit is 0, the horizontal enable bit is 1, and the vertical enable bit is 1, the x-coordinate number and the y-coordinate number input by the coordinate input device are received. If the input y-coordinate number is invalid, the function selector turns on the row task allocation function; if both the x-coordinate number and the y-coordinate number are valid, the function selector turns on the position task allocation function Yes, the position task allocation function is used to extract the task card with the same x coordinate as the value of the x coordinate number and the same y coordinate as the value of the y coordinate number. The task queuer simultaneously allocates R tasks to the extracted task cards, for a total of 1 allocation; Step 8, when the tag enable bit is 1, the function selector turns on the tag selection function. The tag selection function is used to allocate task cards according to tags in the queue storage area. The tag selector draws 3 times from all task cards with z coordinates equal to 1 in the queue storage area, and draws R task cards at the same time each time; the tag selector accepts the input of the tag. When the tag is the value of the level, the tag selector searches for the task card closest to the tag among the extracted task cards. If there is more than one task card closest to the value of the tag, Select the task card with the highest reputation value; when the label is the reputation value, the label selector searches for the task card with the closest label among the extracted task cards. If there are more than one task card with the closest label value, select the task card with the highest level; when there are more than one task card with the same level and the same reputation value among the selected task cards, the label selector selects the task card that enters the queue storage area first in time. After the task card is selected by the queue storage area, the label selector simultaneously extracts all task cards with the same x-coordinate and y-coordinate as the selected task card, and extracts tasks from the task queuer and assigns them to the task card; after the task is assigned to the task card, the task card is taken out from the queue storage area, and the virtual player who owns the task card is assigned to the task;Step 9. The coordinate input device is used to receive input x-coordinates and y-coordinates, which are named x-coordinate number and y-coordinate number respectively. When the horizontal enable bit is 1 and the vertical enable bit is 0, the coordinate input device only accepts the input of one number, which is the x-coordinate number and is valid. When the horizontal enable bit is 1 and the vertical enable bit is 1, the coordinate input device accepts the input of two numbers. By default, the first number input is the x-coordinate number and the second number input is the y-coordinate number. A control parameter is set in the coordinate input device. The control parameter is used to limit the time difference between the input of the first number and the input of the second number, that is, after the first number is input, the time does not exceed the value of the control parameter, and the second number is input; if the time for inputting the second number is the same as the time for inputting the first number, the control parameter is set to limit the time difference between the input of the first number and the input of the second number. If the difference between the times of the numbers exceeds the value of the control parameter, the second number entered will be invalid, and only the x-coordinate number will be valid; the x-coordinate number and the y-coordinate number are used to specify the x-coordinate and y-coordinate of the task card respectively; all units involving time and time periods are the same; step ten, the queue storage area is used to store the task cards of virtual players, the task cards are used to indicate the identity when assigning tasks to virtual players, the task cards identify the ID, level, role, and reputation value of the virtual players, the initial values ​​of the level and reputation value are equal to the level and reputation value of the virtual player when the task card is made, and after being allocated and stored in the queue storage area, the reputation value and level in the task card point to the address where the reputation value and level are stored through the content change pointer, and the content change pointer It indicates that after the storage content in the pointed address changes, the reputation value and level in the task card will change accordingly; the task card has x-coordinate, y-coordinate and z-coordinate in the queue storage area, and the x-coordinate, y-coordinate and z-coordinate are all positive integers greater than or equal to 1; the queue storage area is divided into storage grids, one storage grid stores one task card, and the coordinates of the task card are equal to the coordinates of the storage grid; after the task card is made, the x-coordinate and y-coordinate are visible to the virtual player who owns the task card, and the z-coordinate is invisible, that is, the virtual player obtains the x-coordinate and y-coordinate of the task card in the queue storage area; the coordinator first assigns coordinates to the storage grids, and assigns them in ascending order starting from 1 according to the order in which the task cards are generated and according to the value of the x-coordinate, giving priority to assigning the task card to the x-coordinate. The same storage grid; Step 11, when the level and role of the task card are the same as the level and role of the previously assigned task card, or the difference between the reputation value of the task card and the reputation value of the previously assigned task card is less than or equal to w, the controller preferentially assigns the task card to the storage grid with the same x coordinate and y coordinate as the previously assigned task card; the value of w is set by the administrator, and w is a real number greater than 0; the maximum values ​​of the x coordinate and the y coordinate are the same, which is M, and the maximum value of the z coordinate is R; M is an integer greater than 1; the queue storage area is configured with a clearing mark and a label selector, and the clearing mark is used to clear the task card in the storage grid of the specified x coordinate; the label selector accepts the input of the label and performs the label selection function; the values ​​of M and R are specified by the administrator. ;

[0023] In the metaverse game involved in this invention, the top-down game model will be broken, and a flat ecological relationship will be created, where games developed on different platforms can be interconnected with other games. In addition, blockchain technology can introduce external regulatory forces such as the media and game regulatory authorities into blockchain nodes, allowing third parties to supervise and inspect transaction data in the game, so that external forces such as the media are technically capable of supervising whether game assets are fair and over-issued.

[0024] The M and R set in the present invention are specified by the administrator. The function selector can specify to take out the task card in the storage grid of the specified x coordinate and y coordinate in the queue storage area; the information in the task card in the present invention can be expanded, and the content of the label and the strategy of finding the label in the queue storage area can be specified.

[0025] The beneficial results of the present invention are as follows: a method for task allocation in a game under a metaverse proposed by the present invention designs a variety of ways of extracting tasks for task allocation; the present invention can allocate tasks at a fixed frequency, can allocate tasks at a predetermined time, and can allocate tasks within a specified time. In addition, the present invention can not only assign tasks to virtual players in batches in multiple ways, but also can allocate tasks to players with similar attributes; the present invention adopts a method of multiple modules working together, has clear functions, and has a great reference value for other applications.

[0026] The above description is only a preferred embodiment of the present invention and is not intended to limit the scope of protection of the claims of the present invention. At the same time, the above description should be understandable and implementable to those skilled in the relevant technical field, so other equivalent changes based on the content disclosed by the present invention should be included in the scope of the claims.

Claims

1. A method for task allocation in a game under the metaverse, characterized by: Step 1: The method is applied in a virtual world through a computer to assign tasks to virtual players. The virtual players obtain tasks and can obtain game points or extend game time after completing the tasks. Step 2: The implementation of the method is carried out by a task assignment module, which includes a dual-mode controller, a timer refresher, a function selector, a coordinate inputter, a queue storage area, a task queuer, and a coordinator. The method sets a parallel processing number, and the parallel processing number R is used to represent the number of tasks assigned simultaneously, which is a natural number. The task assignment module is used for specific task assignment in the game. Step 3: Tasks waiting for virtual players to do are placed in the task queuer. There are data imports and data exports in the task queuer. The data import is the entrance for tasks to enter the task queuer, and the data export is the exit for tasks to go out of the task queuer. The default is that R tasks enter the task queuer at the same time or R tasks go out of the task queuer at the same time. The task queuer is used to queue and assign tasks for virtual players. Step 4: The dual-mode controller includes a horizontal enable bit, a vertical enable bit, a shift enable bit, a label enable bit, and an advance enable bit. The dual-mode controller sets a time buffer. The time buffer may contain cycle numbers, predetermined numbers, and combination numbers. The cycle number is used to indicate the time period for assigning tasks to virtual players and is a certain real number. The time buffer contains one and only one cycle number. The predetermined number is used to indicate the time interval for assigning tasks to virtual players. The combination number is a combination of the cycle value and the interval number. The combination number is used to indicate that tasks are assigned to players with the cycle value as the time period within the time interval represented by the interval number. The interval number is a time interval. The interval number is used to indicate the time interval in which the combination number is valid. Within the time interval represented by the interval number, the cycle number is invalid, and no tasks are assigned to virtual players with the cycle number as the period. The predetermined number is placed in the time buffer, and the controller is notified within the time interval of the predetermined number. The controller is responsible for setting the values ​​of the horizontal enable bit, vertical enable bit, shift enable bit, label enable bit, and carry enable bit of the dual-mode controller, and allocating coordinates in the queue storage area. The dual-mode controller is used to control the function of task allocation. The time buffer is used to specifically store the time period and the predetermined time for task allocation. Step 5, wherein, The horizontal enable bit is used to trigger the selection of the task card whose x coordinate value in the queue storage area is equal to the x coordinate number, and the vertical enable bit is used to trigger the selection of the task card whose y coordinate value in the queue storage area is equal to the y coordinate number; the horizontal enable bit and the vertical enable bit can be 1 at the same time, but when the horizontal enable bit is 0, the vertical enable bit cannot be 1; the horizontal enable bit, the vertical enable bit, the shift enable bit, the carry enable bit, and the label enable bit are connected to a function selector, and the function selector is used to switch functions; the shift enable bit and the carry enable bit cannot be 1 at the same time. When the shift enable bit is 1, the horizontal enable bit must be 1 and the vertical enable bit is 0; when the shift enable bit is 1, the function selector activates the clear function, and the clear function is used to indicate clearing. Delete the task card in the storage grid of the specified x coordinate in the queue storage area; the specified x coordinate is provided by the coordinate input device, and the coordinate input device accepts the input x coordinate number as the specified x coordinate, and the function selector triggers the clearing mark to start working, and the clearing mark clears the task card with the value of the x coordinate number as the x coordinate in the queue storage area; when the carry enable bit is 1, the horizontal enable bit, the vertical enable bit, the shift enable bit, and the label enable bit are invalid, and the queue storage area accepts the storage of task cards; the carry enable bit is used to illustrate the storage of receiving task cards; the shift enable bit is used to illustrate the clearing of task cards in the queue storage area, and the label enable bit is used to illustrate finding virtual players to assign tasks according to the requirements of the label; step six, when The shift enable bit is 0, the tag enable bit is 0, the carry enable bit is 0, the horizontal enable bit and the vertical enable bit combination control the allocation of the task card at the specified position, the horizontal enable bit is 1, the vertical enable bit is 0, the x coordinate number input by the coordinate input device is received, and the function selector turns on the row task allocation function, the row task allocation function is used to extract the task card with the same x coordinate as the x coordinate value, and allocate it in ascending order according to the size of the y coordinate value. The task queuer allocates R tasks to the extracted task card at the same time each time, and allocates M times in total; step seven, when the shift enable bit is 0, the tag enable bit is 0, the carry enable bit is 0, the horizontal enable bit is 1, and the vertical enable bit is 1, the x coordinate number and the y coordinate number input by the coordinate input device are received, if the input If the y-coordinate number is invalid, the function selector starts the row task allocation function; if both the x-coordinate number and the y-coordinate number are valid, the function selector starts the position task allocation function, which is used to extract the task card with the same x-coordinate as the x-coordinate number and the same y-coordinate as the y-coordinate number, and the task queuer simultaneously allocates R tasks to the extracted task cards, for a total of 1 allocation; Step 8, when the tag enable bit is 1, the function selector starts the tag selection function, which is used to allocate task cards according to tags in the queue storage area, and the tag selector extracts 3 times from all the task cards with z-coordinates equal to 1 in the queue storage area, and extracts R task cards at the same time each time;The label selector accepts the input of the label. When the label is a level value, the label selector searches for the task card closest to the label among the extracted task cards. If there are more than one task card closest to the label value, the task card with the highest reputation value is selected. When the label is a reputation value, the label selector searches for the task card closest to the label among the extracted task cards. If there are more than one task card closest to the label value, the task card with the highest level is selected. When there are more than one task card with the same level and reputation value among the selected task cards, the label selector selects the task card that enters the queue storage area first in time. After the task card is selected by the queue storage area, the label selector At the same time, all task cards with the same x coordinates and y coordinates as the selected task card are extracted, and tasks are extracted from the task queue and assigned to the task cards; after the tasks are assigned to the task cards, the task cards are taken out from the queue storage area, and the virtual player who owns the task cards is assigned to the tasks; step nine, the coordinate input device is used to receive input x coordinates and y coordinates, which are named x coordinate number and y coordinate number respectively. When the horizontal enable bit is 1 and the vertical enable bit is 0, the coordinate input device only accepts input of one number, which is the x coordinate number, and the x coordinate number is valid; when the horizontal enable bit is 1 and the vertical enable bit is 1, the coordinate input device accepts input of two numbers, and the default is that the first number input is the x coordinate number and the second number input is the y coordinate number. The coordinate input device is provided with a control parameter, wherein the control parameter is used to limit the time difference between inputting the first number and inputting the second number, that is, after inputting the first number, the second number is inputted after the time does not exceed the value of the control parameter; if the difference between the time of inputting the second number and the time of inputting the first number exceeds the value of the control parameter, the inputted second number is invalid, and only the x coordinate number is valid; the x coordinate number and the y coordinate number are used to specify the x coordinate and y coordinate of the task card respectively; all units involving time and time period are the same; step ten, the queue storage area is used to store the task card of the virtual player, the task card is used to indicate the identity when assigning tasks to the virtual player, and the task card is marked The ID, level, role, and reputation value of the virtual player, the initial values ​​of the level and reputation value are respectively equal to the level and reputation value of the virtual player when the task card is made, and after being allocated and stored in the queue storage area, the reputation value and level in the task card point to the address where the reputation value and level are stored through the content change pointer, and the content change pointer indicates that after the storage content in the address pointed to is changed, the reputation value and level in the task card will change accordingly; the task card has an x ​​coordinate, a y coordinate, and a z coordinate in the queue storage area, and the x coordinate, the y coordinate, and the z coordinate are all positive integers greater than or equal to 1; the queue storage area is divided into storage grids, one storage grid stores one task card, and the coordinates of the task card are equal to the coordinates of the storage grid;After the task card is made, the x-coordinate and y-coordinate are visible to the virtual player who owns the task card, and the z-coordinate is invisible, that is, the virtual player obtains the x-coordinate and y-coordinate of the task card in the queue storage area; the controller first assigns coordinates to the storage cells, and assigns them in ascending order from 1 according to the order in which the task cards are generated, and gives priority to assigning the task cards to the storage cells with the same x-coordinate; step 11, when the level and role of the task card are the same as the level and role of the task card assigned first, or the difference between the reputation value of the task card and the reputation value of the task card assigned first is less than or equal to w, the controller gives priority to assigning the task card to the storage cells with the same x-coordinate and y-coordinate as the task card assigned first; the value of w is set by the administrator, and w is a real number greater than 0; the maximum values ​​of the x-coordinate and y-coordinate are the same, which is M, and the maximum value of the z-coordinate is R; M is an integer greater than 1; the queue storage area is configured with a clearing mark and a label selector, and the clearing mark is used to clear the task card in the storage cell with the specified x-coordinate; the label selector accepts the input of the label and executes the label selection function; the values ​​of M and R are specified by the administrator. ;

Citation Information

Patent Citations

  • Mission distributing device, and mission distributing program

    JP2005334202A

  • KR20190031368A