JP7226816B2 - Game program, game processing method, and game device - Google Patents

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 played against an opponent (for example, Patent Document 1).

JP 2014-083265 A

However, in the case of playing multiple matches, if the relevance of each match is low, there is a concern that the game lacks interest.

An object of some aspects of the present invention is to provide a game program, a game processing method, and a game device that are highly entertaining in multiple battles using decks.

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

In order to solve the above-described problems, one aspect of the present invention is a game using decks including a plurality of game elements, and processing of the game in which a first deck group and a second deck group compete against each other. a first deck for determining the result of a match between a first deck included in the first deck group and a second deck included in the second deck group; a determining step; an additional step of adding a predetermined game element to a deck other than the first deck in the first deck group based on the result of the battle in the first determining step; A game program for causing execution of a second decision step of deciding a match result between the added deck and one of the decks included in the second deck group.

Further, one aspect of the present invention is a game using decks including a plurality of game elements, in which a first deck group and a second deck group are played against each other. A game processing method comprising: determining a result of a match between a first deck included in the first deck group and a second deck included in the second deck group a first determining step, an additional step of adding a predetermined game element to a deck other than the first deck in the first deck group based on the result of the battle in the first determining step, and the predetermined game The game processing method includes a deck to which an element is added and a second decision step of deciding the result of a battle with one of the decks included in the second deck group.

Further, one aspect of the present invention is a game using decks including a plurality of game elements, and is a game device that executes processing of the game in which a first deck group and a second deck group compete against each other. a first decision unit that decides the result of a battle between a first deck among the decks included in the first deck group and a second deck among the decks included in the second deck group; an adding unit that adds a predetermined game element to a deck other than the first deck in the first deck group based on the result of the battle by the first determining unit; and a deck to which the predetermined game element is added. , and a second decision unit that decides the result of a battle with any one of the decks included in the second deck group.

Explanatory drawing explaining the outline|summary 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. FIG. 7 is a diagram showing an example of the flow of one turn in the battle process according to the first embodiment; 1 is a block diagram showing an example of the configuration of a game system according to a first embodiment; FIG. 4 is a diagram showing an example of the hardware configuration of a user terminal according to the first embodiment; FIG. The figure which shows an example of the hardware constitutions of the game server which concerns on 1st Embodiment. FIG. 2 is a block diagram showing an example of functional configurations of a user terminal and a game server according to the first embodiment; FIG. 4 is a diagram showing an example of card data according to the first embodiment; FIG. FIG. 4 is a diagram showing an example of deck data according to the first embodiment; FIG. 5 is a diagram showing an example of competition situation management data according to the first embodiment; 4 is a flowchart showing an example of battle processing according to the first embodiment; 4 is a flowchart showing an example of card addition processing according to the first embodiment; 10 is a flowchart showing an example of card addition processing according to the second embodiment; 14 is a flowchart showing an example of control processing regarding progress of a competitive game according to the third embodiment;

An embodiment of the present invention will be described below with reference to the drawings.
[First embodiment]
First, a first embodiment of the present invention will be described.

[Overview of the game]
First, an overview of an example of game processing executed by the game device according to the present embodiment will be described. The game according to this embodiment is a card game that is played using a plurality of cards prepared for the game. A card is an example of a game element that is a unit that can be selected or operated by the user in the game, and is visually displayed as one element on the game screen. For example, the card is a character card representing a character such as a person, monster, animal, object (for example, vehicle) appearing in the game. The game elements are not limited to cards, and may be medals, figures representing the characters themselves, or the like.

In this card game, a bundle of cards set in advance or a bundle of cards that is a combination of some or all of the cards possessed by the user is prepared as a deck, and the cards included in this deck are used. to play against your opponent. For example, the user can select a card from among the cards owned by the user and set it in the deck. A plurality of decks may be set, and a deck selected from the set decks may be used for battle. Also, the match is a 3-on-3 team match. In each match, the play progresses in a turn-based manner, in which each of the competing users uses the deck and alternately selects cards included in the deck and selects commands for exerting the abilities of the cards. In addition, below, the user who plays a game is also called a player.

FIG. 1 is an explanatory diagram illustrating an overview of the game according to this embodiment. The example shown in this figure is an example of a 3-on-3 team battle between a team α consisting of players A, B, and C and a team β consisting of players D, E, and F. showing. The first round is a battle between player A and player D, who will be the vanguard. The second round is a battle between player B and player E, who are mid-ranking players. The third round is a battle between player C and player F, who will be captains. In this battle game, a predetermined card can be added to the deck of one team based on the result of the battle.

For example, in the first round, player A of team α uses deck α1 and player D of team β uses deck β1 to compete against each other. In this battle, if player A is defeated and player D wins, player A on the losing side will take one card included in deck α1 used in the battle, and the next battle (second round) ally (team α ) to player B. For example, player A selects an arbitrary card (for example, a powerful card that works favorably in the match) from among the cards included in deck α1 used in the match in the first round, and uses the selected card in the second match. It can be added to deck α2 used by player B.

In the second round, player B of team α will play against player E of team β with cards added by player A added to deck α2. Player E of team β uses the deck β1 used in the first round as it is. In this way, the losing team can pass one card to the next match, so that the next match can be started with an advantage. In addition, in the second round, the player who lost in the first round goes first (starting with the turn of the player who lost). Also, normally, a restriction such as not being able to attack is set in the first turn (first turn) of the first attack, but the restriction is lifted in the first turn after the second round. In this way, in the next match, the losing team will be the first to attack, and restrictions such as not being able to attack on the first turn of the first attack will be lifted. more likely to be

In the second round, if the team β side loses this time, the player E on the losing side selects one card from among the cards included in the deck β1 used in the match to hand over to the player F, and the selected card can be added to deck β2 used by player F in the third round. In the third round, player F of team β plays against player C of team α with the cards added by player E added to deck β2. The deck used by player C of team α is the same deck α2 used in the second round. As a result, in the third round, the team β on the losing side is more likely to advance in the next match with an advantage.

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

Also, usually, there is a limit to the number of powerful cards that can be set in the deck at the same time, but when adding a powerful card to the deck of the defeated side, the limit is lifted. Therefore, it is possible to play with a powerful deck that cannot normally be realized due to this restriction.

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 for each team may be played by the same user. good too. Also, some players may be controlled by a computer rather than played by a user.

Next, a battle method of the battle game will be described. As described above, this card game is a turn-based competitive game in which the players of team α and the players of team β alternately take turns, and each player selects cards and commands on his or her own turn. make a choice. FIG. 2 is a diagram showing an example of a game screen of the card game according to this embodiment. The illustrated game screen G10 is an example of a game screen when playing against each other, and is here assumed to be a game screen played by the players of team α. An area G11 in the lower half of the game screen G10 is an area where cards included in decks used by players on the team α side are displayed. On the other hand, the upper half area G12 is an area where the cards included in the decks used by the players on the team β side are displayed.

The area G11 includes an area PAT where the hands of the players on the side of team α are arranged (hereinafter referred to as "hand area PAT") and an area PAB for the "field" of the players on the team α side (hereinafter referred to as "field PAB"). ). Similarly, the area G12 includes an area PBT (hereinafter referred to as "hand area PBT") where the hands of the players on the team β side are arranged, and an area PBB (hereinafter referred to as "field PBB") for the "field" of the players on the team β side. The hand areas PAT and field PAB on the side of team α and the hand areas PBT and field PBB on the side of team β are displayed in a symmetrical relationship facing each other. Since the configuration includes the same hand area and 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 random order and arranged as a deck on the field PAB. Specifically, the deck is arranged in area PA1 (hereinafter referred to as "deck area PA1") within field PAB. Next, in the player's own 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 placed face up so that the surface on which the card type and parameters are written can be visually recognized. On the other hand, the cards placed in the hand area PBT of the opponent (team β) are placed face down so that the player cannot visually recognize the front side of the card. Also, from the second turn onwards, each time it is your turn, you can draw one card from the deck and use it as your hand.

The player selects one of the cards (hand) placed in his/her own hand area PAT and puts it on the field PAB to activate the effect of that card, or put it on the field PAB in advance. A battle game progresses by comparing the strength of the placed cards and the cards on the opponent's field PBB. Each of the competing players has a predetermined life point (LP: 8000, for example) at first. Whoever reaches 0 LP wins.

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

Depending on the type of card, the place where it can be placed in your own field PAB by "summoning" is determined. Area PA2 is a place where monster cards can be placed (hereinafter referred to as "monster area PA2"). This monster area PA2 has three areas PA2(1), PA2(2), and PA2(3) in which one monster card can be placed, and up to three monster cards can be placed at the same time. In the illustrated example, monster cards are arranged only in the area PA2(2) among the areas PA2(1), PA2(2), and PA2(3). Area PA3 is a place where magic cards and trap cards 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) where one magic card or one trap card can be placed. A maximum of three cards can be placed at the same time. In the illustrated example, out of the magic/trap areas PA3(1), PA3(2), and PA3(3), only the magic/trap area PA3(3) has magic cards or trap cards. The area PA4 is a place where monster cards destroyed by "attacks" and used magic cards and trap cards are placed (hereinafter referred to as "cemetery area PA4"). Area PA5 is a place where cards that can be "special summoned" to be summoned by a special method are arranged (hereinafter referred to as "extra area PA5").

Next, each card will be explained. Monster cards have parameters such as offensive strength to be referred to when executing processing based on the "attack" command described later, and defensive strength to be referenced when the opponent executes processing based on the "attack" command. . Also, monster cards include monster cards that have an effect that allows the battle to proceed favorably by executing processing based on a "monster effect" command described later, and monster cards that do not have this effect.

Magic/Trap Cards can be used to execute specific actions, limit the opponent's actions, or change card parameters by executing actions based on the "Magic/Trap" commands described below. to produce an "effect" such as These have various effects and execution conditions 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 your opponent's commands. Examples of execution conditions include the difference in LP between yourself and your opponent, the number of monster cards on the field, and the like.

Next, commands will be described. Types of commands include "summon", "offense and defense change", "magic/trap", "monster effect", "special summon", and "attack".
A "summon" command is a command relating to the process of placing a specific card on the field. By executing the process based on the "summon" command, the selected monster card or the monster card to be selected from now on is placed on the field PAB. It should be noted that, when arranging, there are cases where it is possible to select the orientation of arrangement such as vertical, horizontal, front, and back. For example, a monster card 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 the opponent. Cards placed face down are invisible to the opponent. For example, placing a monster card face up on the field is also called "face summoning", and placing it face down is also called "face down summoning".

The "offense/defense change" command is a command for changing the orientation (vertical, horizontal, face up, face down, etc.) of monster cards present on the field. Execution of the process based on the "offense/defense change" command changes the orientation of the selected monster card or the monster card to be selected from now on when it is placed on the field PAB.
A "magic/trap" command is a command that activates an effect associated with a magic/trap card. "Activating an effect" means "executing the action associated with the effect". Execution of processing based on the "Spell/Trap" command activates the effect associated with the selected Spell/Trap Card or the Spell/Trap Card to be selected from now on.
A "monster effect" command is a command for activating a predetermined effect associated with a monster card having an effect. By executing processing based on the "monster effect" command, a predetermined effect associated with the selected monster card or the monster card to be selected from now on is activated.

The "special summon" command is a command that can be performed when different execution conditions (conditions associated with cards) are satisfied for face-up summoning and face-down summoning, and is a command that places a monster card on the field. .
An "attack" command is a command for attacking an opponent with a monster card. By executing the process based on the "attack" command, the selected monster card or the monster card to be selected from now on attacks the opponent.

Each of these commands has an execution enablement condition under which a process based on the command can be executed according to the game situation. The game situation refers to which team's turn it is during game play, the LP of each team's player, the number of cards in hand, the number of remaining cards in the deck, the number of monster cards in the field, and the monster cards in the graveyard. , the current "phase" in the turn, the elapsed time since the start of the turn, the elapsed time since the command can be selected, etc. A "phase" is a processing division within 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 progresses in the order of phases (1) to (6) shown in FIG.

(1) Start Phase: At the start of a turn, a process of drawing cards from the deck is performed.
(2) Preparation Phase: Effects that are automatically generated at this timing are processed.
(3) Main Phase 1: The player selects cards and commands, and processes related to the activation of effects such as "summoning" monster cards, "magic/trap", and "monster effects" are performed.
(4) Battle phase: A battle phase is started by a player's operation of performing a battle, an opponent is attacked using cards placed on the field, and the result of the attack is processed. If no battle is performed, this battle phase is not performed, and the following (6) end phase is proceeded to.
(5) Main Phase 2: The same processing as Main Phase 1 is performed only when the Battle Phase of (4) is performed. Note that this phase may be omitted.
(6) End Phase: Turn end processing is performed. After this, it will shift to the opponent's turn.

For example, commands such as "summon" and "offense/defense change" 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, conditions for executing each command are also determined by game situations other than phases. For example, a "summon" command can be executed when there is a monster card in the hand area PAT, and cannot be executed when there is none. The "offense and defense change" command can be executed when there is a monster card in the field PAB, and cannot be executed when there is no monster card. The "monster effect" command can be executed when a monster card with the effect is in the hand area PAT or the deck or graveyard of the field PAB, and cannot be executed when there is none. The "magic/trap" command can be executed when there is a magic/trap card in the hand area PAT or field PAB, and cannot be executed when there is none. The "Special Summon" command can be executed when there is a monster card corresponding to the "Special Summon" condition that cannot be summoned by normal methods in the hand area PAT or field PAB (area PA5), and cannot be executed if there is none. is. The "attack" command can be executed when there is a monster card in the field PAB, and cannot be executed when there is none. Also, the "attack" command can be executed only once per turn for each monster card. Note that the conditions under which processing based on these commands can be executed are just examples, and various conditions may be determined depending on the type of each card, the size of the LP with the opponent, which turn it is, etc. .

Next, a description will be given of how the player selects commands and cards. The player can select a command by operating the command options displayed on the command selection screen on his or her turn. For example, command options in the main phase include "summon", "change attack/defense", "magic/trap", "monster effect", and "special summon". Also, 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 an "end turn" operator that functions as an operator for transitioning from the main phase or battle phase to the end phase. Icons and the like may also be displayed. Also, command options in the battle phase include “attack” and the like.

When the player selects a command that involves selection of a card, the card selection screen that displays options of cards that can be selected by that command is displayed, and a card can be selected. Alternatively, options for selectable commands may be displayed by selecting a card first.

〔System configuration〕
Next, an overview of the system configuration of the game system 1 according to this embodiment will be described.
FIG. 4 is a block diagram showing an example of the configuration of the game system 1 according to this embodiment. The game system 1 comprises a plurality of user terminals 10 (10-1, 10-2, 10-3, . connected through

The user terminal 10 executes game processing based on a 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 smart phone or a feature phone, a game machine, or the like. In this embodiment, it is assumed that the user terminal 10 is a smart phone.

For example, when Player A, Player B, Player C, Player D, Player E, and Player F shown in FIG. while playing card games. At this time, each player can play the same battle game via the game server 30 on each user terminal 10 .

The game server 30 is a server device that provides games executable on the user terminal 10 . For example, the game server 30 provides a game program for executing game processing in the user terminal 10 so that it can be downloaded from the user terminal 10 . Note that the game program downloaded by the user terminal 10 may be stored not only in the game server 30 but also in another downloadable server device.

The game server 30 also executes server-side processing 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 performs game processing (for example, battle game processing) based on the acquired information. to run. 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 information to the user terminal 10 as necessary.

FIG. 5 is a diagram showing an example of the hardware configuration of the user terminal 10 according to this 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 a game server 30 connected via a communication network NW. , and other devices through the communication unit 12 . These components are communicably connected to each other via a bus or the like. The CPU 11 executes various programs stored in the storage section 15 and controls each section of the user terminal 10 .

The communication unit 12 is a device that performs communication compatible with communication standards of a communication network NW, such as a wireless LAN (Local Area Network), a wired LAN, and mobile communication (LTE, etc.), in which the user terminal 10 and the game server 30 can communicate. is.
The input unit 13 is a device capable of receiving interactive information during game execution. Interactive information is, for example, operation information according to the user's operation on the input unit 13 . For example, the input unit 13 is configured integrally with the display as a touch panel. The input unit 13 outputs to the CPU 11 operation information input according to the user's operation. The input unit 13 may be a physical device for mechanical operation such as a button, keyboard, lever, etc., a pointing device for GUI (mouse or touch panel), a recognition device for voice or gesture (microphone, camera), or the like.
The display unit 14 is a display that displays information such as images and texts, and includes, for example, a liquid crystal display panel, an organic EL (Electro Luminescence) display panel, and the like. Note that the display unit 14 may be configured separately 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, HDD (Hard Disk Drive), SSD (Solid State Drive), EEPROM (Electrically Erasable Programmable Read-Only Memory), ROM (Read-Only Memory), RAM (Random Access Memory), etc. It stores various information, images, programs (including game programs) and the like processed by the user terminal 10 . Note that the storage unit 15 is not limited to being built in the user terminal 10, and may be an external storage device connected via a digital input/output port such as a USB. The user terminal 10 may also include a speaker, an audio output terminal, a camera, a gyro sensor, a GPS (Global Positioning System) reception module, and the like (not shown).

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

The communication unit 32 is a device that performs communication conforming to the communication standard of the communication network NW such as wireless LAN, wired LAN, mobile communication (such as LTE), etc., with which the user terminal 10 and the game server 30 can communicate.
The input unit 33 includes physical devices such as buttons, keyboards, and levers that are mechanically operated, GUI pointing devices (mouse and touch panel), voice and gesture recognition devices (microphone, camera), and the like.

The storage unit 35 includes, for example, an HDD, an EEPROM, a RAM, etc., and stores game programs, application programs, various setting information and history information necessary for the game, and the like. Note that the storage unit 35 is not limited to being built in the game server 30, and may be an external storage device connected via a digital input/output port such as a USB. 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. Also, the game server 30 may be configured including a hardware configuration such as a display unit, a speaker, and an audio output terminal (not shown).

[Functional configuration]
Next, functional configurations of the user terminal 10 and the game server 30 included in the game system 1 will be described with reference to FIG. 7 . FIG. 7 is a block diagram showing an example of functional configurations of the user terminal 10 and the game server 30 according to this 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 terminal-side game program stored in the storage unit 15 . The game control unit 110 executes game processing according to the user's operation on the input unit 13 . For example, the game control unit 110 executes the above-described battle game processing, and causes the display unit 14 to display various game screens (eg, see FIG. 2) corresponding to the battle game processing. The game control section 110 includes an input reception section 111 , a deck processing section 112 , a data processing section 113 and a display control section 114 .

The input reception unit 111 receives a user's operation via the input unit 13 . For example, the input reception unit 111 acquires operation information input to the input unit 13 according to user's operation.
The deck processing unit 112 performs processing for arranging 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 exchanges various data necessary for game processing with the game server 30 via the communication unit 12 . For example, when the deck processing unit 112 changes the placement of cards, the data processing unit 113 transmits the placement information to the game server 30 . Further, based on the operation information acquired by the input reception unit 111, the data processing unit 113 transmits information based on the selected card and command to the game server 30 when an operation for selecting a card or selecting a command is performed. Send to The data processing unit 113 also acquires card information, battle result information, deck information, opponent information, and the like from the game server 30 as necessary.
The display control unit 114 controls 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 section 310 controls each section of the game server 30 . The storage unit 35 also includes a user data storage unit 351 , a card data storage unit 352 , a possessed card data storage unit 353 , a deck data storage unit 354 and a game situation storage unit 355 .

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

The card data storage unit 352 stores data relating to a plurality of cards prepared for 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. As shown in FIG. The card data table TBL301 stores card ID, card name, card image, card type, offensive power, defensive power, attribute, effect type, level, card text, etc. 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 the image file or link information to the file is stored. The card type stores information indicating the card type ("monster", "magic", "trap", etc.). The offensive power and defensive power store information indicating the offensive power and defensive power of the monster card. The attribute stores information (flame, darkness, light, earth, etc.) indicating the type (characteristic) of the monster of the monster card. The effect type stores the type of effect for a card with an effect, and stores information to that effect for a card without an effect. The level is the level of the monster on the monster card. The card text stores text information written on the card icon.

Possessed card data storage unit 353 stores card data (possessed card data) possessed by each user. Specifically, possessed card data storage unit 353 stores, for each user, possessed card data in which user identification information (for example, user ID) is associated with the card ID of the card possessed by the user. be.

The deck data storage unit 354 stores deck setting data and battle deck data. The deck setting data is data for managing decks in which cards possessed by each user are set. For example, the deck setting data stores a user ID, deck identification information (for example, deck ID), and card IDs of cards set in the deck in association with each other. For example, deck setting data for each of the decks α1, α2, α3, β1, β2, and β3 shown in FIG. 1 is stored. On the other hand, the battle deck data is data for managing the arrangement of cards during a battle, and includes information such as the arrangement of cards in decks used by each user as a player in battle play. The arrangement state of the cards means the place where the cards are arranged and the orientation of the arrangement (vertical, horizontal, 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, which includes information such as the arrangement of cards set in deck α1, and the arrangement of cards set in deck β1, etc. During the battle deck data containing the information is generated and updated at any time during the battle. It should be noted that the arrangement state of the cards is a state in which the cards are arranged by the user's operation. That is, the deck data storage unit 354 manages the state (operation state) operated by the user.

FIG. 9 is a diagram showing an example of data of the battle deck data table TBL302 stored in the deck data storage unit 354. As shown in FIG. Area ID, card ID, state 1, state 2, etc. are stored as deck data in association with each other in the battle deck data table TBL302. The area ID is identification information that can identify the location where the card is placed. For example, the area ID is 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, etc. shown in FIG. (For example, if it is a hand, the position in the hand area PAT, if it is a deck, it is stacked, and if it is a monster area, it is the right, center, and left positions). Different area IDs are set for the places and positions of . The card ID stores the card ID of the card placed at the location indicated by each area ID. State 1 and state 2 are information indicating the orientation of the card arrangement. State 1 stores information indicating whether the card is facing up or down, and state 2 stores information indicating whether the card is facing vertically or horizontally. be done.

The game situation storage unit 355 stores battle situation management data for managing the progress of the game in progress. FIG. 10 is a diagram showing an example of data of the competition situation management table TBL303 stored in the game situation storage unit 355. As shown in FIG. The competition situation management table TBL303 contains, as competition situation management data, identification information (team IDs or team names) for identifying competing teams and identification information (player IDs or team names) for identifying players of each team. player name, etc.), identification information (user ID or user name, etc.) for identifying a user who plays as each player, and each LP (in the illustrated example, player A's LP is 4000, player D's LP is 3000), whether it is player A's turn or player D's turn ("Player A's turn" in the example shown), the phase being executed (the main phase in the example shown), the turn being started A turn elapsed time (15 seconds in the illustrated example) that has elapsed since the current time is stored.

Returning to FIG. 7, the server control unit 310 executes 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 addition 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. For example, when acquiring 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, Executes battle processing based on the arrangement 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 match processing unit 311 determines the result of the match, with the team (player) whose LP becomes 0 first in the match situation management data loses and the other team (player) wins.

Based on the result of the match determined by the match processing unit 311, the card adding unit 312 selects decks other than the deck used in the match among a plurality of decks (deck group) included in one of the teams that have played against each other. add a given card to For example, the card adding unit 312 selects a deck other than the deck used by the player in the match among the plurality of decks included in the losing team (for example, the deck used by the player of the losing team in the next and subsequent matches). add a given card to the deck). For example, the card addition unit 312 selects a card selected by the player who played using the deck from among the cards included in the deck used in the match by the losing team as the predetermined card to be added. do. That is, the player on the losing side selects an arbitrary card (for example, a powerful card that works favorably in the battle) from his/her own deck, and adds it to the deck used by the players of his or her own team in the next battle. can do. The predetermined cards to be added are not limited to those selected by the player, and may be cards preset in the game. A preset card is, for example, one of the cards prepared in the game that is powerful and works favorably in a battle.

For example, using the example shown in FIG. 1, the functions of the battle processing unit 311 and the card addition unit 312 are described below.
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 β. do. The card addition unit 312 adds a predetermined card to a deck other than the deck α1 of the team α based on the result of the battle determined by the battle processing unit 311 . For example, when the result of the first round match is that the deck α1 on the team α side is defeated, the card adding unit 312 adds a predetermined card to the deck α2 used by the player B on the team α side in the second round match. do. The predetermined card to be added to the deck α2 is, for example, a card selected by the player A who played using the deck α1 from among 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, the place to add the card may be determined when fighting, or the place to add the card may be specified by the player. In that case, the card addition unit 312 updates the battle deck data table TBL302 (see FIG. 9) according to the location of the card 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 to add the predetermined card to the deck, and the predetermined card is placed in the hand area PAT at the start of the battle. update the battle deck data table TBL302 so that Note that the card adding unit 312 may add a predetermined card to a place other than the hand of the deck (for example, a field or a stock pile in the field).

Next, the battle processing unit 311 determines the result of the battle between the decks included in the team α to which the predetermined card is added and the decks included in the team β in the next and subsequent battles. For example, the match processing unit 311 determines, in the second round, deck α2 used by player B on team α to which a predetermined card was added, and deck β1 used in the first round on team β (player E played deck β1 in the second round). to determine the outcome of the match against

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 third round match when the result of the second round match is that the deck β1 on the team β side is defeated. do. Then, in the third round, the match processing unit 311 determines that the deck α2 used in the second round on the team α side (taken over and used by player C in the third round) and the player F on the team β side who added a predetermined card are Determines the result of the battle with deck β2 to be used.

The data processing unit 313 exchanges various data necessary for game processing with a plurality of user terminals 10 via the communication unit 32 . For example, when the data processing unit 313 acquires deck card placement information 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 placement information. Further, when the data processing unit 313 acquires information based on the selected card and command from the user terminal 10 , the data processing unit 313 transfers the acquired information to the battle processing unit 311 . The data processing unit 313 also transmits card information, battle result information, deck information, opponent information, and the like to the user terminal 10 as necessary.

[Operation of battle processing]
Next, the operation of the battle process executed by the CPU 31 of the game server 30 will be described.
FIG. 11 is a flowchart showing an example of battle processing according to this embodiment. Here, a 3-on-3 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 competing teams and determines the opponent (team) (step S100). Next, the CPU 31 sets the number of matches N to 1 (N=1) (step S102), and executes the first round match process (step S104). For example, the CPU 31 advances the battle process in order of each phase shown in FIG.

The CPU 31 performs the first-round match processing to determine the first-round match 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 β. A match result 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 between the player D and the deck β1 used by the player D on a turn basis. The management data is referred to, and the team (player) whose LP reaches 0 first loses, and the other team (player) wins. Here, as in the example shown in FIG. 1, it is assumed that team α (player A) has lost.

Next, the CPU 31 determines whether or not the number of battles N has reached 3 (N=3) (step S108). At this time, the number of battles N is 1 (N=1), so 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, CPU 31 adds a predetermined card to a deck other than the deck used in the match among the plurality of decks of one of the teams in the match based on the result of the match determined in step S106. For example, the CPU 31 selects a deck other than the deck used by the player in the current match (for example, the deck used by the player of the defeated team in the next and subsequent matches) among the plurality of decks of the defeated team. Add card. An example of this card addition processing will be described with reference to FIG.

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

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

Then, the CPU 31 adds the card selected as the predetermined card to the deck α2 to be used by the player B in the next second round match of the defeated team α. 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 B (step S1106).

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

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

Next, the CPU 31 determines whether or not the number of battles N has reached 3 (N=3) (step S108). At this time, the number of battles N is 2 (N=2), so 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 selects deck β2 to be used by player F in the next third-round match of the losing team β based on the result of the match determined in step S106. Adds the card selected as the predetermined card above. 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 matches N (N=N+1: step S112), returns to the process of step S104, and executes the third round match process.

The CPU 31 uses the deck α2 used in the second round of the team α side (in the third round, it is taken over and used by player C) and the player F of the team β side who added a predetermined card by the match processing of the third round. The result of the battle with 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 time, the number of times of competition N is 3 (N=3), so the CPU 31 determines that the number of times of competition N is 3 (N=3) (YES), and proceeds to the process of step S114.

In step S114, the CPU 31 notifies the user terminals 10 of the competing teams of the final result based on the result of the third round match.

[Summary of the first embodiment]
As described above, the game server 30 (an example of a game device) according to the present embodiment executes game processing using a deck including a plurality of cards (an example of game elements). 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) compete against each other. As an example, the game server 30 includes a deck α1 (an example of the first deck) used by player A among the decks included in the first team (eg, team α), and a second team (eg, 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. In addition, the game server 30 selects a deck other than the deck α1 used by the player A (eg, the deck used by the player B) of the first team (eg, the deck group of the team α) based on the determined match result. A predetermined card is added to α2). Then, the game server 30 conducts a second battle (for example, deck α2 used by player B) with a deck added with a predetermined card and one of the decks included in the second team (for example, team β) ( For example, the result of the second round) is determined.

As a result, the game server 30 can make the game more interesting because the result of the battle affects the content of the deck used in the next and subsequent battles in multiple battles using decks.

For example, if the result of the first match (eg, first round) is that deck α1 (an example of the first deck) is defeated, the game server 30 determines that deck α1 out of the first team (eg, team α) A predetermined card is added to a deck other than the deck (for example, deck α2).

As a result, in the game server 30, when multiple battles are held using decks, the side that lost the first battle can play by adding a predetermined card to the deck to be used in the next and subsequent battles. In the next and subsequent battles, the side that has played can start playing in a more advantageous state than before adding the predetermined card. Therefore, it is difficult for the game to develop in a one-sided manner such that only one side keeps winning, and the game can be highly entertaining.

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

As a result, the game server 30 adds the card selected by the player from the deck of the defeated side in the first battle to the deck used in the next and subsequent battles of the defeated side. You can start playing in an advantageous state in the match. For example, the player on the losing side can arbitrarily select a powerful card that exerts an advantageous effect in the battle from among the decks used and add it to the deck to be used in the next and subsequent battles. It is possible to increase the possibility that the side will win in the next and subsequent matches.

Note that the game server 30 may add a preset card as the predetermined card.

As a result, the game server 30 adds a preset card to the deck used in the next and subsequent matches of the side that lost the first match, so that the defeated side can play in an advantageous state in the next and subsequent matches. can start.

Also, the game server 30 determines, for example, the result of the battle 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 (eg, team β). That is, 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 β, the game server 30 selects the deck β1 of the winning team β when the team α loses. will be used in subsequent matches.

As a result, the game server 30 determines the deck to be used from the next time onwards (one deck is the same as the deck used in the first match) depending on the result of the first match. The game can be highly interesting.

[Second embodiment]
Next, a second embodiment of the invention will be described.
In the first embodiment, an example of adding a predetermined card to the deck to be used in the next match based on the result of the match has been described. good too.

For example, the card addition unit 312 may determine a predetermined number of cards to be added to the deck used in the second round based on the results of the first round match. For example, the card addition unit 312 adds fewer cards (eg, 1 card) when the difference between wins and losses is small, and increases the number of cards (eg, 1 card) when the difference between wins and losses is large. , 2 or 3). Note that the card addition unit 312 may determine the difference between the win and loss of the match result based on, for example, the difference in the player's LP when the win or loss is decided, or the player's (user's) level difference remaining. It may be judged based on the level difference of the cards or the remaining number of cards.

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

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

When 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 . CPU 31 selects the number of cards selected from deck α1 as the 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 of the losing team α. For example, the CPU 31 updates the deck data (see FIG. 9) of the deck α2 used by the player B, thereby adding the number of cards selected as the predetermined cards to the hand of the deck α2. (Step S1106A). Then, the process proceeds to step S112 in FIG.

In this way, the game server 30 may determine the predetermined number of cards based on the match result of the first match (eg, first round match).

As a result, for example, when the difference between winning and losing in the match result is large, the game server 30 increases the number of cards to be added to the deck used in the next and subsequent matches of the defeated side, thereby making the game server 30 lose by a large margin. The team can also increase the chances of winning the next and subsequent matches.

[Third embodiment]
Next, a third embodiment of the invention will be described. Here, control relating to the progress of the competitive game will be described. In the first embodiment, the winning team in one match takes over the deck used in the first match in the next match, and the losing team uses the new deck in the next match. However, instead of simply taking over the deck, the state of the field (arrangement of cards placed on the field) and the state of the hand (hand You may start the next battle by taking over part or all of the placement status of cards placed 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. In addition, the arrangement state of this card is managed by deck data stored in the deck data storage unit 354 . It should be noted that this card placement state can also be said to be an operation state operated by a player (user) in a battle.

For example, in the example shown in FIG. 1, in the second round, player B of team α plays against player E of team β with cards added by player A added to deck α2. E takes over and uses the state of operation of the player D on the deck β1 used in the first round (arrangement of cards placed in the field and hand, etc.) as it is. Also, as described in the first embodiment, in the second round, the player who lost in the first round goes first (starting with the turn of the losing player). Also, normally, on the first turn of the first attack (first turn), restrictions are set so that some of the operations related to the battle, such as not being able to attack, are not accepted, but from the second round onwards, the first turn This restriction will be lifted. In this way, in the next match, the losing team will go first, and restrictions such as not being able to attack on the first turn of the first match will be lifted. It will increase your chances of progressing.

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

In the battle process, the CPU 31 determines whether the battle is the first round or the second and subsequent rounds (step S200). If the CPU 31 determines that it is a first-round match, it decides by lottery whether to attack first or second (step S202), and proceeds to the process of step S206. On the other hand, when the CPU 31 determines that the match is the second round or later, it determines the player of the team that lost the previous match to go first (step S204), and proceeds to the process of step S210.

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

In this way, the game server 30, when executing the processing of the game in which team α and team β compete as in the example shown in FIG. ) and player D's operation on the cards included in deck β1 (an example of the second deck) of team β, the result of the battle between deck α1 and deck β1 is determined. do. In addition, in the second round, the game server 30 controls the player's operation on the cards included in the deck α2 (an example of the third deck) other than the deck α1 of the team α, and the player's operation on the cards included in the deck β1 of the team β. Based on the operation of E, the result of the battle between deck α2 and deck β1 is determined. Also, in the second round match, the cards included in the deck β1 are started taking over the state operated by the player D in the first round match. Note that the state of being operated by the player D (operation state) is, for example, the arrangement state of the cards (the place where the card is arranged, the orientation of the arrangement, etc.).

As a result, the game server 30 can take over the operation state of one of the decks used in one match (arrangement of cards placed in the field or hand, etc.) in the next match. Since each battle is a series of battles that are not clearly separated, the battles progress at a good tempo and the game can be highly entertaining. Note that at least a part of the state operated by the player D (for example, the arrangement state of game elements) may be inherited.

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

As a result, in the game server 30, the operating state of the deck of the winning side (arrangement state of cards placed in the field or hand, etc.) is inherited in the next battle, so even multiple battles are clearly separated. Since the series of battles are not repeated, the battles proceed at a good tempo, making it possible to make the game highly entertaining.

In addition, when the game server 30 executes the processing of a game in which a plurality of matches are played in a winning match, the game server 30 alternates between the players (for example, a player of the team α and a player of the team β) in each match. Make progress on a turn-based basis by performing operations related to battle on the turn of. In addition, the game server 30 restricts some of the operations related to the battle during the first turn of the first player in the first battle (first round). In addition, when the game server 30 decides the victory or defeat based on the result of the battle, the defeated side goes first in the next battle, and the above-mentioned restriction is not applied to the first turn of the first turn. In addition, there is a progress section that makes each match progress on a turn basis, a restriction section that restricts some of the operations related to the match, and a restriction section that prevents the first turn of the first player from performing the above restrictions. For example, the battle processing unit 311 is provided with each configuration as a control unit that performs control.

As a result, the game server 30, in multiple turn-based battles, allows the side that lost in one battle to go first in the next battle, and limits the normally set operation of the first side in the first turn (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 battle. Therefore, it is difficult for the game to develop in a one-sided manner such that only one side keeps winning, and the game can be highly entertaining.

Note that the number of turns in each battle may be limited. For example, one battle has a limit of the number of turns set in advance (for example, n times: n is a natural number). Proceed to the next match as a defeat. In addition, the game server 30 may regard both of them as a victory or a draw if no settlement is reached within n turns.

As a result, if the game server 30 does not reach a conclusion within a preset number of turns in each match, the game server 30 considers both players to be defeated (or victorious or drawn) and advances to the next match, thereby ensuring a good tempo. is progressed to make the game highly interesting.

It should be noted that, as the control of the battle game, the defeated side becomes the first to go first, and the restrictions such as not being able to attack in the first turn of the first attack are also lifted, and the battle game according to the present embodiment is controlled by this control. is not limited to

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

It should be noted that a predetermined card added to the deck to be used in the next and subsequent battles of the losing side may be restricted. For example, the predetermined cards may be only cards that satisfy predetermined conditions. Cards that meet the specified conditions are used cards, unused cards, cards placed in the hand, cards placed in the field, cards placed in the deck, cards of a specific type, A card predetermined for each character, a card designated in advance by the player who uses the deck before the battle, or a card designated by the opponent may be used.

Also, 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 the deck to be used in any battle after the next time. 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 the first round. Also, the defeated player may be allowed to select which deck to use in which match. Also, in the above embodiment, a 3-on-3 team game has been described as an example, but a 2-on-2 team game, or a 4-on-4 or more team game may be used.

Also, the deck used in the final battle may have a specification in which the above-described predetermined cards cannot be added. For example, in the example of the match up to the third round shown in FIG. A team may be prevented from adding a predetermined card to the deck used by the team in the third round. In other words, the general battle may be a battle of strength, in which even the defeated side in the previous battle does not add a predetermined card and uses only the cards originally set in the deck. In addition, it is not limited to the specification that only the final game cannot be added with the above-mentioned predetermined cards. can.

Also, in the above embodiment, an example has been described in which the win/loss of each match is determined when the value of one of the LPs becomes 0, but the method of determining the win/loss is not limited to this. For example, the victory or defeat of each match may be determined by the LP value being less than a predetermined threshold, or when the LP difference between each other is greater than a certain value, the one with the lower LP value is determined as the loser. Alternatively, a time limit may be set for the match, and the player with the lower LP value when the time limit is reached may be determined as the loser. Moreover, victory or defeat for each battle may be determined based on arbitrary parameters that fluctuate in the game, such as the number of attacks, the number of times attacked, the number of remaining cards, and the like, in addition to the LP value.

In the above embodiment, the winning team takes over only the deck for the next match. Also, the team on the winning side may use a new deck in the next match without taking over the deck from the previous match.

Also, 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 other methods. You may do so. For example, in subsequent matches, increase the initial LP value of the defeated side at the start of the match, increase the number of cards in the initial hand, or start the match with a set of magic/trap cards placed on the field. , Start the battle with monster cards placed, increase the number of cards drawn from the deck to the hand in one turn (increase draw), reduce the release (cards sent to the graveyard) required to activate the effect , the cost required to acquire cards may be reduced so that players can compete in an advantageous manner.

On the other hand, instead of or in addition to favoring the losing side, the winning side may be disadvantaged. As a disadvantageous element, for example, in the next and subsequent battles, the initial LP value of the winning side at the start of the battle will be reduced, the number of cards in the initial hand will be reduced, and the deck will be drawn from the deck to the hand in one turn. Decrease the number of cards (draw reduction), increase the release required to activate the effect (cards sent to the graveyard), increase the cost required to acquire the card, limit some restrictions during a specific turn (specific cards cannot be selected, specific commands cannot be selected, etc.).

Further, in the above embodiment, based on the result of the match, the defeated side has an advantage (or the winning side is disadvantaged) in the next and subsequent matches. It may be based on the result of the battle including factors other than winning or losing instead of winning or losing. For example, instead of simply winning or losing, the difference (for example, point difference) when the winning or losing is settled may be used. For example, only if the victory or defeat is decided by a one-sided large difference (for example, a difference that exceeds a preset threshold such as 100 points vs. 10 points), the defeated side will have an advantage in the next and subsequent matches (or may be at a disadvantage). Also, only when the victory or defeat is decided by reversal instead of simply winning or losing, the losing side may be given an advantage (or the winning side may be disadvantaged) in the next and subsequent matches. Also, instead of simply winning or losing, it may be based on the time or the number of turns spent until the victory or defeat is decided. For example, only when the winner is decided early (for example, within 3 turns), the losing side may be given an advantage (or the winning side may be disadvantaged) in the next and subsequent battles. In this way, the losing side may be given an advantage (or the winning side may be disadvantaged) in the next and subsequent matches based on the result of the match, not just the win or loss.

In the above-described embodiment, an example of a battle-based (combat-based) fighting game has been described, but the present invention is not limited to this. Any game in which players compete using game elements such as cards can be used in a baseball game or a soccer game. Other types of games such as games may also be used. Also, game elements are not limited to cards, and arbitrary game elements such as medals and figures representing characters themselves can be applied.

Note that the mode of use of the fighting game (card game) according to the present embodiment may be, for example, an online game held by a game organizer (operator). For example, an online game officially held by a game sponsor (operator) is provided from the game server 30, and participating users connect to the game server 30 from their 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 players participate in and play by playing. In addition, spectator users can also observe the game situation by connecting to the game server 30 from their own user terminals 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 card added to the deck of the defeated side, and does not notify the opposing team and the spectator user. Note that the game server 30 may notify the spectator user of the contents of the cards added to the deck of the losing side. Also, when used as a so-called "e-sports", it may be held at a predetermined venue (event venue, concert hall, game center, etc.) with participating users and spectator users gathered.

Also, a program for realizing the functions of the game control unit 110 or the server control unit 310 described above is recorded in a computer-readable recording medium, and the program recorded in this recording medium is read by the computer system and executed. Accordingly, processing as the game control unit 110 or the server control unit 310 may be performed. Here, "loading and executing the program recorded on the recording medium into the computer system" includes installing the program in the computer system. The "computer system" here includes hardware such as an OS and peripheral devices. Also, the "computer system" may include a plurality of computer devices connected via a network including communication lines such as the Internet, WAN, LAN, and dedicated lines. The term "computer-readable recording medium" refers to portable media such as flexible discs, magneto-optical discs, ROMs and CD-ROMs, and storage devices such as hard discs incorporated in computer systems. Thus, the recording medium storing the program may be a non-transitory recording medium such as a CD-ROM. Recording media also include internal or external recording media accessible from the distribution server for distributing the program. The program code stored in the recording medium of the distribution server may be different from the program code in a format executable by the terminal device. That is, as long as it can be downloaded from the distribution server and installed in a form that can be executed on the terminal device, the form stored in the distribution server does not matter. It should be noted that the program may be divided into a plurality of parts, and the divided programs may be downloaded at different timings and then merged in the terminal device, or the distribution servers that distribute the divided programs may be different. In addition, "computer-readable recording medium" is a volatile memory (RAM) inside a computer system that acts as a server or client when the program is transmitted via a network, and retains the program for a certain period of time. It shall also include things. Further, the program may be for realizing part of the functions described above. Further, it may be a so-called difference file (difference program) that can realize the above functions by combining with a program already recorded in the computer system.

Also, part or all of 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 functions described above may be individually processorized, or part or all of them may be integrated and processorized. Also, the method of circuit integration is not limited to LSI, but may be realized by a dedicated circuit or a general-purpose processor. In addition, when an integration circuit technology that replaces LSI appears due to advances in semiconductor technology, an integrated circuit based on this technology may be used.

In the above embodiment, the storage unit 35 of the game server 30 includes the user data storage unit 351, the card data storage unit 352, the possessed card data storage unit 353, the deck data storage unit 354, and the game situation storage unit 355. However, at least part of each storage unit provided in the storage unit 35 or at least part of the data stored in each storage unit is also stored in the storage unit 15 of the user terminal 10 may be stored. For example, among the data stored in the storage unit 35, data associated with each user (for example, each user's user data, possessed card data, deck data, competition situation management data, etc.) is stored in each user's user terminal. 10 may be stored in the storage unit 15 . That is, the game server 30 may store the data of all 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 trigger. Card data of a plurality of cards prepared for the game may also be stored in the storage unit 15 of the user terminal 10 .

Further, in the above embodiment, the game server 30 performs the battle process, but the user terminal 10 may perform the battle process. For example, when the processing of a game executed on the user terminal 10 is performed independently (standalone) on the user terminal 10, the game server described in the above embodiment may be 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 provided by the user terminal 10 .

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

(Appendix 1) A game program according to an aspect of the present invention is a game using a deck including a plurality of game elements (eg, cards), and includes a first deck group (eg, team α) and a second deck group (eg, team α). The first deck (eg, deck α1 used by player A) among the decks included in the first deck group (eg, deck α1 used by player A) and , a first determination step (S108) of determining the result of a match (for example, the first round) against a second deck (for example, deck β1 used by 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) of the first deck group based on the result of the battle in the first determination step; (S112); and a second determination step (S108) of determining the result of a battle (for example, a second round) between the deck to which the predetermined game element is added and one of the decks included in the second deck group; to run.

According to the configuration of Supplementary Note 1, in multiple battles using decks, the result of the battle affects the content of the decks used in the next and subsequent battles, so the game can be highly entertaining.

(Supplementary Note 2) Also, one aspect of the present invention is the game program according to Supplementary Note 1, wherein in the adding step, the result of the battle (for example, the first round) in the first determining step is the first deck ( For example, when the deck α1) is defeated, a predetermined game element is added to a deck other than the first deck (eg, deck α2) of the first deck group (eg, team α).

According to the configuration of Supplementary Note 2, the side that lost the first match can play the deck used in the next and subsequent matches with a predetermined game element added, so that the defeated side can play the predetermined game in the next and subsequent matches. You can start playing with a better advantage than before adding the element. Therefore, it is difficult for the game to develop in a one-sided manner such that only one side keeps winning, and the game can be highly entertaining.

In other words, when fighting multiple times, conventionally, if there is a difference in the strength of the deck and the strength of the deck, and the side that wins each time is the same, the development becomes one-sided and the player loses. Although there is a concern that the side may lose motivation to continue playing the game, the configuration of Supplementary Note 2 can solve this problem.

(Supplementary Note 3) Further, one aspect of the present invention is the game program according to Supplementary Note 1 or Supplementary Note 2, wherein the computer, out of the game elements included in the first deck (for example, deck α1), A step (S1124) of selecting the game element selected by the player (for example, player A) who played using the first deck as the predetermined game element is executed.

According to the configuration of appendix 3, in order to add the game element selected by the player from the deck of the defeated side in the first match to the deck used in the next and subsequent matches of the defeated side, the defeated side You can start playing in an advantageous state in subsequent battles. For example, the player on the losing side can arbitrarily select powerful game elements from the decks used that will have an advantageous effect in the match, and add them to the deck to be used in the next match. It is possible to increase the possibility that the side that has done so will win in the next and subsequent matches.

(Supplementary Note 4) Also, one aspect of the present invention is the game program according to Supplementary Note 1 or Supplementary Note 2, wherein in the adding step, a preset game element is added as the predetermined game element.

According to the configuration of Supplementary Note 4, since the preset game element is added to the deck used in the next and subsequent matches of the side that lost the first match, the defeated side plays in an advantageous state in the next and subsequent matches. can be started.

(Supplementary Note 5) Further, one aspect of the present invention is the game program according to any one of Supplementary Notes 1 to 4, wherein the computer determines the predetermined determining the number of game elements (S1120A).

According to the configuration of Supplementary Note 5, for example, when the difference between winning and losing in the match result is large, by increasing the number of game elements added to the deck used in the next and subsequent matches of the defeated side, the player loses by a large margin. Even a team that has been defeated can increase the chances of winning in the next and subsequent matches.

(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 determining step includes 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 Supplementary Note 6, the deck to be used from the next time onwards is determined by the result of one match (one deck is the same deck as the one used in the first match), which improves strategy, The game can be highly interesting.

(Appendix 7) A game processing method according to an aspect of the present invention is a game using a deck including a plurality of game elements (eg, cards), in which a first deck group (eg, team α) and a second deck group (eg, team α) A game processing method executed by a computer that executes processing of the game in which a deck group (for example, team β) of the , the deck α1 used by the player A) and the second deck (eg, the deck β1 used by the player D) among the decks included in the second deck group (for example, the result of the match (for example, the first round). A first decision step (S108) for deciding, and 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 decision step an additional step (S112) of adding a predetermined game element to the second deck group, and the result of a match (for example, a second round) between the deck to which the predetermined game element is added and one of the decks included in the second deck group. and a second determining step (S108) of determining.

(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 (e.g., cards), and a first deck group (e.g., A game device for executing the processing of the game in which a team α) and a second deck group (for example, team β) compete, wherein the first deck (for example, , the deck α1 used by the player A) and the second deck (eg, the deck β1 used by the player D) among the decks included in the second deck group (for example, the result of the match (for example, the first round). A first decision unit (311) that decides, and a deck other than the first deck (for example, deck α2 used by player B) among the first deck group based on the result of the battle by the first decision unit an addition unit (312) for adding a predetermined game element to the second deck group, and the result of a match (for example, the second round) between the deck to which the predetermined game element is added and one of the decks included in the second deck group. and a second decision unit (311) for deciding.

According to the configurations of Supplementary Notes 7 and Supplementary Notes 8, in multiple battles using decks, the result of the battle affects the content of the decks used in subsequent battles, so the game can be highly entertaining.

Moreover, the present invention can also be grasped as follows from the above description.

(Appendix 9) Further, a game program according to an aspect of the present invention is a game using a deck including a plurality of game elements (eg, cards), in which a first deck group (eg, team α) and a first deck group (eg, team α) are used. A user (for example, a user ( For example, based on the operation of player A) and the operation of the user (eg, player D) on game elements included in the second deck (eg, deck β1) of the second deck group, the first A first determination step (S108) of determining the result of the battle between the deck and the second deck; The third deck and the A second decision step (S108) of determining the result of the match with the second deck is executed, and in the match in the second decision step, the game elements included in the second deck are determined in the first decision step. It is started by taking over the state operated by the user in the battle. Note that the user-operated state (operation state) is, for example, the arrangement state of game elements (arrangement location, orientation of arrangement, etc.).

According to the configuration of Supplementary Note 9, the operational state of one of the decks used in one match (arrangement of game elements placed in the field or hand, etc.) is carried over to the next match. Since the series of battles are not clearly separated even if the battles are played a plurality of times, the battles progress at a good tempo and the game can be highly entertaining. Note that at least a part of the state operated by the user (for example, the arrangement state of the game elements) may be inherited.

(Supplementary Note 10) Further, one aspect of the present invention is the game program according to Supplementary Note 9, wherein in the second determination step, the result of the battle in the first determination step is the defeat of the first deck and the When two decks win, the result of the battle between the third deck and the second deck is determined.

According to the configuration of Supplementary Note 10, the operating state of the deck of the winning side (arrangement of cards placed in the field and hand, etc.) is inherited in the next battle, so even multiple battles are clearly separated. Since the series of battles are not repeated, the battles proceed at a good tempo, making it possible to make the game highly entertaining.

(Appendix 11) Further, a game processing method according to an aspect of the present invention is a game using a deck including a plurality of game elements (eg, cards), in which a first deck group (eg, team α) and A game processing method executed by a computer that executes processing of the game in which a second deck group (e.g., team β) competes, wherein the first deck (e.g., deck A user's (for example, player A) operation on game elements included in α1), and a user (for example, player D) operation on game elements included in the second deck (for example, deck β1) of the second deck group. a first decision step (S108) of deciding the result of the battle between the first deck and the second deck, and a third decision step (S108) of the first deck group other than the first deck A user (eg, player B) operation on game elements included in a deck (eg, deck α2) and a user (eg, player E) operation on game elements included in the second deck (eg, deck β1). and a second determination step (S108) of determining the result of the battle between the third deck and the second deck based on the game included in the second deck in the battle in the second determination step 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 (eg, cards), and the first deck group (eg, Included in the first deck (for example, deck α1) of the first deck group in the computer that executes the processing of the game in which team α) and the second deck group (for example, team β) play against each other Based on the user's (for example, player A) operation on the game element and the user's (for example, player D) operation on the game element included in the second deck (for example, deck β1) of the second deck group a first decision unit (311) that decides the result of the battle between the first deck and the second deck; and a third deck (for example, deck α2) based on the user's (eg, player B) operation on the game elements included in the second deck (eg, deck β1) and the user's (eg, player E)'s operation on the game elements included in the second deck (eg, deck β1). a second decision unit (311) that decides the result of the match between the third deck and the second deck, and in the match in the second decision step, the game elements included in the second deck It is started by taking over the state operated by the user in the battle in the 1 determination step.

According to the configuration of appendix 11 and appendix 12, the operation state of one of the decks used in one match (arrangement of cards placed in the field or hand, etc.) is carried over to the next match. Therefore, even if the game is played a plurality of times, it becomes a series of battles that are not clearly separated, so the battles progress at a good tempo, and the game can be highly entertaining.

(Appendix 13) Further, a game program according to an aspect of the present invention causes a computer that executes processing of a game in which a plurality of matches are played in a winning match, each match being played between opponents (for example, players of team α). and a player of team β) alternately perform operations related to the match on their own turns (S106), and in the first turn of the first match (first round), A step (S208) of restricting a part so that it is not accepted, and if the result of the battle determines the victory or defeat, in the next battle, the defeated side goes first, and the first turn does not apply the above-mentioned restriction. A step (S210) of controlling so as to be executed.

According to the configuration of Supplementary Note 13, in multiple turn-based battles, the side that loses in one battle becomes the first in the next battle, and the usually set operation restrictions on the first turn of the side (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 battle. Therefore, it is difficult for the game to develop in a one-sided manner such that only one side keeps winning, and the game can be highly entertaining.

In other words, when fighting multiple times, conventionally, if there is a difference in the strength of the deck and the strength of the deck, and the side that wins each time is the same, the development becomes one-sided and the player loses. Although there is a concern that the side may lose motivation to continue the game, this problem can be solved according to the configuration of Supplementary Note 13.

(Appendix 14) Further, one aspect of the present invention is the game program according to appendix 11, wherein the number of turns in each battle may be limited.

According to the configuration of Supplementary Note 14, if a conclusion cannot be reached within a preset number of turns in each match, both players are defeated (or won or drawn) and advanced to the next match, so that the match can be played at a good tempo. is progressed to make the game highly interesting.

(Appendix 15) Further, a game processing method according to an 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 matches are played in an elimination match, wherein each match is performed by: A step (S106) in which the opponents (for example, a player of team α and a player of team β) alternately perform operations related to the battle in their own turns, and a step (S106) of progressing in a first battle (first round). In the first turn, a step (S208) of restricting part of the above-described operations to be accepted, and when the result of the match determines the winner, in the next match, the defeated side goes first, and the first side goes first. and a step (S210) of controlling so as not to apply the restriction in the first turn.

(Appendix 16) In addition, the game device (30, 10) according to one aspect of the present invention allows a computer that executes processing of a game in which a plurality of matches are played in an elimination match, each match being played between opponents (for example, , a player of team α and a player of team β) alternately perform operations related to the battle on their own turn (311), in which the progress is made on a turn-based basis, and in the first turn of the first battle (first round), , a restriction unit (311) that restricts some of the above operations from being accepted, and when the result of the match determines the winner, in the next match, the defeated side goes first, and the first turn of the first attack is decided. and a control unit (311) so as not to perform the restriction in.

According to the configuration of appendices 15 and 16, in multiple turn-based battles, the side that loses in one battle becomes the first in the next battle, and the usually set operational restrictions on the first turn are imposed. (For example, restrictions such as not being able to attack) are lifted, so the defeated side can start playing in an advantageous state in the next battle. Therefore, it is difficult for the game to develop in a one-sided manner such that only one side keeps winning, and the game can be highly entertaining.

1 game system, 10 user terminal, 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 possessed card data storage unit 354 deck data storage unit 355 game situation storage unit

Claims (8)

A game using decks including a plurality of game elements, in which one of the decks included in the first deck group and one of the decks included in the second deck group A computer that executes the processing of the game that is played at least three times or more,
a first deck for determining the result of a match between a first deck included in the first deck group and a second deck included in the second deck group in a first match; a decision step;
Based on the result of the battle in the first determination step, the first deck is selected from among the first decks other than the first deck to be used in the second or later battle , and the first deck is used . an additional step of adding a predetermined game element to a deck for use in a match selected by a player who played
a second determination step of determining a 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 in the match selected from the second time onward;
A game program for executing In the additional step,
If the result of the battle in the first determination step is that the first deck is defeated, a predetermined deck other than the first deck to be used in the second or later battle selected from the first deck group add game elements of
The game program according to claim 1. to the computer;
a step of selecting, as the predetermined game element, a game element selected by a player who played using the first deck from among the game elements included in the first deck;
3. The game program according to claim 1 or 2, causing the execution of the game program. In the additional step,
adding a preset game element as the predetermined game element;
3. The game program according to claim 1 or 2. to the computer;
determining the number of the predetermined game elements based on the result of the match in the first determining step;
5. The game program according to any one of claims 1 to 4, causing the execution of the game program. The second determination step determines a result of a battle between the deck to which the predetermined game element is added and the second deck included in the second deck group.
A game program according to any one of claims 1 to 5. A game using decks including a plurality of game elements, in which one of the decks included in the first deck group and one of the decks included in the second deck group A game processing method executed by a computer that executes processing of the game in which players compete at least three times or more,
a first deck for determining the result of a match between a first deck included in the first deck group and a second deck included in the second deck group in a first match; a decision step;
Based on the result of the battle in the first determination step, the first deck is selected from among the first decks other than the first deck to be used in the second or later battle , and the first deck is used . an additional step of adding a predetermined game element to a deck for use in a match selected by a player who played
a second determination step of determining a 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 in the match selected from the second time onward;
game processing methods, including; A game using decks including a plurality of game elements, in which one of the decks included in the first deck group and one of the decks included in the second deck group A game device that executes the processing of the game in which the player competes at least three times or more,
a first deck for determining the result of a match between a first deck included in the first deck group and a second deck included in the second deck group in a first match; a decision unit;
Based on the result of the battle by the first determining unit , a deck other than the first deck is selected from among the first decks for the second and subsequent battles, and the first deck is used. an addition unit that adds a predetermined game element to a deck used in a battle selected by a player who played the game ;
a second determination unit that determines 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 in the match selected from the second time onward;
game device.

Images