JP2018008002A - Information processing device and game program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To realize a game property of inducing expectation and impatience associated with successive chains by game progress conditions of two players influencing each other in a one-on-one puzzle game.SOLUTION: Game fields in which a plurality of types of objects are arranged are prepared respectively for a first and a second player. One or more of the objects selected by the players are erased. When the objects of the same type form a chain of a prescribed number or more, the chained objects are also erased. Upon each instance of a new chain being formed in association with the object erasure, the number of chains is counted, and attack strength is accumulated according to the number of chains. When chain processing progresses simultaneously for the two players, the attack strengths of both sides are partially offset after the chain processing concludes for both sides. When the chain processing concludes sooner for one side than for the other after the simultaneous chain processing, extra time for an extra attack is set. A victory determination is made according to respective residual stamina values of the first and second players.SELECTED DRAWING: Figure 9

Description

  The present invention relates to a competitive network game.

  The use of smartphones as game terminals as well as communication terminals has become common. Network games popular with smartphones are provided by accessing a platform built on a game server from a smartphone. Network games often have contents that emphasize character development, cooperation and competition with other players, and collection of cards and items.

  Patent Document 1 discloses a network game of a battle type puzzle. In Patent Document 1, a plurality of types of objects are arranged in a game field, and a player operates to chain a predetermined number or more of the same types of objects. The player operates when the turn (turn) comes, and attacks the enemy with an attack power according to the number of chains formed at this time. Victory or defeat is determined by attacking the enemy team every turn.

Japanese Patent No. 5500514

  Patent Document 1 is a turn system that attacks in turn, and is not a game characteristic that requires a flexible response depending on the game progress of the opponent.

  The present invention has been completed on the basis of the above-mentioned problem recognition, and its main purpose is to have a sense of anticipation associated with play in a battle-type puzzle game because the game progress of each other affects each other. The aim is to provide a game that is more frustrating and interesting.

An information processing apparatus according to an aspect of the present invention includes a field setting unit that sets two game fields in which a plurality of types of objects are arranged for the first and second players, and two game fields, A designated erase unit that erases one or more objects selected by the first and second players, and erases the linked objects when the same kind of objects form a predetermined number of chains in each of the two game fields. A chain erasure unit, a replenishment unit that replenishes a game field with a new object when an object is erased, and a chain number each time a new chain is formed in accordance with object erasure in each of the two game fields. Chain counting unit to count and attack according to the number of chains After the continuation of the chain by one player is completed, the attack processing unit that reduces the physical strength value of the other player according to the attack power accumulated by the one player and the chain processing in the two game fields are simultaneously performed. When proceeding, after both chain processes are completed, the attack power of one player who has accumulated higher attack power among the attack power accumulated by each of the first and second players is partially reduced, and the other The counter-attack processing unit that executes the counter-balance processing to reduce the physical strength value of the player and the chain processing in the two game fields proceed simultaneously, and then the chain processing by one player ends before the chain processing by the other player An additional time setting unit for setting an additional time for one player, and the physical strength values of the first and second players. Includes a win or loss determination unit that performs win or loss determination of the first and second players, the.
The additional time setting unit sets an additional time for one player on the condition that the additional time has not been set for one player after the simultaneous progress of the chain processing in the two game fields occurs, and the attack The processing unit adds attack power according to the number of chains newly established before the end of the additional time, and the countervailing attack processing unit is in both game fields even before the additional time ends. When the chain process is completed, an offset process is executed.

  According to the present invention, a player's expectation and frustration in a competitive puzzle game can be further enhanced, and a highly entertaining game can be provided.

It is a hardware block diagram of a game system. It is a functional block diagram of a game system. It is a screen figure of a battle | competition screen. It is a screen figure in the 1st state of a 1st game field. It is a screen figure in the 2nd state of a 1st game field. It is a screen figure in the 3rd state of a 1st game field. It is a schematic diagram which shows the sequence of the attack process (1st example) accompanying a chain | strand. It is a schematic diagram which shows the sequence of the attack process (2nd example) accompanying a chain | strand. It is a schematic diagram which shows the sequence of the attack process (3rd example) accompanying a chain | strand. It is a schematic diagram which shows the sequence of the attack process (4th example) accompanying a chain | strand. It is a schematic diagram which shows the sequence of the attack process (5th example) accompanying a chain | strand.

  In the present embodiment, description will be made assuming a battle type puzzle game (hereinafter referred to as “game G”). In order to participate in the game G, the player needs to register as a player in the game server. Two players A and B face each other by the method described later. It is also possible for the computer to play against human player A as player B.

  Separate game fields are set for player A and player B. In the game field, a matrix of 6 rows and 8 columns is formed, and a total of 48 objects are arranged. In the present embodiment, there are four types of objects.

  Player A specifies one or more objects to be deleted in the game field. Since other objects flow into the erased area, the arrangement of the objects changes with erasure. When a predetermined number or more, for example, four or more, objects of the same type are adjacent to each other, a “chain” is established. Objects constituting the chain (hereinafter simply referred to as “chain object”) disappear, and the arrangement of the objects changes accordingly.

  A physical strength value is set for each of the players A and B. Attack power is accumulated every time a chain is established. For example, the attack power increases at an accelerated rate according to the number of chains. When the chain process is completed, in other words, when a stable state is reached in which no new chain is generated unless the next input is made, the opponent's physical strength value is subtracted according to the accumulated attack power. If the opponent's health level is set to zero, or if more health values are left than the opponent after the time limit has elapsed, the player wins.

  When both player A and player B are in the chain process, attack power is accumulated in both. Then, when the chain processing of both the player A and the player B is completed, the attack powers of the players with smaller attack power are subtracted after mutual attack power is canceled (described later).

FIG. 1 is a hardware configuration diagram of the game system 100.
In the game system 100, a plurality of game terminals 104 a, 104 b, 104 c... 104 n (hereinafter collectively referred to as “game terminal 104” when collectively referred to or not particularly distinguished) with respect to the game server 102. Connected through. The game terminal 104 in the present embodiment is assumed to be a smartphone. The game terminal 104 may be a portable game machine or a general-purpose computer such as a laptop PC. The game terminal 104 and the Internet 106 are wirelessly connected, but may be wired. A unique ID called a player ID is given in advance to the game player. The game server 102 provides a game to each game terminal 104.

FIG. 2 is a functional block diagram of the game system 100.
As described above, the game system 100 includes the game server 102 and the game terminal 104. Each component of the game terminal 104 and the game server 102 includes an arithmetic unit such as a CPU (Central Processing Unit) and various coprocessors, a storage device such as a memory and a storage, and hardware including a wired or wireless communication line connecting them. This is realized by software that is stored in a storage device and supplies processing instructions to an arithmetic unit. The computer program may be constituted by a device driver, an operating system, various application programs located in an upper layer thereof, and a library that provides a common function to these programs. Each block described below is not a hardware unit configuration but a functional unit block.
The game server 102 may be configured to include a web server, and the game terminal 104 may be configured to include a portable communication terminal and a web browser installed therein.

(Game server 102)
The game server 102 includes a communication unit 108, a data processing unit 110, and a data storage unit 112.
The communication unit 108 is in charge of communication processing with the game terminal 104 via the Internet 106. The data storage unit 112 stores various data. The data processing unit 110 executes various processes based on the data acquired by the communication unit 108 and the data stored in the data storage unit 112. The data processing unit 110 also functions as an interface between the communication unit 108 and the data storage unit 112. In addition to the game program, the data storage unit 112 stores information indicating the play state of each player. The play state is information indicating the progress of the game, such as the rank of the player and the items held.

The data processing unit 110 includes a player registration unit 116 and a game execution unit 114.
The player registration unit 116 receives player registration from the game terminal 104 via the communication unit 108. When player registration is requested, the player registration unit 116 gives a player ID to the player and registers it in the data storage unit 112. When the game module of the game G is installed in the game terminal 104, player registration is automatically requested.

  The game execution unit 114 controls the progress of the game. The game execution unit 114 records the play result on the game terminal 104 in the data storage unit 112. Further, in the battle play, the game field information and the operation information are exchanged between the players, thereby providing a common battle environment for the two players.

(Game terminal 104)
The game terminal 104 includes a user interface unit 118, a communication unit 124, a data processing unit 120, and a data storage unit 122.
The user interface unit 118 receives operations from the player via the touch panel, and is also in charge of processing related to the user interface such as image display and audio output. The communication unit 124 is in charge of communication processing with the game server 102 and other game terminals 104 via the Internet 106. The data storage unit 122 stores various data. The data processing unit 120 executes various processes based on the data acquired by the user interface unit 118 and the communication unit 124 and the data stored in the data storage unit 122. The data processing unit 120 also functions as an interface for the user interface unit 118, the communication unit 124, and the data storage unit 122.

  The user interface unit 118 includes an input unit 126 that receives input from the player, and an output unit 134 that outputs various information such as images and sounds to the player. The input unit 126 mainly detects a player's touch operation on the screen as an input.

  The output unit 134 includes a screen setting unit 170 that controls display of the play screen. The screen setting unit 170 includes a first field setting unit 172 that displays the first game field for the first player, and a second field setting unit 174 that displays the second game field for the second player. Hereinafter, the first player is referred to as “player A”, and the second player is referred to as “player B”.

  Player A in the present embodiment is a player who operates game terminal 104. Player B is a player who plays against player A. Player B may be a player who operates another game terminal 104 connected via the Internet 106. Here, the game terminal 104 operated by the player A and the game terminal 104 operated by the player B may be connected via wired communication or near field communication. Note that the player A may compete with NPC (Non Player Character) controlled by the game execution unit 132, that is, AI (Artificial Intelligence). Hereinafter, the player who plays against the player A will be described as a player B.

  The data processing unit 120 includes a game execution unit 132. The game execution unit 132 controls the progress of the game in cooperation with the game server 102. The game execution unit 132 of the game terminal 104 may be formed as a software module that is downloaded from the game server 102 as part of the function of the game execution unit 114.

  The communication unit 124 acquires various game information from the game server 102, and the data processing unit 120 causes the user interface unit 118 to display a game screen. Further, the user interface unit 118 detects various inputs by the user, and the data processing unit 120 notifies the game server 102 of input information via the communication unit 124. In response to this input information, the game execution unit 114 of the game server 102 controls the progress of the game in cooperation with the game execution unit 132 of the game terminal 104.

  Usually, the game play screen is generated by the game execution unit 132 of the game terminal 104 and is displayed by the output unit 134. In the case of multiplayer, the game execution unit 114 of the game server 102 manages game setting information common to each player. The game execution unit 132 of the game terminal 104 generates a play screen according to the game setting information provided by the game server 102 and the operation input by the player. The game execution unit 114 of the game server 102 updates the game setting information based on the operation input from each player.

The game execution unit 132 includes an additional time setting unit 176, an erasure unit 180, a win / loss determination unit 182, a replenishment unit 184, a chain counting unit 186, and an attack processing unit 188.
The additional time setting unit 176 sets an “additional time” to be described later. The additional time setting unit 176 sets the additional time (hereinafter referred to as “first additional time TA”) for the player A and the additional time (hereinafter referred to as “second additional time” for the player B). And a second additional time setting unit 192 for setting “TB”.

  The erasure unit 180 executes a process for erasing the object from the game field. The erasing unit 180 includes a designated erasing unit 198 that erases an object designated by the player, and a chain erasing unit 200 that erases a chained object when a chain is established. In accordance with an instruction from the erasure unit 180, the screen setting unit 170 executes an object erasure effect.

  The designation erasing unit 198 includes a first designation erasing unit 202 that erases an object designated by the player A, and a second designation erasing unit 204 that erases the object designated by the player B.

  The chain deletion unit 200 includes a first chain deletion unit 206 that deletes a chain object in the first game field, and a second chain deletion unit 208 that deletes a chain object in the second game field.

  The win / loss determination unit 182 determines whether the player A and the player B are winning or losing. As described above, winning or losing is determined based on the remaining physical strength value.

  The replenishing unit 184 replenishes a new object in the blank area generated when the object is erased by the erasing unit 180. In accordance with an instruction from the replenishing unit 184, the screen setting unit 170 performs an object replenishment effect. The replenishment unit 184 includes a first replenishment unit 210 that replenishes objects in the first game field and a second replenishment unit 212 that replenishes objects in the second game field.

  The chain counting unit 186 counts the number of chains. In the game G, when one chain object disappears, the next chain may be established due to a change in the arrangement of the object (details will be described later). In the present embodiment, the game G has an interest in continuous generation of chains. For example, the attack power increases at an accelerated rate as the number of chains increases. For this reason, as the number of chains in the first game field increases, the player A can increase the sense of expectation associated with the accumulation of attack power. On the other hand, for player B, as the number of chains increases in the opponent's second game field, the feeling of frustration associated with the accumulation of attack power can be enhanced. The chain counting unit 186 includes a first chain counting unit 214 that counts the number of chains in the first game field, and a second chain counting unit 216 that counts the number of chains in the second game field.

  The attack processing unit 188 calculates the attack power according to the number of chains, and subtracts the opponent's health value according to the attack power. The attack processing unit 188 includes a first attack processing unit 218 that executes an attack from the player A to the player B, a second attack processing unit 220 that executes an attack from the player B to the player A, and “offset processing”. A countervailing attack processing unit 222 is included. The cancellation process will be described later.

FIG. 3 is a screen view of the battle screen 128.
Player A and player B perform various operations in real time. A time limit (120 seconds in this embodiment) is set for the battle. The remaining time display area 142 indicates the remaining time. The first physical strength gauge 138 indicates the physical strength value of the player A, and the second physical strength gauge 140 indicates the physical strength value of the player B. The player who has left more physical strength values until the time limit elapses wins. Alternatively, even before the time limit has elapsed, if the opponent's health value is set to zero, the victory is won.

  The power gauge 144 indicates the superiority or inferiority of the player A and the player B. In FIG. 3, since the player B has more physical strength values than the player A, the power gauge 144 indicates that the player B is dominant. The force gauge 144 is linked to changes in the first strength gauge 138 and the second strength gauge 140.

  Player A operates the first game field 130. The operation target of the player B is the second game field 136. Hereinafter, when the first game field 130 and the second game field 136 are not particularly distinguished, they are referred to as “game field 146”. The game field 146 is partitioned into 6 rows and 8 columns, and a total of 48 objects 150 are laid in each area. Although there are four types of objects 150 in the present embodiment, the number may be three or less, or may be five or more.

  Player A selects (specifies) an arbitrary object 150 among the objects 150 in the first game field 130 by tapping. As long as there are adjacent objects 150, it is possible to select (specify) all at once by swiping a predetermined number of objects 150. The first designated erase unit 202 erases the selected (designated) object 150. Also, in the second game field 136, the object 150 selected (designated) by the player B is erased by the second designated erasure unit 204.

When the player B is a player of another game terminal 104, the input result of the player B is reflected in the second game field 136 of the game terminal 104 of the player A as needed. Further, the input result of the player A is reflected in the second game field 136 of the game terminal 104 of the player B.
Next, continuous generation of chained objects will be described with reference to FIGS.

FIG. 4 is a screen diagram in the first state of the first game field 130.
In the first game field 130, a chain is formed when four or more objects 150 of the same type are arranged side by side in the vertical and horizontal directions. When the chain is established, the first chain deletion unit 206 deletes the chain object from the first game field 130. In FIG. 4, it is assumed that the player A first selects the object 150a as an erasure target. Player A can select by touching the object 150a. When the object 150a disappears, the four objects 150 stacked on the object 150a fall.

FIG. 5 is a screen view of the first game field 130 in the second state.
FIG. 5 shows a state after only one object 150a disappears in FIG. 4 and four objects 150 on the object 150a fall. Since the same type of object 150d is located next to the object 150c, the objects 150f, 150c, 150d, and 150e form a chain object 152. The first chain deletion unit 206 deletes the chain object 152 from the first game field 130. When the chain object 152 including the four objects 150 disappears, a total of six objects 150 on the chain object 152 fall. The first chain counting unit 214 increments the number of chains from 0 to 1.

FIG. 6 is a screen diagram in the third state of the first game field 130.
FIG. 6 shows a state after the chain object 152 in FIG. 5 disappears and the six objects 150 on the chain object 152 have dropped. Since the same type of object 150i is located next to the object 150h, the objects 150g, 150h, 150i, and 150j form a new chain object 152. The first chain deletion unit 206 deletes the chain object 152 from the first game field 130. The first chain counting unit 214 increments the number of chains from 1 to 2.

  As described above, a new chain is further formed by the disappearance of the chain object 152 in the second state. Hereinafter, a period in which chaining occurs once or continuously, that is, a period in which an effect in which the chained object disappears and an effect in which the object is replenished with the disappearance of the chained object is referred to as a “chained period. "(Chain processing). Note that during the “chain period”, the player A cannot intervene in the chain in the first game field 130, such as touching and selecting the object 150, or touching and erasing the object 150. As the number of chains increases, the attack power of the player A is accumulated. When the new chain object 152 no longer exists, the first replenishment unit 210 replenishes the empty area of the first game field 130 with the object 150, and 48 objects 150 are spread over the first game field 130 again. Which object 150 should be replenished may be determined randomly. Replenishment may also create new chained objects 152. As long as the chain object 152 is established, the chain period continues until a stable state is reached in which no new chain object 152 is formed.

  In summary, the arrangement of the object 150 changes according to the erasure designation by the player A. When the chain object 152 is formed by changing the arrangement of the objects 150, the chain object 152 is deleted. When the chain object 152 is deleted, the arrangement of the object 150 changes again. If a new chain object 152 is formed here, the same processing is executed. When the chain object 152 is not formed, the first replenishment unit 210 replenishes the object 150. With replenishment, if a new chain object 152 is formed, the chain continues. When the chain period ends, the first attack processing unit 218 calculates the damage given to the player B by the attack power accumulated according to the number of chains. In accordance with this result, the output unit 134 updates the second physical strength gauge 140 and the force gauge 144.

  Hereinafter, for the sake of easy understanding, the attack power accumulated by the first chain is 10, the attack power accumulated by the second chain is 20, the attack power accumulated by the third chain is the 30, 4th attack power. It is assumed that the attack power accumulated by the chain is increased by 10 as the number of chains increases by one, such as 40. For example, the attack power when three chains are generated is 60 (= 10 + 20 + 30), and the attack power is 280 (= 10 + 20 + 30 + 40 + 50 + 60 + 70) if seven chains are generated.

  When player A forms a party with a plurality of characters, attributes may be associated with the characters. Character attributes correspond to the type of object 150. When the type (attribute) of the erased object and the attribute of the character in charge of the attack are the same, the actual attack power may be determined according to the attack power inherent in the character and the number of deletions.

FIG. 7 is a schematic diagram showing a sequence of attack processing (first example) associated with a chain.
Two horizontal axes are time axes indicating the play contents of the player A and the player B. In FIG. 7, the player A continuously generates two chains from time t1. At time t2 when the chain period ends, player B is not in the chain period. In this case, an attack is made from player A to player B at time t2. The first attack processing unit 218 calculates the attack power as 30 (= 10 + 20) corresponding to the two chains. On the battle screen 128, an attack effect is executed from the player A toward the player B. The physical strength value of the player B decreases corresponding to the attack power 30. The attack effect is shown, for example, as a moving image in which a light arrow flies from the first game field 130 to the second game field 136.

  As described above, when the chain period of the player A and the chain period of the player B do not overlap with each other in time, when the chain period of the player A ends, the player A changes the player B to the player B with an attack power according to the number of chains. Attacks are carried out.

FIG. 8 is a schematic diagram showing a sequence of attack processing (second example) associated with a chain.
Also in FIG. 8, player A has generated two chains from time t1. Player B generates a chain before time t2 (time t3) when the chain period of player A ends. The chain period of player B is from time t3 to time t4. From time t3 to time t2, the chain period of player A and the chain period of player B overlap (hereinafter, such a state is referred to as a “simultaneous chain state”). When the chain period of the player A ends (time t2) and the player B is in the chain period, the first additional time setting unit 190 sets the first additional time TA (time t2 to time t5). The first additional time TA in this embodiment is 10 seconds. When setting the first additional time TA, the first additional time setting unit 190 displays on the battle screen 128 that the attack can be continued, such as “Still more!”. Hereinafter, such display is referred to as “additional attack instruction”.

  When the first additional time TA is being set and the player B is in the chain period, the player A can make a new chain by further inputting to the first game field 130. If a new chain can be created, player A's attack power is added. However, when the chain period of the player B ends, the first additional time TA ends even before the expiration time t5.

  In FIG. 8, the chain period of the player B ends at the time t4 before the expiration time t5 of the first additional time TA. At time t4, the first additional time TA ends, and the cancellation attack processing unit 222 executes the cancellation process.

  Since player A has established two chains by the time of offset processing (time t4), the attack power of player A is 30. Since player B has only one chain established, the attack power of player B is 10. Player A has a greater attack power than player B. In this case, the attack from player B to player A is canceled, and only the attack from player A to player B is executed. However, the attack power 30 of the player A is partially offset by the attack power 10 of the player B. The calculation and attack execution processing for this purpose is called “offset processing”.

  The cancellation attack processing unit 222 first calculates the cancellation rate. The cancellation rate is (player B's attack power) / (player A's attack power). In the case of FIG. 8, the cancellation rate is 0.33 (= 10/30). Next, the final attack power is calculated by multiplying the attack power of the player A by (1-offset rate). In the case of FIG. 8, 30 × (1−0.33) = 20 (rounded down after the decimal point). The counterattack attack processing unit 222 subtracts the physical strength value of the player B corresponding to the attack power 20. Since the player B was able to create one chain just before the time t2 (time t3) when the chain period of the player A ends, the attack from the player A can be mitigated.

The conditions for offsetting are:
(Condition X1) The simultaneous chain state occurs (Condition X2) Both of the two conditions that the chain periods of Player A and Player B both end are satisfied.

The conditions for setting the first additional time TA are:
(Condition Y1) A simultaneous chain state occurs (Condition Y2) When the chain period of Player A ends, the chain period of Player B continues (Condition Y3) The cancellation process after the simultaneous chain state occurs Is executed, the first additional time TA can be set only once. All three conditions are satisfied.

The conditions for the end of the first additional time TA are:
(Condition Z1) The first additional time TA has passed (Condition Z2) One of the two conditions that both the chain periods of Player A and Player B end is satisfied. When the offset process is executed, the first additional period ends.

FIG. 9 is a schematic diagram showing a sequence of attack processing (third example) associated with a chain.
In FIG. 9, player A has generated two chains from time t1. From time t5 before time t2 when the chain period of player A ends, player B generates four chains. From time t5 to time t2 is the simultaneous chain state (condition X1, condition Y1 is established). When the chain period of the player A ends (time t2), the chain period of the player B continues, so the conditions Y2 and Y3 are also established, and the first additional time setting unit 190 sets the first additional time TA. At this time, the first additional time setting unit 190 displays an additional attack instruction.

  In the third example of FIG. 9, at time t3 before the expiration time t8 of the first additional time TA and before time t6 when the player B completes the chain process, the player A generates two chains. . Player A's attack power is added by the new two chains. On the other hand, at the end time t6 of the four chains of the player B, the second additional time setting unit 192 sets the second additional time TB. The second additional time TB expires at time t7. The second additional time setting unit 192 causes the player B to display an additional attack instruction. At time t4, the chain period of player A ends. At this time, the conditions X2 and Z2 hold, the second additional time TB ends, and the canceling process is executed.

  Since player A has established two chains twice, the attack power of player A is 60 (= (10 + 20) × 2). On the other hand, since the player B has established four chains, the attack power of the player B is 100 (= 10 + 20 + 30 + 40). The attack from player A to player B is canceled and only the attack from player B to player A is made.

  The offset rate is 0.60 (= 60/100) from (attack power of player A) / (attack power of player B). Multiplying the attack power 100 of the player B by (1−offset ratio), the final attack power is 100 × (1−0.60) = 40. Since the player A was able to create two chains during the chain period of the player B and during the first additional time TA, the player B can mitigate the attack of the player B.

FIG. 10 is a schematic diagram showing a sequence of attack processing (fourth example) associated with a chain.
Also in FIG. 10, player A has generated two chains from time t1. At time t5 before time t2 when the chain period of player A ends, player B generates four chains. From time t5 to time t2, a simultaneous chained state is established. When the chain period of player A ends (time t2), since player B is in the chain period, conditions Y1 to Y3 are satisfied, and the first additional time TA is set. The first additional time setting unit 190 displays an additional attack instruction.

  In the fourth example of FIG. 10, at time t3 before the expiration time t8 of the first additional time TA and before time t6 when the chain period of the player B ends, the player A newly generates two chains. ing. At time t6 when the four chains of player B end, the second additional time setting unit 192 sets the second additional time TB. The second additional time TB expires at time t7. The second additional time setting unit 192 causes the player B to display an additional attack instruction. At time t4, the chain period of player A ends.

  At the time t9 before the expiration time t7 of the second additional time TB and before the time t4 when the chain processing of the player A ends, the player B newly generates two chains. By these two chains, the attack power of player B is added. On the other hand, at time t4, since the player A has already set the first additional time TA, the condition Y3 is not satisfied. For this reason, the first additional time TA is not reset for the player A. After the time t4, the player A can only wait for the player B's chain period to end. At the time t10, the chain period of the player B ends, so the condition Z2 is satisfied and the canceling process is executed.

  Since player A has established two chains twice, the attack power of player A is 60 (= (10 + 20) × 2). On the other hand, since the player B has established four chains and two chains, the attack power of the player B is 130 (= (10 + 20 + 30 + 40) + (10 + 20)). In this case, only the attack from the player B to the player A is made.

  The offset rate is 0.46 (= 60/130) from (attack power of player A) / (attack power of player B). When the attack power 130 of the player B is multiplied by (1−offset rate), the final attack power is 130 × (1−0.46) = 70.

FIG. 11 is a schematic diagram showing a sequence of attack processing (fifth example) associated with a chain.
In FIG. 11, player A generates two chains from time t1 to time t2, and player B generates five chains at time t8. From time t8 to time t2 is a simultaneous chain state. When the chain period of the player A ends (time t2), the first additional time setting unit 190 sets the first additional time TA (time t2 to time t7). An additional attack instruction is displayed at time t2.

  Player A adds one chain from time t3 to time t4. At time t4 when one chain ends, since the chain of player B continues and the first additional time TA has not expired, the additional attack instruction is displayed again. Player A generates two chains from time t5 before expiration time t7 of the first additional time TA. On the other hand, since the two chains are generated, the condition Y2 is satisfied at the time t9 when the five chains of the player B are completed, and the second additional time TB is set. An additional attack instruction is displayed for player B.

  The two chains of player A end at time t6. The player B generates seven chains from the time t10 before the expiration time t11 of the second additional time TB and before the time t6 when the two chains of the player A end. The cancellation process is executed at time t12 when the seven chains end.

  Since player A has established two chains twice and one chain once, the attack power of player A is 70 (= (10 + 20) × 2 + 10). On the other hand, since player B has established 5 chains and 7 chains, the attack power of player B is 430 (= (10 + 20 + 30 + 40 + 50) + (10 + 20 + 30 + 40 + 50 + 60 + 70)). In this case, only the attack from the player B to the player A is made.

  The cancellation rate is 0.16 (= 70/430) from (attack power of player A) / (attack power of player B). When the attack power 430 of the player B is multiplied by (1-offset ratio), the final attack power is 430 × (1−0.16) = 361. Player A added two chains at time t5, but these two chains resulted in seven chains of player B as a result. For this reason, the player A cannot mitigate the attack of the player B by the last two chains, but rather receives a stronger counterattack from the player B.

The game system 100 has been described based on the embodiments.
According to the game system 100 in the present embodiment, a game property is realized in which two players compete for the number of chains simultaneously in a competitive puzzle game. Since the opponent's chain and one's own chain influence each other, it is possible to simultaneously enhance the two conflicting interests of feeling irritated when the opponent's chain continues and expectation when the other's chain continues. In particular, a unique battle sensation like “shooting” can be created in the simultaneous chain state.

  In the simultaneous chain state, additional time is set even if the chain ends first. If a new chain can be started within a limited time such as additional time, the damage can be mitigated when damage is taken in the offset process. If a large chain can be generated during the additional time, the inferiority can be recovered and reversed. On the other hand, since a chain is generated, an unexpected counterattack as shown in FIG. 11 may occur. Considering the other party's chain status, your own chain status, and the remaining time, you may decide not to create a new chain during the additional time. In this way, a peculiar game characteristic in which high-level and instantaneous judgment affects winning or losing is realized.

  In addition, this invention is not limited to the said embodiment and modification, A component can be deform | transformed and embodied in the range which does not deviate from a summary. Various inventions may be formed by appropriately combining a plurality of constituent elements disclosed in the above embodiments and modifications. Moreover, you may delete some components from all the components shown by the said embodiment and modification.

Although it has been described that the game system 100 is configured by a plurality of game terminals 104 and one game server 102, some of the functions of the game terminal 104 may be realized by the game server 102, or the functions of the game server 102 may be A part may be assigned to the game terminal 104. In addition, a third device other than the game server 102 or the game terminal 104 may bear a part of the function.
A set of each function of the game terminal 104 and each function of the game server 102 described in FIG. 2 can be generally grasped as one “information processing apparatus”. How to allocate a plurality of functions necessary for realizing the present invention to one or a plurality of hardware depends on the processing capability of each hardware, the specifications required for the game system 100, and the like. It only has to be decided.

  An attribute may be associated with the type of the object 150. For example, when there are five types of objects 150 of red, blue, yellow, purple, and green, the strength between attributes may be set such that red is strong against green and blue is weak against green. When the chain object 152 is formed by the red object 150, the red attack power is added. When the chain object 152 is formed by the blue object 150, the blue attack power is added. Attributes are set for you and your opponent.

  For example, when the player B to be attacked has the green attribute and the player A establishes the red chain object 152, the attack power is doubled because the green is a good attribute for red. When the player A establishes the blue chain object 152, the attack power is halved because green is a weak attribute for blue. More specifically, when the player A establishes the red chain object 152 and the red attack power is 60, and the player B has the green attribute, the attack power is doubled to 120. On the other hand, even if the player A establishes the blue chain object 152 and the blue attack power is 60, the attack power is halved to 30 that is half of that. By complicating the element of “attribute”, more complex and advanced game characteristics are realized.

As a more specific example, it is assumed that player A and player B establish a red attribute chain object 152, a blue attribute chain object 152, and a green attribute chain object 152, respectively, in the chain period. The attack power of each chain object 152 is
Player A: Red 100, Blue 200, Green 150 (total 450)
Player B: Red 50, Blue 80, Green 200 (total 330)
Suppose that The player B is superior to the player A in the attack power of the green attribute, but the player A is superior in the total attack power. At this time, an attack from player A to player B is executed.

  A cancellation rate is calculated based on the total attack power. The offset rate is 73% (rounded down to the nearest decimal point) due to 330/450. At this time, the red attack power of player A is 27 (= 100 × (1−0.73)), the blue attack power is 53 (= 200 × (1−0.73)), and the green attack power is 40 (= 150). X (1-0.73)). If the player B has the green attribute, or the attacked character among the characters held by the player B has the green attribute, the red attack power of the player A is good at the green attribute, 54 (= 27 × 2). The blue attack power is corrected to 26 (= 53/2) because the green attribute is not good. The green attack power is neutral with respect to the green attribute, so it remains 40. As a result, the attack power from player A to player B after offset becomes 120 (= 54 + 26 + 40). In this way, after comparing superiority and inferiority based on the overall attack power, the offset rate is calculated, the attack power of each attribute is discounted by the offset rate, and the attack power of each attribute is calculated based on the strength between attributes The final attack power may be determined by correcting. According to such a control method, it is necessary to consider not only how the chain is generated but also what chain is generated according to the attribute of the opponent, so that the strategy of the game can be further deepened. .

  DESCRIPTION OF SYMBOLS 100 Game system, 102 Game server, 104 Game terminal, 106 Internet, 108 Communication part, 110 Data processing part, 112 Data storage part, 114 Game execution part, 116 Player registration part, 118 User interface part, 120 Data processing part, 122 Data storage unit, 124 communication unit, 126 input unit, 128 battle screen, 130 first game field, 132 game execution unit, 134 output unit, 136 second game field, 138 first physical strength gauge, 140 second physical strength gauge, 142 Remaining time display area, 144 force gauge, 146 game field, 150 object, 152 chain object, 170 screen setting unit, 172 first field setting unit, 174 second field setting unit, 176 additional time setting Part, 180 elimination part, 182 win / loss determination part, 184 supplement part, 186 chain counting part, 188 attack processing part, 190 first additional time setting part, 192 second additional time setting part, 198 designated elimination part, 200 chain elimination part 202 First designated erase unit, 204 Second designated erase unit, 206 First chain erase unit, 208 Second chain erase unit, 210 First supplement unit, 212 Second supplement unit, 214 First chain count unit, 216 First 2 chain counting part, 218 1st attack processing part, 220 2nd attack processing part, 222 countering attack processing part, TA 1st addition time, TB 2nd addition time.

Claims (3)

A field setting unit for setting two game fields in which a plurality of types of objects are arranged for the first and second players,
A designated erasure unit for erasing one or more objects selected by the first and second players in each of the two game fields;
In each of the two game fields, when the same type of object forms a chain of a predetermined number or more, a chain erasure unit that erases the chained object;
When an object is deleted, a replenishment unit that refills the game field with a new object,
In each of the two game fields, a chain counting unit that counts the number of chains each time a new chain is formed as an object is deleted,
An attack processing unit that accumulates attack power according to the number of chains, and after the continuation of the chain by one player ends, an attack processing unit that reduces the physical strength value of the other player according to the attack power accumulated by the one player;
When chain processing in two game fields proceeds simultaneously, after both chain processing ends, the attack of one player who has accumulated a higher attack power out of the attack power accumulated by each of the first and second players A counterattack attack processing unit that executes a counterbalance process for reducing the strength value of the other player after partially reducing the strength,
An additional time setting unit for setting an additional time for the one player when the chain processing by one player ends before the chain processing by the other player after the chain processing in the two game fields progresses simultaneously;
A win / loss determination unit that performs a win / loss determination of the first and second players according to physical strength values of the first and second players,
The additional time setting unit sets the additional time to the one player on the condition that the additional time has not been set for the one player after the simultaneous progress of chain processing in two game fields has occurred. Set
The attack processing unit adds attack power according to the number of chains newly established before the additional time ends,
The information processing apparatus according to claim 1, wherein the countervailing attack processing unit executes the canceling process when the chain process is completed in both of the game fields even before the additional time ends.   The counterattack attack processing unit calculates a ratio of the attack power accumulated by one player and the attack power accumulated by the other player as an offset rate, and discounts the attack strength of the player with the higher attack strength according to the offset rate The information processing apparatus according to claim 1, wherein the physical strength value of the player with the smaller amount of accumulated attack power is subtracted. A field setting process for setting two game fields in which a plurality of types of objects are arranged for each of the first and second players;
A designated erasure process for erasing one or more objects selected by the first and second players in each of the two game fields;
In each of the two game fields, when the same kind of objects form a predetermined number or more of chains, a chain erasure process for erasing the chained objects;
When an object is deleted, a replenishment process that refills the game field with a new object,
In each of the two game fields, a chain counting process that counts the number of chains each time a new chain is formed as an object is deleted,
Attack processing that accumulates attack power according to the number of chains, and after the chain continuation by one player ends, attack processing that reduces the physical strength value of the other player according to the attack power accumulated by the one player;
When chain processing in two game fields proceeds simultaneously, after both chain processing ends, the attack of one player who has accumulated a higher attack power out of the attack power accumulated by each of the first and second players An offset attack process for executing an offset process for reducing the strength value of the other player after partially reducing the strength,
An additional time setting process for setting an additional time for the one player when the chain process by one player is finished before the chain process by the other player after the chain process in the two game fields progresses simultaneously;
Causing the computer to execute a win / loss determination process for determining win / loss of the first and second players according to the physical strength values of the first and second players,
In the additional time setting process, the additional time is set to the one player on the condition that the additional time is not set for the one player after the simultaneous progress of the chain processes in the two game fields occurs. Set
The attack process adds attack power according to the number of chains newly established before the additional time ends,
The game program characterized in that the countervailing attack process is executed when the chain process is completed in both of the game fields even before the additional time is over.

Images