JP2018033929A - Information processor, game program, and information processing method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide an interesting game.SOLUTION: An information processor comprises: a matching processing unit to match players against each other as their opponents in a match game in which a winner and a loser are determined in a match; an appearance probability determination processing unit to determine an appearance probability of each enemy character to be matched against each player on the basis of an appearance point imparted according to actions of each of the matched players in the match; an appearance processing unit to determine, when one of the matched players has performed an operation regarding the match against the other player, whether to allow matchable appearance of an enemy character to be matched against the one player on the basis of the determined appearance probability; and an acquisition point imparting processing unit to impart acquisition points to the players according to match results such that the acquisition point imparted upon defeating the enemy character is more than the acquisition point imparted upon defeating the opponent player.SELECTED DRAWING: Figure 1

Description

  The present invention relates to an information processing device, a game program, and an information processing method.

  There is a game in which a plurality of players participate and perform one event. At that time, a game that can perform a battle (event) in cooperation with a fellow player on the same enemy character (raid boss) is widely known. As an example of such a game, there is a game in which the game development is widened so that the raid bosses can take actions (change the parameters) (for example, Patent Document 1).

JP 2016-087425 A

The game described in Patent Document 1 only changes the parameters of the enemy character by internal control, and does not induce the player's active action (specific tactics). In addition, there is no relation between the raid boss appearing in the game and the player's action, and even if the player wants to fight the raid boss as rare as possible, it cannot be realized in many cases. For these reasons, the player may feel unsatisfied with the game and cause a decrease in interest.
The present invention has been made in view of such circumstances, and an object thereof is to provide a highly interesting game.

The main invention of the present invention to solve the above problems is
An information processing apparatus that executes a battle game that determines victory or defeat in a battle,
A matching processing unit that matches players who are opponents in the battle;
An appearance probability determination processing unit that determines an appearance probability of each enemy character to be a match target of each player based on an appearance point given in accordance with an action in a match of each matched player;
When one matched player performs an operation related to a match with the other player, an enemy character that is a match target of the one player can be played based on the appearance probability determined by the appearance probability determination processing unit An appearance processing unit for determining whether to appear in
An acquisition point grant processing unit that grants points to the player according to the match result, and is given by defeating the opponent player as the acquisition point given by defeating the enemy character that is the match target An earning point grant processing unit for increasing the earned points,
An information processing apparatus characterized by comprising:
Other features of the present invention will become apparent from the description of the present specification and the accompanying drawings.

1 is a diagram illustrating an example of an overall configuration of a game system 1. FIG. 2 is a block diagram showing a functional configuration of a server device 10. FIG. It is a figure which shows the data structure example of player information. It is a figure which shows the example of a data structure of game progress information. It is a figure which shows the data structure example of team information. It is a figure which shows the data structure example of enemy character information. 3 is a block diagram illustrating a functional configuration of a player terminal 20. FIG. 4 is a flowchart for explaining an overall flow of a battle game performed in the game system 1. It is a flowchart explaining the specific operation | movement performed by the battle | competition process of a battle | competition game. It is a figure showing an example of an opponent selection screen. It is a figure showing an example of the opponent selection screen when a raid boss appears.

At least the following matters will become apparent from the description of the present specification and the accompanying drawings.
That is, an information processing apparatus that executes a battle game that determines victory or defeat in a battle,
A matching processing unit that matches players who are opponents in the battle;
An appearance probability determination processing unit that determines an appearance probability of each enemy character to be a match target of each player based on an appearance point given in accordance with an action in a match of each matched player;
When one matched player performs an operation related to a match with the other player, an enemy character that is a match target of the one player can be played based on the appearance probability determined by the appearance probability determination processing unit An appearance processing unit for determining whether to appear in
An acquisition point grant processing unit that grants points to the player according to the match result, and is given by defeating the opponent player as the acquisition point given by defeating the enemy character that is the match target An earning point grant processing unit for increasing the earned points,
An information processing apparatus characterized by comprising:
According to such an information processing apparatus, the appearance probability of an enemy character (raid boss) can be changed in accordance with the appearance point (boss gauge) set for each player in the battle game. And if it succeeds in defeating a raid boss, since more acquisition points can be acquired, possibility that a battle game can be won becomes high. In this way, it becomes possible to control the appearance probability of a raid boss to some extent by the player's action (attack, defense, support, recovery of physical strength, change of avatar, active action of the player such as taking away the opponent's item). Therefore, the strategy of the entire battle game is enhanced, and a highly interesting game can be provided.

Further, in this information processing apparatus, the matching processing unit is configured by a plurality of players, and matches teams that are opponents with each other.
The appearance probability determination processing unit determines, for each player, the appearance probability of an enemy character that is a battle target of all the players in the team, based on the appearance points given to each player in the team.
The appearance processing unit is configured to perform the operation based on the appearance probability determined by the appearance probability determination processing unit when a player in one matched team performs an operation related to a battle with a player in the other team. Decide whether or not to make enemy characters that will be the target of battle for all players in the team of
When the acquisition point grant processing unit gives each player in the team an acquisition point, the acquisition point is obtained by defeating an enemy character that is a battle target of all players in the team. It is also possible to make more points than the points awarded for defeating each player.
According to such an information processing apparatus, when a team match is formed between teams composed of a plurality of players, an enemy character (raid boss) is selected according to the appearance point (boss gauge) set for each player belonging to the team. ) Occurrence probability can be varied. Therefore, the range of strategies in the battle game becomes wider, such as which player out of a plurality of players belonging to the opponent team will be better if the player is selected and beat down. Thereby, a player's interest can be raised more.

In addition, the information processing apparatus includes an appearance point variation processing unit that reduces an appearance point of the player when the ability parameter set for the player is decreased to a predetermined value in the battle. It's also good.
According to such an information processing apparatus, in addition to being able to increase the player's own appearance point by an action such as an attack by the player, the opponent player's appearance point can be decreased. In other words, the active action of the player can increase the raid boss appearance probability of the team and the opponent team can decrease the raid boss appearance probability of the opponent team. Thereby, the strategy of a battle game becomes higher and a highly interesting game can be provided.

Further, in the information processing apparatus, when the appearance processing unit determines to cause an enemy character to appear based on the appearance probability, each of the enemy characters to be allowed to appear is selected from a plurality of types of enemy characters. It is good also as selecting based on a lottery probability.
According to such an information processing apparatus, a plurality of raid bosses of different types and strengths (levels) can appear in the battle game, and therefore, the player is prevented from getting bored with the battle game.

In addition, the information processing apparatus includes a team organization processing unit that organizes a team composed of a plurality of players based on a game result of each player who has performed a preliminary match,
The matching processing unit may match teams organized by the team organization processing unit.
According to such an information processing device, by referring to the result of each player in the preliminary game, it becomes easier to predict how much the player will participate in the game and how much results will be achieved. It is possible to select a player and form a team so that it is difficult for bias to occur in the strengths and results. As a result, the battle game tends to be close and the player's interest is easily enhanced.

Further, the information processing apparatus is an appearance point assignment processing unit that assigns an appearance point according to a player's attack operation, and an attack point given by defeating an enemy character to be attacked is attacked. An appearance point giving processing unit for increasing the number of appearance points given by attacking the opponent player,
The appearance probability determination processing unit may determine the appearance probability of an enemy character to be a match as the appearance points given to the player increase.
According to such an information processing apparatus, an enemy character is likely to appear by performing an attack operation while selecting an attack target and an attacking opponent and giving many appearance points. Thereby, the strategy of a battle game becomes higher and a highly interesting game can be provided.

Next, on the computer
A matching process for matching players who are opponents in the battle,
An appearance probability determination process for determining an appearance probability of an enemy character to be a battle target of each player, based on an appearance point given according to an action in a match of each matched player;
When one matched player performs an operation related to a battle with the other player, the enemy character that is the battle target of the one player can be played based on the appearance probability determined by the appearance probability determination process An appearance process for determining whether to appear,
An acquisition point grant processing unit that grants points to the player according to the match result, and is given by defeating the opponent player as the acquisition point given by defeating the enemy character that is the match target Earning point grant processing to be more than the earned points,
Is a game program characterized in that
According to such a game program, the appearance probability of a raid boss is controlled to some extent by the player's action (attack, defense, support, recovery of physical strength, change of avatar, active action of the player such as taking away an opponent item). This makes it possible to increase the strategy of the entire battle game and provide an interesting game.

Next, the computer
Matching players who are opponents in the battle,
Based on the appearance points given according to the action of each matched player in the battle, the appearance probability of the enemy character that is the battle target of each player is determined,
Whether one of the matched players performs an operation related to a battle with the other player, and whether or not the enemy character that is the battle target of the one player appears to be able to battle based on the determined appearance probability Decide
When granting points to players according to the outcome of the match, the points awarded for defeating the enemy character that is the target of the match will be higher than the points awarded for defeating the opponent player. Do more,
This is an information processing method characterized by this.
According to such an information processing method, the appearance probability of a raid boss is controlled to some extent by the player's action (attack, defense, support, recovery of physical strength, change of avatar, active action of the player such as taking away the opponent's item). This makes it possible to increase the strategy of the entire battle game and provide an interesting game.

=== Embodiment ===
<< Configuration of Game System 1 >>
FIG. 1 is a diagram illustrating an example of the overall configuration of a game system 1 according to the present embodiment. The game system 1 provides various services related to games to a player via a network 2 (for example, the Internet or the like), and includes a server device 10 and a plurality of player terminals 20.

  The game system 1 according to the present embodiment can provide a player with a battle game in which one or more players (users) play against other players or enemy characters controlled by a computer.

  In the battle game according to the present embodiment, a player forms a team (referred to as a “friend team”) together with a plurality of players other than himself, and a team composed of a plurality of opponent players (an “opposition team”). Team). In the team battle, individual players belonging to each team battle each other, and each player acquires points (referred to as “acquired points”, also referred to as “scores”) according to the results of the individual battles. The team that has acquired more points in the entire team becomes the winning team and proceeds to the next match.

  In the battle game of this embodiment, an enemy character may appear based on a predetermined condition during a team battle. This enemy character appears as a common enemy of multiple players belonging to the same team (hereinafter also referred to as “Raid Boss”). More points are awarded than points earned in battles. Therefore, how to make such a raid boss appear and defeat is important in the strategy of the battle game.

<< Configuration of Server Device 10 >>
FIG. 2 is a block diagram illustrating a functional configuration of the server apparatus 10. The server apparatus 10 is an information processing apparatus (for example, a workstation or a personal computer) used when a system administrator or the like operates and manages various services. Upon receiving various commands (requests) from the player terminal 20, the server device 10 uses a game program and various data that can be operated on the player terminal 20, and a markup language (HTML or the like) that matches the standard of the player terminal 20. The created web page (game screen or the like) is transmitted (response). The server device 10 includes a control unit 11, a storage unit 12, an input unit 13, a display unit 14, and a communication unit 15.

  The control unit 11 exchanges data between each unit and controls the entire server device 10 and is realized by a CPU (Central Processing Unit) executing a program stored in a predetermined memory. . The control unit 11 in this embodiment includes at least a game progress processing unit 111 and a screen data generation unit 112.

  The game progress processing unit 111 has a function of executing various processes for progressing the game according to the game program. The game progress processing unit 111 of the present embodiment includes at least a matching processing unit 111A, a team organization processing unit 111B, an appearance probability determination processing unit 111C, an appearance processing unit 111D, a point grant processing unit 111E, and a point variation processing unit 111F. ing.

  The matching processing unit 111A has a function of matching players who are attacking opponents (competitors) in the battle. When the matching processing unit 111A in this embodiment receives a participation request for a battle game from a certain player (or team), the opponent is based on a predetermined condition from other players (or teams) that have requested the participation. The process of selecting and determining is performed.

  The team formation processing unit 111B forms a team composed of a plurality of players based on the game results of each player who has performed a preliminary match. The team formation processing unit 111B according to the present embodiment performs a preliminary battle game (preliminary game) in advance before executing the battle game (main game), and the player belongs to the player according to the results of the players who participated in the preliminary game. The team to be decided is determined, and the team that participates in the main game is organized.

  Appearance probability determination processing unit 111C is given according to the action (attack, defense, support, recovery of physical strength, changing avatar, changing the avatar, taking away the opponent's item, etc.) in each matched player battle Based on the appearance points, the appearance probabilities of enemy characters (raid bosses) as attack targets (competition targets) for each player are determined. The appearance probability determination processing unit 111C in the present embodiment refers to an appearance point (also referred to as a “boss gauge”) that varies depending on the result of a battle between players, and determines a raid boss during a battle game according to the increase or decrease of the boss gauge. A process of changing the probability of appearing is performed. Specifically, when the boss gauge (appearance point) decreases, the appearance probability of a raid boss (enemy character) decreases, and when the boss gauge (appearance point) increases, the appearance probability of a raid boss (enemy character) increases.

  Based on the appearance probability determined by the appearance probability determination processing unit 111 </ b> C, the appearance processing unit 111 </ b> D determines whether or not an enemy character that is a player's attack target (competition target) appears in a battleable manner. In the present embodiment, the appearance processing unit 111D performs an operation (active) on one player (for example, the player A belonging to the team on the team) attacking the other player (for example, the player B belonging to the opponent team) during the battle game. When a common operation is performed, based on the appearance probability determined according to the boss gauge set for the player A, a process is performed for causing a raid boss to appear as a common attack target for each player belonging to the team. . When the boss gauge reaches the upper limit (maximum value), a raid boss appears with an appearance probability of 100%.

  The appearance point giving processing unit 111E gives a predetermined appearance point to each player matched with the battle game. In the present embodiment, the appearance point grant processing unit 111E is used when one player (player A) attacks another player (player B) or an enemy character (raid boss) and defeats or damages them during the battle game. Next, the boss gauge (appearance point) set for the player A is raised at a predetermined rate. For example, when the player B is attacked, the boss gauge is increased by +1, and when the raid boss is defeated, the boss gauge is increased by +3. Moreover, you may perform the process of doubling the raise value of a boss gauge according to the kind of attack aspect, use of a predetermined item, etc. In addition, although this embodiment demonstrates the attacking action of the player A as an example, in addition to a player's active action, such as defense, support, recovery of a physical strength value, change of an avatar, and taking away an opponent's item in a battle. Appearance points are given accordingly. In this way, by accumulating the appearance points in the battle between the players and increasing the appearance probability of the raid boss, it is possible to obtain a battle opportunity with the raid boss (an opportunity to obtain more acquired points). Furthermore, in the battle with the raid boss, not only can more points be gained, but also more appearance points can be obtained than the single action (for example, attack) of the player A in the battle with the player B. Therefore, the next raid boss appearance probability can be increased efficiently.

  The appearance point variation processing unit 111F reduces the appearance point of the player when the ability parameter set for the player is reduced to a predetermined value due to an attack or the like during the battle game. The point variation processing unit 111F in this embodiment refers to the player's life gauge as an ability parameter, and when the life gauge becomes zero, the boss gauge is reset to zero, or about 25 to 50% of the maximum value Or decrease.

  The acquisition point giving processing unit 111G gives an acquisition point to the player according to the battle result of the battle game. The acquisition point giving processing unit 111G in this embodiment gives an acquisition point to the player A when one player (player A) defeats another player (player B) or an enemy character (raid boss) and wins the battle. . At this time, the acquisition points given by defeating the raid boss are set to be larger than the acquisition points given by defeating the player B. The acquisition point grant processing unit 111G acquires points to the player A when the player A attacks the player B, discovers a raid boss (selects a battle with the raid boss), or attacks the raid boss. May be given. At this time, the acquisition opportunity may be set so that more points can be obtained in the battle with the raid boss than in the battle with the player B.

  The screen data generation unit 112 has a function of executing processing for generating screen data for displaying the game screen on the player terminal 20. The screen data generation unit 112 in the present embodiment generates HTML data as screen data corresponding to the game screen.

  The storage unit 12 includes a ROM (Read Only Memory) that is a read-only storage area in which system programs are stored, and a RAM (Random Access) that is a rewritable storage area that is used as a work area for arithmetic processing by the control unit 11. For example, a non-volatile storage device such as a flash memory or a hard disk. The storage unit 12 in the present embodiment stores various data such as player information, team information, enemy character information, and the like.

  The input unit 13 is for a system administrator or the like to input various data (for example, item information and character information), and is realized by, for example, a keyboard or a mouse.

  The display unit 14 is for displaying an operation screen for a system administrator based on a command from the control unit 11 and is realized by, for example, a liquid crystal display (LCD).

  The communication unit 15 functions as a transmission / reception unit for transmitting / receiving various kinds of information to / from the player terminal 20 via the network 2, and is realized by, for example, a NIC (Network Interface Card) or the like. .

  FIG. 3 is a diagram illustrating an example data structure of player information. The player information is associated with the player ID, and includes at least a player name, a level, a basic parameter that represents the player's attack power, the maximum value of hit points, and the like, and a resource parameter that is information about resources owned by the player. Information, preliminary game result information, and game progress information that is information related to game progress for each player are set. As the “resource parameter information”, for example, the amount of in-game currency (fund) currently owned by the player is set. In “Preliminary Battle Result Information”, a score when a player participates in a preliminary battle is set. For example, the score acquired in the preliminary game, the number of battle participations in the preliminary game, and the like are recorded. If the player does not participate in the preliminary game, non-participation information is set.

  FIG. 4 is a diagram illustrating a data structure example of the game progress information. This “game progress information” includes the current player rank and experience value in the competitive game, team, action points, life gauge, boss gauge (appearance points), points (acquired points), and other game logins, etc. Is set. Of these, “action points” are points that are consumed when a player performs an action such as an attack in a battle game. When the action point falls below a predetermined value, the player can perform an action such as an attack. Disappear. The action points can be recovered with the use of items and the passage of time. “Life gauge” is a kind of ability parameter of a player, and represents a so-called hit point. As described above, the “boss gauge” is a parameter that varies the appearance probability for causing a raid boss to appear. In this embodiment, the higher the boss gauge, the easier the raid boss appears. As described above, the “score” is an acquisition point used to determine the team's victory or defeat. In this embodiment, the “score” is obtained by defeating another player or a raid boss.

  FIG. 5 is a diagram illustrating an example data structure of team information. In the team information, at least a player name, a life gauge, a boss gauge, and a score are set in association with the ID of each player belonging to the team. Moreover, the score of the whole team and the enemy character destruction information are set. “Enemy character destruction information” is information about enemy characters that the team has defeated in the current battle game. For example, if the 53rd team shown in FIG. 5 has defeated a level 1 raid boss A and a level 2 raid boss C, that information is set.

  FIG. 6 is a diagram illustrating an example data structure of enemy character information. In the enemy character information, at least a level, ability parameters such as attack power and hit points, appearance time, lottery probability, and defeat reward are set in association with the ID of the enemy character. “Appearance time” is a time limit that allows each player to fight the raid boss when a raid boss appears in the battle game, and the raid boss could not be defeated during the set appearance time. If so, the battle with that raid boss ends. When the appearance processing unit 111D determines that the enemy character (raid boss) appears, the “lottery probability” is any of the raid bosses set in plural types (for example, five types of raid bosses A to E). Represents the probability that a raid boss will be selected. For example, of the raid bosses A to E, the probability that the raid boss A shown in FIG. 6 is selected is 20%.

<< Configuration of Player Terminal 20 >>
FIG. 7 is a block diagram showing a functional configuration of the player terminal 20. The player terminal 20 is an information processing apparatus (for example, a tablet terminal, a mobile phone terminal, a smartphone, etc.) that can be possessed and used by a player. Since the player terminal 20 has a Web browser function, the Web page (game screen or the like) transmitted from the server device 10 can be displayed on the screen. The player terminal 20 includes a terminal control unit 21 that controls the player terminal 20 as a whole, a terminal storage unit 22 that stores various data and programs, a terminal input unit 23 for a player to input operations, and a game screen / operation. A terminal display unit 24 that displays a screen and a terminal communication unit 25 that performs information communication between the server device 10 are provided.

<< Operation of Game System 1 >>
<The game flow>
FIG. 8 is a flowchart for explaining the overall flow of the battle game performed in the game system 1.

  First, a certain player (player A) operates the player terminal 20 to request participation in a battle game (step S101). Then, when the server device 10 receives a battle game participation request from the player A via the player terminal 20, various processes for executing the battle game are started.

  Next, the team organization processing unit 111B organizes the team to which the player A belongs (step S102). The organization of the team is performed by extracting a predetermined number of players (for example, 30 players) including the player A from the plurality of players who have requested participation, and the organized team is stored as team information ( (See FIG. 5). When team formation is performed, it is preferable to select each player so as to balance the strength of each team with reference to the level and player information of each player. However, a team may be formed by randomly extracting a predetermined number of players from all players. Further, the players in the team may be interchangeable according to changes in the player's degree of activity (active fighting posture).

  In addition, a team may be formed based on a result of a preliminary battle game (preliminary battle) performed in advance before the battle game (main battle) is started. This preliminary game is performed in a format similar to the main game in a predetermined period before the main game starts. A player who wants to play a battle game as soon as possible, or a player who wants to become familiar with the rules and atmosphere of the game for the main game can try playing in the battle game by participating in the preliminary game. When the preliminary selection is performed, the team organization processing unit 111B refers to the preliminary battle result information of the player information, and organizes the team according to the preliminary battle result. For example, a predetermined number of players are extracted from a group of players who recorded excellent results in the preliminary game, a group of players who recorded normal results in the preliminary game, and a group of players who did not participate in the preliminary game. Thereby, each team can be organized so that the deviation of results hardly occurs for each team in the main game.

  In this battle game, a battle between teams (team battle) is not necessarily performed, and a battle (individual battle) between individual players may be performed. In that case, the team organization process (step S102) may not be performed. In addition, the battle may be directed to a player-computer battle (solo play, cooperative play) instead of the players.

  Next, matching of opponents (teams) that compete with each other in the battle game is performed (step S103). The matching processing unit 111A refers to the team information stored in the storage unit 12, extracts a team (an opponent team) that is an opponent of the team to which the player A belongs (an opponent team), and determines the opponent as an opponent. The extraction of the opponent team is determined by referring to the total score of all players belonging to the team and the player information of each player belonging to the team. For example, if teams with the same total score of teams are matched with each other, the battle game is likely to become a close game, and the interest of each player can be easily enhanced.

  Next, a match between the matched teams is performed (step S104). Specific operations and processes performed in the battle will be described later.

  Next, a win / loss determination is made based on the result of the battle (step S105). The game progress processing unit 111 refers to the team information of both teams at the end of the battle, and determines the winning team. Winning or losing may be determined based on the total score of each player belonging to the team (the total score of each player assigned by the acquisition point grant processing unit 111G), or other parameters (for example, each player Of life gauge or boss gauge). Also, rewards and penalties may be set according to the team's victory or defeat. For example, bonus items and benefits are given as rewards to the winning team, and the team is dissolved for the defeated team. In this case, if the ally team to which the player A belongs wins, it can proceed to the next battle as it is. On the other hand, if the team that the player A belongs to is defeated, the team is disbanded, and if the player A wants to participate in the next battle game, the participation request in step S101 is made again and a new organization is formed. Participate in a competitive game as part of a team.

<Specific action of battle>
FIG. 9 is a flowchart for explaining specific operations performed in the battle process (step S104 in FIG. 8) of the battle game.

  When the battle is started, first, data of the opponent selection screen is generated by the screen data generation unit 112 and displayed on the terminal display unit 24 of the player terminal 20 (step S401). FIG. 10 is a diagram illustrating an example of the opponent selection screen 50. On the opponent selection screen 50, an opponent display area 51 in which information related to players belonging to the team (an opponent team) matched as an opponent is displayed, and the player gives an operation instruction such as selection decision and screen transition. The operation instruction area 52 is shown. In the opponent display area 51, life gauges (hit points HP) and boss gauges (appearance points) set for the player are displayed as information on the opponent player as an attack target. Further, the level of each player and the score (acquired points) acquired may be displayed.

  Next, an opponent player (attack target player) to be attacked is selected (step S402). Selection of the attack target player is performed by selecting and determining a player who wants to attack from among a plurality of players displayed on the opponent selection screen 50. As described above, at least the opponent player's life gauge and boss gauge are displayed in the opponent display area 51 of the opponent selection screen 50, and the player A who is attacking refers to the attack target while referring to the displayed data. Players can be selected. For example, it is possible to attack a player who has little life gauge and can easily defeat it or who has a high boss gauge.

  In the battle game of this embodiment, the higher the boss gauge, the easier it is for enemy characters (raid bosses) to appear. For example, when the boss gauge of the player B belonging to the opponent team is high, a raid boss is likely to appear in the opponent team, and the opportunity for the opponent team to obtain a high score is increased. On the other hand, when the player B's ability parameter (for example, life gauge) becomes zero by attacking the player B, the boss gauge (appearance point) of the player B is decreased by the appearance point variation processing unit 111F. That is, when the player A selects and attacks the player B as the attack target player, it is possible to make it difficult for the opponent team to appear as a raid boss. At the same time, the boss gauge of the player A is increased by performing the attack, so that the probability that a raid boss appears in the team of friends can be increased. In this way, the battle game of this embodiment can realize a battle with the raid boss by the player's own attack behavior, and it is highly necessary to attack the opponent team in order to protect the friendly team, so the player's aggressive game Can promote a serious attack. Moreover, since a strategy is required for selecting an opponent in the opponent team, a highly interesting game can be provided. Note that the players in the team may be able to communicate with each other such as chat. Moreover, the display of a player with a high boss gauge of the opponent team may be made conspicuous due to the use of items or in-team cooperation. A more strategic attack can be set, and the interest can be enhanced.

  Next, an attack is performed on the attack target player (player B) (step S403). By actually performing the attack, the life gauge of the attack target player can be reduced. The life gauge increase / decrease at the time of attack is determined by referring to parameters such as attack power and defense power set in the player information of the attack target player. When the life gauge of the attack target player becomes zero, the boss gauge set for the attack target player decreases.

  Next, the game progress processing unit 111 changes the parameter of the player (player A) that made the attack based on the result of the attack (step S404). Examples of the parameter that varies include an action point, a life gauge, a boss gauge, and a score. The action point decreases by a certain amount when the player A performs an “attack” action. The life gauge decreases when the player is attacked from the attack target player (player B). The boss gauge increases according to the appearance points given by the point grant processing unit 111E when the attack target player (player B) is defeated or damaged. When player A defeats a raid boss as an attack target, more appearance points are given than when player B is defeated, and the boss gauge increases. Further, when the life gauge of the player (player A) becomes zero, the boss gauge of the player A is decreased by the point variation processing unit 111F. The score is increased by a predetermined amount according to the attack target player (player B) or the raid boss being defeated or the damage given.

  Next, a lottery is performed as to whether or not an enemy character (raid boss) appears (step S405). The appearance processing unit 111D performs a lottery to determine whether or not to make a raid boss appear, triggered by an attacking action (attacking operation) performed by the player A. The lottery is performed based on the appearance probability determined by the appearance probability determination processing unit 111C based on the boss gauge set for the player A at that time (step S404). Basically, the appearance probability determination processing unit 111C increases the appearance probability when the boss gauge is high, and decreases the appearance probability when the boss gauge is low. However, the appearance probability may be changed according to the situation of the battle. For example, the losing team may be set to have a higher appearance probability than the winning team.

  If it is determined that the enemy character (raid boss) does not appear as a result of the lottery (step S405 is No), the process returns to step S401 and the battle process is continued. On the other hand, when it is determined that an enemy character (raid boss) appears (step S405: Yes), the appearance processing unit 111D determines a raid boss to actually appear from a plurality of types of raid bosses (step S406). Specifically, the appearance processing unit 111D determines the type of raid boss to appear based on the enemy character information (see FIG. 6) stored in the storage unit 12. Furthermore, the level of the raid boss to appear is determined based on the enemy character destruction information (see FIG. 5). For example, the appearance processing unit 111D determines that the raid boss A appears among the five types of raid bosses A to E set in the enemy character information. Then, the appearance processing unit 111D refers to the enemy character destruction information, and when the team has defeated the level 1 raid boss A, causes the level 2 raid boss A to appear. In this way, the raid boss that appears as the battle game progresses becomes more powerful, and the reward for defeating the game increases, so the player's interest can be enhanced.

  It should be noted that if it is decided to make a raid boss appear based on the boss gauge set for the player A, the boss gauge of the player A may be reset. Thereby, the probability that the raid boss appears continuously based on the boss gauge of the player A is reduced, and it is suppressed that one team is extremely advantageous.

  Further, in the competitive game of the present embodiment, a plurality of (for example, three) enemy characters (raid bosses) can appear at the same time for one team. For example, in a state where the player A belonging to the team of friends has a certain raid boss A appearing, another player C belonging to the team of friends can further appear the raid boss B (or raid boss A). When a plurality of raid bosses appear at the same time, each player can select the raid boss to be attacked. This broadens the strategy, such as whether to preferentially attack raid bosses with higher rewards at the time of destruction, or preferentially attack raid bosses that can be reliably destroyed, and enhance the interest of players It becomes possible. Further, in order to limit the number of raid bosses that can appear at the same time, if a raid boss display frame for an upper limit number is provided on the opponent selection screen 60 (FIG. 11) described later, a new desire (appears by the player). The desire to destroy raid bosses one after another and create an empty display frame) can be aroused, which can further enhance interest.

  Next, the screen data generation unit 112 generates the opponent selection screen data including the raid boss and displays it on the terminal display unit 24 of the player terminal 20 (step S407). FIG. 11 is a diagram illustrating an example of an opponent selection screen 60 when a raid boss appears. The basic configuration of the opponent selection screen 60 is the same as the opponent selection screen 50 described with reference to FIG. 10, and includes an opponent display area 61 and an operation instruction area 62. In the opponent display area 61, the raid boss determined in step S406 is displayed in addition to the players of the opponent team. FIG. 11 shows an example in which two raid bosses appear. Thereby, each player who belongs to the team of friends can select a raid boss in addition to each player of the opponent team as an opponent. In the opponent display area 61, various information (see FIG. 6) such as the life gauge of the raid boss and the appearance time (actual remaining time) of the raid boss are displayed. Furthermore, the score and reward obtained when the raid boss is defeated may be displayed. If the raid boss cannot be defeated within the time displayed in the opponent display area 61, the display of the raid boss is deleted from the screen of FIG. 11, and the battle with the raid boss fails.

  If the battle with the raid boss fails, the raid boss defeat record set in the enemy character defeat information is updated, and the raid boss level is lowered. For example, in the example of FIG. 5, when the level 3 raid boss C that appears in the team of the teammates (team 53) fails, the level of the raid boss C recorded in the raid boss defeat record is lowered by one step from the level 2. To level 1. Therefore, the raid boss C that may appear next time on the team of the teammates (the 53rd team) has a higher probability that the level 2 raid boss C will appear. As a result, the problem that the raid boss is too strong to be destroyed is less likely to occur.

  Next, returning to FIG. 9, it is determined whether or not the action points of the player A remain over a predetermined value (step S408). If action points remain (Yes in step S408), the process returns to step S402 to select an attack target for performing an attack again. At this stage, since the raid boss appears as an attack target, the player A can also participate in the attack against the raid boss. On the other hand, if no action point remains (No in step S408), the player A cannot perform any further attack and the battle by the player A ends.

  The battle game progresses through the processing as described above. In the competitive game of this embodiment, the appearance probability of an enemy character (raid boss) varies according to the appearance point (boss gauge) set for each player. Then, the player's own appearance point can be increased or the opponent player's appearance point can be decreased by an active action such as an attack by the player. Depending on the player's own strategy, not only his own raid boss battle opportunity, but also the opponent player's raid boss battle opportunity, and thus the scoring opportunity, can be changed. Thereby, the strategy nature of the whole battle game becomes high, and a highly interesting game can be provided.

=== Other Embodiments ===
The above embodiments are for facilitating the understanding of the present invention, and are not intended to limit the present invention. The present invention can be changed and improved without departing from the gist thereof, and equivalents thereof are also included in the present invention. In particular, the embodiments described below are also included in the present invention.

<About increase and decrease of appearance points>
In the above embodiment, an example in which the appearance point (boss gauge) of enemy characters decreases when the player's life gauge becomes zero has been described. However, the appearance point (boss gauge) decreases as the player's life gauge decreases. You may make it do. In this way, since the opponent's boss gauge can be cut without making the life gauge of the attack target player (the opponent player) zero, the range of strategy in the battle can be further expanded. Note that an appearance point may be an acquisition point.

<About the appearance of enemy characters>
In the above embodiment, an example has been described in which the enemy characters appearing during the battle game are determined by lottery from a plurality of enemy characters set in the enemy character information, but there are restrictions on the appearance conditions of the enemy characters. It may be provided. For example, you may make it appear in order from level 1 instead of lottery. Further, for example, when a battle game is performed over a plurality of days, three types of enemy characters can appear in the battle on the first day, and two types of enemy characters are newly displayed in the battle on the second day. Will be lifted, allowing 5 types of enemy characters to appear. In this way, since it becomes possible to play against a new enemy character along with the battle game (event progression), it is difficult for the player to get bored and it is easy to enhance the interest in the game.

<Server device>
In the above-described embodiment, the game system 1 including one server device 10 is described as an example of the server device. However, the present invention is not limited thereto, and a plurality of server devices 10 are provided as an example of the server device. The game system 1 may be used. That is, a plurality of server apparatuses 10 may be connected via the network 2 and each server apparatus 10 may perform various processes in a distributed manner.

<Information processing device>
In the game system 1 in the above embodiment, the case where various types of information processing are executed by causing the server device 10 and the player terminal 20 to cooperate based on the game program has been described as an example. However, the present invention is not limited to this. The player terminal 20 alone or the server device 10 alone as the information processing device may execute the various information processing based on the game program.
Moreover, it is good also as a structure which the player terminal 20 bears a part of function as an information processing apparatus. In this case, the server device 10 and the player terminal 20 constitute an information processing device.
Note that the information processing apparatus is an example of a computer including a processor and a memory.

DESCRIPTION OF SYMBOLS 1 Game system 2 Network 10 Server apparatus 11 Control part 12 Storage part 13 Input part 14 Display part 15 Communication part 20 Player terminal 21 Terminal control part 22 Terminal storage part 23 Terminal input part 24 Terminal display part 25 Terminal communication part 50 Competitor selection Screen 51 Opponent display area 52 Operation instruction area 60 Opponent selection screen 61 Opponent display area 62 Operation instruction area 111 Game progress processing section 111A Matching processing section 111B Team organization processing section 111C Appearance probability determination processing section 111D Appearance processing section 111E Appearance Point grant processor 111F Appearance point variation processor 111G Acquired point grant processor 112 Screen data generator

Claims (8)

An information processing apparatus that executes a battle game that determines victory or defeat in a battle,
A matching processing unit that matches players who are opponents in the battle;
An appearance probability determination processing unit that determines an appearance probability of each enemy character to be a match target of each player based on an appearance point given in accordance with an action in a match of each matched player;
When one matched player performs an operation related to a match with the other player, an enemy character that is a match target of the one player can be played based on the appearance probability determined by the appearance probability determination processing unit An appearance processing unit for determining whether to appear in
An acquisition point grant processing unit that grants points to the player according to the match result, and is given by defeating the opponent player as the acquisition point given by defeating the enemy character that is the match target An earning point grant processing unit for increasing the earned points,
An information processing apparatus comprising: The information processing apparatus according to claim 1,
The matching processing unit is composed of a plurality of players and matches each other's opponent teams,
The appearance probability determination processing unit determines, for each player, the appearance probability of an enemy character that is a battle target of all the players in the team, based on the appearance points given to each player in the team.
The appearance processing unit is configured to perform the operation based on the appearance probability determined by the appearance probability determination processing unit when a player in one matched team performs an operation related to a battle with a player in the other team. Decide whether or not to make enemy characters that will be the target of battle for all players in the team of
When the acquisition point grant processing unit gives each player in the team an acquisition point, the acquisition point is obtained by defeating an enemy character that is a battle target of all players in the team. More points than the points awarded for defeating each player
An information processing apparatus characterized by that. The information processing apparatus according to claim 1 or 2,
In the battle, an appearance point variation processing unit that reduces an appearance point of the player when the ability parameter set for the player decreases to a predetermined value,
An information processing apparatus comprising: The information processing apparatus according to claim 1,
When the appearance processing unit determines to make an enemy character appear based on the appearance probability, it selects an enemy character to appear so as to be able to compete based on each lottery probability,
An information processing apparatus characterized by that. An information processing apparatus according to any one of claims 2 to 4,
A team formation processing unit that forms a team composed of a plurality of players based on the game results of each player who has made a preliminary match,
The matching processing unit matches teams organized by the team organization processing unit,
An information processing apparatus characterized by that. An information processing apparatus according to any one of claims 1 to 5,
Appearance point grant processing unit that assigns appearance points according to the player's attack operation, and is given by attacking the attacking player as the appearance point given by defeating the enemy character to be attacked An appearance point assignment processing unit that increases the number of appearance points to be generated,
With
The appearance probability determination processing unit determines the appearance probability of an enemy character to be a match as the appearance point given to the player increases,
An information processing apparatus characterized by that. A game program for a battle game in which a battle is decided to win or lose,
On the computer,
A matching process for matching players who are opponents in the battle,
An appearance probability determination process for determining an appearance probability of an enemy character to be a battle target of each player, based on an appearance point given according to an action in a match of each matched player;
When one matched player performs an operation related to a battle with the other player, the enemy character that is the battle target of the one player can be played based on the appearance probability determined by the appearance probability determination process An appearance process for determining whether to appear,
An acquisition point grant processing unit that grants points to the player according to the match result, and is given by defeating the opponent player as the acquisition point given by defeating the enemy character that is the match target Earning point grant processing to be more than the earned points,
A game program characterized by causing a game to be executed. An information processing method for a battle game in which winning or losing is determined in a battle,
Computer
Matching players who are opponents in the battle,
Based on the appearance points given according to the action of each matched player in the battle, the appearance probability of the enemy character that is the battle target of each player is determined,
Whether one of the matched players performs an operation related to a battle with the other player, and whether or not the enemy character that is the battle target of the one player appears to be able to battle based on the determined appearance probability Decide
When granting points to players according to the outcome of the match, the points awarded for defeating the enemy character that is the target of the match will be higher than the points awarded for defeating the opponent player. Do more,
An information processing method characterized by the above.

Images