JP5814901B2 - GAME DEVICE, PROGRAM, AND GAME METHOD - Google Patents

Description

  The present invention relates to a computer game.

  A game that applies an object (for example, a character) given to a player to an event such as a battle has been proposed. For example, Non-Patent Document 1 discloses an SNS game in which a desired combination of characters is selected from a plurality of characters owned by a player and battles with characters of other players. Each character is set with an ability value such as attack power and defense power, and the attack power of each character selected by the attacking player is compared with the defense power of each character selected by the defending player. Will be decided.

“Social Game General Information Magazine Application STYLE Vol.2”, East Press, Inc., April 1, 2011, p.26-p.29

  Characters applied to events such as battles can be arbitrarily selected by each player, so in most cases the veteran will win if the veteran who owns many powerful characters and the original beginner who started the game To do. Therefore, the randomness of winning and losing is low, and there is a possibility that the game is not interesting. In view of the above circumstances, an object of the present invention is to improve the interest (randomness of wins and losses) of a game in which an object given to a player is applied.

  Means employed by the present invention to solve the above problems will be described below. In order to facilitate understanding of the present invention, reference numerals in the drawings will be appended in parentheses for convenience in the following, but the present invention is not intended to be limited to the illustrated forms.

  One aspect of the present invention is a game device (14A, 14B) that provides a game using a basic object in which first game information (X) is set and an auxiliary object in which second game information (Y) is set. The grant processing units (52, 62) for granting auxiliary objects to the first player (P1) and the auxiliary objects assigned to the first player (P1) are randomly assigned to a plurality of basic objects. An allocation processing unit (42 (54), 20 (64), SA3, SA31, SA32) for executing an allocation process (SA3, SA31, SA32) to be allocated and the first game information (X) of a plurality of basic objects are applied. Corresponding to the first game processing section (42 (54), 20 (64), SB) for executing the first game processing (SB) and the first game information (X) applied to the first game processing (SB) Base object A second game processing unit (42 (54), 20 (64), SC) for executing a second game process (SC) to which the second game information (Y) of each assigned auxiliary object is applied; A win / loss determination unit (42 (54), 20 (64), SD) for determining the win / loss of the first player (P1) according to the result of the process (SC).

  In a preferred aspect of the present invention, the allocation processing units (42 (54), 20 (64), SA3, SA31, SA32) are assigned to each auxiliary of the first player (P1) in the allocation processing (SA3, SA31, SA32). An object and an auxiliary object (for example, a support character) of another player whose relationship with the first player (P1) is defined by the relationship information (R) that defines the relationship between the players are assigned to a plurality of basic objects. . Further, among the plurality of basic objects, the allocation processing units (42 (54), 20 (64), SA3, SA31, SA32) are assigned to the basic objects to which the auxiliary objects are not allocated in the allocation process (SA3, SA31, SA32). Assigns a predetermined auxiliary object (for example, standard character), or assigns an auxiliary object selected by the first player (P1) among a plurality of auxiliary objects assigned to the first player (P1) (42 (54 ), 20 (64), SA3, SA31, SA32) are also suitable for assignment to a plurality of basic objects.

  In a preferred aspect of the present invention, the allocation processing unit (42 (54), 20 (64), SA3, SA31, SA32) assigns a plurality of basic objects to the first player (P1) and the second player (P2). An allocation process (random allocation) for each of the first player (P1) and the second player (P2) to randomly allocate each auxiliary object assigned to the player to a plurality of basic objects of the player ( SA3, SA31, SA32) are executed, and the first game processing section (42 (54), 20 (64), SB) executes the first game information (X) and the first game information of each basic object of the first player (P1). The first game process (SB) to which the first game information (X) of each basic object of the two players (P2) is applied is executed, and the second game processing unit (42 (54), 20 (64), SC) Is the first game process (SB) Applied to the second game information (Y) of each auxiliary object assigned to the basic object of the first player (P1) corresponding to the applied first game information (X), and the first game process (SB) Execute the second game process (SC) applying the second game information (Y) of each auxiliary object assigned to the basic object of the second player (P2) corresponding to the first game information (X), and win or lose The determination unit (42 (54), 20 (64), SD) determines the win or loss between the first player (P1) and the second player (P2) according to the result of the second game process (SC). . The game apparatus (14A, 14B) according to the above aspect provides, for example, the first game process (SB) and the second game process (SC) executed in response to an instruction from the first player (P1). The result is an asynchronous game that is notified to the second player (P2) in response to an instruction from the second player (P2).

  Specifically, the first game processing unit (42 (54), 20 (64), SB) has a plurality of bases to which each of the first player (P1) and the second player (P2) is distributed. The first game processing (SB) of the game in which the first game information (X) among the objects alternately submits the basic objects satisfying the predetermined condition is executed, and the second game processing units (42 (54), 20 ( 64), SC) are the second game information (Y) of each auxiliary object assigned to the basic object submitted by the first player (P1) in the first game process (SB) and the second player (P2). Executes the second game process (SC) to which the second game information (Y) of each auxiliary object assigned to the basic object submitted in the first game process (SB) is applied. For example, the second game information (Y) of each auxiliary object includes an attack power (YAT) and a defense power (YDF), and the second game processing units (42 (54), 20 (64), SC) The attacker / defender side of the first player (P1) and the second player (P2) is determined according to the result of the first game process (SB), and the attacking player is applied to the first game process (SB). The total attack power (ZAT) corresponding to the attack power (YAT) of each auxiliary object assigned to the base object corresponding to the first game information (X) and the first game process (SB) for the defending player Execute the second game process (SC) applying the total defense power (ZDF) corresponding to the defense power (YDF) of each auxiliary object assigned to the basic object corresponding to the applied first game information (X) To do.

  The present invention is also specified as a program for causing a computer to function as the management apparatus according to each of the above aspects. The program of the present invention provides a computer with a first player in order to provide a game using a basic object in which first game information (X) is set and an auxiliary object in which second game information (Y) is set. An assigning process (52, 62) for assigning an auxiliary object to (P1), and an assigning process (SA3, SA31, SA) for randomly assigning each auxiliary object given to the first player (P1) to a plurality of basic objects. SA 32), a first game process (SB) to which the first game information (X) of a plurality of basic objects is applied, and a basis corresponding to the first game information (X) applied to the first game process (SB). The second game process (SC) to which the second game information (Y) of each auxiliary object assigned to the object is applied, and the first player (P1) wins according to the result of the second game process (SC). Win or loss determination processing of determining (SD) and to the execution. The program of the present invention is provided, for example, in a form stored in a computer-readable recording medium and installed in the computer. The recording medium is, for example, a non-transitory recording medium, and an optical recording medium (optical disk) such as a CD-ROM is a good example, but a known arbitrary one such as a semiconductor recording medium or a magnetic recording medium This type of recording medium can be included. For example, the program of the present invention can be provided in the form of distribution via a communication network and installed in a computer. Recording media that can be accessed by the distribution server that distributes the program of the present invention (for example, storage devices inside or outside the distribution server) are also included in the concept of the recording medium.

  The present invention is also specified as a method of providing a game using a basic object in which the first game information (X) is set and an auxiliary object in which the second game information (Y) is set by a computer. The game method of the present invention assigns auxiliary objects to the first player (P1), randomly assigns each auxiliary object assigned to the first player (P1) to a plurality of basic objects, and a plurality of basic objects. The first game process (SB) to which the first game information (X) is applied is executed, and each of the basic objects corresponding to the first game information (X) applied to the first game process (SB) is assigned. The second game process (SC) to which the second game information (Y) of the auxiliary object is applied is executed, and the victory or defeat of the first player (P1) is determined according to the result of the second game process (SC).

1 is a block diagram of a game system according to a first embodiment of the present invention. It is a schematic diagram of player information. It is a flowchart of a battle process. It is explanatory drawing of the distribution of several cards, and the allocation process of a character. It is a flowchart of an initialization process. It is a schematic diagram of the player information in 2nd Embodiment. It is a flowchart of a part of the initialization process in 2nd Embodiment. It is explanatory drawing of the allocation process in 2nd Embodiment. It is a block diagram of the game device in a 3rd embodiment.

<First Embodiment>
FIG. 1 is a block diagram of a game system 100 according to the first embodiment of the present invention. As shown in FIG. 1, the game system 100 according to the first embodiment includes a plurality of terminal devices 12 and a game device 14A. Each terminal device 12 is an information processing device such as a mobile phone or a smartphone, and communicates with the game device 14A via a communication network 16 (for example, a mobile communication network or the Internet). The game device 14 </ b> A is a server device (for example, a web server) that provides a computer game to a player who uses each terminal device 12.

  As shown in FIG. 1, each terminal device 12 is realized by a computer system including a control device 20, a storage device 22, a communication device 24, a display device 26, and an input device 28. The control device 20 is an arithmetic processing device that comprehensively controls each element of the terminal device 12. The communication device 24 communicates with the game device 14A via the communication network 16. The communication between the terminal device 12 and the communication network 16 is typically wireless communication. However, for example, when a stationary information processing device is used as the terminal device 12, the terminal device 12 and the communication network 16 Can also be wired. The storage device 22 (for example, a semiconductor recording medium) stores programs executed by the control device 20 and various data used by the control device 20.

  The display device 26 (for example, a liquid crystal display panel) displays various images under the control of the control device 20. The input device 28 is a device for the player to input an instruction to the terminal device 12, and includes, for example, a plurality of operators that the player operates. Note that a touch panel integrated with the display device 26 and a microphone for inputting an instruction to the terminal device 12 by voice may be employed as the input device 28.

  The game device 14A according to the first embodiment provides an SNS (Social Networking Service) game to which the players of the terminal devices 12 participate and relate to each other. Specifically, the game device 14A executes various processes triggered by a request transmitted from the terminal device 12 in response to an instruction from the player to the input device 28 of each terminal device 12, and the game according to the processing result. The screen is displayed on the display device 26 of the terminal device 12. In the first embodiment, each terminal device 12 is provided with a battle game in which each player uses a character (for example, a monster) acquired in the game to execute an event (hereinafter referred to as a “match event”) for playing against other players. Is done.

  As shown in FIG. 1, the game apparatus 14 </ b> A includes a control device 42, a storage device 44, and a communication device 46. It is also possible to implement game device 14A with a plurality of devices configured separately from each other (for example, a plurality of server devices that communicate with each other via communication network 16). The control device 42 is an arithmetic processing device that comprehensively controls each element of the game device 14A. The communication device 46 communicates with each terminal device 12 via the communication network 16.

  The storage device 44 stores a program (game program) executed by the control device 42 and various data used by the control device 42. For example, a recording medium such as a semiconductor recording medium or a magnetic recording medium, or a combination of a plurality of types of recording media may be employed as the storage device 44. A configuration is also adopted in which the storage device 44 is installed in an external device (for example, a server device) separate from the game device 14A, and the game device 14A acquires information in the storage device 44 from the external device via the communication network 16. Can be done. That is, the storage device 44 is not an essential requirement for the game device 14A. In addition, for example, the storage device 44 (virtual one recording medium) can be configured by a plurality of storage circuits independent from each other (for example, a plurality of server devices installed at geographically different positions). .

  The storage device 44 stores player information Q for each player of each terminal device 12. FIG. 2 is a schematic diagram of the player information Q. As shown in FIG. 2, the player information Q of an arbitrary player includes identification information PID, owned character information CA, and selected character information CB. The identification information PID is information for identifying each player. The owned character information CA is information for designating a character owned by the player (hereinafter referred to as “owned character”), and includes a plurality of unit data U corresponding to each owned character.

  As shown in FIG. 2, each unit data U includes identification information CID for identifying the owned character and game information Y for designating the ability of the owned character. The game information Y includes physical strength YL, attack power YAT, and defense power YDF. The physical strength YL is an index value of the endurance ability (hit point) of the possessed character against the attack. The attack power YAT is an index value of the attacking ability of the owned character, and the defense power YDF is an index value of the defense ability of the owned character. The game information Y (YL, YAT, YDF) of the owned character can be changed by combining a plurality of owned characters or using a specific item for the owned character. In each unit data U, only the identification information CID of the owned character is specified, and the game information Y of each character is stored and managed as data (master data) separate from the player information Q in association with the identification information CID. Is also possible.

  The player of each terminal device 12 operates the input device 28 of the terminal device 12 as appropriate, so that a plurality (K) of owned characters (K) participating in the battle event among a plurality of owned characters specified by the owned character information CA ( (Hereinafter referred to as “selected character”). An arbitrary number K of owned characters is selected with a predetermined value as an upper limit. The selected character information CB in the player information Q designates K selected characters selected by the player. Specifically, the selected character information CB includes identification information CID of each selected character. Note that the method of selecting the selected character is arbitrary, and is not limited to selection by the player. For example, the control device 42 automatically selects K selected characters from a plurality of owned characters of each player according to a predetermined rule (for example, K selected characters positioned higher in descending order of attack power YAT and defense power YDF). It is also possible to select

  As shown in FIG. 1, the control device 42 executes a program stored in the storage device 44, thereby providing a plurality of functions (a grant processing unit 52, a battle processing unit 54) for providing a game to each terminal device 12. ). Each function of the control device 42 can be distributed to a plurality of devices.

  The grant processing unit 52 grants a character to each player. That is, the grant processing unit 52 adds unit data U corresponding to the grant target character to the owned character information CA included in the player information Q of the player. Specifically, the grant processing unit 52 grants a character to the player as a result of various events executed in the game in response to an instruction from each player to the terminal device 12. For example, a character is given to the player as a result of a search event for searching a virtual space or a lottery event for selecting a character in a lottery process (paid / free). Further, a configuration in which a separate character obtained by combining a plurality of characters is given to a player, or a configuration in which a character instructed to be transferred from another player is given to a transfer-side player may be employed.

  The battle processing unit 54 in FIG. 1 executes a game process (hereinafter referred to as “matching process”) of a battle event in which two players battle using their own characters. The battle process of the first embodiment is executed when the player P1 of an arbitrary terminal device 12 instructs the start of the battle event, and the player P1 designated character designated by the player P1 as the opponent and the player P1 selected character It is the process which decides the victory or defeat between both sides by making a battle. The result (win / lose) of the battle process is notified to the terminal device 12 of the player P1 who instructed the start of the battle event, and is also notified to the terminal device 12 of the player P2 in response to a request from the terminal device 12 of the opponent player P2. Is done. That is, it is not necessary for the player P2 to recognize during the execution of the battle event that the battle event for which the player P2 is the opponent is executed in response to an instruction from the player P1. As understood from the above description, in the game (match event) provided by the game device 14A of the first embodiment, it is not necessary for the player P1 and the player P2 to execute the game at the same time (for example, the result of the battle process is This is an asynchronous game that does not require real-time or immediate notification to the opponent player P2. Therefore, there is an advantage that a large number of players can easily participate in a battle event as compared with a synchronous game in which a plurality of players are required to participate in the game at the same time. However, the present invention can also be applied to a synchronous game.

  FIG. 3 is a flowchart of the battle process executed for the player P1 and the player P2. As shown in FIG. 3, the battle process includes an initialization process SA, a first game process SB, a second game process SC, and a win / loss determination process SD. The initialization process SA is a preliminary process for causing the player P1 and the player P2 to fight each other.

  The first game process SB is a process of developing a game using a plurality of virtual cards (playing cards) in which game information X is set between the player P1 and the player P2. In the first embodiment, as shown by the frame line F0 in FIG. 4, 13 cards with different numbers (1, 2,..., 9, 10, J, Q, K) are assigned to four types of symbols. A card game using a total of 52 cards prepared for each suit (spade, club, diamond, heart) is executed in the first game process SB. As shown in FIG. 4, the game information X of each card corresponds to a combination of numbers and symbols. That is, 52 cards with different game information X are used in the first game process SB.

  In the second game process SC in FIG. 3, a game using the K1 selected characters specified by the selected character information CB of the player P1 and the K2 selected characters specified by the selected character information CB of the player P2 is played by the player P1. And the player P2. The result of the first game process SB is reflected in the second game process SC. The win / loss determination process SD is a process of determining the win / loss of the player P1 and the player P2 according to the result of the second game process SC. As understood from the above description, the control device 42 (matching processing unit 54) of the first embodiment performs the element (first game processing unit) for executing the first game processing SB and the second game processing SC. It functions as an element to be executed (second game processing unit). Further, when the control device 42 executes the win / loss determination process SD, an element (win / loss determination unit) for determining the win / loss between the player P1 and the player P2 is realized. Specific examples of each process of the battle process will be described in detail below.

  FIG. 5 is a flowchart of the initialization process SA. When the initialization process SA is started, the battle processing unit 54 initializes each variable (N, ZAT, ZDF) applied to the battle process to a predetermined value (SA1). The variable N corresponds to the number of times (round number) of a game (hereinafter referred to as “unit game”) as a unit in the battle event. The battle processing unit 54 initializes the variable N to a predetermined value (for example, 1). Further, the battle processing unit 54 initializes the total attack power ZAT and the total defense power ZDF of the players P1 and P2 to predetermined values (for example, zero). The total attack power ZAT and the total defense power ZDF are variables applied to the second game process SC.

  When each variable is initialized, the battle processing unit 54 randomly distributes 52 cards set with different game information X to the player P1 and the player P2 (SA2). Specifically, as shown by the frame line F1 and the frame line F2 in FIG. 4, 26 cards are distributed to each of the player P1 and the player P2. For example, the battle processing unit 54 generates a random number sequence composed of a plurality of random numbers, and randomly distributes each card by giving a card corresponding to each random number to the player P1 and the player P2.

  When the 52 cards are distributed, the battle processing unit 54 executes an allocation process for randomly assigning each selected character of the player to each card distributed to the player for each of the player P1 and the player P2 (SA3). Specifically, as shown in FIG. 4, the battle processing unit 54 randomly assigns K1 selected characters specified by the selected character information CB of the player P1 to the 26 cards of the player P1, An assigning process for randomly assigning K2 selected characters designated by the selected character information CB of the player P2 to the 26 cards of the player P2 is executed. As understood from the above description, the control device 42 (match processing unit 54) executes step SA3, thereby realizing an element (assignment processing unit) for randomly assigning each selected character to the card.

  The total number of selected characters that can be selected by each player is lower than the total number of cards distributed to one player (26 cards). Therefore, at the time when the assignment process of step SA3 is executed, there are cards ({26-K}) to which the selected character is not assigned. Therefore, as shown in FIG. 4, the battle processing unit 54 assigns a predetermined character (hereinafter referred to as “standard character”) to each card to which the selected character is not assigned (SA4). The standard character of the first embodiment is a character (for example, a so-called Zako character) common to each player that does not depend on the progress of the game of each player or the owned character, and each variable (physical strength YL, attack power) of the game information Y YAT, defense power YDF) are set to predetermined values (for example, zero). Through the processing of step SA3 and step SA4, characters are assigned to all the cards distributed to each player in step SA2.

  The battle processing unit 54 determines whether or not the variable N is 1 (SA5). As described above, the variable N is initialized to 1 in step SA1 immediately after the battle process is started. When the variable N is 1 (SA5: YES), the battle processing unit 54 sets the physical strengths ZL of the players P1 and P2 to initial values (SA6). Specifically, the physical strength ZL of the player P1 is a numerical value (for example, the sum of the physical strength YL) corresponding to the physical strength YL of the 26 characters (selected character and standard character) assigned to the card of the player P1 in step SA3 and step SA4. Value). Similarly, the physical strength ZL of the player P2 is set to a value corresponding to the physical strength YL of the 26 characters assigned to the card of the player P2. On the other hand, when the variable N is not 1 (SA5: NO), the physical strength ZL of each player is not initialized but is maintained at the current value. The above is a specific example of the initialization process SA.

  In the first game process SB of FIG. 3, a turn-based computer game using the game information X of 26 cards distributed to each player is executed. In the game executed in the first game process SB of the first embodiment, each of the player P1 and the player P2 has a predetermined game information X (a combination of numbers and symbols) among a plurality of cards distributed to itself. It is a card game in which cards that satisfy the conditions (hereinafter referred to as “submission conditions”) are alternately submitted to the field. For example, a well-known card game such as a millionaire (large poor) or seven-sided is executed in the first game process SB.

  When the first game process SB is started, the battle processing unit 54 selects one of the player P1 and the player P2 as the player who is the player who should submit his / her card (hereinafter referred to as “turn player”) (SB1). . In step SB1 executed at the beginning of each unit game, one of the player P1 and the player P2 is selected as a turn player according to a predetermined rule. In the second and subsequent steps SB1, the player turns from one of the player P1 and the player P2 to the other. Is changed.

  The battle processing unit 54 determines whether or not the turn player has a card for which the game information X satisfies the submission condition (that is, a card that can be submitted to the field) (SB2). When the turn player has a card that can be submitted (SB2: YES), the battle processing unit 54 executes a submission process for the turn player to select and submit a card whose game information X satisfies the submission condition ( SB3). Specifically, when the player P1 who has instructed the start of the battle event (a player who can operate the terminal device 12) is a turn player, the battle processing unit 54 determines that the game information X satisfies the submission condition. Of the P1 cards, a process of submitting a card designated by the player P1 to the place by an operation on the input device 28 of the terminal device 12 is executed. On the other hand, when the player P2 designated by the player P1 as an opponent (a player who is not necessarily in a state where the terminal device 12 can be operated) is a turn player, the battle processing unit 54 stores the game information X in the card of the player P2. A process of automatically selecting a card that satisfies the submission conditions according to a predetermined rule and submitting it to the venue is executed.

  When the submission process of step SB3 is executed, the battle processing unit 54 selects the character (selected character, standard) assigned to the card submitted by the turn player in the submission process (hereinafter referred to as “submission card”) in the above-described steps SA3 and SA4. The total attack power ZAT and total defense power ZDF of the turn player are changed according to the game information Y of the character) (SB4). Specifically, the battle processing unit 54 adds the attack power YAT of the character assigned to the submitted card to the total attack power ZAT of the turn player (ZAT ← ZAT + YAT), and the defense power YDF of the character assigned to the submitted card. Is added to the turn player's total defense strength ZDF (ZDF ← ZDF + YDF).

  When the processing of step SB4 is executed, the battle processing unit 54 determines whether or not one or more cards remain in the turn player (whether or not the turn player has submitted all the cards distributed in step SA2). Determine (SB5). When the turn player has one or more cards (SB5: YES), the battle processing unit 54 proceeds to step SB1. That is, after the turn player is changed from one of the players P1 and P2 to the other, the processing after step SB2 is executed. As understood from the above description, in the first game process SB, a card game is executed in which each of the players P1 and P2 alternately submits cards whose game information X satisfies the submission conditions from the cards on hand.

  When the result of step SB2 or step SB5 of the first game process SB is negative, the battle processing unit 54 executes the second game process SC. As understood from the description of the first game process SB, at the time when the second game process SC is started, the total attack power ZAT of the player P1 is applied to the card submitted by the player P1 in the first game process SB until immediately before. A value (total value of each attack power YAT) corresponding to the attack power YAT of each assigned character (selected character and standard character) is set, and the total defense power ZDF of the player P1 is determined by the player P1 in the first game process SB. Is set to a numerical value (total value of each defense strength YDF) corresponding to the defense strength YDF of each character assigned to the card submitted. Similarly, the total attack power ZAT of the player P2 is set to a value corresponding to the attack power YAT of each character assigned to the card submitted by the player P2 in the first game process SB, and the total defense power ZDF of the player P2 is The numerical value is set according to the defense strength YDF of each character assigned to the card submitted by the player P2 in the first game process SB. Details of the second game process SC will be described below.

  If the result of step SB2 is negative in the first game process SB (if the turn player does not have a card that satisfies the submission conditions), the battle processing unit 54 selects the current turn player as the defender. At the same time, a player other than the turn player (hereinafter referred to as “non-turn player”) is selected as the attack side (SC11). That is, if the turn player cannot submit a card that satisfies the submission conditions, the right to attack the turn player is given to the non-turn player.

  The battle processing unit 54 subtracts the difference (ZAT−ZDF) between the total attack power ZAT of the attacking player and the total defense power ZDF of the defending player from the physical strength ZL of the defending player (SC12). The difference (ZAT−ZDF) between the total attack power ZAT on the attacking side and the total defense power ZDF on the defending side means damage that the attacking player gives to the defending player. As understood from the above description, in the second game process SC, the total attack power ZAT corresponding to the attack power YAT of each character assigned to the card submitted by the attacking player in the first game process SB, and the defense A battle is performed between the players to which the total defense power ZDF corresponding to the defense power YDF of each character assigned to the card submitted by the player on the first game process SB is applied. That is, a virtual battle is developed in which the character assigned to the card submitted by the attacking player attacks the character assigned to the card submitted by the defending player.

  When the physical strength YL of the defending player is updated in step SC12, the battle processing unit 54 determines the total attack power ZAT and total defense power ZDF of both the player P1 and the player P2 in the same manner as in step SA1 of the initialization process SA. It is initialized to a value (for example, zero) (SC13). Then, the battle processing unit 54 determines whether or not the defense-side physical strength ZL updated in step SC12 is a positive number (that is, whether or not the defense-side player's physical strength ZL remains after the attack). (SC14). When the updated physical strength ZL is a positive number (SC14: YES), the battle processing unit 54 proceeds to step SB1 and resumes the first game process SB. As described above, when one player (turn player) submits all cards by repeating the first game process SB (card submission), the result of step SB5 changes to negative.

  When the result of step SB5 of the first game process SB is negative (when the card on hand does not remain in the turn player), the battle processing unit 54 selects the current turn player as the attack side and does not turn The player is selected as the defender (SC21). That is, when the turn player submits all the cards on hand, the turn player is given the right to attack the non-turn player.

  Similar to step SC12 described above, the battle processing unit 54 calculates the difference (ZAT−ZDF) between the total attack power ZAT of the attacking player and the total defense power ZDF of the defending player from the physical strength ZL of the defending player. Subtract (SC22). That is, the total attack power ZAT corresponding to the attack power YAT of each character assigned to the card submitted by the attacking player in the first game process SB and the card submitted by the defending player in the first game process SB A battle is performed between players to which the total defense power ZDF corresponding to the defense power YDF of each assigned character is applied. Then, the battle processing unit 54 initializes the total attack power ZAT and the total defense power ZDF of the player P1 and the player P2 to predetermined values (for example, zero), similarly to the above-described step SC13 (SC23). Further, the battle processing unit 54 determines whether or not the defense-side physical strength ZL updated in Step SC22 is a positive number, similarly to Step SC14 described above (SC24).

  When the updated physical strength ZL is a positive number (SC24: YES), the battle processing unit 54 determines whether or not the variable N representing the unit game number is below a predetermined value Nmax (for example, 3). (SC25). When the variable N is less than the predetermined value Nmax (SC25: YES), the battle processing unit 54 adds 1 to the variable N (SC26), and then proceeds to step SA2 of the initialization process SA of FIG. Therefore, the first game process SB and the second game process SC are executed after the card distribution (SA2) to each player and the character allocation (SA3, SA4) to each card are executed. As understood from the above description, a unit game (one round) including card distribution (SA2) and character allocation (SA3, SA4) to each player and the first game process SB and the second game process SC, The process is repeated up to Nmax times until one of the physical strengths ZL of the player P1 and the player P2 disappears (decreases to a value of 0 or less). Since 1 is added to the variable N in step SC26 and the result of step SA5 of the initialization process SA in FIG. 5 is changed to negative, step SA6 for initializing the physical strength ZL of each player is not executed. That is, in the unit game after the second time (N = 2), the physical strength ZL of each player at the end of the immediately preceding unit game is taken over. However, it is also possible to initialize the physical strength ZL of each player for each unit game.

  When the physical strength ZL of the defending player disappears as a result of the attack by the attacking player (SC14: NO, SC24: NO), or when the variable N reaches the upper limit value Nmax (SC25: NO), the battle process The unit 54 executes a win / loss determination process SD for determining the win / loss of the player P1 and the player P2 according to the result of the second game process SC. Specifically, when the physical strength ZL of the defending player disappears (SC14: NO, SC24: NO), the battle processing unit 54 selects the attacking player as the winner and selects the defending player as the loser. To do. When the variable N reaches the upper limit value Nmax (SC25: NO), the battle processing unit 54 compares the physical strength ZL of the player P1 with the physical strength ZL of the player P2, and selects a player having a large physical strength ZL as the winner. At the same time, the other player is selected as the loser. As described above, the result (win / lose) of the battle process is notified to the terminal device 12 of the player P1, and is also notified to the terminal device 12 of the player P2 in response to a request from the terminal device 12 of the player P2.

  As described above, in the first embodiment, the first game process SB in which each player's card is randomly assigned to each player's card and the game information X of each player's card is applied. The second game process SC to which the game information Y of the selected character assigned to each submitted card in the first game process SB is applied is executed. Therefore, even if a selected character with a high attack power YAT or defense power YDF (that is, a strong selected character) is assigned to a card that is difficult to submit under the submission conditions of the first game process SB, a battle event is held. It cannot be used effectively. Therefore, it is possible to sufficiently secure the randomness of the win / loss in the battle event as compared with the configuration in which the battle using only the selected character is executed between the player P1 and the player P2. For example, even a beginner who does not have a strong selection character may win a veteran who has a strong selection character. In the first embodiment, a selection character is assigned to a part of a plurality of cards distributed to each player, and a standard character common to the players is assigned to the remaining cards. The effect of doing is particularly remarkable. Moreover, in the first embodiment, in addition to the random assignment of the selected character to each card, a plurality of cards having different game information X are randomly distributed to the player P1 and the player P2. Therefore, for example, the effect of improving the randomness of winning and losing is particularly remarkable as compared with a configuration in which a plurality of cards having the same game information X are equally distributed to the players P1 and P2.

  In the first game process SB, cards satisfying the submission conditions for the game information X are alternately submitted among the players, and in the second game process SC, the selected character assigned to the submitted card in the first game process SB. The game information Y is applied to a battle between players. Therefore, there is an advantage that a highly interesting game is provided in which the skill of the strategy of submitting each card in the first game process SB affects the winning or losing.

  In the first embodiment, a selected character arbitrarily selected from each player's own character is applied to the battle event (second game process SC). Therefore, there is an advantage that a highly interesting game is realized in which the intention of each player is reflected in the type of the selected character. Further, the game information Y of each character includes an attack power YAT and a defense power YDF. In the second game process SC, the attack side to which the total attack power ZAT according to the attack power YAT of each selected character is added, Each player is selected as a defense side to which the total defense power ZDF corresponding to the defense power YDF of the selected character is added. Therefore, the strategy of selecting an owned character with a high attack power YAT and developing an advantageous game on the attacker side, or selecting an owned character with a high defense power YDF and developing an advantageous game on the defense side, will win or lose. There is an advantage that a highly interesting game to be influenced is provided.

Second Embodiment
A second embodiment of the present invention will be described below. In each of the embodiments exemplified below, elements having the same functions and functions as those of the first embodiment will be referred to in the description of the first embodiment, and detailed descriptions thereof will be appropriately omitted.

  FIG. 6 is a schematic diagram of the player information Q in the second embodiment. As shown in FIG. 6, the player information Q of the second embodiment has a structure in which the relationship information R is added to the same elements (identification information PID, possessed character information CA, selected character information CB) as in the first embodiment. . The relationship information R is data that defines an exchange relationship (social graph) between the players, and specifies identification information PID of each other player who has established an exchange relationship with the player. For example, the relationship established within the SNS service (friend relationship) and the relationship established within the game (friend relationship) are registered in the relationship information R.

  FIG. 7 is a partial flowchart of the initialization process SA in the second embodiment. As shown in FIG. 7, the assignment process (step SA3 in FIG. 5) for assigning characters to the cards of each player includes step SA31 and step SA32 in the second embodiment. In step SA31, as in step SA3 of the first embodiment, the battle processing unit 54 assigns each of the selected characters of the player to each card distributed to the player at random, and assigns each of the player P1 and the player P2. Run about.

  As shown in FIG. 8, the battle processing unit 54 of the second embodiment, with respect to each card to which the selected character is not assigned among the plurality of cards distributed to the player, Is assigned as a support character (SA32). H related players with a predetermined value as an upper limit are selected from the related information R for each player. Specifically, the battle processing unit 54 selects H1 related players selected from the relationship information R of the player P1 from the relationship information R of the player P1, and uses one owned character of each related player as a support character. Assigned to each card of player P1. Similarly, the battle processing unit 54 assigns one owned character of each of the H2 related players selected from the relationship information R of the player P2 to each card of the player P2 as a support character. When there are a total number of related players exceeding the upper limit, the upper limit number of related players is selected by a specific method (for example, random).

  A method of selecting a support character from a plurality of owned characters of related players is arbitrary. For example, a method of selecting an owned character having the maximum attack power YAT or defense power YDF (or the total value of both) among a plurality of related player's owned characters as a support character, A method of selecting an owned character (leader character) selected in advance by a related player as a support character is preferable. A configuration in which two or more owned characters of one related player are assigned to each card as a support character can also be adopted. As shown in FIG. 8, each card ({26-KH}) to which no character (selected character or support character) is assigned in the assignment process of step SA31 and step SA32 is the same as in the first embodiment. A standard character is assigned. The contents of the first game process SB and the second game process SC are the same as in the first embodiment.

  In the second embodiment, the same effect as in the first embodiment is realized. Moreover, in 2nd Embodiment, the possessed character of the relationship player in which the relationship with each player is registered is allocated to each card with its own selection character as a support character. In the above configuration, for example, even when the player does not own a strong selection character, if the relationship with another player who owns a strong character is registered in the relationship information R, that character is the support character. To participate in battle events. Therefore, the above-mentioned effect of improving the randomness of winning and losing is particularly remarkable.

<Third Embodiment>
FIG. 9 is a block diagram of a game apparatus 14B according to the third embodiment. The game device 14B of the third embodiment is realized by an information processing device (typically a portable electronic device) such as a mobile phone or a smartphone, and the control device 20 is similar to the terminal device 12 of the first embodiment. A storage device 22, a communication device 24, a display device 26, and an input device 28.

  The storage device 22 stores player information Q of the player P1 who owns the game device 14B in addition to the program (game program) executed by the control device 20. The communication device 24 acquires player information Q of the player P2 by directly communicating (for example, short-range wireless communication) with the game device 14B possessed by the other player P2. The player information Q of each player can be centrally stored and managed by a management device (for example, a server device), and each game device 14B can acquire the player information Q of each opponent player from the management device. is there. The display device 26 and the input device 28 are the same as those in the first embodiment.

  The control device 20 functions as the grant processing unit 62 and the battle processing unit 64 by executing the program stored in the storage device 22. The grant processing unit 62 grants a character to the player P1 who uses the game apparatus 14B, similarly to the grant processing unit 52 of the first embodiment. Similar to the battle processing unit 54 of the first embodiment, the battle processing unit 64 executes a battle process in which the player P1 who owns the game apparatus 14B and the player P2 designated by the player P1 as the opponent are battled. In the battle process executed by the battle processing unit 54, the player information Q of the player P2 acquired by the communication device 24 and the player information Q of the player P1 stored in the storage device 22 are applied. The result (win / lose) of the battle process is displayed on the display device 26.

  As understood from the above description, the game device 14B of the third embodiment realizes the function provided to the terminal device 12 by the game device 14A of the first embodiment as a single device. Therefore, the third embodiment can achieve the same effect as the first embodiment. Note that the configuration of the second embodiment may be employed in the third embodiment.

<Modification>
Each of the aforementioned embodiments can be variously modified. Specific modifications are exemplified below. Two or more modes arbitrarily selected from the following examples can be appropriately combined within a range that does not contradict each other.

(1) In the above-described embodiments, a battle between the player P1 and the player P2 is assumed, but a battle between a plurality of players is not an essential requirement for the present invention. For example, after distributing cards to an arbitrary player P1 and a virtual opponent, and randomly assigning a selected character of the player P1 to each card on hand, and assigning a predetermined character to each card of the opponent, It is also possible to execute the first game process SB and the second game process SC similar to those in the first embodiment. It is also possible to execute a game (card game) in which the player can play alone in the first game process SB. For example, in the first game process SB, the player P1 sequentially submits cards whose game information X satisfies the submission conditions, and the score corresponding to the game information Y of the selected character assigned to each submitted card is second game process. A configuration in which the player P1 wins or loses in the win / loss determination process SD according to the score calculated in the second game process SC in accordance with the score calculated in the second game process SC may be employed.

(2) In each of the above-described forms, the selected character selected in advance by the player among the plurality of owned characters is applied to the battle event, but the selection of the selected character may be omitted. For example, it is possible to assign all the characters owned by each player to each card. It is also possible to select a selected character from a plurality of owned characters at random for each battle event.

(3) In each of the above-described embodiments, the first game process SB of the game using the card is illustrated, but the target (object) used in the game of the first game process SB is not limited to the card. For example, it is also possible to execute a mahjong game using mahjong tiles instead of the cards in the above-described forms in the first game process SB. As understood from the above examples, the cards of the above-described forms are examples of arbitrary objects (basic objects) used for the first game process SB.

(4) In each of the above-described embodiments, the second game process SC using the character owned by the player is illustrated, but the target (object) used for the second game process SC is not limited to the character. For example, it is also possible to execute the second game process SC using items such as weapons and armor and a virtual card on which the character is drawn instead of the character in each of the above-described forms. As understood from the above description, the characters of the above-described forms are examples of arbitrary objects (auxiliary objects) used for the second game process SC.

(5) In each of the above embodiments, a standard character is assigned to each card to which no character is assigned in the assignment process. However, a standard character is assigned to all cards before the assignment process, and each card is assigned in the assignment process. It is also possible to replace the standard character assigned to the card with a selected character or a support character. It is also possible to omit the assignment of standard characters. For example, it is possible to assign selected characters and support characters to all cards distributed to the players.

(6) In each of the above-mentioned forms, each player's selection character is randomly assigned to each card. However, “random assignment” is not only a completely random assignment but also other factors such as the intention of each player. It also implies an assignment that reflects to some extent (substantially random assignment). For example, it is possible to preferentially assign a player's desired selection character to a specific card and then randomly assign selection characters to the remaining cards. That is, “random assignment” does not mean that a character is assigned to each card only by the player's intention (action) (a certain degree of randomness is given to the combination of each card and each character). Means that.

  Similarly, the “random distribution” in the case of randomly distributing a plurality of cards to each player is not limited to a completely random distribution. For example, it is possible to distribute a specific card to one player and then distribute the remaining cards to each player at random. That is, “random distribution” does not mean that a plurality of cards are distributed only by the player's intention (action), or that all the cards having the same game information X are distributed equally to each player ( A certain degree of randomness is given to the distribution of cards to each player).

DESCRIPTION OF SYMBOLS 100 ... Game system, 12 ... Terminal device, 14A, 14B ... Game device, 16 ... Communication network, 20, 42 ... Control device, 22, 44 ... Storage device, 24, 46 ... Communication device, 26... Display device, 28... Input device, 52 and 62... Giving processor, 54 and 64.

Claims (10)

A game device that provides a game using a basic object in which first game information is set and an auxiliary object in which second game information is set,
A grant processing unit for granting an auxiliary object to the first player;
An allocation processing unit that executes an allocation process of randomly allocating each auxiliary object assigned to the first player to a plurality of basic objects;
A first game processing unit that executes a first game process to which the first game information of the plurality of basic objects is applied;
A second game processing unit that executes a second game process using the second game information of each auxiliary object assigned to the base object corresponding to the first game information applied to the first game process;
A game device comprising: a winning / losing determining unit that determines the winning / losing of the first player according to a result of the second game process. In the allocation process, the allocation processing unit uses player information that designates an auxiliary object assigned to each player, and uses the auxiliary information assigned to each player as relation information that defines the relationship between each auxiliary object of the first player and each player. The game apparatus according to claim 1, wherein auxiliary objects of other players for which a relationship with the first player is defined are assigned to the plurality of basic objects. The game device according to claim 1, wherein the allocation processing unit allocates a predetermined auxiliary object to a basic object to which an auxiliary object is not allocated in the allocation process among the plurality of basic objects. The game device according to any one of claims 1 to 3, wherein the allocation processing unit allocates an auxiliary object selected by the first player among the plurality of auxiliary objects assigned to the first player to the plurality of basic objects. . The allocation processing unit randomly distributes a plurality of basic objects to a first player and a second player, and for each of the first player and the second player, assigns each auxiliary object given to the player to the player Execute allocation process to randomly allocate to multiple basic objects of the player,
The first game processing unit executes a first game process in which first game information of each basic object of the first player and first game information of each basic object of the second player are applied,
The second game processing unit includes second game information of each auxiliary object assigned to the basic object of the first player corresponding to the first game information applied to the first game process, and the first game process. Executing the second game process using the second game information of each auxiliary object assigned to the basic object of the second player corresponding to the first game information applied to
The game device according to any one of claims 1 to 4, wherein the win / loss determination unit determines a win / loss between the first player and the second player according to a result of the second game process. The first game processing unit alternately submits a basic object whose first game information satisfies a predetermined condition among a plurality of basic objects distributed to the first player and the second player. Executing the first game process of the game;
The second game processing unit includes second game information of each auxiliary object assigned to the basic object submitted by the first player in the first game process, and the second player in the first game process. The game device according to claim 5, wherein the second game process is executed by applying the second game information of each auxiliary object assigned to the submitted basic object. The second game information of each auxiliary object includes attack power and defense power,
The second game processing unit determines an attacking / defending side of the first player and the second player according to a result of the first game processing, and is applied to the first game processing for the attacking player. The total attack power corresponding to the attack power of each auxiliary object assigned to the basic object corresponding to the first game information, and the basic corresponding to the first game information applied to the first game process for the defending player The game device according to claim 5, wherein the second game process is executed by applying a total defense level corresponding to a defense level of each auxiliary object assigned to the object. In the game, the results of the first game process and the second game process executed in response to an instruction from the first player are notified to the second player in response to an instruction from the second player. The game device according to claim 5, which is an asynchronous game. In order to provide a game using a basic object in which the first game information is set and an auxiliary object in which the second game information is set,
A granting process for granting an auxiliary object to the first player;
An assigning process for randomly assigning each auxiliary object assigned to the first player to a plurality of basic objects;
A first game process using the first game information of the plurality of basic objects;
A second game process applying the second game information of each auxiliary object assigned to the base object corresponding to the first game information applied to the first game process;
A program for executing a win / loss determination process for determining a win / loss of the first player according to a result of the second game process. In order to provide a game using the basic object in which the first game information is set and the auxiliary object in which the second game information is set, using a storage device that stores the second game information of each basic object, computer,
An auxiliary object is given to the first player,
Randomly assigning each auxiliary object assigned to the first player to a plurality of basic objects,
Executing a first game process to which the first game information of the plurality of basic objects is applied;
Executing a second game process using the second game information stored in the storage device for each auxiliary object assigned to the base object corresponding to the first game information applied to the first game process;
A game method for determining whether the first player wins or loses according to a result of the second game process.

Images