JP7537544B2 - Program and game device - Google Patents

Description

The present invention relates to a game device, a game system, and a program.

Conventionally, there are battle games in which the right to attack is transferred between players, and the player with the right to attack attacks the other player using cards in their deck within a time limit. In such conventional battle games, each player wins by repeatedly attacking and defending with characters summoned using cards, thereby eliminating the other player's HP (hit points) (see, for example, Patent Document 1).

Patent No. 6179110

In the above-mentioned battle games, the player with the right to attack will attack the opposing player continuously within the time limit. Furthermore, the player with the right to attack cannot make an attack that will reduce the opposing player's HP unless the defending player defeats all of the defending characters that have already been summoned. For this reason, in the above-mentioned battle games, many defending characters are often summoned before the right to attack is transferred to the opposing player. Therefore, in conventional battle games, it is difficult to reduce the opposing player's HP, and it takes a long time to determine the winner.

The present invention aims to provide a game device that can shorten the playing time of a competitive game in which a player plays against an opponent.

To solve the above problem, claim 1 of the present application is characterized in that the game device has: count management means for managing the progress of time in the game by a count value; instruction acceptance means for accepting, through a player's operation, instructions to one or more player characters who act in the game according to the player's instructions; instruction reception means for receiving instructions from an opponent to one or more opponent characters who act in the game according to the opponent's instructions; and action control means for, each time an instruction possible period represented by the count value has elapsed, making the player character act according to the instructions accepted from the player during the instruction possible period, and making the opponent character act according to the opponent's instructions.

The present invention can reduce the time it takes for a player to play a competitive game against an opponent.

1 is a configuration diagram of an example of a game system according to an embodiment of the present invention. FIG. 2 is a diagram illustrating an example of a hardware configuration of a computer according to the present embodiment. FIG. 2 is a diagram illustrating an example of a hardware configuration of a game device according to an embodiment of the present invention. FIG. 2 is a functional block diagram of an example of a game system according to the present embodiment. FIG. 13 is an image diagram of an example of a battle screen before an instruction possible period. FIG. 13 is an image diagram of an example of a battle screen during an instruction possible period. 10 is a flowchart illustrating an example of a processing procedure of a game according to the present embodiment. FIG. 13 is a diagram illustrating an example of an instruction possible period and an action time. FIG. 13 is a diagram illustrating an example of a battle between a player character and an opponent character. FIG. 13 is a diagram illustrating the consumption and return of SP. FIG. 13 is an image diagram (1/3) showing an example of a time-series battle example of a fighting game between a player and an opponent. FIG. 2 is an image diagram (2/3) showing an example of a time-series battle example of a fighting game between a player and an opponent. FIG. 13 is an image diagram (3/3) showing an example of a time-series battle example of a fighting game between a player and an opponent. FIG. 11 is an image diagram showing another example of a time series of an example battle in a competitive game between a player and an opponent. FIG. 11 is an image diagram (1/3) of another example showing a time-series example of a battle in a competitive game between a player and an opponent. FIG. 13 is an image diagram (2/3) of another example showing a time-series example of a battle in a competitive game between a player and an opponent. FIG. 13 is an image diagram (3/3) of another example showing a time-series example of a battle in a competitive game between a player and an opponent.

Next, an embodiment of the present invention will be described in detail.
[First embodiment]
<System Configuration>
Fig. 1 is a configuration diagram of an example of a game system according to this embodiment. In the game system 1 of Fig. 1(A), a server device 10 is connected to a network 22, such as a LAN, of a store 14 in various locations, for example an amusement facility, via a network 20, such as the Internet. One or more game devices 12 are installed in each store 14. The game devices 12 are connected to the network 22 of the store 14.

The server device 10 manages information about the games being played on the game devices 12, information about the players playing the games on the game devices 12, etc. The server device 10 also matches players playing the games with each other and connects multiple game devices 12. The game devices 12 are devices (game consoles) on which players play the games.

The game system 1 in FIG. 1(A) is just one example, and it goes without saying that there are various system configurations depending on the application and purpose. For example, the server device 10 may be configured to be distributed across multiple computers, or may be provided so as to be connected to the network 22 of the store 14. Furthermore, in the game system 1, the game devices 12 may be connected to other game devices 12 without going through the server device 10. Furthermore, the game device 12 that pits a player against a computer may be standalone, as shown in FIG. 1(B).

<Hardware Configuration>
The server device 10 in Fig. 1 is realized, for example, by a computer having a hardware configuration shown in Fig. 2. Fig. 2 is a diagram showing an example of the hardware configuration of a computer according to the present embodiment.

The computer in FIG. 2 includes an input device 501, an output device 502, an external I/F 503, a RAM 504, a ROM 505, a CPU 506, a communication I/F 507, and a HDD 508, all of which are interconnected via a bus B. Note that the input device 501 and the output device 502 may be connected and used when necessary.

The input device 501 is a touch panel, operation keys or buttons, keyboard, mouse, etc. used for input. The output device 502 is composed of a display such as an LCD or an OLED display for displaying a screen, and a speaker for outputting sound data such as voice and music. The communication I/F 507 is an interface that connects the computer to the network 20. The HDD 508 is an example of a non-volatile storage device that stores programs and data. The computer may also use a drive device that uses flash memory as a storage medium (e.g., a solid state drive: SSD).

The external I/F 503 is an interface with an external device. The external device may be a recording medium 503a. This allows the computer 500 to read and/or write data to the recording medium 503a via the external I/F 503. The recording medium 503a may be a flexible disk, a CD, a DVD, an SD memory card, a USB memory, etc.

ROM 505 is an example of a non-volatile semiconductor memory (storage device) that can retain programs and data even when the power is turned off. RAM 504 is an example of a volatile semiconductor memory (storage device) that temporarily retains programs and data. CPU 506 is a calculation device that realizes the control and functions of the entire computer by reading programs and data from storage devices such as ROM 505 and HDD 508 onto RAM 504 and executing processing. The server device 10 according to this embodiment can realize various processes by executing programs on a computer having the above-mentioned hardware configuration.

The game device 12 in FIG. 1 is realized, for example, by a hardware configuration as shown in FIG. 3. FIG. 3 is a diagram showing the hardware configuration of an example of a game device according to this embodiment.

The game device 12 includes a computer 650 that controls the entire device. The game device 12 also includes an operation unit 600, an image display unit 610, a sound unit 620, and an IO board 640 that are connected to the computer 650. The game device 12 also includes an IC card unit 660, a coin insertion unit 670, and a communication unit 680 that are connected to the computer 650.

The operation unit 600 allows the player to operate the game. The image display unit 610 displays the game screen. The sound unit 620 includes, for example, an amplifier and a speaker, and outputs game sounds. Various types of lighting 630, such as cold cathode fluorescent tubes 631, fluorescent lights 632, and lamps 633, are connected to the IO board 640. For example, the lighting 630 is controlled to perform predetermined lighting and blinking operations as a presentation according to the game scene.

The game device 12 also has an IC card unit 660 and a coin insertion unit 670. The IC card unit 660 includes an IC card reader/writer 661 that reads and writes information from an IC card, which is an information storage medium. When a player holds an IC card over the IC card unit 660 to read IC card information such as an IC card ID, the game device 12 obtains player information linked to the IC card information from the server device 10. In this way, the game device 12 can identify the player playing the game.

The coin insertion unit 670 is a mechanism through which the player inserts credits. The communication unit 680 is an interface that connects the game device 12 to the network 22. This allows the game device 12 to perform data communication via the communication unit 680.

Note that the hardware configuration of the game device 12 in FIG. 3 is just an example, and may be realized by a computer with the hardware configuration shown in FIG. 2, or may be a smartphone, a tablet terminal, or a dedicated home gaming device.

<Software configuration>
<Function Block>
The software configuration of the game system 1 according to this embodiment will be described. Fig. 4 is a functional block diagram of an example of the game system according to this embodiment. Note that the software configuration of the server device 10 is omitted in Fig. 4, but it realizes, for example, a player management unit, a player information storage unit, a matching control unit, and the like.

In addition, by executing the client program, the game device 12 realizes a game control unit 40, a game execution unit 42, a count management unit 44, a timing unit 46, an instruction reception unit 48, a character use point management unit 50, an instruction transmission/reception unit 52, a behavior control unit 54, a hit point management unit 56, and a display control unit 58.

The game control unit 40 of the game device 12 is notified of IC card information read by the IC card unit 660 from the IC card owned by the player, and credit information, which is information on the credits inserted into the coin insertion unit 670.

When the game control unit 40 is notified of the IC card information, it obtains player information linked to the notified IC card information from the server device 10 and identifies the player who will play the game. The game execution unit 42 controls the display of the game screen, the output of game sound, and the lighting/blinking operation of the lighting 630 to allow the player to execute the game.

The count management unit 44 manages the count value of an indicator that shows the progress of time in the game. The timing unit 46 times the timing (update time) for updating the count value. The instruction acceptance unit 48 accepts various instructions from the player. For example, the instruction acceptance unit 48 accepts instructions to a character (player character) used by the player in the game through player operation. The character use point management unit 50 manages points (hereinafter referred to as soul points: SP) consumed to give instructions to the player character.

The instruction transmission/reception unit 52 transmits and receives instruction information to and from the opponent's game device 12. For example, the instruction transmission/reception unit 52 receives instructions to a character (opponent character) used by the opponent in the game as instruction information from the opponent's game device 12. In addition, the instruction transmission/reception unit 52 transmits instructions to the player character as instruction information to the opponent's game device.

When the instruction period described below has elapsed and the action time described below has arrived, the action control unit 54 causes the player character to act according to the instructions received from the player up until that instruction period, and causes the opponent character to act according to the opponent's instruction information. When the player character and opponent character finish their actions, the count management unit 44 updates the count value to the next one. Note that the count value may be updated using either a count-up method or a count-down method.

The hit point management unit 56 manages the points (hereafter referred to as hit points: HP) of the player and opponent to determine the outcome of the game. The display control unit 58 controls the screen display of the game device 12 as the game progresses.

<Processing>
Game Overview
Next, in order to facilitate understanding of this embodiment, an overview of the game according to this embodiment will be described with reference to an example battle screen of the game according to this embodiment. Fig. 5 is an image diagram of an example battle screen before an instruction possible period. An area 100 enclosed by a dotted line on the lower side of the screen in Fig. 5 is a standby UI area for the player character. An area 110 enclosed by a dotted line on the upper side of the screen in Fig. 5 is a standby UI area for the opponent character.

The battle screen in FIG. 5 shows an example in which there are four player characters and four opponent characters. The waiting UI area for the player characters in FIG. 5 includes a character model display field 101 for each player character, a hand display field 102, a draw button 103, and an equipped card display field 104. Each player character is associated with a card deck consisting of a stack of multiple cards.

The character model display field 101 displays the player character selected by the player. The hand display field 102 displays the hand cards that the player can select and use. The draw button 103 is a button that can be pressed when the player is in a state where they can draw a card from the card deck. By pressing the draw button 103, the card drawn from the card deck is additionally displayed in the hand display field 102 as a hand card. The equipped card display field 104 displays the card that the player selected and used from the hand display field 102 as an equipped card. As will be described in detail later, a player character whose equipped card is displayed in the equipped card display field 104 can receive instructions from the player for an action corresponding to the equipped card without consuming SP again.

By selecting and using cards displayed in the hand display area 102, the player can instruct the player character to act in accordance with the cards in his/her hand (such as sortieing, casting a spell, or using an item). The waiting UI area of the player character that has received an action instruction from the player displays the current status (sortieing, casting a spell, etc.) and the countdown until the current status ends.

The card in Figure 5, which is drawn from the card deck, has the SP consumed to use the card, as well as speed, attack power, and defense power, all of which are represented numerically. The number displayed at the top of the card is SP, the number displayed at the bottom left is attack power, the number displayed at the bottom right is defense power, and the number displayed above the defense power is speed.

In addition, on the battle screen in FIG. 5, the opponent character's standby UI area is also displayed as in area 110. Therefore, the player can check information such as the opponent character selected by the opponent, the number of cards in the opponent's hand, whether or not the opponent has equipped cards, etc.

Figure 6 is an image diagram of an example of a battle screen during an instruction possible period. The HP display field 121 at the top of the screen in Figure 6 displays the player's HP. The HP display field 122 displays the opponent's HP. In the game according to this embodiment, as described below, the opponent's HP can be reduced by attacking the opponent, and the player's HP is reduced by being attacked by the opponent. The player wins the game by reducing the opponent's HP to "0" before the player's HP reaches "0", and loses the game if the player's HP reaches "0" before the opponent's HP reaches "0". The HP bar display field 123 displays the player's HP in bar format. The HP bar display field 124 displays the opponent's HP in bar format.

The count display field 125 displays the count value of the indicator that indicates the progress of time in the game, and also displays the timing (update time) when the count value is updated. In addition, in the count display field 125 of FIG. 6, the count value update time is visually represented by a timer that goes around once every 4 seconds. Note that the count value update time is returned to the initial time (0 seconds) when an instruction is given to the player character or the opponent character, as described later. When the count value update time reaches 4 seconds, in the game of this embodiment, the instruction possible period for that count value ends, and the action of the player character and the opponent character is displayed on the battle screen, and then the game moves to the next count value. For example, the game starts with a count value of 40, and ends when the count value moves to 0. In addition, in the count display field 125 of FIG. 6, an icon indicating the current time period (morning, afternoon, evening, night, etc.) and the remaining count value until the time period changes are displayed in the center.

The opponent model display field 126 displays the opponent model. Lanes 127 are generated by the entry of a player character or opponent character who has received instructions for an action according to the cards in their hand. For example, up to five lanes 127 are generated on the battle screen in FIG. 6. The battle screen in FIG. 6 shows an example of a lane 127 made up of five squares.

A player character or an opponent character that has entered lane 127 advances, for example, one square on lane 127 at a time with one count value. Note that in the game according to this embodiment, the initial placement square on lane 127 can be changed based on the speed of the player character or opponent character, thereby varying the time from entry to attacking or casting a spell. A player character that enters lane 127 before an opponent character becomes the attacking side. A player character that enters lane 127 after an opponent character becomes the defending side.

The SP display field 128 displays the current remaining amount of SP owned by the player in numbers, as well as the maximum amount of SP and the current remaining amount (maximum amount of SP - amount currently in use) in an SP gauge. The card stock display field 129 displays the number of cards that the player can draw from the card deck by pressing the draw button 103 shown in FIG. 5. The card stock display field 129 may show the number of cards remaining until the card stock is restored, for example, by displaying an icon. The player model display field 130 displays the model of the player. The special move gauge display field 131 displays the count value until a special move can be used.

Battle Processing
7 is a flow chart showing an example of the processing procedure of the game according to this embodiment. Proceeding to step S10, the count management unit 44 of the game device 12 sets an initial value of the count value to, for example, "40". The timer unit 46 starts timing the update time (for example, 4 seconds) which is the timing for updating the count value. The game device 12 repeats the processing of steps S11 to S15 until it is determined in step S11 that the instruction possible period has elapsed.

When an operation by the player or opponent is accepted in step S12, the game device 12 proceeds to step S13 and performs processing according to the accepted operation. In addition, in step S14, it is determined whether the operation accepted in step S12 is an operation (instruction) for the player character or the opponent character.

If the operation received in step S12 is not an operation for the player character or the opponent character, the game device 12 returns to step S11 and continues processing. If the operation received in step S12 is an operation for the player character or the opponent character, the timing unit 46 proceeds to step S15 and resets the update time of the instruction possible period to the initial time (0 seconds).

When the instruction period has elapsed (the clocking of the update time has ended) without the game device 12 receiving any operation for the player character or the opponent character through the processing of steps S11 to S15, the game device 12 proceeds to the processing of step S16. When the instruction period has elapsed and the action time has begun in step S16, the action control unit 54 causes the player character to act according to the instructions received from the player up until that instruction period, and causes the opponent character to act according to the instructions of the opponent.

The process proceeds to step S17, where the count management unit 44 determines whether the counter value is "1". If the counter value is not "1", the process proceeds to step S18, where the count management unit 44 subtracts "1" from the current counter value and causes the timing unit 46 to return the update time of the instruction possible period to the initial value (0 seconds), and then the process returns to step S11 and continues. If the counter value is "1", the count management unit 44 ends the game because the count value has transitioned from 40 to 0.

In the game according to this embodiment, the instruction period and action time are repeated, for example, as shown in FIG. 8. FIG. 8 is a diagram of an example that explains the instruction period and action time. The first count (40 count value) shown in FIG. 8 shows an example in which an operation for the player character or the opponent character is accepted once before the instruction period has elapsed, and then the instruction period has elapsed without accepting any operation for the player character or the opponent character.

When the instruction period of the first count has elapsed, the action time begins, and the player character or opponent character acts according to the instructions received from the player or opponent during the instruction period of the first count.

The second count (count value 39) shown in Figure 8 after the action time after the first count has ended shows an example in which three operations for the player character or opponent character are accepted before the instruction possible period has elapsed, and then the instruction possible period has elapsed without accepting any operations for the player character or opponent character. As the instruction possible period of the second count has elapsed, the action time begins, and the player character or opponent character is made to act according to the instructions accepted from the player or opponent during the instruction possible periods of the first and second counts. This repetition of the instruction possible period and action time is repeated, for example, from a count value of 40 to a count value of 1.

Figure 9 is a diagram illustrating an example of a battle between a player character and an opponent character. Figure 9 illustrates an example in which the player character enters lane 127 as the attacking side.

Figure 9 (A) shows a battle between a player character (attack power 3, defense power 3) and an opponent character (attack power 3, defense power 3). When the player character attacks the opponent character, the player character's attack with an attack power of "3" reduces the opponent character's defense power of "3" to "0", and the opponent character is defeated. When the opponent character counterattacks the player character, the opponent character's attack with an attack power of "3" reduces the player character's defense power of "3" to "0", and the player character is defeated. Thus, in Figure 9 (A), both characters are defeated, so the opponent's HP cannot be reduced.

Figure 9 (B) shows a battle between a player character (attack power 1, defense power 3) and an opponent character (attack power 3, defense power 3), and because the player character is defeated, the opponent's HP cannot be reduced.

Figure 9 (C) shows a battle between the player character (attack power 3, defense power 3) and the opponent character (attack power 1, defense power 1). Because the opponent character is defeated, the player character is able to attack the opponent's HP, decreasing the opponent's HP by a value equivalent to the player character's attack power of "3".

In the game according to this embodiment, when an attacking player character or opponent character defeats a defending player character or opponent character, the HP of the defending player or opponent can be reduced. Note that in the game according to this embodiment, since a battle cannot be performed in a different lane 127, even if a defending player character or opponent character remains in another lane 127, damage to the HP of the defending player or opponent cannot be avoided. In this way, in the game according to this embodiment, if a defending player character or opponent character entered in the same lane 127 is defeated, damage can be inflicted on the HP of the defending player or opponent regardless of the entry status in the other lane 127, so that the play time can be shortened.

Figure 10 is a diagram explaining the consumption and return of SP. In Figure 10 (A), the player did not give any instructions to the player character at the first count, so the current remaining amount of SP owned by the player (owned SP) remains at "6". The owned SP is consumed as a cost for using cards. If the player has owned SP remaining, they can use multiple cards during the same count.

In Figure 10(B), on the second count, the player uses a card with SP "4", so the possessed SP decreases from "6" to "2". In Figure 10(C), on the third count, the player uses a card with SP "2", so the possessed SP decreases from "2" to "0". In Figure 10(D), on the fourth count, a card with SP "2" is destroyed, so the SP "2" consumed as the cost to use that card is refunded, and the possessed SP increases from "0" to "2". In this way, the SP consumed as the cost to use a card is refunded to the possessed SP after the card is destroyed, or after the magic or item usage with that card is finished.

In this way, the SP consumed as the cost of using a card is not returned to the possessed SP unless the card is destroyed, so it is possible to adopt a strategy such as leaving a high-cost opponent character instead of destroying it, thereby tying up SP and gaining an advantage in the game. Note that the maximum SP value may be increased, for example, each time a certain count value is reached.

<<Example of a battle>>
An example of a battle between a player and an opponent in a competitive game will be described below with reference to the drawings. Figures 11A to 11C are image diagrams showing an example of a battle between a player and an opponent in a time series.

In Figure 11A(a), the player character (attack strength 3, defense strength 1) is entered as an attacker in the middle lane and dispatches himself. Upon receiving the dispatch of the player character in Figure 11A(a), the opponent takes measures to defend against the player character's attack as shown in Figure 11A(b). In Figure 11A(b), the opponent enters an opponent character (attack strength 6, defense strength 6) as a defender in the middle lane, dispatches him, and waits for the player character to arrive.

If the player does not respond in the situation shown in FIG. 11A (b), the player's character will reduce the opponent's defense power by "3" in the battle in the middle lane, but will still be defeated by the opponent's character. Therefore, the player may respond in the manner described below.

Figure 11B (c) shows a situation in which the player's SP is "6" and one of the player characters has an attack power enhancement item with an SP of "3" in their hand that increases the attack power of the other player characters by "+3". The player then performs an operation to use the attack power enhancement item that is held in the hand of one of the player characters and that increases the attack power of the other player characters by "+3". Figure 11B (d) is an example of the presentation screen when an attack power enhancement item is used.

In FIG. 11C(e), an attack power enhancing item has been used on the player character deployed in the middle lane, increasing the attack power of the player character deployed in the middle lane from "3" to "6." If the situation in FIG. 11C(e) remained, the battle in the middle lane would end in a draw.

Furthermore, Figure 11C (f) is an example of a presentation screen when the equipped card of a player character deployed in the center lane has the ability "First Attack." In the state of Figure 11C (f), the "First Attack" ability allows the player character to deal damage of an attack strength of "6" to the opponent character first, and defeat the opponent character with a defense strength of "6." As a result, the player character deployed in the center lane can execute an attack that reduces the opponent's HP by "6."

Figure 12 is an image diagram of another example of a battle between a player and an opponent, shown in chronological order. Figure 12(a) shows a state in which an opponent character (attack strength 1, defense strength 1) who has been entered as an attacker in the first lane from the right and is currently deployed is about to execute an attack that will reduce the player's HP by "1" with one count remaining. The player then responds in a way that will be described below, for example.

In Figure 12(b), the player has 7 SP and spends 5 SP to enter the player character (attack power 5, defense power 1) as the defender in the first lane from the right, dispatching him and waiting for the opponent to arrive. However, in this state, the battle in the first lane from the right may end in a draw, or the opponent character may be defeated depending on his abilities.

The player can then use an attack power enhancement item with an SP of "2" held by one of the player characters in their hand, which increases the defensive power of other player characters by "+2", thereby enhancing the defensive power of the player character deployed in the first lane from the right from "1" to "3", and repelling the attacking opponent character.

Figures 13A to 13C are image diagrams showing another example of a battle between a player and an opponent in chronological order in a fighting game. Note that the examples in Figures 13A to 13C show an example in which the opponent's remaining HP is "8". In Figure 13A(a), the player enters the player character (attack power 5, defense power 1) as the attacking side in the center lane and sends him out.

In response to the player character's attack, the opponent responds by entering an opponent character (attack strength 8, defense strength 5) as a defender in the middle lane to defend against the player character's attack, and sends him out, waiting for the player character to arrive. If the player does not respond in the state shown in Figure 13A (a), the battle in the middle lane will end in a draw, and no damage will be done to the opponent's HP. At this time, the player's possessed SP is "7", so he can use the hand of another player character. Therefore, the player may respond, for example, as described below.

In Figure 13A(b), one of the player characters uses a card from his hand that is a defense-lowering item with an SP of "4" that reduces the defense of the opponent character by "-4", causing the defense of the opponent character deployed in the middle lane to drop from "5" to "1". In Figure 13(b), the player character deployed in the middle lane is equipped with a card with the ability "Penetrate". In the state of Figure 13A(b), the "Penetrate" ability allows the player character to use "1" of his attack power of "5" to defeat the opponent character with a defense of "1", and then use the remaining attack power of "4" to perform an attack that reduces the opponent's HP by "4".

However, since reducing the opponent's HP by "4" will not settle the battle, the player can use an attack power enhancement item with SP "3" held by one of the player characters to increase the attack power of the other player character by "+3", as shown in Figure 13B(c), thereby enhancing the attack power of the player character deployed in the middle lane from "5" to "8". In the state shown in Figure 13B(c), the "pierce" ability can be used to execute an attack that reduces the opponent's HP by "7".

Furthermore, the player may use a special move that increases the attack power of the player character by "+2", for example, to increase the attack power of the player character deployed in the middle lane from "8" to "10". Figure 13B (d) is an example of the presentation screen when a special move is used.

In FIG. 13C(e), a battle occurs between an attacking player character (attack strength 10, defense strength 1) deployed in the center lane and an opponent character (attack strength 8, defense strength 1) on the defense side. As shown in FIG. 13C(f), the player character and the opponent character each inflict damage to the opponent's defense strength equal to their attack strength, resulting in a draw.

However, thanks to the "Penetrate" ability of the player character deployed in the middle lane, the attacking player character can deal "9" damage to the opponent's HP, exceeding the opponent's defensive power of "1", reducing the opponent's HP to 0 and winning the game.

(summary)
As described above, according to this embodiment, if the result of the battle held in each lane is a victory for the attacking side, regardless of the state of the other lanes, the attacking side can reduce the HP of the defending side, and playing time can be shortened compared to conventional games in which attacks that reduce the HP of the defending side cannot be made unless all of the defending characters are defeated.

The present invention is not limited to the specifically disclosed embodiments above, and various modifications and variations are possible without departing from the scope of the claims.

REFERENCE SIGNS LIST 1 Game system 10 Server device 12 Game device 14 Store 20, 22 Network 40 Game control unit 42 Game execution unit 44 Count management unit 46 Timekeeping unit 48 Instruction reception unit 50 Character use point management unit 52 Instruction transmission/reception unit 54 Action control unit 56 Hit point management unit 58 Display control unit

Claims (4)

Computer,
a unit battle consisting of a first stage of receiving an operation input related to an action of a player character and a second stage of causing the player character to act is repeated as one round, thereby functioning as a game progression means for progressing a battle game in which the player character battles against an opponent character;
The game progression means includes:
In a first stage of a unit battle in an nth round (n is an integer of 1 or more), if the operation input of the player is accepted within a reception period, the reception period has elapsed without accepting any operation input after the operation input of the player is accepted, and thus a transition is made to a second stage of the unit battle in the nth round; in the second stage of the unit battle in the nth round, the player character is made to act based on the operation input within an action period after the acceptance period has elapsed;
if no operation input from the player is accepted within a reception period in a first stage of the n+1th round of unit battles, the reception period has elapsed without accepting any operation input, and the process proceeds to a second stage of the n+1th round of unit battles; and in the second stage of the n+1th round of unit battles, the player character is made to act based on the operation input in the first stage of the nth round of unit battles within an action period after the reception period has elapsed.
A program characterized by: Computer,
a unit battle including a first stage of receiving an operational input from a player and a second stage of causing a player character to act based on the operational input from the player, the unit battle being repeated as one round, thereby functioning as a game progression means for progressing a battle game in which the player character battles against an opponent character;
The game progression means includes:
In a first stage of a unit battle in an nth round (n is an integer of 1 or more), when an operational input relating to an attack of a player character is received from a player within a reception period, a transition is made to a second stage of the unit battle in the nth round due to the lapse of the reception period without receiving any operational input after the reception of the operational input from the player, and in the second stage of the unit battle in the nth round, the player character is caused to take an action relating to an attack based on the operational input within an action period after the lapse of the reception period,
if no operation input from the player is accepted within a reception period in a first stage of the n+1th round of unit battles, the reception period has elapsed without accepting any operation input, and the battle proceeds to a second stage of the n+1th round of unit battles; and in the second stage of the n+1th round of unit battles, the player character is caused to take an attacking action based on the operation input in the first stage of the nth round of unit battles within an action period after the reception period has elapsed.
A program characterized by: a game progression means for progressing a battle game in which the player character battles against an opponent character by repeating a unit battle consisting of a first stage of receiving an operation input related to an action of a player character and a second stage of causing the player character to act,
The game progression means includes:
In a first stage of a unit battle in an nth round (n is an integer of 1 or more), if the operation input of the player is accepted within a reception period, the reception period has elapsed without accepting any operation input after the operation input of the player is accepted, and thus a transition is made to a second stage of the unit battle in the nth round; in the second stage of the unit battle in the nth round, the player character is made to act based on the operation input within an action period after the acceptance period has elapsed;
if no operation input from the player is accepted within a reception period in a first stage of the n+1th round of unit battles, the reception period has elapsed without accepting any operation input, and the process proceeds to a second stage of the n+1th round of unit battles; and in the second stage of the n+1th round of unit battles, the player character is made to act based on the operation input in the first stage of the nth round of unit battles within an action period after the reception period has elapsed.
A game device comprising: a game progression means for progressing a battle game in which a player character battles against an opponent character by repeating a unit battle, the unit battle being constituted by a first stage of accepting an operational input by a player and a second stage of causing the player character to act based on the operational input by the player,
The game progression means includes:
In a first stage of a unit battle in an nth round (n is an integer of 1 or more), when an operational input relating to an attack of a player character is received from a player within a reception period, a transition is made to a second stage of the unit battle in the nth round due to the lapse of the reception period without receiving any operational input after the reception of the operational input from the player, and in the second stage of the unit battle in the nth round, the player character is caused to take an action relating to an attack based on the operational input within an action period after the lapse of the reception period,
if no operation input from the player is accepted within a reception period in a first stage of the n+1th round of unit battles, the reception period has elapsed without accepting any operation input, and the battle proceeds to a second stage of the n+1th round of unit battles; and in the second stage of the n+1th round of unit battles, the player character is caused to take an attacking action based on the operation input in the first stage of the nth round of unit battles within an action period after the reception period has elapsed.
A game device comprising:

Images