JP2019069243A - Game program and information processing apparatus - Google Patents

Abstract

To provide a game program capable of enhancing a strategy in a competition game with a rental function.SOLUTION: A game program causes a computer to execute the processes to: play a player unit selected by a player from a game field against an enemy unit in a movement destination after moving the player unit on the game field according to the player's operation; and play a rental unit selected by the player from a unit list against the enemy unit on the game field without moving the rental unit on the game field.SELECTED DRAWING: Figure 14

Description

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

  There is known a game program for causing a computer to execute a battle game in which a player competes a character (rental character) borrowed from another player with an enemy character (for example, Patent Document 1).

Patent No. 5091073 gazette

In this game program, there is no difference in the tactics that the player can use between playing a rental character with an enemy character and playing a non-rental character with an enemy character, so strategy was poor. .
The present invention has been made in view of such circumstances, and an object thereof is to enhance the strategicity in a competition game with a rental function.

The main invention of the present invention for solving 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 play a battle while moving on the game field,
On the computer
A first screen generation process of generating a game screen including the game field in which the player unit and the enemy unit are arranged;
A first unit selection process for causing the player to select a player unit to play a match from among the game fields when the game field is displayed on the game screen;
A first battle process in which the player unit selected by the player is moved on the game field according to the operation of the player and then played against the destination enemy unit;
A second screen generating process for generating a game screen including a unit list in which rental units that can be borrowed by the player are listed;
A second unit selection process for causing the player to select a rental unit to play a match from the unit list when the unit list is displayed on the game screen;
A second battle process in which the rental unit selected by the player is played against an enemy unit on the game field without moving the rental unit on the game field;
Is a game program characterized in that
Other features of the present invention will be apparent from the description of the present specification and the accompanying drawings.

FIG. 1 is a view showing an example of the overall configuration of a game system 1; FIG. 2 is a block diagram showing a functional configuration of the server device 10. It is a figure which shows the example of a data structure of card information. It is a figure which shows the example of a data structure of player information. It is a figure which shows the example of a data structure of possession card information. It is a figure which shows the example of a data structure of deck information. It is a figure which shows the example of a data structure of game field information. It is a figure which shows the example of a data structure of list information. FIG. 2 is a block diagram showing a functional configuration of a player terminal 20. It is a flowchart for demonstrating the operation example in the case of playing a player deck and an enemy deck in battle. It is a figure which shows an example of the game screen 50 containing a game field. It is a flowchart for demonstrating a 1st battle | competition process. It is a figure which shows an example of the game screen 60 containing a battle | competition scene. It is a flowchart for demonstrating the operation example in the case of making a rental deck and an enemy deck match. It is a figure which shows an example of the game screen 70 containing a deck list | wrist. It is a flowchart for demonstrating a 2nd battle | competition process.

At least the following matters will be made clear by the present specification and the description of the accompanying drawings.
That is, it 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 play a battle while moving on the game field,
On the computer
A first screen generation process of generating a game screen including the game field in which the player unit and the enemy unit are arranged;
A first unit selection process for causing the player to select a player unit to play a match from among the game fields when the game field is displayed on the game screen;
A first battle process in which the player unit selected by the player is moved on the game field according to the operation of the player and then played against the destination enemy unit;
A second screen generating process for generating a game screen including a unit list in which rental units that can be borrowed by the player are listed;
A second unit selection process for causing the player to select a rental unit to play a match from the unit list when the unit list is displayed on the game screen;
A second battle process in which the rental unit selected by the player is played against an enemy unit on the game field without moving the rental unit on the game field;
Is a game program characterized in that
According to such a game program, the strategy can be changed between when the player unit is played against the enemy unit and when the rental unit is played against the enemy unit. It is possible to enhance.

In the second unit selection process, the selection of the rental unit by the player may be permitted when a predetermined condition is satisfied.
According to such a game program, it is possible to suppress the abuse of the rental unit in the battle with the enemy unit.

The predetermined condition may be at least one of a condition regarding the player, a condition regarding the game field, and a condition regarding the rental unit.
According to such a game program, it is possible to limit the abuse of the rental unit in accordance with the game situation in the match against the enemy unit.

Further, the second screen generation process displays a list of friend units owned by a friend player associated with the player as a rental unit in the unit list.
In the second unit selection process, selection of the friend unit by the player may be limited based on the number of selections made by the friend unit.
According to such a game program, by renting a unit owned by a friend player, it is possible to communicate with other players and ensure that only a specific friend unit is not repeatedly rented. This makes it possible to reduce biased communication.

In addition, when the friend unit is selected as the rental unit by the player in the second unit selection process, the computer executes a reward giving process of giving a reward to the friend player who owns the friend unit. It is also possible to let
According to such a game program, communication between players can be activated.

Next, an information processing apparatus in which a player game owned by a player and an enemy unit as an opponent execute a battle game in which a battle is played while moving on the game field,
A first screen generation processing unit that generates a game screen including the game field in which the player unit and the enemy unit are arranged;
A first unit selection processing unit that causes the player to select a player unit to play a match from among the game fields when the game field is displayed on the game screen;
A first battle processing unit for causing the player unit selected by the player to move against the enemy unit disposed at the movement destination after moving the player unit selected by the player on the game field according to the operation of the player;
A second screen generation processing unit that generates a game screen including a unit list in which rental units that can be borrowed by the player are listed;
A second unit selection processing unit that causes the player to select a rental unit to play a match from the unit list when the unit list is displayed on the game screen;
A second battle processing unit for making the rental unit selected by the player compete with the enemy unit on the game field without moving the rental unit on the game field;
An information processing apparatus comprising:
According to such an information processing apparatus, it is possible to enhance the strategicity of the rental possible match game.

=== Embodiments ===
<< Configuration of game system 1 >>
FIG. 1 is a diagram showing an example of the overall configuration of the game system 1. The game system 1 provides the player with various services related to the game via the network 2 (for example, the Internet etc.), and includes a server device 10 and a plurality of player terminals 20.

  The game system 1 which concerns on this embodiment can provide a player with the competitive game performed using a game medium. Below, a battle-type card game performed using a character card as an example of a game medium will be described.

  In the battle type card game of the present embodiment, when a plurality of decks as an example of a unit are arranged on the game field having a plurality of unit areas, the plurality of decks move between the unit areas while the decks are moving between the decks. It is a battle game in which a battle is played. In this competition game, a deck organized by a player (hereinafter also referred to as a “player deck”) and a deck organized by an opponent (other players or computers) (hereinafter also referred to as an “enemy deck”) The movement is repeated alternately, and the battle is started when both meet on the unit area of the movement destination. In this competition game, players can use not only their own player deck but also rental decks that can be borrowed from other players for that competition.

<< Configuration of Server Device 10 >>
FIG. 2 is a block diagram showing the functional configuration of the server device 10. As shown in FIG. The server apparatus 10 is an information processing apparatus (for example, a workstation, a personal computer, etc.) 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 or the like 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 included.

  The storage unit 12 in the present embodiment includes various data such as card information which is information related to a character card, player information which is information related to a player, game field information which is information related to a game field, and list information which is information related to a deck list. It is memorized.

  FIG. 3 is a view showing an example data structure of card information. In this card information, at least, character names, job titles, maximum levels, and initial values of various parameters such as aggression, defense, physical strength, intelligence and the like are set in association with the card ID.

  FIG. 4 is a diagram showing an example data structure of player information. The player information includes at least a friend player ID, a play point (for example, a virtual currency), and an owned card which is information on a character card owned by the player (hereinafter also referred to as “owned card”) in association with the player ID. Information, deck information which is information about the deck organized by the player is set.

  FIG. 5 is a view showing an example of the data structure of owned card information. In the possessed card information, at least current values of various parameters such as level, aggression, defense, physical strength and intelligence are set in association with the card ID of the possessed card.

  FIG. 6 is a diagram showing an example data structure of deck information. In the deck information, various types of information are set for each of a plurality of decks which the player has organized using a plurality of cards owned by the player.

  FIG. 7 is a view showing an example data structure of game field information. In the game field information, decks (player decks, enemy decks) arranged in each unit area on the game field are set in association with the area ID of the unit area.

  FIG. 8 is a diagram showing an example data structure of list information. In the list information, a friend deck formed by using a plurality of character cards owned by a friend player is set in association with the list number. This friend deck is listed on the deck list as a rental deck that the player can borrow.

<< About the configuration of the player terminal 20 >>
FIG. 9 is a block diagram showing a functional configuration of the player terminal 20. As shown in FIG. The player terminal 20 of the present embodiment is an information processing apparatus (for example, a mobile phone terminal, a smartphone, a tablet type terminal, etc.) used by the player when playing a game, and various information on the game with the server apparatus 10 It is connected to be able to transmit and receive (game data etc.). 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 the respective units and controls the entire player terminal 20. The terminal control unit 21 is realized by executing a program stored in a predetermined memory by a CPU (Central Processing Unit). Be done. The terminal control unit 21 of the present embodiment includes at least a deck selection processing unit 211, a battle processing unit 212, a screen generation processing unit 213, and a reward giving unit 214.

  The deck selection processing unit 211 is an example of a unit selection processing unit, and has a function of executing a process of causing the player to select any of a plurality of decks. The deck selection processing unit 211 includes a first deck selection processing unit 211A and a second deck selection processing unit 211B. When the game field is displayed on the game screen, when the first deck selection processing unit 211A receives an operation input of a player who selects one of the decks from the game field, the first deck selection processing unit Determine the deck to be When the deck list is displayed on the game screen, and the second deck selection processing unit 211B receives an operation input from a player who selects any deck from the deck list, the second deck selection processing unit Determine the deck to be

  The battle processing unit 212 has a function of executing a process of advancing a battle game according to the game program. The battle processing unit 212 includes a first battle processing unit 212A and a second battle processing unit 212B. The first battle processing unit 212A moves the player deck on the game field in response to the player's operation, and then executes a process to play a battle against the destination enemy deck. In response to the player's operation, the second competition processing unit 212B executes processing to make the rental deck compete with the enemy deck on the game field without moving the rental deck on the game field.

  The screen generation processing unit 213 has a function of executing processing of generating screen data for displaying the game screen on the terminal display unit 24. The screen generation processing unit 213 includes a first screen generation processing unit 213A and a second screen generation processing unit 213B. The first screen generation processing unit 213A executes a process of generating a game screen regarding a match between the player deck and the enemy deck. The second screen generation processing unit 213B executes a process of generating a game screen relating to a match between the rental deck and the enemy deck.

  The reward giving unit 214 has a function of executing a process of giving a reward to the player. The reward giving unit 214 in the present embodiment executes processing for giving a reward to the player who owns the rental deck, when the player's own deck is rented to another player.

  The terminal storage unit 22 is connected to the terminal control unit 21 via a bus, and performs processing of referring to, reading out, and rewriting data stored in accordance with an instruction 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 at least player information, game field information, list information, and the like downloaded from the server device 10.

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

  The terminal display unit 24 is for displaying a game screen according to an instruction 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 transmitting / receiving unit for transmitting / receiving various information to / from the server device 10 via the network 2 and is realized by, for example, a network interface card (NIC).

<< About the operation of the player terminal 20 >>
Here, an operation example of the player terminal 20 will be described. The player terminal 20 according to the present embodiment performs different operations in the case where the player deck and the enemy deck are played against each other and in the case where the rental deck and the enemy deck are played against each other. Each operation will be specifically described below.

<A match between the player deck and the enemy deck>
FIG. 10 is a flow chart for explaining an operation example in the case where the player deck and the enemy deck are played against each other.

  First, in response to the player's operation, the player terminal 20 causes the first screen generation processing unit 213A to generate a game screen including a game field, and causes the terminal display unit 24 to display the game screen (S101). Specifically, based on the game field information shown in FIG. 7, the first screen generation processing unit 213A generates a game screen including a game field in which the player deck and the enemy deck are arranged.

  FIG. 11 is a view showing an example of the game screen 50 including the game field. On the game screen 50, a game field 51, a deck state display area 52, the number of remaining turns 53, a plurality of unit areas 511A to 511L, a player deck 61F, and enemy decks 65B and 65C are displayed. In the game field 51, the player deck 61F is disposed in the unit area 511K, the enemy deck 65B is disposed in the unit area 511F, and the enemy deck 65C is disposed in the unit area 511C. The deck status display area 52 is displayed to distinguish whether the player deck 61F in the battle is in a battleable state or in a non-matchable state. The remaining turn number 53 indicates the number of times the player deck 61F on the game field 51 can move, and decreases by one each time the player moves the player deck 61F. Also, each time the number of remaining turns decreases, the player is given skill points. The player can use the skill points to activate skills (such as damaging the enemy deck or stopping the enemy deck for a predetermined turn) that is advantageous in the match.

  Next, returning to FIG. 10, when the game screen 50 shown in FIG. 11 is displayed on the terminal display unit 24, the first deck selection processing unit 211A plays a match from among a plurality of decks on the game field 51. The player is made to select the player deck 61F (S102). The player deck 61F to be played may be selected by allowing the player to select the player deck 61F itself, or by allowing the player to select a unit area to which the player deck 61F is to be moved.

  Next, the first battle processing unit 212A performs a first battle process to battle the player deck 61F selected by the player with the enemy decks 65B and 65C on the game field (S103). Below, this 1st battle | competition process is demonstrated concretely.

FIG. 12 is a flowchart for explaining the first battle process.
First, in response to the player's operation, the first battle processing unit 212A moves the player deck 61F disposed in the unit area 511K to the unit area of the movement destination designated by the player (S201). At this time, the game field information shown in FIG. 7 is updated based on the unit area disposed after the movement of the player deck. In addition, the remaining number of turns whose number has been decreased by one due to this movement is updated and recorded in the terminal storage unit 22.

  Next, based on the game field information, the first battle processing unit 212A determines whether or not the enemy deck to be the opponent is arranged in the unit area of the movement destination of the player deck 61F (S202).

  Then, when the enemy deck is arranged in the unit area of the movement destination (S202: YES), the process proceeds to step S205, and the battle is started. On the other hand, when the enemy deck is not arranged (S202: NO), the unit area of the movement destination of the enemy decks 65B and 65C is determined (S203). At this time, the game field information shown in FIG. 7 is updated based on the unit area arranged after the movement of the enemy deck.

  Next, based on the game field information, the first battle processing unit 212A determines whether or not the player deck as the opponent is disposed in the unit area of the movement destination of the enemy decks 65B and 65C (S204). .

  Then, when the player deck is arranged in the unit area of the movement destination (S204: YES), the process proceeds to step S205, and the battle is started. On the other hand, when the player deck is not arranged (S204: NO), the process returns to step S201, and the subsequent processes are repeated.

  In step S205, the player terminal 20 causes the first screen generation processing unit 213A to generate a game screen including a battle scene of the player deck and the enemy deck, and causes the terminal display unit 24 to display the game screen. Specifically, based on the deck information shown in FIG. 6, the first screen generation processing unit 213A generates a game screen in which the character card making up the player deck and the character card making up the enemy deck play a match.

  FIG. 13 is a view showing an example of the game screen 60 including a battle scene. On the game screen 60, a battle field 61, a deck configuration card display area 62, player characters 61A and 61B, and enemy characters 61C and 61D are displayed. In the deck configuration card display area 62, a plurality of player characters 62A to 62C constituting a player deck are displayed side by side. In the battle field 61, the player characters 61A and 61B selected by the player from among the player characters arranged in the deck configuration card display area 62 are in a state of playing against the enemy characters 61C and 61D constituting the enemy deck. It is displayed.

  Next, the first battle processing unit 212A causes the player characters 61A and 61B and the enemy characters 61C and 61D to alternately attack the opponent (S206). At this time, the size of the attack power or the like of each character is determined based on the card information shown in FIG. 3 or the owned card information shown in FIG.

  Next, the first battle processing unit 212A determines whether the outcome has been determined by the mutual attack of the player characters 61A, 61B and the enemy characters 61C, 61D (S207). The determination of the outcome is made by first reducing the opponent's strength parameter to a predetermined value or less.

  Then, if the outcome is determined (S207: YES), this process is ended, and if the outcome is not determined (S207: NO), the process returns to step S206 to repeat each other's attack process.

  Next, returning to FIG. 10, when the outcome of the battle between the player deck and the enemy deck is decided in this way, this process is ended.

<A game between a rental deck and an enemy deck>
FIG. 14 is a flowchart for explaining an operation example in the case where the rental deck and the enemy deck are played against each other.

  First, in response to the player's operation, the player terminal 20 causes the second screen generation processing unit 213B to generate a game screen including the deck list, and causes the terminal display unit 24 to display the game screen (S301). Specifically, based on the list information shown in FIG. 8, the second screen generation processing unit 213B generates a game screen including a deck list on which rental decks that can be borrowed by other players can be displayed.

  FIG. 15 is a view showing an example of the game screen 70 including the deck list. The game screen 70 lists friend decks owned by friend players associated with the player as rental decks that can be rented by the player. The player can borrow the friend deck as a rental deck by selecting the operation button 71 provided corresponding to each of the friend decks.

  Next, returning to FIG. 14, the second deck selection processing unit 211B is a rental deck in which a battle is played from among a plurality of decks on the deck list when the game screen 70 shown in FIG. 15 is displayed on the terminal display unit 24. The player is made to select (friend deck) (S302).

  At this time, the second deck selection processing unit 211B permits the player to select a rental deck only when the predetermined condition is satisfied. Specifically, the second deck selection processing unit 211B reads out from the terminal storage unit 22 the number of selections in which the friend deck is selected as a rental deck, and the number of selections is equal to or greater than a predetermined number (for example, once or more). It is determined whether or not. As a result of the determination, when it is determined that the number of selections does not exceed the predetermined number, the player is permitted to select a rental deck (friend deck). Therefore, when the player selects the rental deck (strong rental deck) of the highest level from the deck list at the time of the current match, the player may not be able to select the rental deck again at the next match. There is also a fear. Therefore, the player needs to select a rental deck from the deck list in consideration of the strength of the enemy deck and the game situation such as the order of battles.

  Next, when the rental deck is selected from the deck list in this way, the reward giving unit 214 gives the friend player who owns the rental deck a reward for having rented his deck to another player. Processing is executed (S303). In the present embodiment, a play point is given to the friend player as an example of the reward. At this time, player information (see FIG. 4) of the friend player is updated.

  Next, the second battle processing unit 212B performs a second battle process to battle the rental deck selected by the player with the enemy deck on the game field without moving the rental deck on the game field (S304). Below, this 2nd battle | competition process is demonstrated concretely.

FIG. 16 is a flowchart for explaining the second battle process.
First, when the rental deck is selected by the player on the game screen 70 including the deck list shown in FIG. 15, the player terminal 20 causes the terminal display unit 24 to display the game screen 50 including the game field shown in FIG. (S401).

  Next, when the game screen 50 shown in FIG. 11 is displayed on the terminal display unit 24, the second deck selection processing unit 211B becomes an opponent among the enemy decks 65B and 65C on the game field 51. The player is made to select an enemy deck (S402). That is, unlike when using the player deck, the player does not need to move the deck to the unit areas 511F and 511C where the enemy decks 65B and 65C are disposed, when playing a game using the rental deck, so the enemy deck 65B You can start the match instantly by selecting the 65C on the game field.

  Next, when the battle is started by selecting the enemy deck to be the opponent, the player terminal 20 causes the second screen generation processing unit 213B to generate a game screen including a battle scene of the rental deck and the enemy deck. , And display the game screen on the terminal display unit 24 (S403). Specifically, based on the deck information shown in FIG. 6, the second screen generation processing unit 213B is a game screen in which a character card constituting a rental deck (friend deck) and a character card constituting an enemy deck play a match. Generate The game screen including the battle scene has the same screen configuration as the game screen 60 shown in FIG.

  Next, the second battle processing unit 212B causes the rental character and the enemy character to alternately attack the opponent (S404). At this time, the size of the attack power or the like of each character is determined based on the card information shown in FIG. 3 or the owned card information shown in FIG.

  Next, the second battle processing unit 212B determines whether or not the winning and losing have been determined by the mutual attack of the rental character and the enemy character (S405). The determination of the outcome is made by first reducing the opponent's strength parameter to a predetermined value or less.

  Then, if the outcome is determined (S405: YES), this process is ended, and if the outcome is not determined (S405: NO), the process returns to step S404 to repeat each other's attack process.

  Next, returning to FIG. 14, when the outcome of the battle between the rental deck and the enemy deck is decided in this way, this process is ended. In the case where the rental deck and the enemy deck described above are to be played against each other, the remaining number of turns is not consumed, unlike the case where the player deck and the enemy deck are played against each other. Thus, by using the rental deck, the player can play against the enemy deck without consuming the number of turns, and the player can take a wider range of strategies.

  As described above, according to the game program according to the present embodiment, after moving the player deck selected by the player from the game field on the game field according to the operation of the player, the movement destination enemy deck and It causes the player terminal 20 to execute a process of playing a match, and a process of playing a rental deck selected by the player from the deck list against an enemy deck on the game field without moving it on the game field. As a result, it is not necessary to move the rental deck on the game field in the rental deck match as compared to the player deck, so it is possible to play the match against the enemy deck instantly. That is, the player can change the tactics in a case of fighting against an enemy deck using a player deck and on a case of fighting against an enemy deck using a rental deck. Therefore, it is possible to enhance the strategicity of the rental game that can be rented. Also, when the player selects a rental deck from the deck list, the selection of the rental deck is limited based on the number of times the rental deck is selected. Therefore, the game situation is displayed as to whether the player should use the player deck to challenge the battle, or should use the rental deck to challenge the battle, and which rental deck should be selected from the deck list. You can make a choice while making a strategy while taking into consideration, and enjoy the match game.

=== Other Embodiments ===
The above embodiments are for the purpose of facilitating the understanding of the present invention, and are not for the purpose of limiting the present invention. The present invention can be modified or improved without departing from the gist thereof, and the present invention also includes the equivalents thereof. In particular, the embodiments described below are also included in the present invention.

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

<Predetermined condition>
In the above-described embodiment, as an example of the predetermined condition for permitting the selection of the rental deck, the number of times of selection for which the friend deck is selected as the rental deck does not exceed the predetermined number of times (for example, once a day) Although the conditions relating to the rental deck have been described as an example, the present invention is not limited to this. For example, conditions relating to the player (for example, the rental deck is a friend deck, the player has a predetermined amount of play points (corresponding to the rental fee), and the player has a predetermined amount of skill points And the like, and conditions relating to the game field (for example, being a special game field appearing only at the time of an event). Also, these conditions may be combined.

<Deck List>
In the above-described embodiment, a deck list in which friend decks owned by friend players are listed as rental decks has been described as an example, but the present invention is not limited to this. For example, it may be a deck list including a special rental deck prepared in advance by the game developer, or may be a deck list including decks owned by players other than the friend player. Moreover, you may combine these. This allows the rental deck to be used even by a player who has not yet made friends.
For example, the deck list may be a friend deck (strong deck) at a level higher than the player deck, a friend deck at the same level as the player deck, and a friend deck (weak deck) at a lower level than the player deck. . This allows the player to select a rental deck according to the strength of the enemy deck.

  Further, in the above-described embodiment, decks owned by other players designated by the player may be listed and displayed as rental decks. Specifically, the player terminal 20 transmits, to the server device 10, the player IDs of the other players operated and input by the player. The server device 10 searches player information (see FIG. 4) based on the player ID and acquires deck information (see FIG. 6) of other players. Then, the server device 10 generates list information (see FIG. 8) by referring to the deck information. Then, the player terminal 20 can display the deck list on the game screen based on the list information, and can thereby select the decks of the other players specified by the player from the deck list.

<Reward grant>
In the above-described embodiment, although the case where the reward giving unit gives play points as an example of the reward has been described as an example, the present invention is not limited to this. For example, items, parameters such as experience points, character cards, etc. may be used.

  In the above-described embodiment, although the case where the player selects a friend deck as a rental deck has been described as giving a reward to the friend player, the present invention is not limited to this. For example, when a friend deck is selected as a rental deck by the player and the friend deck wins the battle against the enemy deck, a reward may be given to the friend player.

<Information processing device>
In the game system 1 according to the above-described embodiment, the player terminal 20 as an example of the information processing apparatus executes various information processing based on the game program. It is not limited. For example, the server device 10 alone may execute the various information processing described above based on the game program. Further, for example, the server device 10 may be configured to bear a part of the function as the information processing apparatus. 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 network, 10 server devices, 11 control units, 12 storage units, 13 input units, 14 display units, 15 communication units, 20 player terminals, 21 terminal control units, 22 terminal storage units, 23 terminal input units, 24 terminal display unit 25 terminal communication unit 50 game screen 51 game field 52 deck status display area 53 remaining number of turns 60 game screen 61A player character 61B player character 61C enemy character 61D enemy character 61F Player Deck, 62A Player Character, 62B Player Character, 62C Player Character, 65B Enemy Deck, 65C Enemy Deck, 70 Game Screen, 71 Operation Buttons, 211 De Kiki selection processing unit, 211A first deck selection processing unit, 211B second deck selection processing unit, 212 battle processing unit, 212A first battle processing unit, 212B second battle processing unit, 213 screen generation processing unit, 213A first Screen generation processing unit, 213 B Second screen generation processing unit, 214 Reward granting unit, 511A to 511L Unit area

Claims (6)

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 play a battle while moving on the game field,
On the computer
A first screen generation process of generating a game screen including the game field in which the player unit and the enemy unit are arranged;
A first unit selection process for causing the player to select a player unit to play a match from among the game fields when the game field is displayed on the game screen;
A first battle process in which the player unit selected by the player is moved on the game field according to the operation of the player and then played against the destination enemy unit;
A second screen generating process for generating a game screen including a unit list in which rental units that can be borrowed by the player are listed;
A second unit selection process for causing the player to select a rental unit to play a match from the unit list when the unit list is displayed on the game screen;
A second battle process in which the rental unit selected by the player is played against an enemy unit on the game field without moving the rental unit on the game field;
A game program characterized by causing it to execute. The game program according to claim 1,
The second unit selection process permits the player to select the rental unit when a predetermined condition is satisfied.
A game program characterized by The game program according to claim 2, wherein
The predetermined condition is at least one of a condition regarding the player, a condition regarding the game field, and a condition regarding the rental unit.
A game program characterized by The game program according to claim 1,
The second screen generation process displays a list of friend units owned by a friend player associated with the player as a rental unit in the unit list.
The second unit selection process restricts the selection of the friend unit by the player based on the number of selections made by the friend unit.
A game program characterized by The game program according to claim 3, wherein
On the computer
A reward giving process of giving a reward to a friend player who owns the friend unit when the friend unit is selected by the player as a rental unit in the second unit selection process;
A game program characterized by An information processing apparatus in which a player game owned by a player and an enemy unit as an opponent execute a battle game in which a battle is played while moving on the game field,
A first screen generation processing unit that generates a game screen including the game field in which the player unit and the enemy unit are arranged;
A first unit selection processing unit that causes the player to select a player unit to play a match from among the game fields when the game field is displayed on the game screen;
A first battle processing unit for causing the player unit selected by the player to move against the enemy unit disposed at the movement destination after moving the player unit selected by the player on the game field according to the operation of the player;
A second screen generation processing unit that generates a game screen including a unit list in which rental units that can be borrowed by the player are listed;
A second unit selection processing unit that causes the player to select a rental unit to play a match from the unit list when the unit list is displayed on the game screen;
A second battle processing unit for making the rental unit selected by the player compete with the enemy unit on the game field without moving the rental unit on the game field;
An information processing apparatus comprising:

Images