JP2021074497A - Game program, game processing method and game apparatus - Google Patents

Abstract

To provide a game program with high taste in a plurality of rounds of match using decks.SOLUTION: A game program causes a computer that executes processing of a game using decks including a plurality of game elements, the game for playing a match between a first deck group and a second deck group, to execute: a first determination step of determining a result of a match between a first deck out of decks included in the first deck group and a second deck out of decks included in the second deck group; an addition step of adding a prescribed game element to a deck other than the first deck, of the first deck group based on the match result in the first determination step; and a second determination step of determining a result of a match between the deck to which the prescribed game element has been added, and any deck out of the decks included in the second deck group.SELECTED DRAWING: Figure 1

Description

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

There is a game in which a deck containing a plurality of cards is used to play against an opponent (for example, Patent Document 1).

Japanese Unexamined Patent Publication No. 2014-083265

However, when playing multiple battles, there is a concern that it will be uninteresting if the relevance of each battle is low.

One of an object of the present invention is to provide a game program, a game processing method, and a game device that are highly interesting in a plurality of battles using a deck.

Another object of the present invention is to provide a game program, a game processing method, and a game device capable of exerting the effects described in the embodiments described later.

In order to solve the above-mentioned problems, one aspect of the present invention is a game using a deck including a plurality of game elements, and processing of the game in which the first deck group and the second deck group compete against each other. The first deck that determines the result of the battle between the first deck among the decks included in the first deck group and the second deck among the decks included in the second deck group is determined by the computer that executes the above. Based on the determination step and the result of the battle in the first determination step, an additional step of adding a predetermined game element to a deck other than the first deck in the first deck group, and the predetermined game element are added. This is a game program for executing a second determination step of determining the result of a match between the added deck and any of the decks included in the second deck group.

Further, one aspect of the present invention is a game using a deck including a plurality of game elements, and is executed by a computer that executes processing of the game in which the first deck group and the second deck group compete against each other. The result of the battle between the first deck of the decks included in the first deck group and the second deck of the decks included in the second deck group is determined. Based on the first determination step and the result of the battle in the first determination step, an additional step of adding a predetermined game element to a deck other than the first deck in the first deck group, and the predetermined game. It is a game processing method including a second determination step of determining the result of a match between a deck to which an element is added and one of the decks included in the second deck group.

Further, one aspect of the present invention is a game using a deck including a plurality of game elements, and is a game device that executes processing of the game in which the first deck group and the second deck group compete against each other. The first deciding unit that determines the result of the battle between the first deck of the decks included in the first deck group and the second deck of the decks included in the second deck group. Based on the result of the battle by the first determination unit, an additional unit that adds a predetermined game element to a deck other than the first deck in the first deck group, and a deck to which the predetermined game element is added. , A game device including a second determination unit that determines the result of a battle with any of the decks included in the second deck group.

Explanatory drawing explaining the outline of the game which concerns on 1st Embodiment. The figure which shows an example of the game screen of the card game which concerns on 1st Embodiment. The figure which shows the example of the flow of one turn in the battle process which concerns on 1st Embodiment. The block diagram which shows an example of the structure of the game system which concerns on 1st Embodiment. The figure which shows an example of the hardware configuration of the user terminal which concerns on 1st Embodiment. The figure which shows an example of the hardware configuration of the game server which concerns on 1st Embodiment. The block diagram which shows an example of the functional structure of the user terminal and the game server which concerns on 1st Embodiment. The figure which shows the data example of the card data which concerns on 1st Embodiment. The figure which shows the data example of the deck data which concerns on 1st Embodiment. The figure which shows the data example of the battle situation management data which concerns on 1st Embodiment. The flowchart which shows an example of the battle process which concerns on 1st Embodiment. The flowchart which shows an example of the card addition processing which concerns on 1st Embodiment. The flowchart which shows an example of the card addition processing which concerns on 2nd Embodiment. The flowchart which shows an example of the control process concerning the progress of the battle game which concerns on 3rd Embodiment.

Hereinafter, an embodiment of the present invention will be described with reference to the drawings.
[First Embodiment]
First, the first embodiment of the present invention will be described.

[Game overview]
First, an outline of an example of processing a game executed by the game device according to the present embodiment will be described. The game according to the present embodiment is a card game played by using a plurality of cards prepared in the game. A card is an example of a game element that is a unit that a user can select or operate in the game, and is visibly displayed as an element of the game screen. For example, a card is a character card that represents a character such as a person, a monster, an animal, or an object (for example, a vehicle) that appears in a game. The game element is not limited to the card, but may be a medal, a figure representing the character itself, or the like.

In this card game, a set of preset cards or a bundle of cards that is a collection of some or all of the cards owned by the user is prepared as a deck, and multiple cards included in this deck are used. And play against the opponent. For example, the user can select a card from the cards he or she has and set it in the deck. It is possible to set multiple decks, and it is also possible to play against each other using a deck selected from the set decks. The match is a 3v3 team match. In each match, each of the competing users uses the deck, and the play progresses in a turn-based system in which the cards included in the deck are selected and the commands for demonstrating the abilities of the cards are alternately selected. In the following, the user who plays the game is also referred to as a player.

FIG. 1 is an explanatory diagram illustrating an outline of a game according to the present embodiment. The example shown in this figure is an example of a 3 to 3 team battle between team α composed of player A, player B, and player C and team β composed of player D, player E, and player F. Shown. The first round is a battle between player A and player D, who are the forerunners. The second round is a match between player B and player E, who are mid-level players. The third round is a match between player C and player F, who are the generals. In this battle game, a predetermined card can be added to the deck on the side of one team based on the battle result.

For example, in the first round, player A of team α uses deck α1 and player D of team β plays against each other using deck β1. If player A is defeated and player D wins in this match, the defeated player A has one card included in the deck α1 used in the match, and is an ally (team α) of the next match (second round). ) Can be passed to player B. For example, player A selects an arbitrary card (for example, a powerful card that works in favor of the battle) from the cards included in the deck α1 used in the battle in the first round, and selects the selected card in the second round. It can be added to the deck α2 used by player B.

In the second round, player B of team α plays against player E of team β with the card added from player A added to deck α2. Player E of team β takes over the deck β1 used in the first round and uses it as it is. In this way, the losing team can hand over one card to the next match, and can start playing the next match in an advantageous state. Also, in the second round, the player who lost in the first round will be the first player (starting from the turn of the player who lost). In addition, normally, there are restrictions such as not being able to attack in the first turn (first turn) of the first attack, but the restrictions are lifted in the first turn after the second round. In this way, in the next match, the defeated side will be the first player, and restrictions such as not being able to attack on the first turn of the first attack will be lifted, and the defeated team will advance the next match in an advantageous manner. The possibility of being overwhelmed increases.

In the second round, if the team β side is defeated this time, the selected card is selected by selecting one card to be handed to the player F from the cards included in the deck β1 used by the defeated player E in the battle. Can be added to the deck β2 used by player F in the third round. In the third round, the player F of the team β plays against the player C of the team α with the card added from the player E added to the deck β2. The deck used by player C of team α is the same as the deck α2 used in the second round. As a result, in the third round, there is a high possibility that the defeated team β will be able to advance the next match in an advantageous manner.

If the team α side is defeated even in the second round, the defeated player B may select one card from the deck α2 used in the second round and add it to the deck used by the player C in the third round. It is possible to increase the possibility that Team α will be able to advance the match in an advantageous manner even in the third round following the second round. By doing this, one-sided development such as one team continuing to win is less likely to occur.

In addition, normally, there is a limit on the number of powerful cards that can be set in the deck at the same time, but when a powerful card is added to the defeated deck, the limit is lifted. Therefore, it is possible to play with a powerful deck that cannot normally be realized due to the limitation.

Note that player A, player B, player C, player D, player E, and player F may be players played by different users, or a plurality of players may be played by the same user for each team. May be good. In addition, some players may be controlled by a computer instead of being played by the user.

Next, the battle method of the battle game will be described. As described above, this card game is a turn-based battle game in which the players of team α and the players of team β alternate the turns of each player, and each player selects a card or commands in his / her own turn. Make a selection. FIG. 2 is a diagram showing an example of a game screen of a card game according to the present embodiment. The illustrated game screen G10 is an example of a game screen when performing a battle play, and here, it is assumed that the game screen is played by a player of team α. The lower half area G11 of the game screen G10 is an area in which cards included in the deck used by the player on the team α side are displayed. On the other hand, the upper half area G12 is an area in which cards included in the deck used by the player on the team β side are displayed.

Area G11 includes an area PAT in which the player's hand on the team α side is placed (hereinafter referred to as "hand area PAT") and an area PAB in the "field" of the player on the team α side (hereinafter referred to as "field PAB"). ). Similarly, in the area G12, the area PBT in which the player's hand on the team β side is arranged (hereinafter, “hand area PBT” and the area PBB in the “field” of the player on the team β side (hereinafter, “field PBB””). The hand area PAT and field PAB on the team α side and the hand area PBT and field PBB on the team β side are displayed in a symmetrical relationship facing each other. Each of the areas G11 and G12 is displayed. Since the configuration includes a similar hand area and a field area, the area G11 will be mainly described below.

First, a plurality of cards included in the deck used by the players of team α are turned face down in a random order and placed in the field PAB as a deck. Specifically, the deck is arranged in the area PA1 (hereinafter referred to as "deck area PA1") in the field PAB. Next, in his / her turn, a predetermined number (for example, 4) of cards drawn from the deck becomes a hand and is placed in the hand area PAT. Here, the cards placed in the hand area PAT are arranged face up so that the surface on which the card type and parameters are described can be visually recognized. On the other hand, the cards arranged in the hand area PBT of the opponent (team β) are arranged face down so that the player cannot see the surface of the cards. Also, in the second and subsequent turns, you can draw one card from the deck each time you turn, and use it as your hand.

The player selects one of the cards (hands) placed in his / her hand area PAT and puts it in the field PAB to activate the effect of that card or put it in his / her field PAB in advance. The battle game progresses by comparing the power of the placed card and the card of the opponent's field PBB. Each of the competing players first has a predetermined life point (LP: for example, 8000), reduces each other's LP according to a predetermined rule based on the card selection content and the command execution content, and first the opponent's opponent. The one who sets LP to 0 wins.

Here, putting out a card from your hand area PAT to your field PAB is also called "summoning". Types of cards include monster cards, magic cards, trap cards, and the like. In the following, when the magic card and the trap card are not particularly distinguished, they are also referred to as "magic / trap cards".

Depending on the type of card, the place where you can place it in your place PAB by "summoning" is determined. Area PA2 is a place where monster cards can be placed (hereinafter referred to as "monster area PA2"). In this monster area PA2, there are three areas PA2 (1), PA2 (2), and PA2 (3) in which monster cards can be arranged one by one, and a maximum of three monster cards can be arranged at the same time. In the illustrated example, the monster card is arranged only in the area PA2 (2) of the areas PA2 (1), PA2 (2), and PA2 (3). Further, the area PA3 is a place where a magic card and a trap card can be placed (hereinafter, referred to as "magic / trap area PA3"). This magic / trap area PA3 has three areas PA3 (1), PA3 (2), and PA3 (3) in which one magic card or one trap card can be placed, and the total of the magic card and the trap card Up to 3 cards can be placed at the same time. In the illustrated example, of the magic / trap areas PA3 (1), PA3 (2), and PA3 (3), the magic card or the trap card is arranged only in the magic / trap area PA3 (3). The area PA4 is a place where monster cards destroyed by "attack", used magic cards, and trap cards are placed (hereinafter referred to as "graveyard area PA4"). Further, the area PA5 is a place where cards that can be "special summoned" to be summoned by a special method are placed (hereinafter, referred to as "extra area PA5").

Next, each card will be described. The monster card has parameters such as the attack power to be referred to when executing the process based on the "attack" command described later, and the defensive power to be referred to when the opponent executes the process based on the "attack" command. .. Further, the monster card includes a monster card having an effect of advancing the battle advantageously by executing a process based on the "monster effect" command described later, and a monster card having no such effect.

For magic / trap cards, by executing processing based on the "magic / trap" command described later, you can execute specific processing, limit the processing that your opponent is trying to execute, or change the parameters of the card. It produces "effects" such as traps. For these, various effects and execution conditions are defined depending on the type of card and the type of effect. Examples of "effects" include increasing the attack power of monster cards, adding the top card of the deck to your hand, and restricting the execution of commands from your opponent. Examples of execution conditions include the difference in LP between you and your opponent and the number of monster cards in the field.

Next, the command will be described. The types of commands include "summon", "change offense and defense", "magic / trap", "monster effect", "special summon", and "attack".
The "summon" command is a command related to the process of placing a specific card in the field. By executing the process based on the "summon" command, the selected monster card or the monster card to be selected is placed in the field PAB. When arranging, there are cases where the orientation of the arrangement such as portrait, landscape, face up, and face down can be selected. For example, monster cards placed face up and vertically can attack. Monster cards placed face up and sideways cannot attack, but their LP does not decrease even if they are attacked by their opponent. Cards placed face down are unknown to the opponent. For example, placing a monster card face up in the field is also called "face-up summoning", and placing it face down is also called "face-down summoning".

The "offense and defense change" command is a command for changing the orientation of the monster cards in the field (portrait, landscape, face up, face down, etc.). By executing the process based on the "change offense and defense" command, the orientation when the selected monster card or the monster card to be selected is placed in the field PAB is changed.
The "magic / trap" command is a command that activates the effect associated with the magic / trap card. "Invoking an effect" means "performing the process associated with the effect". By executing the process based on the "Magic / Trap" command, the effect associated with the selected Magic / Trap card or the Magic / Trap card to be selected will be activated.
The "monster effect" command is a command that activates a predetermined effect associated with a monster card having an effect. By executing the process based on the "monster effect" command, a predetermined effect associated with the selected monster card or the monster card to be selected is activated.

The "special summon" command is a command that is possible when the execution conditions (conditions associated with the card) different from the face-up summon and the face-down summon are satisfied, and is a command for placing a monster card in the field. ..
The "attack" command is a command that attacks an opponent with a monster card. By executing the process based on the "attack" command, the opponent is attacked by the selected monster card or the monster card to be selected.

Each of these commands defines an executable condition that enables processing based on the command to be executed according to the game situation. The game status is which team's turn is during game play, the LP of each team's player, the number of cards in the hand, the number of remaining cards in the deck, the number of monster cards in play, and the monster cards in the graveyard. It refers to various requirements such as the number of, the current "phase" in the turn, the elapsed time from the start of the turn, the elapsed time from the time when the command can be selected, and so on. A "phase" is a processing break in each turn. One turn consists of multiple phases. FIG. 3 is a diagram showing an example of the flow of one turn in the battle process. For example, one turn proceeds in the order of each phase (1) to (6) shown in FIG.

(1) Start phase: At the start of the turn, a process of drawing a card from the deck is performed.
(2) Preparation phase: The effect that is automatically generated at this timing is processed.
(3) Main Phase 1: When the player selects a card or command, processing related to activation of effects such as "summoning" of a monster card, "magic / trap", or "monster effect" is performed.
(4) Battle phase: It is started by the operation of performing a battle by the player, attacks the opponent using the cards placed in the field, and processing is performed on the result of the attack. If no battle is performed, this battle phase is not performed and the process proceeds to (6) End Phase below.
(5) Main Phase 2: The same processing as in Main Phase 1 is performed only when the battle phase of (4) is performed. This phase may be omitted.
(6) End phase: The process of ending the turn is performed. After this, it shifts to the opponent's turn.

For example, commands such as "summon" and "change offense and defense" are commands that can be executed only in the main phase. On the other hand, the "attack" command is a command that can be executed only in the battle phase. In addition, the execution conditions of each command are also determined by the game situation other than the phase. For example, the "summon" command can be executed when the monster card is in the hand area PAT, and cannot be executed when it is not. The "change offense and defense" command can be executed when the monster card is in the field PAB, and cannot be executed when the monster card is not in the field PAB. The "monster effect" command can be executed when the monster card having the effect is in the deck or graveyard of the hand area PAT, or the field PAB, and cannot be executed if it is not. The "Magic / Trap" command can be executed when the magic / trap card is in the hand area PAT or the field PAB, and cannot be executed when it is not. The "Special Summon" command can be executed when the corresponding monster card is in the hand area PAT or the field PAB (area PA5), and cannot be executed if there is no "Special Summon" condition that cannot be summoned by the normal method. Is. The "attack" command can be executed when the monster card is in the field PAB, and cannot be executed when it is not. Also, the "attack" command can only be executed once per turn for each monster card. Note that the conditions under which processing based on these commands can be executed are examples, and various conditions may be defined depending on the type of each card, the magnitude relationship of LP with the opponent, which turn it is, and the like. ..

Next, a method in which the player selects a command and a card will be described. The player can select a command by operating the command options displayed on the command selection screen in his / her turn. For example, command options in the main phase include "summon", "change offense and defense", "magic / trap", "monster effect", "special summon" and the like. In addition, on the command selection screen, there is a "battle" icon that functions as an operator for transitioning from the main phase to the battle phase, and "end of turn" that functions as an operator for transitioning from the main phase or battle phase to the end phase. An icon or the like may also be displayed. In addition, the command options in the battle phase include "attack" and the like.

When the player selects a command that involves selecting a card, the screen transitions to a card selection screen in which the card options that can be selected by the command are displayed, and the card can be selected. By selecting the card first, the selectable command options may be displayed.

〔System configuration〕
Next, an outline of the system configuration of the game system 1 according to the present embodiment will be described.
FIG. 4 is a block diagram showing an example of the configuration of the game system 1 according to the present embodiment. The game system 1 includes a computer device of a plurality of user terminals 10 (10-1, 10-2, 10-3, ...) And a game server 30, and these computer devices provide a communication network NW. Connected via.

The user terminal 10 executes a game process based on the game program. For example, the user terminal 10 is a computer device used by a user, such as a PC (Personal Computer), a tablet PC, a mobile phone such as a smartphone or a feature phone, or a game machine. In the present embodiment, the user terminal 10 will be described as a smartphone.

For example, when the player A, the player B, the player C, the player D, the player E, and the player F shown in FIG. 1 are players played by different users, each player looks at the game screen of each user terminal 10. While playing a card game. At this time, each player can play the same battle game on each user terminal 10 via the game server 30.

The game server 30 is a server device that provides a game that can be executed by the user terminal 10. For example, the game server 30 provides a game program for executing a game process on the user terminal 10 so that it can be downloaded from the user terminal 10. The game program downloaded by the user terminal 10 is not limited to the game server 30, and may be stored in another downloadable server device.

Further, the game server 30 executes a process on the server side of a game that can be played by executing the game program on the user terminal 10. For example, the game server 30 acquires information based on the player's operation (card selection information, command selection information, etc.) from the user terminal 10, and processes the game based on the acquired information (for example, processing of a competitive game). To execute. In addition, the game server 30 stores various information acquired from the user terminal 10, game play results, play history data, and the like, and transmits the game to the user terminal 10 as needed.

FIG. 5 is a diagram showing an example of the hardware configuration of the user terminal 10 according to the present embodiment. The user terminal 10 includes, for example, a CPU (Central Processing Unit) 11, a communication unit 12, an input unit 13, a display unit 14, and a storage unit 15, and is a game server 30 connected via a communication network NW. It communicates with other devices and the like via the communication unit 12. These components are connected to each other so as to be able to communicate with each other via a bus (Bus) or the like. The CPU 11 executes various programs stored in the storage unit 15 and controls each unit of the user terminal 10.

The communication unit 12 is a device that performs communication corresponding to a communication standard of a communication network NW such as a wireless LAN (Local Area Network), a wired LAN, and a mobile communication (LTE, etc.) capable of communicating between the user terminal 10 and the game server 30. Is.
The input unit 13 is a device capable of receiving interactive information during game execution. The interactive information is, for example, operation information according to a user's operation on the input unit 13. For example, the input unit 13 is integrally configured with the display as a touch panel. The input unit 13 outputs the input operation information to the CPU 11 in response to the user's operation. The input unit 13 may be a physical device such as a button, a keyboard, or a lever by mechanical operation, a pointing device by GUI (mouse or touch panel), a recognition device by voice or gesture (mic, camera), or the like.
The display unit 14 is a display for displaying information such as an image or text, and includes, for example, a liquid crystal display panel, an organic EL (Electroluminescence) display panel, and the like. The display unit 14 may be configured as a separate body from the user terminal 10, and may be, for example, a television, an external monitor, or a head-mounted display (HMD).

The storage unit 15 includes, for example, an HDD (Hard Disk Drive), an SSD (Solid State Drive), an EEPROM (Electrically Erasable Programmory), a ROM (Read-One Memory), a ROM (Read-One Memory), and a ROM (Read-One Memory). Stores various information, images, programs (including game programs) and the like processed by the user terminal 10. The storage unit 15 is not limited to the one built in the user terminal 10, and may be an external storage device connected by a digital input / output port such as USB. Further, the user terminal 10 may be configured to include a speaker (not shown), an audio output terminal, a camera, a gyro sensor, a GPS (Global Positioning System) receiving module, and the like.

FIG. 6 is a diagram showing an example of the hardware configuration of the game server 30 according to the present embodiment. The game server 30 includes, for example, a CPU 31, a communication unit 32, an input unit 33, and a storage unit 35, and is a communication unit 32 with a plurality of user terminals 10 and other devices connected via a communication network NW. Communicate via. These components are communicably connected to each other via a bus (such as Bus). The CPU 31 executes a server-side game program stored in the storage unit 35, and provides various data necessary for processing a game executed by a plurality of user terminals 10.

The communication unit 32 is a device that performs communication corresponding to the communication standard of the communication network NW such as wireless LAN, wired LAN, mobile communication (LTE, etc.) capable of communicating between the user terminal 10 and the game server 30.
The input unit 33 is a physical device such as a button, a keyboard, or a lever by mechanical operation, a pointing device (mouse or touch panel) by GUI, a recognition device (microphone, camera) by voice or gesture, and the like.

The storage unit 35 includes, for example, an HDD, EEPROM, RAM, etc., and stores a game program, an application program, various setting information necessary for the game, history information, and the like. The storage unit 35 is not limited to the one built in the game server 30, and may be an external storage device connected by a digital input / output port such as USB. Further, the storage unit 35 may be an external storage device physically separated from the game server 30, or may be connected to the game server 30 via a communication network such as the Internet. Further, the game server 30 may be configured to include a hardware configuration such as a display unit (not shown), a speaker, and an audio output terminal.

[Functional configuration]
Next, with reference to FIG. 7, the functional configurations of the user terminal 10 and the game server 30 included in the game system 1 will be described. FIG. 7 is a block diagram showing an example of the functional configuration of the user terminal 10 and the game server 30 according to the present embodiment.

[Functional configuration of user terminal 10]
First, the functional configuration of the user terminal 10 will be described. The user terminal 10 includes a game control unit 110 as a functional configuration realized by the CPU 11 executing a game program on the terminal side stored in the storage unit 15. The game control unit 110 executes game processing in response to a user operation on the input unit 13. For example, the game control unit 110 executes the above-mentioned processing of the battle game, and causes the display unit 14 to display various game screens (for example, see FIG. 2) according to the processing of the battle game. The game control unit 110 includes an input reception unit 111, a deck processing unit 112, a data processing unit 113, and a display control unit 114.

The input receiving unit 111 receives the user's operation via the input unit 13. For example, the input receiving unit 111 acquires the operation information input to the input unit 13 in response to the user's operation.
The deck processing unit 112 performs the arrangement processing of the cards included in the deck based on the operation information acquired by the input receiving unit 111. For example, the arrangement of cards is changed based on the operation on the game screen shown in FIG.

The data processing unit 113 sends and receives various data necessary for processing the game to and from the game server 30 via the communication unit 12. For example, when the deck processing unit 112 changes the arrangement of the cards, the data processing unit 113 transmits the arrangement information to the game server 30. Further, when the operation of selecting a card or selecting a command is performed based on the operation information acquired by the input receiving unit 111, the data processing unit 113 transfers the information based on the selected card and the command to the game server 30. Send to. In addition, the data processing unit 113 acquires card information, battle result information, deck information, opponent information, and the like from the game server 30 as needed.
The display control unit 114 controls the display of the game screen on the display unit 14.

[Functional configuration of game server 30]
Next, the functional configuration of the game server 30 will be described.
The game server 30 includes a server control unit 310 as a functional configuration realized by the CPU 31 executing a server-side game program stored in the storage unit 35. The server control unit 310 controls each unit of the game server 30. Further, the storage unit 35 includes a user data storage unit 351, a card data storage unit 352, a possession card data storage unit 353, a deck data storage unit 354, and a game status storage unit 355.

The user data storage unit 351 stores user data of a plurality of users who play a game on the user terminal 10. For example, in the user data storage unit 351, as user data, identification information (for example, user ID) for identifying a user, a user name, a user level whose value increases according to the progress of a game, and a user have played. History information etc. are associated and stored.

The card data storage unit 352 stores data related to a plurality of cards prepared in the game. FIG. 8 is a diagram showing a data example of the card data table TBL301 stored in the card data storage unit 352. In the card data table TBL301, a card ID, a card name, a card image, a card type, an offensive power, a defensive power, an attribute, an effect type, a level, a card text, and the like are stored in association with each other. The card ID is identification information that can identify the card. The card name is the name given to the card. The card image is an image when the card is displayed on the game screen, and a file of the image or link information to the file is stored. Information indicating the card type (“monster”, “magic”, “trap”, etc.) is stored in the card type. Information indicating the offensive power and defensive power of the monster card is stored in the offensive power and defensive power. Information (flame, darkness, light, earth, etc.) indicating the type (characteristic) of the monster on the monster card is stored in the attribute. In the effect type, the type of effect is stored in the card having the effect, and the information indicating that fact is stored in the card having no effect. The level is the level of the monster on the monster card. The card text stores the text information described in the card icon.

The possession card data storage unit 353 stores the card data (possession card data) possessed by each user. Specifically, the possessed card data storage unit 353 stores possessed card data in which the user's identification information (for example, user ID) and the card ID of the card possessed by the user are associated with each user. To.

The deck data storage unit 354 stores deck setting data and deck data during a battle. The deck setting data is data for managing the deck in which the cards possessed by each user are set. For example, in the deck setting data, the user ID, the deck identification information (for example, the deck ID), and the card ID of the card set in the deck are stored in association with each other. For example, the deck setting data of each of the decks α1, α2, α3, β1, β2, and β3 shown in FIG. 1 is stored. On the other hand, the deck data during the battle is data for managing the arrangement state of the cards during the battle, and includes information such as the arrangement state of the cards of the deck that each user is using as a player in the battle play. The card arrangement state is a place where cards are arranged and an arrangement direction (vertical orientation, horizontal orientation, face up, face down, etc.) on the game screen shown in FIG. For example, in a battle using deck α1 and deck β1, the deck data during the battle including information such as the arrangement state of the cards set in deck α1 and the arrangement state of the cards set in deck β1 are used. In-match deck data containing information is generated and updated at any time during the match. Since the card arrangement state is a state in which the cards are arranged by the user's operation, in other words, it can be said to be a state operated by the user (operation state). That is, the deck data storage unit 354 manages the state (operation state) operated by the user.

FIG. 9 is a diagram showing a data example of the in-match deck data table TBL302 stored in the deck data storage unit 354. Area ID, card ID, state 1, state 2, etc. are associated and stored in the deck data table TBL302 during the battle as deck data. The area ID is identification information that can identify the place where the card is placed. For example, the area ID is each place such as the hand area PAT, the deck area PA1, the monster area PA2, the magic / trap area PA3, the graveyard area PA4, the extra area PA5 shown in FIG. 2, and the detailed positions in each place. (For example, in the case of a hand, the position in the hand area PAT, in the case of a deck, the stacking order, in the case of a monster area, the right, center, and left positions) Different area IDs are set for the location and position of. In the card ID, the card ID of the card arranged at the place indicated by each area ID is stored. Further, the states 1 and 2 are information indicating the orientation of the cards, the state 1 stores information indicating whether the card is face up or face down, and the state 2 stores information indicating whether the card is oriented vertically or horizontally. Will be done.

The game status storage unit 355 stores battle status management data for managing the progress of the game during the battle. FIG. 10 is a diagram showing a data example of the battle situation management table TBL303 stored in the game situation storage unit 355. In the battle status management table TBL303, identification information (team ID or team name, etc.) for identifying the opposing team and identification information (player ID or player ID or) for identifying the players of each team are stored as battle status management data. (Player name, etc.), identification information (user ID, user name, etc.) for identifying the user who plays as each player, and each LP (in the illustrated example, the LP of the player A is 4000, the LP of the player D, etc.). 3000), whether it is player A's turn or player D's turn (“player A's turn” in the illustrated example), the running phase (main phase in the illustrated example), and the turn is started. The elapsed turn time (15 seconds in the illustrated example) that has elapsed since then is stored.

Returning to FIG. 7, the server control unit 310 executes the game processing. For example, the server control unit 310 includes a battle processing unit 311 (an example of a first determination unit and a second determination unit), a card addition unit 312 (an example of an additional unit), and a data processing unit 313.

The battle processing unit 311 executes the battle processing of the battle game described with reference to FIGS. 1 to 3. For example, when the battle processing unit 311 acquires information based on the cards and commands selected by each user terminal 10, the battle processing unit 311 refers to the deck data (see FIG. 9) stored in the deck data storage unit 354 and is a player of each team. Performs battle processing based on the placement and selection of cards in the deck used by and the execution of commands. At the same time, the battle situation management data (see FIG. 10) stored in the game situation storage unit 355 is updated. The battle processing unit 311 determines the result of the battle by defeating the team (player) whose LP becomes 0 first in the battle situation management data and winning the other team (player).

The card addition unit 312 is a deck other than the deck used for the battle among a plurality of decks (deck groups) included in one of the teams that have played against each other based on the result of the battle determined by the battle processing unit 311. Add the specified card to. For example, the card addition unit 312 is used by a deck other than the deck used by the player in the battle among a plurality of decks included in the defeated team (for example, the player of the defeated team in the next and subsequent battles). Add the specified card to the deck). For example, the card addition unit 312 selects a card selected by the player who played using the deck from the cards included in the deck used in the match by the defeated team as the predetermined card to be added. To do. That is, the defeated player selects an arbitrary card (for example, a powerful card that works in favor of the battle) from his / her own deck and adds it to the deck used by the players of his / her team who will play against each other from the next time onward. can do. The predetermined card to be added is not limited to the one selected by the player, and may be a card preset in the game. The preset card is, for example, one of the powerful cards prepared in the game, which is advantageous for the battle.

For example, the functions of the battle processing unit 311 and the card addition unit 312 will be described with reference to the example shown in FIG.
The battle processing unit 311 determines the result of the first round battle between the deck α1 used by the player A among the decks included in the team α and the deck β1 used by the player D among the decks included in the team β. To do. The card addition unit 312 adds a predetermined card to the decks other than the deck α1 of the team α based on the result of the battle determined by the battle processing unit 311. For example, the card addition unit 312 adds a predetermined card to the deck α2 used by the player B on the team α side in the second round match when the result of the first round match is the defeat of the deck α1 on the team α side. To do. The predetermined card to be added to the deck α2 is, for example, a card selected by the player A who has played using the deck α1 from the cards included in the deck α1.

Here, when adding a predetermined card to the deck, the card addition unit 312 updates the deck setting data of the deck to be added, for example. In addition to simply adding a predetermined card to the deck, a place to be added at the time of a battle may be defined, or a player may be able to specify a place to add. In that case, the card addition unit 312 updates the in-match deck data table TBL302 (see FIG. 9) according to the location of the cards added to the deck setting data. For example, when adding a predetermined card to the hand of the deck, the card addition unit 312 updates the deck setting data in order to add the predetermined card to the deck, and at the start of the battle, the predetermined card is placed in the hand area PAT. The deck data table TBL302 is updated during the match so that it will be played. The card addition unit 312 may add a predetermined card to a place other than the deck's hand (for example, a field or a deck in the field).

Next, the battle processing unit 311 determines the result of the battle between the deck included in the team α to which the predetermined card is added and the deck included in the team β in the next and subsequent battles. For example, in the second round, the battle processing unit 311 has a deck α2 used by the player B on the team α side to which a predetermined card has been added, and a deck β1 used on the team β side in the first round (player E in the second round). Determine the result of the match against (take over and use).

In addition, the card addition unit 312 adds a predetermined card to the deck β2 used by the player F on the team β side in the match of the third round when the result of the match in the second round is the defeat of the deck β1 on the team β side. To do. Then, in the third round, the battle processing unit 311 has the deck α2 used in the second round on the team α side (player C takes over and uses it in the third round) and the player F on the team β side to which a predetermined card is added. Determine the result of the match against the deck β2 to be used.

The data processing unit 313 exchanges various data necessary for processing the game with the plurality of user terminals 10 via the communication unit 32. For example, when the data processing unit 313 acquires the arrangement information of the deck cards from the user terminal 10, the data processing unit 313 updates the deck data stored in the deck data storage unit 354 based on the arrangement information. Further, when the data processing unit 313 acquires the information based on the selected card and the command from the user terminal 10, the acquired information is passed to the battle processing unit 311. In addition, the data processing unit 313 transmits card information, battle result information, deck information, opponent information, and the like to the user terminal 10 as needed.

[Operation of battle processing]
Next, the operation of the battle processing executed by the CPU 31 of the game server 30 will be described.
FIG. 11 is a flowchart showing an example of the battle process according to the present embodiment. Here, a 3v3 battle between team α (player A, player B, player C) and team β (player D, player E, player F) shown in FIG. 1 will be described as an example.

First, the CPU 31 matches the opponent teams and determines the opponent (team) (step S100). Next, the CPU 31 sets the number of battles N to 1 (N = 1) (step S102), and executes the battle processing of the first round (step S104). For example, the CPU 31 advances the battle process in the order of each phase shown in FIG.

The CPU 31 performs the first round of the battle process between the deck α1 used by the player A among the decks included in the team α and the deck β1 used by the player D among the decks included in the team β. The result of the match is determined (step S106). Specifically, the CPU 31 alternately advances the battle between the deck α1 used by the player A and the deck β1 used by the player D in a turn-based manner, and the battle status stored in the game status storage unit 355. With reference to the management data, the team (player) whose LP becomes 0 first is defeated, and the other team (player) wins, and the result of the match is determined. Here, it is assumed that the team α (player A) is defeated as shown in the example shown in FIG.

Next, the CPU 31 determines whether or not the number of battles N has reached 3 (N = 3) (step S108). At this point, since the number of battles N is 1 (N = 1), the CPU 31 determines that the number of battles N is not 3 (N = 3) (NO), and proceeds to the process of step S110.

In step S110, the CPU 31 adds a predetermined card to a deck other than the deck used for the battle among a plurality of decks of any team of the teams that have played against each other, based on the result of the battle determined in step S106. For example, the CPU 31 is predetermined to a deck other than the deck used by the player in the battle among a plurality of decks of the defeated team (for example, a deck used by the player of the defeated team in the next and subsequent battles). Add a card. An example of this card addition process will be described with reference to FIG.

FIG. 12 is a flowchart showing an example of the card addition process according to the present embodiment. Based on the result of the battle determined in step S106, the CPU 31 instructs the player A of the defeated team α to select the above-mentioned predetermined card (step S1102). Specifically, the CPU 31 transmits an instruction to display a selection screen for selecting the above-mentioned predetermined card from the deck α1 to the game screen of the user terminal 10 of the player A via the communication unit 32. To do. As a result, the selection screen is displayed on the display unit 14 of the user terminal 10 of the player A, and the card can be selected from the deck α1.

When a card is selected by the player A, the CPU 31 acquires information indicating the selected card from the user terminal 10 via the communication unit 32. The CPU 31 selects a card selected from the deck α1 as the above-mentioned predetermined card (step S1104).

Then, the CPU 31 adds the card selected as the above-mentioned predetermined card to the deck α2 used by the player B in the next second round match by the defeated team α. For example, the CPU 31 updates the deck data (see FIG. 9) of the deck α2 used by the player B to add the card selected as the predetermined card to the hand of the deck α2 (step S1106).

Returning to FIG. 11, the CPU 31 adds 1 to the number of battles N (N = N + 1: step S112), and returns to the process of step S104. Then, the CPU 31 executes the battle process of the second round.

The CPU 31 has a deck α2 used by the player B on the team α side to which a predetermined card has been added by the battle processing in the second round, and a deck β1 used in the first round on the team β side (player E takes over in the second round). The result of the match against (used in) is determined (step S106). Here, it is assumed that the team β (player E) is defeated as shown in the example shown in FIG.

Next, the CPU 31 determines whether or not the number of battles N has reached 3 (N = 3) (step S108). At this point, since the number of battles N is 2 (N = 2), the CPU 31 determines that the number of battles N is not 3 (N = 3) (NO), and proceeds to the process of step S110.

In step S110, based on the result of the match determined in step S106, the defeated team β is assigned to the deck β2 used by the player F in the next match of the third round, and the player E from the deck β1. Adds the card selected as the above-mentioned predetermined card. For example, the CPU 31 adds the card selected as the predetermined card to the hand of the deck β2 by updating the deck data (see FIG. 9) of the deck β2 used by the player F.

Next, the CPU 31 adds 1 to the number of battles N (N = N + 1: step S112), returns to the process of step S104, and executes the battle process of the third round.

The CPU 31 is used by the deck α2 used in the second round on the team α side (used by the player C in the third round) and the player F on the team β side to which a predetermined card is added by the battle processing of the third round. The result of the match against the deck β2 to be played is determined (step S106).

Next, the CPU 31 determines whether or not the number of battles N has reached 3 (N = 3) (step S108). At this point, since the number of battles N is 3 (N = 3), the CPU 31 determines that the number of battles N has reached 3 (N = 3) (YES), and proceeds to the process of step S114.

In step S114, the CPU 31 notifies the user terminal 10 of the team that has played the final result based on the result of the battle in the third round.

[Summary of the first embodiment]
As described above, the game server 30 (an example of a game device) according to the present embodiment executes a game process using a deck including a plurality of cards (an example of a game element). For example, the game server 30 executes processing of a game in which a first team (an example of a deck group) and a second team (an example of a deck group) play against each other. As an example, the game server 30 has a deck α1 (an example of a first deck) used by player A among the decks included in the first team (for example, team α) and a second team (for example, team β). ), The result of the first match (for example, the first round) with the deck β1 (an example of the second deck) used by the player D is determined. Further, the game server 30 is a deck other than the deck α1 used by the player A (for example, a deck used by the player B) among the first team (for example, the deck group of the team α) based on the determined result of the battle. Add the specified card to α2). Then, the game server 30 plays a second match (for example, a deck α2 used by the player B) with a deck to which a predetermined card is added and one of the decks included in the second team (for example, the team β). For example, the result of the second round) is determined.

As a result, the game server 30 can be a highly entertaining game because the result of the battle affects the contents of the deck used for the next and subsequent battles in a plurality of battles using the deck.

For example, the game server 30 may use deck α1 of the first team (eg, team α) when the result of the first match (eg, first round) is the defeat of deck α1 (an example of the first deck). Add a predetermined card to a deck other than (for example, deck α2).

As a result, the game server 30 can play by adding a predetermined card to the deck to be used in the next and subsequent battles by the side who lost in one battle when the battle using the deck is performed a plurality of times. The player can start playing in the next and subsequent matches in a more advantageous state than before adding the predetermined card. Therefore, it is difficult to develop a one-sided game in which only one side keeps winning, and the game can be made highly interesting.

Here, the game server 30 selects a card selected by player A (an example of a player) who has played using the deck α1 from the cards included in the deck α1 (an example of the first deck). You may choose it as a card.

As a result, the game server 30 adds the card selected by the player from the decks of the defeated side in one battle to the decks used in the next and subsequent battles of the defeated side. You can start playing in an advantageous state in the battle. For example, the defeated player is defeated because he or she can arbitrarily select a powerful card that has an advantageous effect in the battle from the decks used and add it to the deck to be used in the next and subsequent battles. You can increase the chances that the side will win the next match.

The game server 30 may add a preset card as the above-mentioned predetermined card.

As a result, the game server 30 adds the preset cards to the deck used in the next and subsequent battles of the defeated side in one battle, so that the defeated side plays in an advantageous state in the next and subsequent battles. You can start.

Further, the game server 30 determines, for example, the result of a match between the deck α2 to which a predetermined card is added and the deck β1 (an example of the second deck) included in the second team (for example, team β). That is, in the game server 30, for example, in a match between the deck α1 used by the player A of the team α and the deck β1 used by the player D of the team β, if the team α side is defeated, the deck β1 on the winning team β side Will be used in the next and subsequent matches.

As a result, the game server 30 is more strategic because the deck to be used from the next time onward is determined by the result of one battle (one is the same deck as the deck used in one battle). It can be a highly entertaining game.

[Second Embodiment]
Next, a second embodiment of the present invention will be described.
In the first embodiment, an example of adding a predetermined card to the deck to be used in the next battle based on the result of the battle has been described, but the number of cards to be added is changed based on the result of the battle. May be good.

For example, the card addition unit 312 may determine the number of predetermined cards to be added to the deck used in the second round based on the result of the battle in the first round. For example, the card addition unit 312 adds a small number of cards to the deck to be used in the next and subsequent battles on the losing side when the difference between wins and losses is small (for example, one card) and large when the difference between wins and losses is large (for example). 2, 2 or 3). The card addition unit 312 may determine the difference in victory or defeat of the battle result based on, for example, the difference in LP of the player when the victory or defeat is decided, or the level difference of the player (user) remains. Judgment may be made based on the level difference of cards, the number of remaining cards, and the like.

FIG. 13 is a flowchart showing an example of the card addition process according to the present embodiment. The illustrated card addition process is a specific example of the process of step S110 of FIG. 11, and corresponds to a modified example of the card addition process shown in FIG. 12 of the first embodiment.
The CPU 31 determines the number of predetermined cards to be added to the deck α2 used by the player B of the defeated team α based on the result of the battle determined in step S106 of FIG. 11 (step S1100A).

Next, the CPU 31 instructs the player A of the defeated team α to select a predetermined number of cards for the determined number based on the result of the battle determined in step S106 (step S1102A). Specifically, the CPU 31 gives an instruction via the communication unit 32 to display a selection screen for selecting a predetermined number of cards from the deck α1 on the game screen of the user terminal 10 of the player A. And send. As a result, the selection screen is displayed on the display unit 14 of the user terminal 10 of the player A, and the card can be selected from the deck α1.

When the player A selects the above number of cards, the CPU 31 acquires information indicating the selected cards from the user terminal 10 via the communication unit 32. The CPU 31 selects the above-mentioned number of cards selected from the deck α1 as the above-mentioned predetermined cards (step S1104A).

Then, the CPU 31 adds the above-mentioned number of cards selected as the above-mentioned predetermined cards to the deck α2 used by the player B in the next second round match by the defeated team α. For example, the CPU 31 updates the deck data (see FIG. 9) of the deck α2 used by the player B to add the above number of cards selected as the predetermined cards to the hand of the deck α2. (Step S1106A). Then, the process proceeds to step S112 of FIG.

In this way, the game server 30 may determine the number of the predetermined cards based on the result of the battle in the first battle (for example, the first round).

As a result, the game server 30 loses by a large difference by increasing the number of cards to be added to the deck to be used in the next and subsequent battles on the losing side, for example, when the difference between the wins and losses of the battle results is large. The team can also increase the chances of winning the next match.

[Third Embodiment]
Next, a third embodiment of the present invention will be described. Here, control regarding the progress of the competitive game will be described. In the first embodiment, the team that won the first match takes over the deck used in the first match as it is in the next match, and the losing team plays the next match in the new deck. However, it is not just taking over the deck, but the state of the field (the state of the cards placed in the field) and the state of the hand (hand) when the result of the match is decided (that is, when the game is won). You may start the next match by taking over a part or all of the arranged state of the cards arranged as. The arrangement state of the cards in the field is, for example, the arrangement state of the cards in the field PAB or the field PBB shown in FIG. The arrangement state of the cards in the hand is, for example, the arrangement state of the cards in the hand area PAT or the hand area PBT shown in FIG. Further, the arrangement state of this card is managed by the deck data stored in the deck data storage unit 354. The arrangement state of this card can also be said to be an operation state operated by the player (user) in the battle.

For example, in the example shown in FIG. 1, in the second round, the player B of the team α plays against the player E of the team β with the card added from the player A added to the deck α2, but the player of the team β. E takes over the operation state of the player D (such as the arrangement state of the cards arranged in the field or hand) with respect to the deck β1 used in the first round and uses it as it is. Further, as described in the first embodiment, in the second round, the player on the defeated side in the first round is the first player (starting from the turn of the defeated player). In addition, normally, in the first turn (first turn) of the first attack, there is a restriction not to accept some of the operations related to the battle such as not being able to attack, but the first turn after the second round Then, the restriction is lifted. In this way, in the next match, the defeated side will be the first player, and the restrictions such as not being able to attack on the first turn of the first attack will be lifted, so the team on the defeated side will have an advantage in the next match. It will increase the possibility of proceeding.

With reference to FIG. 14, the operation of the control process relating to the progress of the battle game executed by the CPU 31 of the game server 30 will be described. FIG. 14 is a flowchart showing an example of control processing relating to the progress of the battle game.

In the battle process, the CPU 31 determines whether the battle is the first round or the second and subsequent rounds (step S200). When the CPU 31 determines that the match is the first round, the first attack / second attack is determined by lottery (step S202), and the process proceeds to step S206. On the other hand, when the CPU 31 determines that the match is from the second round onward, the player of the team defeated in the previous match is determined to be the first player (step S204), and the process proceeds to step S210.

Further, in step S206, when it is determined that the match is the first round, the CPU 31 determines whether or not it is the first turn of the first attack. When the CPU 31 determines that it is the first turn of the first attack (YES), the CPU 31 is set to have restrictions such as not being able to attack (step S208). On the other hand, if the CPU 31 determines that it is not the first turn of the first attack (NO), the CPU 31 proceeds to the process of step S210. In step S210, the CPU 31 is set without any restrictions such as being unable to attack.

As described above, when the game server 30 executes the processing of the game in which the team α and the team β play against each other as in the example shown in FIG. 1, in the first round, the deck α1 of the team α (an example of the first deck). ) And player D's operation on the cards included in team β's deck β1 (an example of the second deck), the result of the battle between deck α1 and deck β1 is determined. To do. Further, in the second round, the game server 30 operates the player for the cards included in the deck α2 (an example of the third deck) other than the deck α1 of the team α, and the player for the cards included in the deck β1 of the team β. Based on the operation of E, the result of the battle between the deck α2 and the deck β1 is determined. Further, in the battle of the second round, the cards included in the deck β1 are started by taking over the state operated by the player D in the battle in the first round. The state operated by the player D (operation state) is, for example, a card arrangement state (place to be arranged, orientation of arrangement, etc.).

As a result, the game server 30 has a plurality of operation states (such as the arrangement state of the cards arranged in the field and the hand) for one of the decks used in one battle, which is inherited in the next battle. Since it is a series of battles that are not clearly separated even in the number of battles, the battles proceed at a good tempo, and the game can be made highly interesting. It should be noted that at least a part of the state operated by the player D (for example, the arrangement state of the game elements) may be inherited.

For example, in the game server 30, in the second determination step, the result of the battle in the first round is the defeat of the deck α1 of the team α (an example of the first deck) and the victory of the deck β1 of the team β (an example of the second deck). If so, the result of the battle between the deck α2 (an example of the third deck) and the deck β1 is determined.

As a result, the game server 30 is clearly separated even in a plurality of battles because the operation state of the winning deck (such as the arrangement state of the cards placed in the field or hand) is inherited in the next battle. Since it will be a series of battles that do not exist, the battles will proceed at a good tempo, and it will be a highly entertaining game.

Further, when the game server 30 executes the processing of a game in which a plurality of battles are won and the battle is performed, the opponents (for example, the player of the team α and the player of the team β) alternately perform each battle. Proceed in a turn-based system where operations related to battles are performed on the turn. In addition, the game server 30 restricts the first turn of the first match (first round) from accepting a part of the operations related to the match. Further, when the victory or defeat is determined by the result of the battle, the game server 30 controls the defeated side to be the first player in the next battle and not to impose the above restriction on the first turn of the first player. In addition, the progress part that advances each battle in a turn system, the restriction part that restricts not accepting some of the operations related to the battle, and the above restriction on the first turn of the first attack side should not be applied. For example, the battle processing unit 311 includes each configuration as a control unit that controls the game.

As a result, in the turn-based multiple battles, the side defeated in one battle becomes the first player in the next battle, and the game server 30 limits the operation in the first turn of the first player, which is normally set (for example,). Since restrictions such as not being able to attack) are lifted, the defeated side can start playing in an advantageous state in the next match. Therefore, it is difficult to develop a one-sided game in which only one side keeps winning, and the game can be made highly interesting.

The number of turns in each match may be limited. For example, there is a preset limit on the number of turns in one match (for example, n times: n is a natural number), and the game server 30 determines both if there is no settlement during n turns. Proceed to the next match as a defeat. If the game server 30 does not settle during n turns, both may win or draw.

As a result, if the game server 30 cannot settle between the preset number of turns in each match, the game server 30 defeats (or wins or draws) both of them and proceeds to the next match, so that the match is played at a good tempo. Is progressing, and it can be made into a highly entertaining game.

It should be noted that, as an example of the control of the battle game, the defeated side becomes the first attack, and the restriction that the attack cannot be performed on the first turn of the first attack is released as an example, and the battle game according to this embodiment is controlled by this. It is not limited to.

[Modification example]
Although the embodiments of the present invention have been described in detail with reference to the drawings, the specific configuration is not limited to the above-described embodiments, and includes designs and the like within a range that does not deviate from the gist of the present invention. For example, the configurations described in the above embodiments can be arbitrarily combined.

In addition, restrictions may be set on the predetermined cards to be added to the deck to be used in the next and subsequent battles of the defeated side. For example, the above-mentioned predetermined card may be only a card satisfying a predetermined condition. Cards that meet certain conditions are used cards, unused cards, cards placed as a hand, cards placed in the field, cards placed as a deck, and certain types of cards. It may be a card predetermined for each character, a card specified in advance by the player who uses the deck before the battle, a card specified by the opponent, or the like.

Further, the deck to which a predetermined card is added based on the result of the battle is not limited to the deck to be used in the next battle, and may be a deck to be used in any of the subsequent battles. For example, a predetermined card may be added to the deck used in the third round instead of the next match (second round) of the team that lost in the first round. In addition, the defeated player may be able to select which deck to add to the deck to be used in. Further, in the above embodiment, a 3v3 team battle has been described as an example, but a 2v2 team battle may be used, or a 4v4 or more team battle may be used.

Further, the deck used in the final battle may be specified so that the above-mentioned predetermined card cannot be added. For example, in the example of the battle up to the third round shown in FIG. 1, the team that lost in the first round can add a predetermined card to the deck used by the team in the second round, but the side that lost in the second round The team may not be able to add a given card to the deck used by the team in the third round. That is, the general battle may be a competitive match using only the cards originally set in the deck without adding a predetermined card even if the side is defeated in the previous battle. In addition, the specifications are not limited to the specifications in which the above-mentioned predetermined card cannot be added only in the final battle, and the number of battles in which the predetermined card can be added and the battle in which the predetermined card cannot be added can be arbitrarily set. it can.

Further, in the above embodiment, an example in which the winning or losing of each match is determined so that the LP value of either one becomes 0 has been described, but the method of determining the winning or losing is not limited to this. For example, the victory or defeat for each match may be determined by the fact that the LP value is less than a predetermined threshold value, or when the difference between the LPs is more than a certain value, the one with the lower LP value is determined as the defeat. Alternatively, a time limit may be set for the match, and when the time limit is reached, the one with the lower LP value may be determined as defeat. Further, the victory or defeat for each match may be determined based on arbitrary parameters that fluctuate in the game, such as the number of attacks, the number of attacks, and the number of remaining cards, which are not limited to the LP value.

In the above embodiment, the winning team has taken over only the deck to play the next match, but the players may also take over without changing. Also, the winning team may not take over the deck of the previous match and use a new deck in the next match.

Further, in the above embodiment, the defeated side can play in an advantageous state by adding a predetermined card to the deck to be used in the next and subsequent battles, but it is possible to play in an advantageous state by another method. You may do so. For example, in the next and subsequent battles, increase the initial LP value at the start of the battle on the defeated side, increase the number of cards in the initial hand, and start the battle with magic / trap cards placed in the field as a set. , Start the battle with monster cards placed, increase the number of cards drawn from the deck to the hand in one turn (draw increase), reduce the release (cards sent to the graveyard) required to activate the effect , By reducing the cost required to acquire the card, it may be possible to play in an advantageous state.

On the other hand, instead of or in addition to favoring the defeated side, the winning side may be disadvantaged. Factors that make it disadvantageous include, for example, in the next and subsequent battles, the value of the initial LP at the start of the battle on the winning side is reduced, the number of cards in the initial hand is reduced, and the deck is drawn from the deck to the hand in one turn. Decrease the number of cards (decrease draw), increase the release required to activate the effect (cards sent to the graveyard), increase the cost required to acquire the card, some restrictions during a specific turn (specific) Cards cannot be selected, specific commands cannot be selected, etc.).

Further, in the above embodiment, the mode in which the defeated side is advantageous (or the winning side is disadvantageous) in the next and subsequent battles based on the victory or defeat as a result of the battle has been described. It may be based on the result of a match that includes not only victory or defeat but also factors other than victory or defeat. For example, it may be based on the difference (for example, point difference) when the victory or defeat is settled, not just the victory or defeat. For example, only when the victory or defeat is decided by a one-sided large difference (for example, a difference exceeding a preset threshold value such as 100 points to 10 points), the defeated side will have an advantage (or victory) in the next and subsequent matches. You may (so that the side that did it is at a disadvantage). In addition, the defeated side may be advantageous (or the winning side may be disadvantaged) only when the victory or defeat is decided by the reversal, not just the victory or defeat. In addition, it may be based on the time spent to settle the victory or defeat, the number of turns, etc., not just the victory or defeat. For example, the defeated side may be advantageous (or the winning side may be disadvantaged) only when the victory or defeat is decided early (for example, within 3 turns). In this way, the defeated side may be advantageous (or the winning side may be disadvantaged) based on the result based on the progress of the battle, not just the victory or defeat.

In the above embodiment, an example of a battle-type (battle-type) battle game has been described, but the present invention is not limited to this, and any game in which a game element such as a card is used to play a baseball game or soccer. It may be another type of game such as a game. Further, the game element is not limited to the card, and any game element such as a medal or a figure representing the character itself can be applied.

The usage mode of the battle game (card game) according to the present embodiment may be, for example, held as an online game by the game organizer (operator). For example, an online game officially held by the game organizer (operator) is provided from the game server 30, and participating users connect to the game server 30 from their own user terminals 10 or the like via the communication network NW (Internet). The battle game (card game) according to the present embodiment may be used as a so-called "e-sports" in which the player participates and plays. In addition, the watching user can also watch the game situation by connecting to the game server 30 from his / her own user terminal 10 or the like via the communication network NW (Internet). For example, the game server 30 notifies only the same team of the contents of the cards added to the defeated deck, and does not notify the opponent team and the spectator user. The game server 30 may notify the spectator user of the contents of the card added to the defeated deck. Further, when it is used as a so-called "e-sports", it may be held at a predetermined venue (event venue, concert hall, game center, etc.) by gathering participating users and watching users.

Further, a program for realizing the functions of the game control unit 110 or the server control unit 310 described above is recorded on a computer-readable recording medium, and the program recorded on the recording medium is read into the computer system and executed. As a result, processing as the game control unit 110 or the server control unit 310 may be performed. Here, "loading and executing a program recorded on a recording medium into a computer system" includes installing the program in the computer system. The term "computer system" as used herein includes hardware such as an OS and peripheral devices. Further, the "computer system" may include a plurality of computer devices connected via a network including a communication line such as the Internet, WAN, LAN, and a dedicated line. Further, the "computer-readable recording medium" refers to a portable medium such as a flexible disk, a magneto-optical disk, a ROM, or a CD-ROM, or a storage device such as a hard disk built in a computer system. As described above, the recording medium in which the program is stored may be a non-transient recording medium such as a CD-ROM. The recording medium also includes an internal or external recording medium that can be accessed from the distribution server to distribute the program. The code of the program stored in the recording medium of the distribution server may be different from the code of the program in a format that can be executed by the terminal device. That is, the format stored in the distribution server does not matter as long as it can be downloaded from the distribution server and installed in a form that can be executed by the terminal device. The program may be divided into a plurality of parts, downloaded at different timings, and then combined by the terminal device, or the distribution server for distributing each of the divided programs may be different. Furthermore, a "computer-readable recording medium" is a volatile memory (RAM) inside a computer system that serves as a server or client when a program is transmitted via a network, and holds the program for a certain period of time. It shall also include things. Further, the above program may be for realizing a part of the above-mentioned functions. Further, a so-called difference file (difference program) may be used, which can realize the above-mentioned functions in combination with a program already recorded in the computer system.

Further, some or all the functions of the game control unit 110 or the server control unit 310 described above may be realized as an integrated circuit such as an LSI (Large Scale Integration). Each of the above-mentioned functions may be made into a processor individually, or a part or all of them may be integrated into a processor. Further, the method of making an integrated circuit is not limited to LSI, and may be realized by a dedicated circuit or a general-purpose processor. Further, when an integrated circuit technology that replaces an LSI appears due to advances in semiconductor technology, an integrated circuit based on this technology may be used.

Further, in the above embodiment, the storage unit 35 of the game server 30 includes a user data storage unit 351, a card data storage unit 352, a possession card data storage unit 353, a deck data storage unit 354, and a game status storage unit 355. Although the configuration including the above is described, at least a part of each storage unit included in the storage unit 35 or at least a part of the data stored in each storage unit is also stored in the storage unit 15 of the user terminal 10. It may be remembered. For example, among the data stored in the storage unit 35, the data associated with each user (for example, the user data of each user, the possessed card data, the deck data, the battle situation management data, etc.) is the user terminal of each user. It may be stored in the storage unit 15 of 10. That is, the game server 30 may store the data of all the users registered in the game, and the user terminal 10 may store the data of each user. In this case, the data stored in the game server 30 and the data stored in the user terminal 10 are synchronized at a predetermined opportunity. Further, the card data of a plurality of cards prepared in the game may be stored in the storage unit 15 of the user terminal 10.

Further, in the above embodiment, the configuration in which the game server 30 performs the battle processing has been described, but the user terminal 10 may perform the battle processing. For example, when the processing of the game executed on the user terminal 10 is performed independently (stand-alone) on the user terminal 10, the game server described in the above embodiment is configured to perform the battle processing on the user terminal 10. The user terminal 10 may have a configuration corresponding to at least a part of the configuration included in the 30.

[Additional Notes]
From the above description, the present invention can be grasped as follows, for example. Reference numerals in the accompanying drawings are added in parentheses for convenience in order to facilitate understanding of the present invention, but the present invention is not limited to the illustrated mode.

(Appendix 1) The game program according to one aspect of the present invention is a game using a deck including a plurality of game elements (for example, cards), and is a first deck group (for example, team α) and a second deck. The computer that executes the processing of the game in which the deck group (for example, team β) competes with the first deck (for example, the deck α1 used by the player A) among the decks included in the first deck group. The first determination step (S108) for determining the result of a match (for example, the first round) with the second deck (for example, the deck β1 used by the player D) among the decks included in the second deck group. , An additional step of adding a predetermined game element to a deck other than the first deck (for example, deck α2 used by player B) in the first deck group based on the result of the battle in the first determination step. (S112), and a second determination step (S108) for determining the result of a match (for example, the second round) between the deck to which the predetermined game element is added and any of the decks included in the second deck group. To execute.

According to the configuration of Appendix 1, in a plurality of battles using decks, the result of the battle affects the contents of the deck used for the next and subsequent battles, so that the game can be highly entertaining.

(Appendix 2) Further, one aspect of the present invention is the game program described in Appendix 1, and in the additional step, the result of the battle (for example, the first round) in the first determination step is the first deck (for example). For example, when the deck α1) is defeated, a predetermined game element is added to a deck other than the first deck (for example, deck α2) in the first deck group (for example, team α).

According to the configuration of Appendix 2, the defeated side can play by adding a predetermined game element to the deck to be used in the next and subsequent battles, so that the defeated side can play the predetermined game in the next and subsequent battles. You can start playing in a more advantageous state than before adding the element. Therefore, it is difficult to develop a one-sided game in which only one side keeps winning, and the game can be made highly interesting.

In other words, in the case of multiple battles, in the past, if there was a difference in the strength of the decks to be played and the winning side was the same for each battle, it would be a one-sided development and defeated. There is a problem that the motivation of the side to continue the game is reduced, and according to the configuration of Appendix 2, this problem can be solved.

(Appendix 3) Further, one aspect of the present invention is the game program described in Appendix 1 or Appendix 2, from among the game elements included in the first deck (for example, deck α1) in the computer. A step (S1124) of selecting a game element selected by a player (for example, player A) who has played using the first deck as the predetermined game element is executed.

According to the configuration of Appendix 3, the defeated side is added to the deck used in the next and subsequent battles of the defeated side, so that the game element selected by the player from the decks of the defeated side in one battle is added to the next deck. You can start playing in an advantageous state in subsequent battles. For example, the defeated player can arbitrarily select a powerful game element that has an advantageous effect in the battle from the decks used and add it to the deck to be used in the next and subsequent battles. You can increase the chances that the player will win the next match.

(Appendix 4) Further, one aspect of the present invention is the game program described in Appendix 1 or Appendix 2, in which a preset game element is added as the predetermined game element in the addition step.

According to the configuration of Appendix 4, the preset game elements are added to the deck used in the next and subsequent battles of the defeated side in one battle, so that the defeated side plays in an advantageous state in the next and subsequent battles. Can be started.

(Supplementary Note 5) Further, one aspect of the present invention is the game program according to any one of Supplementary note 1 to Supplementary note 4, which is determined by the computer based on the result of the battle in the first determination step. The step (S1120A) of determining the number of game elements of the game is executed.

According to the configuration of Appendix 5, for example, if there is a large difference in the outcome of the match, the defeated side loses by a large margin by increasing the number of game elements added to the deck used in the next and subsequent matches. Even a team can increase the chances of winning the next match.

(Supplementary Note 6) Further, one aspect of the present invention is the game program according to any one of Supplementary notes 1 to 5, wherein the second determination step is a deck to which the predetermined game element is added (for example, The result of the battle between the deck α2) and the second deck (for example, deck β1) included in the second deck group (for example, team β) is determined.

According to the configuration of Appendix 6, the deck to be used from the next time onward is determined by the result of one battle (one is the same deck as the deck used in one battle), so the strategy is improved. It can be a highly entertaining game.

(Appendix 7) The game processing method according to one aspect of the present invention is a game using a deck including a plurality of game elements (for example, cards), and is a first deck group (for example, team α) and a second. A game processing method executed by a computer that executes processing of the game in which the deck group (for example, team β) of the game is played, and is the first deck (for example) of the decks included in the first deck group. , The result of the battle (for example, the first round) between the deck α1) used by the player A and the second deck (for example, the deck β1 used by the player D) among the decks included in the second deck group. Based on the first determination step (S108) to be determined and the result of the battle in the first determination step, decks other than the first deck in the first deck group (for example, deck α2 used by player B). The result of the additional step (S112) of adding a predetermined game element to, and the battle (for example, the second round) between the deck to which the predetermined game element is added and any of the decks included in the second deck group. A second determination step (S108) to determine is included.

(Appendix 8) Further, the game device (30, 10) according to one aspect of the present invention is a game using a deck including a plurality of game elements (for example, cards), and is a first deck group (for example, for example). A game device that executes the processing of the game in which the team α) and the second deck group (for example, the team β) play against each other, and is the first deck (for example) of the decks included in the first deck group. , The result of the battle (for example, the first round) between the deck α1) used by the player A and the second deck (for example, the deck β1 used by the player D) among the decks included in the second deck group. Based on the result of the battle between the first determination unit (311) to be determined and the first determination unit, decks other than the first deck in the first deck group (for example, deck α2 used by player B). The result of the battle (for example, the second round) between the additional part (312) that adds a predetermined game element to the deck, the deck to which the predetermined game element is added, and any of the decks included in the second deck group. A second determination unit (311) for determining is provided.

According to the configurations of Appendix 7 and Appendix 8, in a plurality of battles using decks, the result of the battle affects the contents of the deck used in the next and subsequent battles, so that the game can be made highly interesting.

Further, from the above description, the present invention can be grasped as follows, for example.

(Appendix 9) Further, the game program according to one aspect of the present invention is a game using a deck including a plurality of game elements (for example, cards), and is a first deck group (for example, team α) and a first. A user (for example, a user (for example, deck α1) for a game element included in the first deck (for example, deck α1) of the first deck group on a computer that executes processing of the game in which two deck groups (for example, team β) play against each other. For example, based on the operation of the player A) and the operation of the user (for example, player D) on the game element included in the second deck (for example, deck β1) of the second deck group, the first It is included in the first determination step (S108) for determining the result of the battle between the deck and the second deck, and the third deck (for example, deck α2) other than the first deck in the first deck group. Based on the operation of the user (for example, player B) on the game element and the operation of the user (for example, player E) on the game element included in the second deck (for example, deck β1), the third deck and the said The second determination step (S108) for determining the result of the battle with the second deck is executed, and in the battle in the second determination step, the game elements included in the second deck are in the first determination step. It is started by taking over the state operated by the user in the battle. The state operated by the user (operation state) is, for example, an arrangement state of game elements (place to be arranged, orientation of arrangement, etc.).

According to the configuration of Appendix 9, the operating status of one of the decks used in one battle (such as the placement of game elements placed in the field or hand) will be carried over to the next battle. Since it is a series of battles that are not clearly separated even in multiple battles, the battles proceed at a good tempo, and the game can be highly entertaining. It should be noted that at least a part of the state operated by the user (for example, the arrangement state of the game element) may be inherited.

(Appendix 10) Further, one aspect of the present invention is the game program described in Appendix 9, and in the second determination step, the result of the battle in the first determination step is the defeat of the first deck and the first determination step. If the two decks are won, the result of the battle between the third deck and the second deck is determined.

According to the configuration of Appendix 10, the operating status of the winning deck (such as the placement status of the cards placed in the field or hand) will be inherited in the next battle, so it will be clearly separated even in multiple battles. Since it will be a series of battles that do not exist, the battles will proceed at a good tempo, and it will be a highly entertaining game.

(Appendix 11) Further, the game processing method according to one aspect of the present invention is a game using a deck including a plurality of game elements (for example, cards), and is combined with a first deck group (for example, team α). A game processing method executed by a computer that executes processing of the game in which a second deck group (for example, team β) plays against the first deck (for example, a deck) of the first deck group. The operation of the user (for example, player A) for the game element included in α1) and the user (for example, player D) for the game element included in the second deck (for example, deck β1) of the second deck group. The first determination step (S108) for determining the result of the battle between the first deck and the second deck based on the operation of, and the third deck other than the first deck in the first deck group. The operation of the user (for example, player B) on the game element included in the deck (for example, deck α2) and the operation of the user (for example, player E) for the game element included in the second deck (for example, deck β1). The game includes a second determination step (S108) for determining the result of the battle between the third deck and the second deck based on the above, and in the battle in the second determination step, the game included in the second deck. The element is started by taking over the state operated by the user in the battle in the first determination step.

(Appendix 12) Further, the game device (30, 10) according to one aspect of the present invention is a game using a deck including a plurality of game elements (for example, cards), and is a first deck group (for example, for example). The computer that executes the processing of the game in which the team α) and the second deck group (for example, team β) play against each other is included in the first deck (for example, deck α1) of the first deck group. Based on the user's (eg, player A) operation on the game element and the user's (eg, player D) operation on the game element included in the second deck (eg, deck β1) of the second deck group. The first determination unit (311) that determines the result of the battle between the first deck and the second deck, and the third deck (for example, a deck) other than the first deck in the first deck group. Based on the operation of the user (for example, player B) on the game element included in α2) and the operation of the user (for example, player E) on the game element included in the second deck (for example, deck β1). A second determination unit (311) for determining the result of the battle between the third deck and the second deck is provided, and in the battle in the second determination step, the game element included in the second deck is the first. 1 The state of being operated by the user in the battle in the determination step is taken over and started.

According to the configurations of Appendix 11 and Appendix 12, the operating status of one of the decks used in one battle (such as the placement of cards placed in the field or hand) will be carried over to the next battle. Therefore, since it is a series of battles that are not clearly separated even in a plurality of battles, the battles proceed at a good tempo, and the game can be made highly interesting.

(Appendix 13) Further, in the game program according to one aspect of the present invention, each battle is played against each other (for example, a player of team α) on a computer that executes a game process in which a plurality of battles are won and the battle is performed. And team β players) alternately perform operations related to the battle in their own turn (S106), and in the first turn of the first battle (first round) of the first battle (first round), of the above operations If the victory or defeat is decided based on the step (S208) that restricts partial acceptance and the result of the match, the defeated side will be the first player in the next match, and the above restriction will not be applied on the first turn of the first player. The step (S210) of controlling the above is executed.

According to the configuration of Appendix 13, in multiple turn-based battles, the side that loses in one battle becomes the first player in the next battle, and the operation restriction on the first turn of the first player that is normally set (for example, Since restrictions such as not being able to attack) are lifted, the defeated side can start playing in an advantageous state in the next match. Therefore, it is difficult to develop a one-sided game in which only one side keeps winning, and the game can be made highly interesting.

In other words, in the case of multiple battles, in the past, if there was a difference in the strength of the decks to be played and the winning side was the same for each battle, it would be a one-sided development and defeated. There is a problem that the side may be less motivated to continue the game, and according to the configuration of Appendix 13, this problem can be solved.

(Appendix 14) Further, one aspect of the present invention is the game program described in Appendix 11, and the number of turns in each match may be limited.

According to the configuration of Appendix 14, if there is no conclusion between the preset number of turns in each match, both players will be defeated (or won or drawn) and proceed to the next match at a good tempo. Can be made into a highly entertaining game.

(Appendix 15) Further, the game processing method according to one aspect of the present invention is a game processing method executed by a computer that executes processing of a game in which a plurality of battles are won and performed in a battle, and each battle is performed. A turn-based step (S106) in which opponents (for example, a player of team α and a player of team β) alternately perform operations related to the battle in their own turn, and a step (S106) on the first side of the first battle (first round). In the first turn, if the victory or defeat is decided based on the step (S208) that restricts the acceptance of a part of the above operations and the result of the match, the defeated side will be the first player in the next match, and the first player will be the first player. A step (S210) of controlling not to perform the limitation on the first turn is included.

(Appendix 16) Further, the game device (30, 10) according to one aspect of the present invention is used to play each battle against each other (for example,) on a computer that executes a game process in which a plurality of battles are won and the battle is performed. , The player of team α and the player of team β) alternately perform operations related to the battle in their own turn. , The restriction part (311) that restricts not accepting a part of the above operations, and if the victory or defeat is decided based on the result of the match, the defeated side will be the first player in the next match, and the first turn of the first player A control unit (311) is provided so as not to perform the above limitation in.

According to the configurations of Appendix 15 and Appendix 16, in multiple turn-based battles, the side that lost in one battle will be the first player in the next battle, and the operation restriction on the first turn of the first player, which is normally set, will be the first. Since (for example, restrictions such as not being able to attack) are lifted, the defeated side can start playing in an advantageous state in the next match. Therefore, it is difficult to develop a one-sided game in which only one side keeps winning, and the game can be made highly interesting.

1 game system, 10 user terminals, 11 CPU, 12 communication unit, 13 input unit, 14 display unit, 15 storage unit, 30 game server, 31 CPU, 32 communication unit, 33 input unit, 35 storage unit, 110 game control unit , 111 Input reception unit, 112 deck processing unit, 113 data processing unit, 114 display control unit, 310 server control unit, 311 battle processing unit, 312 card addition unit, 313 data processing unit, 351 user data storage unit, 352 card data Storage unit, 353 possession card data storage unit, 354 deck data storage unit, 355 game status storage unit

Claims (7)

A computer that executes the processing of the game in which the first deck group and the second deck group compete against each other in a game using a deck containing a plurality of game elements.
A first determination step for determining the result of a match between the first deck of the decks included in the first deck group and the second deck of the decks included in the second deck group, and
Based on the result of the battle in the first determination step, an additional step of adding a predetermined game element to a deck other than the first deck in the first deck group, and
A second determination step for determining the result of a match between the deck to which the predetermined game element is added and one of the decks included in the second deck group.
A game program to run. In the additional step
When the result of the battle in the first determination step is the defeat of the first deck, a predetermined game element is added to the decks other than the first deck in the first deck group.
The game program according to claim 1. In the additional step
Adding a preset game element as the predetermined game element,
The game program according to claim 1 or 2. On the computer
A step of determining the number of predetermined game elements based on the result of the match in the first determination step.
The game program according to any one of claims 1 to 3. The second determination step determines the result of a match between the deck to which the predetermined game element is added and the second deck included in the second deck group.
The game program according to any one of claims 1 to 4. A game using a deck including a plurality of game elements, which is a game processing method executed by a computer that executes processing of the game in which the first deck group and the second deck group compete against each other.
A first determination step for determining the result of a match between the first deck of the decks included in the first deck group and the second deck of the decks included in the second deck group, and
Based on the result of the battle in the first determination step, an additional step of adding a predetermined game element to a deck other than the first deck in the first deck group, and
A second determination step for determining the result of a match between the deck to which the predetermined game element is added and one of the decks included in the second deck group.
Game processing methods including. A game using a deck including a plurality of game elements, which is a game device that executes processing of the game in which the first deck group and the second deck group compete against each other.
A first decision unit that determines the result of a match between the first deck of the decks included in the first deck group and the second deck of the decks included in the second deck group.
Based on the result of the battle by the first determination unit, an additional unit that adds a predetermined game element to a deck other than the first deck in the first deck group, and an additional unit.
A second determination unit that determines the result of a match between a deck to which the predetermined game element is added and one of the decks included in the second deck group.
A game device equipped with.

Images