JP5841288B1 - Information processing apparatus and game program - Google Patents

Abstract

[PROBLEMS] To improve a player's willingness to participate in a battle game. An information processing apparatus according to the present invention executes an attack process on an appearing common enemy character in response to an attack operation of each of a plurality of players, and determines a win or loss for a battle with the common enemy character. An attack based on an attack operation of another player after an attack operation is performed by the battle processing unit and one of the plurality of players and before the defeat of the common enemy character that is appearing is determined When the process is executed and the defeat of the common enemy character is determined, a count processing unit that counts the number of attack errors for which the attack process based on the attack operation of the one player has been forcibly terminated, and the counted attack error Based on the number of times, you can participate in the battle against the common enemy character again. Includes a number of participants control processing unit for controlling the number of players that can, a. [Selection] Figure 1

Description

  The present invention relates to an information processing apparatus and a game program.

  There is known an information processing apparatus that executes a battle game in which an enemy character (hereinafter, also referred to as “common enemy character”) that becomes a common opponent for a plurality of players appears (for example, Patent Document 1).

JP2013-230230A

  In such an information processing apparatus, when an attack operation on a common enemy character is performed by one of a plurality of players, attack processing based on an attack operation on the common enemy character by another player is already executed. The defeat of the common enemy character may be determined. In such a case, even if an attack operation is performed by one player, an attack process based on the attack operation of the one player is executed because the common enemy character has already been defeated by the attack operation of another player. (They are also called “attack errors”).

  This attack error tends to occur more frequently as the number of players participating in a match with a common enemy character increases. When this attack error increases, the attack cannot be performed as expected, and the player's willingness to participate in the battle game may be reduced. On the other hand, as the number of players participating in the battle with the common enemy character decreases, this attack error decreases, but the common enemy character that appears has not been defeated, and its survival time tends to be longer. is there. There is a possibility that the player's willingness to participate in the battle game may be reduced due to the long survival time of the common enemy character.

  The present invention has been made in view of such circumstances, and its purpose is to optimize the number of players who can participate in a battle with a common enemy character and to improve the player's willingness to participate in the battle game. There is.

The main invention of the present invention to solve the above problems is
An information processing apparatus that executes a battle game in which a common enemy character that is a common opponent for multiple players repeatedly appears,
In response to an attack operation of each of the plurality of players, an attack process for the common enemy character that is appearing is performed, and a battle processing unit that determines victory or defeat for the battle with the common enemy character,
After an attack operation is performed by one of the plurality of players and before the defeat of the appearing common enemy character is determined, an attack process based on the attack operation of another player is performed and A count processing unit that counts the number of attack errors in which the attack processing based on the attack operation of the one player is forcibly terminated by determining the defeat of the common enemy character;
Based on the counted number of attack errors, a participation number control processing unit that controls the number of players that can participate when playing again with the common enemy character,
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 character information. 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 possessed character 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 appearance character information. It is a figure which shows the data structure example of appearance list information. It is a figure which shows the data structure example of appearance history information. It is a figure which shows the data structure example of matching information. 3 is a block diagram illustrating a functional configuration of a player terminal 20. FIG. It is a flowchart explaining the operation example regarding an attack error. It is a flowchart for demonstrating the operation example (the 1) regarding optimization of the number of players. It is a flowchart for demonstrating the operation example (the 2) regarding optimization of the number of players.

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 in which a common enemy character that is a common opponent for multiple players repeatedly appears,
In response to an attack operation of each of the plurality of players, an attack process for the common enemy character that is appearing is performed, and a battle processing unit that determines victory or defeat for the battle with the common enemy character,
After an attack operation is performed by one of the plurality of players and before the defeat of the appearing common enemy character is determined, an attack process based on the attack operation of another player is performed and A count processing unit that counts the number of attack errors in which the attack processing based on the attack operation of the one player is forcibly terminated by determining the defeat of the common enemy character;
Based on the counted number of attack errors, a participation number control processing unit that controls the number of players that can participate when playing again with the common enemy character,
An information processing apparatus characterized by comprising:
According to such an information processing device, since the number of players that can participate in a battle with a common enemy character is optimized based on the number of attack errors, it is possible to improve the player's willingness to participate in the battle game. .

In this information processing apparatus, the participant number control processing unit
Using the counted number of attack errors, an attack error rate for an attack on the common enemy character is calculated,
When the attack error rate of the common enemy character exceeds a preset appropriate attack error rate, control is performed so as not to increase the number of players that can participate when playing again with the common enemy character. Good.
According to such an information processing apparatus, when the attack error rate is high, control is performed so that the number of players that can participate in a battle with the common enemy character is not increased, so that the attack error is reduced. As a result, an attack can be made as desired, and the player's willingness to participate in the battle game can be improved.

In the information processing apparatus, the count processing unit
Every time the common enemy character appears, the survival time from the appearance of the common enemy character until the defeat is determined is counted,
The participant number control processing unit
Using each counted survival time, the average survival time of the common enemy character is calculated,
When the average survival time of the common enemy character exceeds a preset appropriate survival time, it may be controlled to increase the number of players that can participate when playing again with the common enemy character. .
According to such an information processing apparatus, when the average survival time is increased, the number of players who can participate in the battle with the common enemy character is controlled to increase, so that the common enemy character can be easily defeated. As a result, it is possible to improve the player's willingness to participate in the battle game.

An information processing apparatus that executes a battle game in which a common enemy character that is a common opponent for a plurality of players repeatedly appears.
In response to an attack operation of each of the plurality of players, an attack process for the common enemy character that is appearing is performed, and a battle processing unit that determines victory or defeat for the battle with the common enemy character,
Each time the common enemy character appears, a count processing unit that counts the survival time from the appearance of the common enemy character until the defeat is determined,
Based on the counted survival time, a participant number control processing unit that controls the number of players that can participate when playing again with the common enemy character,
An information processing apparatus characterized by comprising:
According to such an information processing apparatus, since the number of players who can participate in a battle with a common enemy character is optimized based on the survival time, it is possible to improve the player's willingness to participate in the battle game.

In this information processing apparatus, the participant number control processing unit
Using each counted survival time, the average survival time of the common enemy character is calculated,
When the average survival time of the common enemy character exceeds a preset appropriate survival time, it may be controlled to increase the number of players that can participate when playing again with the common enemy character. .
According to such an information processing apparatus, when the average survival time is increased, the number of players who can participate in the battle with the common enemy character is controlled to increase, so that the common enemy character can be easily defeated. As a result, it is possible to improve the player's willingness to participate in the battle game.

Next, there is a game program related to a battle game that repeatedly causes a common enemy character to become a common opponent for multiple players,
On the computer,
In response to an attack operation of each of the plurality of players, a battle process is performed to attack the common enemy character that is appearing, and to determine victory or defeat for the battle with the common enemy character;
After an attack operation is performed by one of the plurality of players and before the defeat of the appearing common enemy character is determined, an attack based on the attack operation of another player is performed and the common A counting process for counting the number of attack errors in which an attack based on the attack operation of the one player is forcibly terminated due to the defeat of the enemy character
Based on the counted number of attack errors, a participation number control process for controlling the number of players that can participate when playing again with the common enemy character,
Is a game program characterized in that
According to such a game program, since the number of players who can participate in a battle with a common enemy character is optimized, it is possible to improve the player's willingness to participate in the battle game.

In addition, a game program related to a battle game in which a common enemy character that is a common opponent for multiple players repeatedly appears,
On the computer,
In response to an attack operation of each of the plurality of players, a battle process is performed to attack the common enemy character that is appearing, and to determine victory or defeat for the battle with the common enemy character;
Each time the common enemy character appears, a counting process that counts the survival time from the appearance of the common enemy character until the defeat is determined,
Based on the counted survival time, a participation number control process for controlling the number of players that can participate when playing again with the common enemy character,
There is a game program characterized in that
According to such a game program, since the number of players who can participate in a battle with a common enemy character is optimized, it is possible to improve the player's willingness to participate in the battle game.

=== Embodiment ===
<< About the configuration of the game system 1 >>
FIG. 1 is a diagram illustrating an example of the overall configuration of the game system 1. 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 using a character card (hereinafter also simply referred to as “character”) as an example of game content.

  The battle game according to the present embodiment is a game in which a player character owned by each of a plurality of players is played against a common enemy character that is a common opponent of the plurality of players.

  Specifically, each player is assigned to one of a plurality of teams composed of a small number of people (for example, 10 people). When two teams selected from a plurality of teams are matched, a team battle is started in which the teams compete with each other for acquisition points. In a team showdown, a common enemy character that appears for a team is played against a player character of each player belonging to that team. If the defeat of the common enemy character is determined as a result of the battle, points are awarded to the team. Based on the points earned by each team, the victory or defeat of the team confrontation is determined.

  Moreover, in this team confrontation, since a common enemy character repeatedly appears for each team, each player belonging to the team performs an attack operation on the appearing common enemy character one after another. At this time, even if an attack operation is performed by a certain player in the team, an attack error occurs if the common enemy character has already been defeated by the attack operation of another player. This attack error tends to occur more frequently as the number of players participating in the team increases. Therefore, in the present embodiment, the number of players in the team that can participate in the battle against the common enemy character again is controlled based on the number of times an attack error has occurred (hereinafter also referred to as “attack error frequency”). Also, even if an attack operation is performed by a certain player in the team, if the attack operation is not performed by another player, the state where the common enemy character is not defeated continues and its survival time becomes longer. . The survival time of this common enemy character tends to increase as the number of players participating in the team decreases. Therefore, in the present embodiment, the number of players in the team that can participate in the battle against the common enemy character again is controlled based on the survival time of the common enemy character. In this way, the number of players in the team that can participate in the battle with the common enemy character can be optimized.

<< 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 of this embodiment includes at least a battle processing unit 111, a matching processing unit 112, a count processing unit 113, a participant number control processing unit 114, and a screen data generation processing unit 115.

  The battle processing unit 111 has a function of executing processing for advancing the battle game according to the game program. The battle processing unit 111 according to the present embodiment determines the character setting process related to the setting of the common enemy character to be the opponent, the attack process related to the attack of each character, the win / loss for the battle with the enemy character, and the win / loss for the team battle. The winning / losing decision processing, the point giving processing for giving points to the winning team, etc. are executed.

  The matching processing unit 112 has a function of executing various processes related to matching. The matching processing unit 112 in the present embodiment causes each of a plurality of players entered in the team confrontation to belong to one of the teams, and matches opponent teams that compete with each other. That is, a plurality of players who are competing against each other in a team showdown are matched.

  The count processing unit 113 has a function of executing various processes related to counting. The count processing unit 113 in this embodiment includes a number count processing unit 113A and a time count processing unit 113B. The count processing unit 113A has a function of executing processing for counting various times such as the number of attack errors. The time count processing unit 113B has a function of executing processing for counting various times such as the survival time of the common enemy character.

  The number-of-participants control processing unit 114 has a function of controlling the number of players that can participate in a battle with a common enemy character. The number-of-participants control processing unit 114 in the present embodiment controls the number of players in a team that can participate in a battle with a common enemy character based on a predetermined condition.

  The screen data generation processing unit 115 has a function of executing processing for generating screen data for displaying the game screen on the player terminal 20. The screen data generation processing unit 115 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 at least character information, player information, team information, and matching information. These various types of information will be described in detail later.

  The input unit 13 is for a system administrator or the like to input various data (for example, character information) related to the game service, 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 is for communicating with the player terminal 20, according to a function as a receiving unit that receives various data and signals transmitted from the player terminal 20 and a command from the control unit 11. It has a function as a transmission part which transmits various data and signals to the player terminal 20. The communication unit 15 is realized by, for example, a NIC (Network Interface Card).

  FIG. 3 is a diagram illustrating an example data structure of character information. This character information is associated with the character ID and includes at least abilities such as character name, character image, rarity, initial attack power, initial defense power, initial physical strength, maximum attack power, maximum defense power, maximum physical strength, maximum level, etc. Parameters, appropriate attack error rate, appropriate appearance time, and initial interrupt probability are set. The appropriate attack error rate is information indicating an appropriate value of the reference attack error rate. The attack error rate is the ratio of the number of attack errors to the number of appearances of the common enemy character. The appropriate appearance time is information indicating an appropriate value of the reference appearance time. The initial interrupt probability is information indicating an initial value of the interrupt probability. The interrupt probability is a probability that another player interrupts the battle with the common enemy character. For example, if the interrupt probability of a character is 60%, the probability that the character will be set as the opponent's opponent as a common enemy character that has already appeared is 60%, and that character will newly appear as a common enemy character. The probability of being set as a player's opponent is 40%. In other words, the higher the interrupt probability, the easier the number of players in the team that can participate in the battle with the common enemy character.

  FIG. 4 is a diagram illustrating an example data structure of player information. In the player information, at least a player name, battle points, and owned character information are set in association with the player ID. The battle point is parameter information indicating the amount of points possessed by the player, and is consumed when the player performs an attack operation. When the player performs an attack operation, the battle points need not be consumed.

  FIG. 5 is a diagram illustrating a data structure example of owned character information. The owned character information is information relating to a character owned by the player (hereinafter also referred to as “owned character”). In the possessed character information, at least various parameters such as the current level, attack power, defense power, and physical strength are set in association with the character ID of the owned character. These various parameters are updated as the game progresses.

  FIG. 6 is a diagram illustrating an example data structure of team information. In this team information, at least a team name, a belonging player, acquired points, appearance character information, appearance list information, and appearance history information are set in association with the team ID. The affiliation player is information indicating the player ID of each player belonging to the team. The acquired points are information indicating points acquired by the team (total points acquired by each player). The appearance character information is information on a common enemy character that can appear for the team. The appearance list information is information related to the common enemy character that is appearing. The appearance history information is recording information related to a common enemy character that has already appeared.

  FIG. 7 is a diagram illustrating a data structure example of appearance character information. In this appearance character information, at least the number of appearances, the number of attack errors, the attack error rate, the average survival time, and the interrupt probability are set in association with the character ID of the common enemy character that can appear. The number of appearances is information indicating the cumulative number of times that the common enemy character has appeared. The number of appearances is counted and updated each time the appearance occurs by the number counting processing unit 113A. The number of attack errors is information indicating the cumulative number of times an attack error has occurred during an attack on the common enemy character. The number of attack errors is counted and updated every time an attack error occurs by the count counter 113A. The attack error rate is information indicating the current attack error rate. The attack error rate is calculated and updated by the participant number control processing unit 114 at predetermined intervals. The average survival time is information indicating the average value of the survival time at the present time. This average survival time is calculated and updated by the participant number control processing unit 114 at predetermined intervals. The interrupt probability is information indicating the interrupt probability at the present time. The interrupt probability is changed and updated every time a predetermined condition is satisfied by the participant number control processing unit 114.

  FIG. 8 is a diagram illustrating a data structure example of the appearance list information. In this appearance list information, at least the character ID of the common enemy character currently appearing, the appearance time indicating the date and time of appearance of the common enemy character, the current health parameter of the common enemy character, and the common enemy character are associated with the appearance ID. The player ID of the newly appearing player, the player ID of the player who interrupted the battle with the appearing common enemy character, and the number of participants are set.

  FIG. 9 is a diagram illustrating a data structure example of appearance history information. In this appearance history information, in association with the history ID, at least the character ID of the common enemy character that has already appeared, the appearance time indicating the appearance date and time of the common enemy character, the match end time indicating the match end date and time of the common enemy character, The survival time that the common enemy character was alive without being defeated is set.

  FIG. 10 is a diagram illustrating an exemplary data structure of matching information. The matching information is information regarding the matched team (multiple players). In this matching information, a team ID (player ID of each player belonging to the team) of two teams that compete with each other is set in association with the matching ID.

<< Configuration of Player Terminal 20 >>
FIG. 11 is a block diagram illustrating 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 operation 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 >>
Here, an operation example of the game system 1 according to the present embodiment will be described. Hereinafter, an operation example related to an attack error and an operation example related to optimization of the number of players will be described in detail.

<Attack error>
FIG. 12 is a flowchart for explaining an operation example related to an attack error. Here, the player terminal 20 used by the player A belonging to a certain team will be described as “player terminal A”, and the player terminal 20 used by the player B belonging to the same team as the player A will be described as “player terminal B”. .

  First, when a search operation is performed by the player A, the player terminal A transmits a command (search start request) for requesting a search start based on the operation information to the server device 10 (step S101).

  Next, when the server apparatus 10 receives the search start request transmitted from the player terminal A, the server apparatus 10 sets a common enemy character that is the opponent of the player A (step S102).

  Specifically, first, the battle processing unit 111 sets the team to which the player A belongs by referring to the team information shown in FIG. 6 based on the player ID and the like transmitted together with the search start request from the player terminal A. Acquired appearance character information. Then, the battle processing unit 111 refers to the acquired appearance character information (FIG. 7) and, based on a predetermined lottery probability, selects one of the common enemy characters set for the team. Select.

  Next, the battle processing unit 111 sets the player A's opponent as the newly appearing common enemy character based on the interrupt probability set for the selected common enemy character, or has already appeared. Determine whether to set player A's opponent as a common enemy character.

  When the newly appearing common enemy character is set as the opponent of player A, the selected common enemy character is additionally set in the appearance list information shown in FIG. As the appearance list information. At this time, the appearance time and the number of participants of the common enemy character are also set in the appearance list information.

  Further, when the common enemy character is additionally set in the appearance list information, the time count processing unit 113B starts a counting process by a timer based on the internal clock of the CPU or the like for the survival time of the common enemy character. In accordance with this, the count processing unit 113A counts the number of appearances of the common enemy character and updates the appearance character information shown in FIG.

On the other hand, when the common enemy character that has already appeared is set as the opponent of player A, the selected common enemy character is shown as a common enemy character that another player has already appeared in FIG. Since it is listed in the appearance list information, the player A is set in the appearance list information as “interrupt player”. However, since the selected common enemy character may not be listed in the appearance list information shown in FIG. 8 (because it has already been defeated by another player), in this case Exceptionally, it is set as the opponent of Player A as a newly appearing common enemy character.
Here, description will be made assuming that the selected common enemy character is set as the opponent A's opponent as a newly appearing common enemy character.

  Next, when the common enemy character that becomes the opponent of the player A is set in this way, the server device 10 displays the data of the appearing character screen on which the newly appearing common enemy character is displayed as the opponent as screen data. The generation processing unit 115 generates the data (step S103). Then, the server device 10 transmits the appearance character screen data generated by the screen data generation processing unit 115 to the requesting player terminal A via the network.

  Thereafter, when receiving the screen data transmitted from the server device 10, the player terminal A analyzes the screen data to display the appearance character screen on the terminal display unit 24 (step S104).

  Subsequently, when a search operation is performed by the player B, the player terminal B transmits a command (search start request) for requesting a search start based on the operation information to the server device 10 (step S105).

Next, when the server apparatus 10 receives the search start request transmitted from the player terminal B, the server apparatus 10 sets a common enemy character that is the opponent of the player B (step S106). That is, the battle processing unit 111 sets a common enemy character to be the opponent of the player B in the same manner as the process in step S102 described above.
Here, a description will be given assuming that the common enemy character that the player A has already appeared in the process of step S102 described above is set as the opponent of the player B.

  Next, when the common enemy character that is the opponent of Player B is set, the server device 10 displays the data of the appearing character screen in which the common enemy character already appearing as the opponent is displayed as a screen data generation processing unit. 115 (step S107). Then, the server device 10 transmits the appearance character screen data generated by the screen data generation processing unit 115 to the requesting player terminal B via the network.

  After that, when the player terminal B receives the screen data transmitted from the server device 10, the player terminal B displays the appearance character screen on the terminal display unit 24 by analyzing the screen data (step S108).

  Next, if the player terminal B performs an attack operation on the common enemy character that the player A has appeared while the appearance character screen is being displayed on the terminal display unit 24, the player terminal B is based on the operation information. A command requesting an attack on the enemy character (attack request) is transmitted to the server device 10 (step S109).

  Next, when the server apparatus 10 receives the attack request transmitted from the player terminal B, the server apparatus 10 executes an attack process on the common enemy character (step S110).

  Specifically, the battle processing unit 111 refers to the player information shown in FIG. 4 based on the player ID transmitted together with the attack request from the player terminal B, and acquires the possessed character information set for the player B. To do. Then, the battle processing unit 111 refers to the acquired owned character information (FIG. 5), and based on the attack power parameter set for the owned character (player character) of the player B, the damage value given to the common enemy character Is calculated.

  Next, the battle processing unit 111 refers to the appearance list information (FIG. 8) set for the player B's team based on the player ID, the character ID, and the like transmitted together with the attack request from the player terminal B. Get the health parameter set for the common enemy character that will be your opponent. Then, the battle processing unit 111 subtracts the calculated damage value from the acquired physical strength parameter of the common enemy character. At this time, the strength parameter after the subtraction is updated and set in the appearance list information.

  Next, when the attack on the common enemy character is performed in this manner, the server device 10 executes a win / loss determination process for the battle with the common enemy character (step S111).

  Specifically, the battle processing unit 111 determines whether or not the post-subtraction physical strength parameter set for the common enemy character is equal to or less than a predetermined value. In this embodiment, it is determined whether the physical fitness parameter of the common enemy character has become zero.

When this determination is affirmed, the common enemy character is defeated based on the attack operation by the player B, and the defeat of the common enemy character is determined. The battle processing unit 111 gives an acquisition point to the team by this defeat. At this time, the appearance list information (FIG. 8) set for the player B team is updated, and the common enemy character is deleted. When the common enemy character is deleted from the appearance list information, the time count processing unit 113B ends the counting process for the survival time of the common enemy character. In accordance with this, the appearance time, the battle end time, the survival time, etc. of the common enemy character are set in the appearance history information (FIG. 9). On the other hand, if this determination is denied, the common enemy character will survive without being defeated.
Here, description will be made assuming that the defeat of the common enemy character is determined based on the attack operation by the player B.

  Next, when the defeat of the common enemy character is determined in this way, the server device 10 causes the screen data generation processing unit 115 to generate data of the win / loss determination screen (step S112). Then, the server device 10 transmits the winning / losing determination screen data generated by the screen data generation processing unit 115 to the requesting player terminal B via the network.

  After that, when the player terminal B receives the screen data transmitted from the server device 10, the player terminal B analyzes the screen data to display the winning / losing decision screen on the terminal display unit 24 (step S113).

  On the other hand, the player terminal A performs an attack operation on the newly appearing common enemy character when the appearance character screen is displayed on the terminal display unit 24 by the process of step S104 described above. Then, a command (attack request) for requesting an attack on the common enemy character based on the operation information is transmitted to the server device 10 (step S114).

  Next, when the server device 10 receives the attack request transmitted from the player terminal A, the server device 10 executes an attack process on the common enemy character. In this attack process, the battle processing unit 111 refers to the appearance list information (FIG. 8) set for the team of the player A based on the player ID, the character ID, and the like transmitted together with the attack request from the player terminal A. The physical strength parameter set for the common enemy character that is the opponent of Player A is acquired. However, since the common enemy character that is the opponent of Player A has been defeated based on the attack operation by Player B, it has already been deleted from the appearance list information (FIG. 8). Therefore, the battle processing unit 111 cannot acquire the physical strength parameter set for the common enemy character that is the opponent of the player A. As a result, the battle processing unit 111 forcibly ends this attack process (step S115). Since the attack error has occurred due to this forced termination, the count counter 113A counts the number of attack errors and updates the appearance character information shown in FIG.

  Next, when the server device 10 forcibly ends the attack processing for the common enemy character in this way, the server device 10 causes the screen data generation processing unit 115 to generate data of the attack error occurrence screen (step S116). Then, the server device 10 transmits the attack error occurrence screen data generated by the screen data generation processing unit 115 to the requesting player terminal A via the network.

  Next, when receiving the screen data transmitted from the server device 10, the player terminal A analyzes the screen data to display an attack error occurrence screen on the terminal display unit 24 (step S117).

  As described above, in the present embodiment, each common enemy character set in the appearance character information (see FIG. 7) of the team repeatedly appears during the game period in which the team battle is performed. Such an attack error may occur when a battle with a common enemy character is repeated. In particular, this attack error tends to occur more frequently as the number of players participating in a match with a common enemy character increases. Conversely, as the number of players participating in a battle with a common enemy character decreases, this attack error decreases, but the survival time of the common enemy character that has appeared tends to increase. Therefore, by controlling the number of participants as follows, it is possible to optimize the number of players in the team that can participate in the battle with the common enemy character.

<Adequate number of players>
(Example 1)
FIG. 13 is a flowchart for explaining an operation example (No. 1) related to optimization of the number of players.

  First, the count counter 113A counts the number of appearances each time a common enemy character set in the appearance character information (see FIG. 7) of each team newly appears after the team confrontation starts. The appearance character information of each team is updated (step S201).

  In addition, the count processing unit 113A counts the number of attack errors each time an attack error occurs for each common enemy character set in the appearance character information (see FIG. 7) of each team after the team confrontation starts. Then, the appearance character information of each team is updated (step S202).

  Then, the participant number control processing unit 114 refers to the appearance character information (see FIG. 7) of each team at predetermined intervals (for example, every 1 minute) after the start of the team confrontation. Get the appearance count and attack error count, respectively. The number-of-participant control processing unit 114 calculates the attack error rate of each common enemy character using the acquired appearance count and attack error count of each common enemy character, and updates the appearance character information of each team (step S203). ).

  Subsequently, the number-of-participants control processing unit 114 refers to the character information shown in FIG. 3, thereby making a proper attack error associated with each common enemy character set in the appearance character information (see FIG. 7) of each team. Get rates each. Then, the participant number control processing unit 114 compares the acquired appropriate attack error rate associated with each common enemy character with the attack error rate of each common enemy character calculated in the process of step S203 described above. Thus, it is determined whether or not the attack error rate of each common enemy character exceeds the appropriate attack error rate (step S204).

  When the attack error rate of the common enemy character exceeds the appropriate attack error rate (step S204: YES), the participant number control processing unit 114 updates the appearance character information by lowering the interrupt probability set for the common enemy character. (Step S205). On the other hand, if the attack error rate of the common enemy character does not exceed the appropriate attack error rate (step S204: NO), the participant number control processing unit 114 changes the interrupt probability set for the common enemy character. This process is finished without.

  When a plurality of common enemy characters appearing in the appearance list information shown in FIG. 8 are set (for example, when boss A, boss B, and boss C are respectively appearing), the plurality of common enemy characters are displayed. If only the attack error rate of a certain common enemy character (for example, Boss A) exceeds the appropriate attack error rate among characters, not only lowering the interrupt probability of that common enemy character (Boss A) but also other common characters You may control so that the interruption probability of an enemy character (boss B or boss C) is lowered together. Furthermore, among other common enemy characters (boss B and boss C), only the common enemy character (for example, boss B) previously associated with a certain common enemy character (boss B) lowers the interrupt probability together. You may control as follows. At this time, the attack error rate of the common enemy character (boss B) previously associated with a certain common enemy character (boss A) may be stored in common.

  In this way, when an attack error for a common enemy character frequently occurs, control is performed to lower the interrupt probability of the common enemy character. As a result, the probability that the player's opponent will be set as a newly appearing common enemy character increases, so that the number of players participating in the team does not increase, and an attack error against the common enemy character is less likely to occur. As a result, the number of players in the team that can participate in the battle with the common enemy character is optimized.

(Example 2)
FIG. 14 is a flowchart for explaining an operation example (No. 2) related to optimization of the number of players.

  First, the count counter 113A counts the number of appearances each time a common enemy character set in the appearance character information (see FIG. 7) of each team newly appears after the team confrontation starts. The appearance character information of each team is updated (step S301).

  In addition, the time count processing unit 113B determines the survival time from the appearance of each common enemy character set in the appearance character information (see FIG. 7) of each team until the defeat is determined after the team confrontation starts. Counting is performed, and the appearance history information (see FIG. 9) of each team is updated (step S302).

  Then, the participant number control processing unit 114 refers to the appearance history information (see FIG. 9) of each team at every predetermined interval (for example, every 1 minute) after the start of the team confrontation. Each survival time is acquired, the average survival time of each common enemy character is calculated, and the appearance character information (see FIG. 7) of each team is updated (step S303).

  Subsequently, the number-of-participants control processing unit 114 refers to the character information shown in FIG. 3 to thereby determine the appropriate survival time associated with each common enemy character set in the appearance character information (see FIG. 7) of each team. Get each. Then, the participant number control processing unit 114 compares the acquired appropriate survival time associated with each common enemy character and the average survival time of each common enemy character calculated in the process of step S303 described above. Thus, it is determined whether or not the average survival time of each common enemy character exceeds the appropriate survival time (step S304).

  When the average survival time of the common enemy character exceeds the appropriate survival time (step S304: YES), the participant number control processing unit 114 increases the interrupt probability set for the common enemy character and updates the appearance character information. (Step S305). On the other hand, when the average survival time of the common enemy character does not exceed the appropriate survival time (step S304: NO), the participant number control processing unit 114 changes the interrupt probability set for the common enemy character. This process is terminated.

  In this way, if the average life time of the common enemy character becomes longer and the state becomes longer without being defeated, control is performed to increase the interrupt probability of the common enemy character. This increases the probability that the player's opponent is set as a common enemy character that has already appeared, so that the number of players participating in the team increases, and the common enemy character is easily defeated. Therefore, the average survival time of common enemy characters is also shortened. As a result, the number of players in the team that can participate in the battle with the common enemy character is optimized.

  As described above, according to the game system 1 according to the present embodiment, when a battle with a common enemy character is repeatedly performed and the attack error rate for the common enemy character increases, a player who can participate in the battle with the common enemy character. The number of people is controlled so as not to increase. Further, when the battle with the common enemy character is repeatedly performed and the average survival time of the common enemy character becomes longer, the number of players who can participate in the battle with the common enemy character is controlled to increase. As a result, the number of players who can participate in the battle with the common enemy character is optimized as the battle with the common enemy character is repeated, so that the player's willingness to participate in the battle game can be improved. It becomes possible.

=== 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 the present invention includes equivalents thereof. In particular, the embodiments described below are also included in the present invention.

<Adequate number of players>
In the above embodiment, as an example, the number of players who can participate in a battle with the common enemy character is controlled based on whether or not the attack error rate of the common enemy character exceeds the appropriate attack error rate. Although described, the present invention is not limited to this. For example, the number-of-participants control processing unit 114 controls the number of players who can participate in a battle with the common enemy character based on whether or not the number of attack errors of the common enemy character exceeds a preset number of appropriate attack errors. You may do it.

  In the above embodiment, an example is given of controlling the number of players who can participate in a battle with a common enemy character based on whether or not the average survival time of the common enemy character exceeds the appropriate survival time. However, the present invention is not limited to this. For example, the participation number control processing unit 114 may control the number of players who can participate in a battle with the common enemy character based on whether or not the latest survival time of the common enemy character has exceeded the appropriate survival time. .

<Interrupt probability>
In the above embodiment, when the attack error rate of the common enemy character exceeds the appropriate attack error rate, the case where the interrupt probability set for the common enemy character is reduced has been described as an example. It is not limited to this. For example, the number-of-participants control processing unit 114 determines the interrupt set for the common enemy character based on the game play information (for example, level, rank, game score, acquired points, etc.) set for the player who plays against the common enemy character. The probability may be lowered. Thereby, it can control so that the attack error with respect to a common enemy character becomes difficult to generate | occur | produce as the player of a low rank.

<Competition game>
In the present embodiment, the case where the battle game is played in team units (groups) has been described as an example, but the present invention is not limited to this. For example, a battle game may be played in units of players (individuals).

<Game contents>
In the above embodiment, the character card has been described as an example, but the present invention is not limited to this. For example, the game content may be electronic game data, and may be a character itself, a figure, an item such as a tool / ability used in the game, or the like.

<Server device>
In the above 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 to this, and a plurality of server devices 10 are used as an example of the server device. It is good also as the game system 1 provided. 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. The server device 10 is an example of a computer.

<Information processing device>
In the game system 1 according to the above-described embodiment, the case where various types of information processing are executed in cooperation with the server device 10 and the player terminal 20 based on the game program has been described as an example, but the present invention is not limited thereto. Instead, 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.

1 game system, 2 networks, 10 server devices, 11 control unit, 12 storage unit, 13 input unit, 14 display unit, 15 communication unit, 20 player terminal, 21 terminal control unit, 22 terminal storage unit, 23 terminal input unit, 24 terminal display unit, 25 terminal communication unit, 111 battle processing unit, 112 matching processing unit, 113 count processing unit, 113A number count processing unit, 113B time count processing unit, 114 participant number control processing unit, 115 screen data generation processing unit

Claims (6)

An information processing apparatus that executes a battle game in which a common enemy character that is a common opponent for multiple players repeatedly appears,
In response to an attack operation of each of the plurality of players, an attack process for the common enemy character that is appearing is performed, and a battle processing unit that determines victory or defeat for the battle with the common enemy character,
After an attack operation is performed by one of the plurality of players, and before an attack process based on the attack operation of the one player is executed and the defeat of the appearing common enemy character is determined, Count processing for counting the number of attack errors in which the attack processing based on the attack operation of the one player is forcibly terminated when the attack processing based on the attack operation of another player is executed and the defeat of the common enemy character is determined And
Based on the counted number of attack errors, a participation number control processing unit that controls the number of players that can participate when playing again with the common enemy character,
An information processing apparatus comprising: The information processing apparatus according to claim 1,
The participant number control processing unit
Using the counted number of attack errors, an attack error rate for an attack on the common enemy character is calculated,
When the attack error rate of the common enemy character exceeds a preset appropriate attack error rate, control is performed so as not to increase the number of players that can participate when playing again with the common enemy character.
An information processing apparatus characterized by that. An information processing apparatus according to claim 2,
The count processing unit
Every time the common enemy character appears, the survival time from the appearance of the common enemy character until the defeat is determined is counted,
The participant number control processing unit
Using each counted survival time, the average survival time of the common enemy character is calculated,
When the average survival time of the common enemy character exceeds a preset appropriate survival time, control to increase the number of players that can participate when playing again against the common enemy character,
An information processing apparatus characterized by that. An information processing apparatus that executes a battle game in which a common enemy character that is a common opponent for multiple players repeatedly appears,
In response to an attack operation of each of the plurality of players, an attack process for the common enemy character that is appearing is performed, and a battle processing unit that determines victory or defeat for the battle with the common enemy character,
Each time the common enemy character appears, a count processing unit that counts the survival time from the appearance of the common enemy character until the defeat is determined,
Based on the counted survival time, a participant number control processing unit that controls the number of players that can participate when playing again with the common enemy character,
Equipped with a,
The participant number control processing unit
Using each counted survival time, the average survival time of the common enemy character is calculated,
When the average survival time of the common enemy character exceeds a preset appropriate survival time, control to increase the number of players that can participate when playing again against the common enemy character,
An information processing apparatus characterized by that. A game program related to a battle game that repeatedly causes a common enemy character to become a common opponent for multiple players,
On the computer,
In response to an attack operation of each of the plurality of players, a battle process is performed to attack the common enemy character that is appearing, and to determine victory or defeat for the battle with the common enemy character;
After an attack operation is performed by one of the plurality of players and before an attack based on the attack operation of the one player is performed and the defeat of the common enemy character is determined, A counting process for counting the number of attack errors in which an attack based on the attack operation of the one player is forcibly terminated when an attack based on the player's attack operation is performed and the defeat of the common enemy character is determined;
Based on the counted number of attack errors, a participation number control process for controlling the number of players that can participate when playing again with the common enemy character,
A game program characterized by causing a game to be executed. A game program related to a battle game that repeatedly causes a common enemy character to become a common opponent for multiple players,
On the computer,
In response to an attack operation of each of the plurality of players, a battle process is performed to attack the common enemy character that is appearing, and to determine victory or defeat for the battle with the common enemy character;
Each time the common enemy character appears, a counting process that counts the survival time from the appearance of the common enemy character until the defeat is determined,
Based on the counted survival time, a participation number control process for controlling the number of players that can participate when playing again with the common enemy character,
Was executed,
In the participant number control process,
Using each counted survival time, the average survival time of the common enemy character is calculated,
When the average survival time of the common enemy character exceeds a preset appropriate survival time, control to increase the number of players that can participate when playing again against the common enemy character,
A game program characterized by that.

Images