KR102592559B1 - Method for detecting hurdles in game - Google Patents

Abstract

A method for detecting a huddle in a game is disclosed, according to some embodiments of the present disclosure. The method for detecting in-game hurdles includes 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 time required for each of the plurality of groups.

Description

{METHOD FOR DETECTING HURDLES IN GAME}

This disclosure relates to a method for detecting hurdles in a game, and specifically relates to a method for detecting hurdle quests in a game that may cause difficulties for users.

As the online game market becomes more active, the types of online games that game players can play are also increasing. As the types of online games increase, game players may look for other online games if they feel dissatisfied with the game they are playing.

In order to prevent game players from leaving, game developers use various methods to identify points where game players have a high dropout rate. In addition, game developers sometimes adjust the difficulty of quests in cases where quests are related to points where game player abandonment rates are found to be high.

However, in cases where the difficulty of the quest is adjusted based on the dropout rate, it may already be too late to respond. 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 fixing a barn after losing a cow.

Therefore, before a player leaves the game, it may be necessary to develop a method to detect quests where withdrawal is predicted.

Republic of Korea registered patent 10-1733458

The present disclosure was devised in response to the above-described background technology, and seeks 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 description below.

According to an embodiment of the present disclosure to solve the above-described problem, a method for detecting a huddle in a game is disclosed. The method for detecting in-game hurdles includes 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 time required for each of the plurality of groups. may include.

In addition, the step of grouping a 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 includes determining the combat power of each of the plurality of game players based on the game play logs. calculating step; and grouping the plurality of game players into the plurality of groups based on the combat power of each of the plurality of game players; may include.

In addition, the step of determining at least one hurdle quest related to each of the plurality of groups based on the time required 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 time required for each quest; determining a critical range based on at least one factor and a second parameter used when calculating the Z-score; and determining, among the at least one quest, a quest whose Z-score has a peak outside the critical range as the at least one hurdle quest; may include.

In addition, the step of determining a Z-score for the time required for each of the at least one quest included in the window determined based on the first parameter among the plurality of quests includes: When determining the Z-score for the first quest, determining the Z-score for the time spent related to the first quest based on a third parameter indicating the degree of influence with the second quest, which is a quest before the first quest. ; may include.

Additionally, 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; It may further include.

Additionally, increasing or decreasing the value of at least one of the first parameter, the second parameter, and the third parameter to determine at least one first peak that is outside the threshold range; Recognizing a first score set in a section corresponding to each of the at least one first peak; The value of at least one of the first parameter, the second parameter, and the third parameter is increased or decreased so that a peak different from the at least one first peak is determined, so that at least one second parameter outside the threshold range 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 the parameter used to determine the at least one first peak or a value of the parameter used to determine the at least one second peak. saving; It may further include.

Additionally, 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 ranking of the at least one hurdle quest according to the risk. It may further include.

In addition, the risk is determined by the ratio of players who performed 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 number of billing times of the plurality of game players included.

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

The technical solutions obtainable from this disclosure are not limited to the solutions mentioned above, and other solutions not mentioned above will be clearly apparent to those skilled in the art from the description below. It will be understandable.

According to some embodiments of the present disclosure, hurdle quests that are expected to cause game players to leave the game are detected, thereby reducing game player abandonment.

The effects that can be obtained from the present disclosure are not limited to the effects mentioned above, and other effects not mentioned can be clearly understood by those skilled in the art from the description below. .

Various aspects will now be described with reference to the drawings, where like reference numerals are used to collectively refer to like elements. In the following examples, for purposes of explanation, numerous specific details are set forth to provide a comprehensive understanding of one or more aspects. However, it will be clear 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 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.
FIG. 2 is a flowchart illustrating an example of a method for a game server to detect in-game hurdles according to some embodiments of the present disclosure.
Figure 3 is a graph illustrating an example of the time required to perform a plurality of quests for each group in some embodiments of the present disclosure.
4 is a graph illustrating an example of a hurdle quest in some embodiments of the present disclosure.
FIG. 5 is a flowchart illustrating an example of a method by which a game server determines a hurdle quest based on the Z-score according to some embodiments of the present disclosure.
FIG. 6 is a graph illustrating an example of Z-score according to some embodiments of the present disclosure.
FIG. 7 is a flowchart illustrating an example of a method in which a game server sets a preset score in each of a preset number of sections based on all peaks included in the Z-score, according to some embodiments of the present disclosure.
8 illustrates a method in which a game server stores one of the value of a parameter used to determine at least one first peak or the value of a parameter used to determine at least one second peak according to some embodiments of the present disclosure. This is a flowchart to explain an example.
FIG. 9 is a flowchart illustrating an example of a method in which a game server determines the ranking of at least one hurdle quest according to risk according to some embodiments of the present disclosure.
10 is a graph illustrating an example of a ranked hurdle quest 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 to facilitate a general understanding of one or more aspects. However, it will also be appreciated by those skilled in the art that this aspect(s) may be practiced without these specific details. The following description and accompanying drawings set forth in detail certain example aspects of one or more aspects. However, these aspects are illustrative and some of the various methods in the principles of the various aspects may be utilized, and the written description is intended to encompass all such aspects and their equivalents. Specifically, as used herein, “embodiment,” “example,” “aspect,” “example,” etc. are not to be construed as indicating that any aspect or design described is better or advantageous over other aspects or designs. Maybe not.

Hereinafter, regardless of the reference numerals, identical or similar components will be assigned the same reference numbers and duplicate descriptions thereof will be omitted. Additionally, in describing the embodiments disclosed in this specification, if it is determined that detailed descriptions of related known technologies may obscure the gist of the embodiments disclosed in this specification, the detailed descriptions will be omitted. In addition, the attached drawings are only intended to facilitate understanding of the embodiments disclosed in this specification, and the technical idea disclosed in this specification is not limited by the attached drawings.

Although first, second, etc. are used to describe various elements or components, these elements or components are of course not limited by these terms. These terms are merely used to distinguish one device or component from another device or component. Therefore, it goes without saying that the first element or component mentioned below may also be a 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 with meanings that can be commonly understood by those skilled in the art to which the present invention pertains. Additionally, terms defined in commonly used dictionaries are not interpreted ideally or excessively unless clearly specifically defined.

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

Additionally, the terms “comprise” and/or “comprising” mean that the feature and/or element is present, but exclude the presence or addition of one or more other features, elements and/or groups thereof. It should be understood as not doing so. Additionally, unless otherwise specified or the context is clear to indicate a singular form, the singular terms herein and in the claims should generally be construed to mean “one or more.”

Additionally, as used herein, the terms “information” and “data” may often be used interchangeably.

When a component is said to be “connected” or “connected” to another component, it is understood that it may be directly connected to or connected to that other component, but that other components may also exist in between. It should be. On the other hand, when it is mentioned that a component is “directly connected” or “directly connected” to another component, it should be understood that there are no other components in between.

The suffixes “module” and “part” for components used in the following description are given or used interchangeably only for the ease of preparing the specification, and do not have distinct meanings or roles in themselves.

The purpose and effects of the present disclosure, and technical configurations for achieving them, will become clear by referring to the embodiments described in detail below along with the accompanying drawings. In explaining 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, the terms described below are terms defined in consideration of the functions in the present disclosure, and may vary depending on the intention or custom of the user or operator.

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

In the present disclosure, the game server may determine a huddle quest among a plurality of quests in the game. Here, a 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 a monster of high difficulty appears, or it may be a quest that takes a long time because it has many repetitive elements. These hurdle quests can be related to the abandonment rate of game players. This is because game players may feel bored during quests that take a long time, which may cause them to quit the game. Hereinafter, a method for determining a hurdle quest by a game server according to the present disclosure will be described through FIGS. 1 to 10.

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

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 for implementing the game server 100, so the game server 100 may have more or less components than the components listed above.

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

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

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

Meanwhile, the database unit 120 may include memory and/or a permanent storage medium. Memory is a flash memory type, hard disk type, multimedia card micro type, card type memory (e.g. SD or XD memory, etc.), and 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 It may include at least one type of storage medium.

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

Meanwhile, the database unit 120 may store information related to at least one peak determined by the processor 110. Here, the peak may represent a point where the time required for a plurality of players to clear each of a plurality of quests is generated as a random graph, and the time required is above a certain value. In other words, a peak can refer to a quest that takes a long time for multiple players to clear. In this case, the processor 110 may determine a quest with a strong peak among the plurality of peaks as at least one hurdle quest. Here, the strong peak may be a peak with a high value such as time required among a plurality of peaks. However, it is not limited to this. Hereinafter, an example of a peak stored in the database unit 120 will be described with reference to FIG. 7.

According to the above-described configuration, the game server 100 can group a plurality of game players. Additionally, the processor 110 may determine a hurdle quest based on the time required to perform a plurality of quests for each group. In this case, the game server 100 may cause the game developer to adjust the difficulty of the hurdle quest 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. Hereinafter, the method for detecting hurdles in a game according to the present disclosure will be further described with reference to FIG. 2.

FIG. 2 is a flowchart illustrating an example of a method for a game server to detect in-game hurdles according to some embodiments of the present disclosure. Figure 3 is a graph illustrating an example of the time required to perform a plurality of quests for each group in some embodiments of the present disclosure. 4 is a graph illustrating an example of a hurdle quest in 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 the 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 using in-game information of each of the plurality of game players.

Specifically, the processor 110 may calculate the combat power of each of the plurality of game players based on the game play log. Here, combat power may be an indicator of the degree of strength of the game player. For example, combat power may be determined through the game player's level, equipment owned by the game player, pets, or achievements completed by the game player. Additionally, 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 game players into four groups according to their combat power. The first group of the four groups may be a group of game players whose combat power is in the range of 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 with a combat power ranging from 51% to 95%. The third group may be a group of game players with a combat power of 6% to 50%. Lastly, the fourth group may be a group of game players with a combat power ranging from 0% to 5%. In other words, the fourth group may be a group of game players with combat power in the bottom 5%. However, the standard for grouping game players according to combat power is not limited to the above-mentioned example, and the processor 110 may group a plurality of game players so that the combat power of each section is uniformly 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 the plurality of quests for each of the plurality of groups based on the game play log (S120).

Specifically, the processor 110 may determine the time required for each of 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 that the average of the time required for each of 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 that the longest time required for each of 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 that the shortest time among the times required for each of 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.

For example, referring to (a) of FIG. 3, the processor 110 determines the time required for each of at least one player belonging to the first group among the plurality of groups to clear the plurality of quests and displays it in a graph. You 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 time required. And, 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, Figure 3(b) may be a graph showing the time required for each of at least one player belonging to the second group among the plurality of groups to clear the plurality of quests. And, the second line 220 in FIG. 3(b) 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 seen that the second group takes a longer time to clear each of the plurality of quests than the first group. However, it is not limited to this.

Meanwhile, referring again to FIG. 2, 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 time required for each of the plurality of groups (S130).

For example, the processor 110 may determine at least one quest among a plurality of quests in which the average time spent by a plurality of groups is more than a preset time as a hurdle quest.

As another example, the processor 110 may determine at least one quest for which the time required for at least one group among the plurality of groups is more than a preset time as a hurdle quest. Here, at least one group may be a group with higher combat power among the plurality of groups. The fact that it took a long time to complete a specific quest despite its combat power being at the top indicates that it was a difficult quest. Accordingly, the processor 110 may determine at least one quest for which the time required for a group with higher combat power among the plurality of groups is more than a preset time as a hurdle quest. However, it is not limited to this.

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 high combat power among a plurality of groups compared to a group with low combat power. Additionally, 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 to this.

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 time required for each of the plurality of quests. . Here, the Z-score may be a value indicating how many times the standard deviation the time required for each of a plurality of quests is away from the average. Hereinafter, a method by which the processor 110 determines at least one hurdle quest based on the Z-score for the time required for each of the 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 the first group among the plurality of groups to clear the plurality of quests and displays it in a graph. You 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 time required. The first line 210 may be a line showing the time required for the first group to clear each of a plurality of quests. Also, when at least one hurdle quest is determined, the processor 110 may indicate each of the at least one hurdle quests as a first point 211. However, it is not limited to this.

Meanwhile, Figure 4(b) may be a graph showing the time required for each of at least one player belonging to the second group among the 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 a plurality of quests. However, it is not limited to this.

According to the above-described configuration, 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 time required 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 can accurately identify hurdle quests that may be difficult for multiple 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 time required for each of the plurality of quests. Hereinafter, a method by which the processor 110 determines at least one hurdle quest based on the Z-score for the time required for each of the plurality of quests will be described.

FIG. 5 is a flowchart illustrating an example of a method by which a game server determines a hurdle quest based on the Z-score according to some embodiments of the present disclosure. FIG. 6 is a graph illustrating an example of 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 time required for each of at least one quest included in the window determined based on the first parameter among the plurality of quests. (S131). Here, the window may indicate the size of data, the range of data, or the number of data. And, the first parameter may be a parameter for determining the 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. Additionally, the processor 110 may determine a Z-score for the time required for each of the 100 quests. However, it is not limited to this.

Meanwhile, the Z-score may be a value indicating how many times the standard deviation the time required for each of a plurality of quests is away from the average. For example, the processor 110 may determine the time required for each of at least one quest, The Z-score can be determined through the following equation. Here, x may be a value representing the time required for each of at least one quest. And μ may be a value representing the average time required for at least one quest. And, σ may be the standard deviation. However, it is not limited to this.

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

For example, the first quest and the second quest may be independent quests, but may also be quests that are related to each other. Accordingly, the processor 110 may determine the Z-score for the time spent 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 to this.

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

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

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

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

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

According to the above-described configuration, the processor 110 of the game server 100 can determine the Z-score for the time required for each of at least one quest. Additionally, the processor 110 may determine a quest having a peak whose Z-score is outside the critical range among at least one quest as at least one hurdle quest. In this case, the reliability of the decided 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. Additionally, 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 a method by which the game server 100 according to the present disclosure sets scores for all peaks will be described with reference to FIG. 7.

FIG. 7 is a flowchart illustrating an example of a method in which a game server sets a preset score in each of a preset number of sections based on all peaks included in the Z-score, according to some embodiments of the present disclosure.

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 critical range. As an example, processor 110 may sort all recognized peaks in ascending or descending order. However, it is not limited to this.

Meanwhile, the processor 110 of the game server 100 may generate a preset 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, the number of all peaks is 30, and the processor 110 may sort all peaks in descending order. In this case, the processor 110 may generate a first section including peaks from the first peak to the 18th peak. In other words, the first section may be a peak corresponding to the bottom 60%. Additionally, the processor 110 may generate a second section including peaks from the 19th peak to the 21st peak, and generate a third section including peaks from the 22nd peak to the 24th peak. Additionally, the processor 110 may generate a fourth section including peaks from the 25th peak to the 27th peak. Additionally, 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 to this.

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

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

Specifically, the processor 110 may determine the Z-score for the time required for each of at least one quest using the first parameter and the third parameter. Additionally, the processor 110 may determine the threshold range using at least one factor and a second parameter used when calculating the Z-score. In this case, the processor 110 may determine at least one first peak whose Z-score is outside the threshold range. Additionally, the processor 110 may determine at least one second peak by increasing or decreasing the value of at least one parameter among the first to third parameters. In this case, the processor 110 may determine scores of at least one first peak and at least one second peak. Additionally, the processor 110 may determine a quest having a peak with 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 to this.

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). Additionally, the processor 110 may store all peaks, a preset number of sections, and scores set for each of the preset number of sections in the database unit 120. In this case, the processor 110 may use the value of the at least one parameter when determining a hurdle quest for at least one other quest. Hereinafter, a method by which the processor 110 stores one of the value of the parameter used to determine at least one first peak or the value of the parameter used to determine at least one second peak will be described.

8 illustrates a method in which a game server stores one of the value of a parameter used to determine at least one first peak or the value of a parameter used to determine at least one second peak according to some embodiments of the present disclosure. This is a flowchart to explain an example.

Referring to FIG. 8, 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, thereby increasing at least one first peak that is outside the threshold range. You can decide (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 time required for each of the at least one quest. Additionally, the processor 110 may determine the threshold range by increasing or decreasing the value of at least one factor and the second parameter used when calculating the Z-score. In this case, the processor 110 may determine at least one first peak that is outside the threshold range. However, it is not limited to this.

Meanwhile, the processor 110 of the game server 100 may recognize the first score set in the section corresponding to each of 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 the first score set in the section corresponding to each of the at least one first peak. However, it is not limited to this.

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, thereby determining the threshold. At least one second peak that is out of 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 that is different from the at least one first peak. However, it is not limited to this.

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

Specifically, the processor 110 sets a score in a section corresponding to each of at least one second peak, based on all peaks stored in the database unit 120, a preset number of sections, and scores set in each of the preset number of sections. The second score can be recognized. However, it is not limited to this.

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

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

Meanwhile, according to some embodiments of the present disclosure, when at least one hurdle quest is determined, the game server 100 may determine the ranking of the at least one hurdle quest according to the degree of risk. Here, the risk may be a value indicating the degree of risk of at least one hurdle quest. In other words, there may be a need to prioritize the difficulty of a high-risk hurdle quest. Hereinafter, a method by which the game server 100 according to the present disclosure determines the ranking of at least one hurdle quest according to the degree of risk will be described.

FIG. 9 is a flowchart illustrating an example of a method in which a game server determines the ranking of at least one hurdle quest according to risk according to some embodiments of the present disclosure. 10 is a graph illustrating an example of a ranked hurdle quest 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 the risk level of each of the at least one hurdle quest (S410).

Specifically, the processor 110 calculates the ratio of players who have performed 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. The risk of each of at least one hurdle quest may be determined based on at least one of the number of billing times of the game player. Here, charging may mean purchasing in-game items or goods with real money.

For example, the processor 110 may determine that the higher the ratio of players who have paid among the plurality of players included in each of the plurality of groups, the higher the risk of at least one hurdle quest. Additionally, the processor 110 may determine that the risk of at least one hurdle quest is higher as the billing amount of a plurality of game players included in each of the plurality of groups is larger and the number of billing times is greater. However, it is not limited to this.

Meanwhile, according to some embodiments of the present disclosure, the ratio of players who performed charging, the charging amount, and the charging number may each have different weights. For example, the processor 110 may determine the risk of each of at least one hurdle quest using different weights assigned to the ratio of players who have performed charging, the charging amount, and the charging number, respectively. However, it is not limited to this.

Meanwhile, the processor 110 of the game server 100 may determine the ranking of at least one hurdle quest according to the level of risk (S420). Also, when the ranking of at least one quest is determined, the processor 110 may display the ranking on a graph showing at least one hurdle quest.

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

According to the above-described configuration, the game server 100 can determine at least one hurdle quest among a plurality of quests in the game. Additionally, if at least one hurdle quest is determined, the ranking can be determined according to risk. As the ranking of at least one hurdle quest is determined, the game server 100 may cause the game developer to adjust the difficulty of the hurdle quest 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 high-ranking hurdle quests. Accordingly, the game server 100 can prevent game players from leaving the game.

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

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

Generally, modules herein include routines, procedures, programs, components, data structures, etc. that perform specific tasks or implement specific abstract data types. Additionally, those skilled in the art will understand that the methods of the present disclosure are applicable to 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 may be It will be appreciated that the system may be implemented with other computer system configurations, including those capable of operating in conjunction with one or more associated devices.

The described embodiments of the disclosure can 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.

Computers typically include a variety of computer-readable media. Media accessible by a computer includes volatile and non-volatile 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 refers to volatile and non-volatile media, transient and non-transitory media, removable and non-removable, 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, magnetic cassette, magnetic tape, magnetic disk storage or other magnetic storage. This includes, but is not limited to, a device, or any other medium that can be accessed by a computer and used to store desired information.

A computer-readable transmission medium typically implements computer-readable instructions, data structures, program modules, or other data on a modulated data signal, such as a carrier wave or other transport mechanism. Includes all information delivery media. The term modulated data signal refers to a signal in which one or more of the characteristics of the signal have been set or changed 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 example environment 1100 is shown that implements various aspects of the present disclosure, 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 processors and other multiprocessor architectures may also be used as processing unit 1104.

System bus 1108 may be any of several types of bus structures that may further be interconnected to a memory bus, peripheral bus, and 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. The basic input/output system (BIOS) is stored in non-volatile memory 1110, such as ROM, EPROM, and EEPROM, and is a basic input/output system that helps transfer information between components within the computer 1102, such as during startup. Contains routines. RAM 1112 may also include high-speed RAM, such as static RAM, for caching data.

Computer 1102 may also include an internal hard disk drive (HDD) 1114 (e.g., EIDE, SATA)—the internal hard disk drive 1114 may also be configured for external use within a suitable chassis (not shown). present—a magnetic floppy disk drive (FDD) 1116 (e.g., for reading from or writing to a removable diskette 1118), and an optical disk drive 1120 (e.g., a CD-ROM drive) for reading the disk 1122 or reading from or writing to other high-capacity optical media such as DVDs). Hard disk drive 1114, magnetic disk drive 1116, and optical disk drive 1120 are connected to system bus 1108 by 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. For computer 1102, drive and media correspond to storing any data in a suitable digital format. Although the description of computer-readable storage media above refers to removable optical media such as HDDs, removable magnetic disks, and CDs or DVDs, those skilled in the art will also understand removable optical media such as zip drives, magnetic cassettes, flash memory cards, cartridges, etc. It will be appreciated that other types of computer-readable storage media may also be used in the exemplary operating environment and that any such media may contain computer-executable instructions for performing the methods of the present disclosure. .

A number of program modules may be stored in drives 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 on various commercially available operating systems or combinations of operating systems.

A user may enter commands and information into computer 1102 through one or more wired/wireless input devices, such as a keyboard 1138 and a pointing device such as mouse 1140. Other input devices (not shown) may include microphones, IR remote controls, joysticks, game pads, stylus pens, touch screens, etc. These and other input devices are connected to the processing unit 1104 through an input device interface 1142, which is often connected to the system bus 1108, but may also include a parallel port, an IEEE 1394 serial port, a game port, a USB port, an IR interface, It can be connected by other interfaces, etc.

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

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, portable computer, microprocessor-based entertainment device, peer device, or other conventional network node, and generally operates with respect to computer 1102. For simplicity, only memory storage device 1150 is shown, although it includes many or all of the components described. The logical connections depicted include wired/wireless connections to a local area network (LAN) 1152 and/or a larger network, such as a wide area network (WAN) 1154. These LAN and WAN networking environments are common in offices and companies and facilitate enterprise-wide computer networks, such as intranets, all of which can be connected to a worldwide computer network, such as the Internet.

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

Computer 1102 may be associated with any wireless device or object deployed and operating in wireless communications, such as a printer, scanner, desktop and/or portable computer, portable data assistant (PDA), communications satellite, wirelessly detectable tag. Performs actions to communicate with any device or location and telephone. This includes at least Wi-Fi and Bluetooth wireless technologies. Accordingly, communication may be a predefined structure as in a conventional network or may simply be ad hoc communication between at least two devices.

Wi-Fi (Wireless Fidelity) allows connection to the Internet, etc. without wires. Wi-Fi is a wireless technology, like cell phones, that allows these devices, such as computers, to send and receive data indoors and outdoors, anywhere within the coverage area of a base station. Wi-Fi networks use wireless 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, the Internet, and wired networks (using IEEE 802.3 or Ethernet). Wi-Fi networks can operate in the unlicensed 2.4 and 5 GHz wireless bands, for example, at data rates of 11 Mbps (802.11a) or 54 Mbps (802.11b), or in 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 may be used in electronic hardware, (for convenience) It will be understood that the implementation 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 interoperability of hardware and software, various illustrative components, blocks, modules, circuits and steps have been described above generally with respect to their functionality. Whether this functionality is implemented as hardware or software depends on the specific application and design constraints imposed on the overall system. A person skilled in the art of this disclosure may implement the described functionality in various ways for each specific application, but such implementation decisions should not be construed as departing from the scope of this disclosure.

The 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 (e.g., hard disks, floppy disks, magnetic strips, etc.), optical disks (e.g., CDs, DVDs, etc.), smart cards, and flash. Includes, but is not limited to, memory devices (e.g., EEPROM, cards, sticks, key drives, etc.). The term “machine-readable media” includes, but is not limited to, wireless channels and various other media capable of storing, retaining, and/or transmitting 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, and the general principles defined herein may be applied to other embodiments without departing from the scope of the disclosure. Thus, the present disclosure is not limited to the embodiments presented herein but is to be interpreted in the broadest scope consistent with the principles and novel features presented herein.

Claims (9)

A method for detecting in-game huddles performed by a game server, comprising:
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 time required for each of the plurality of groups;
Including,
The step of determining at least one hurdle quest related to each of the plurality of groups based on the time required for each of the plurality of groups,
determining a Z-score for the time required for each of at least one quest among the plurality of quests;
determining a critical range based on at least one factor used when calculating the Z-score; and
determining a quest with a peak in which the Z-score is outside the critical range among the at least one quest as the at least one hurdle quest;
Including,
How to detect in-game hurdles.

According to claim 1,
The step of grouping a 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 power 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 power of each of the plurality of game players;
Including,
How to detect in-game hurdles.
According to claim 1,
The step of determining the Z-score for the time required for each of at least one quest among the plurality of quests is:
A step of determining a Z-score for the time required for each of at least one quest included in a window determined based on a first parameter among the plurality of quests,
The step of determining a critical range based on at least one factor used when calculating the Z-score includes:
Comprising determining a critical range based on at least one factor and a second parameter used in calculating the Z-score,
How to detect in-game hurdles.

According to claim 3,
The step of determining a Z-score for the time required for each of 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 demand related to the first quest is based on a third parameter indicating the degree of influence with the second quest, which is the quest before the first quest. determining a Z-score for time;
Including,
How to detect in-game hurdles.
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;
Containing more,
How to detect in-game hurdles.
According to claim 5,
increasing or decreasing a value of at least one of the first parameter, the second parameter and the third parameter to determine at least one first peak that is outside the threshold range;
Recognizing a first score set in a section corresponding to each of the at least one first peak;
The value of at least one of the first parameter, the second parameter, and the third parameter is increased or decreased so that a peak different from the at least one first peak is determined, so that at least one second parameter outside the threshold range 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, store one of a value of the parameter used to determine the at least one first peak or a value of the parameter used to determine the at least one second peak. steps;
Containing more,
How to detect in-game hurdles.
According to claim 1,
When the at least one hurdle quest is determined, determining a degree of risk for each of the at least one hurdle quest; and
determining a ranking of the at least one hurdle quest according to the risk;
Containing more,
How to detect in-game hurdles.
According to claim 7,
The above risk is,
The ratio of players who performed 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 number of payments,
How to detect in-game hurdles.
According to claim 8,
The proportion of players who performed the billing, the billing amount, and the billing number each have different weights,
How to detect in-game hurdles.

Images