JP2016016314A - Game program and information processor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To enhance a player's motivation for a game.SOLUTION: A game program causes a computer to execute: first match processing which, each time a victory of a player unit is determined, sets a new enemy unit to be matched next against the winner player unit, and determines a victory or defeat in a first match between the player unit and the new enemy unit on the basis of parameters associated with the respective units; and second match processing which, after a defeat of the player unit in the first match is determined, sets as a rental unit any of a plurality of units that the player can rent, and determines a victory or defeat in a second match between the enemy unit that has won in the first match and the rental unit on the basis of parameters associated with the respective units.SELECTED DRAWING: Figure 1

Description

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

  There is known a game program that causes a computer to execute a battle game in which a player character owned by a player and an enemy character as an opponent battle each other (for example, Patent Document 1).

Japanese Patent No. 5478760

In this game program, each time a player character wins, a new enemy character to be the next opponent is determined, so that the player can challenge the next continuous battle game. However, if the player character loses in the continuous battle game, the winning streak stops, which may reduce the player's willingness to play the game. Even if it was possible to re-challenge the battle against the enemy character, it was difficult to increase the player's motivation for the game because the player character who lost once cannot win.
The present invention has been made in view of such circumstances, and an object thereof is to increase a player's willingness to play a game.

The main invention of the present invention to solve the above problems is
A game program for causing a computer to execute a battle game in which a player unit owned by a player and an enemy unit as an opponent battle each other,
On the computer,
Each time a victory of the player unit is determined, a new enemy unit to be next played against the winning player unit is set, and the winning and losing of the first battle performed by the player unit and the new enemy unit, respectively, A first battle process determined based on parameters associated with the unit of
After the player unit is determined to be defeated in the first match, the player sets one of a plurality of units that can be rented as a rental unit and wins the enemy unit and the rental unit in the first match A second battle process for determining a win or loss for the second battle performed based on parameters associated with the respective units;
Is a game program characterized in that
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 deck information. It is a figure which shows the data structure example of list information. 3 is a block diagram illustrating a functional configuration of a player terminal 20. FIG. 4 is a flowchart for explaining an operation example of the player terminal 20. It is a flowchart for demonstrating a 1st battle | competition process. It is a flowchart for demonstrating a 2nd battle | competition process. It is a figure which shows an example of the game screen. FIG. 6 is a diagram illustrating an example of a game screen 60. It is a figure which shows an example of the game screen.

At least the following matters will become apparent from the description of the present specification and the accompanying drawings.
That is, a game program for causing a computer to execute a battle game in which a player unit owned by a player and an enemy unit as an opponent battle each other,
On the computer,
Each time a victory of the player unit is determined, a new enemy unit to be next played against the winning player unit is set, and the winning and losing of the first battle performed by the player unit and the new enemy unit, respectively, A first battle process determined based on parameters associated with the unit of
After the player unit is determined to be defeated in the first match, the player sets one of a plurality of units that can be rented as a rental unit and wins the enemy unit and the rental unit in the first match A second battle process for determining a win or loss for the second battle performed based on parameters associated with the respective units;
Is a game program characterized in that
According to such a game program, even if a player unit loses to an enemy unit in the first match, the rental unit may win the enemy unit in the second match. It is possible to increase the game motivation.

In addition, the computer
Counting processing for counting the number of consecutive wins of the player unit in the first battle, and increasing the number of consecutive wins of the player unit in the first battle when the victory of the rental unit is determined in the second battle Count processing to be executed.
According to such a game program, if the rental unit can win the enemy unit in the second match, the consecutive win in the first match can be continued, so that the game motivation can be further enhanced.

In addition, the computer
An update process for updating the player information in which the number of rental units that can be rented by the player is set according to the number of consecutive wins of the player unit in the first battle may be executed.
According to such a game program, the number of rental units that can be rented by the player can be varied according to the number of consecutive wins, so that the player's willingness to win consecutively can be increased.

In the second battle process, the current value at the end of the first battle is set in the parameter associated with the enemy unit won in the first battle in the second battle. Also good.
According to such a game program, since the rental unit can easily win in the second battle, it is possible to further increase the game motivation of the player who has lost the battle.

The first battle process and the second battle process are:
Advance each battle by alternately attacking opponents, determine their victory or defeat,
Of the first battle process and the second battle process, the second battle process is:
When starting the second battle, it is also possible to change the parameters of the enemy unit that won in the first battle by causing the rental unit to make a first strike.
According to such a game program, since the second battle is easier to win than the first battle, it is possible to further increase the game motivation of the player who has lost the battle.

The first battle process and the second battle process are:
Start each battle by consuming points owned by the player, set the attack power according to the amount of points consumed for each player character and rental unit,
Of the first battle process and the second battle process, the second battle process is:
It is good also as restrict | limiting so that the amount of points consumed in the case of a 2nd battle may be less than the amount of points consumed in the case of a 1st battle.
According to such a game program, it is possible to limit the second battle so that it is not more advantageous than the first battle.

Next, an information processing apparatus for executing a battle game in which a player unit owned by a player and an enemy unit as an opponent battle each other,
Each time a victory of the player unit is determined, a new enemy unit to be next played against the winning player unit is set, and the winning and losing of the first battle performed by the player unit and the new enemy unit, respectively, A first battle processing unit that is determined based on parameters associated with the units;
After the player unit is determined to be defeated in the first match, the player sets one of a plurality of units that can be rented as a rental unit and wins the enemy unit and the rental unit in the first match A second battle processing unit that determines wins and losses for the second battle performed based on parameters associated with each unit;
An information processing apparatus characterized by comprising:
According to such an information processing apparatus, it is possible to increase the game motivation of a player who has been defeated during a series of battles.

=== Embodiment ===
<< Configuration of 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 performed using a game medium. Hereinafter, a battle-type card game performed using a character card (hereinafter also simply referred to as “character”) as an example of a game medium will be described.

  The battle-type card game of this embodiment is a battle game in which a deck as an example of a unit is organized using at least one or more characters, and the organized decks battle each other. In this battle game, a deck organized by a player (hereinafter also referred to as a “player deck”) is played against a deck organized by an opponent (another player or computer) (hereinafter also referred to as an “enemy deck”). (First match). Each time the player deck wins, a new enemy deck to be played next is set. Therefore, if the player deck can continue to win, the first battle with the enemy decks that appear one after another can be continuously performed. On the other hand, if a player deck that has won consecutive wins is defeated, a deck borrowed from a player other than himself (other players or computers) (hereinafter also referred to as “rental deck”) shall be used as “reinforcement”. The rental deck that became the “reinforcement” can be played against the enemy deck that has won the player deck (second battle). If the rental deck wins, it means that the revenge is successful and the player deck keeps winning.

<< 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. The server device 10 includes a control unit 11 for controlling the entire server device 10, a storage unit 12 for storing various data programs, an input unit 13 for a system administrator to input various data, and an operation screen. A display unit 14 for displaying and a communication unit 15 for performing information communication with the player terminal 20 are provided.

  The storage unit 12 according to the present embodiment stores various data such as character information that is information about characters, player information that is information about players, and list information that is information about deck lists.

  FIG. 3 is a diagram illustrating an example data structure of character information. In this character information, in association with the character ID, at least the character name, character image, and initial values of various parameters such as initial attack power, maximum attack power, initial defense power, maximum defense power, initial physical strength, maximum physical strength, etc. And the maximum value is set.

  FIG. 4 is a diagram illustrating an example data structure of player information. The player information is associated with the player ID, and at least the player name, the friend player ID, the level, the battle point, the number of consecutive wins, the number of reinforcement use, and the character owned by the player (hereinafter also referred to as “owned character”). Information about owned characters, which is information, and deck information, which is information about decks organized by the player, are set. The number of times of reinforcement use is the number of rental decks (reinforcements) that a player can rent.

  FIG. 5 is a diagram illustrating a data structure example of owned character information. In this possessed character information, at least current values of various parameters such as level, attack power, defense power, and physical strength are set in association with the character ID of the owned character.

  FIG. 6 is a diagram illustrating an example data structure of deck information. In the deck information, various types of information are set for each of a plurality of player decks formed by a player using a plurality of his / her own characters.

  FIG. 7 is a diagram illustrating a data structure example of the list information. In this list information, a deck formed by using a plurality of characters owned by a friend player is set in association with the list number. This deck is listed in the deck list as a rental deck (reinforcement) that the player can borrow.

<< Configuration of Player Terminal 20 >>
FIG. 8 is a block diagram showing a functional configuration of the player terminal 20. The player terminal 20 of the present embodiment is an information processing apparatus (for example, a mobile phone terminal, a smartphone, a tablet terminal, etc.) used by the player when playing a game, and various information related to the game with the server apparatus 10. (Game data and the like) are connected so as to be able to transmit and receive. The player terminal 20 includes a terminal control unit 21, a terminal storage unit 22, a terminal input unit 23, a terminal display unit 24, and a terminal communication unit 25.

  The terminal control unit 21 exchanges data between each unit and controls the entire player terminal 20, and is realized by a CPU (Central Processing Unit) executing a program stored in a predetermined memory. The The terminal control unit 21 of this embodiment includes at least a game progress processing unit 211, a battle processing unit 212, a reward granting processing unit 213, a count processing unit 214, an update processing unit 215, and a screen generation processing unit 216.

  The game progress processing unit 211 has a function of executing processing for progressing the game according to the game program. The game progress processing unit 211 in the present embodiment advances the battle game by executing various processes related to the battle game in which the decks battle each other.

  The battle processing unit 212 has a function of executing various processes related to the battle. The battle processing unit 212 in the present embodiment includes a first battle processing unit 212A and a second battle processing unit 212B. The first battle processing unit 212A executes various processes related to the first battle performed by the player deck and the enemy deck. Further, each time the player deck wins, the first battle processing unit 212A sets a new enemy deck to be battled next, and battles the winning player deck with the new enemy deck to determine victory or defeat. The second battle processing unit 212B executes various processes related to the second battle performed by the rental deck and the enemy deck. Further, after the player deck is defeated in the first battle, the second battle processing unit 212B battles the rental unit with the enemy deck that has won in the first battle, and determines victory or defeat.

  The reward granting unit 213 has a function of executing a process for giving a reward to the player. The reward granting unit 213 according to the present embodiment grants a reward to the player who owns the player deck when the number of consecutive wins reaches a predetermined number. Further, when the player's deck is rented to another player, the reward granting unit 213 grants a reward to the player who owns the rental deck.

  The count processing unit 214 has a function of executing processing for counting the quantity, number of times, time, etc. used in various processing. For example, the count unit 214 in the present embodiment counts the number of consecutive wins of the player deck or counts the time limit for the battle game.

  The update processing unit 215 has a function of executing processing for updating various types of information. The update processing unit 215 according to the present embodiment updates the number of rental decks (rental number) that the player can rent according to, for example, the number of consecutive wins of the player deck.

  The screen generation processing unit 216 has a function of executing processing for generating screen data for displaying the game screen on the terminal display unit 24. The screen generation processing unit 216 according to the present embodiment generates, for example, a game screen related to a battle between a player deck and an enemy deck and a game screen related to a battle between a rental deck and an enemy deck.

  The terminal storage unit 22 is connected to the terminal control unit 21 via a bus, and performs processing of referring to, reading, and rewriting data stored in response to a command from the terminal control unit 21. The terminal storage unit 22 is realized by, for example, a flash memory or a hard disk, and stores all or part of player information, list information, and the like downloaded from the server device 10.

  The terminal input unit 23 is used by the player to input various operations (game operations and the like), and is realized by, for example, operation buttons, a touch panel, and the like.

  The terminal display unit 24 is for displaying a game screen according to a command from the terminal control unit 21, and is realized by, for example, a liquid crystal display (LCD).

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

<< Operation of Player Terminal 20 >>
FIG. 9 is a flowchart for explaining an operation example of the player terminal 20. Below, the operation example regarding the battle | competition game which concerns on this embodiment is demonstrated concretely.

  First, the player terminal 20 determines whether or not an operation input for starting a battle has been performed by the player (step S101). If the determination is affirmed (step S101: YES), a preset time limit is set. It is determined whether or not the process has ended (step S102).

  If the time limit has expired (step S102: YES), this process ends. On the other hand, when the time limit has not expired (step S102: NO), the first battle process relating to the first battle is performed (step S103). Hereinafter, the first battle process will be specifically described.

  FIG. 10 is a flowchart for explaining the first battle process. First, the player is made to select a battle point to be consumed when the first battle is performed (step S201). At this time, the player terminal 20 causes the screen generation processing unit 216 to generate the game screen 50 illustrated in FIG. 12 and causes the terminal display unit 24 to display the game screen. The game screen 50 includes an operation button 51 for consuming “1 point” of battle points and performing “attack”, and an operation button 52 for consuming “3 points” of battle points and performing “all-out attack”. ing. “All-in-one attack” can inflict damage to opponents more than three times the “attack”. The player selects one of the operation buttons while the game screen 50 is displayed.

  Next, when the player selects the operation button 51 or the operation button 52, the first battle processing unit 212A refers to the player information shown in FIG. 4 and determines whether or not the battle points owned by the player are insufficient. (Step S202). If this determination is affirmed (step S202: YES), this process is terminated, and if this determination is denied (step S202: NO), the player's battle points are consumed (step S203). Thereafter, the update processing unit 215 updates the player information shown in FIG. 4 so that the player's battle points become the amount of points after consumption.

  Next, based on the character information shown in FIG. 3 and the deck information shown in FIG. 6, the first battle processing unit 212A determines an enemy deck as an opponent of the player deck from a plurality of characters (step S204). .

  Next, the first battle processing unit 212A determines the victory or defeat of the first battle performed by the player deck and the enemy deck (step S205). Specifically, the first battle processing unit 212A sets “first deck” as a player deck based on the deck information shown in FIG. 6, and acquires various parameters of the player deck. The first battle processing unit 212A acquires various parameters of the determined enemy deck based on the character information shown in FIG. In the present embodiment, for the enemy deck, the first current value of the physical strength parameter (that is, the current value before the decrease) is used. The first battle processing unit 212A then determines the damage given to the opponent from the attack power parameter of the player deck (the amount of battle points consumed is reflected in the attack power) and the attack power parameter of the enemy deck. Calculate and decrease your opponent's health parameter for each damage. In this way, the attack on each opponent is performed alternately. Then, the winning / losing is determined by reducing the opponent's physical strength parameter to a predetermined value or less.

  Next, when the winning or losing of the first battle is determined in this way, a reward giving process is performed (step S206). Specifically, the reward grant processing unit 213 refers to the player information shown in FIG. 4 and, when the number of consecutive wins reaches a predetermined number, reward (for example, a special item) to the player who owns the player deck. ).

  Returning to FIG. 9, when the first battle process is performed in this manner, the game progress processing unit 211 determines whether or not the player deck has won in the first battle (step S104). When the victory of the player deck is determined (step S104: YES), the process returns to step S102 via steps S105 and S106, and the continuous battle is continued.

  In step S105, the count processing unit 214 increments the number of consecutive wins by one, and the update processing unit 215 updates the number of consecutive wins in the player information (see FIG. 4). Further, in step S106, the update processing unit 215 updates the number of reinforcement use times of the player information (see FIG. 4) according to the number of consecutive wins. For example, the number of reinforcement use times is increased by 1 when winning 5 times, and the number of reinforcement use times is increased by 2 when winning 10 times. In this way, the number of times the rental deck is used can be increased as the game wins, so that the game can be advantageously advanced.

  On the other hand, when the defeat of the player deck is determined (step S104: NO), the game progress processing unit 211 refers to the player information shown in FIG. It is determined whether or not defeat has been determined (step S107). If this determination is negative (step S107: NO), the process returns to step S101 and the subsequent processing is repeated. On the other hand, if this determination is affirmed (step S107: YES), the player is allowed to select whether or not to request reinforcements (rental decks) to be used when performing the second battle (step S108). . At this time, the player terminal 20 causes the screen generation processing unit 216 to generate the game screen 60 shown in FIG. 13 and causes the terminal display unit 24 to display the game screen. The game screen 60 includes an operation button 61 for requesting reinforcement and an operation button 62 for giving up without requesting reinforcement. The player selects one of the operation buttons while the game screen 60 is displayed.

  If the operation button 62 (“give up”) is selected by the player (step S108: NO), the process returns to step S101, and the subsequent processing is repeated. On the other hand, when the operation button 61 (“reinforcement request”) is selected by the player (step S108: YES), a second battle process relating to the second battle is performed (step S109). Hereinafter, the second battle process will be specifically described.

  FIG. 11 is a flowchart for explaining the second battle process. First, when the player selects the operation button 61 (“reinforcement request”), the second battle processing unit 212B refers to the player information shown in FIG. 4 and determines whether or not the player has one or more battle points. Is determined (step S301). If this determination is negative (step S301: NO), this process is terminated, and if this determination is affirmative (step S301: YES), only one player battle point is consumed (step S302). ). Thereafter, the update processing unit 215 updates the player information shown in FIG. 4 so that the player's battle points become the amount of points after consumption.

  Thus, unlike the 1st battle | competition, in the 2nd battle | competition in this embodiment, it restrict | limits so that a player cannot select the amount of points to consume. Therefore, even if the rental deck is extremely stronger than the player deck, the attack power can be suppressed. As a result, it is possible to limit the second battle so that it is not more advantageous than the first battle.

  Next, the 2nd battle | competition process part 212B determines whether a friend player exists by referring the player information shown in FIG. 4 (step S303). If no friend player exists (step S303: NO), a deck list composed of decks of other players excluding the friend player is created (step S304). Specifically, the second battle processing unit 212B identifies other players except the friend player based on the player information shown in FIG. 4, and refers to the deck information (see FIG. 6) of the identified other players. Select one from multiple decks and list.

  On the other hand, if there is a friend player (step S303: YES), it is determined based on the player information shown in FIG. 4 whether or not the remaining number of reinforcement use has reached 0 (step S305). If this determination is affirmative (step S305: YES), as described above, a deck list composed of decks of other players excluding the friend player is created (step S304). On the other hand, if this determination is negative (step S305: NO), a deck list constituted by the decks of the friend players is created (step S306). Specifically, the second battle processing unit 212B creates a deck list composed of decks organized by friend players based on the list information shown in FIG.

  Next, when the deck list is created in this way, the second battle processing unit 212B causes the player to select a rental deck to serve as a reinforcement from a plurality of decks included in the deck list (step S307). At this time, the player terminal 20 causes the screen generation processing unit 216 to generate the game screen 70 illustrated in FIG. 14 and causes the terminal display unit 24 to display the game screen. The game screen 70 displays a list of a plurality of decks that the player can borrow, and operation buttons 71 for selecting a rental deck from the deck list are arranged in association with each deck. The player selects one of the operation buttons 71 while the game screen 70 is displayed.

  Next, when a rental deck is selected from the deck list in this way, a reward granting process is performed (step S308). That is, the reward granting processing unit 213 grants a reward (for example, a special item) for renting its own deck to another player to a friend player or another player who owns the rental deck.

  Next, the second battle processing unit 212B determines the winning or losing of the second battle performed by the rental deck selected according to the player's operation and the enemy deck that has won the player deck in the first battle (step S309). That is, in the second match, a revenge match using a rental deck is performed. Specifically, the second battle processing unit 212B acquires various parameters of the rental deck selected by the player based on the player information shown in FIG. 4, the deck information shown in FIG. 6, and the list information shown in FIG. . Further, the second battle processing unit 212B acquires various parameters of the enemy deck that has won the player deck in the first battle based on the character information shown in FIG. 3 and the deck information shown in FIG. In the present embodiment, for the enemy deck, the current value after the decrease in the physical strength parameter (that is, the current value at the end of the first battle) is used. Therefore, the player can advance the second battle advantageously. Then, the second battle processing unit 212B calculates the damage to the opponent from the attack power parameter of the rental deck and the attack power parameter of the enemy deck, and decreases the physical strength parameter of the opponent according to each damage. In this way, the attack on each opponent is performed alternately. At this time, in the case of a rental unit, unlike the player deck, a first strike is performed on the enemy deck. Thereby, a player 2nd battle | competition can be advanced advantageously. Then, it is determined by first reducing the opponent's physical strength parameter to a predetermined value or less.

  Returning to FIG. 9, when the second battle process is performed in this way, the game progress processing unit 211 determines whether or not the rental deck (reinforcement) has won in the second battle (step S110). When the defeat of the rental deck is determined (step S110: NO), the process returns to step S101 and the subsequent processing is repeated. On the other hand, when the victory of the rental deck is determined (step S110: YES), the process returns to step S102 via steps S111 and S112, and the continuous battle is continued.

  In step S111, the count processing unit 214 increments the number of consecutive wins by one, and the update processing unit 215 updates the number of consecutive wins in the player information (see FIG. 4). That is, if it is possible to win in the second battle, the consecutive win state in the first battle will be maintained. Further, in step S112, the update processing unit 215 updates the number of reinforcement use times of the player information (see FIG. 4) according to the number of consecutive wins. In this way, the number of times the rental deck can be used can be increased as the number of consecutive wins increases, so that the player can advantageously advance the game.

  As described above, according to the game program according to the present embodiment, the player can perform the first battle using his / her player deck. In the first battle, every time the player deck wins, a new enemy deck to be played next is set, so that the player can play one after another. Players have the merit of getting more rewards as they win consecutively. Even when the player deck is defeated during the first battle, the player can play the second battle using the rental deck (reinforcement) borrowed from another person. In the second match, the enemy deck that won in the first match becomes the opponent, so if the rental deck wins, it can be insulted. Furthermore, if it is possible to win in the second battle, the consecutive win state in the first battle will be maintained, so that the player can further increase the number of consecutive wins. This makes it possible to increase the game motivation of a player who has lost the battle.

=== 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.

<Unit>
In the above-described embodiment, a deck composed of a plurality of character cards has been described as an example of a unit. However, the present invention is not limited to this. For example, a deck composed of only one character card or one character itself may be used as a unit.

<Deck List>
In the present embodiment, the deck list in which the decks owned by the friend player are displayed as rental decks has been described as an example. However, the present invention is not limited to this. For example, a deck list including a special rental deck prepared in advance by the game developer may be used, or a deck list including decks owned by players other than the friend player may be used. Moreover, you may combine these.
Further, for example, a deck list that includes a deck having a higher level than the player deck (strong deck), a deck at the same level as the player deck, and a deck lower than the player deck (weak deck) at a predetermined ratio may be used. Thereby, the player can select a rental deck according to the strength of the enemy deck.

  In the present embodiment, decks owned by other players designated by the player may be displayed as a rental deck in a list. Specifically, the player terminal 20 transmits the player ID of another player input by the player to the server device 10. The server device 10 searches for player information (see FIG. 4) based on the player ID, and acquires deck information (see FIG. 6) of other players. And the server apparatus 10 produces | generates list information (refer FIG. 7) by referring the deck information. Then, the player terminal 20 can select a deck of another player designated by the player from the deck list by displaying the deck list on the game screen based on the list information.

<Number of reinforcements used>
In the present embodiment, the case where the number of times of use of reinforcements (rental decks) can be increased as the number of wins continues is described as an example. However, the present invention is not limited to this. For example, the number of reinforcement use may be set according to the number of friend players that the player can own. At this time, the number of friend players that the player can own may be set according to the level of the player. Specifically, the battle processing unit 212 determines whether or not the victory point given to the player who has won the battle has reached a predetermined value or more, and when the determination is affirmed, the level of the player is increased. You may do it. Here, the battle processing unit 212 may increase the point amount of victory points given to the player as the number of consecutive wins of the player increases. In this way, the player can increase the number of friends that can be owned as he / she increases the level of his / her own by playing a battle, and as a result, the number of reinforcement use can be increased.

<Reward Grant>
In the present embodiment, the case where the reward granting unit grants an item as an example of reward has been described as an example, but the present invention is not limited to this. For example, in-game currency, parameters such as experience values, character cards, etc. may be used.

  In the above embodiment, the case where a reward is given to a friend player when the friend player's deck is selected as a rental deck by the player has been described, but the present invention is not limited to this. Absent. For example, when a friend's deck is selected as a rental deck by the player and the rental deck wins a battle with an enemy deck, a separate reward may be given to the friend player.

<Information processing device>
In the game system 1 according to the present embodiment, the case where the player terminal 20 as an example of the information processing apparatus executes various types of information processing based on the game program has been described as an example. It is not limited. For example, the server device 10 alone may execute the above-described various information processing based on the game program. Further, for example, the server device 10 may have a part of the function as the information processing device. In this case, the server device 10 and the player terminal 20 constitute an information processing device. The information processing apparatus is an example of a computer.

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, 50 game screen, 51 operation button, 52 operation button, 60 game screen, 61 operation button, 62 operation button, 70 game screen, 71 operation button, 211 game progress processing unit, 212 match Processing unit, 212A first battle processing unit, 212B second battle processing unit, 213 reward granting processing unit, 214 count processing unit, 215 update processing unit, 216 screen generation processing unit

Claims (7)

A game program for causing a computer to execute a battle game in which a player unit owned by a player and an enemy unit as an opponent battle each other,
On the computer,
Each time a victory of the player unit is determined, a new enemy unit to be next played against the winning player unit is set, and the winning and losing of the first battle performed by the player unit and the new enemy unit, respectively, A first battle process determined based on parameters associated with the unit of
After the player unit is determined to be defeated in the first match, the player sets one of a plurality of units that can be rented as a rental unit and wins the enemy unit and the rental unit in the first match A second battle process for determining a win or loss for the second battle performed based on parameters associated with the respective units;
A game program characterized by causing a game to be executed. The game program according to claim 1,
On the computer,
Counting processing for counting the number of consecutive wins of the player unit in the first battle, and increasing the number of consecutive wins of the player unit in the first battle when the victory of the rental unit is determined in the second battle Counting process,
A game program characterized by causing a game to be executed. A game program according to claim 2,
On the computer,
An update process for updating the player information in which the number of rental units that the player can borrow is set according to the number of consecutive wins of the player unit in the first battle,
A game program characterized by causing a game to be executed. A game program according to any one of claims 1 to 3,
The second battle process sets a current value at the end of the first battle to a parameter associated with the enemy unit that won in the first battle in the second battle,
A game program characterized by that. A game program according to any one of claims 1 to 4,
The first battle process and the second battle process are:
Advance each battle by alternately attacking opponents, determine their victory or defeat,
Of the first battle process and the second battle process, the second battle process is:
When starting the second match, changing the parameters of the enemy unit won in the first match by causing the rental unit to make a first strike.
A game program characterized by that. A game program according to any one of claims 1 to 5,
The first battle process and the second battle process are:
Start each battle by consuming points owned by the player, set the attack power according to the amount of points consumed for each player character and rental unit,
Of the first battle process and the second battle process, the second battle process is:
Limit the amount of points consumed in the second match to be less than the amount of points consumed in the first match,
A game program characterized by that. An information processing apparatus for executing a battle game in which a player unit owned by a player and an enemy unit as an opponent battle each other,
Each time a victory of the player unit is determined, a new enemy unit to be next played against the winning player unit is set, and the winning and losing of the first battle performed by the player unit and the new enemy unit, respectively, A first battle processing unit that is determined based on parameters associated with the units;
After the player unit is determined to be defeated in the first match, the player sets one of a plurality of units that can be rented as a rental unit and wins the enemy unit and the rental unit in the first match A second battle processing unit that determines wins and losses for the second battle performed based on parameters associated with each unit;
An information processing apparatus comprising:

Images