JP7057388B2 - Server system - Google Patents

Description

The present invention relates to a server system for an online game in which a player operates and enjoys a player terminal.

In a so-called online multiplayer game in which multiple players connect to a communication line at the same time and play a game using a game device capable of mutual data communication, it is common for multiple players to jointly advance the game. .. And, in many online multiplayer games, players are devised so that they can play together and arbitrarily register other players they like in the "friend list" so that they can play together again in the next matching. .. Then, various ideas have been devised to enhance the interest of the game by using the friend list. For example, there is known a technique that enables transfer of items acquired in a game between players registered in a friend list (see, for example, Patent Document 1).

Also, completing all the given tasks such as collecting all kinds of items, clearing all kinds of events, achieving all scenarios, etc. is called complete, and if you complete it, you will be given a title, etc. There are known games that have a built-in mechanism for giving benefits such as giving bonuses. (For example, FIG. 10 and the like of Patent Document 2 show the complete rate.)

Japanese Unexamined Patent Publication No. 2011-110139 Japanese Patent No. 5265789

For example, in a social game, which is a kind of online game, a mechanism of giving a player a comp sheet that defines a plurality of items and cards to be collected is well known. However, the conventional complete mechanism is intended for individual player play. In particular, a system that defines multiple tasks to be achieved is called a "comp sheet", and a mechanism for giving a comp sheet to a player is often used.

The present invention has been devised in view of the above-mentioned problems. The purpose is to use the friend list to set a comp sheet for a group to which multiple players belong instead of an individual player, and realize a game that creates a new interest by completing the comp sheet as a group. That is.

The first invention for solving the above-mentioned problems is a server system for an online game in which a player operates and enjoys a player terminal (for example, the server system 1100 in FIG. 1).
Group management means for registering and managing groups to which a plurality of players belong (for example, server processing unit 200s in FIG. 8, game management unit 210, group management unit 211, server storage unit 500s, group registration data in FIG. 9). 600) and
Comp sheet setting means (for example, server processing unit 200s, game management unit 210, comp sheet setting unit of FIG. 8) in which a player belonging to the group sets a comp sheet in which a plurality of tasks achievable in the online game are defined. 222, step S4, step S104) in FIG.
Task achievement determination means (for example, server processing unit 200s, game management unit 210, FIG. 8) for determining whether or not a player belonging to a group in which the comp sheet is set has achieved the task specified in the comp sheet. Task achievement determination unit 230, steps S108 in FIG. 17, steps S130 to S132 in FIG. 19), and
Reward granting processing execution means (for example,) for executing a reward granting process for granting a given reward to a player belonging to a group in which the compsheet is set when all the tasks specified in the compsheet are achieved. The server processing unit 200s of FIG. 8, the game management unit 210, the reward granting processing execution unit 234, and steps S146 to S180 of FIG. 20).
It is a server system equipped with.

According to the first invention, a comp sheet in which a plurality of tasks achievable by a player belonging to an online game are defined can be set in a group. Then, when all the tasks are completed by the belonging player, a given reward can be given to the belonging player of the group in which the comp sheet is set. Therefore, a new and interesting game is realized in which the player does not complete the comp sheet alone, but the members belonging to the group complete the comp sheet.

Further, in the second invention, the task-in charge mapping means (for example, the server processing unit 200s in FIG. 8 and the game management) for associating each task defined in the comp sheet with the belonging player who is the player in charge of achieving the task. Section 210, task charge mapping setting section 226, and steps S56 to S60 in FIG. 18) are further provided, and the task achievement determination means determines whether or not the achievement charge player has achieved the associated task. (For example, steps S130 to S132 in FIG. 19), the server system of the first invention.

According to the second invention, each task of the comp sheet is associated with a player in charge of achievement to which the task is assigned and responsible for achievement. Then, the player in charge of achievement completes the comp sheet by completing the associated task. Therefore, it is possible to give the player in charge of achievement the motivation to accomplish the task for the group, which creates a new interest such as fostering a sense of solidarity as a member of the group and activating exchanges within the group. be able to.

The third invention is a first task determining means (for example, the server processing unit 200s of FIG. 8, game management) for determining a task to be assigned to the belonging player using a given parameter value of the belonging player in the online game. A unit 210, a first task determination unit 216, and steps S52 to S58 in FIG. 18) are further provided, and the task-in charge mapping means associates the task determined by the first task determination means with the player to which the task belongs (for example). , Step S60 in FIG. 18, the server system of the second invention.

According to the third invention, the task to be assigned to the belonging player can be determined by using the given parameter value of the belonging player.

More specifically, for example, as the fourth invention, the first task determining means of the belonging player is 1) the number of friends, 2) the billing frequency, 3) the average billing unit price, 4) the cumulative billing, and 5). Using at least one of the cumulative play time, 6) play frequency, and 7) game progress information as the parameter value, the task to be assigned to the player to which the player belongs is determined (for example, the allowable difficulty points Dp1 to Dp4 in FIG. 6). , Steps S52-S58 in FIG. 18, the server system can be configured.

1) Number of friends, 2) Billing frequency, 3) Average billing unit price, 4) Cumulative billing, 5) Cumulative play time, 6) Play frequency, and 7) Game progress information, the larger the value, the more advantageous or smooth. It can be said that it is an index that can be played in the game. Therefore, for example, by assigning a task having a difficulty level corresponding to these values to the player to which the player belongs, the task can be made suitable for the player to which the player belongs.

Further, the fifth aspect of the present invention is a second task determining means (for example, FIG. 8 has a server processing unit 200s, a game management unit 210, a second task determination unit 218, task candidate data 520 of FIG. 11 (2), and steps S56 to S58 of FIG. The server system according to any one of the second to fourth inventions, wherein the task determined by the second task determining means is associated with the player to which the task belongs (for example, step S60 in FIG. 18).

Here, as an object that can be used in an online game, for example, an item or a card (a card that identifies an item or a character) or the like can be considered. It can be said that if you have powerful items and cards, you can proceed with the game in an advantageous or smooth manner. Therefore, for example, by associating a task having a difficulty level according to an object belonging to the player to which the player belongs to the player to which the player belongs, it is possible to make the task suitable for the player to which the player belongs.

Further, in the sixth invention, the objects can be synthesized with each other, and a third task determining means for determining an object obtained by synthesizing objects belonging to different players in the same group as a task. (For example, the server processing unit 200s of FIG. 8, the game management unit 210, the third task determination unit 220, the task candidate data 520 of FIG. 11 (2), steps S56 to S58 of FIG. 18) are further provided.
The task associating means associates the task determined by the third task determining means with the player to which the object required for the synthesis belongs (for example, step S60 in FIG. 18), according to the fifth aspect of the invention. It is a server system.

The term "composite" as used herein is a known in-game mechanism in which when a plurality of material objects are prepared and a predetermined composition operation is performed, one other object is given in exchange for exhaustion of the material. If an item is used as a material, it is so-called "item composition". In the so-called "character composition" that uses a character as a material, an evolved character that absorbs and combines the abilities of the character used as the material is given.

According to the sixth invention, an object obtained by synthesizing objects belonging to different affiliated players in the same group can be associated with the task of the affiliated player. In this case, the player belonging to the task may consult with another player belonging to the task in an attempt to obtain the object of the task by synthesis. That is, it is possible to generate a new hobby of activating the interaction between the players belonging to the group.

Further, in the seventh aspect of the invention, the task-in charge mapping means associates the task with the belonging player based on the selection operation of the belonging player (for example, the corresponding selection control unit 228 in FIG. 21 and step S84 in FIG. 24). A server system according to any one of the second to sixth inventions, comprising S86).

According to the seventh invention, the task and the belonging player can be associated with each other based on the selection operation of the belonging player. The representative of the group may associate each task with the player to which the task belongs, or each player may select his / her task.

Further, in the eighth invention, the player in charge of the task belongs to the same player within the range of (N-1) or less among the N tasks (N ≧ 2) defined in the comp sheet. Is the server system of the invention according to any one of the second to seventh aspects, wherein the player in charge of achievement is the player (for example, step S20 in FIG. 18).

According to the eighth invention, the same player does not become the player in charge of accomplishing all the tasks specified in the comp sheet. For example, a player who is skilled in the game and has a very high level cannot complete all the tasks by himself. Therefore, the comp sheet that should be given to the group is not substantially equal to the one given to one player.

Further, the ninth invention is a group index value calculating means for calculating a group index value indicating superiority or inferiority of the entire group by using a given parameter value in the online game of each player belonging to the group (for example, FIG. The group index value Pg of 5 is further provided, the server processing unit 200s of FIG. 8, the game management unit 210, the group index value calculation unit 212, the group index value definition data 528 of FIG. 9, and steps S22 to S30 of FIG.
The comp sheet setting means sets a comp sheet corresponding to the group index value calculated by the group index value calculation means in the group (for example, step S100 in FIG. 17, application group index value range 645 in FIG. 16). The server system according to any one of the first to eighth inventions (combination of step S104 in FIG. 17).

According to the ninth invention, a group index value indicating superiority or inferiority of the entire group can be calculated by using a given parameter value in an online game of each player belonging to the group. Then, a comp sheet associated with this group index value in advance can be set in the group. As a result, a comp sheet can be set for the group according to the superiority or inferiority of the entire group. Therefore, for example, a comp sheet that can be completed very easily for the group or a comp sheet that is extremely difficult to complete is set. It is possible to avoid setting a mismatched comp sheet for the group.

Further, the tenth invention is a configuration tendency determining means (for example, the configuration tendency of FIG. 5) for determining the tendency of the group composition of the belonging player by using a given parameter value in the online game of each belonging player of the group. , The server processing unit 200s of FIG. 8, the game management unit 210, the configuration tendency determination unit 214, and steps S22 to S26 of FIG. 18) are further provided.
The comp sheet setting means sets a comp sheet according to the tendency determined by the configuration tendency determination means in the group (for example, step S100 in FIG. 17, application configuration tendency 646 in FIG. 16 and step S104 in FIG. 17). The server system according to any one of the first to eighth inventions.

According to the tenth invention, it is possible to determine the tendency of the group composition of the belonging players by using the given parameter values in the online game of each belonging player of the group. Then, a comp sheet associated with the determined tendency in advance can be set in the group. As a result, for example, the composition of the players belonging to the group, such as a protruding group in which only some players are prominent and the play level is high, or an average group in which the play levels of the players are almost the same. It is possible to set a comp sheet suitable for the group in the group.

Further, in the eleventh invention, the comp sheet setting means is the provision of a specific object among the objects that can be used in the online game, part or all of which is a task, until the completion of the comp sheet. Alternatively, the task achievement determination means has a delivery type setting means (for example, a delivery type setting unit 224 in FIG. 8) for setting a comp sheet defined as a delivery that cannot be used after the delivery. Regarding the task of delivering the specific object, it has a delivery pros and cons determining means for determining whether or not to deliver the specific object belonging to the belonging player based on the operation of the belonging player (for example, the donation pros and cons determination unit 232 of FIG. 8). 19 is a server system according to any one of steps S134 to S138) and 1st to 10th of FIG.

According to the eleventh invention, a part or all of the tasks are the delivery of a specific object among the objects that can be used in the online game, until the completion of the comp sheet, or after the delivery. Can set a comp sheet that is defined as an unusable offering. Of course, when donating a specific object, it is possible to decide whether or not to donate it based on the selection of the player to which it belongs.

A deadline can be set for reward grants.
For example, as the twelfth invention, the comp sheet setting means sets a deadline for the comp sheet (for example, the achievement deadline 626,643 in FIGS. 15 and 16) in association with the comp sheet, and the reward granting process. The execution means may configure the server system of any one of the first to eleventh inventions, which executes the reward granting process for the comp sheet in which all the tasks have been achieved within the deadline.

Further, as the thirteenth invention, the first to thirteenth inventions, in which the reward granting processing execution means changes the reward to be granted based on the elapsed time from the setting time of the comp sheet to the achievement of all the tasks. The server system of any of the inventions of 12 may be configured.

Further, as a fourteenth invention, the comp sheet setting means has set a deadline for the comp sheet in association with the comp sheet, and the comp sheet has been achieved for which all the problems have not been achieved within the deadline. Any of the first to eleventh, further provided with a means of awarding a given reward to the players belonging to the group in which the comp sheet is set, based on at least one of the number, proportion, and type of tasks. The server system of the present invention may be configured.

The figure which shows an example of the structure of a game system. The figure which shows the configuration example of a player terminal. The figure which shows the game screen example. Conceptual diagram of game elements using comp sheet. The figure for explaining how to select the content of the task in the automatic generation of a comp sheet. The figure for explaining how to select the content of the task in the automatic generation of a comp sheet. A functional block diagram showing an example of a functional configuration of a player terminal. The functional block diagram which shows the functional composition example of the server system in 1st Embodiment. The figure which shows the example of the program and data stored in the storage part of 1st Embodiment. The figure which shows an example of the data structure of the object initialization data. The figure which shows an example of the data structure of the task candidate data. The figure which shows an example of the data structure of the task candidate data. The figure which shows an example of the data structure of account data. The figure which shows an example of the data structure of group registration data. The figure which shows an example of the data structure of the comp sheet for a specific group. The figure which shows an example of the data structure of a preset type comp sheet data. The flowchart for demonstrating the flow of the process which concerns on a comp sheet by a server system in 1st Embodiment. A flowchart for explaining the flow of the comp sheet generation process for a specific group. A flowchart for explaining the flow of the uncompleted comp sheet monitoring process. The flowchart which continues from FIG. The functional block diagram which shows the functional composition example of the server system in 2nd Embodiment. The flowchart for demonstrating the flow of the process which concerns on a comp sheet by a server system in 2nd Embodiment. A flowchart for explaining the flow of the freely selectable comp sheet generation process. The flowchart which continues from FIG.

[First Embodiment]
An example of an online game will be described as a first embodiment to which the present invention is applied.
FIG. 1 is a diagram showing an example of a configuration of a game system according to the present embodiment. The game system of the present embodiment includes a server system 1100 that can be connected to the communication line 1, and a player terminal 1500 (1500a, 1500b, 1500c, ...) Prepared for each player 2 (2a, 2b, 2c, ...). ...) and configured.

The communication line 1 means a communication path capable of data communication. That is, the communication line 1 includes a telephone communication network, a cable network, a communication network such as the Internet, as well as a LAN (Local Area Network) using a dedicated line (dedicated cable) for direct connection and Ethernet (registered trademark). It is meaningful, and the communication method may be wired or wireless.

The server system 1100 is configured to include one or more server systems, storage devices, etc., provides various services for operating community-type websites and online games, manages play data necessary for game execution, and manages play data. Client programs and various data can be distributed.

In the present embodiment, the server system 1100 includes a main body device 1101, a keyboard 1106, a touch panel 1108, and a storage 1140. The control board 1150 is mounted on the main body device 1101. The control board 1150 includes various microprocessors such as CPU (Central Processing Unit) 1151, GPU (Graphics Processing Unit), DSP (Digital Signal Processor), ASIC (Application Specific Integrated Circuit), and various ICs such as VRAM, RAM, and ROM. A memory 1152 and a communication device 1153 are mounted.

The server system 1100 can, for example, (1) function as an account management server system responsible for user registration, initial setting of player characters, and processing related to login / logout, and (2) purchase items used in the game. As a function as an online shopping server responsible for processing online shopping services, and as a game management server system that manages and distributes data necessary for executing the game to the player terminal 1500 who is logged in and participating in the game at any time. It is composed of functions and.
In the example of FIG. 1, the server system 1100 is described as a single unit, but the server system 1100 is equipped with a plurality of blade servers, each of which shares the above-mentioned three types of functions and mutually via an internal bus. It may be connected so that data communication is possible. Alternatively, the server system 1100 may be configured to function as a whole by causing data communication between a plurality of independent servers installed at remote locations via the communication line 1.

FIG. 2 is a front external view showing a configuration example of the player terminal 1500. The player terminal 1500 is a computer used by the player and is an electronic device (electronic device). For example, it is realized by a smartphone, a portable game device, a stationary home game device, an arcade game device, a personal computer, a tablet computer, and the like. Then, the server system 1100 can be accessed by connecting to the communication line 1.

The player terminal 1500 in the present embodiment includes a direction input key 1502, a home key 1504, a touch panel 1506 that functions as an image display device and a contact position input device, a speaker 1510, a microphone 1512, a control board 1550, and a computer readout. A memory card reading device 1542 capable of reading and writing data from a memory card 1540, which is a possible information storage medium, is provided. In addition, a built-in battery (not shown), a power button, a volume control button, etc. are provided.

The control board 1550 is a wireless communication module for wirelessly connecting various microprocessors such as CPU 1551, GPU, and DSP, various IC memories 1552 such as ASIC, VRAM, RAM, and ROM, and a mobile phone base station, a wireless LAN base station, and the like. It is equipped with 1553. In addition, the driver circuit of the touch panel 1506, the circuit that receives the signals from the direction input key 1502 and the home key 1504, the output amplifier circuit that outputs the audio signal to the speaker 1510, and the input signal that generates the audio signal collected by the microphone 1512. A so-called I / F circuit 1554 (interface circuit) such as a generation circuit and a signal input / output circuit to the memory card reader 1542 is mounted. Each element mounted on these control boards 1550 is electrically connected via a bus circuit or the like, and is connected so as to be able to read / write data and send / receive signals.

The control board 1550 temporarily stores the game client program and data acquired from the server system 1100 in the IC memory 1552. Then, the program is executed to execute the arithmetic processing, and each part of the player terminal 1500 is controlled according to the operation input from the direction input key 1502, the home key 1504, and the touch panel 1506 to execute the game. In the present embodiment, the player terminal 1500 is configured to acquire necessary programs and various setting data from the server system 1100, but it may be configured to be read from a separately obtained memory card 1540.

In the present embodiment, in order to use the service provided by the server system 1100, the player needs to perform a predetermined procedure to acquire a user account (hereinafter, simply referred to as "account"). By logging in with the password associated with the acquired account, services such as online shopping of items, message exchange between registered users, management of friend players (see Fig. 1), and game play can be used.

[Overview of the game and explanation of the comp sheet]
FIG. 3 is a diagram showing an example of a game screen in this embodiment.
The online game of this embodiment is a single-player type. Each player 2 is set in the same game world, but is asynchronous to each other, and operates his / her own player character 4 in a game space independent of each other to perform single play. Of course, the player characters of both players may share the same game space as in a multiplayer online game.

Further, the game genre of the present embodiment is an action RPG (role-playing game), but of course, the game genre to which the present invention can be applied is not limited to this, and can be applied to other genres.
The player character 4 repeatedly engages with an enemy character 6 (NPC: non-player character) encountered while traveling in the game world. Hit points (HP: synonymous with life points, physical strength values, etc.) are set for each of the player character 4 and the enemy character 6, and when the opponent attacks, the hit points are reduced according to the amount of damage. When the hit point becomes "0", the character is treated as dead or destroyed. If the hit point of the player character 4 becomes "0", the game is over. The hit points of the player character 4 and the enemy character 6 are managed for each gameplay of each player.

In the game, various "objects" that can be attributed to player 2 appear when they are obtained. Objects include, for example, recovery items that restore hit points, enhancement items that enhance attack power, weapons, armor, keys to open secret doors, virtual currencies used in the game, and sub-characters to be used. Elements that the player character 4 can possess and use in the game world, such as a character card, can be appropriately set. Further, the use is not limited to the game, and a character card that can be selectively used as the player character 4 can be included. The object also includes a type that can be acquired by a predetermined compositing operation by combining other objects that are a plurality of materials.

These objects can be obtained by dropping the enemy character 6, clearing various events that occur in the game, or purchasing them separately through online shopping, and are managed by each player.

As shown in FIG. 4, in the online game of the present embodiment, when a plurality of players 2 (2a, 2b, ...) Related as friend players (FIG. 1) form and register group 8 as affiliated members, the group is common. It will be possible to play by clearing multiple tasks in cooperation with the members and earning rewards. If the number of members per group is 2 or more, it can be set as appropriate.

A "friend player" is another user who has registered as a player in the same online game. By separately registering the accounts of other users who have met while using the service provided by the server system 1100 as friends, the other users will be recognized as friend players. Since the mechanism of friend registration can be realized by appropriately using known techniques, the description here is omitted.

A package for multiple issues common to a group is called a "comp sheet". The comp sheet 10 is provided for each group.
One comp sheet 10 is, for example, a comp sheet ID 12 unique to the comp sheet, an achievement deadline 14 appropriately set including an indefinite period, a plurality of tasks 16 to be achieved, and achievement of each of the associated tasks. Includes information about the achievement player 18 in charge and the reward 19 at the time of achievement.

In task 16, it is possible to set parameter values that describe actions and play situations related to the game. For example, the categories of tasks are 1) clearing events, 2) acquiring and offering items and character cards, 3) subduing specific enemy characters, 4) playing frequency conditions, and 5) status of player character 4 (for example). , Hit points, experience points, levels, attack power, etc.), 6) Usage status of billing services, etc. can be set.

The player in charge of achievement 18 may be different for each task, and the same player belongs to the range of (N-1) or less among the N (N ≧ 2) tasks defined in the comp sheet 10. May be set.

The reward 19 can be set as appropriate. Since the online game of this embodiment is an action RPG, granting objects such as items and character cards, granting in-game virtual currency, increasing / decreasing ability values and increasing / decreasing skills of player character 4, disclosure of playable game stages, etc. Can be set. Of course, other than these can be set, and it is preferable to set appropriately according to the game genre and the game content.

In the game, the information of the provided comp sheet 10 can be displayed and confirmed on the game screen in the same manner as the information browsing of the items and the like possessed by the player character 4.

The provision of the comp sheet 10 is supported by a pattern in which the preset type comp sheet is automatically provided when the predetermined distribution period is reached, and a pattern in which the preset type comp sheet is provided each time the group leader performs a predetermined "comp sheet provision request operation". Will be done.

[Selection of assignment content]
5 to 6 are diagrams for explaining how to select the content of the problem in the automatic generation of the comp sheet 10.
The content of each task included in the comp sheet 10 is selected from a plurality of task candidates based on the characteristics of the group and the characteristics of the player who is in charge of the task.

First, the characteristics of the group will be described. As shown in FIG. 5, the characteristics of a group are determined from two scales, "composition tendency" and "proficiency" of the group.

The "composition tendency" is determined based on the variation in the ability of the player to which the player belongs. In this embodiment, 1) a small number of influential players with abundant play experience and excellent results lead the entire group, and 2) there is no big difference in play experience and results, and the players to which they belong are outlined. Two composition tendencies of "average type", which are considered to have the same ability, are used.

Specifically, for each player belonging to the game, the duration of playing the game (elapsed time from the acquisition of the user account), the number of plays, the frequency of play, the experience value and level of the player character 4, and the items acquired. A "player-specific index value Pp" is calculated using a predetermined function f with a number as a variable. The index value represents the ability of the player to which the player belongs.
Then, among them, the maximum index value Pp_max and the average index value Pp_ave are calculated, and if the difference is equal to or more than the predetermined "protrusion degree judgment reference value" that can be judged to have a large variation in competence, the composition tendency of the group is determined. Judged as a protruding type. If it is less than the protrusion degree judgment reference value, the average type is used.

The "training level" of a group is divided into three categories, "initial stage", "growth stage", and "maturity stage", according to the elapsed time from the formation timing of the group. Regarding the degree of training, in addition to the elapsed time from the formation of the group, the play history (number of plays and frequency of play) of each player belonging to each group after the formation may be added to the determination parameter.

Therefore, in the present embodiment, a total of six characteristics of the group are prepared, that is, two types of "composition tendency" and three categories of "kneading degree". Then, for each group characteristic, a "group index value Pg" indicating how difficult the task can be achieved and the superiority or inferiority of the entire group is determined. This group index value Pg is the basic value of the difficulty level of the content of the task to be selected.

Next, the characteristics of each player will be described.
As shown in FIG. 6, the characteristic of each belonging player is the degree of difficulty that the belonging player can tolerate, and the total value of "allowable difficulty point Dp" Σ (Dp1, Dp2, 2). ...).

The permissible difficulty point Dp is a parameter value related to the player to which the player belongs (the larger the value, the more advantageous or smooth the player can play the game; for example, the number of friends, the charging frequency, the average charging unit price, etc. It is calculated by a predetermined function with the cumulative billing, etc.) as a variable. When the number of friends, billing frequency, average billing unit price, and cumulative billing are used as parameter values, the larger each parameter value is, the higher the value obtained by the function is defined.

The type and number of parameters for calculating the allowable difficulty point Dp can be appropriately set. For example, the cumulative play time, the play frequency, and the game progress information may be further added (adding these functions), or any of them may be selectively adopted.
In addition, the number of friends is not limited to the number of friend players (direct friends) registered by the player belonging to the player, but the friend player registered by the friend player (indirect friend: the parent generation of the player belonging to the player and the friend player). If it is a child generation, it may include the number of friends players of the grandchild generation).

Then, the difficulty level of the content of the task that a certain belonging player is in charge of is determined based on the group index value Pg and the total allowable difficulty points ΣDp (= Σ (Dp1, Dp2, ...)) Of the belonging player. It is selected from the task candidates corresponding to the determined difficulty level.

In this embodiment, the number of belonging players and the number of tasks in one comp sheet 10 are the same, and one task is assigned to one player. However, the correspondence between the player to which the player belongs and the task is not limited to this. It is also possible to set more tasks than the number of affiliated players and allocate multiple tasks to some affiliated players. In other words, the same affiliation player can be the player in charge of achievement within the range of (N-1) or less of the N (N ≧ 2) tasks defined in the comp sheet 10.

[Explanation of function configuration]
Next, the functional configuration in this embodiment will be described.
FIG. 7 is a functional block diagram showing an example of the functional configuration of the player terminal 1500 according to the present embodiment. The player terminal 1500 of the present embodiment includes an operation input unit 100, a processing unit 200, a sound output unit 350, an image display unit 360, a communication unit 370, and a storage unit 500.

The operation input unit 100 outputs an operation input signal to the processing unit 200 in response to various operation inputs made by the player. For example, it can be realized by a push switch, a joystick, a touch pad, a trackball, an accelerometer, a gyro, a CCD module, or the like. In the example of FIG. 2, the direction input key 1502, the home key 1504, and the touch panel 1506 correspond to this.

The processing unit 200 is realized by, for example, a microprocessor such as a CPU or GPU, an electronic component such as an ASIC (integrated circuit for a specific application), or an IC memory, and is between each functional unit including an operation input unit 100 and a storage unit 500. Control the input / output of data with. Then, various arithmetic processes are executed based on predetermined programs and data, operation input signals from the operation input unit 100, and various data received from the server system 1100 to control the operation of the player terminal 1500. In the example of FIG. 2, the control board 1550 corresponds to this. The processing unit 200 in the present embodiment includes a player terminal calculation unit 240, a sound generation unit 250, an image generation unit 260, and a communication control unit 270.

The player terminal calculation unit 240 executes various calculation processes for making the computer function as a terminal for game play. For example, the configuration of the present embodiment includes an operation signal transmission control unit 242 and a game screen display control unit 244. In addition, processing related to functions such as timekeeping and software keyboard is performed.

The operation signal transmission control unit 242 executes a process for transmitting various data and request information to the server system 1100 in response to the operation performed by the operation input unit 100.

The game screen display control unit 244 controls to display the game screen based on various data received from the server system 1100. For example, if the online game of the present embodiment is realized as a web game, a web technology that actively controls the screen display by using Java (registered trademark) and CSS (Cascading Style Sheets) together with HTML based on a web browser. And it can be realized by using a plug-in such as Adobe (registered trademark) Flash. Of course, other methods may be used.

The sound generation unit 250 is realized by, for example, a digital signal processor (DSP), a processor such as an audio synthesis IC, an audio codec capable of playing an audio file, and the like, and the effect related to the game is based on the processing result by the game screen display control unit 244. Sound signals of sound, BGM, and various operation sounds are generated and output to the sound output unit 350.

The sound output unit 350 is realized by a device that outputs sound effects, BGM, and the like based on the sound signal input from the sound generation unit 250. In the example of FIG. 2, the speaker 1510 corresponds to this.

The image generation unit 260 is realized by, for example, a GPU, a processor such as a digital signal processor (DSP), a video signal IC, a program such as a video codec, an IC memory for a drawing frame such as a frame buffer, and the like. The image generation unit 260 generates an image of one game screen in one frame time (for example, 1/60 second) based on the processing result by the game screen display control unit 244, and displays the image signal of the generated game screen as an image. Output to unit 360. Then, the image generation unit 260 of the present embodiment can generate an image of the game screen based on the data received from the server system 1100. Further, various information display bodies can be combined with the game space image according to the control of the game screen display control unit 244. In a configuration in which the 3DCG of the game space image is not generated by the server system 1100 but generated by the player terminal 1500, the rendering process can be taken care of.

The image display unit 360 displays various game images based on the image signals input from the image generation unit 260. For example, it can be realized by an image display device such as a flat panel display, a cathode ray tube (CRT), a projector, and a head-mounted display. In the present embodiment, the touch panel 1506 corresponds to this in the example of FIG.

The communication control unit 270 executes data processing related to data communication, and realizes data exchange with an external device via the communication unit 370. The communication unit 370 connects to the communication line 1 to realize communication. For example, it is realized by a wireless communication device, a modem, a TA (terminal adapter), a jack of a communication cable for wiring, a control circuit, and the like, and in the example of FIG. 2, the wireless communication module 1553 corresponds to this.

The storage unit 500 stores a system program for realizing various functions for making the processing unit 200 control the player terminal 1500 in an integrated manner, a program necessary for game play, various data, and the like. Further, it is used as a work area of the processing unit 200, and temporarily stores the calculation result executed by the processing unit 200 according to various programs, the input data input from the operation input unit 100, and the like. Such a function is realized by, for example, an IC memory such as RAM or ROM, a magnetic disk such as a hard disk, an optical disk such as a CD-ROM or DVD, or an external storage device connected via a communication line 1. In the example of FIG. 2, the IC memory 1552 and the memory card 1540 mounted on the control board 1550 correspond to this.

The storage unit 500 of the present embodiment stores the system program 501 and the game client program 502.

The system program 501 is a program for realizing the basic functions of input / output of the player terminal 1500 as a computer.

The game client program 502 is application software for realizing the function as the player terminal calculation unit 240 by reading and executing the game client program 502. It may be a configuration incorporated as a part of the system program 501. The game client program 502 may be a dedicated client program depending on the technical method for realizing an online game, or may be configured by a web browser program, a plug-in that realizes an interactive image display, or the like.

In addition, the storage unit 500 can appropriately store data for describing the progress of the game, counters for timekeeping, various flags, and the like.

[Explanation of the functional configuration of the server system]
FIG. 8 is a functional block diagram showing a functional configuration example of the server system 1100 according to the present embodiment. The server system 1100 in the present embodiment includes an operation input unit 100s, a server processing unit 200s, an image display unit 360s, a communication unit 370s, and a server storage unit 500s.

The operation input unit 100s is a means for inputting various operations for server management, and is realized in the same manner as the operation input unit 100 of the player terminal 1500. In the example of FIG. 1, the keyboard 1106 corresponds to this.

The server processing unit 200s is realized by, for example, a microprocessor such as a CPU or GPU, an electronic component such as an ASIC (integrated circuit for a specific application), or an IC memory, and includes each functional unit including an operation input unit 100s and a server storage unit 500s. Data input / output control is performed between. Then, various arithmetic processes are executed based on a predetermined program and data, an operation input signal from the operation input unit 100s, and data received from the player terminal 1500, and the operation of the server system 1100 is controlled in an integrated manner. In the example of FIG. 1, the control board 1150 corresponds to this.
The present embodiment includes an account management unit 202, a game management unit 210, an image generation unit 274s, and a communication control unit 276s.

The account management unit 202 performs a user account registration procedure and a process related to login using the issued account. A unique account is issued to the player who has passed the registration procedure, and account data 530 (FIG. 9) is generated and managed.

The game management unit 210 executes a process related to the progress of the game. for example,
1) Processing related to selection and setting of player character 4 used by each player,
2) Processing related to selection and setting of the game stage to play,
3) Processing related to encounter with enemy character 6, battle, and reflection of battle results,
4) Processing related to action control of enemy character 6
5) Event generation processing,
6) Processing related to dropping, acquiring, and granting objects such as items and character cards to players,
7) Processing related to playback of various production videos,
8) Processing related to the realization of the function to purchase items and character cards,
9) Processing related to record management of purchase history,
10) Processing related to management of items, etc.
11) Processing related to record management of play history,
12) Processing related to so-called "synthesis" in which one different character or object is given in exchange for exhaustion of multiple different characters or objects.
And so on. It should be noted that these various processes are realized by appropriately using known techniques related to online games.

The game management unit 210 of the present embodiment has a group management unit 211, a group index value calculation unit 212, a configuration tendency determination unit 214, a first task determination unit 216, and a second, in relation to the comp sheet. It has a task determination unit 218, a third task determination unit 220, a comp sheet setting unit 222, a task charge correspondence setting unit 226, a task achievement determination unit 230, and a reward grant processing execution unit 234.

The group management unit 211 performs processing related to registration and management of a group to which a plurality of players belong.

The group index value calculation unit 212 calculates the group index value Pg (FIG. 5) indicating the superiority or inferiority of the entire group by using a given parameter value related to each player belonging to the group in the online game of the present embodiment. ..

The composition tendency determination unit 214 determines the tendency of the group composition of the belonging players (the composition tendency of FIG. 5) by using the given parameter values related to each belonging player of the group in the online game of the present embodiment.

The first task determination unit 216 determines a task to be assigned to the player to which the player belongs, using a given parameter value of the player to which the player belongs in the online game of the present embodiment. The calculation of the permissible difficulty point Dp in FIG. 6 and the selection of the content of the task corresponding to the difficulty level based on the total permissible difficulty point ΣDp are based on the function of the determination unit.

The second task determination unit 218 determines a task to be assigned to the player to which the player belongs, using an object (item, card, etc.) that can be used in the online game of the present embodiment and belongs to the player to which the player belongs.

The third task determination unit 220 determines an object obtained by synthesizing objects belonging to different players in the same group as a task.

The comp sheet setting unit 222 sets a comp sheet in which a plurality of tasks that the player belonging to can achieve in the online game of the present embodiment are defined in the group.
Specifically, the comp sheet setting unit 222 selects a comp sheet that is previously associated with the group index value Pg calculated by the group index value calculation unit 212, or selects a comp sheet with a difficulty level based on the group index value Pg. It can be generated and set in a group.
Further, it is possible to select a comp sheet that is preliminarily associated with the composition tendency of the group determined by the composition tendency determination unit 214, or to generate a comp sheet with a difficulty level based on the composition tendency and set it in the group.

In addition, it has a delivery type setting unit 224, and delivers a specific object among the objects that can be used in the online game of the present embodiment, until the specific object completes the comp sheet, or after the delivery. It is possible to set a comp sheet that includes a delivery-type task that becomes unusable.

The task charge correspondence setting unit 226 associates each task defined in the comp sheet with the belonging player who is the player in charge of achieving the task. Specifically, within the range of (N-1) or less of the N (N ≧ 2) tasks specified in the comp sheet, the player belonging to the same affiliation is set as the player in charge of achievement.

The task achievement determination unit 230 determines whether or not the player belonging to the group in which the comp sheet is set has achieved the task specified in the comp sheet. Specifically, it is possible to determine whether or not the associated task has been achieved for each player in charge of achievement.
In addition, it has a delivery pros and cons determination unit 232, and can determine whether or not to deliver the specific object belonging to the belonging player based on the operation of the belonging player for the task of delivering the specific object in the achievement determination.

The reward granting process execution unit 234 executes a reward granting process for granting a given reward to the players belonging to the group in which the comp sheet is set when all the tasks specified in the comp sheet are achieved.

The image generation unit 274s can generate an image related to the maintenance of the server system 1100 and output it to the image display unit 360s. Further, in the present embodiment, it is possible to execute various image generation processes such as a game space image to be displayed on the player terminal 1500.

The image display unit 360s displays various images for system management based on the image signal input from the image generation unit 274s. For example, it can be realized by an image display device such as a flat panel display, a cathode ray tube (CRT), a projector, and a head-mounted display. In the example of FIG. 1, the touch panel 1108 corresponds to this.

The communication control unit 276s executes data processing related to data communication, and realizes data exchange with an external device via the communication unit 370s.

The communication unit 370s connects to the communication line 1 to realize communication. For example, it is realized by a wireless communication device, a modem, a TA (terminal adapter), a jack of a communication cable for wiring, a control circuit, and the like. In the configuration of FIG. 1, the communication device 1153 corresponds to this.

The server storage unit 500s stores system programs for realizing various functions for the server processing unit 200s to control the server system 1100 in an integrated manner, programs necessary for managing the game, various data, and the like. Further, it is used as a work area of the server processing unit 200s, and temporarily stores the calculation results and the like executed by the server processing unit 200s according to various programs. This function is realized by, for example, an IC memory such as RAM or ROM, a magnetic disk such as a hard disk, an optical disk such as a CD-ROM or DVD, or an external storage device connected via a communication line 1. In the configuration of FIG. 1, a storage medium such as an IC memory 1152 and a hard disk mounted on the main unit 1101 and a storage 1140 correspond to this.

As shown in FIG. 9, the server storage unit 500s of the present embodiment stores the server system program 503, the account management program 504, the game management program 505, and the distribution game client program 506.
Further, the game stage initial setting data 510, the character initial setting data 512, the object initial setting data 514, the event setting data 518, the task candidate data 520, and the group index value definition data 528 are stored in advance.
Further, as data generated or periodically updated each time, account data 530, group registration data 600, specific group comp sheet data 620, preset type comp sheet data 640, and play data 660 are stored. do.
In addition, information such as timers, counters, and various flags can be stored as appropriate.

The server system program 503 is a system program for realizing the basic input / output functions required as a computer in the server system 1100 by reading and executing the server processing unit 200s.

The account management program 504 is a program for realizing the function as the account management unit 202 by being read and executed by the server processing unit 200s.

The game management program 505 is a program for realizing the function as the game management unit 210 by being read and executed by the server processing unit 200s.

The distribution game client program 506 is the original of the game client program 502 (FIG. 7) provided to the player terminal 1500. It is realized by a dedicated client-side application, a plug-in for a web browser program for realizing dynamic display on a web browser, a page description file that describes a website page, and the like.

The game stage initial setting data 510 is data that defines a stage for game play, and is prepared for each game stage. The game space is defined, and the number and types of appearances of the enemy character 6, the types and numbers of items dropped by the enemy character 6, and the like are defined.

The character initial setting data 512 is prepared for each character appearing in the game (all characters that can be selected as the player character 4, all types of enemy characters 6, etc.), and various information for displaying the character on the screen and controlling the operation is stored. Has been done. For each character ID, model data for display and initial values of various ability values are stored.

The object initial setting data 514 stores various definition data for displaying or using an object that can be attributed to the player or the player character 4, such as an item or a character card appearing in the game, in the game.
In the present embodiment, for example, as shown in FIG. 10, one object initialization data 514 includes an object ID 515, a synthetic material object ID list 516, and a rarity 517.

The composite material object ID list 516 defines other objects required as materials when the object is obtained by a predetermined synthesis procedure. "Synthesis" here is a game mechanism in which a smaller number (often one) of another element is given in exchange for the exhaustion of a plurality of different elements. In the present embodiment, as in the examples of FIGS. 10 (2) and 10 (4), types that can be obtained by synthesis for each of the item and the character card are prepared.

Returning to FIG. 9, the event setting data 518 is data that defines an event that occurs in the game and is prepared for each event. One event setting data 518 includes an event ID and data for executing the event (for example, data of a subprogram for executing a mini game, data of a dedicated game stage, or video data). In this embodiment, the event can be a task to be achieved.

The task candidate data 520 defines a plurality of task candidates for each content category.
For example, FIGS. 11 to 12 show variations of the task candidate data 520 according to the present embodiment. The task candidate data 520 includes the task content category 521 and the task ID 523 and the task content 524 associated with the difficulty level 522.

As shown in FIG. 11 (1), in the task candidate data 520 whose category 521 is "event clear", the task content 524 stores the identification information of the event to be cleared. A specific event may be specified, or a condition for selecting an event may be defined, such as "select one of the events already cleared by another player in the same group". In any case, the higher the difficulty level, the more difficult it is to clear or the event is set to have a lower probability of occurrence.

As shown in FIG. 11 (2), in the task candidate data 520 whose category 521 is “delivery”, the task content 524 stores the identification information and the number of items and character cards to be obtained and delivered. You may specify a specific object, select from the objects that the player already has, or define the conditions for selecting the object to be synthesized using them. In any case, the higher the difficulty level, the more powerful or rare the item or character is set, or the item or card that is difficult to synthesize. It is also possible to replace "delivery" with "obtain".

As shown in FIG. 11 (3), in the task candidate data 520 in which the category 521 is “destroy the enemy character”, the identification information and the number of the enemy characters to be defeated are stored in the task content 524. The higher the difficulty level, the more powerful it is, and the less likely it is to encounter a rare enemy character.

Further, as shown in FIG. 12 (1), in the task candidate data 520 whose category 521 is "play frequency", the frequency of game play is defined in the task content 524. The higher the difficulty level, the higher the frequency of play.

As shown in FIG. 12 (2), in the task candidate data 520 whose category 521 is “status”, the situation to be satisfied by the player character 4 of the player in charge of achievement is defined in the task content 524. The higher the difficulty level, the more difficult it is set to achieve.

As shown in FIG. 12 (3), in the task candidate data 520 whose category 521 is “billing use”, the task content 524 defines the online shopping action to be performed by the player in charge of achievement. The higher the difficulty level, the larger the purchase price, the number of purchases, the number of types of purchases, etc., or more difficult purchase conditions (for example, purchase cannot be made until level 10 or higher) are set.

Of course, the type of category 521 can be appropriately set according to the genre of the game and the content of the game.

Returning to FIG. 9, the group index value definition data 528 is a two-dimensional array data that defines the group index value Pg for each combination of the type of group composition tendency (FIG. 5) and the classification of the group skill level (FIG. 5). Is.

FIG. 13 is a diagram showing an example of the data structure of the account data 530.
The account data 530 is prepared for each user who has registered an account, for example, a user account 531, a registration date 532, a play history data 540, a billing history data 560, a billing frequency 561, and a billing average unit price 562. Includes cumulative billing 563 and friend list 564.

The play history data 540 includes the result of the game play after registration and the data defining the current game play status. For example, it includes a play date / time list 541, a used character ID 542 indicating the type of the current player character 4, and game progress information 547. Further, as data that describes the situation of the player character 4 and is sequentially updated while the game is in progress, it includes an experience value 543, a level 544, an ability parameter value 545, a subjugation enemy character list 546, and an belonging object list 550. ..

In the play date / time list 541, the date / time when the player played (login date / time), the play time, and the like are recorded. Therefore, the server processing unit 200s can calculate the cumulative play time and the play frequency (login frequency) based on the play date / time list 541. The play frequency can be calculated, for example, by setting the number of logins per predetermined unit time (for example, one day) and averaging the past one week for each day. The cumulative play time and play frequency can be used to calculate the allowable difficulty point Dp.

Information indicating the game progress status of the player (for example, a stage number or the like) is stored in the game progress information 547, and is updated as needed according to the play. This game progress information can also be used to calculate the allowable difficulty point Dp.

The attribution object list 550 stores identification information of the object belonging to the player and the player character 4. For example, the possessed item list 551, the possessed game card list 552, and the offering list 553 are included. The donating list 553 stores the identification information of the donated object to accomplish the task of the comp sheet 10.

The objects required to complete the task in charge are moved from the possessed item list 551 and the possessed game card list 552 to the offering list 553 through the approval operation by the player, and until the completion of the comp sheet 10 or. , It will be unusable after it is delivered.

In the billing history data 560, the date and usage details are registered each time an item, a game card, an action point of the player character 4, or the like is purchased from within the game using an online shopping service. Then, based on the billing history data 560, the server processing unit 200s updates the billing frequency 561, the average billing unit price 562, and the cumulative billing 563.

The friend list 564 stores the accounts of other users registered as friend players (FIG. 1) by the player.

FIG. 14 is a diagram showing an example of the data structure of the group registration data 600.
The group registration data 600 is created for each group for which the registration procedure has been performed.
One group registration data 600 includes a group ID 601, a group formation date 602, an affiliated player count 603, a leader account 604 which is an account of an affiliated player as a leader, and comp sheet progress management data 610. ..

The comp sheet progress management data 610 is created every time a new comp sheet 10 is provided to the group, and various data describing the progress status are stored. One compsheet progress management data 610 includes, for example, compsheet ID 611, achievement deadline 612, start date and time 613, achievement flag 615 associated with task ID 614, and achievement player count 616. Of course, parameter values other than these can be included as appropriate.

FIG. 15 is a diagram showing an example of the data structure of the comp sheet data 620 for a specific group. The comp sheet data 620 for a specific group is generated according to the characteristics of the group and the characteristics of the player to which the group belongs, in response to a request from the group leader.
For example, the comp sheet ID 621, the provider group ID 622, the generation group index value 624, the generation configuration tendency 625, the achievement deadline 626, the achievement charge player account 628 associated with the task ID 627, and the reward setting data. Includes 629 and.

As the destination group ID 622, the group ID 601 (FIG. 14) of the requested group is set.
The generation time group index value 624 and the generation time configuration tendency 625 store the group index value Pg of the provider group and the determination result (FIG. 5) of the group composition tendency, respectively.

The achievement deadline 626 can be appropriately set including an indefinite period. It may be a specified value or may be set variably according to the group index value Pg. In the latter case, it is advisable to define and use an achievement deadline calculation function that gives a shorter period as the index value is higher.

In this embodiment, since the relationship between the task and the player in charge is one-to-one, the task ID 627 and the player account in charge of achievement 628 are both four each, but the present invention is not limited to this. For example, as the total allowable difficulty point ΣDp (FIG. 6) of the belonging player increases, the number of tasks in charge may be increased. In this case, first determine the number of tasks to be in charge of each player belonging to the player, and then determine the number and settings of the player account in charge of achievement 628. Then, the content of the task is determined for each player account in charge of achievement 628. At that time, it is desirable that the same task content is not duplicated.

FIG. 16 is a diagram showing an example of the data structure of the preset type comp sheet data 640. The preset type comp sheet data 640 is data prepared in advance by the administrator of the online game of the present embodiment. For example, it includes a comp sheet ID 641, a distribution period 642, an achievement deadline 643, and a plurality of task sets 644.

The task set 644 is prepared with different difficulty levels to accomplish the task. One task set 644 includes an application group index value range 645, an application configuration tendency 646, a task ID list 647 defining a combination of task contents, and reward setting data 648.
The application group index value range 645 and the application configuration tendency 646 represent the combination tendency and the difficulty level of the task categories in the set, and the content of the task according to the combination tendency and the difficulty level is defined in the task ID list 647. ing.

[Explanation of processing flow]
Next, the processing flow of the server system will be described. The processing flow described here is realized by executing the game management program 505 in a state where the server processing unit 200s has executed the server system program 503.
It is assumed that the player has already registered an account, has already played the game several times, and has registered a group together with a friend player. Note that group registration can be realized in the same way as party and team formation seen in known multiplayer online games, or registration of friend players, so detailed description here will be omitted.

FIG. 17 is a flowchart for explaining the flow of processing related to the comp sheet by the server system 1100 in the present embodiment.
When the server processing unit 200s of the server system 1100 receives a request for providing a comp sheet from the player terminal 1500 of the group leader (YES in step S2), the server processing unit 200s executes a comp sheet generation process for a specific group (step S4).

FIG. 18 is a flowchart for explaining the flow of the comp sheet generation process for a specific group. In the same process, the server processing unit 200s generates and initializes a new comp sheet data 620 for a specific group (step S20).

Specifically, the comp sheet ID 621 is automatically generated and a unique ID is set. In the provider group ID 622, the group ID 601 (FIG. 14) of the group requested in step S2 is set. The group index value 624 at the time of generation and the composition tendency 625 at the time of generation are predetermined values meaning undecided. The achievement deadline 626 is a predetermined value. The number of achievement charge player accounts 628 is the same as the number of players belonging to the group requested in step S2, and the same number of task IDs 627 are set as initial values meaning undecided. For the reward setting data 629, any one of the object initial setting data 514 (FIG. 9) may be randomly selected, or a list of reward candidates may be separately prepared and selected from the list.

In this embodiment, since the relationship between the task and the player in charge is one-to-one, the task ID 627 and the player account in charge of achievement 628 are both set to four in the initial state, but the present invention is not limited to this. If there is a many-to-one relationship between the task and the player in charge, it is sufficient to prepare four or more task IDs 627 and achievement player accounts 628. Then, the same belonging player may be assigned to the achievement charge player account 628 within the range of (N-1) or less among the N (N ≧ 2) task IDs 627. The number of allocations may be increased as the total allowable difficulty point ΣDp (FIG. 6) of the belonging player increases. In other words, the number of players belonging to the achievement player account 628 is set to be multiple, not just one.

Next, the server processing unit 200s calculates the player-specific index value Pp (FIG. 5) for each player (step S22), selects the maximum index value Pp_max from them, and calculates the average index value Pp_ave (step). S24). Then, the composition tendency of the group is determined (step S26). The determined configuration tendency information is stored in the generation time configuration tendency 625 of the comp sheet data 620 for a specific group.

Next, the server processing unit 200s refers to the formation date 602 of the group requested in step S2, and determines the training level (FIG. 5) of the group from the elapsed time up to the present (step S28). Now that the group composition tendency and skill level have been determined, the group index value Pg is determined from the combination of the group composition tendency and skill level obtained with reference to the group index value definition data 528 (step). S30). The determined index value is stored in the generation group index value 624 (FIG. 15).

Next, loop A is executed for all the players belonging to the group requested in step S2 (steps S50 to S80).
In the loop A, the server processing unit 200s calculates the permissible difficulty point Dp (FIG. 6) for each factor that influences the determination of the difficulty level, and the group index value Pg determined in step S30 and the total permissible difficulty points. From the total value with ΣDp, the difficulty level applied to the player belonging to the processing target of loop A is selected (step S54).

Next, the server processing unit 200s randomly selects a task category (step S56), and from the task candidate data 520 that matches the selected category with the category 521, the task corresponding to the difficulty level selected in step S54. ID 523 and task content 524 are selected (step S58).

In the present embodiment, the number of tasks to be assigned by one player in charge of achievement is determined in step S20, but the configuration may be determined in loop A.
Specifically, between step S54 and step S56, it is determined how many tasks the belonging player to be processed is in charge of according to the allowable difficulty point Dp and the difficulty level. The larger the allowable difficulty point Dp and the difficulty level, the more tasks are decided to be in charge. Then, the steps S56 to S60 may be repeatedly executed as many times as the number to be in charge of the steps S56 to S60.

Then, the selected task is set to the player belonging to the processing target (step S60). Specifically, the task ID 523 selected earlier is set to the corresponding task ID 627 of the achievement charge player account 628 (FIG. 15) in which the player belonging to the processing target is set. This ends loop A (step S80).

If the loop A is executed for all the players belonging to the server, the server processing unit 200s then determines the content and number of rewards according to the group index value Pg (step S82). For example, the reward category is randomly determined. The reward category can be set as appropriate. If "give item" is selected, the number of rewards is determined by a predetermined reward number calculation function with the group index value Pg as a variable. Then, the object initial setting data 514 having a rarity 517 that is higher as the group index value Pg is higher is selected by that number (FIG. 10), and the object ID 515 is set in the reward setting data 629. If the category of reward is "giving experience value", the experience value given as the group index value Pg is larger may be set in the reward setting data 629.
After deciding the reward, the process of generating comp sheet data for a specific group is completed.

Returning to the flowchart of FIG. 17, the server processing unit 200s sets the comp sheet newly generated in the comp sheet generation process for the specific group to the group requested in step S2 (step S100). New compsheet progress management data 610 is registered in the group registration data 600 (FIG. 14) of the group based on the compsheet data to be set. At this time, the current date and time is set to the start date and time 613.

Next, if the server processing unit 200s has the preset type comp sheet data 640 whose current date and time falls within the distribution period 642 (FIG. 16) (YES in step S102), the comp sheet progress of the registration data 600 of all groups. The management data 610 is searched, unset groups to which the preset type comp sheet data 640 is not provided are extracted, and a comp sheet of the preset type comp sheet data 640 is set for each of the extracted groups (step S104). ).
Specifically, for the corresponding unset group, the group composition tendency and the group index value Pg are calculated in the same manner as in steps S22 to S30 (FIG. 18). Then, from the task set 644 of the preset type comp sheet data 640, the task set 644 to which the application group index value range 645 matches is selected, and the content is set as the content of the comp sheet.

Next, the server processing unit 200s deletes the preset type comp sheet data 640 whose distribution period 642 has ended (step S106), and executes the uncompleted comp sheet monitoring process (step S108).

19 to 20 are flowcharts for explaining the flow of the uncompleted comp sheet monitoring process in the present embodiment. In the same process, the server processing unit 200s first extracts a group having uncompleted comp sheet progress management data 610 (step S120), and executes loop B for all the extracted groups (steps S122 to S184: FIG. 20).

In the loop B, the server processing unit 200s executes the loop C (steps S124 to S182: FIG. 20) for all the uncompleted comp sheets of the group to be processed by the loop A.

In the loop C, the server processing unit 200s executes the loop D for each task of the uncompleted comp sheet to be processed by the loop C (steps S126 to S144).

In the loop D, when the task to be processed is registered as unachieved (YES in step S128), the server processing unit 200s has the play history data of the account data 530 (FIG. 13) of the player in charge of achieving the task to be processed. With reference to 540, it is confirmed whether or not the task to be processed is achieved (step S130).

If it is determined that the task has been achieved (YES in step S132), the server processing unit 200s determines whether the category of the task to be processed corresponds to "delivery".

If the task is in the "delivery" category (YES in step S134), the server processing unit 200s requests the player in charge of achieving the task to be processed to approve the delivery of the objects necessary to achieve the task to be processed. (Step S136). For example, if the player in charge of achievement is currently logged in, the player terminal 1500 is displayed with an approval / non-approval selection input screen to obtain selection input.

Then, if the donation is approved (YES in step S138), the server processing unit 200s refers to the comp sheet progress management data 610 of the uncompleted comp sheet to be processed, and achieves the problem corresponding to the processing target. The flag 615 is changed to "1 (achievement)" (step S140), a notification process for notifying the player belonging to the processing target group is executed (step S142), and the loop D is terminated (step S144).

On the contrary, if the donation is not approved (NO in step S138), the loop D is terminated without changing the achievement flag 615 (step S144). Further, even if the task targeted for processing in loop D has not been achieved (NO in step S132) or the category of the task to be processed is other than "delivery" (NO in step S134), the achievement flag Loop D is terminated without changing 615 (step S144).

Moving to the flowchart of FIG. 20, if loop D is executed for each task of the uncompleted comp sheet targeted for processing in loop C, if all the tasks of the uncompleted comp sheet to be processed are achieved. (YES in step S146), the server processing unit 200s executes a notification to all the players belonging to the group targeted for processing in the loop B that the comp sheet has been completed (step S148), and rewards the player. Is executed (step S150).

In the reward granting process, the server processing unit 200s determines whether the reward setting data 629 (FIGS. 15 and 16) of the comp sheet is set with the contents of a predetermined category in which the number to be granted can be varied (step S160). For example, in the case of a category in which the quantity to be given can be changed, such as "experience value", "virtual currency", "hit points", and "recovery item", a positive judgment is made (YES in step S160), and from the start date and time 613 (FIG. 14). The total amount to be granted is calculated according to the elapsed time up to the present, and the number of grants per person is equally divided and determined. (Step S162). Alternatively, the number of grants per person may be determined by the number of tasks assigned by each player and the distribution rate according to the level of difficulty of the task in charge.

Further, the reward setting data 629 of the comp sheet determines whether or not the content of a predetermined category in which a plurality of ranks exist is set in the content of the reward (step S164). Then, if a plurality of types are set according to the effect at the time of use, such as "recovery item", a positive judgment is made (YES in step S164), and the elapsed time from the start date and time 613 (FIG. 14) to the present is determined. The rank to be given is determined (step S166). If the content originally includes a difference in rank, such as "specific item A to specific item D (items with differences in rarity and ability) one by one", affirmative judgment is made in step S164, and a step is taken. The priority may be determined according to the number of tasks assigned by each player in S166 and the level of difficulty of the task assigned, and the items to be given may be individually determined based on the priority.

Then, a reward granting process is performed for each player to which the player belongs (step S180), and the loop C is terminated (step S182).

If all the tasks have not been achieved in step S146, that is, if it is determined that the task has not been completed (NO in step S146), the server processing unit 200s refers to the achievement deadline 612, and if the deadline has been reached (step S146). YES in S170), the reward content is determined according to the progress of the comp sheet to be processed (step S172). For example, in the case of a predetermined category in which the number of rewards is variable, it is determined that the larger the number or ratio of the tasks achieved so far, the larger the number or ratio of the reward contents. In addition, in the case of a predetermined category in which a plurality of ranks are set in the reward content, the higher the number or ratio of the tasks achieved so far, the higher the rank of the reward is determined.
Then, a reward granting process is performed for each player to which the player belongs (step S180), and the loop C is terminated (step S182).

If loop C is executed for all uncompleted comp sheets of the group to be processed in loop B, loop B is terminated (step S184), and loop B is executed for all groups extracted in step S120. The uncompleted comp sheet monitoring process is terminated.

Returning to the flowchart of FIG. 17, the server processing unit 200s repeats the processing from step S2 again.

As described above, according to the present embodiment, when a group is formed and registered between friend players, the players belonging to the group can enjoy cooperative play based on a comp sheet in which a plurality of tasks that can be achieved in an online game are defined. Can be done. Then, when all the tasks are completed by the belonging player, a given reward is given to the belonging player of the group in which the comp sheet is set. In other words, instead of the player completing the comp sheet alone, a new and interesting game is realized in which the members belonging to the group complete the comp sheet.

Each task is assigned a player in charge of achievement, that is, a player in charge of achievement. Therefore, it is possible to give the player in charge of achievement the motivation to accomplish the task for the group, which creates a new interest such as fostering a sense of solidarity as a member of the group and activating exchanges within the group. be able to.

[Second Embodiment]
Next, a second embodiment to which the present invention is applied will be described. This embodiment is basically realized in the same manner as the first embodiment. Hereinafter, the differences from the first embodiment will be mainly described, and the same components as those of the first embodiment are designated by the same reference numerals to omit duplication of description.

FIG. 21 is a functional block diagram showing a functional configuration example of the server system 1100 according to the present embodiment. In the present embodiment, the task-in charge correspondence setting unit 226 has a correspondence selection control unit 228. The correspondence selection control unit 228 associates the task with the belonging player based on the selection operation of the belonging player.

FIG. 22 is a flowchart for explaining the flow of processing related to the comp sheet by the server system 1100 in the present embodiment. Basically, it is the same as that of the first embodiment, but instead of step S4, the server processing unit 200s executes the free-selection type comp sheet generation process (step S6). The "free-selection type comp sheet" here is a variant of the comp sheet data 620 for a specific group, and the task candidates that can be assigned to the player in charge of achievement are selected, and the tasks that are actually assigned from the task candidates are selected. It is a comp sheet that the player can freely select.

23 to 24 are flowcharts for explaining the flow of the freely selectable comp sheet generation process. This process is basically the same as the process for generating a comp sheet for a specific group according to the first embodiment, but as shown in FIG. 23, a plurality of task categories are selected instead of steps S58 to S60 (step). S70), tasks according to the difficulty level are selected from the task candidate data 520 (FIGS. 11 to 12) for each selected category, and these are set in the task ID 627 of the player belonging to the processing target. That is, at this stage, a plurality of task candidates are stored in the task ID 627.

Then, moving to the flowchart of FIG. 24, following step S80, the server processing unit 200s performs a process of causing the group leader to select one of the plurality of tasks set in the task ID 627 (step S82). .. For example, on the player terminal 1500 of the group leader, a list of a plurality of tasks set in the task ID 627 for each belonging player is displayed, and one of them is selected. Then, the selection result is transmitted to the server system 1100.
The server processing unit 200s receives this and determines the task to be in charge of each player according to the selection operation of the group leader (step S86). It should be noted that steps S84 to S86 may be performed not only for the group leader but also for each player belonging to the group.

Returning to the flowchart of FIG. 22, in the present embodiment, after the uncompleted comp sheet monitoring process (step S108), the server processing unit 200s reassigns the player in charge of achievement for the comp sheet that has not been completed for a long time. conduct.
Specifically, for all groups, uncompleted comp sheets whose predetermined elapsed time has elapsed from the start date and time 613 of the comp sheet progress management data 610 (FIG. 14) are extracted (step S160). Then, loop E is executed for all the extracted uncompleted comp sheets (steps S162 to S170).

In the loop E, the server processing unit 200s is a player belonging to the group in which the uncompleted comp sheet to be processed is set, and the player belonging to the group playing after the start date and time 613 more frequently than the standard, that is, the player belonging to the group. Select the affiliated player who often plays the game (step S164). Alternatively, a player whose experience value 543 or level 544 of the player character 4 is higher may be simply selected.

Then, the server processing unit 200s changes the player in charge of achieving the unachieved task of the uncompleted comp sheet to be processed to the player belonging to the player selected in step S164 (step S166). In other words, it is a substitute. Then, the process of notifying that the person in charge has been changed is executed (step S168). End loop E (step S170).

According to this embodiment, the task content of the comp sheet and the assignment with the player in charge of achievement can be confirmed and changed in advance on the user side, so that the comp sheet is suitable for the situation of the group that cannot be understood from the server side. be able to. It is not difficult to imagine that the group members will be contacted during the confirmation process. In other words, it can be expected to have the effect of activating friend exchanges, increasing opportunities for communication within the group.

[Modification example]
Although the embodiments to which the present invention is applied have been described above, the embodiments of the present invention are not limited to these, and components can be added, omitted, or changed as appropriate.

[Part 1]
For example, the genre of the main game is not limited to the action RPG, and other genres may be used.

[Part 2]
Further, in the above embodiment, the control related to the comp sheet is performed by the server system 1100, but a configuration in which a part of the functions of the game management unit 210 is performed by the player terminal 1500 is also possible. The same can be said for a game system configuration in which a plurality of player terminals 1500 are connected peer-to-peer.

[Part 3]
Further, in the above embodiment, the task category is randomly selected, but a configuration that reflects the player's wishes is also possible.
Specifically, the category information of the desired task is included in the request for providing the comp sheet in step S2 (FIG. 17). Then, when the task category is selected in step S56 (FIG. 18), the server processing unit 200s may be configured to perform random lottery processing on the received desired task category with a higher probability of appearance than others. Alternatively, the desired task category may be adopted as it is.

[Part 4]
Further, the method for the player to confirm the contents of the comp sheet 10 given to the group to which the player belongs can be appropriately set.
For example, when a predetermined comp sheet information display request operation is input on the player terminal 1500, the server system 1100 causes the player terminal 1500 to display a content confirmation screen based on the comp sheet progress management data 610. On the content confirmation screen, all the set tasks and the player in charge of achievement are displayed. For example, it is preferable to use the explanatory diagram of the comp sheet 10 of FIG. At that time, it is more preferable to add and display a display body (for example, a mark of [Achievement!] Text) indicating achievement / non-achievement to the task.
Of course, the confirmation screen is not limited to the configuration in which all the issues are displayed from the beginning, but only one is displayed at the beginning and the other issues are not disclosed, and when the displayed issues are achieved, New issues may be disclosed. In the case of this configuration, in step S128 of the uncompleted comp sheet monitoring process (FIG. 19), the undisclosed problem may be treated as unachieved.

2 ... Player 4 ... Player character 8 ... Group 10 ... Comp sheet 12 ... Comp sheet ID
14 ... Achievement deadline 16 ... Task 18 ... Achievement player 19 ... Reward 200s ... Server processing unit 210 ... Game management department 211 ... Group management department 212 ... Group index value calculation unit 214 ... Configuration tendency judgment unit 216 ... First task determination unit 218 ... 2nd task determination unit 220 ... 3rd task determination unit 222 ... Comp sheet setting unit 224 ... Delivery type setting unit 226 ... Task charge correspondence setting unit 228 ... Correspondence selection control unit 230 ... Task achievement judgment unit 232 ... Determination unit 234 ... Reward grant processing execution unit 500s ... Server storage unit 503 ... Server system program 505 ... Game management program 506 ... Distribution game client program 512 ... Character initial setting data 514 ... Object initial setting data 520 ... Problem candidate data 521 ... Category 522 ... Difficulty level 524 ... Task content 528 ... Group index value definition data 530 ... Account data 531 ... User account 540 ... Play history data 545 ... Ability parameter value 546 ... Subjugation enemy character list 550 ... Attributable object list 551 ... Owned items List 552 ... Owned game card list 553 ... Presenting list 560 ... Billing history data 564 ... Friend list 600 ... Group registration data 601 ... Group ID
602 ... Date of formation 603 ... Affiliated player count 604 ... Leader account 610 ... Comp sheet progress management data 611 ... Comp sheet ID
615 ... Achievement flag 616 ... Achievement player count 620 ... Comp sheet data for a specific group 621 ... Comp sheet ID
622 ... Provided group ID
627 ... Issue ID
628 ... Achievement player account 629 ... Reward setting data 640 ... Preset type comp sheet data 641 ... Comp sheet ID
642 ... Distribution period 644 ... Issue set 645 ... Applicable group index value range 646 ... Applicable configuration trend 647 ... Issue ID list 648 ... Reward setting data 660 ... Play data 1100 ... Server system 1150 ... Control board 1152 ... IC memory Dp ... Acceptable difficulty Degree points Pg ... Group index value Pp ... Player-specific index value Pp_ave ... Average index value Pp_max ... Maximum index value ΣDp ... Allowable difficulty point total

Claims (9)

A server system for online games that players can enjoy by operating player terminals.
Group management means for registering and managing groups to which multiple players belong,
A comp sheet setting means for setting a comp sheet in which N (N ≧ 2) tasks that can be achieved by a player belonging to the group and an achievement deadline are associated with each other in the online game.
For each task specified in the comp sheet, the task charge correspondence that associates the belonging player who will be the achievement charge player so that the number of tasks for which the same belonging player is the achievement charge player is (N-1) or less. Means and
A task achievement determination means for determining whether or not the player in charge of achievement has achieved the associated task,
Based on the display request operation that requests the player belonging to the group to view the information of the comp sheet, for each task of the comp sheet set in the group, at the time of the display request operation, 1) the content of the task and the content of the task. 2) Compsheet information display control means that controls the player in charge of achieving the task and 3) the player terminal of the player belonging to the player who performed the display request operation to display the achievement progress, which is whether or not the task has been achieved.
A reward granting process executing means for executing a reward granting process for granting a given reward based on the achievement progress of each task of the comp sheet when the achievement deadline of the comp sheet is reached.
A first task determining means for determining a task to be assigned to a player belonging to the player, using an object that can be synthesized in the online game and belongs to the player belonging to the player.
A second task determining means for determining an object obtained by synthesizing objects belonging to different players in the same group as a task, and
Equipped with
The task-in charge mapping means associates the task determined by the first task-determining means with the player to which the task belongs, and the object required for the synthesis of the task determined by the second task-determining means is assigned. Corresponds to the player you belong to,
Server system. Further provided with a third task determining means for determining the task to be assigned to the belonging player using the given parameter value of the belonging player in the online game.
The task charge mapping means associates the task determined by the third task determining means with the player to which the task belongs.
The server system according to claim 1. The third task determination means is 1) number of friends, 2) billing frequency, 3) average billing unit price, 4) cumulative billing, 5) cumulative play time, 6) play frequency, and 7) game progress information. At least one of them is used as the parameter value to determine the task to be assigned to the player to which the player belongs.
The server system according to claim 2. The task charge mapping means has a means for associating a task with a member player based on a selection operation of the member player.
The server system according to any one of claims 1 to 3 . Further provided with a group index value calculation means for calculating a group index value indicating superiority or inferiority of the entire group by using a given parameter value in the online game of each player belonging to the group.
The comp sheet setting means sets a comp sheet in the group according to the group index value calculated by the group index value calculation means.
The server system according to any one of claims 1 to 4 . Further provided with a configuration tendency determining means for determining the tendency of the group composition of the belonging player by using the given parameter value in the online game of each belonging player of the group.
The comp sheet setting means sets a comp sheet in the group according to the tendency determined by the configuration tendency determination means.
The server system according to any one of claims 1 to 5 . In the comp sheet setting means, a part or all of the tasks are the delivery of a specific object among the objects that can be used in the online game, until the completion of the comp sheet, or after the delivery. It has a delivery type setting means for setting a comp sheet specified as an unusable delivery.
The task achievement determination means has a delivery pros and cons determining means for determining whether or not to deliver the specific object belonging to the belonging player based on the operation of the belonging player for the task of delivering the specific object.
The server system according to any one of claims 1 to 6 . The task charge mapping means has a means for changing the player in charge of accomplishing an unachieved task.
The server system according to any one of claims 1 to 7 . The reward granting process execution means modifies the reward content based on at least one of the number, proportion, and type of tasks accomplished.
The server system according to any one of claims 1 to 8 .

Images