[go: up one dir, main page]

CN111729301B - Method and device for recommending props in rushing game and game terminal - Google Patents

Method and device for recommending props in rushing game and game terminal Download PDF

Info

Publication number
CN111729301B
CN111729301B CN202010540735.9A CN202010540735A CN111729301B CN 111729301 B CN111729301 B CN 111729301B CN 202010540735 A CN202010540735 A CN 202010540735A CN 111729301 B CN111729301 B CN 111729301B
Authority
CN
China
Prior art keywords
game
data
player
props
clearance
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010540735.9A
Other languages
Chinese (zh)
Other versions
CN111729301A (en
Inventor
高运
王恺
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing ELEX Technology Co Ltd
Original Assignee
Beijing ELEX Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing ELEX Technology Co Ltd filed Critical Beijing ELEX Technology Co Ltd
Priority to CN202010540735.9A priority Critical patent/CN111729301B/en
Publication of CN111729301A publication Critical patent/CN111729301A/en
Application granted granted Critical
Publication of CN111729301B publication Critical patent/CN111729301B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/45—Controlling the progress of the video game
    • A63F13/47—Controlling the progress of the video game involving branching, e.g. choosing one of several possible scenarios at a given point in time
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/70—Game security or game management aspects
    • A63F13/79—Game security or game management aspects involving player-related data, e.g. identities, accounts, preferences or play histories
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F2300/00—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game
    • A63F2300/50—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game characterized by details of game servers
    • A63F2300/53—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game characterized by details of game servers details of basic data processing
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F2300/00—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game
    • A63F2300/50—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game characterized by details of game servers
    • A63F2300/55—Details of game data or player data management
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00—Road transport of goods or passengers
    • Y02T10/10—Internal combustion engine [ICE] based vehicles
    • Y02T10/40—Engine management systems

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Business, Economics & Management (AREA)
  • Computer Security & Cryptography (AREA)
  • General Business, Economics & Management (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention belongs to the technical field of mobile phone games, and discloses a method and a device for recommending props in a break-through game and a game terminal, wherein the method comprises the following steps: responding to a first player to execute a break-out request of a game level; acquiring clearance data of N second players who clearance the game level; identifying ranking data for the first player and generating a first optimized screening threshold based thereon; optimizing and screening the clearance data based on the first optimizing and screening threshold value to obtain optimizing and screening data of the clearance data; recommending game props to the first player based on the optimized screening data; in summary, based on the invention, players can know the game props possibly needed when the players pass the current game level before running the break, therefore, the probability that the player buys the required game prop before rushing the clearance is improved, and the effects of promoting game consumption, reducing the rushing times, improving the clearance efficiency and improving the game experience are achieved.

Description

Method and device for recommending props in rushing game and game terminal
Technical Field
The invention belongs to the technical field of mobile phone games, and particularly relates to a method and a device for recommending props in a break-through game and a game terminal.
Background
With the rapid development of mobile electronic devices, there are more and more applications that can be installed and run on mobile electronic devices. The mobile phone game is one of important ways of entertainment and recreation in life of people in various stages by virtue of the glaring animation effect and excellent game experience.
In the existing mobile phone games, the rushing game is a very common game type; in the existing jaywalking game, in order to improve the clearance probability of a player during jaywalking and the game income of a game application provider, game props capable of assisting the player in clearance are provided in the game, the game props are concentrated in a game mall, and when the player needs to purchase the game props, the player can find corresponding game props in the game mall.
However, in the case of a jaywalking game, when a player performs different levels or tasks, the required game props are different, and the purchasing operation of the game props is generally performed before the start of the jaywalking, so that it is difficult for the player to accurately purchase the corresponding props before the start of the jaywalking, so that the probability of one-time passing of the player is greatly reduced.
In summary, how to accurately recommend props to players before starting to break the gate to improve the game experience is a problem to be solved.
Disclosure of Invention
In view of the above, the present invention aims to provide a method and an apparatus for recommending props in an jaywalking game, and a game terminal, so as to effectively solve the problems set forth in the background art, thereby achieving the effects of improving the jaywalking probability and improving the game experience.
In order to achieve the above purpose, the present invention provides the following technical solutions:
A recommending method of props in a jaywalking game relates to a game terminal provided with a target jaywalking game, and in the target jaywalking game: at least one game stage for player to execute and at least one game prop capable of acting on the game stage, wherein the recommendation method is applied to the game terminal and comprises the following steps:
responding to a first player to execute a break-out request of a game level;
acquiring clearance data of N second players who clearance the game level;
Identifying ranking data for the first player and generating a first optimized screening threshold based thereon;
optimizing and screening the clearance data based on the first optimizing and screening threshold value to obtain optimizing and screening data of the clearance data;
recommending game props to the first player based on the optimized screening data;
wherein:
the clearance data comprise grade data of N second players, the number of clearance in the clearance process and game prop data used in clearance;
the optimized screening data comprise grade data of (N-M) second players which are optimized and screened based on the optimized screening threshold value, the number of rushing to be shut in the clearance process and game prop data used in clearance;
And N and M are any integer of 0 … … N.
Preferably, the optimized screening threshold is a level threshold, and the level threshold includes a highest level threshold and a lowest level threshold; wherein:
first player rank= (highest rank threshold+lowest rank threshold)/2.
Further, when the optimizing screening threshold is used for optimizing and screening the clearance data: the level of any second player in the optimized screening data is not lower than the lowest level threshold; the ranking of any second player in the optimized screening data is not higher than the highest ranking threshold.
Preferably, when recommending the game prop to the first player, the method includes: obtaining game prop data used when (N-M) second players pass through in the optimized screening data; identifying the use times of each game prop in the (N-M) game prop data, and optimally sorting the game props based on the use times of the game props; at least one of the play items is recommended to the first player based on the preference ranking.
Further, when recommending a game prop to the first player, the method further comprises: constructing the sorting weight of each game prop in the optimized screening data; and the ranking weight is positively correlated with the preferred ranking.
Further, when the sorting weight of the game props is constructed: p t＝(W1+……+Wn)/n; wherein t is any game prop in the optimized screening data, P is the sorting weight of the game props t, n is the using times of the game props t in the optimized screening data, and W 1+……+Wn is the sum of n basic weights of the game props t in n times of use.
Further, the basic weight is constructed based on the number of the clearance times of any second player in the optimized screening data in the clearance process, and the basic weight is inversely related to the number of the clearance times.
Specifically, when the basic weight is constructed: w x＝Q*S(V-1); wherein x is any second player in the optimized screening data, W is the basic weight of the game prop used by the second player x in the clearance, V is the clearance times of the second player x in the optimized screening data, and S is the negative correlation calculation reference value.
Compared with the prior art, the invention has the following beneficial effects:
In the invention, when the current player requests to execute the break of a certain game level, the game props used by the history pass player can be recommended preferably, so that the current player can know the game props possibly needed when the current game level is passed before the break is executed, thereby effectively improving the probability that the current player buys the needed game props before the break, and further achieving the effects of promoting game consumption, reducing the break times, improving the pass efficiency and improving the game experience.
When the game props used by the history clearance players are recommended in a preferred mode, the history clearance players are screened based on the grades of the current players, so that when the game props are recommended finally, the recommended game props are used by clearance players with the grades similar to the current players, the accuracy of game props recommendation is further provided, and the recommended game props can be effectively applied to the current game level.
In addition, when the preferred recommendation of the game props is carried out, the weight setting of the negative correlation is carried out based on the break times of the clearance players, so that the probability that the current game level can be cleared once after the current players purchase and use the recommended game props is improved, and the game experience is further improved.
In order to achieve the above purpose, the present invention further provides the following technical solutions:
a recommendation device for props in a rushing-in game, comprising:
the response and acquisition module responds to the first player to execute the break-through request of the game level and acquires the pass data of N second players passing through the game level;
An identification module for identifying the first player's ranking data;
the threshold generation module is used for generating a first optimized screening threshold according to the identification result of the identification module;
The optimizing and screening module is used for optimizing and screening the clearance data according to the first optimizing and screening threshold value to obtain optimizing and screening data;
and the optimization recommendation module recommends game props to the first player according to the optimization screening data.
A gaming terminal comprising a memory and a processor; at least one executable code stored in the memory; the at least one piece of executable code is loaded and executed by the processor, and the at least one piece of executable code implements the recommended method of props disclosed above when the loading is executed.
Drawings
FIG. 1 is a flow chart of a method for recommending props provided by the present invention;
FIG. 2 is a block diagram of a recommended device for props according to the present invention;
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
In the embodiment of the invention, a recommendation method of props in a rushing-to-close game is provided, and particularly, a game terminal provided with and running the rushing-to-close game is involved when the method is realized, wherein the game terminal can be formed by adopting intelligent mobile terminals such as a mobile phone, an IPAD (Internet protocol access controller) and the like;
When running the game of the jaywalking class, the corresponding target jaywalking game at least comprises one game stage which can be executed by a player and at least comprises a game prop which can act on the game stage.
In the invention, the following embodiment is provided for explaining a method for recommending props in an inter-break game in detail.
Furthermore, the terms first, second, third, fourth and the like in the description, in the claims and in the drawings, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented, for example, in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Example 1
In this embodiment, a method for recommending props in an interloper game is operated by the game terminal.
Specifically, referring to fig. 1, a flowchart of a method for recommending props in an interloper game disclosed in the present embodiment is shown, and the method specifically includes the following steps:
s1, responding to a first player to execute a break-through request of a game level;
in particular, in the present embodiment, the specific form regarding the request for the break-over is not limited. The following examples are presented herein, but are not limited to, as readily explained:
for example, when the first player completes the clearance of the last game level, the first player may be regarded as making a clearance request for executing the next game level.
For example, a first player may be considered to make a request to make a break-out of one game level when entering the game entry of that game level.
In the present embodiment, taking the case of executing an intrusion of game level a as an example; the first player may be represented as any player who does not pass through the game level a in the break-through game; specifically, the following description is made with one of the first players as a main viewing angle.
S2, acquiring clearance data of N second players of the clearance game level;
specifically, in this embodiment, regarding N second players, all players who have cleared the game level a are referred to as including player a, player b, player c, player d, player e, player f;
Specifically, in the present embodiment, the clearance data includes level data of N second players, the number of breaks in the clearance process, and game stage data used at the time of clearance. Wherein: the number of the clearance includes one clearance during clearance, and the game prop data used during clearance is the game prop used during the last clearance.
Specifically, in the present embodiment, regarding the player of the clearance game stage a, the following data are set: player a: the grade is 20, the number of the clearance is 5, and the game prop used in clearance is prop one; player b: the grade is 23, the number of the clearance is 2, and the game prop used in clearance is prop one; player c: the grade is 22, the number of the clearance is 3, and the game props used in clearance are props two; player d: the grade is 25, the number of the clearance is 1, and the game props used in clearance are props three; player e: the grade is 21, the number of the clearance is 3, and the game props used in clearance are props three; player f: the grade is 24, the number of the rushing to the clearance is 1, and the game props used in clearance are props three.
S3, identifying the grade data of the first player, and generating a first optimized screening threshold value based on the grade data;
Specifically, in the present embodiment, the optimization screening threshold is preferably a rank threshold, and the rank threshold includes a highest rank threshold and a lowest rank threshold; wherein:
first player rank= (highest rank threshold+lowest rank threshold)/2.
As can be seen from the above, when the first optimized screening threshold is used for limiting the recommendation of the game prop, the upper limit and the lower limit of the reference levels of the N second players are not limited in the embodiment, and can be specifically set according to the requirements in practical application.
The following examples are presented herein, but are not limited to, as readily explained: by way of example, the first player is set to a level 22, with both upper and lower limits of 2, whereby it is known that the lowest level threshold should be a level 20 and the highest level threshold should be a level 24.
S4, optimizing and screening the clearance data based on the first optimizing and screening threshold value to obtain optimizing and screening data of the clearance data;
Specifically, the following optimization screening data are obtained by performing optimization screening based on the first optimization screening threshold with the lowest level threshold of 20 and the highest level threshold of 24:
player a: the grade is 20, the number of the clearance is 5, and the game prop used in clearance is prop one;
player b: the grade is 23, the number of the clearance is 2, and the game prop used in clearance is prop one;
Player c: the grade is 22, the number of the clearance is 3, and the game props used in clearance are props two;
player e: the grade is 21, the number of the clearance is 3, and the game props used in clearance are props three;
player f: the grade is 24, the number of the rushing to the clearance is 1, and the game props used in clearance are props three.
S5, recommending game props to the first player based on the optimized screening data;
Specifically, in this embodiment, when recommending game props to the first player, the game props should be optimally ordered according to the usage times of each game prop in the optimized screening data, that is, the following game props are ordered:
(1) Prop one and prop three;
(2) And a prop II.
It can be seen that, in this embodiment, if only one game prop is recommended to the first player, prop one or prop three is recommended; if the number of the recommended products exceeds one, the recommended products are sequentially recommended according to the optimized sequence.
In summary, in this embodiment, not only is the optimal recommendation performed by the number of times of use of the prop, but also the limitation is performed based on the player level, so that the finally recommended game prop can be effectively applied to the use of the first player in the game level a.
Example 2
This embodiment is a further preferred embodiment of embodiment 1, and the overall flow and principle are the same as embodiment 1, except that: in this embodiment, the weight setting is performed on the corresponding game props based on the difference of the number of break-through times performed by the corresponding players when the game level a is cleared, so as to improve the probability that the first player can clear the current game level once after purchasing and using the recommended game props, and solve the problem of optimizing and sorting under the condition that the number of use times of the two props is the same in embodiment 1.
In this embodiment, the construction of the basic weight is first included, the basic weight is constructed based on the number of the rushing to close times of any second player in the optimized screening data in the process of rushing to close, and the basic weight is inversely related to the number of the rushing to close times. Specifically, in the present embodiment, the following data model is constructed:
Wx＝Q*S(V-1)；
Wherein: x is any second player in the optimized screening data, W x is the basic weight of the game prop used by the second player x in the clearance, Q is the basic value calculated by the basic weight, V is the clearance times of the second player x in the optimized screening data, and S is the reference value calculated by the negative correlation.
For example, q=100 and s=0.9 are set, and taking the optimized screening data screened in the above embodiment 1 as an example, the data of the following basic weights are obtained:
Player a: w x(a)＝Q*S(V-1)＝100*0.9(5-1) = 65.61; the corresponding prop is first prop;
Player b: w x(b)＝Q*S(V-1)＝100*0.9(2-1) = 90; the corresponding prop is first prop;
Player c: w x(c)＝Q*S(V-1)＝100*0.9(3-1) = 81; the corresponding prop is a prop II;
player e: w x(e)＝Q*S(V-1)＝100*0.9(3-1) = 81; the corresponding prop is a prop III;
Player f: w x(f)＝Q*S(V-1)＝100*0.9(1-1) = 100; and the corresponding prop is three.
Specifically, in this embodiment, the method further includes the construction of the ranking weights:
Pt＝(W1+……+Wn)/n；
Wherein t is any game prop in the optimized screening data, P is the sorting weight of the game props t, n is the using times of the game props t in the optimized screening data, and W 1+……+Wn is the sum of n basic weights of the game props t in n times of use;
specifically, the ranking weight refers to the overall weight on the play object. In summary, the ranking weight data of the following game props are obtained after calculation:
prop one: p t(1)＝(W1+……+Wn)/n= (65.61+90)/2= 77.805;
prop II: p t(2)＝(W1+……+Wn)/n= (81)/1=81;
Prop III: p t(3)＝(W1+……+Wn)/n= (81+100)/2=90.5.
Specifically, the ranking weight is positively correlated with the preferred ranking described in embodiment 1, that is, the higher the ranking weight, the earlier the corresponding game prop ranking should be, thereby obtaining the final preferred ranking in this embodiment as:
(1) Prop III;
(2) Prop one;
(3) And a prop II.
It can be seen that, in this embodiment, if only one game prop is recommended to the first player, then prop one is recommended; if the number of the recommended products exceeds one, the recommended products are sequentially recommended according to the optimized sequence.
In the foregoing illustration and description, although steps are described as a sequential process, many of the steps may be alternatively, concurrently, or with other implementations. Furthermore, the order of the steps may be rearranged. And the process may be terminated when its operations are completed, but may have additional steps not included in the drawing. The processes may correspond to methods, functions, procedures, subroutines, and the like.
Example 3
The embodiment of the invention also provides a recommending device for props in the rushing game, and particularly referring to fig. 2, the recommending device is a structural block diagram, as can be seen from the diagram, the recommending device comprises:
The response and acquisition module 10 responds to the break-in request of the first player for executing the game level and acquires the clearance data of N second players of the clearance game level;
An identification module 20 for identifying the ranking data of the first player;
The threshold generating module 30 generates a first optimized screening threshold according to the identification result of the identifying module 20;
the optimization screening module 40 is configured to perform optimization screening on the clearance data according to the first optimization screening threshold value to obtain optimization screening data;
an optimization recommendation module 50 for recommending game props to the first player based on the optimization screening data
In this embodiment, the recommendation device performs recommendation of the game props according to the recommendation method disclosed in the above embodiment 1 or embodiment 2.
Example 4
The embodiment of the invention also provides a game terminal, which specifically comprises a storage and a processor; at least one executable code is stored in the memory; at least one piece of executable code is loaded and executed by the processor, and the at least one piece of executable code implements the recommended method disclosed in embodiment 1 or embodiment 2 described above when the loading is executed.
Although embodiments of the present invention have been shown and described, it will be understood by those skilled in the art that various changes, modifications, substitutions and alterations can be made therein without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.

Claims (5)

1. A recommending method of props in a jaywalking game is characterized by comprising a game terminal provided with a target jaywalking game, wherein the target jaywalking game comprises the following steps: at least one game stage for player to execute and at least one game prop capable of acting on the game stage, wherein the recommendation method is applied to the game terminal and comprises the following steps:
responding to a first player to execute a break-out request of a game level;
acquiring clearance data of N second players who clearance the game level;
Identifying ranking data for the first player and generating a first optimized screening threshold based thereon;
optimizing and screening the clearance data based on the first optimizing and screening threshold value to obtain optimizing and screening data of the clearance data;
recommending game props to the first player based on the optimized screening data;
wherein:
the clearance data comprise grade data of N second players, the number of clearance in the clearance process and game prop data used in clearance;
the optimized screening data comprise grade data of (N-M) second players which are optimized and screened based on the optimized screening threshold value, the number of rushing to be shut in the clearance process and game prop data used in clearance;
N and M are any positive integer from 0 to N, and N is more than or equal to M;
The optimized screening threshold is a level threshold, and the level threshold comprises a highest level threshold and a lowest level threshold; wherein:
First player's rank= (highest rank threshold+lowest rank threshold)/2;
when the clearance data is optimally screened based on the optimal screening threshold value:
The level of any second player in the optimized screening data is not lower than the lowest level threshold;
the level of any second player in the optimized screening data is not higher than the highest level threshold;
when recommending game props to the first player, comprising:
Obtaining game prop data used when (N-M) second players pass through in the optimized screening data;
Identifying the use times of each game prop in the (N-M) game prop data, and optimally sorting the game props based on the use times of the game props;
Recommending at least one of the play items to the first player based on the preference ranking;
when recommending game props to the first player, further comprising:
constructing the sorting weight of each game prop in the optimized screening data; and the ranking weight is positively correlated with the preferred ranking;
when the sorting weight of the game props is constructed:
P t＝(W1+……+Wn)/n; wherein t is any game prop in the optimized screening data, P is the sorting weight of the game props t, n is the using times of the game props t in the optimized screening data, and W 1+……+Wn is the sum of n basic weights of the game props t in n times of use.
2. The method for recommending props in a jaywalking game according to claim 1, wherein the basic weight is constructed based on the number of times of jaywalking of any second player in the optimized screening data in the process of passing, and the basic weight is inversely related to the number of times of jaywalking.
3. The method for recommending props in a rushing game according to claim 2, wherein when constructing the basic weight:
W x＝Q*S(V-1); wherein x is any second player in the optimized screening data, W is the basic weight of the game prop used by the second player x in the clearance, V is the clearance times of the second player x in the optimized screening data, and S is the negative correlation calculation reference value.
4. A recommendation device for an item in an interloper game, configured to perform a recommendation method for an item in an interloper game as set forth in claim 1, comprising:
the response and acquisition module responds to the first player to execute the break-through request of the game level and acquires the pass data of N second players passing through the game level;
An identification module for identifying the first player's ranking data;
the threshold generation module is used for generating a first optimized screening threshold according to the identification result of the identification module;
The optimizing and screening module is used for optimizing and screening the clearance data according to the first optimizing and screening threshold value to obtain optimizing and screening data;
The optimizing recommendation module recommends game props to the first player according to the optimizing screening data;
the optimization screening threshold is a grade threshold, and the grade threshold comprises a highest grade threshold and a lowest grade threshold; wherein:
First player's rank= (highest rank threshold+lowest rank threshold)/2;
when optimizing and screening the clearance data based on the optimizing and screening threshold value:
the level of any second player in the optimized screening data is not lower than the lowest level threshold;
the level of any second player in the optimized screening data is not higher than the highest level threshold;
When recommending game props to a first player, comprising:
obtaining game prop data used when (N-M) second players pass through in the optimized screening data;
Identifying the use times of each game prop in the (N-M) game prop data, and optimally sequencing the game props based on the use times of the game props;
recommending at least one play object to the first player based on the preference ranking;
when recommending game props to the first player, further comprising:
constructing a sequencing weight of each game prop in the optimized screening data; and the ranking weight is positively correlated with the preferred ranking;
When the ordering weight of the game props is constructed:
P t＝(W1+……+Wn)/n; wherein t is any game prop in the optimized screening data, P is the sorting weight of the game props t, n is the using times of the game props t in the optimized screening data, and W 1+……+Wn is the sum of n basic weights of the game props t in n times of use.
5. A gaming terminal comprising a memory and a processor;
At least one executable code stored in the memory; the at least one piece of executable code is loaded and executed by a processor, and the at least one piece of executable code, when loaded and executed, implements the recommended method of any of claims 1-3.
CN202010540735.9A 2020-06-15 2020-06-15 Method and device for recommending props in rushing game and game terminal Active CN111729301B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010540735.9A CN111729301B (en) 2020-06-15 2020-06-15 Method and device for recommending props in rushing game and game terminal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010540735.9A CN111729301B (en) 2020-06-15 2020-06-15 Method and device for recommending props in rushing game and game terminal

Publications (2)

Publication Number Publication Date
CN111729301A CN111729301A (en) 2020-10-02
CN111729301B true CN111729301B (en) 2024-07-05

Family

ID=72649161

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010540735.9A Active CN111729301B (en) 2020-06-15 2020-06-15 Method and device for recommending props in rushing game and game terminal

Country Status (1)

Country Link
CN (1) CN111729301B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112569607B (en) 2020-12-11 2022-07-26 腾讯科技（深圳）有限公司 Display method, device, equipment and medium for pre-purchased prop
CN115607968A (en) * 2022-09-27 2023-01-17 网易（杭州）网络有限公司 Display method, device, storage medium and electronic device of virtual item
CN116863606A (en) * 2023-08-09 2023-10-10 广州华立科技股份有限公司 Card machine game system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106815302A (en) * 2016-12-13 2017-06-09 华中科技大学 A kind of Mining Frequent Itemsets for being applied to game item recommendation
CN111084987A (en) * 2019-11-19 2020-05-01 深圳市其乐游戏科技有限公司 Game item recommendation method and device and computer-readable storage medium

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20140015688A (en) * 2012-07-10 2014-02-07 주식회사 네오위즈인터넷 Method of providing game, server performing the same and storage media storing the same
CN105447126A (en) * 2015-11-17 2016-03-30 苏州蜗牛数字科技股份有限公司 Game prop personalized recommendation method
CN106075912B (en) * 2016-06-07 2019-12-03 维沃移动通信有限公司 A method for mutual assistance in online games and an online game system
CN106201877B (en) * 2016-07-08 2018-09-14 福州市鼓楼区森林创数文化传播有限公司 A kind of test method of FPS game items
CN106779933A (en) * 2016-12-06 2017-05-31 腾讯科技（深圳）有限公司 A kind of virtual item recommends method and client
JP6369734B1 (en) * 2017-07-07 2018-08-08 株式会社コナミアミューズメント GAME DEVICE AND GAME DEVICE PROGRAM
CN108090561B (en) * 2017-11-09 2021-12-07 腾讯科技(成都)有限公司 Storage medium, electronic device, and method and device for executing game operation
CN108459811B (en) * 2018-01-09 2021-03-16 网易（杭州）网络有限公司 Method and device for processing virtual prop, electronic equipment and storage medium
CN109999504B (en) * 2019-04-22 2022-05-31 腾讯科技（上海）有限公司 Game prop recommendation method, device, server and storage medium
CN111061949A (en) * 2019-12-03 2020-04-24 深圳市其乐游戏科技有限公司 Prop recommendation method, recommendation device and computer-readable storage medium

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106815302A (en) * 2016-12-13 2017-06-09 华中科技大学 A kind of Mining Frequent Itemsets for being applied to game item recommendation
CN111084987A (en) * 2019-11-19 2020-05-01 深圳市其乐游戏科技有限公司 Game item recommendation method and device and computer-readable storage medium

Also Published As

Publication number Publication date
CN111729301A (en) 2020-10-02

Similar Documents

Publication Publication Date Title
CN111729301B (en) Method and device for recommending props in rushing game and game terminal
CN110732139B (en) Training method of detection model and detection method and device of user data
CN110215710B (en) In-game event determination method and device, electronic equipment and storage medium
CN110704677B (en) Program recommendation method and device, readable storage medium and terminal equipment
CN108038398B (en) Two-dimensional code analysis capability test method and device and electronic equipment
CN107391108B (en) Notification bar information correction method and device and electronic equipment
CN111260449A (en) Model training method, commodity recommendation device and storage medium
CN115228089B (en) Role recommendation method and system for multiplayer online competitive game role conflicts
CN103577547B (en) Webpage type identification method and device
CN112445978B (en) Electronic book push method, electronic device and storage medium
US10671617B2 (en) Method and device for refining selection of items as a function of a multicomponent score criterion
CN111282270A (en) Game task display method, device and equipment based on game role balance development
CN113946604A (en) Staged go teaching method and device, electronic equipment and storage medium
CN111659125B (en) Friend recommendation method and device based on game and computer readable storage medium
CN112138389A (en) Game role recommendation display method, system and equipment
CN113318448A (en) Game resource display method and device, equipment and model training method
CN110011964B (en) Webpage environment detection method and device
CN113791837B (en) Page processing method, device, equipment and storage medium
CN106919693B (en) Method and device for improving hot word exposure coverage rate
CN112907014B (en) Rapid screening and dispatching rules, methods and devices
JP7716012B2 (en) Information processing device and information processing program
CN105843963A (en) Website selection method and server
CN104636366B (en) Method and device for acquiring search result queue
CN113988199B (en) Hierarchical processing method, device and related equipment for AI chess model
Chu et al. The performance optimization model of adjusting technical and tactical decisions with ideal usages for elite female table tennis players

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant