CN110841294A

CN110841294A - Virtual item allocation method, device, equipment and storage medium

Info

Publication number: CN110841294A
Application number: CN201911096480.5A
Authority: CN
Inventors: 邓歆怡; 练建锋
Original assignee: Tencent Technology Shenzhen Co Ltd
Current assignee: Tencent Technology Shenzhen Co Ltd
Priority date: 2019-11-11
Filing date: 2019-11-11
Publication date: 2020-02-28

Abstract

The application discloses a virtual prop distribution method, a device, equipment and a storage medium, and belongs to the technical field of computers. The method comprises the following steps: receiving a treasure box opening request, wherein the treasure box opening request comprises a treasure box identifier and a user identifier; determining a virtual prop pool corresponding to the treasure box identifier, wherein the virtual prop pool comprises at least two prop sets, and each prop set comprises at least two props; acquiring a prop distribution record of a user, wherein the prop distribution record of the user comprises prop set distribution records and prop distribution records of each prop set; selecting a target prop set from at least two prop sets based on the prop set allocation records; selecting one prop from the target prop set as a target prop based on the prop distribution record of the target prop set; and sending the opening result of the treasure box to the terminal of the user. The distribution strategy of the props can be adjusted more flexibly, and the functions of the products are enriched.

Description

Virtual item allocation method, device, equipment and storage medium

Technical Field

The present application relates to the field of computer technologies, and in particular, to a method, an apparatus, a device, and a storage medium for allocating virtual items.

Background

With the development of high-speed internet communication networks, various types of online games have emerged. In some online games, a user may obtain desired props through a treasure box.

After acquiring the treasure box, the user can send a treasure box opening request to the server. After receiving the treasure box opening request, the server determines a plurality of props corresponding to the treasure box opening request and a probability interval corresponding to each prop. Then, the server generates a random number, takes the prop corresponding to the probability interval to which the random number belongs as a target prop, and returns the target prop to the user as a treasure box opening result.

In order to avoid the occurrence of extreme mishaps or extreme fortunes and guarantee the unpacking experience of a user, product operators can adjust the probability of drawing all the props through configuration strategies, however, the mode of the configuration strategies is single, and the functions of the products are single.

Disclosure of Invention

The embodiment of the application provides a virtual prop distribution method, a virtual prop distribution device, virtual prop distribution equipment and a storage medium, which can flexibly configure an extraction strategy of a target prop and enrich functions of a product. The technical scheme is as follows:

in one aspect, a method for allocating virtual items is provided, where the method includes: receiving a treasure box opening request, wherein the treasure box opening request comprises a treasure box identifier and a user identifier;

determining a virtual prop pool corresponding to the treasure box identifier, wherein the virtual prop pool comprises at least two prop sets, and each prop set comprises at least two props;

acquiring prop distribution records of the user, wherein the prop distribution records of the user comprise prop set distribution records and prop distribution records of each prop set;

selecting a target prop set from the at least two prop sets based on the prop set allocation record;

selecting one prop from the target prop set as a target prop based on the prop distribution record of the target prop set;

and sending a treasure box opening result to the terminal of the user, wherein the treasure box opening result comprises the identification of the target prop.

In one aspect, a virtual item allocation apparatus is provided, the apparatus including:

the device comprises a receiving module, a processing module and a display module, wherein the receiving module is used for receiving a treasure box opening request which comprises a treasure box identifier and a user identifier;

a determining module, configured to determine a virtual item pool corresponding to the treasure box identifier, where the virtual item pool includes at least two item sets, and each item set includes at least two items;

the acquisition module is used for acquiring prop allocation records of the user, wherein the prop allocation records of the user comprise prop set allocation records and prop allocation records of each prop set;

a first selection module, configured to select a target prop set from the at least two prop sets based on the prop set allocation record;

the second selection module is used for selecting one prop from the target prop set as a target prop based on the prop distribution record of the target prop set;

and the sending module is used for sending the treasure box opening result to the terminal of the user, and the treasure box opening result comprises the identification of the target prop.

In one aspect, a computer device is provided, comprising a processor and a memory storing at least one instruction, at least one program, set of codes, or set of instructions, which is loaded and executed by the processor to implement the aforementioned method.

In one aspect, a computer readable storage medium is provided that stores at least one instruction, at least one program, set of codes, or set of instructions that is loaded and executed by the processor to implement the aforementioned method.

The beneficial effects brought by the technical scheme provided by the embodiment of the application at least comprise:

in the embodiment of the application, the props in the virtual prop pools corresponding to the treasure box are divided into a plurality of prop sets, each prop set comprises at least two props, historical allocation conditions of the props in the prop sets and historical allocation conditions of the props in the prop sets are respectively recorded through prop allocation records of users, a target prop set is selected from the at least two prop sets based on the prop allocation records, one prop is selected from the target prop set to serve as the target prop, the target prop is determined by selecting twice, the target prop is sent to a terminal of the user, and product operators can configure different strategies for each selection process, the allocation of the props is adjusted more flexibly, and the functions of products are enriched.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

FIG. 1 is a schematic diagram of the structure of a prop distribution system according to an exemplary embodiment of the present application;

fig. 2 is a schematic flowchart of a virtual item allocation method according to an exemplary embodiment of the present application;

FIG. 3 is a schematic illustration of an interface showing the opening result of the treasure box in an exemplary embodiment of the present application;

FIG. 4 is a schematic view of a purchase interface for a treasure box in an exemplary embodiment of the present application;

FIG. 5 is a schematic illustration of a display interface of a treasure box in an exemplary embodiment of the present application;

FIG. 6 is an interaction diagram of a virtual item allocation method according to an exemplary embodiment of the present application;

FIG. 7 illustrates the interaction between the lottery module, database and repository modules;

FIG. 8 is a schematic flow chart of a process for selecting a set of target items according to an exemplary embodiment of the present application;

FIG. 9 is a schematic flow chart of a process for selecting a target prop according to an exemplary embodiment of the present application;

FIG. 10 is a schematic flow chart illustrating an update of a prop set allocation record according to an exemplary embodiment of the present application;

FIG. 11 is a schematic flow chart of updating records of item allocation of an item set according to an exemplary embodiment of the present application;

fig. 12 is a block diagram of a configuration of a virtual item allocation apparatus according to an exemplary embodiment of the present application;

fig. 13 is a hardware configuration diagram of a computer device to which an exemplary embodiment of the present application is applied.

Detailed Description

To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.

To facilitate an understanding of the embodiments of the present disclosure, some words in the embodiments of the present disclosure are explained below.

Props: the virtual objects with certain functions in the game comprise weapons, characters, prop cards, virtual currency and the like. The props may be obtained by the game player by various means including, but not limited to, purchase, by opening a treasure box, and the like.

Treasure box: a special prop in the game. The player can obtain the treasure box through purchasing or system issuing and the like, and can obtain one or more props after obtaining the treasure box, and before starting, the player may not know the type and the quantity of the props to be obtained; the system needs to calculate the random probability through a whole set of probability system configured in the background and various special bottom-preserving logics, and then determines the fallen props.

A virtual prop pool: the player has a pool of props visible at the front of the game. Before opening the treasure box, the player will know in advance that the prop he is about to acquire must be a certain item (or items) in the pool.

Dropping: a system distributes items to players.

And (3) dropping the group: there are multiple drop groups in the jewel box, and the policy planner plans different drop policies by grouping the props in the pool, hereinafter referred to as a prop set.

Drawing the middle part: after the player purchases the treasure box, the treasure box is opened, and a certain prop in the plurality of props corresponding to the treasure box is obtained, namely the prop is drawn. The calculation process is that firstly, one prop set is randomly selected from a plurality of prop sets (also called drop groups) corresponding to the treasure box, and then the prop set is drawn for 1 time. And then randomly selecting one prop from the prop set which is drawn, so that the prop is also called drawing 1 time. That is, in one box opening operation (also called lottery operation), 1 item set is selected from a plurality of item sets, and then 1 item is selected from a plurality of items (including common items and rare items) in the item set.

Missing: in the process of 1 lottery, the prop set which is not drawn is called as lost 1 time; in addition to the prop being drawn, all of the props in the treasure box that are not being drawn are also missed 1 time.

Mall (store): where the player purchases the item in the game. The treasure box is used as a special prop, and the player can also buy in a shopping mall.

Rare property: the item with higher value in the game. Because of the high quality of art or the high selling price of the shopping mall, the game is generally pursued by the players.

Ordinary props: the property with relatively low value in the game is opposite to the rare property.

Bottom protection: a strategy for guaranteeing that a player has better unpacking experience in the process of continuously opening a treasure box. In addition to assigning a corresponding random drop probability to each item in the pool of items, the strategy planner ensures that the player does not "pay but not get" due to excessive "unlucky" in the random probability mechanism by applying additional strategies, including, in particular embodiments, light, dark, lucky value, reverse, etc.

And (3) keeping the sole clear: a background strategy that does not have a front visible, ensures that a player must specify properties, such as rare properties, before opening a treasure box the Nth time.

Hidden bottom protection: a background strategy in which the random probability for a given property (e.g., a rare property) is controlled to be invisible at the front end and to be gradually increased during the process of a player continuously opening a treasure box.

And (4) keeping the lucky value at the bottom: a background strategy where the front end can see, accumulate points by opening the box times, and thereby expect to drop a specified prop, such as a rare prop, when the points are full.

And (3) reverse bottom protection: a background strategy is provided, wherein the front end is invisible, and the player can not draw appointed props, such as rare props, when the player opens a treasure box for the last N times.

Carrying out state lottery: recording each lottery result (namely the opening result of the treasure box) of the player to the treasure box, and calculating the latest lottery result by using strategies such as light insurance foundation, dark insurance foundation, lucky value, reverse insurance foundation and the like according to the previous lottery results of the player.

Fig. 1 is a schematic structural diagram of a prop distribution system according to an exemplary embodiment of the present application. As shown in fig. 1, the system includes a server 10 and a terminal 20. The server 10 and the terminal 20 are communicatively connected, for example, by a network 30.

Illustratively, the server 10 may be a single server, or a server cluster, i.e. comprising a plurality of cooperating servers. For example, as shown in fig. 1, the server 10 includes a game server 11, an authentication server 12, and a prop distribution server 13. Wherein, the game server 11 is used for providing game-related content; an authentication server 12 for managing information of a user who accesses the game server 11 to obtain game contents; and the item distribution server 13 is used for providing an online lottery service for the users logging in the game server 11, wherein the online lottery service comprises the step of distributing items by opening the treasure box.

For the user, if the treasure box is opened and relatively few precious properties are obtained, the user can think that the treasure box wins a prize; if the treasure box is opened and relatively more common props are obtained, the prize is considered to be a loser.

The terminal 20 is a computer used by a user for playing games, including but not limited to a cell phone, a notebook computer, a tablet computer, a desktop computer, and the like.

The network 30 is used to implement a communication connection between the terminal and the server 10, including but not limited to the internet, a communication network, and the like.

Fig. 2 is a schematic flow chart of a virtual item allocation method according to an exemplary embodiment of the present application. The method may be executed by a server, for example, prop distribution server 13 in fig. 1. As shown in fig. 2, the method may include:

101: a treasure box opening request is received.

The treasure box opening request comprises a treasure box identification and an identification of a user.

The treasure box identification includes but is not limited to treasure box type, treasure box number and the like, and the treasure box type can be divided according to the grade of the treasure box, such as diamond treasure box, gold treasure box, silver treasure box, bronze treasure box and the like; it can also be divided according to the price of the treasure box, such as 1000G treasure box, 500G treasure box, etc., where G can represent the amount of gold coins.

Illustratively, the user identifier may be a user account, a device identifier, or the like, for uniquely identifying a certain user.

102: and determining a virtual prop pool corresponding to the treasure box identification.

The virtual prop pool comprises at least two prop sets, each prop set comprising at least two props.

Optionally, the props in the virtual prop pools corresponding to the treasure boxes with different identifications are at least partially different. For example, at least a part of the props in the virtual prop pool corresponding to the treasure box with a higher grade have higher value than the props in the virtual prop pool corresponding to the treasure box with a lower grade.

Optionally, the props in different sets of props are completely different.

Optionally, the number of props in different sets of props may be the same or different.

For example, the plurality of items in each set of items may be items of the same rank, or items of equal or comparable value. For example, all of the props in a certain prop set are rare props.

103: and acquiring a prop distribution record of the user.

Illustratively, the item allocation record is used for recording the historical treasure box opening result of the user, and the item allocation record of the user can comprise an item set allocation record and an item allocation record of each item set.

For example, the item set allocation record may include the number of times of miss of each item set, where the number of times of miss indicates the number of times that the item set is not continuously withdrawn, and is used for a light warranty policy, a dark warranty policy, and a reverse warranty policy. The property set allocation record may also include a fortune value specifying a property set for a fortune value underwriting policy. The item allocation record of each item set may include the number of times of missing of each item in the item set, where the number of times of missing represents the number of times that the item is not drawn continuously, and is used for a light bottom-preserving policy, a dark bottom-preserving policy, and a reverse bottom-preserving policy.

104: and selecting a target prop set from at least two prop sets based on the prop set distribution records.

105: and selecting one prop from the target prop set as the target prop based on the prop distribution record of the target prop set.

106: and sending the opening result of the treasure box to the terminal of the user.

The treasure box opening result comprises an identification of the target prop. Optionally, the treasure box opening result may include an identifier of one or more target props, and the number of the target props may be the same as the number of treasure boxes corresponding to the treasure box opening request.

After the terminal receives the treasure box opening result, the target prop indicated by the treasure box opening result can be displayed to the user. For example, as shown in fig. 3, the user terminal is provided to display 10 target props, that is, the user opens 10 treasure boxes at a time.

The utility model discloses an embodiment divides into a plurality of props sets through the props in the virtual props pond that corresponds treasure case, every props set includes two at least props, and the historical distribution condition of props in the historical distribution condition of props set and the props set of props is recorded respectively through user's props distribution record, based on props set distribution record, select target props set from these two at least props set, based on props distribution record, select a prop as the target props from the target props set, divide twice selection promptly and just determine the target props, and send the target props to user's terminal, can be for selecting different tactics of process configuration at every turn, adjust the distribution of props more nimble, the function of product has been enriched.

Optionally, the user needs to obtain the treasure box before this step 201. The manner of acquiring the treasure box includes but is not limited to purchasing from an online store and system distribution. When the user acquires the treasure box by means of on-line shop purchase, the method may further include: receiving a treasure box purchase request sent by a user, wherein the treasure box purchase request comprises a treasure box identifier; and after the user completes payment, sending the treasure box corresponding to the treasure box purchase request to the terminal of the user.

For example, as shown in fig. 4, there are a plurality of magazines for the user to select in the online store, and after the user enters the online store through the user terminal, the price 4B, discount information 4C, and the like of the magazine 4A can be seen.

In order to facilitate the user to know the information of the treasure box, so as to determine whether to purchase the treasure box and which treasure box to purchase, the user can send a treasure box detail checking request to the server through the user terminal, the treasure box detail checking request can be triggered by clicking of a detection user, after the server receives the treasure box detail checking request, the server can inquire the information of props in a virtual prop pool corresponding to the treasure box, the inquired information of the props is sent to the user terminal, and the user terminal displays the received information of the props to the user. Optionally, the information of the prop includes, but is not limited to, a name of the prop, a graphic of the prop, attributes of the prop, a grade of the prop, and the like, wherein the graphic of the prop is used for showing the appearance of the prop to the user, and the attributes of the prop are used for the user to know the function of the prop, for example, the attributes of the prop shown in fig. 5 are 10% improvement of personal experience (reference numeral 5A in the figure). The item level is used for representing the rareness degree or the value of the item.

FIG. 6 is an interaction diagram of a virtual item allocation method according to an exemplary embodiment of the present application; . As shown in fig. 6, the virtual item allocation method corresponds to the flow shown in fig. 2, and may include:

201: the player initiates a lottery through the terminal.

The player sends a treasure box opening request to the lottery module through the terminal so as to initiate a lottery request aiming at the specified treasure box.

202: the lottery module obtains a lottery record, i.e., an item allocation record for the player, from a database.

203: the lottery module calculates a lottery result.

And the lottery module calculates the lottery result of the current round of the player according to the lottery record of the player and the configured warranty strategy.

204: and the lottery drawing module adjusts the lottery drawing record according to the lottery drawing result.

The lottery module updates the lottery record of the player according to the result of the lottery of the next time. For example, if a rare property is drawn, the lucky value is set to 0; for props that have not been drawn, the number of misses needs to be increased.

205: the lottery module stores the lottery result to the warehouse module.

The warehouse module is used for managing props owned by players, and can add or delete props of the players.

206: the lottery module updates the lottery record in the database.

207: the lottery module sends lottery results, namely treasure box opening results, to the player's terminal.

The player's terminal displays the lottery result after receiving the lottery result.

Alternatively, the lottery module, the database and the warehouse module, which are background modules, may be configured on the aforementioned server 10.

Fig. 7 shows the interaction process between the lottery module, the database and the warehouse module. As shown in fig. 7, the interactive process may include steps 202 to 206 of the flow shown in fig. 6. As can be seen from fig. 6 and 7, embodiments of the present disclosure are primarily initiated by the lottery module for operation and calculation. Steps 202, 205 and 206 are all simple read and write operations. Steps 203 and 204 relate to data statistics, and the detailed procedure can be seen in the following description of fig. 8 to 11.

In this embodiment of the present disclosure, the allocation policy of the prop set and the allocation policy of the props in each prop set may be the same, for example, the allocation policy of the prop set may include an explicit base policy and a dark base policy, and the prop allocation policy of each prop set also includes an explicit base policy and a dark base policy. Alternatively, the allocation policy of the property set and the property allocation policy of each property set may also be different, for example, the allocation policy of the property set includes an explicit base policy, a dark base policy, a lucky value base policy, and a reverse base policy, and the property allocation policy of each property set includes an explicit base policy, a dark base policy, and a reverse base policy.

Illustratively, this step 204 may include: selecting a target prop set from at least two prop sets according to a first strategy set based on the prop set distribution records, wherein the first strategy set comprises at least one first strategy, and the first strategy is selected from the following strategies: a clear warranty policy, a dark warranty policy, a lucky value warranty policy, and a reverse warranty policy.

The product operator can select one or more strategies from the strategies to select the prop set according to actual needs so as to determine the target prop set. Besides selecting the strategies, product operators can configure parameters in each strategy according to actual needs, and the flexibility of the product strategies is further improved. The configurable parameters in each strategy are explained below.

1) Policy of Ming and Bao

To enhance the player's unpacking experience in the most obvious way, the strategy planner needs to manually manipulate the drop probability of a particular item (typically the item of higher value, or even the highest value) in the treasure box prize pool such that the drop probability P increases sharply to 100% when the player draws a particular number of times.

Under the function requirement, the strategy planner needs to configure the above-mentioned "certain specific times" as N, so when the player starts a certain treasure box from the 1 st time, the treasure box is continuously opened for N times, if the appointed special prop a can not be drawn all the time in the period, the prop a will fall down inevitably at the N +1 st time.

2) Policy of secrecy

Compared with the former, the method has the advantages that the unpacking experience of the player is improved in an extremely obvious and easily-perceived mode, the hidden bottom-protecting strategy is biased to achieve a similar purpose by using a more secret mode, the falling weight of the appointed special prop is improved in a segmented mode, and the actual falling probability of the prop is artificially controlled to be increased in a pre-designed strategy ladder mode.

Under the functional requirement, a strategy planner needs to plan a hidden insurance policy as a piecewise function, and the actual falling probability of the special property A is continuously improved by configuring the segmentation (function independent variable) of the unpacking times and the change value (function dependent variable) of the special property weight under each segmentation until a player draws the game.

After the center is drawn, the change value of the special prop weight is controlled to be reset by the background, and the falling probability of the prop returns to the initial value.

3) Lucky value bottom-preserving strategy

The lucky value bottom-keeping method is another obvious bottom-keeping mode which can be easily sensed at the front end, and the core concept of the method is represented in a centralized way that if a player does not draw a special property A all the time in the process of continuously opening a treasure box, the player can continuously accumulate a 'lucky value' in the current treasure box, and when the lucky value is fully accumulated, the probability that the player obtains the special property B when the player opens the box next time is 100%.

The special prop A and the special prop B are both props manually specified by a strategy planner, and the special prop A and the special prop B are allowed to be the same prop.

The maximum lucky value of the treasure box and the lucky value score accumulated in each non-drawing can be realized through configuration.

4) Reverse funding strategy

Different from the first three strategies, the first three strategies are used for ensuring the game experience of the player and avoiding the extremely unlucky condition, and the reverse bottom-protecting strategy is used for ensuring that the special prop A is not easy to draw out easily and protecting game manufacturers. The strategy planner needs to manually manipulate the drop probability of a particular item (typically the item of higher value, or even the highest value) in the treasure box prize pool so that the drop probability P remains 0 until the player has drawn it a particular number of times.

Under the functional requirement, the policy planner needs to configure the above "certain specific times" as N, so that when the player starts a treasure box from the 1 st time, the treasure box is continuously opened for N times, during which the appointed special prop a cannot be drawn, and the prop a may fall off after the (N + 1) th time of opening the treasure box.

It should be noted that, the above describes various bottom-preserving strategies in detail by taking the dropping of the special props as an example, and when the strategies are applied to the prop sets, the dropping of the special props can be replaced by the dropping of the specified prop sets, and parameters required to be configured by the various strategies are not changed.

The following describes an embodiment of the present disclosure by taking an example that the first policy set includes a light base policy, a dark base policy, a lucky value base policy, and a reverse base policy.

When the first policy set includes a light warranty policy, a dark warranty policy, a lucky value warranty policy, and a reverse warranty policy, the selection process of the target property set, that is, the foregoing step 104, may be implemented by using a flow as shown in fig. 8. As shown in fig. 8, this step 104 may include:

301: and filtering the prop set meeting the reverse bottom-preserving strategy in the virtual prop pool to obtain the residual prop set.

This step 301 may include: determining whether a prop set meeting a reverse bottom-preserving strategy exists in the virtual prop pool; if the prop set meeting the reverse bottom-preserving strategy exists, the rest prop sets comprise prop sets in the virtual prop pool except the prop set meeting the reverse bottom-preserving strategy; and if the prop set meeting the reverse bottom-preserving strategy does not exist, the rest prop sets are all the prop sets contained in the virtual prop pool.

As mentioned above, the reverse bottom-preserving policy means that the prop set is not drawn when the number of times of missing does not reach N times. Generally, the more rare the props in the prop set, the larger the value of N. For example, for a rare property set (that is, all contained properties are rare property sets), in order to reduce the probability of being hit by a choice, the rare property set may be set not to be hit by a choice when the number of missed items does not reach 200.

302: and determining whether a prop set meeting the policy of the Ming Bao bottom exists in the rest prop sets.

If a prop set meeting the policy of the Mingbu exists, executing step 306; if there is no item set satisfying the policy of the Mingbu, step 303 is executed.

303: and determining whether a property set with a lucky value reaching a threshold value exists in the rest property sets.

If there is a set of properties whose lucky value reaches the threshold value, go to step 306; if there is no set of props whose fortune value meets the threshold,

steps

304 and 305 are performed.

304: and determining the probability of each prop set based on the prop set distribution records and the hidden bottom-preserving strategy.

In step 304, if the prop set allocation record meets the probability adjustment condition in the dark bottom policy, the current probability of the prop set is updated, and the updated probability of the prop set is obtained.

305: and randomly selecting at least two prop sets according to the determined probability of each prop set to obtain a target prop set.

Illustratively, this step 305 may include:

firstly, accumulating the relative probabilities of all the prop sets in sequence to obtain a relative probability sum.

Here, the relative probability is a configured value and may also be referred to as a drop weight.

Step two, obtaining a numerical value randomly by using a random algorithm between (0, Sum), wherein Sum is the Sum of relative probabilities in the step one;

and thirdly, taking a prop set corresponding to the probability interval to which the numerical value belongs as a target prop set, wherein the endpoint value of the probability interval is associated with the relative probability of the prop set. The probability interval is a half-open and half-closed interval, the lower limit of the probability interval is the sum of the relative probabilities of all the prop sets numbered before the prop set, and the upper limit of the probability interval is the sum of the relative probability of the prop set and the lower limit of the probability interval.

For example, assume that there are N sets of props in the virtual prop pool: prop set 1, prop set 2, … … and prop set N. The drop weight configured for each prop set is W1, W2, … … and WN respectively. The probability intervals corresponding to the prop sets are (0, W1], (W1, W1+ W2] … … (W1+ W2+ … + WN-1, W1+ W2+ … + WN).

Correspondingly, in the third step, if the value falls in the (0, W1) interval, the prop set 1 is the target prop set;

if the value falls in the interval (W1, W1+ W2), the prop set 2 is the target prop set;

if the value falls in the interval (W1+ W2, W1+ W2+ W3), the prop set 3 is the target prop set;

and so on.

The actual probability of each prop set can be calculated through the relative probability of the prop sets. And dividing the relative probability of the prop set by the sum of the relative probabilities to obtain the actual probability of the prop set.

306: and taking the prop set as a target prop set.

That is, the prop set meeting the policy of the Ming Bao Ming Dynasty is taken as the target prop set, or the prop set meeting the policy of the lucky value Bao Ming Dynasty is taken as the target prop set.

Exemplarily, the foregoing step 105 may include: when the target prop set does not meet the lucky value bottom-preserving strategy, selecting one prop from the target prop set as the target prop according to a second strategy set based on a prop distribution record of the target prop set, wherein the second strategy set comprises at least one second strategy, and the second strategy is selected from the following strategies: a clear warranty bottom policy, a dark warranty bottom policy, and a reverse warranty bottom policy.

The product operator can select one or more strategies from the strategies according to actual needs to select the target prop so as to determine the target prop.

The following is an exemplary illustration of the second set of policies including a light warranty policy, a dark warranty policy, and a reverse warranty policy. When the target item set does not meet the lucky value underwriting strategy, the process of selecting the target item from the target item set can be as shown in fig. 9. As shown in fig. 9, this step 105 may include:

401: and filtering the props meeting the reverse bottom-protecting strategy to obtain the residual props in the target prop set.

This step 401 may include: determining whether a prop meeting a reverse bottom-preserving strategy exists in the target prop set; if the props meeting the reverse bottom-preserving strategy exist in the target prop set, the rest props are props in the target prop set except the props meeting the reverse bottom-preserving strategy; and if the props meeting the reverse bottom-preserving strategy do not exist in the target prop set, the rest props are all props in the target prop set.

The reverse bottom-protecting strategy means that the prop cannot be drawn when the missing times do not reach N times. For example, for a rare item, in order to reduce the probability of being hit, the item may be set not to be hit when the number of missed items does not reach 200.

For example, in this step 401, the reverse funding policy may include that, for the prop that was last drawn, if the number of misses does not reach N times (for example, 2 times), it is set that no drawing is necessarily made. That is to say, after the item is drawn, the user will participate in the lottery again at least 2 times, so that the user can be ensured not to continuously draw the same item with lower value, and the user experience is improved.

For example, suppose a treasure box corresponds to 3 prop sets, which are respectively the prop sets A, B, C. All the prop sets A are rare props which are respectively a1, a2 and a 3; the prop set B is a common prop which is B1, B2, B3, B4 and B5 respectively; the set of props C is the worst prop, which is C1, C2, C3, C4, C5, and C6. The item drawing probability of the item set A is 1%, the item drawing probability of the item set B is 36%, and the item drawing probability of the item set C is 63%.

Each prop in the prop set C is configured with a reverse bottom-keeping strategy, and if the prop is drawn, the prop needs to participate in the lottery again at an interval of 2 times. Because the item set C has high probability of drawing the middle, the user can easily draw a certain item in the group C for the first time, and if the user draws the group C1, the same item as the first drawing can not be drawn again even if the user draws the group C again in the second drawing.

402: and determining whether the props meeting the policy of the Mingbu bottom exist in the rest props.

If the props meeting the policy of the Mingbu exist, executing step 405; if there is no prop set that satisfies the policy of the clear base, step 403 and step 404 are executed.

403: and determining the probability of each prop in the remaining props based on the prop distribution record of the target prop set and the hidden bottom-protecting strategy.

404: and randomly selecting the rest props based on the determined probability of each prop to obtain the target props.

In step 404, the selection process of the target item can be referred to the selection process of the set of target items in step 305, and a detailed description is omitted here.

405: and taking the prop as a target prop.

Namely, the props meeting the policy of the Mingbu base are taken as target props.

Optionally, the method may further include:

and when the target property set meets the lucky value bottom-preserving strategy, randomly selecting one property from the target property set as the target property. In the embodiment of the disclosure, all properties in the same property set have equal values, and all properties included in the property set satisfying the lucky value bottom-preserving strategy are rare properties, so that only one property needs to be selected as a target property.

In another possible implementation manner, the target prop may be determined by all the prop sets using the flow shown in fig. 4.

Optionally, the method further comprises updating the prop allocation record. So as to determine whether the prop set meets the corresponding first strategy and determine whether the props in the target prop set meet the corresponding second strategy according to the latest prop distribution record.

In the disclosed embodiment, updating the item allocation records includes updating the allocation record of each item set and updating the allocation record of the items in each item set.

FIG. 10 is a schematic flow chart illustrating an exemplary process for updating an assignment record for a set of props. As shown in fig. 10, for any item set, the update process of the distribution record of the item set includes:

501: whether a prop set is selected;

if the prop set is selected, go to step 502; if not, go to step 503.

502: and setting the dark bottom, the lucky value, the bright bottom and the reverse bottom of the property set to 0.

503: and accumulating the continuous missing times of the prop set. I.e. adding one to the number of misses for the set of props.

504: and accumulating the lucky value of the prop set.

I.e. the lucky value is added to the set number. For example, the set number corresponding to different treasure boxes is different, and the set number corresponding to a treasure box with a high grade can be larger than the set number corresponding to a treasure box with a low grade.

FIG. 11 is a flow chart illustrating an exemplary record of the distribution of items in a collection. As shown in fig. 11, for any prop in the prop set, the updating process of the allocation record of the prop includes:

601: whether the prop is selected;

if the property is selected, go to step 602; if not, go to step 603.

602: and setting the hidden bottom, the bright bottom and the reverse bottom of the prop to 0.

603: and accumulating the continuous missing times of the prop set. I.e. adding one to the number of misses for the set of props.

The following are embodiments of the apparatus of the present application that may be used to perform embodiments of the method of the present application. For details which are not disclosed in the embodiments of the apparatus of the present application, reference is made to the embodiments of the method of the present application.

Fig. 12 is a block diagram of a structure of a virtual item allocation apparatus according to an embodiment of the present application. The apparatus may be implemented as all or a portion of a server. As shown in fig. 12, the apparatus includes: a receiving module 901, a determining module 902, an obtaining module 903, a first selecting module 904, a second selecting module 905 and a sending module 906.

The receiving module 901 is configured to receive a treasure box opening request, where the treasure box opening request includes a treasure box identifier and an identifier of a user; the determining module 902 is configured to determine a virtual item pool corresponding to the treasure box identifier, where the virtual item pool includes at least two item sets, and each item set includes at least two items;

the obtaining module 903 is configured to obtain a prop allocation record of a user, where the prop allocation record of the user includes a prop set allocation record and a prop allocation record of each prop set; the first selection module 904 is configured to select a target prop set from the at least two prop sets based on the prop set allocation record; the second selection module 905 is configured to select one prop from the target prop set as a target prop based on the prop allocation records of the target prop set; the sending module 906 is configured to send a treasure box opening result to the terminal of the user, where the treasure box opening result includes an identifier of the target prop.

Optionally, the first selection module 904 is configured to select a target prop set from at least two prop sets according to a first policy set based on the prop set allocation records, where the first policy set includes at least one first policy, and the first policy is selected from the following policies: a clear warranty policy, a dark warranty policy, a lucky value warranty policy, and a reverse warranty policy.

Optionally, the first selection module 904 comprises:

the filtering submodule 9041 is used for filtering out the item set which meets the reverse bottom-preserving strategy in the virtual item pool to obtain a residual item set;

a selecting submodule 9042, configured to, when a property set that meets the policy of an express insurance base or the policy of a lucky value insurance base exists in the remaining property sets, take the property set that meets the policy of an express insurance base or the policy of a lucky value insurance base as a target property set; or when no prop set meeting the clear insurance policy or the lucky value insurance policy exists in the rest prop sets, determining the probability of each prop set in the rest prop sets based on the prop set distribution records and the dark insurance policy; and based on the determined probability of each prop set, randomly selecting at least two prop sets to obtain a target prop set.

Optionally, the second selecting module 905 is configured to, when the target item set does not satisfy the lucky value underwriting policy, select, based on an item allocation record of the target item set, one item from the target item set as the target item according to a second policy set, where the second policy set includes at least one second policy, and the second policy is selected from the following policies: a clear warranty bottom policy, a dark warranty bottom policy, and a reverse warranty bottom policy.

Optionally, the second selection module 905 includes:

the filtering submodule 9051 is used for filtering out a prop set meeting a reverse bottom-preserving strategy from the target prop set to obtain a residual prop;

the selecting submodule 9052 is used for taking the props meeting the top-of-guarantee strategy as target props when prop sets meeting the top-of-guarantee strategy exist in the remaining props; or when the props meeting the clear insurance bottom strategy or the lucky value insurance bottom strategy do not exist in the rest props, determining the probability of each prop in the rest props based on the prop distribution record and the dark insurance bottom strategy of the target prop set; and randomly selecting the rest props based on the determined probability of each prop to obtain the target props.

Optionally, the second selection module 905 is further configured to randomly select one prop from the target prop set as the target prop when the target prop set satisfies the lucky value underwriting policy.

Illustratively, the item set allocation record includes the number of misses and the luck value for each item set; the item allocation record of the item set comprises the number of times each item in the item set is missed.

The embodiment of the application also provides computer equipment, and the computer equipment can be a server. The computer device may comprise a processor and a memory, said memory storing at least one instruction, at least one program, a set of codes or a set of instructions, which is loaded and executed by said processor to implement the aforementioned method.

Fig. 13 is a schematic structural diagram of a server according to an embodiment of the present application. Referring to fig. 13, a server 1000 includes a Central Processing Unit (CPU) 1001, a system Memory 1004 including a Random Access Memory (RAM) 1002 and a Read-Only Memory (ROM) 1003, and a system bus 1005 connecting the system Memory 1004 and the Central Processing Unit 1001. The server 1000 also includes a basic Input/Output system (I/O system) 1006, which facilitates the transfer of information between devices within the computer, and a mass storage device 1007, which stores an operating system 1013, application programs 1014, and other program modules 1015.

The basic input/output system 1006 includes a display 1008 for displaying information and an input device 1009, such as a mouse, keyboard, etc., for user input of information. Wherein a display 1008 and an input device 1009 are connected to the central processing unit 1001 via an input-output controller 1010 connected to the system bus 1005. The basic input/output system 1006 may also include an input/output controller 1010 for receiving and processing input from a number of other devices, such as a keyboard, mouse, or electronic stylus. Similarly, the input-output controller 1010 also provides output to a display screen, a printer, or other type of output device.

The mass storage device 1007 is connected to the central processing unit 1001 through a mass storage controller (not shown) connected to the system bus 1005. The mass storage device 1007 and its associated computer-readable media provide non-volatile storage for the server 1000. That is, the mass storage device 1007 may include a computer-readable medium (not shown) such as a hard disk or CD-ROM drive.

Without loss of generality, computer readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes RAM, ROM, Erasable Programmable Read Only Memory (EPROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash Memory or other solid state Memory technology, Compact Disc Read-Only Memory (CD-ROM), Digital Versatile Disc (DVD), or other optical, magnetic, tape, magnetic disk storage or other magnetic storage devices. Of course, those skilled in the art will appreciate that computer storage media is not limited to the foregoing. The system memory 1004 and mass storage device 1007 described above may be collectively referred to as memory.

According to various embodiments of the present application, the server 1000 may also operate as a remote computer connected to a network through a network, such as the Internet. That is, the server 1000 may be connected to the network 1012 through a network interface unit 1011 connected to the system bus 1005, or the network interface unit 1011 may be used to connect to another type of network or a remote computer system (not shown).

The memory further includes one or more programs, and the one or more programs are stored in the memory and configured to be executed by the CPU. The CPU 1001 realizes the aforementioned virtual item allocation by executing the one or more programs.

Those skilled in the art will appreciate that the architecture shown in FIG. 13 is not intended to be limiting of the server 1000, and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components may be used.

Embodiments of the present application also provide a computer-readable storage medium storing at least one instruction, at least one program, a set of codes, or a set of instructions, which is loaded and executed by the processor to implement the method as described above. For example, the computer readable storage medium may be a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.

Embodiments of the present application also provide a computer program product having at least one instruction, at least one program, a set of codes, or a set of instructions stored thereon, loaded into and executed by the processor to implement the method as described above.

It should be understood that reference to "a plurality" herein means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.

It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, where the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.

The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A method for allocating virtual items, the method comprising:

receiving a treasure box opening request, wherein the treasure box opening request comprises a treasure box identifier and a user identifier;

2. The method of claim 1, wherein selecting a target set of items from the at least two sets of items based on the set of item allocation records comprises:

selecting a target prop set from the at least two prop sets according to a first strategy set based on the prop set allocation records, wherein the first strategy set comprises at least one first strategy, and the first strategy is selected from the following strategies: a clear warranty policy, a dark warranty policy, a lucky value warranty policy, and a reverse warranty policy.

3. The method of claim 2, wherein selecting a target set of items from the at least two sets of items according to a first set of policies based on the set of item allocation records comprises:

filtering the prop set which meets a reverse bottom-preserving strategy in the virtual prop pool to obtain a residual prop set;

when the prop set meeting the policy of the Mingbu exists in the rest prop sets, taking the prop set meeting the policy of the Mingbu as a target prop set;

alternatively, the first and second electrodes may be,

when the property sets meeting the lucky value bottom-preserving strategy exist in the residual property sets, taking the property sets meeting the lucky value bottom-preserving strategy as target property sets;

alternatively, the first and second electrodes may be,

when no prop set meeting an express insurance policy or a lucky value insurance policy exists in the remaining prop sets, determining the probability of each prop set in the remaining prop sets based on the prop set distribution records and the dark insurance policy; and randomly selecting the at least two prop sets based on the determined probability of each prop set to obtain the target prop set.

4. The method according to any one of claims 1 to 3, wherein selecting one prop from the set of target props as a target prop based on the prop allocation records of the set of target props comprises:

when the target prop set does not meet a lucky value bottom-preserving strategy, selecting one prop from the target prop set as a target prop according to a second strategy set based on a prop distribution record of the target prop set, wherein the second strategy set comprises at least one second strategy, and the second strategy is selected from the following strategies: a clear warranty bottom policy, a dark warranty bottom policy, and a reverse warranty bottom policy.

5. The method of claim 4, wherein the selecting one prop from the target prop set as a target prop according to a second policy set based on the prop allocation record of the target prop set comprises:

filtering the prop set meeting the reverse bottom-preserving strategy in the target prop set to obtain the residual props;

when the prop set meeting the Mingbu strategy exists in the rest props, taking the props meeting the Mingbu strategy as target props;

alternatively, the first and second electrodes may be,

when no prop meeting an explicit bottom-preserving strategy exists in the rest props, determining the probability of each prop in the rest props based on the prop distribution record of the target prop set and the dark bottom-preserving strategy; and randomly selecting the rest props based on the determined probability of each prop to obtain the target props.

6. The method of claim 4, further comprising:

and when the target prop set meets a lucky value bottom-preserving strategy, randomly selecting a prop from the target prop set as the target prop.

7. The method of any of claims 1 to 3, wherein the item set allocation records include a number of misses and a fortune value for each item set; the item allocation record of the item set comprises the number of times each item in the item set is missed.

8. A virtual item allocation apparatus, the apparatus comprising:

9. A computer device comprising a processor and a memory, the memory storing at least one instruction, at least one program, a set of codes, or a set of instructions, which is loaded and executed by the processor to implement the method according to any one of claims 1 to 7.

10. A computer readable storage medium storing at least one instruction, at least one program, a set of codes, or a set of instructions, which is loaded and executed by a processor to implement the method according to any one of claims 1 to 7.