JP6562009B2 - Information processing apparatus and game program - Google Patents

Description

  The present invention relates to a team-matching computer game.

  As one of the multiplayer games, there is a game in which a team is formed by a plurality of players and a team battle is performed.

  Patent Document 1 also discloses a team battle type computer game in which a plurality of players form a team and battle with an enemy team. The team is given a reward based on the battle result (see paragraphs [0022] [0023] [0059] of Patent Document 1). It is said that the willingness to participate in the game can be increased by giving a reward (see paragraph [0024] of Patent Document 1).

Japanese Patent Laid-Open No. 2006-135257

  Giving a team a reward based on the result of a match is thought to contribute to fostering a sense of unity and achievement as a team. On the other hand, even if you don't contribute much to the team, you can get rewards if the team wins, and no matter how much you contribute to the team, you can't get rewards if the team loses. It is also a method. In particular, when a player who has superior skill (hereinafter referred to as “advanced person”) loses his team to a player who is inferior to a skill belonging to the same team (hereinafter referred to as “lower person”). Easy to have big complaints. Unfair reward distribution can tend to discourage seniors from belonging to the same team as juniors.

  On the other hand, if a reward is given to a player based on an individual's contribution or activity, the player may not perform team play. The situation of competing for remuneration in the team may also occur, and the significance of the team battle of fighting against enemies while cooperating and supporting each other will fade.

  The present invention is an invention completed on the basis of the above problem recognition, and its main purpose is a mechanism for realizing a reward distribution with a sense of fairness while securing the significance of a team battle in a team battle type computer game, Is to provide.

  An information processing apparatus according to an aspect of the present invention includes a team setting unit that forms a team including one or more characters and sets a battle between two or more teams, and a team according to a first action condition established by the team. A reward setting unit that provisionally rewards each player belonging to the player, and a reward that is actually given to the player from the reward temporarily provisioned to the team according to the second behavior condition established by the player belonging to the team And a reward providing unit to be determined.

  According to the present invention, it is easy to achieve both unity and fairness in reward distribution of a team-matching computer game.

It is a hardware block diagram of a game system. It is an overhead view of a game field. FIG. FIG. It is a schematic diagram for demonstrating the occupation method of a base base. It is a functional block diagram of a game system. It is a data structure figure of team information. It is a flowchart which shows a team organization process. It is a data structure figure of team condition information. It is a data structure figure of personal condition information. It is a schematic diagram which shows the distribution method of the treasure chest in this embodiment. It is a schematic diagram which shows the key distribution method in this embodiment. It is a screen figure of a selection screen. It is a flowchart which shows the process of the reward distribution process performed by the game server after a battle. It is a flowchart which shows the process of the reward provision process performed by the game device after the selection screen is displayed. It is a schematic diagram which shows the distribution method of the treasure chest in a modification. It is a data structure figure of treasure box lottery information.

  In the present embodiment, a description will be given assuming a team battle type arcade game (hereinafter referred to as “game SR”) in which one or more players form a “team” and two teams battle each other. The game SR is an action game. The player operates the character and fights against the character of the enemy team while making full use of swords and magic.

FIG. 1 is a hardware configuration diagram of the game system 100.
In the game system 100, a plurality of stores 108 a, 108 b... 108 n (hereinafter collectively referred to as “store 108” when collectively referred to or not particularly distinguished) are connected to the game server 102 via the Internet 106. Is done.

  The store 108 may be an amusement park or a game center. In the store 108, a plurality of game devices 110 a to 110 f (hereinafter collectively referred to as “game device 110” when collectively referred to or not particularly distinguished) and a game support device 112 are connected by a dedicated line 104. The game device 110 is an arcade game machine called “satellite”, which is a so-called arcade game machine. The game support device 112 is called a “terminal” and supports and assists game play in one or more game devices 110. The game support device 112 and the Internet 106 are connected by wire, but may be connected wirelessly.

  The game support device 112 provides known support functions such as replaying a game play result in the game device 110 (playing back a moving image) and creating a ranking from a plurality of game play results. In general, the game support device 112 executes support processing as processing for further enhancing the interest of game play in the game device 110 such as game production and analysis, but the game support device 112 in the present embodiment is mainly used. It functions as a relay device between the plurality of game devices 110 and the game server 102.

FIG. 2 is an overhead view of the game field 120.
In the game SR, the game server 102 generates a game field 120 (game space) as a three-dimensional virtual space. The player accesses the game server 102 from the game device 110 and enters the team battle. The game device 110 displays an image of a character operated by the player (hereinafter referred to as “avatar”) and a three-dimensional image based on the position and line-of-sight direction of the avatar in the game field 120.

  A maximum of 20 people can participate in the game SR at the same time, and two teams are formed for every 10 people. When the number of people is not available, the game server 102 fills the vacancy with a so-called NPC (Non Player Character). The NPC is a character that the game server 102 automatically operates by AI (Artificial Intelligence) (hereinafter referred to as “proxy character”). Hereinafter, “avatar” and “proxy character” are collectively referred to as “main character 124”. In FIG. 2, the main character 124 is indicated by a triangle mark.

  In the following, the two teams that compete will be called the X team and the Y team. The game field 120 is roughly divided into two, the X team advances in the upward direction of the drawing, and the Y team advances in the downward direction of the drawing. It is assumed that the white triangle indicates the X team main character 124 and the black triangle indicates the Y team main character 124.

  First, the player selects an avatar (main character 124) to be operated from a plurality of types of candidates. In the game SR, characters of various occupations such as a swordsman, a mad warrior, a magic swordsman, a black mage, a white mage, and an archer are prepared. Attribute values such as physical strength, attack power, possible attack range, defense strength, mobility, and weapons and armor that can be equipped vary depending on the occupation.

  The player operates an input device such as a control stick or a button of the game apparatus 110 to give a movement or attack instruction to the avatar. The physical strength value of the main character 124 decreases when attacked by an enemy. The health value increases due to the use of items, the passage of time, recovery magic, and the like. When the health value becomes zero, the main character 124 becomes unable to battle.

  A time limit is set for the game SR (hereinafter referred to as “match time limit”). The battle limit time in the present embodiment is 5 minutes (300 seconds). Even if the main character 124 becomes unable to fight, the main character 124 automatically recovers after a predetermined time (hereinafter referred to as “resurrection waiting time”) if it is within the battle time limit. In this embodiment, it is assumed that the recovery waiting time is 10 seconds. It is designed to be able to play firmly for the time limit of the battle even if it is a junior who is prone to being unable to fight.

  Note that the game limit time or the recovery waiting time may be arbitrarily set by the game designer or the store operator. For example, a longer 800 seconds may be set as the battle limit time, or a shorter 120 seconds may be set. The same applies to the resurrection waiting time.

  In the game field 120, a plurality of base sites 122a to 122h (hereinafter, collectively referred to as “base sites 122”) are set. In FIG. 2, the base site 122a and the base site 122b are occupied by the X team. Base base 122g and base base 122h are occupied by Y team. The four base sites 122c to 122f in the central part are neutral. The neutral base site 122 and the enemy base site 122 can be occupied. The main character 124 that has become unable to battle is revived at the base site 122 (hereinafter referred to as “own site”) occupied by the team (details will be described later).

  Each of the X team and the Y team has a pillar general 126 (target object). The X team god general 126a is initially placed at the base site 122b (X team site). The Y team priest 126b is initially placed at the base site 122g (Y team site).

  Divine general 126 does not have to be one pillar for each team. A team may have a plurality of generals 126. The plurality of generals 126 may have different weapons and different abilities, or may set up defense generals 126 that do not have weapons.

  The base base 122d may be initially set as the base of the X team, and the X team priest 126a may be initially placed in the base base 122d. Similarly, the base base 122f may be initially set as the base of the Y team, and the X team priest 126b may be initially placed in the base base 122f.

  The general general 126 is a huge NPC that is about 1.5 to 5 times larger than the main character 124 and is operated by the game server 102. As shown in FIG. 3, the general general 126 is a powerful character that swings around a huge sword 114 and wipes out enemies. An endurance value is set for the god general 126. If the god general 126 is attacked, its durability value decreases. The player of Team X operates the main character 124 to attack the enemy team's god general 126, and fights against the powerful god general 126 using swords and magic. The general general 126 does not move from the base base 122, but fights the approaching enemy. However, when the general general 126 is greatly injured (when the durability value falls below the threshold), it retreats backward (details will be described later).

The game device 110 displays the endurance value of the god general 126 as a gauge (not shown). When the main character 124 becomes unable to battle, the durability value of the team general is reduced by a predetermined amount as a penalty.
The victory conditions for the game SR are as follows.
(1) Defeat the opponent's general 126 within the time limit.
(2) When the victory condition (1) is not satisfied within the battle time limit, the team with the higher durability value of the general general 126 wins.
After the battle is over, each player is given an experience value. A lot of experience points are given to the members of the winning team, especially the players who have contributed greatly to the victory. When the experience value reaches a predetermined threshold, the “rank” of the player is increased. The rank is an index value indicating the skill level of the player, and is a target of ranking display by the game support device 112.

  Other victory conditions may be additionally set, such as setting the total strength value of all main characters 124 belonging to the opponent team to 0% (defeating the main character 124 of the opponent team).

  The game server 102 further operates an NPC called a veteran soldier 128 (support character). In the present embodiment, five veterans 128 appear at a frequency of once every 30 seconds from the gates 130 arranged one by one in the game field 120. The appearance frequency and the number of appearances of the soldiers 128 can be arbitrarily set by the game designer. The soldier 128 participates in the battle together with the main character 124. The X team veterans 128 emerge from the gate 130a near the base location 122a (the X team's deepest base location 122), and the Y team veterans 128 appear at the base location 122h (the Y team's deepest location). It emerges from a gate 130b near the base site 122).

  As shown in FIG. 4, the soldier 128 has only a simple sword 132 and a shield 134, and usually has weaker attack power / defense power / health strength values than the main character 124. A maximum of 25 male soldiers 128 appear in the game field 120 per team. When the number of the medicinals 128 is 20 or less, five new medicinals 128 are replenished from the gate 130.

  As described above, since there can be 10 main characters and 25 male soldiers 128 per team, a maximum of 70 characters (= (10 + 25) × 2) will be confused and fight. In addition to this battle, two pillars general 126 will join.

  In the game SR, it is possible to reach the point where the enemy general 126 can be attacked and defeat the general 126 while defeating the enemy main character 124 or the soldier 128 or avoiding the battle with the enemy well. It becomes the purpose. Since the general general 126 has a supernatural fighting power, the general general 126 will usually attack the general general 126 in cooperation with many allies. The battle with the god general 126 is a highlight scene where the game SR is most exciting and is a showcase.

FIG. 5 is a schematic diagram for explaining a method of occupying the base site 122.
The base site 122 is defined as an area having a finite size. In the base base 122 of FIG. 5, the main character 124a of the X team and the soldiers 128 enter one by one, and the main character 124b of the Y team also enters. 5 is assumed to be the base of the Y team.

  At the base site 122, if a state where “the number of main characters 124 of the X team is larger than the number of main characters 124 of the Y team (hereinafter referred to as“ reserved state ”)” continues for a certain time, for example, 5 seconds, The base 122 changes from belonging to the Y team to neutral. Even after neutralization, if the secured state can be continued for more than 5 seconds, the base site 122 changes to belong to the X team.

  Thus, in order to take away the base site 122, it is necessary to maintain the “secured state” with a larger number of people than the enemy. Once secured, it is necessary to defend the enemy from entering the base site 122 as much as possible until the occupation is completed. On the other hand, in order to protect the base, it is necessary to take care not to leave the base empty. In order to occupy the base site 122 where the enemy general general 126 is located, it is necessary to exclude the general general 126 by a method described later.

  As described above, even if the main character 124 becomes incapable of fighting, it can be revived (restarted) after the elapse of the reactivation waiting time (10 seconds in the present embodiment). In the game SR, the main character 124 is restored at its own base. In FIG. 2, when the main character 124 of the X team becomes unable to battle, the main character 124 is revived at the base site 122b, which is the forefront base. When the X team occupies the base site 122c, the main character 124 revives at the base site 122c closer to the enemy team than the base site 122b. As the base base 122 is newly occupied, the resurrection point is closer to the enemy team, so the base base 122 has an effect of pushing up the front.

FIG. 6 is a functional block diagram of the game system 100.
As described above, the game system 100 includes the game server 102, the game support device 112, and the game device 110. Each component of the game server 102, the game support device 112, and the game device 110 includes an arithmetic unit such as a CPU (Central Processing Unit) and various coprocessors, a storage device such as a memory and a storage, and wired or wireless communication that connects them. It is realized by hardware including a line and software stored in a storage device and supplying processing instructions to an arithmetic unit. The computer program may be constituted by a device driver, an operating system, various application programs located in an upper layer thereof, and a library that provides a common function to these programs. Each block described below is not a hardware unit configuration but a functional unit block.

(Game server 102)
The game server 102 includes a communication unit 142, a data processing unit 140, and a data storage unit 146.
The communication unit 142 is in charge of communication processing with the game device 110 via the Internet 106 and the game support device 112. The data storage unit 146 stores various data. The data processing unit 140 executes various processes based on the data acquired by the communication unit 142 and the data stored in the data storage unit 146. The data processing unit 140 also functions as an interface between the communication unit 142 and the data storage unit 146. In addition to the game program, the data storage unit 146 stores information indicating the play state of each player.

The data storage unit 146 includes a game data storage unit 152, a player data storage unit 148, and a team data storage unit 150.
The game data storage unit 152 stores a game program for the game server 102. The player data storage unit 148 stores information indicating the progress of the game for each player, such as each player's level, item, name, battle record (cumulative number of plays, winning percentage, etc.). The player data storage unit 148 stores avatar equipment (weapons, armor, etc.) and attributes (physical strength value, mobility, attack power, defense power, etc.) used by each player. The team data storage unit 150 stores team information indicating the organization of the team. The team information will be described later with reference to FIG.

  The data processing unit 140 includes a game control unit 154 that coordinates operations of one or more players with respect to the game SR, and a player management unit 156 that manages the play state of each player.

  The game control unit 154 includes a target control unit 158, a proxy character control unit 160, a win / loss determination unit 162, a support control unit 164, a base management unit 166, a reversion processing unit 168, a reward setting unit 170, team information 200, and a reward providing unit 202. , A reward notification unit 204 and a reward enclosing unit 206 are included.

  The target control unit 158 controls the god general 126 (target object) according to the game program. The proxy character control unit 160 controls the proxy character according to the game program. The winning / losing determination unit 162 determines the winning / losing of the two teams competing based on the above-described winning conditions. The support control unit 164 controls the general soldier 128 (support character). The site management unit 166 determines whether or not the base site 122 is occupied. The base management unit 166 checks the main character 124, the genius soldier 128, and the general general 126 existing in the base base 122 in real time, determines the success or failure of the secured state, and measures the duration of the secured state.

  The restoration processing unit 168 determines whether or not the main character 124 that has become unable to fight is restored. The resurrection processing unit 168 determines whether or not the main character 124 has become unable to battle, determines whether or not the recovery waiting time has elapsed since the battle has become impossible, and at which base site 122 the main character 124 Determine whether to revive.

  In the game SR, a reward is given to each player after the battle. The reward setting unit 170 determines the type and number of rewards (treasure chests) to be given to the team based on the team action results. The reward providing unit 202 determines a reward to be given to the player based on the action result of the player. The reward notification unit 204 notifies the player of a reward acquired during the battle. The reward enclosing unit 206 encloses the reward in a treasure box. The method for granting a reward will be described in detail with reference to FIG.

The player management unit 156 includes a team setting unit 172.
The team setting unit 172 organizes two teams of one or more players. The team formation method will be described in detail with reference to FIG.

(Game device 110)
The game device 110 includes a user interface processing unit 180, a data processing unit 182, a data storage unit 184, and a communication unit 186.
The user interface processing unit 180 accepts operations from the player via input devices such as buttons and control sticks, and is also responsible for processing related to the user interface such as image display and audio output. The communication unit 186 is in charge of communication processing with the game server 102 and other game devices 110 via the Internet 106. The data storage unit 184 stores various data. The data processing unit 182 executes various processes based on the data acquired by the user interface processing unit 180 and the communication unit 186 and the data stored in the data storage unit 184. The data processing unit 182 also functions as an interface for the user interface processing unit 180, the communication unit 186, and the data storage unit 184.

  The user interface processing unit 180 includes an input unit 194 that receives input from the player, an output unit 196 that outputs various information such as images and sounds to the player, and a selection display unit 208 that displays a selection screen described later. The selection screen is a screen for the player to select a reward, and details will be described later with reference to FIG.

  The data storage unit 184 includes a game data storage unit 192 that stores a game program of the game SR. The game program stored in the game data storage unit 192 of the game apparatus 110 is mainly responsible for the generation of the game screen and the operation of the avatar, and the game program stored in the game data storage unit 152 of the game server 102 is a team organization. In charge of attack success / failure determination, winning / losing determination, control of NPC (substitute character, general general 126, spear soldier 128, etc.).

The data processing unit 182 includes a game execution unit 190.
The game execution unit 190 controls the progress of the game SR in cooperation with the game server 102 in accordance with the game program stored in the game data storage unit 192. The game execution unit 190 generates a three-dimensional image according to the avatar position and the line-of-sight direction in the game field 120.

  The user interface processing unit 180 detects various inputs by the user, and the game execution unit 190 notifies the game server 102 of input information via the communication unit 186. In response to this input information, the game control unit 154 of the game server 102 controls the progress of the game in cooperation with the game execution unit 190 of the game apparatus 110.

FIG. 7 is a data structure diagram of the team information 200.
The team information 200 is stored in the team data storage unit 150 of the game server 102. As described above, the game SR is played by a total of 20 main characters 124 of 10 to 10. When the number of participants is less than 20, the substitute character control unit 160 supplements substitute characters for the number of vacancies.

  In the team information 200 of FIG. 7, the battle cards of the X team and the Y team are assembled. The rank of the player with player ID = P11 assigned to team X (hereinafter referred to as “player (P11)”) is 27. Each character, weapon, and armor is identified by an ID.

  For example, the player (P11) uses “magic swordsman” associated with the character ID = C1 as an avatar. The character (C1) is equipped with “fire blade” associated with weapon ID = W1 and “scale armor” associated with armor ID = A4.

The character (NPC1) belonging to the Y team is a proxy character with rank = 25. The proxy character (NPC1) is a “crazy warrior” associated with the character ID = C3, and is equipped with “Crystal Ax” associated with the weapon ID = W6 and “Scalar Armor” associated with the armor ID = A4. ing.
Among the 20 main characters, avatars are 1 or more and 20 or less. That is, it is possible for only one player to participate and the proxy character to take charge of the remaining 19 players.

FIG. 8 is a flowchart showing the team formation process.
First, the team setting unit 172 starts the entry mode. The entry mode is canceled when a predetermined waiting time (hereinafter referred to as “entry time”), for example, 1 minute has elapsed. During the entry mode, the team setting unit 172 accepts a play application from the game devices 110 nationwide. The team formation process in FIG. 8 is executed after the entry time has expired.

  In the entry mode, when the number of players who have applied for play is 20 or more (Y in S10), the team setting unit 172 randomly extracts 20 of them to form two teams of 10 to 10 players, A card is determined (S14). When the number of players is less than 20 (N in S10), the substitute character control unit 160 sets substitute characters for vacancies (S12).

  After determining the battle team, the target control unit 158 initially arranges a general general 126 to be associated in advance for each game field 120 from a plurality of types of general general 126 at the base base 122 of each team (S16). Note that the target control unit 158 may randomly select a general general 126 from a plurality of types of generals 126, or a player (representative) may select a general general 126 from a plurality of types of generals 126. After the initial placement of the god general 126, the game SR is started. The player operates the avatar on the game device 110 and moves toward the enemy general general 126.

[Reward distribution]
After the match is over, the game server 102 provides a “reward” to the player based on the team results (results) and personal results (contribution). "Reward" means weapons, armor, keys (discussed later), items, game points (virtual currency in the game), continuation rights, etc. that are effective for the player to advance the game advantageously, and those that expand the range of game development If it is.

  The reward enclosing unit 206 encloses the reward in a “treasure box”. The player is provided with a reward in a state enclosed in a treasure box (an object with which the reward is associated) (temporary grant). The player acquires a reward by unlocking the treasure chest. If you do not unlock the treasure chest, you will not know the contents (reward). The key breaks when you unlock the treasure chest. Only one treasure chest can be opened with one key.

  Although details will be described later, the number n (first number) of treasure chests (first provision) given to each player is determined according to the team results, and the number of keys is determined according to the personal results. Usually, it is easy to satisfy n> m. If team performance is good, the number n of treasure chests will increase. However, if the personal performance is poor, the number m of keys is reduced. There is a possibility that a large number of rewards can be obtained if the team results are good, but the number of rewards that can be actually obtained is small if the individual results are bad.

FIG. 9 is a data structure diagram of the team condition information 210.
The team condition information 210 is stored in the game data storage unit 152 and defines an action condition to be achieved as a team (hereinafter referred to as “first action condition”). The reward setting unit 170 adds the number of treasure chests to be given to a team every time the team satisfies any first action condition.

The first action condition is roughly divided into a “battle condition” and a “win / lose condition”.
The battle condition is an action condition that is achieved based on the team action during the battle. For example, when the X team retreats the enemy (Y team) priest 126 from the base base 122, the reward setting unit 170 increases the number of treasure boxes given to the X team by one. When the X team destroys 20 main characters 124 of the Y team, the reward setting unit 170 further adds the number of treasure boxes of the X team. However, even if seven or more battle conditions are satisfied, the maximum number of treasure chests that can be acquired by the battle condition is six. Therefore, the number of treasure chests given when the battle condition is satisfied is 0 to 6.

The winning / losing condition is an action condition achieved based on the winning / losing of the team battle. For example, when the X team priest 126 defeats the enemy (Y team) priest 126, the X team is given four treasure chests and the Y team is given one treasure chest. Is done. If there is no match within the match time limit, two treasure chests will be awarded to both teams. The number of treasure chests given according to the winning / losing conditions is 1 to 4.
Therefore, based on the first action condition, the reward setting unit 170 gives 1 to 10 treasure chests to the two teams that compete. Note that giving n1 treasure chests to the X team means giving n1 treasure chests to each player belonging to the X team. However, the provision of a treasure box at this stage is merely a “provisional provision” of a reward, and the number of rewards that the player can actually acquire depends on the number of keys (details will be described later).

FIG. 10 is a data structure diagram of the personal condition information 212.
The personal condition information 212 is stored in the game data storage unit 152 and defines an action condition to be achieved as an individual (hereinafter referred to as “second action condition”). Each time the player satisfies any second action condition, the reward providing unit 202 adds the number of keys (treasure box unlocking right) to be given to the player.

  The reward providing unit 202 of this embodiment calculates a score based on the player's action. The score is an index of individual performance (contribution). Specifically, when an enemy main character 124 or a general general 126 is hit, an enemy soldier 128 is defeated, or when the health value of the main character 124 of the ally is restored, the ally that has become unable to battle. When the main character 124 is revived by magic or the like, a plurality of types of determination conditions are set, such as when an attack on the main character 124 is prevented. A score is added every time these determination conditions are satisfied.

  A determination condition and a score to be added when the determination condition is satisfied are associated in advance. The determination condition and the score may be arbitrarily set by the game designer, but it is preferable to add the score to the action that contributes to the victory of the team. This is to provide an incentive to encourage players to contribute to the team.

  According to the personal condition information 212 of FIG. 10, the reward providing unit 202 gives one key to a player whose score is 0 points. Two keys are given to a player whose score is 50 points or less. On the other hand, seven keys are given to a highly contributing player who has scored 351 points or more.

  Aside from the score, the reward providing unit 202 selects an MVP (Most Valuable Player) from a maximum of 20 players. The way to select MVP can be set arbitrarily. For example, evaluation criteria such as the enemy's general 126 first hit with an attack, the best recovery of the allies, and the most destruction of the enemy soldiers 128 are conceivable. Any one of the plurality of evaluation criteria may be selected at random, or the player who corresponds to the most among the plurality of evaluation criteria may be MVP. A player selected as MVP is further given one key. One key is also given to the player who has obtained the highest score among all players (1st overall). Therefore, the player acquires 1 to 9 keys for each battle.

  A plurality of types of MVPs may be set. For example, the player who hit the enemy with the most attacks, the player who recovered the best health value of the allies, and the player who killed the most common soldiers 128 as the MVP for each department, Also good. Also, regardless of the degree of contribution, one person may be randomly selected from a plurality of players, and a key may be additionally given to the selected player.

FIG. 11 is a schematic diagram showing a method for distributing the treasure chest 214.
It is assumed that the X team and the Y team face each other, and the winning X team satisfies the six first action conditions, and the defeated Y team satisfies the two first action conditions. The reward setting unit 170 gives six treasure chests 214 to each player (P11), player (P43),..., Player (P71) belonging to the X team. Similarly, the reward setting unit 170 temporarily gives two treasure chests 214 to each player (P22), player (P56),..., Player (P87) belonging to the Y team.

FIG. 12 is a schematic diagram showing a method for distributing the key 216.
The reward enclosing unit 206 randomly assigns one of a plurality of types of rewards to the treasure box 214. The same reward is assigned to each player belonging to the same team. For example, the reward assigned to the first treasure chest 214 of the player (P11) of the X team is the same as the reward assigned to the first treasure chest 214 of another player (P43) of the X team.
It should be noted that the rewards assigned to each player in the team may not match completely, and different rewards of the same grade may be assigned based on the grade as will be described later.

  Each player is given a key 216 separately from the treasure chest 214. The reward providing unit 202 refers to the personal condition information 212 and determines the number of keys 216 to be granted based on the second action condition established by the player. Although the player (P11) is given six treasure chests 214, his contribution to the team is low, so only one key 216 is given. Therefore, the player (P11) can unlock only one of the six treasure chests 214. In other words, six rewards were provisionally given to the player (P11), but only one reward was actually given. The player (P43) is given five keys 216 because his contribution is high. Therefore, the player (P43) can unlock five treasure chests 214 out of the six treasure chests 214. The player (P43) was provisionally given six rewards, as with the player (P11) belonging to the same X team, of which five rewards were acquired.

Even when the key 216 is insufficient, the treasure chest 214 can be unlocked by paying a predetermined amount with cash or electronic money, or by using virtual currency or virtual points that can be used in the game. When the player (P11) pays a predetermined amount for the key 216, the reward providing unit 202 provides the second key 216 to the player (P11). As a result, the player (P11) can unlock the second treasure chest 214 among the six treasure chests 214. When the player (P11) wants to unlock all the remaining treasure chests 214, the player (P11) needs to pay a price corresponding to the five keys 216. If the price is paid, the player (P11) can unlock all of the six treasure chests 214.
Note that when purchasing a plurality of keys 216 together, a fee is discounted compared to purchasing the keys 216 one by one.

  Two treasure chests 214 and one key 216 are given to the player of team Y (P22). Since the player (P56) is provided with two treasure chests 214 and three keys 216, the key 216 is left over. At this time, the reward providing unit 202 gives a “privilege” to the player (P56). The reward providing unit 202 according to the present embodiment grants game points (virtual currency in the game) that can be used to purchase items or the like in the game SR as benefits as a price for eliminating the surplus key 216.

FIG. 13 is a screen diagram of the selection screen 218.
The selection screen 218 is displayed by the selection display unit 208 on the game device 110 after the match is over. FIG. 13 shows a selection screen 218 displayed on the game device 110 of the player (P43) belonging to the X team. The player (P43) is given six treasure chests 214 and five keys 216 (see FIG. 12). The player (P43) first selects the first treasure chest 214 to be unlocked from the six treasure chests 214. In FIG. 13, the first treasure chest 214 is unlocked and “Holy Sword Excalibur” is acquired as a reward. Since one of the five keys 216 is used, the remaining number of keys 216 is four. The player (P43) can unlock the remaining four treasure chests 214 from the remaining five treasure chests 214.

FIG. 14 is a flowchart illustrating a reward distribution process performed by the game server 102 after the battle.
When the team battle is over, the reward setting unit 170 determines whether the first action condition of each of the two teams is successful, and determines the number of treasure chests 214 to be given to each team (S10). Next, the reward providing unit 202 determines success or failure of the second action condition for each player, and determines the number of keys 216 to be given to each player (S12).

  The reward setting unit 170 randomly assigns rewards for each treasure box 214 (S14). Finally, the communication unit 142 instructs each game device 110 to display the selection screen 218 (S16). At this time, the number of treasure chests 214, the correspondence between treasure chests 214 and rewards, and the number of keys 216 are also notified. For example, for the game device 110 of the player (P11) belonging to the X team, the number of treasure chests 214 = 6, the reward associated with each treasure chest 214 and the number of keys 216 assigned to the player (P11) = 1. Is displayed, and the selection display unit 208 of the game apparatus 110 displays the selection screen 218 based on these pieces of information.

  The reward setting unit 170 may select a reward when the first action condition is established during the battle, that is, each time the treasure chest 214 is added. The reward notification unit 204 may display the selected reward on the screen during play. For example, when the X team establishes the first action condition and the reward setting unit 170 selects “Holy Sword Excalibur” as the reward, the reward notifying unit 204 sends the “Holy Sword Excalibur” to the game device 110 of the player belonging to the X team. "Is acquired. In this case, in order to know that the “Holy Sword Excalibur” is enclosed in any of the treasure chests 214 given to the X team, the player belonging to the X team 1 gets the “Holy Sword Excalibur”. It is expected to struggle to get as many keys 216 as possible. Thus, it becomes easy to raise a player's morale by clearly showing the reward obtained during the battle to the player. The output unit 196 of the game apparatus 110 may always display the acquired reward on the screen during the battle.

FIG. 15 is a flowchart showing a reward providing process performed by the game apparatus 110 after the selection screen 218 is displayed.
When the game server 102 instructs the display of the selection screen 218, the selection display unit 208 displays the selection screen 218 (see FIG. 13). First, when there is an unlocked treasure chest 214 (Y in S20) and the player has an unused key 216 (Y in S22), the input unit 194 accepts the selection of the treasure chest 214 by the player ( S24). The output unit 196 displays a reward associated with the selected treasure chest 214 in advance (S26). Thereafter, the process returns to S20.

  If there is an unlocked treasure chest 214 (Y in S20), but no key 216 remains (N in S22), the player can acquire an additional key 216 by paying a predetermined price. When the price of the key 216 has been paid (Y in S28), additional selection of the treasure chest 214 is possible (S24), and the reward enclosed in the selected treasure chest 214 is displayed on the screen (S26). When the price for the additional key 216 has not been paid (N in S28), the game execution unit 190 notifies the game server 102 of the already acquired reward via the communication unit 186 (S34). The player management unit 156 registers the player ID and the reward ID in the player data storage unit 148 in association with each other. Thereby, the player can use the newly obtained reward from the next battle.

  When all the treasure chests 214 are unlocked or there are no unlocked treasure chests 214 (N in S20), if the key 216 remains (Y in S30), the reward providing unit 202 gives the player the remaining keys 216. A privilege corresponding to is provided (S32). In the present embodiment, an amount of game points obtained by multiplying the remaining number of keys 216 by a predetermined coefficient is provided as a privilege. If the key 216 does not remain (N in S30), the process in S32 is skipped.

The game system 100 has been described above based on the embodiment.
According to this embodiment, a reward is given to each player according to the result of the team battle. After the battle, items, weapons, armor, and other rewards useful in favor of the battle can be obtained, so that it becomes easy for the player to motivate the player to participate in the team battle again.

  Reward acquisition is predicated on two game elements, a treasure chest 214 and a key 216. The number of treasure chests 214 is determined based on the results of the team, that is, the battle results. The number of keys 216 is determined based on individual struggle, in other words, the degree of contribution. It is easy to activate team battles as it can encourage individual struggle as well as a sense of unity as a team. Even if a team loses, the individual struggle can be rewarded by granting many keys 216, and even if the team wins, many rewards cannot be obtained unless they contribute to the team. As a result, reward distribution with fairness is realized.

  In addition, by setting a large number of battle conditions that can be achieved during the battle, not only the battle results but also the battle process (how to proceed with the battle) can be evaluated. Similarly, not only winning and losing but also “winning” and “losing” such as overwhelming, hard win, defeat, and complete defeat are also evaluated. Therefore, even when one sees the outcome of winning or losing, the player tries to get as many treasure chests 214 as possible, so that each player can easily do his best to the end.

  In addition, contributions other than “fight” can be evaluated by diversifying the first action condition and the second action condition. For example, there are various ways to contribute, such as recovering the stamina value of a teammate, taking on a battle with the genius soldier 128, serving as a guard or supporter of a teammate, and attracting enemies by moving around a long distance (positive action battle). According to the present embodiment, it is possible to reward a player who performs an effective team play even if it is plain. Even if you are a junior who is not good at fighting, it will be easier to find a way to contribute to your team, so it will be easier to maintain unity even if your team consists of both advanced and junior teams.

  In general, when selecting a job type for the main character 124, a job type in charge of close combat such as a swordsman tends to be popular. For this reason, job types tend to be biased when teams are formed, and even if various job types are prepared, job types that are not so selected are likely to appear. In this embodiment, since the contribution can be positively evaluated even for a relatively sober occupation such as a recovery mage, it is easy to promote diversification of occupation selection.

  In addition, this invention is not limited to the said embodiment and modification, A component can be deform | transformed and embodied in the range which does not deviate from a summary. Various inventions may be formed by appropriately combining a plurality of constituent elements disclosed in the above embodiments and modifications. Moreover, you may delete some components from all the components shown by the said embodiment and modification.

  Although it has been described that the game system 100 is configured by a plurality of game support devices 112, a plurality of game devices 110, and one game server 102, some of the functions of the game device 110 and the game support device 112 are realized by the game server 102. A part of the function of the game server 102 may be assigned to the game device 110 or the game support device 112. A part of the function of the game support device 112 may be realized by the game device 110, or a part of the function of the game device 110 may be realized by the game support device 112. In addition, a third device other than the game server 102, the game device 110, and the game support device 112 may bear a part of the functions.

  The game system 100, which is a collection of the functions of the game device 110, the game support device 112, and the game server 102 described with reference to FIG. 6, can be generally understood as one “information processing device”. How to allocate a plurality of functions necessary for realizing the present invention to one or a plurality of hardware depends on the processing capability of each hardware, the specifications required for the game system 100, and the like. It only has to be decided.

FIG. 16 is a schematic diagram showing a method for distributing the treasure chest 214 in the modification.
In the present embodiment, it has been described that the number of treasure chests 214 is changed according to the first action condition achieved by the team. As a modification, the quality of the treasure chest 214 (reward) may be changed according to the first action condition.

  First, “grade” is set in advance for items, weapons, and armor to be rewarded. There are four grades, S, A, B, and C, from the highest, and the game designer may arbitrarily set the grade taking into consideration the rarity and usefulness of the reward. There are three types of treasure chest 214 in the modified example: gold, silver, and copper. Although details will be described later, rewards with higher grades are more likely to hit in the order of gold, silver, and copper.

  In the modified example, a predetermined number, for example, 10 treasure chests 214 are always given to both the X team and the Y team that have competed. However, the breakdown of gold, silver, and copper in the treasure chest 214 is different for each team. In FIG. 16, five gold boxes 214A, three silver boxes 214B, and two copper boxes 214C are assigned to the X team. On the other hand, one gold box 214A, five silver boxes 214B, and four copper boxes 214C are given to the Y team. The X team player is more likely to receive a higher grade reward than the Y team player.

  For example, the first action condition may be classified into “gold condition” and “silver condition”. First, all ten treasure chests 214 are initially set in a copper chest 214C. When the team achieves one gold condition (first action condition), the reward setting unit 170 changes one copper box 214C to a gold box 214A. When the team achieves two gold conditions, the reward setting unit 170 changes the other copper box 214C to the gold box 214A. When the copper box 214C does not exist, the silver box 214B is changed to the gold box 214A.

  Similarly, when the team achieves the silver condition (first action condition), the reward setting unit 170 changes one copper box 214C to the silver box 214B. The gold box 214A is not changed to the silver box 214B. With such a processing method, the quality of the treasure chest 214 is changed according to the achievement degree of the first action condition.

FIG. 17 is a data structure diagram of treasure box lottery information 220 used in the modification.
In the treasure box lottery information 220, the probability (appearance rate) that a reward of each grade is given to each of the gold box 214A, the silver box 214B, and the copper box 214C is set. For example, from the gold box 214A, the grade S reward is selected at 9%, the grade A reward at 20%, and the grade C reward at 70%, but the grade C reward is not selected. The key 216 is selected with a probability of 1%. When the player selects the treasure box 214 on the selection screen 218, the reward providing unit 202 performs lottery with reference to the treasure box lottery information 220, and determines the grade of reward corresponding to the type of the selected treasure box 214. For example, when grade S is selected, the reward providing unit 202 randomly selects a grade S reward. When the key 216 is won, the reward providing unit 202 increments the remaining number of the key 216.

  From the silver box 214B, the grade S reward is selected with a probability of 1%, the grade A reward is 10%, the grade C reward is 60%, and the grade C reward is 28%. The key 216 is selected with a probability of 1%. Therefore, the gold box 214A is more advantageous to the player than the silver box 214B. On the other hand, the copper box 214C is more disadvantageous for the player than the silver box 214B.

  Even in the copper box 214C, there is a possibility that a grade S reward can be obtained. When the copper box 214C is unlocked and a grade S reward is received, the game execution unit 190 may arouse the player's expectation by outputting a special effect image or sound different from normal.

  The number of treasure boxes 214 may be determined according to the first action condition, and the distribution of the gold boxes 214A, the silver boxes 214B, and the copper boxes 214C may be determined according to the rank of the player. For example, it is assumed that a team to which a player of rank = 70 belongs is given six treasure chests 214. Further, it is assumed that a selection probability of “gold: 40%, silver: 60%” is associated with rank = 70 in advance. In this case, each of the six treasure chests 214 is converted into a gold chest 214A with a probability of 40%. The expected value of the ratio occupied by the gold box 214A out of the six treasure boxes 214 is 2.4 (= 6 × 0.4). Here, it is assumed that two treasure chests 214 become gold chests 214A.

  The reward setting unit 170 converts each of the remaining four treasure boxes 214 to the silver box 214B with a probability of 60%. At this time, it is assumed that three of the four treasure boxes 214 are converted into silver boxes 214B. As a result, the six treasure boxes 214 provisionally given by the team battle have two gold boxes 214A, three silver boxes 214B, and one copper box 214C. Although the above is an example, in such a processing method, the quality of the reward may be determined according to the rank of the player.

High-ranking players (advanced players) often already have powerful weapons, armor, and items. According to such a control method, it becomes difficult for high-rank players to receive unnecessary low-grade rewards. In addition, it is difficult for high-grade rewards to hit low-ranking players (lower-level players). As a result, since a reward according to the rank of the player can be provided, it becomes easy to maintain the game balance.
Note that the number of keys 216 may be determined according to the individual performance (degree of contribution) at the time of the battle, as in the present embodiment.

  In the present embodiment, the number of treasure chests 214 given to each player belonging to the same team has been described as being the same. For example, when six treasure chests 214 are given to the X team player (P11), six treasure chests 214 are also given to another player (P43) of the X team. As a modified example, the number of treasure chests 214 provided among players belonging to the same team may be varied.

  The number of treasure chests 214 may be initially set according to the first action condition, and the added number of treasure chests 214 may be calculated for each player according to the second action condition. For example, suppose that six treasure chests 214 are given based on the team results of team X. It is assumed that the addition number = 1 is set for the player (P11) of the X team and the addition number = 5 is set for another player (P43) of the X team. The number of additions may be calculated by a method similar to the method for calculating the number of keys 216 in the present embodiment. In this case, seven (= 6 + 1) treasure chests 214 are given to the player (P11), and eleven treasure chests 214 (= 6 + 11) are given to the player (P43). The number of treasure chests 214 given to each player is determined based on the team results and the player's contribution. In this case, all the keys 216 may be opened without using the key 216.

  In the present embodiment, it has been described that the number of treasure chests 214 to be given to each team is determined according to the success or failure of the first action condition. For example, in FIG. 11, six treasure chests 214 are given to the X team, and two treasure chests 214 are given to the Y team. As a modification, the number of treasure chests 214 given to each team may be a fixed value. For example, ten treasure chests 214 may be given to each team regardless of whether the first action condition is successful. In this case, in the example shown in FIG. 11, four treasure chests 214 are additionally given to the X team, and eight treasure chests 214 are additionally given to the Y team. The additional treasure chest 214 is a “wooden chest” and may be set so that a reward with a lower expectation than the regular treasure chest 214 is provided. The wooden box may be a treasure box 214 that can be opened without using the key 216.

  A rank may be given to the key 216. For example, the gold box 214A can be unlocked with a high probability if it is a gold (high rank) key 216, while the silver (medium rank) key 216 is unlocked so that there is a high possibility of unlocking failure. A lock success rate may be set. The higher the player rank, the more high-rank keys 216 may be given. The rank distribution of the keys 216 may be the same as the above-described method for determining the distribution of the gold box 214A, the silver box 214B, and the copper box 214C. The higher the player's contribution, the more high-ranked keys 216 may be given.

As described above, not the number of keys 216 but the quality may be changed according to the rank and contribution of the player. According to such a control method, it is determined whether to prepare for failure and challenge to unlock the treasure chest 214 with the lower rank key 216 or to select the treasure chest 214 that is easy to unlock. Can provide fun.
By paying the consideration, a universal key 216 that can reliably unlock all the treasure chests 214 may be acquired.

  In addition to the degree of contribution, the number of keys 216 may be changed according to the rank of the player. Further, the number of keys 216 necessary for unlocking may be changed according to the type of treasure chest 214. For example, ten keys 216 may be required to unlock the gold box 214A, three keys 216 may be required to unlock the silver box 214B, and one key 216 may be required to unlock the copper box 214C. .

  Not only the method shown in the present embodiment, but the number and quality of rewards or the number and quality of keys 216 are changed according to the first action condition, the second action condition, and the rank of the player, so Reward distribution that takes into account both personal and personal contributions becomes possible.

  The key 216 may be provided as a reward from the treasure chest 214, or a “fragment of the key 216” may be provided. When a predetermined number of pieces of the key 216 are collected, one key 216 may be obtained.

  As described with reference to FIG. 10, in this embodiment, the player obtains a score each time an action that contributes to the team is performed. As a modified example, score subtraction may be performed. For example, when an enemy action such as attacking a teammate (incorrectly) or restoring an enemy is executed, the score of the player may be subtracted. Because you can penalize the act of disturbing the team's harmony, it will be easier to guide everyone to fair play without having to write down the prohibitions.

  In the present embodiment, the reward is enclosed in the treasure chest 214, and it is described that the player does not know what the reward is in the treasure chest 214 until unlocked. The same applies when notifying the player of the reward obtained during the match. For example, suppose that it was informed that “Holy Sword Excalibur” was given during the match. After the match is over, the player knows that the holy sword excalibur is “in certain” in any of the treasure chests 214 assigned to the team, but does not know which treasure chest 214 is in. As a modification, information suggesting a reward enclosed in the treasure chest 214 may be indicated. Specifically, a reward silhouette, a category such as “weapon / armor / item”, “equipment / consumable”, grade, etc. can be considered. For example, when a “Holy Sword Excalibur” is provisionally given to a team, among the multiple treasure chests 214, the treasure chest 214 in which the “Holy Sword Excalibur” is encapsulated shines with a high probability, for example, a probability of 60% or more. In other words, you may suggest “winning”.

  The reward obtained during the battle may be informed to the player and then enclosed in any treasure box 214. Alternatively, when the treasure chest 214 is unlocked, a lottery may be executed to select a reward as a content.

  Rewards may be provided without being enclosed in the treasure chest 214. For example, the number of rewards may be determined based on the first action condition, and the number of rewards that can be acquired from the number may be determined based on the second action condition.

  The treasure chest 214 that has not been unlocked due to lack of the key 216 may disappear as it is. Alternatively, the unlocked treasure chest 214 may be held by the player. The player may unlock the treasure chest 214 that has been unlocked when the key 216 is obtained.

  The “privilege” in the present embodiment has been described as being a game point (virtual currency). As a modified example, the privilege may be a key 216 or an object effective for advantageously playing a weapon, armor, item, or the like. In the next battle play, the player's ability may be temporarily or permanently increased like a special attack that can be executed only for a certain period of time. The key 216 may be transferable from one player to the other player.

  In the present embodiment, it has been described that the unlocked key 216 can be unlocked by paying a price. The consideration may be a cash equivalent or a game point.

  In the present embodiment, the game SR as a multi-competitive action has been described as an object. However, the present invention is not limited to the action game but can be applied to other types of games such as a simulation game and a role playing game. is there.

  In the present embodiment, an arcade game has been described as an object, but the game system 100 may be realized by a home game machine, a personal computer, a smartphone, or the like.

  100 game system, 102 game server, 104 dedicated line, 106 Internet, 108 stores, 110 game device, 112 game support device, 114 sword, 120 game field, 122 base base, 124 main character, 126 god general, 128 corps 130 gate, 132 sword, 134 shield, 140 data processing unit, 142 communication unit, 146 data storage unit, 148 player data storage unit, 150 team data storage unit, 152 game data storage unit, 154 game control unit, 156 player management unit 158 Target control unit, 160 Proxy character control unit, 162 Win / Loss determination unit, 164 Support control unit, 166 Base management unit, 168 Resurrection processing unit, 170 Reward setting unit, 172 Team setting unit, 180 User interface Interface processing unit, 182 data processing unit, 184 data storage unit, 186 communication unit, 190 game execution unit, 192 data storage unit, 194 input unit, 196 output unit, 200 team information, 202 reward provision unit, 204 reward notification unit, 206 reward enclosing part, 208 selection display part, 210 team condition information, 212 personal condition information, 214 treasure box, 216 key, 218 selection screen, 220 treasure box lottery information

Claims (7)

A team setting unit that forms a team including one or more characters and sets a battle between two or more teams;
In accordance with the first action condition established by the team, a reward setting unit that temporarily provisions a reward individually to each player belonging to the team;
In accordance with a second behavior condition established by a player belonging to the team, a reward acquisition right temporarily granted to the player is given to the player, and when the player exercises the acquisition right, An information processing apparatus comprising: a reward providing unit that actually grants a reward. 2. The reward setting unit according to claim 1, wherein the reward setting unit determines the number of rewards to be temporarily provided to each player belonging to the team according to a first action condition established by the team. Information processing device. The reward providing unit determines the number of rewards that the player can actually acquire among the rewards provisionally given to the player according to a second action condition established by the player. Item 3. The information processing device according to Item 2. The information processing apparatus according to claim 3, wherein the reward providing unit grants the acquisition right to the player even when the player pays the consideration for the acquisition right .   5. The reward setting unit according to any one of claims 1 to 4, wherein the reward setting unit determines a kind of reward that is provisionally given to each player belonging to the team according to a first action condition established by the team. The information processing apparatus described in 1. The information processing according to any one of claims 1 to 5, further comprising: a reward notifying unit for notifying a player who is in a battle of a reward that may be actually given to the player. apparatus. The ability to organize a team that includes one or more characters and set up a match between two or more teams;
According to the first action condition established by the team, a function of temporarily provisioning a reward individually to each player belonging to the team;
In accordance with a second behavior condition established by a player belonging to the team, a reward acquisition right temporarily granted to the player is given to the player, and when the player exercises the acquisition right, A game program characterized by causing a computer to exhibit a function of actually giving a reward .

Images