WO2023018019A1

WO2023018019A1 - Method for detecting hurdle in game

Info

Publication number: WO2023018019A1
Application number: PCT/KR2022/010083
Authority: WO
Inventors: 김민철; 서창우; 임한빈
Original assignee: 넷마블 주식회사
Priority date: 2021-08-11
Filing date: 2022-07-12
Publication date: 2023-02-16
Also published as: KR102592559B1; KR20230023950A

Abstract

Disclosed is a method for detecting a hurdle in a game according to some embodiments. The method for detecting a hurdle in a game may comprise the steps of: grouping a plurality of game players performing a plurality of quests into a plurality of groups on the basis of game play logs of the plurality of game players; determining, on the basis of the game play logs, the required time required by each of the plurality of groups to clear each of the plurality of quests; and determining at least one hurdle quest related to each of the plurality of groups on the basis of the required time required by each of the plurality of groups. The representative drawing may be FIG. 2.

Description

How to detect huddles in game

The present disclosure relates to a method for detecting a hurdle in a game, and more specifically, to a method for detecting a hurdle quest in a game that users may find difficult.

As the online game market becomes active, the types of online games that game players can play are also increasing. As the types of online games increase, game players search for other online games when they feel unsatisfied with the game they are playing.

In order to prevent such game players from leaving, game developers also identify points where the game player's abandonment rate is high in various ways. In addition, game developers adjust the difficulty level of quests related to points where the game player's abandonment rate is high.

However, if the difficulty of the quest is adjusted based on the dropout rate, it may already be too late to deal with it. The high dropout rate of game players may mean that game players have already left the game and no longer access the game. In other words, adjusting the difficulty of in-game quests based on the dropout rate can be like losing a cow and fixing a barn.

Therefore, it may be necessary to develop a method for detecting a quest in which the player is expected to leave the game before the player leaves the game. In this regard, Korean Registered Patent No. 10-1733458 has been devised.

The present disclosure has been made in response to the above background art, and is intended to provide a method for detecting hurdles in a game.

The technical problems of the present disclosure are not limited to the technical problems mentioned above, and other technical problems not mentioned will be clearly understood by those skilled in the art from the following description.

According to an embodiment of the present disclosure for solving the above problems, a method for detecting a hurdle in a game is disclosed. The method for detecting hurdles in the game may include grouping a plurality of game players into a plurality of groups based on game play logs of the plurality of game players who have performed a plurality of quests; determining a time required to clear each of the plurality of quests for each of the plurality of groups based on the game play log; and determining at least one hurdle quest related to each of the plurality of groups based on the required time for each of the plurality of groups. can include

In addition, the step of grouping the plurality of game players into a plurality of groups based on the game play logs of the plurality of game players who have performed the plurality of quests, the combat power of each of the plurality of game players based on the game play log calculating; and grouping the plurality of game players into the plurality of groups based on the fighting strength of each of the plurality of game players. can include

In addition, the step of determining at least one hurdle quest related to each of the plurality of groups based on the required time for each of the plurality of groups includes at least one hurdle quest included in a window determined based on a first parameter among the plurality of quests. determining a Z-score for the required time of each quest; determining a threshold range based on at least one factor and a second parameter used in calculating the Z-score; and determining, among the at least one quest, a quest having a peak in which the Z-score is out of the threshold range as the at least one hurdle quest; can include

In addition, the step of determining the Z-score for the required time of each of the at least one quest included in the window determined based on the first parameter of the plurality of quests, in the first quest of the at least one quest Determining a Z-score for a required time related to the first quest, based on a third parameter indicating the degree of influence with the second quest, which is a quest prior to the first quest, when determining a Z-score for the first quest. ; can include

In addition, when the Z-score is determined, recognizing all peaks included in the Z-score and aligning all the peaks; generating a preset number of sections based on all the sorted peaks; and setting a preset score for each of the preset number of sections. may further include.

In addition, determining at least one first peak outside the threshold range by increasing or decreasing a value of at least one of the first parameter, the second parameter, and the third parameter; Recognizing a first score set in a section corresponding to each of the at least one first peak; At least one second peak outside the threshold range is obtained by increasing or decreasing the value of at least one of the first parameter, the second parameter, and the third parameter so that a peak different from the at least one first peak is determined. determining peaks; Recognizing a second score set in a section corresponding to each of the at least one second peak; and based on the comparison between the first score and the second score, one of a value of a parameter used to determine the at least one first peak or a value of a parameter used to determine the at least one second peak. storing; may further include.

Also, when the at least one hurdle quest is determined, determining a risk level of each of the at least one hurdle quest; and determining a rank of the at least one hurdle quest according to the degree of risk. may further include.

In addition, the risk is the ratio of players who have made billing among the plurality of players included in each of the plurality of groups, the billing amount of the plurality of game players included in each of the plurality of groups, and each of the plurality of groups It may be determined based on at least one of the included number of billings of the plurality of game players.

In addition, each of the ratio of players who performed the billing, the billing amount, and the number of billings may have different weights.

The technical solutions obtainable in the present disclosure are not limited to the above-mentioned solutions, and other solutions not mentioned will become clear to those skilled in the art from the description below. You will be able to understand.

According to some embodiments of the present disclosure, a hurdle quest in which the game player is expected to leave the game is detected, thereby reducing the game player's abandonment.

Effects obtainable in the present disclosure are not limited to the effects mentioned above, and other effects not mentioned will be clearly understood by those skilled in the art from the description below. .

Various aspects are now described with reference to the drawings, wherein like reference numbers are used to collectively refer to like elements. In the following embodiments, for explanation purposes, numerous specific details are set forth in order to provide a thorough understanding of one or more aspects. However, it will be apparent that such aspect(s) may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing one or more aspects.

1 is a block diagram illustrating an example of a game server according to some embodiments of the present disclosure.

2 is a flowchart illustrating an example of a method for a game server to detect a huddle in a game according to some embodiments of the present disclosure.

3 is a graph for explaining an example of time required to perform a plurality of quests for each group according to some embodiments of the present disclosure.

4 is a graph for explaining an example of a hurdle quest according to some embodiments of the present disclosure.

5 is a flowchart illustrating an example of a method for determining a hurdle quest based on a Z-score by a game server according to some embodiments of the present disclosure.

6 is a graph for explaining an example of a Z-score according to some embodiments of the present disclosure.

7 is a flowchart illustrating an example of a method for setting a preset score for each of a preset number of intervals based on all peaks included in a Z-score by a game server according to some embodiments of the present disclosure.

8 is a method for a game server to store one of a value of a parameter used to determine at least one first peak or a value of a parameter used to determine at least one second peak, according to some embodiments of the present disclosure. It is a flow chart for explaining an example.

FIG. 9 is a flowchart illustrating an example of a method for a game server to determine a rank of at least one hurdle quest according to a degree of risk according to some embodiments of the present disclosure.

10 is a graph for explaining an example of a hurdle quest in which a ranking is determined according to some embodiments of the present disclosure.

11 shows a general schematic diagram of an example computing environment in which embodiments of the present disclosure may be implemented.

Various embodiments and/or aspects are now disclosed with reference to the drawings. In the following description, for purposes of explanation, numerous specific details are set forth in order to facilitate a general understanding of one or more aspects. However, it will also be appreciated by those skilled in the art that such aspect(s) may be practiced without these specific details. The following description and accompanying drawings describe in detail certain illustrative aspects of one or more aspects. However, these aspects are exemplary and some of the various methods in principle of the various aspects may be used, and the described descriptions are intended to include all such aspects and their equivalents. Specifically, “embodiment,” “example,” “aspect,” “exemplary,” etc., as used herein, is not to be construed as indicating that any aspect or design described is superior to or advantageous over other aspects or designs. Maybe not.

Hereinafter, the same reference numerals are given to the same or similar components regardless of reference numerals, and overlapping descriptions thereof will be omitted. In addition, in describing the embodiments disclosed in this specification, if it is determined that a detailed description of a related known technology may obscure the gist of the embodiment disclosed in this specification, the detailed description thereof will be omitted. In addition, the accompanying drawings are only for easy understanding of the embodiments disclosed in this specification, and the technical ideas disclosed in this specification are not limited by the accompanying drawings.

Although first, second, etc. are used to describe various elements or components, these elements or components are not limited by these terms, of course. These terms are only used to distinguish one element or component from another. Accordingly, it goes without saying that the first element or component mentioned below may also be the second element or component within the technical spirit of the present invention.

Unless otherwise defined, all terms (including technical and scientific terms) used in this specification may be used in a meaning commonly understood by those of ordinary skill in the art to which the present invention belongs. In addition, terms defined in commonly used dictionaries are not interpreted ideally or excessively unless explicitly specifically defined.

In addition, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or”. That is, unless otherwise specified or clear from the context, “X employs A or B” is intended to mean one of the natural inclusive substitutions. That is, X uses A; X uses B; Or, if X uses both A and B, "X uses either A or B" may apply to either of these cases. Also, the term "and/or" as used herein should be understood to refer to and include all possible combinations of one or more of the listed related items.

Also, the terms "comprises" and/or "comprising" mean that the feature and/or element is present, but excludes the presence or addition of one or more other features, elements and/or groups thereof. It should be understood that it does not. Also, unless otherwise specified or where the context clearly indicates that a singular form is indicated, the singular in this specification and claims should generally be construed to mean "one or more".

In addition, the terms "information" and "data" used herein may often be used interchangeably with each other.

It is understood that when an element is referred to as being "connected" or "connected" to another element, it may be directly connected or connected to the other element, but other elements may exist in the middle. It should be. On the other hand, when a component is referred to as “directly connected” or “directly connected” to another component, it should be understood that no other component exists in the middle.

The suffixes "module" and "unit" for components used in the following description are given or used interchangeably in consideration of ease of writing the specification, and do not have meanings or roles that are distinct from each other by themselves.

Objects and effects of the present disclosure, and technical configurations for achieving them will become clear with reference to embodiments described later in detail in conjunction with the accompanying drawings. In describing the present disclosure, if it is determined that a detailed description of a known function or configuration may unnecessarily obscure the gist of the present disclosure, the detailed description will be omitted. In addition, terms to be described below are terms defined in consideration of functions in the present disclosure, which may vary according to the intention or custom of a user or operator.

However, the present disclosure is not limited to the embodiments disclosed below and may be implemented in a variety of different forms. These embodiments are provided only to make this disclosure complete and to completely inform those skilled in the art of the scope of the disclosure, and the disclosure is only defined by the scope of the claims. . Therefore, the definition should be made based on the contents throughout this specification.

In the present disclosure, a game server may determine a hurdle quest among a plurality of quests in a game. Here, the hurdle quest may be a quest that game players may find difficult to clear. For example, a hurdle quest may be a quest with a higher level of difficulty than other quests. For example, a hurdle quest may be a quest that takes a long time to clear because monsters with high difficulty appear, or a quest that takes a long time to clear due to many repetitive elements. Such hurdle quests may be related to the dropout rate of game players. This is because game players may feel bored in a quest that takes a long time, and may disengage from the game due to this. Hereinafter, a method for determining a hurdle quest by the game server according to the present disclosure will be described with reference to FIGS. 1 to 10 .

Referring to FIG. 1 , the game server 100 may include a processor 110 and a database unit 120. However, the above-described components are not essential to implement the game server 100, so the game server 100 may have more or fewer components than those listed above.

Game server 100 may be any type of server, such as a microprocessor, mainframe computer, digital processor, portable device or device controller, and the like. However, it is not limited thereto.

The processor 110 may typically process overall operations of the game server 100 . The processor 110 may provide or process appropriate information or functions to a user by processing signals, data, information, etc. input or output through the components described above or by driving an application program.

In the present disclosure, the processor 110 may determine at least one hurdle quest among a plurality of quests in a game. In one example, the processor 110 may group the plurality of game players based on the game play log. Also, the processor 110 may determine a hurdle quest based on the time required to perform the plurality of quests for each group. If the processor 110 determines the hurdle quest by analyzing the game play log of each of the plurality of game players, resources consumed to determine the hurdle quest may be severely wasted. In addition, when a hurdle quest is determined by analyzing the game play logs of each of a plurality of game players, it may be difficult to identify a certain pattern. Accordingly, the processor 110 of the present disclosure may group a plurality of game players into a plurality of groups based on game play logs of the plurality of game players who have performed a plurality of quests. Also, the processor 110 may determine a hurdle quest based on the time required to perform the plurality of quests for each group. Hereinafter, a method for the processor 110 to determine a hurdle quest based on a plurality of groups will be described with reference to FIG. 2 .

Meanwhile, the database unit 120 may include a memory and/or a permanent storage medium. Memory is a flash memory type, a hard disk type, a multimedia card micro type, a card type memory (eg SD or XD memory, etc.), RAM (Random Access Memory, RAM), SRAM (Static Random Access Memory), ROM (Read-Only Memory, ROM), EEPROM (Electrically Erasable Programmable Read-Only Memory), PROM (Programmable Read-Only Memory), magnetic memory, magnetic disk, optical disk At least one type of storage medium may be included.

In the present disclosure, the database unit 120 may store any type of information generated or determined by the processor 110 and any type of information received by the communication unit (not shown).

Meanwhile, information related to at least one peak determined by the processor 110 may be stored in the database unit 120 . Here, the peak may indicate a point where the required time is equal to or greater than a predetermined value when the required time required for a plurality of players to clear each of the plurality of quests is generated as an arbitrary graph. In other words, a peak may mean a quest that took a long time for a plurality of players to clear. In this case, the processor 110 may determine a quest having a strong peak among a plurality of peaks as at least one hurdle quest. Here, the strong peak may be a peak having a high value, such as a required time, among a plurality of peaks. However, it is not limited thereto. Hereinafter, an example of peaks stored in the database unit 120 will be described with reference to FIG. 7 .

According to the configuration described above, the game server 100 may group a plurality of game players. Also, the processor 110 may determine a hurdle quest based on the time required to perform the plurality of quests for each group. In this case, the game server 100 may cause the difficulty of the hurdle quest to be adjusted by notifying the game developer of information related to the hurdle quest before game players leave. Alternatively, the game server 100 may directly adjust the difficulty of the hurdle quest. Accordingly, the game server 100 can prevent game players from leaving the game in advance. Hereinafter, a method for detecting hurdles in a game according to the present disclosure will be described in more detail with reference to FIG. 2 .

2 is a flowchart illustrating an example of a method for a game server to detect a huddle in a game according to some embodiments of the present disclosure. 3 is a graph for explaining an example of time required to perform a plurality of quests for each group according to some embodiments of the present disclosure. 4 is a graph for explaining an example of a hurdle quest according to some embodiments of the present disclosure.

Referring to FIG. 2 , the processor 110 of the game server 100 may group a plurality of game players into a plurality of groups based on game play logs of the plurality of game players who have performed a plurality of quests (S110). .

In the present disclosure, the processor 110 may group a plurality of game players into a plurality of groups by using in-game information of each of the plurality of game players.

Specifically, the processor 110 may calculate the combat strength of each of a plurality of game players based on the game play log. Here, combat power may be an index for indicating the degree of strength of the game player. For example, combat power may be determined through the level of the game player, equipment possessed by the game player, pets, or achievements completed by the game player. Also, the processor 110 may group the plurality of game players into a plurality of groups based on the combat power of each of the plurality of game players.

As an example, the processor 110 may group the game players into four groups according to combat strength. A first group among the four groups may be a group of game players whose combat strength is 96% to 100%. In other words, the first group may be a group of game players with combat power in the top 5%. The second group may be a group of game players whose combat strength is between 51% and 95%. The third group may be a group of game players whose combat strength is between 6% and 50%. Finally, the fourth group may be a group of game players whose combat strength is between 0% and 5%. In other words, the fourth group may be a group of game players with combat power in the lower 5%. However, the criterion for grouping the game players according to combat power is not limited to the above example, and the processor 110 may group a plurality of game players so that the combat power of each section is constantly reduced. For example, the processor 110 may create four groups so that the combat power of each section is reduced (or increased) by 25%.

Meanwhile, the processor 110 of the game server 100 may determine the time required to clear each of a plurality of quests for each of a plurality of groups based on the game play log (S120).

Specifically, the processor 110 may determine the time required for each of the at least one player belonging to the first group among the plurality of groups to clear each of the plurality of quests. In this case, the processor 110 may determine the average of the time required for each of the at least one player to clear each of the plurality of quests as the time required for the first group to clear the plurality of quests. Alternatively, the processor 110 may determine that the longest time among the times required for each of the at least one player to clear each of the plurality of quests is the time required for the first group to clear the plurality of quests. Alternatively, the processor 110 may determine the shortest time among the times required for each of the at least one player to clear each of the plurality of quests as the time required for the first group to clear the plurality of quests.

For example, referring to (a) of FIG. 3 , the processor 110 determines the time required for each of at least one player belonging to a first group among a plurality of groups to clear a plurality of quests, and displays it as a graph. can Here, the x-axis of the graph shown in (a) of FIG. 3 may represent the progress of the quest, and the y-axis may represent the required time. Also, the first line 210 may be a line showing the time required for the first group to clear each of the plurality of quests.

Meanwhile, (b) of FIG. 3 may be a graph showing a time required for each of at least one player belonging to a second group among a plurality of groups to clear a plurality of quests. Also, the second line 220 in (b) of FIG. 3 may be a line showing the time required for the second group to clear each of the plurality of quests. Here, the second group may be a group with lower combat power than the first group. Accordingly, it can be confirmed that it takes a longer time for the second group to clear each of the plurality of quests than the first group. However, it is not limited thereto.

Meanwhile, referring to FIG. 2 again, the processor 110 of the game server 100 may determine at least one hurdle quest related to each of a plurality of groups based on the required time for each group (S130).

For example, the processor 110 may determine at least one quest in which an average of required times of a plurality of groups is equal to or longer than a preset time among a plurality of quests as a hurdle quest.

As another example, the processor 110 may determine, as a hurdle quest, at least one quest for which a required time of at least one group among a plurality of groups is longer than a preset time. Here, at least one group may be a group belonging to a higher combat power among a plurality of groups. The fact that it took a long time to complete a specific quest despite its high combat power may indicate that it is a difficult quest. Accordingly, the processor 110 may determine, as a hurdle quest, at least one quest in which a required time of a group belonging to a higher combat power among a plurality of groups is longer than a preset time. However, it is not limited thereto.

As another example, the processor 110 may assign different weights to each of the plurality of groups. For example, the processor 110 may assign a higher weight to a group with a higher combat power than a group with a low combat power among a plurality of groups. Also, the processor 110 may determine at least one hurdle quest related to each of the plurality of groups based on the weighted time required for each of the plurality of groups. However, it is not limited thereto.

Meanwhile, according to some embodiments of the present disclosure, the processor 110 of the game server 100 may determine at least one hurdle quest based on a Z-score for the required time of each of a plurality of quests. . Here, the Z-score may be a value indicating how many times the required time for each of the plurality of quests is separated from the average by a standard deviation. Hereinafter, a method for the processor 110 to determine at least one hurdle quest based on the Z-score for the required time of each of a plurality of quests will be described with reference to FIG. 5 .

Meanwhile, when at least one hurdle quest is determined, the processor 110 may display at least one hurdle quest in the graph of FIG. 3 .

For example, referring to (a) of FIG. 4 , the processor 110 determines the time required for each of at least one player belonging to a first group among a plurality of groups to clear a plurality of quests, and displays them as a graph. can Here, the x-axis of the graph shown in (a) of FIG. 4 may represent the progress of the quest, and the y-axis may represent the required time. The first line 210 may be a line showing the time required for the first group to clear each of the plurality of quests. Also, when at least one hurdle quest is determined, the processor 110 may indicate each of the at least one hurdle quest as a first point 211 . However, it is not limited thereto.

Meanwhile, (b) of FIG. 4 may be a graph showing time required for each of at least one player belonging to a second group among a plurality of groups to clear a plurality of quests and at least one hurdle quest. Specifically, the second point 221 in (b) of FIG. 4 may be a hurdle quest determined based on the time required for at least one player belonging to the second group to clear the plurality of quests. However, it is not limited thereto.

According to the configuration described above, the processor 110 of the game server 100 may determine at least one hurdle quest related to each of the plurality of groups based on the required time for each of the plurality of groups. Here, the plurality of groups may be groups grouped based on the combat power of each of the plurality of game players. Accordingly, the processor 110 may accurately identify a hurdle quest that may be difficult for a plurality of game players.

Meanwhile, according to some embodiments of the present disclosure, the processor 110 of the game server 100 may determine at least one hurdle quest based on the Z-score for the required time of each of the plurality of quests. Hereinafter, a method for the processor 110 to determine at least one hurdle quest based on a Z-score for the required time of each of a plurality of quests will be described.

5 is a flowchart illustrating an example of a method for determining a hurdle quest based on a Z-score by a game server according to some embodiments of the present disclosure. 6 is a graph for explaining an example of a Z-score according to some embodiments of the present disclosure.

Referring to FIG. 5 , the processor 110 of the game server 100 determines a Z-score for the required time of each of at least one quest included in a window determined based on a first parameter among a plurality of quests. It can (S131). Here, the window may indicate the size of data, the range of data, or the number of data. Also, the first parameter may be a parameter for determining a window. For example, if there are 600 quests and the first parameter indicates 100 windows, the processor 110 may determine 100 quests among the 600 quests. Also, the processor 110 may determine a Z-score for the required time of each of the 100 quests. However, it is not limited thereto.

Meanwhile, the Z-score may be a value indicating how many times the required time for each of the plurality of quests is separated from the average by a standard deviation. For example, the processor 110 for the required time of each of the at least one quest,

The Z-score can be determined through an equation such as Here, x may be a value representing a required time for each of at least one quest. Further, μ may be a value representing an average of required times of at least one quest. And, σ may be a standard deviation. However, it is not limited thereto.

Meanwhile, according to some embodiments of the present disclosure, the processor 110 of the game server 100 may determine a Z-score for a first quest among at least one quest. In this case, the processor 110 may determine the Z-score for the required time related to the first quest based on the third parameter indicating the degree of influence with the second quest, which is a quest prior to the first quest.

For example, the first quest and the second quest may be independent quests, but may also be related to each other. Accordingly, the processor 110 may determine the Z-score for the required time related to the first quest based on the third parameter indicating the degree of influence between the first quest and the second quest. However, it is not limited thereto.

Meanwhile, the processor 110 of the game server 100 may determine the threshold range based on at least one factor used in calculating the Z-score and the second parameter (S132).

Specifically, the processor 110 may determine the critical range for the required time of each of the at least one quest through the following equation.

Here, μ and σ may be the same factors used when calculating the Z-score for the required time of each of the at least one quest. And, the second parameter may be a threshold value. In other words, the processor 110 may determine the threshold range based on at least one factor and the threshold value used in calculating the Z-score. However, it is not limited thereto.

Meanwhile, the processor 110 of the game server 100 may determine, among at least one quest, a quest having a peak having a Z-score outside a critical range as at least one hurdle quest (S133).

For example, referring to FIG. 6 , a third line 410 may be a Z-score for required time of each of at least one quest. Also, reference numeral 420 may be a threshold range. Also, in the third line 410, each reference numeral 411 may be a peak of a Z-score for required time of each of at least one quest. Here, the peak 411 may be a peak that does not deviate from a threshold range. Also, reference numeral 412 may be a peak whose Z-score is out of a critical range. As the peak 412 outside the threshold range is determined, the processor 110 may determine the quest having the peak 412 outside the threshold range as at least one hurdle quest. However, it is not limited thereto.

According to the configuration described above, the processor 110 of the game server 100 may determine the Z-score for the required time of each of the at least one quest. Also, the processor 110 may determine a quest having a peak having a Z-score outside a critical range among at least one quest as at least one hurdle quest. In this case, reliability of the determined hurdle quest may be high.

Meanwhile, according to some embodiments of the present disclosure, when the Z-score is determined, the game server 100 may set scores for all peaks included in the Z-score. And, the game server 100 may store the value of each of at least one parameter used to determine the Z-score based on the set score. Hereinafter, an example of how the game server 100 according to the present disclosure sets scores for all peaks will be described with reference to FIG. 7 .

Referring to FIG. 7 , when the Z-score is determined, the processor 110 of the game server 100 may recognize all peaks included in the Z-score and align all peaks (S210). Here, all peaks may be all peaks included in the Z-score regardless of the threshold range. For example, the processor 110 may sort all recognized peaks in ascending or descending order. However, it is not limited thereto.

Meanwhile, the processor 110 of the game server 100 may generate a predetermined number of sections based on all sorted peaks (S220).

Meanwhile, according to some embodiments of the present disclosure, the number of at least one peak included in each section may not be the same. For example, if the number of all peaks is 30, the processor 110 may sort all peaks in descending order. In this case, the processor 110 may generate a first interval including peaks from the first peak to the 18th peak. In other words, the first section may be a peak corresponding to the lower 60%. Then, the processor 110 may generate a second section including the 19th peak to the 21st peak, and generate a third section including the 22nd peak to the 24th peak. Also, the processor 110 may generate a fourth interval including peaks from the 25th peak to the 27th peak. Also, the processor 110 may generate a fifth section including peaks from the 28th peak to the 30th peak. In other words, the fifth section may be a peak corresponding to the top 10%. However, it is not limited thereto.

Meanwhile, the processor 110 of the game server 100 may set a preset score for each of a preset number of sections (S230).

For example, the processor 110 may set -4 points in the first section. Also, the processor 110 may set -3 points in the second section and -2 points in the third section. Also, the processor 110 may set a -1 point in the fourth section and +3 points in the fifth section. In this case, the processor 110 may store in the database unit 120 scores set for all peaks, a preset number of sections, and each of a preset number of sections. However, the score set for each of the predetermined number of sections is not limited to the above example.

Meanwhile, according to some embodiments of the present disclosure, the processor 110 may determine at least one hurdle quest among at least one quest based on scores set for each section.

Specifically, the processor 110 may determine the Z-score for the required time of each of the at least one quest using the first parameter and the third parameter. Also, the processor 110 may determine the threshold range using at least one factor used in calculating the Z-score and the second parameter. In this case, the processor 110 may determine at least one first peak whose Z-score is out of a threshold range. Also, the processor 110 may increase or decrease a value of at least one of the first to third parameters to determine at least one second peak. In this case, the processor 110 may determine scores of at least one first peak and at least one second peak. Also, the processor 110 may determine a quest having a peak having a high score among at least one first peak and at least one second peak as at least one hurdle quest. However, it is not limited thereto.

Meanwhile, according to some embodiments of the present disclosure, the processor 110 of the game server 100 stores the value of at least one parameter used to determine at least one first peak and at least one second peak in a database unit ( 120) can be stored. In addition, the processor 110 may also store in the database unit 120 scores set for all peaks, a preset number of sections, and each of a preset number of sections. In this case, the processor 110 may use the value of the at least one parameter when determining a hurdle quest with respect to at least one other quest. Hereinafter, a method for the processor 110 to store one of a parameter value used to determine at least one first peak or a parameter value used to determine at least one second peak will be described.

Referring to FIG. 8 , the processor 110 of the game server 100 increases or decreases the value of at least one of the first parameter, the second parameter, and the third parameter to detect at least one first peak outside the threshold range. It can be determined (S310).

Specifically, the processor 110 may increase or decrease the value of at least one of the first parameter and the third parameter to determine the Z-score for the required time of each of the at least one quest. Also, the processor 110 may determine the threshold range by increasing or decreasing the value of at least one factor used in calculating the Z-score and the value of the second parameter. In this case, the processor 110 may determine at least one first peak outside the threshold range. However, it is not limited thereto.

Meanwhile, the processor 110 of the game server 100 may recognize a first score set in a section corresponding to each of the at least one first peak (S320).

Specifically, the database unit 120 may store scores set for all peaks, a preset number of sections, and each of a preset number of sections. Accordingly, the processor 110 may recognize a first score set in a section corresponding to each of the at least one first peak. However, it is not limited thereto.

Meanwhile, the processor 110 of the game server 100 increases or decreases the value of at least one parameter among the first parameter, the second parameter, and the third parameter so that a peak different from the at least one first peak is determined. At least one second peak outside the range may be determined (S330).

Specifically, the processor 110 may increase or decrease the value of at least one parameter so that a value different from the value of the at least one parameter used in step S310 is used. In this case, the processor 110 may determine at least one second peak different from the at least one first peak. However, it is not limited thereto.

Meanwhile, the processor 110 of the game server 100 may recognize a second score set in a section corresponding to each of the at least one second peak (S340).

Specifically, the processor 110 calculates the number of peaks stored in the database unit 120, the preset number of intervals, and the scores set for each of the preset number of intervals, based on the scores set for each of the at least one second peak. A second score can be recognized. However, it is not limited thereto.

Meanwhile, the processor 110 of the game server 100 determines the value of the parameter used to determine the at least one first peak or the at least one second peak based on the comparison between the first score and the second score. One of the used parameter values may be stored (S350).

Specifically, the processor 110 may determine a relatively high score by comparing the first score and the second score. In addition, the processor 110 may store in the database unit 120 a value of a parameter used to determine at least one peak having a relatively high score. Also, the processor 110 may use the value of the at least one parameter when determining a hurdle quest with respect to at least one other quest. In this case, in determining a hurdle quest for at least one other quest, the processor 110 may quickly determine a hurdle quest using a value of a predetermined parameter without having to increase or decrease several parameters to determine the hurdle quest. In addition, since the value of the parameter stored in the database unit 120 is a value determined based on a comparison of a plurality of scores, reliability of the determined hurdle quest may be high when the value of the parameter is used.

Meanwhile, according to some embodiments of the present disclosure, when at least one hurdle quest is determined, the game server 100 may determine the order of the at least one hurdle quest according to the degree of risk. Here, the degree of risk may be a value representing a degree of danger of at least one hurdle quest. That is, it may be necessary to prioritize the difficulty level of a hurdle quest with a high risk. Hereinafter, a method for determining the ranking of at least one hurdle quest according to the degree of risk in the game server 100 according to the present disclosure will be described.

FIG. 9 is a flowchart illustrating an example of a method for a game server to determine a rank of at least one hurdle quest according to a degree of risk according to some embodiments of the present disclosure. 10 is a graph for explaining an example of a hurdle quest in which a ranking is determined according to some embodiments of the present disclosure.

Referring to FIG. 9 , when at least one hurdle quest is determined, the processor 110 of the game server 100 may determine a risk level of each of the at least one hurdle quest (S410).

Specifically, the processor 110 determines the ratio of players who have made billing among the plurality of players included in each of the plurality of groups, the billing amount of the plurality of game players included in each of the plurality of groups, and the plurality of players included in each of the plurality of groups. A risk level of each of the at least one hurdle quest may be determined based on at least one of the number of billings of the game player. Here, billing may mean purchasing in-game items or goods with real money.

For example, the processor 110 may determine that the risk of at least one hurdle quest is higher as the ratio of players who have paid is higher among the plurality of players included in each of the plurality of groups. In addition, the processor 110 may determine that the risk of at least one hurdle quest increases as the billing amounts of the plurality of game players included in each of the plurality of groups and the number of billings increase. However, it is not limited thereto.

On the other hand, according to some embodiments of the present disclosure, the ratio of players who have performed billing, the billing amount, and the number of billings may each have different weights. For example, the processor 110 may determine the degree of risk of each of the at least one hurdle quest by using different weights assigned to the ratio of players who have been charged, the amount of billing, and the number of times of billing. However, it is not limited thereto.

Meanwhile, the processor 110 of the game server 100 may determine the order of at least one hurdle quest according to the degree of risk (S420). Also, when the ranking of the at least one quest is determined, the processor 110 may indicate the ranking of the at least one hurdle quest in a graph.

For example, referring to FIG. 10 , a first line 210 may be a line showing the time required for the first group to clear each of a plurality of quests. Also, the first point 211 may represent each of at least one hurdle quest. In addition, hurdle points 212 may be displayed for a preset number of hurdle quests determined to have a high risk among at least one hurdle quest. In other words, the hurdle points 212 may be points representing a preset number of hurdle quests determined to have a high risk among at least one hurdle quest. However, it is not limited thereto.

According to the configuration described above, the game server 100 may determine at least one hurdle quest among a plurality of quests in the game. In addition, when at least one hurdle quest is determined, a ranking may be determined according to a degree of risk. As the ranking of at least one hurdle quest is determined, the game server 100 may cause the difficulty of the hurdle quest to be adjusted by notifying the game developer of information related to the hurdle quest. Alternatively, the game server 100 may directly adjust the difficulty of the hurdle quest. In this case, the game server 100 may preferentially adjust the difficulty of a high-ranking hurdle quest. Accordingly, the game server 100 can prevent game players from leaving the game in advance.

Although the present disclosure has generally been described above in terms of computer-executable instructions that can be executed on one or more computers, those skilled in the art will appreciate that the present disclosure may be implemented in combination with other program modules and/or as a combination of hardware and software. will know

Generally, modules herein include routines, procedures, programs, components, data structures, etc. that perform particular tasks or implement particular abstract data types. It will also be appreciated by those skilled in the art that the methods of the present disclosure may be used in single-processor or multiprocessor computer systems, minicomputers, mainframe computers, as well as personal computers, handheld computing devices, microprocessor-based or programmable consumer electronics, and the like (each of which is It will be appreciated that other computer system configurations may be implemented, including those that may be operative in connection with one or more associated devices.

The described embodiments of the present disclosure may also be practiced in distributed computing environments where certain tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

A computer typically includes a variety of computer readable media. Media accessible by a computer includes volatile and nonvolatile media, transitory and non-transitory media, removable and non-removable media. By way of example, and not limitation, computer readable media may include computer readable storage media and computer readable transmission media.

Computer readable storage media are volatile and nonvolatile media, transitory and non-transitory, 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. includes media Computer readable storage media may include RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital video disk (DVD) or other optical disk storage device, magnetic cassette, magnetic tape, magnetic disk storage device or other magnetic storage device. device, or any other medium that can be accessed by a computer and used to store desired information.

A computer readable transmission medium typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism. Including all information delivery media. The term modulated data signal means a signal that has one or more of its characteristics set or changed so as to encode information within the signal. By way of example, and not limitation, computer readable transmission media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared, and other wireless media. Combinations of any of the above are also intended to be included within the scope of computer readable transmission media.

An exemplary environment 1100 implementing various aspects of the present disclosure is shown including a computer 1102, which includes a processing unit 1104, a system memory 1106, and a system bus 1108. do. System bus 1108 couples system components, including but not limited to system memory 1106 , to processing unit 1104 . Processing unit 1104 may be any of a variety of commercially available processors. Dual processor and other multiprocessor architectures may also be used as the processing unit 1104.

System bus 1108 may be any of several types of bus structures that may additionally be interconnected to a memory bus, a peripheral bus, and a local bus using any of a variety of commercial bus architectures. System memory 1106 includes read only memory (ROM) 1110 and random access memory (RAM) 1112 . A basic input/output system (BIOS) is stored in non-volatile memory 1110, such as ROM, EPROM, or EEPROM, and is a basic set of information that helps transfer information between components within computer 1102, such as during startup. contains routines. RAM 1112 may also include high-speed RAM, such as static RAM, for caching data.

The computer 1102 may also include an internal hard disk drive (HDD) 1114 (eg, EIDE, SATA) - the internal hard disk drive 1114 may also be configured for external use within a suitable chassis (not shown). Yes—a magnetic floppy disk drive (FDD) 1116 (e.g., for reading from or writing to removable diskette 1118), and an optical disk drive 1120 (e.g., CD-ROM) for reading disc 1122 or reading from or writing to other high capacity optical media such as DVDs). The hard disk drive 1114, magnetic disk drive 1116, and optical disk drive 1120 are connected to the system bus 1108 by a hard disk drive interface 1124, magnetic disk drive interface 1126, and optical drive interface 1128, respectively. ) can be connected to The interface 1124 for external drive implementation includes, for example, at least one or both of Universal Serial Bus (USB) and IEEE 1394 interface technologies.

These drives and their associated computer readable media provide non-volatile storage of data, data structures, computer executable instructions, and the like. In the case of computer 1102, drives and media correspond to storing any data in a suitable digital format. Although the description of computer-readable storage media above refers to HDDs, removable magnetic disks, and removable optical media such as CDs or DVDs, those skilled in the art can use zip drives, magnetic cassettes, flash memory cards, cartridges, It will be appreciated that other types of storage media readable by the computer may also be used in the exemplary operating environment and any such media may include computer executable instructions for performing the methods of the present disclosure. .

A number of program modules may be stored on the drive and RAM 1112, including an operating system 1130, one or more application programs 1132, other program modules 1134, and program data 1136. All or portions of the operating system, applications, modules and/or data may also be cached in RAM 1112. It will be appreciated that the present disclosure may be implemented in a variety of commercially available operating systems or combinations of operating systems.

A user may enter commands and information into the computer 1102 through one or more wired/wireless input devices, such as a keyboard 1138 and a pointing device such as a mouse 1140. Other input devices (not shown) may include a microphone, IR remote control, joystick, game pad, stylus pen, touch screen, and the like. Although these and other input devices are often connected to the processing unit 1104 through an input device interface 1142 that is connected to the system bus 1108, a parallel port, IEEE 1394 serial port, game port, USB port, IR interface, may be connected by other interfaces such as the like.

A monitor 1144 or other type of display device is also connected to the system bus 1108 through an interface such as a video adapter 1146. In addition to the monitor 1144, computers typically include other peripheral output devices (not shown) such as speakers, printers, and the like.

Computer 1102 may operate in a networked environment using logical connections to one or more remote computers, such as remote computer(s) 1148 via wired and/or wireless communications. Remote computer(s) 1148 may be a workstation, server computer, router, personal computer, handheld computer, microprocessor-based entertainment device, peer device, or other common network node, and may generally refer to computer 1102. Although many or all of the described components are included, for brevity, only memory storage device 1150 is shown. The logical connections shown include wired/wireless connections to a local area network (LAN) 1152 and/or a larger network, such as a wide area network (WAN) 1154 . Such LAN and WAN networking environments are common in offices and corporations and facilitate enterprise-wide computer networks, such as intranets, all of which can be connected to worldwide computer networks, such as the Internet.

When used in a LAN networking environment, computer 1102 connects to local network 1152 through wired and/or wireless communication network interfaces or adapters 1156. Adapter 1156 may facilitate wired or wireless communications to LAN 1152, which also includes a wireless access point installed therein to communicate with wireless adapter 1156. When used in a WAN networking environment, computer 1102 may include a modem 1158, be connected to a communications server on WAN 1154, or other device that establishes communications over WAN 1154, such as over the Internet. have the means A modem 1158, which may be internal or external and a wired or wireless device, is connected to the system bus 1108 through a serial port interface 1142. In a networked environment, program modules described for computer 1102, or portions thereof, may be stored on remote memory/storage device 1150. It will be appreciated that the network connections shown are exemplary and other means of establishing a communication link between computers may be used.

Computer 1102 is any wireless device or entity that is deployed and operating in wireless communication, eg, printers, scanners, desktop and/or portable computers, portable data assistants (PDAs), communication satellites, wireless detectable tags associated with It operates to communicate with arbitrary equipment or places and telephones. This includes at least Wi-Fi and Bluetooth wireless technologies. Thus, the communication may be a predefined structure as in conventional networks or simply an ad hoc communication between at least two devices.

Wi-Fi (Wireless Fidelity) makes it possible to connect to the Internet without wires. Wi-Fi is a wireless technology, such as a cell phone, that allows such devices, eg, computers, to transmit and receive data both indoors and outdoors, i.e. anywhere within coverage of a base station. Wi-Fi networks use a radio technology called IEEE 802.11 (a,b,g, etc.) to provide secure, reliable, and high-speed wireless connections. Wi-Fi can be used to connect computers to each other, to the Internet, and to wired networks (using IEEE 802.3 or Ethernet). Wi-Fi networks can operate in the unlicensed 2.4 and 5 GHz radio bands, for example, at 11 Mbps (802.11a) or 54 Mbps (802.11b) data rates, or on products that include both bands (dual band). there is.

Those skilled in the art will understand that the various illustrative logical blocks, modules, processors, means, circuits, and algorithm steps described in connection with the embodiments disclosed herein are electronic hardware, (for convenience) , may be implemented by various forms of program or design code (referred to herein as “software”) or a combination of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends on the particular application and the design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

Various embodiments presented herein may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques. The term "article of manufacture" includes a computer program or media accessible from any computer-readable device. For example, computer-readable storage media include magnetic storage devices (eg, hard disks, floppy disks, magnetic strips, etc.), optical disks (eg, CDs, DVDs, etc.), smart cards, and flash memory devices (eg, EEPROM, cards, sticks, key drives, etc.), but are not limited thereto. The term “machine-readable medium” includes, but is not limited to, wireless channels and various other media that can store, hold, and/or convey instruction(s) and/or data.

The description of the presented embodiments is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these embodiments will be apparent to those skilled in the art of this disclosure, and the general principles defined herein may be applied to other embodiments without departing from the scope of this disclosure. Thus, the present disclosure is not to be limited to the embodiments presented herein, but is to be interpreted in the widest scope consistent with the principles and novel features presented herein.

As described above, the related contents have been described in the best mode for carrying out the invention.

It can be used for a computing device, system, etc. for measuring hurdles in a game.

Claims

As a method for detecting hurdles in the game,

grouping the plurality of game players into a plurality of groups based on game play logs of the plurality of game players who performed the plurality of quests;

determining a time required to clear each of the plurality of quests for each of the plurality of groups based on the game play log; and

determining at least one hurdle quest related to each of the plurality of groups based on the required time for each of the plurality of groups;

including,

How to detect in-game huddles.
According to claim 1,

Grouping the plurality of game players into a plurality of groups based on the game play logs of the plurality of game players who performed the plurality of quests,

Calculating combat strength of each of the plurality of game players based on the game play log; and

grouping the plurality of game players into the plurality of groups based on the combat strength of each of the plurality of game players;

including,

How to detect in-game huddles.
According to claim 1,

Determining at least one hurdle quest related to each of the plurality of groups based on the required time for each of the plurality of groups,

determining a Z-score for a required time of each of at least one quest included in a window determined based on a first parameter among the plurality of quests;

determining a threshold range based on at least one factor and a second parameter used in calculating the Z-score; and

determining, among the at least one quest, a quest having a peak in which the Z-score is out of the threshold range as the at least one hurdle quest;

including,

How to detect in-game huddles.
According to claim 3,

Determining a Z-score for the required time of each of the at least one quest included in the window determined based on the first parameter among the plurality of quests,

When determining the Z-score for the first quest among the at least one quest, the requirements related to the first quest are determined based on a third parameter representing the degree of influence with the second quest, which is a quest prior to the first quest. determining a Z-score over time;

including,

How to detect in-game huddles.
According to claim 4,

When the Z-score is determined, recognizing all peaks included in the Z-score and aligning all the peaks;

generating a preset number of sections based on all the sorted peaks; and

setting a preset score for each of the preset number of sections;

Including more,

How to detect in-game huddles.
According to claim 5,

determining at least one first peak outside the threshold range by increasing or decreasing a value of at least one of the first parameter, the second parameter, and the third parameter;

Recognizing a first score set in a section corresponding to each of the at least one first peak;

At least one second peak outside the threshold range is obtained by increasing or decreasing the value of at least one of the first parameter, the second parameter, and the third parameter so that a peak different from the at least one first peak is determined. determining peaks;

Recognizing a second score set in a section corresponding to each of the at least one second peak; and

storing one of a value of a parameter used to determine the at least one first peak or a value of a parameter used to determine the at least one second peak based on a comparison between the first score and the second score; doing;

Including more,

How to detect in-game huddles.
According to claim 1,

determining a risk level of each of the at least one hurdle quest when the at least one hurdle quest is determined; and

determining a rank of the at least one hurdle quest according to the degree of risk;

Including more,

How to detect in-game huddles.
According to claim 7,

The risk level is

The ratio of players who have made billing among the plurality of players included in each of the plurality of groups, the billing amount of the plurality of game players included in each of the plurality of groups, and the plurality of games included in each of the plurality of groups Determined based on at least one of the player's billing counts,

How to detect in-game huddles.
According to claim 8,

The ratio of players who performed the billing, the billing amount, and the number of billings each have different weights.

How to detect in-game huddles.