JP7335174B2 - GAME PROGRAM, GAME DEVICE, GAME SYSTEM, AND GAME PROCESS CONTROL METHOD - Google Patents

Description

The present invention relates to game processing in a competitive game, and more particularly to processing for specifying an opponent to be attacked.

Conventionally, there has been known a game in which players compete in a so-called dropout game (for example, Patent Document 1). In addition, in this game, two players form one team, and a team battle of 2vs2 is possible. Also, in this game, one player in the first team can collect balls accumulated in a predetermined range of the other player's game field as blocks. It also discloses that this can prevent accumulated balls from reaching the top of the game field, and that one player can use the other player's balls to attack the opposing team. It is

Japanese Unexamined Patent Application Publication No. 2011-55981

However, in the above technique, since there is only one team to be the opponent, there is practically no or little room to select the opponent to attack. In other words, in a game in which each player progresses independently, there has been a lack of a method of selecting an opponent to be attacked. In other words, there is room for improvement in terms of interest in the tactics of competitive games in terms of the selection of attacking opponents.

SUMMARY OF THE INVENTION Therefore, it is an object of the present invention to provide a game program, a game device, a game processing method, and a game system that are capable of enhancing interest in the tactics of a competitive game.

In order to achieve the above object, for example, the following configuration examples are given.

An example of the configuration is a game program executed in a computer of an information processing apparatus for providing a user with a competitive game, wherein the computer comprises game execution means, acquisition means, image generation means, and policy selection. It functions as a means, a specifying means, and a change instructing means. The game executing means executes a first game process that progresses independently of a second game process related to the opponent of the user based on the user's operation. The acquisition means sequentially acquires situation data indicating second game situations of second game processing related to a plurality of opponents. The image generation means generates a first image that reflects a first game situation of the first game process, and a plurality of second game situations that are images that reflect a second game situation indicated by the plurality of situation data acquired by the acquisition means. A display image including the image is sequentially generated. The policy selection means is a policy for selecting at least one of a plurality of opponents, and selects any one of a plurality of preset policies based on a user's operation. The identifying means identifies at least one of the plurality of opponents as a target based on the selected policy. The change instruction means issues an instruction to change the game situation of the opponent identified as the target by the identification means when the user's game situation satisfies a predetermined condition.

According to the above configuration example, while the user performs the game processing that progresses independently of the opponents, the user can select which of the plurality of opponents to change the game situation according to the policy selected by the user. Since the selection can be made based on the tactics of the battle game, it is possible to improve the interest in the tactics of the battle game. In particular, when it is desired to select a predetermined opponent from a large number of opponents, it is possible to make a prompt selection that reflects the user's intention.

As another configuration example, the acquisition means sequentially acquires situation data including specified information data indicating whether or not each of a plurality of opponents has specified the user as a target, and the image generation means When the specified information data indicates that the user is specified as the target, successively generating display images including a third image for making it possible to determine that the opponent specifies the user as the target. You may

According to the above configuration example, it is possible to easily determine which opponent the user is targeted by, and to improve the sense of urgency of the game.

As another configuration example, the image generation means generates a second image so as to include a display in which the ranking of each of the plurality of opponents can be determined based on the situation data acquired by the acquisition means, and includes the second image in the display image. You may do so.

As another configuration example, the image generation means may include a display that allows the player to distinguish the order determined at the time the opponent becomes unable to continue the game, when the opponent cannot continue the game. A second image may be generated and included in the display image.

According to the above configuration example, it is possible to allow the user to grasp the order of the opponents, and to easily determine the progress of the entire competitive game.

As another configuration example, the acquisition means may continue to sequentially acquire the situation data even after the user's game situation becomes such that the game cannot be continued. Further, the image generating means may sequentially generate the display images including the second image based on the situation data even after the user's game situation becomes such that the game cannot be continued.

According to the above configuration example, even after the user himself/herself is defeated in the competitive game, the user can check the subsequent game status of all the opponents. As a result, even after the user loses the game, the user can enjoy the subsequent situation and development of the battle game in which the user has participated.

As another configuration example, the image generating means may sequentially generate display images such that the first image is arranged in the first area and each of the plurality of second images is arranged in the second area.

According to the above configuration example, it is possible to present the user with the game situation of the opponent in addition to the situation of the game the user is progressing.

As another configuration example, the image generating means arranges the first image in a first area located in the center of the display image, and places each of the second images in a second area located at a position different from the first area. The display images may be generated sequentially so as to be arranged.

According to the configuration example described above, it is possible to present to the user the situation of the game in progress by the user in a manner that makes it easy to distinguish from the situation of the game in progress of the opponent.

As another configuration example, the image generating means arranges the first image in a first area located in the center of the display image, arranges the second areas one by one at the left and right positions of the first area, The display images may be sequentially generated such that the second images are arranged in the left and right second regions, respectively.

According to the above configuration example, it is possible to display the game image of the game in progress by the user in the center. Images indicating the game status of the opponent can be displayed on the left and right sides of the screen. This makes it possible to minimize the movement of the line of sight between the player's own game image and the image showing the opponent's game situation.

As another configuration example, the image generation means sequentially generates a display image (161) in which the target image is superimposed on the second image generated based on the situation data indicating the game play situation of the opponent identified as the target. may be generated.

According to the above configuration example, it is possible to make it easier for the user to grasp the opponent who is currently targeted.

As another configuration example, the battle game may be a puzzle game in which puzzle objects that increase over time within a predetermined play field are eliminated. Furthermore, the change instructing means may issue an instruction to increase the number of the opponent's puzzle objects identified as targets by the identifying means. Then, when the arrangement state of the puzzle objects within the play field satisfies a pre-defined defeat condition, the game program determines that the game cannot be continued, and determines that the game cannot be continued. The computer may further function as victory/loss determination means for judging that the victory condition is satisfied when the player remains unfulfilled until the end of all players without satisfying the defeat condition.

According to the above configuration example, while the user's own game is progressing, the user is instructed to appropriately change the game situation of the opponent, and the user is presented with a competitive puzzle game in which the purpose is to continue playing until the end without satisfying the defeat condition. can provide.

As another configuration example, the game program is such that the game situation of an opponent specified as a target by the user is increased by an instruction given by the change instruction means of the information processing device of the user. The computer may further function as addition means for adding a predetermined value to the number of defeat inductions associated with the user when the defeat condition is satisfied. Furthermore, the situation data may include defeat induction number information indicating the number of defeat inductions of the opponent. You may make it generate|occur|produce the 2nd image containing.

According to the above configuration example, it is possible to make it easier for the player to grasp who the user has led many opponents to defeat.

As another configuration example, the adding means adds, when adding a predetermined value to the number of defeat inductions associated with the user, a value obtained by adding the number of defeat inductions possessed by an opponent who has satisfied the defeat condition as the predetermined value. good too.

According to the above configuration example, it is possible to enhance the strategy of the competitive game and enhance the interest of the game.

As another configuration example, the specifying means may specify, as a target, an opponent with the largest number of defeat inducements when the policy selected by the policy selecting means is the first policy.

According to the above configuration example, by targeting users with a large number of defeat inductions, it is possible to easily earn the number of defeat inductions.

As another configuration example, when the policy selected by the policy selection means is the second policy, the identifying means, based on the identified information data, targets the opponent who has identified the user as the target of the user. may be specified.

According to the above configuration example, an opponent who has set itself as a target can be set as one's own target. As a result, when a player is being targeted by a large number of opponents, the operation of selecting these opponents as targets can be simplified. In addition, it is possible to prevent the user from being in a one-sidedly disadvantageous situation, and to make the game balance appropriate.

According to this embodiment, when a predetermined opponent is to be selected from a large number of opponents, a prompt selection operation that reflects the user's intention can be performed.

Schematic diagram showing an overall image of an information processing system according to the present embodiment Appearance of the game system FIG. 2 is a block diagram showing an example of the internal configuration of the main unit 2; Block diagram showing an example of the internal configuration of the server 101 An example of a game image according to this embodiment Enlarged view of the first region 151 An example of a game image according to this embodiment An example of a game image according to this embodiment Enlarged view of the first region 151 Enlarged view of the first region 151 Enlarged view of the first region 151 Enlarged view of the first region 151 An example of a game image according to this embodiment The figure which expanded the 2nd area|region 152L of FIG. An example of a game image according to this embodiment An example of a game image according to this embodiment An example of a game image according to this embodiment An example of a game image according to this embodiment An example of a game image according to this embodiment Memory map showing an example of various data stored in the storage unit 84 of the main unit 2 An example of the configuration of server transmission data 305 An example of the data configuration of the update data 306 An example of the configuration of opponent data 307 An example of the data configuration of the standby block data 309 Memory map showing an example of various data stored in the storage unit 112 of the server 101 A diagram showing the flow of overall processing by cooperation between the server 101 and each game system 1 Flowchart showing the details of this game process Flowchart showing the details of this game process Flowchart showing the details of this game process Flowchart showing details of block erase related processing Flowchart detailing blockage processing Flowchart detailing game over processing Flowchart detailing server processing

An embodiment of the present invention will be described below. FIG. 1 is a schematic diagram showing an overview of an information processing system according to this embodiment. An information processing system 100 of this embodiment includes a server 101 and a plurality of game systems 1 . The server 101 and each game system 1 are configured to be able to communicate via the Internet 103 .

As an example of the information processing executed with the configuration as described above, in the present embodiment, game processing will be described as an example. Specifically, while each game system 1 executes a game process that progresses independently of the other game systems 1 based on the operation of a single user, the game process is performed between the game systems 1 via the server 101. By transmitting and receiving predetermined data based on the above, game processing for realizing a multiplayer competitive game is executed.

Next, the game system 1 according to this embodiment will be described. This game system may be of any type, but FIG. 2 shows an external view of the game system used in this example as an example. The game system 1 shown in FIG. 2 includes a main device (information processing device; in this embodiment, functions as a game device main body) 2, a left controller 3 and a right controller 4. As shown in FIG. A left controller 3 and a right controller 4 are detachable from the main unit 2 . In other words, the game system 1 can be used as an integrated device in which the left controller 3 and the right controller 4 are attached to the main unit 2 respectively. The game system 1 can also use the main device 2 and the left controller 3 and right controller 4 as separate bodies. FIG. 2 is a diagram showing an example of a state in which the left controller 3 and the right controller 4 are attached to the main unit 2. As shown in FIG. As shown in FIG. 2, the left controller 3 and the right controller 4 are attached to and integrated with the main unit 2 respectively. The main device 2 is a device that executes various types of processing (for example, game processing) in the game system 1 . The main unit 2 has a display 12 . The left controller 3 and the right controller 4 are devices provided with operation units for user input.

FIG. 3 is a block diagram showing an example of the internal configuration of the main unit 2. As shown in FIG. The main unit 2 includes a processor 81 . Processor 81 is an information processing unit that executes various types of information processing executed in main unit 2, and is, for example, a CPU (Central Processing Unit).
Unit), or may be composed of a SoC (System-on-a-Chip) including multiple functions such as a CPU function and a GPU (Graphics Processing Unit) function. The processor 81 executes various types of information processing by executing an information processing program (eg, game program) stored in the storage unit 84 . Note that the storage unit 84 may be, for example, an internal storage medium such as a flash memory or a DRAM (Dynamic Random Access Memory), or may be configured to use an external storage medium or the like mounted in a slot (not shown).

The main unit 2 has a network communication unit 82 . A network communication unit 82 is connected to the processor 81 . The network communication unit 82 communicates (specifically, wirelessly) with an external device via a network. In this embodiment, the network communication unit 82 communicates with an external device by connecting to a wireless LAN according to a method conforming to the Wi-Fi standard as the first communication mode. In addition, the network communication unit 82 performs wireless communication with other main device 2 of the same type by a predetermined communication method (for example, communication using a unique protocol or infrared communication) as a second communication mode. Note that the wireless communication according to the second communication mode is capable of wireless communication with another main unit 2 placed in a closed local network area, and direct communication is performed between a plurality of main units 2. It realizes a function that enables so-called "local communication" in which data is transmitted and received by

The main unit 2 includes a controller communication section 83 . Controller communication unit 83 is connected to processor 81 . The controller communication unit 83 performs wireless communication with the left controller 3 and/or the right controller 4 when the main unit 2 and the left controller 3 and right controller 4 are used separately. The communication method between the main unit 2 and the left controller 3 and the right controller 4 is arbitrary. (registered trademark) standards.

The main unit 2 also includes a left terminal 17 that is a terminal for performing wired communication between the main unit 2 and the left controller 3 , and a right terminal 21 for performing wired communication between the main unit 2 and the right controller 4 .

Display 12 is also connected to processor 81 . The processor 81 displays on the display 12 images generated (for example, by executing the information processing described above) and/or images obtained from the outside.

Main unit 2 includes codec circuit 87 and speakers (more specifically, left speaker and right speaker) 88 . The codec circuit 87 is connected to the speaker 88 and the audio input/output terminal 25 as well as to the processor 81 . The codec circuit 87 is a circuit that controls input/output of audio data to/from the speaker 88 and the audio input/output terminal 25 .

Although illustration is omitted, images and sounds generated by the main unit 2 can also be output to an external monitor/external speaker via a predetermined output terminal.

[About the controller]
Although not shown, each of the left controller 3 and the right controller 4 has a communication control unit that communicates with the main unit 2 . When the left controller 3 and the right controller 4 are attached to the main unit 2, wired communication via the left terminal 17 and the right terminal 21 is possible. Also, when the main unit 2 and the left controller 3 and right controller 4 are used separately, it is possible to communicate with the main unit 2 by wireless communication without going through the terminals. The communication control unit acquires information on input (specifically, information on operation) from each input unit of the controller. information) is transmitted to the main unit 2. The operation data is repeatedly transmitted at a rate of once in a predetermined period of time. The input section may be the same or may not be the same.

[Server hardware configuration]
Next, the configuration of the server 101 will be described. FIG. 4 is a block diagram showing an example of the internal configuration of the server 101. As shown in FIG. The server 101 includes at least a processor 111 , a storage unit 112 and a communication unit 113 . The processor 111 executes various programs for controlling the server 101 . The storage unit 112 stores various programs executed by the processor 111 and various data to be used. The communication unit 113 connects to the Internet 103 through wired or wireless communication, and transmits and receives predetermined data to and from the game system 1 .

[Outline of game processing]
Next, an overview of the game processing executed in this embodiment will be described. In this embodiment,
As an example of the game process, a puzzle game process is executed in which "puzzle objects" that increase over time are erased. Specifically, in this embodiment, in a two-dimensional playfield, by moving and rotating puzzle objects that fall one by one from the top as time passes and stacking them up, a predetermined condition is satisfied. Action-puzzle game processing is executed to erase at least part of the piled-up puzzle objects (this is game processing also called “lost puzzle”). Examples of the puzzle object include grid-shaped blocks, capsule-shaped pieces, panels of a predetermined shape, and the like. In addition, the predetermined conditions include, for example, filling one horizontal row with blocks, arranging a predetermined number or more of panels of the same color in a predetermined direction, arranging a predetermined number or more of panels with the same pattern, and pieces of the same shape. to form a predetermined shape (such as a square) with blocks of the same color. In the present embodiment, the play field is assumed to be a play field of 20 vertical squares by 10 horizontal squares, and an example is taken in which block groups forming various shapes fall as puzzle objects. Also, as a predetermined condition, an example will be described in which a block is erased when one horizontal line of the play field is filled with blocks. For example, each user moves a group of blocks falling from the upper part of the play field 1511 in the left-right direction or downward direction, and rotates the group of blocks. Then, by dropping it onto the bottom of the playfield or another block that has already been piled up, the position of that block can be fixed. As a result, if one horizontal row is filled with blocks, the blocks for that one horizontal row are erased. Also, when the blocks pile up to the top of the playfield, the game is over.

Also, as the puzzle game processing according to the present embodiment, a game processing in which up to 99 users can play against each other is assumed. An outline of this match will be explained. First, the condition for winning the match is "remain until the end without game over among 99 players". In this game, while each user individually advances the puzzle game, it is possible to interfere with the progress of the game by sending an "obstructing block" to a predetermined other user, which will be described later. In this way, the users aim to progress their own puzzle game while trying to interfere with the progress of other users' games, and to continue playing to the end without the game being over. In the following description, sending such a "disturbing block" to another user is referred to as an "attack" to another user.

More specifically, the display 12 of each game system 1 displays a game image as shown in FIG. 5, which is an example of a display image. Although the details of the components of the game image will be described later, each user performs an operation related to the puzzle game on a play field 1511 described later, and the puzzle game process proceeds individually for each user. In other words, basically, only the contents of the operation data generated by each user operating his or her own controller are reflected in the playfield of each user. In other words, there is no object or the like in the playfield that directly reflects operation data related to a controller operated by another user. For example, it is not a fighting game such as a fighting game or a racing game in which characters operated by multiple users exist in the same stage or in the same game field, and the operations of each user are reflected. . And in this game, when the above blocks are erased, by sending special blocks called "obstructing blocks" to other users who are set as "targets" at that time, users can be attacked. Conversely, it is also possible that another user sends a "block block". In other words, it may be attacked by other users. In this embodiment, data relating to the "obstructing block" and data indicating the playfield status of each user are transmitted and received between other users. As a result, while progressing the puzzle game individually in each game system 1, based on the transmitted and received data, an image reflecting the situation of the other user's playing field is also displayed, and the situation of the other user can be grasped. I am making it possible. It also reflects "attacks" between users. In other words, while each game system 1 independently progresses the puzzle game process, by linking the game processes between the game systems 1 using the transmitted and received data, the battle game process according to the present embodiment is realized. are doing.

[Game image example]
Next, the constituent elements of the game image in this puzzle game process, and the user's operations and gimmicks associated therewith will be described. FIG. 5 is an example of a game image of this puzzle game displayed on the display 12 of each game system 1. As shown in FIG. FIG. 5 shows a first region 151, a second region 152L, and a second region 152R (hereinafter collectively referred to as the second region 152). The first area 151 is arranged substantially in the center of the game image, and the second area 152L is arranged on the left side thereof. A second region 152R is arranged on the right side of the first region 151. As shown in FIG. In the first area 151, various images related to a puzzle game that progresses mainly through user's operation of the game system 1 are displayed. The second areas 152L and 152R display images showing the play field of the puzzle game being played by other users. In addition, in the following description, the said other user is called an "opponent."

Next, details of the first area 151 will be described. FIG. 6 is an enlarged view of the first region 151. As shown in FIG. In FIG. 6, in the first area 151, a play field 1511, a standby block area 1512, a next block area 1513, and a badge display area 1514 are displayed. A strategy operation panel 1515 is also displayed near the upper end of the play field 1511 .

The play field 1511 is a two-dimensional field consisting of 10 horizontal squares and 20 vertical squares, and is also the main part of this puzzle game. The block group falls downward from above the play field 1511 . As described above, the user can perform operations such as moving the block group left and right within the play field 1511 and rotating it. Then, it is possible to erase a block in which one horizontal row is filled. In FIG. 6, each square is shown separated by a dotted line, but in the actual game image, the lines indicating such squares may or may not be displayed.

Next, the waiting block area 1512 is an area for displaying information about the "obstructing block" sent by the opponent. The display contents of this area will be described later together with the description of the "obstructive block".

The next block area 1513 is an area for presenting blocks scheduled to fall in the future. In this game, blocks of various shapes fall one by one, and the order in which these blocks fall is the same for all 99 users.

The badge display area 1514 is an area for displaying the "badge" acquired by the user. The "badge" indicates the number of opponents whose game is over due to the "obstructing block" sent by the user (in other words, the number of opponents the user finished off). Details of the "badge" will be described later.

The strategy operation panel 1515 is an operation panel for selecting "strategy". Although the details will be described later, a "strategy" is an example of a strategy for selecting an opponent (hereinafter referred to as a "target") to be attacked (to which an obstructive block is sent). The processor 81 sets a predetermined user among the 98 opponents as a "target" based on the strategy selected at that time. Note that, in the present embodiment, an analog stick included in the right controller 4 is used as the strategy selection operation. By tilting the analog stick up, down, left, and right, one of four strategies corresponding to each direction is selected. In FIG. 6, a circle image imitating an analog stick is displayed in the approximate center of the strategy operation panel 1515, and option images indicating strategy names are displayed in the up, down, left, and right directions, respectively. With such a configuration, it is possible to quickly perform a strategy selection operation without interfering with the user's puzzle game operation (block movement or rotation operation) as much as possible.

Next, the second regions 152L and 152R shown in FIG. 5 will be described. As described above, the second region 152L is arranged on the left side of the first region 151, and the second region 152R is arranged on the right side of the first region 151. As shown in FIG. In the second area 152L, 49 opponent images 1521 showing the playfield conditions of 49 of the 98 opponents are displayed in a 7×7 array. Also, in the second area 152R, 49 opponent images 1521 indicating the situation of the play fields 1511 of the remaining 49 opponents are similarly displayed in a 7×7 array.

[About attacks]
Next, an attack against the opponent, that is, sending a "block block" will be described. This "obstructing block" is an example of an element that changes the situation of the opponent's playfield. By sending "obstructing blocks" as described below, it is possible to provide a highly tactical fighting game.

First, a case where oneself attacks an opponent will be described. In this game, first, it is necessary to decide the opponent to send the "obstructing block", that is, the above-mentioned "target". This "target" is set by the processor 81 according to a "strategy" to be described later, but in principle, only one person can be set as a "target". However, in the case of "counter target" in the "strategy" described later, it is possible to set a plurality of opponents as "targets". Then, as shown in FIG. 7, a target image 161 is displayed so as to be superimposed on the opponent image 1521 of the opponent set as the "target". This makes it easier for the user to understand whether the user is the "target".

Next, the display of the game image when the user is "targeted" by another user will be described. In this case, a "CAUTION" panel 162 is displayed below the play field 1511, as shown in FIG. In addition, a straight line 163 connecting the opponent image 1521 (middle point) of the opponent who has the player as the "target" and the "CAUTION" panel 162 is also displayed. In addition, the opponent image 1521 of the opponent whose "target" is the player is also changed to a display mode surrounded by a thick frame. By performing such a display, in a game in which there are many opponents, as assumed in this embodiment, in particular, when the user is being targeted by an opponent, which user is the ``target''? , and how many opponents are "targeted". It should be noted that the method of indicating being targeted is not limited to displaying an image using the "CAUTION" panel 162 and the straight line 163 as in this example. Any image or display mode may be used as long as the purpose of making it possible to determine that the opponent has specified the user as a "target" can be achieved.

It should be noted that the above-mentioned target opponent and the targeted opponent change moment by moment according to the "strategy" described later. Therefore, the display positions of the target image 161 and the straight line 163 can change from moment to moment without changing the "strategy".

As described above, when the user erases a block with the "target" set, the "block block" corresponding to the erased content (specifically, the number of lines erased) is set as the "target." You can send it to your opponent. Also, conversely, an opponent who is a "target" may send a "block block". 9 to 12, the operation when a "block block" is sent from another user will be described.

FIG. 9 is an enlarged view of the first region 151. As shown in FIG. This figure shows a play field 1511 in which a group of blocks 172 of 2×9 blocks are piled up. Also, one block image 171 is displayed in the standby block area 1512 . This block image 171 is an image showing an obstructing block sent by the opponent. In this game, when a blocking block is sent from the opponent, the block image 171 is temporarily displayed in the standby block area 1512 . After that, after waiting for a predetermined waiting time, an obstructing block corresponding to the block image 171 appears (rising up) on the playfield from below the playfield 1511 . In the following description, the obstructing block on standby will be referred to as "waiting block", and the block image 171 will be referred to as "waiting block image".

Next, FIG. 10 is a diagram showing a state in which the obstruction block 173 appears on the play field 1511 after the waiting time has elapsed. In FIG. 10, the bottom row of the play field 1511 displays the obstructing blocks 173 filling nine squares excluding the fourth square from the left. Here, in the present embodiment, as the contents of the obstruction block 173, nine blocks in which one of the cells in one horizontal line is randomly left blank are generated as the obstruction block 173. FIG. Also, the corresponding standby block image 171 is erased from the standby block area 1512 as the disturbing block 173 appears.

Here, the number of standby block images 171 displayed in the standby block area 1512 corresponds to the number of lines of the disturbing blocks 173 that appear. In the examples of FIGS. 9 and 10, since there is only one waiting block image 171, only one line of the obstructing block 173 also appears. In this respect, for example, when three standby block images 171 are displayed as shown in FIG. 11, three lines of disturbing blocks 173 appear as shown in FIG.

[About set-off]
Next, the "offset" of the obstruction block will be described. As described above, the user erases blocks in the play field 1511 while the standby block image 171 is displayed in the standby block area 1512, thereby erasing the standby block image 171 according to the number of erased rows. be able to. In other words, if a waiting block exists, the user can erase the block to offset the waiting block. For example, when there is one standby block and the user erases blocks for three rows, one row out of the erased three rows is offset by the one standby block. As a result, the standby block disappears. Also, other users who are "targeted" by the user at that time are sent disturbing blocks based on the erasure of the remaining two lines. As another example, if there are 5 waiting blocks and the user erases blocks for 3 rows, the 3 waiting blocks are offset by erasing 3 rows. As a result, the number of waiting blocks is two. In this way, by making it possible to prevent the appearance of obstructive blocks sent to oneself, the strategic nature of the game is enhanced.

[About the badge]
Next, the above-mentioned "badge", which is an example of a configuration showing information indicating the number of times the opponent has been led to defeat, will be described. In this game, the game is over when blocks pile up to the top of the game field. Then, the obstructing blocks appear so as to rise from the bottom of the game field. Therefore, the appearance of the obstructing block may trigger the block to reach the upper end of the game field, resulting in a game over. In this game, one badge can be obtained when the game is over for the "target" due to the appearance of the block that the user sent to the "target". In other words, you earn a badge if you finish off a "target" with your attack. In addition, it can be said that the badge is information indicating the number of times the opponent was induced to lose. Information indicating the number of badges acquired in this manner is displayed in the badge display area 1514 . FIG. 13 is an example of a game image showing information about badges. In FIG. 13, three badge images 181 are displayed in badge display area 1514 . That is, it is shown that the user has acquired three badges. Note that in other embodiments, a configuration other than the badge as in this example may be used as the information indicating the number of times the opponent has been guided to defeat.

In this game, information on the number of badges possessed by other users is also displayed in the opponent image 1521 . An enlarged view of the second region 152L in FIG. 13 is shown in FIG. In FIG. 14, one badge image 181 is displayed near the upper left corner of opponent image 1521A, and two badge images 181 are displayed near the upper left corner of opponent image 1521B. This indicates that the user associated with the opponent image 1521A has one badge, and the user associated with the opponent image 1521B has two badges. Then, in this way, when the opponent who already possesses a badge is forced into a game over, one badge can be acquired as described above, and the badge possessed by the opponent can also be acquired. can. For example, if an opponent who has two badges is driven to a game over, a total of three badges (1+2) can be obtained.

In addition, in this game, the number of lines of the obstacle blocks 173 to appear can be changed according to the number of badges possessed. Hereinafter, the number of lines of the disturbing blocks 173 to appear (in other words, the number of standby blocks) is referred to as "attack power". In this example, for example, it is assumed that the offensive power is "1" and one line of obstructive blocks 173 can be made to appear. Then, by adding the attack power according to the number of badges possessed to the attack power according to the number of lines actually erased by the user (hereinafter referred to as basic attack power), the opponent's play field is finally The number of lines of the obstruction block 173 to appear in 1511 is determined. As an example, assume that the user has erased a block of one row. In this case, the basic attack power is "1". In such a case, when one or two badges are in possession, "1" is added to the attack power, resulting in a final attack power of "2". As a result, two lines of obstruction blocks 173 can appear on the opponent's play field. Also, for example, when 3 or 4 badges are possessed, "2" is added to the attack power, resulting in a final attack power of "3". Also, for example, when 5 or 6 badges are possessed, "3" is added to the attack power, resulting in a final attack power of "4". In this way, if a player possesses many badges, the "offensive power" can be increased, and the element of "scramble for badges" can be introduced to enhance the interest of the game.

[About the pinch state]
By the way, in this game, when a piled up block reaches any of the upper five rows of the play field 1511, it is treated as a "pinch state", which is a state with a high risk of game over. When the user is in a "pinch state", the display mode is changed to indicate that the user is in a pinch state, such as by surrounding the play field 1511 with a red frame. Further, when the opponent is in a "pinch state", the opponent image 1521 is displayed to indicate that the user is in a "pinch state", such as by blinking the opponent image 1521 related to the user. change the mode. It is possible to make it easier for the user to grasp the presence of the opponent who is in a "pinch state". In addition, it is possible to make it easier for the user to recognize that he or she is in a "pinch state".

[About strategy]
Next, the strategy mentioned above will be explained. In this game, the strategy is used as a policy to determine the "target" among the opponents who are not game over. First, I will explain the significance of this operation. In this game, a large number of 99 players compete against each other, and there are 98 opponents other than oneself. Also, in this game, it is necessary to select a "target" as described above. As a method of selecting this "target", for example, it is conceivable to allow the user to directly select any one of the 98 opponent images displayed in the second area 152. be done. For example, a selection cursor is moved, or if a touch panel screen is used, a touch operation is performed. However, in an action puzzle game like this game, since the operation is required to be real-time to some extent, in parallel with the operation of the falling blocks, the opponent to be the "target" is examined and selected from such a large number. It is considered difficult to perform operations to Therefore, in this embodiment, the user is presented with a strategy, which is a policy for selecting a "target", and is configured to be able to select this strategy with a simple operation that can be combined with the operation of the puzzle game. As for the actual selection of the "target", the processor 81 selects a predetermined opponent based on the strategy being selected, and executes the process of setting it as the "target".

Here are some examples of strategies defined in the game. In this game, the user is presented with the following four strategies that can be selected. It is assumed that the character strings indicating these strategy names are displayed in the option image of the strategy operation panel 1515 shown in FIG.
Strategy 1: Aim to finish Strategy 2: Random Strategy 3: Aim for badges Strategy 4: Counter Below, each strategy will be explained.

[Operation 1: Finishing Aim]
This strategy is based on the policy of "targeting" the opponent who is in the above "pinch state". When the user selects this strategy, the "pinched" opponent is selected as the "target". In other words, it can be said that it is a strategy to aim at an opponent who seems to be easy to drive into a game over. If there are multiple opponents in a "pinch state", for example, the opponent with the most piled up blocks may be selected as the "target". Alternatively, one player may be randomly selected from a plurality of opponents in a "pinch state".

[Operation 2: Random]
This strategy is a strategy of randomly selecting one user from the opponents who are not game over and setting it as a "target". In this game, it is assumed that this strategy is selected by default immediately after the start of the game.

[Operation 3: Badge aim]
This strategy is to set the opponent who has the most badges among the opponents who are not game over as the "target". FIG. 15 shows an example of a game image when the "badge aim" strategy is selected. In FIG. 15, the target image 161 is superimposed on the opponent image 1521B who has the most badges at this time. In other words, it is a state in which the opponent shown in the opponent image 1521B is the "target". As mentioned above, if you land the killing blow, you'll also earn a badge carried by that "target". Also, if you have many badges, you can increase the "offensive power" when sending the obstruction block 173, so it can be said that it is an effective strategy when you want to actively increase the number of badges.

[Operation 4: Counter]
This strategy is a strategy to set the opponent who has made himself a "target" as a "target". Also. If you have multiple opponents who are "targeting" you, set them all as "targets". As mentioned above, in principle, there is only one "target" in this game, but multiple "targets" can be set for the "counter" strategy. FIG. 16 shows an example of a game image when the "counter" strategy is selected. In FIG. 16, the player is set as a "target" by four opponents. By the "counter" strategy, these four opponents are set as "targets", and the target image 161 is displayed superimposed on the opponent image 1521 corresponding to each opponent. In addition, when the "counter" strategy is selected, if the number of opponents who are "targets" changes, the opponents who are "targets" and the display position of the target image 161 are changed accordingly. will be

Also, if you select the "counter" strategy, apart from the change in attack power according to the number of badges mentioned above, attack power will change according to the number of opponents who are "targeting" you. good too. For example, the more opponents that are "targeted" at you, the more aggressive you may be when you send a blocker block to those opponents. As an example, assume that the basic attack power is "1" and the number of badges possessed is 0. In this case, the final attack power is "1" if the element of "counter" strategy is not considered. In such a case, if there are 1 to 3 opponents who have selected the "counter" strategy and set themselves as "targets" (= set themselves as "targets" as well), For example, "1" is added to the attack power, and the final attack power in the "counter" operation becomes "2". Also, if there are 4 to 6 opponents, for example, "2" is added to the attack power, and the final attack power in the "counter" operation becomes "3". Also, for example, if the basic attack power is "1" and the added value by the badge is "1", if the number of "targets" in the "counter" operation is 1 to 3, the final attack power is "3". ”, and if the number of “targets” is 4 to 6, the final attack power is “4”. In other words, in addition to the attack power addition based on the number of badges possessed, the attack power addition is performed by the "counter" strategy. As a result, the more opponents are targeting the player, the more the player can increase his offensive power and counterattack, thereby making the game more interesting. In particular, when the number of badges possessed is large, the possibility of being easily targeted by more opponents increases. In this case, by selecting the "counter" strategy, you can send more blocking blocks to a large number of opponents at once, so that it does not become a one-sided disadvantageous development. It is possible to enhance the interest of the game.

Note that the "strategy" is not limited to the above, and in another embodiment, for example, the following "strategies" may be presented to the user so that they can be selected.
[Outgoing Stake]: Prioritize opponents who frequently attack you as "targets".
[Taiman Attack]: Play one-on-one with an opponent who has also selected "Taiman Attack" until one of them ends up game over. In this case, you will not be able to receive attacks from other opponents.
[Pinpoint Attack]: One randomly selected opponent is fixed as the "target". In other words, while choosing this strategy, the "target" is fixed to one person.
[Iron Wall Guard]: A strategy of stocking up for use in the above-mentioned "offset" without sending the blocking block 173 when the block is erased.

Note that in other embodiments, an operation method of setting a target by specifying a "strategy" as described above and an operation method of directly specifying a "target" by the user (e.g. The user taps one of them, moves the cursor and presses a predetermined button, etc.) may be used together. As a result, in addition to being able to semi-automatically determine the "target" by selecting the "strategy" (policy for determining the "target"), the user can also directly determine the opponent to be the "target". It is possible to make it easier to reflect the user's intention regarding the determination of "target".

[About what the user can do after the game is over]
Next, processing when the game is over will be described. In this game, when the game is over for each user, the game can be ended and the display of the game image can be ended, but it is also possible to "watch" the match between the opponents. For example, when the game is over, the user is asked whether or not to continue watching the game. On the other hand, if the user chooses to watch the game, the game image continues to be displayed until the match game played this time ends (until the last player is confirmed). That is, even after the game is over, data indicating the opponent's game situation is continuously acquired from the server 101 . In this case, the display contents of the first area 151 remain the contents displayed at the time of game over, and the display contents of the second area 152 change according to the situation of the subsequent battle game. . The state of watching the game after the game is over is called "watching mode".

Here, the display of the second area 152 after the opponent's game is over will be described with reference to FIGS. 17 and 18. FIG. FIG. 17 is a diagram showing a state in which the game is over first for the opponent in the top left opponent image 1521A in the second area 152L. In FIG. 17, as the opponent image 1521A, an image including characters of "KO" (an image indicating that the game is over) and a numerical value indicating the ranking are displayed below it. This figure shows that the "99th place" is confirmed because the game is over first in the 99-player competition.

Next, FIG. 18 is a diagram showing a state after the state of FIG. 17 in which the opponent in the top right opponent image 1521B of the second area 152R is the second to be game over. Since the game was over in the second place, "98th place" was decided as the ranking. Also, in the opponent image 1521B, a character string of "Watch" is also displayed between the image of "KO" and the numerical value indicating the ranking. The character string "Watch" indicates that the opponent is in spectator mode. That is, in the state of FIG. 18, the opponent in the opponent image 1521A has finished the battle game without watching after the game is over, but the opponent in the opponent image 1521B has watched the game after the game is over. This indicates that the In this way, in the second area 152, when the opponent is game over, an image indicating that fact and the order are displayed. In addition, when the opponent whose game is over chooses to watch the game, a display indicating this (in the above example, the character string "Watch" is displayed) is also performed. This makes it easier to grasp which opponent is game over. Also, it is possible to easily grasp how many opponents in the spectator mode exist.

Needless to say, each display element such as the target image 161, the "CAUTION" panel 162, the straight line 163, the badge image 181, the waiting block image 171, and the "KO" image can be displayed simultaneously in the actual game image. . FIG. 19 shows an example of a game image in which these display elements are displayed simultaneously. In an actual game play, the game progresses while the display positions of the target image 161 and the straight line 163, the numbers of the badge images 181 and the waiting block images 171, and the like change every moment.

As described above, in the competitive game according to the present embodiment, in order to select a "target" from a large number of 98 opponents, the user selects a strategy, and the processor 81 sets the "target" based on this. there is As a result, it is possible to determine which opponent's game situation (in this example, the situation of the play field 1511) is to be changed in a way that reflects the user's intentions without interfering with the user's game operation. becomes.

[Details of game processing in this embodiment]
Next, with reference to FIGS. 20 to 33, game processing in this embodiment will be described in more detail.

[About data used]
First, various data used in the game processing will be described. FIG. 20 is a memory map showing an example of various data stored in the storage unit 84 of the main unit 2. As shown in FIG. The storage unit 84 of the main unit 2 stores a game program 301, operation data 302, server transmission data 305, update data 306, opponent data 307, current mode 308, standby block data 309, current strategy data 310, current badge Number data 311, image data 312, and the like are stored.

The game program 301 is a program for executing game processing according to this embodiment.

The operation data 302 is data obtained from the left controller 3 and the right controller 4, and is data indicating the content of user's operation. The operation data 302 includes digital button data 303 indicating the pressed state of various buttons of each controller, analog stick data 304 indicating the operation content of the analog stick, and the like.

Server transmission data 305 is data to be transmitted from the game system 1 to the server 101 . FIG. 21 shows an example of the configuration of the server transmission data 305. As shown in FIG. 21, server transmission data 305 includes user ID 321, play field information 322, attack-related information 323, target information 324, game over information 325, watching information 326, badge information 327, and the like.

The user ID 321 is information for uniquely identifying each of the 99 users participating in this game.

The playfield information 322 is data for indicating the state of the playfield 1511 . Specifically, information indicating whether or not there is a block for each of 20 vertical by 10 horizontal squares is included. In addition, when there is a block, information indicating the content of the block (for example, color/pattern, shape, etc.) is also included.

The attack-related information 323 is information indicating whether or not a disturbing block has been sent (attacked) to the "target". Also included is information indicating the number of lines (attack power) of the disturbing block to be sent when the disturbing block is being sent. In other words, the attack-related information 323, together with the target information 324, which will be described later, is data for instructing the "target" game system 1 via the server 101 to make the obstruction block appear. It can be said.

The target information 324 is information for specifying the "target".

The game over information 325 is information indicating whether or not the user is game over. In addition, in the event of a game over, information indicating whether or not the game was over due to a blocking block from one of the opponents, and information for identifying the opponent that caused the Included in the game over information 325 .

The watching information 326 is information indicating whether or not the user is in the watching mode. In the case of the spectator mode, information indicating "watching" is set in the spectator information 326. FIG.

The badge information 327 is data indicating the number of badges currently possessed by the user.

Returning to FIG. 20, the update data 306 is data received from the server 101 and is data for updating opponent data 307, which will be described later. FIG. 22 shows an example of the data configuration of the update data 306. As shown in FIG. The update data 306 is basically data in a table format in which one record (one row) contains data having the same content as the server transmission data 305 . In other words, it can be said that the server transmission data 305 transmitted from the other 98 opponents other than oneself has been received via the server 101 . Specifically, each data shown in FIG. 21 is data of the same purpose, such as user ID 341, play field information 342, attack-related information 343, target information 344, game over information 345, spectator information 346, badge information 347, and the like. is data in a table format in which is configured as one record. Description of each data is omitted because it is the same as that described in FIG.

Here, in the battle game of this embodiment, a maximum of 99 users can participate, but 99 users do not necessarily have to be present. For example, if there are only 60 participants, the processor of the server 101 will act as the remaining 39 users. In such a case, in the server 101, for 39 users (hereinafter referred to as AI users) who are in charge of the processor 81, the same data as the server transmission data 305 is sent based on the action results of the AI users. generated by Then, data including these is transmitted to each game system 1 and stored as the update data 306 in each game system 1 .

In addition, the update data 306 may include, for example, data indicating an exchange of attacks between opponents. That is, data indicating which opponent is attacking which opponent. Then, using such data, in the second area 152, an effect showing how the opponents attack each other may be displayed.

Regarding transmission/reception of the update data 306, in another embodiment, instead of collectively transmitting/receiving data in the table format as described above, data for each user is transmitted/received in units of one record (one record in FIG. 22). You may make it Based on the difference in communication speed between each game system 1 and the server, the occurrence of communication lag, etc., for example, as soon as the server transmission data 305 from each user reaches the server 101, it is individually sent to the game system 1 of another user. It may be configured to transmit this.

Returning to FIG. 20, next, the opponent data 307 is an example of data for indicating the game status of each of the 98 opponents other than the player, and is updated as appropriate based on the update data 306. This is the data to be used. FIG. 23 shows an example of the configuration of the opponent data 307. As shown in FIG. The opponent data 307 includes an image frame number 360 for specifying one of the 98 opponent images 1521 in the second area 152 . In this image frame number 360, user ID 361, play field information 362, attack-related information 363, target information 364, game over information 365, spectator information 366, and badge information, which are the same contents as the update data 306, are displayed. 367 is stored in association with table format data. That is, it can be said that the server transmission data 305 sent from each of the opponents is data assigned to one of the 98 opponent images 1521 in the second area 152 .

Returning to FIG. 20, the current mode 308 indicates whether the user is in spectator mode, or whether the user is inquiring about transition to spectator mode (inquiry screen is displayed). It is data that indicates whether In this example, data indicating "inquiring" is set when inquiring about switching to spectator mode, and data indicating "spectating" is set when in spectator mode. .

The standby block data 309 is data relating to the standby block image 171 displayed in the standby block area 1512 . FIG. 24 shows an example of the data configuration of the standby block data 309. As shown in FIG. The standby block data 309 includes a standby number 331 , opponent ID 332 , attack power 333 and elapsed time 334 . The standby number 331 is a number for identifying each standby block image 171 (that is, standby block). The opponent ID 332 is information indicating the user ID of the opponent who sent the standby block. The attack power 333 is information indicating the number of lines of the obstructive blocks 173 that appear. Elapsed time 334 indicates the time that has elapsed since the standby block was sent.

Returning to FIG. 20, the current strategy data 310 is data indicating the currently selected strategy. The current number of badges data 311 is data indicating the number of badges currently possessed by the user. The image data 312 is data of various images displayed in the game processing, such as images of various blocks and target images.

[Data stored on the server]
Next, data used by the server 101 will be described. FIG. 25 is a memory map showing an example of various data stored in the storage unit 112 of the server 101. As shown in FIG. The storage unit 112 of the server 101 stores a server processing program 321, participating user data 382, reception data 383, transmission data 384, and the like.

The server processing program 381 is a program for processing the functions that the server 101 takes charge of in the game processing according to this embodiment. Mainly, processing for receiving server transmission data 305 transmitted from each game system 1, processing for progressing the game as an AI user if the AI user processing is required, and generation of data to be transmitted to each game system 1 and transmission, etc. are executed by the program.

Participating user data 382 is data relating to users who have participated in the competitive game with a maximum of 99 people according to this embodiment. The data configuration is table format data composed of the contents of the server transmission data 305 for 99 participants in the game. Therefore, detailed description of the configuration of the data is omitted.

The received data 383 is data in which the server transmission data 305 transmitted from each game system 1 is temporarily stored. The participating user data 382 is updated based on this data.

The transmission data 384 is data for transmitting the opponent's situation to each game system 1 . In the present embodiment, the data structure is such that the data of the user of the game system 1 of the transmission destination is removed from the contents of the participating user data 382 .

[Overall processing flow]
Next, the details of the game processing according to this embodiment will be described. First, with reference to FIG. 26, the flow of overall processing by cooperation between the server 101 and each game system 1 will be described. In FIG. 26, the game system side processing is shown on the left side of the figure, and the server side processing is shown on the right side. First, a preparatory process P1 is executed between each game system 1 and the server 101 when a predetermined user instructs the start of a competitive game. In this process, a deadline is set and up to 99 users are accepted for participation. After that, when the deadline has passed, if the number of participants is less than 99, the AI users for that number are appropriately set, and the information of opponents including the AI users is sent to each game system, and the above-mentioned A process P2 for executing such a puzzle game is started. After that, when there is a user whose game is over, information indicating the number of badges acquired (hereinafter referred to as "acquired badge information") is sent to the user who was driven to game over as necessary. A process of transmitting to a predetermined user is executed. Furthermore, when the number of users who are game over reaches 98, the server 101 notifies each game system that the final ranking has been determined, and information indicating the final ranking and user name of each user (hereinafter referred to as end processing). data). After that, each game system executes processing such as display of the final ranking, and processing P3 (disconnection of communication session, etc.) for ending the game is executed, thereby ending the game according to the present embodiment.

[Details of processing executed by the game system]
Next, the details of the game processing executed in each game system 1 will be described. 27 to 29 are flow charts showing the details of this game process. Also, this process is a process that is executed after the deadline has expired. Also, the flowchart shown in the drawing is merely an example of the process. Therefore, the processing order of each step may be changed as long as similar results can be obtained. Also, the values of the variables and the thresholds used in the determination step are merely examples, and other values may be adopted as necessary.

First, in step S1 of FIG. 27, various preparatory processes for starting the game are executed. Specifically, processor 81 receives update data 306 containing information on each opponent from the server. Based on this, each opponent is assigned to one of the opponent images 1521 in the second area 152 to generate opponent data 307 . Although not shown, falling order data indicating the order of falling blocks is also received from the server 101 at this time and stored in the storage unit 84 . In the puzzle game executed after this, the blocks appear in the order based on the falling order data, and the display contents of the next block area 1513 are updated as appropriate. The processor 81 also sets information indicating "random" as the initial value of the strategy in the current strategy data 310 .

After that, an image to be displayed in the second area 152 is generated based on the opponent data 307, and an image to be displayed in the first area 151 is also generated based on the falling order data and the like. A game image including these images is output to the display 12 . After that, a predetermined countdown effect is performed, and the puzzle game is started. Note that the processing loop of steps S2 to S29 below is assumed to be repeatedly executed for each frame, for example.

Next, in step S2, processor 81 receives update data 306 from the server. In addition, if there is the acquired badge number data and the end processing data, the data is also received.

In subsequent step S3, the processor 81 executes processing for updating various data. First, processor 81 updates opponent data 307 based on update data 306 . As a result, the opponent's game progress is updated. It should be noted that the update interval of the opponent data may be updated at predetermined intervals such as one-second intervals instead of every one frame. This is because, basically, the puzzle game itself can progress independently in each game system 1, so there is no need to strictly synchronize with the other game systems 1 ( In this game, even if there is some time lag in communication, the effect is considered to be small). In addition, based on the attack-related information 363 of the updated opponent data 307, the contents of the standby block data 309 are also updated as appropriate. In other words, a process of reflecting the attack received from the opponent is also executed.

Further, if acquired badge number data is received in step S2, a predetermined value is added to the current badge number data 311 and badge information 327 based on this to update these data. As described above, when the "target" is driven into a game over by the obstruction block sent by itself, acquired badge number data is transmitted from the server 101, and a predetermined number of badges can be acquired.

Next, in step S4, the processor 81 determines whether or not conditions for ending the current competitive game are satisfied. Specifically, in step S<b>2 described above, it is determined whether or not the end processing data has been received from the server 101 . As a result, if the end condition is satisfied (YES in step S4), the processor 81 executes processing for ending the current competitive game in step S6. Specifically, based on the end processing data received from the server 101, processing such as displaying the final ranking of each user is executed. After that, a process for disconnecting the communication with the server 101 is executed, and the game process ends.

On the other hand, as a result of the determination in step S4, if the termination condition is not satisfied (NO in step S4), in step S5, the processor 81 refers to the standby block data 309, Update the elapsed time 334 for the block. For example, a process of counting up the elapsed time 334 is executed.

Next, in step S7, the processor 81 acquires the operation data 302. FIG. Next, in step S8, the processor 81 determines whether the current mode 308 is "spectating". In other words, it is determined whether or not the user is in spectator mode (the game is already over). As a result of the determination, if the player is "watching" (YES in step S8), the process proceeds to step S26, which will be described later.

On the other hand, if it is not "watching" (NO in step S8), then in step S9, the processor 81 determines whether the current mode 308 is "inquiring". In the case of "inquiring", in step S12 of FIG. 28, the processor 81 determines whether or not the operation content indicated by the operation data 302 is an instruction to transition to the spectator mode. As a result, if a transition instruction has been issued (YES in step S12), in step S13, processor 81 updates game over information 325 to include information indicating that the game is over for the user. . Further, in step S14, the processor 81 sets the current mode 308 and the information indicating "watching" to the watching information 326 of the data 305 for server transmission. Thereafter, the process proceeds to step S26, which will be described later.

On the other hand, as a result of the determination in step S12, if no transition instruction has been issued (NO in step S12), in step S15, the processor 81 determines that the operation content indicated by the operation data 302 is an instruction to end the game. Determine whether or not there is That is, it is determined whether or not the user has selected to end the game without watching the game after the game is over. If it is an end instruction, in step S16 processor 81 updates game over information 325 to include information indicating that the game is over for the user. In subsequent step S<b>17 , processor 81 executes processing for transmitting server transmission data 305 to server 101 . After that, in step S18, the processor 81 executes processing for ending the game. It should be noted that, unlike the process of step S6, here, the game process is ended without displaying the final ranking (in other words, the process is like leaving the game halfway). Further, by the transmission process in step S17, the server 101 (and other opponents) are notified that the game is over for the user and that the user will not watch the game after that.

Returning to FIG. 27, as a result of the determination in step S9, if it is not "under inquiry" (NO in step S9), in step S10, the processor 81 determines that the operation content indicated by the operation data is the above-described strategy. It is determined whether or not the operation is a change operation (in this example, an operation of the analog stick included in the right controller 4). As a result of the determination, if a strategy change operation has been performed (YES in step S10), the contents of the current strategy data 310 are updated based on the operation details indicated by the operation data 302. FIG. Thereafter, the process proceeds to step S26, which will be described later.

On the other hand, if the strategy change operation has not been performed as a result of the determination in step S10 (NO in step S10), then in step S19 of FIG. Based on the selected strategy, the process of selecting the "target" is executed. Specifically, the processor 81 executes the following processes. First, if the current strategy is "finishing", the processor 81 refers to the opponent data 307 and, based on the play field information 362 of each opponent, enters the "pinch state" as described above. Extract opponents who are As a result of the extraction, if there is only one opponent in a "pinch state", the user ID 361 indicating the opponent is set in the target information 324 in order to set that opponent as a "target". Also, if there are multiple opponents in a pinch, one of them is determined as a “target” (any method of determination may be used) and set in the target information 324 . Also, if the current strategy is “random”, the processor 81 randomly selects one opponent and sets the user ID 361 indicating the opponent in the target information 324 . Also, if the current strategy is to aim for a badge, the processor 81 refers to the opponent data 307, selects a predetermined opponent based on the badge information 367 of each opponent, and indicates the opponent. User ID 361 is set in target information 324 . Also, if the current strategy is "counter", the processor 81 refers to the opponent data 307 and identifies an opponent who has set itself as a "target" based on the target information 364. FIG. Then, the user IDs 361 of the specified opponents (the user IDs 361 of all the players if there are multiple opponents) are set in the target information 324 of the server transmission data 305 .

Next, in step S20, processor 81 moves the block within play field 1511 based on the operation data or based on the passage of time. If the content of the operation indicated by the operation data 302 is an operation to move the block left, right, downward, or rotate, the block is moved or rotated according to the content of the operation. Also, even if the user does not operate the block, the block is moved downward by one square each time a predetermined period of time elapses.

Next, in step S21, the processor 81 determines whether or not the placement positions of the blocks have been determined. If not yet determined (NO in step S21), the process proceeds to step S23, which will be described later. If determined (YES in step S21), the processor 81 executes block erase related processing in step S22.

FIG. 30 is a flowchart showing the details of the block erasure-related processing. First, in step S41, the processor 81 determines whether or not the conditions for erasing the blocks have been satisfied as a result of determining the placement of the blocks. In this embodiment, it is determined whether or not there is a block in which one horizontal row of the play field 1511 is filled. As a result of the determination, if the deletion condition is not satisfied (NO in step S41), the process proceeds to step S49, which will be described later. On the other hand, if the erasure condition is satisfied (YES in step S41), then in step S42 the processor 81 calculates the number of rows in the block to be erased. That is, how many lines can be erased is calculated.

Next, in step S43, the basic attack power is calculated based on the number of lines to be erased. In this example, it is assumed that the number of lines to be erased and the basic attack power have the same value. For example, if the number of erased lines is 1, the basic attack power is 1, and if the number of erased lines is 3, the basic attack power is 3.

Next, in step S44, the processor 81 refers to the standby block data 309 and determines whether or not a standby block currently exists. If it does not exist (NO in step S44), the process proceeds to step S47, which will be described later. If it exists (YES in step S44), in subsequent step S45, a process of canceling out the number of lines to be erased and the standby block is executed. For example, when two lines can be erased in a state where three standby block images 171 exist, 2 is subtracted from the attack power 333 of the standby block data 309 . Accordingly, processing for reducing the number of standby block images 171 displayed on the screen is also executed. Further, when the offensive power becomes 0 or less as a result of the subtraction, a process of deleting the record related to the standby block with the offensive power of 0 from the standby block data 309 is also executed. For example, it is assumed that the standby block data 309 includes a standby block whose standby number 331 is "1" and a standby block whose standby number 331 is "2". Assume that the attack power of the standby block with the standby number 331 of "1" is "1" and the attack power of the standby block with the standby number 331 of "2" is "3". In this case, when two lines are erased, the standby block with the standby number 331 of "1" is completely offset, and the standby block with the standby number 332 of "2" is offset by one row (attack power 333 is subtracted to 2). That is, the standby numbers 331 are canceled in ascending order.

Next, in step S46, the processor 81 subtracts the basic attack power according to the content of the offset. For example, if one line of offsetting has been performed, "1" is subtracted from the basic attack power.

Next, in step S<b>47 , the processor 81 corrects the basic attack power based on the number of own badges possessed indicated by the badge information 327 . Additionally, if the currently selected tactic is "counter", then adjust based on the number of opponents who are "targeting" you. For example, if the number of badges possessed is 1, 1 is added to the basic attack power. In addition, in the case of a "counter" operation, if three opponents are "targeted" (distinguishable based on the opponent data 307 above), apart from badge credits, basic Adds 1 to attack power. As an example, the final attack power against the "target" is calculated as "basic attack power + corrected attack power based on the number of badges + corrected attack power based on the "counter" strategy". Then, the attack power calculated in this way is set in the attack-related information 323 of the server transmission data 305 together with information indicating that an attack has occurred on the "target".

Next, in step S48, the processor 81 executes processing for updating the contents of the play field 1511 as the block is erased. In other words, the process of updating the placement of blocks after the erasure is executed.

Next, in step S49, the processor 81 executes obstruction block processing. FIG. 31 is a flowchart showing the details of the disturbing block processing. In FIG. 31, first, in step S61, the processor 81 refers to the standby block data 309 and determines whether or not there is a standby block whose elapsed time 334 has exceeded a preset predetermined standby time. As a result of the determination, if there is no such standby block (NO in step S61), the disturbing block process ends. On the other hand, if there is such a waiting block (YES in step S61), then in step S62 the processor 81 generates the disturbing block 173 described above. Specifically, based on the attack power 333 of the standby block data 309, the number of lines of the disturbing blocks 173 to appear is determined. Then, the content of the obstruction block 173 on each line is determined. In this example, as described with reference to FIG. 10, 9 blocks are generated as the obstructive blocks 173 by randomly blanking any one of the horizontal rows.

Next, in step S63, the processor 81 places the generated obstruction block 173 in the play field 1511, and executes a process of updating the contents of the play field 1511 after placement. In this example, the obstructing blocks are arranged so as to rise from the bottom. In addition, the standby block corresponding to the disturbing block 173 that has appeared is also deleted from the standby block data 309. Along with this, the corresponding standby block image 171 is deleted from the standby block area 1512 processing is also performed. After that, the obstruction block processing ends.

Returning to FIG. 30, next, in step S50, the processor 81 executes processing for displaying the next falling block based on the falling order data. It also executes processing for updating the display content of the next block area 1513 . After that, the block erase related processing ends.

Returning to FIG. 29, next in step S23, the processor 81 determines whether or not the situation of the play field 1511 satisfies the conditions for game over. In this example, it is determined that the condition for game over is satisfied when the block piles up to the top of the play field. As a result of the determination, if the game is not over (NO in step S23), in step S24, the processor 81 determines whether or not the situation of the play field 1511 is the "pinch state". As a result, if it is not in a "pinch state" (NO in step S24), the process proceeds to step S26. On the other hand, if it is "pinch state" (YES in step S24), processor 81 changes the display mode of play field 1511 to indicate "pinch state" in step S25.

Next, in step S<b>26 , the processor 81 generates a game image reflecting the content of the above processing and outputs it to the display 12 . Specifically, based on the play field information 362 of the opponent data 307, images to be displayed in the second area 152, that is, a total of 98 opponent images 1521 are generated. Also, based on the target information 324, the processor 81 superimposes the target image 161 on the opponent image 1521 targeted by itself. In addition, the processor 81 arranges the "CAUTION" panel 162 at the bottom of the play field 1511 based on the target information 364 of the opponent data 307, and furthermore, the opponent image 1521 of the opponent who is aiming at himself, The straight line 163 connecting with the "CAUTION" panel 162 is generated and arranged. Processor 81 also determines the display contents of standby block area 1512 , badge display area 1514 , and strategy operation panel 1515 based on standby block data 309 , current strategy data 310 , and current badge number data 311 . The processor 81 also refers to the game over information 365 to determine whether or not each opponent is game over. If the opponent is game over, it is further determined based on the watching information 366 whether or not the opponent is in the watching mode. Then, based on the determination result, an image indicating that the game is over and whether or not the player is watching the game (see FIGS. 17 and 18 above) is generated as the opponent image 1521 . As a result, it is possible to present the game situations of the 98 opponents to the user. Furthermore, the processor 81 also generates, as an image to be displayed in the first area 151, an image in which various processes related to the play field 1511 as described above are reflected. However, when the game is over and the user is in spectator mode, the contents of the play field are not updated any more, so an image showing the state of the play field 1511 at the time of game over is generated. By combining these, a game image to be output is generated and output to the display 12 .

In subsequent step S27, the processor 81 executes processing for updating the contents of the playfield information 322 of the server transmission data 305 so as to indicate the state of the playfield 1511 after the above processing is reflected. Note that after the user is game over (when the current mode 308 is "inquiring" or "watching"), the play field information 322 is not updated.

Next, in step S<b>28 , the processor 81 executes processing for transmitting the server transmission data 305 to the server 101 . After that, the process returns to step S2 and the process is repeated.

On the other hand, if the game is over as a result of the determination in step S23 (YES in step S23), game over processing is executed in step S29. FIG. 32 is a flowchart showing details of the game over process. First, in step S<b>81 , the processor 81 determines whether or not the current game over is due to the appearance of the obstruction block 173 . As a result, if it is not caused by the appearance of the disturbing block 173 (NO in step S81), the process proceeds to step S83. On the other hand, if it is due to the appearance of the disturbing block 173 (YES in step S81), the processor 81 updates the game over information 325 in step S82. Specifically, the processor 81 executes a process of setting, in the game over information 325, information for making the opponent who sent the obstruction block 173 obtain a badge. That is, the game over information 325 is set to include information indicating the user ID of the opponent who sent the obstructing block and the number of badges owned by the user at that time. As a result, the badge possessed by the user at that time can be given to the opponent shown here.

Next, in step S83, the processor 81 sets the current mode 308 to "inquiring". Next, in step S<b>84 , processor 81 generates an inquiry screen asking the user whether or not to watch the game, and outputs the inquiry screen to display 12 . With this, the game over process ends. After the game over process is completed, the process returns to step S2 and the process is repeated.

This completes the detailed description of the game processing executed in each game system 1 .

[Details of server-side processing]
Next, the details of the processing executed by the server 101 will be described. FIG. 33 is a flow chart showing details of server processing executed by the processor 111 of the server. First, in step S101, the processor 111 executes preparation processing. Specifically, the participating user data 382 is generated based on the data transmitted from each game system 1 participating in the game. At this time, if the number of participants is less than 99, the processor 111 handles the missing users as AI users. Therefore, the participating user data 382 is generated so as to include data related to this AI user. After that, when the preparation for starting the competitive game is completed, information indicating the start of the competitive game is transmitted to each game system 1 .

Next, in step S102, the processor 111 refers to the participating user data 382 and determines whether or not the game end condition is satisfied. For example, it is determined whether or not 98 users are game over. As a result of the determination, if the termination condition is not satisfied (NO in step S102), in step S103, the processor 111 executes the reception process, that is, receives the data for server transmission transmitted from each game system 1. 305 is received.

Next, in step S104, the processor 111 executes puzzle game processing for the AI user. Note that this processing is not performed when the AI user is not required.

Next, in step S105, the processor 111 updates the participating user data 382 based on the received data and the result of the AI user's puzzle game processing.

Next, in step S106, the processor 111 executes processing related to acquisition of the badge at the time of game over. That is, based on the game-over information included in the participating user data, a process for making a predetermined user acquire a badge is executed. For example, when the game is over for user A due to a disturbing block sent by user B, information indicating this is included in the game over information 325 transmitted from user A. FIG. Based on this, the processor 111 decides to let the user B acquire one badge. Further, the badge information 327 of the user A is referred to, and if the user A possesses one or more badges, it is determined that the number of the badges is added and the user B acquires the badges. Then, information indicating the number of badges to be obtained by user B is generated as the acquired badge number data addressed to user B. FIG.

Next, in step S<b>107 , processor 111 generates transmission data to be transmitted to each game system 1 . Specifically, data for a user other than the user of the destination game system 1 is generated as transmission data. For example, as transmission data for user A, transmission data including data of 98 users other than user A is generated. In addition, when the obtained badge number data is generated, the data is included in the transmission data to the corresponding user. Then, the transmission data is transmitted to each game system 1 participating in the game. At this time, it may not be transmitted to the game system 1 associated with the user who is game over and has chosen not to watch the game. After the process, the process returns to step S102 and the process is repeated.

On the other hand, as a result of the determination in step S102, if the game end condition is satisfied (YES in step S102), in step S108, the processor 111 generates end processing data including information such as the final ranking. and transmit it to each game system 1 . In this case as well, it may not be transmitted to the game system 1 associated with the user who is game over and who chooses not to watch the game.

This completes the description of the processing on the server side.

As described above, in the present embodiment, the user's intention is reflected in the selection of the opponent to be attacked in the battle game in which there are as many as 98 opponents by allowing the user to select the "strategy" as described above. Easy selection operation is possible. As a result, in a game in which a player competes against a large number of opponents, it is possible to further improve ease of selection in a game in which it is necessary to designate an opponent as an attack target.

In addition, images associated with each of the large number of opponents as described above are also displayed, and the target image 161, the "CAUTION" panel 162 and the straight line 163 are displayed. This makes it possible to present who the user is selecting or who is selecting the user in a more comprehensible manner.

[Modification]

In the above-described embodiment, the ranking display of each user is displayed when the game is over and the ranking is determined. In addition, in another embodiment, the ranking may be displayed in real time. For example, in the case where ranking is determined by the number of "badges" possessed as described above in the battle game as described above, the number of badges possessed by each user may be superimposed on the opponent image 1521 and displayed at that point in time, for example. You can display your rank. Then, the ranking display may be changed in real time according to the change in the number of badges possessed.

Further, in the above embodiment, the target image 161 is displayed so as to be superimposed on the opponent image 1521, which is the "target". In another embodiment, instead of displaying the target image 161, the display mode of the opponent image 1521 itself may be changed. For example, the opponent image 1521 may be displayed in a slightly enlarged size, or a predetermined animation effect may be performed on the opponent image 1521 .

Also, as an example of a technique for changing the opponent's game situation, the above explanation uses an example of interrupting the progress of the opponent's puzzle game by sending it to the opponent in the "obstructing block". The method of changing the game situation of the opponent is not limited to this. In other embodiments, for example, the opponent's endurance such as physical strength and HP is reduced, the opponent's time limit is reduced, or the opponent's game operations are temporarily blocked. Any method other than the above-mentioned "obstructing block" may be used as long as the content interferes with the progress of the opponent's game.

Further, regarding the display in the second area 152, in the above-described embodiment, an image of "KO" as shown in FIG. 17 was displayed as an opponent whose game was over. That is, when the game is over, the display is changed. In this regard, in other embodiments, the second area 152 may be used to perform processing using elements of a so-called bingo game. In other words, while the opponent images 1521 are arranged in a 7×7 array, the opponent images 1521 of the user whose game is over due to the user's attack are arranged in one row vertically, horizontally, or diagonally. Depending on the situation (successful bingo), some kind of effect, such as an increase in offensive power, may be given. This makes it possible to further enhance the interest of the game.

Further, in another embodiment, the game image configuration as shown in FIG. 5 may be used to execute the above game as a 49vs49 team battle. For example, the user belongs to one of two teams, and in the second area 152L in FIG. 5, 49 opponent images 1521 showing the situation of the playing field 1511 of 49 teammates including the user himself/herself are displayed. be done. A play field 1511 or the like operated by the user is displayed in the first area 151 as in the above embodiment. In the second area 152R, 49 opponent images 1521 of the enemy team composed of the remaining 49 users are displayed. In this case, opponents who can be set as "targets" may be limited to opponents on the enemy team. Therefore, the target image 161 and the straight line 163 are displayed for one of the opponent images 1521 in the second area 152R. As a result, by using the same game image configuration and display elements as in the above-described embodiment, it is possible to realize a competitive game having a different game aspect of a team battle from that in the above-described embodiment.

In another embodiment, the game systems 1 are connected to each other (peer-to-peer) using, for example, short-range wireless communication without going through the server 101, and the above-described battle game processing is performed. It is good also as a structure.

Further, for example, the above game processing may be executed by a single game system 1 with only one user and all of the remaining 98 opponents as the above AI users. In this case, the exchange of data indicating the game situation is completed within the game system 1 . For example, instead of transmitting the server transmission data 305 for 98 AI users handled by the processor 81 to the server 101, the storage unit 84 may be configured to store the update data 306. FIG.

Further, in the above embodiment, the action puzzle game process is exemplified by stacking the puzzle objects falling from above, arranging them in a horizontal row and erasing them, but the puzzle objects are not limited to such a puzzle game, and various action puzzle games are possible. As for the processing, the processing as described above can be applied. For example, it can be applied to puzzle game processing in which the puzzle objects appear from the bottom to the top.

Further, in the above-described embodiment, a puzzle game was described as an example of game processing, but the game processing is not limited to puzzle game processing. In other embodiments, the above-described processing may be applied to game processing other than the puzzle game as long as the game processing independently progresses between the user and a plurality of opponents.

Further, regarding the positional relationship between the first area 151 and the second area 152, the above example shows an example in which the first area 151 is arranged in the center of the game image, and two second areas 152 are arranged on the left and right sides of the first area 151. . The position of the second region 152 is not limited to this, and may be above and below the first region 151, for example. Furthermore, the position of the second region 152 may not be fixed, and may be constantly moved around the first region 151, for example.

Moreover, the game process described above can be executed not only by the game system 1 described above, but also by an information processing device such as a portable game device or a smart phone. Here, when the above process is executed in a portable game device having two display screens, for example, the first area (image related to the user's game play) is displayed on the first display screen, and the second area is displayed on the second display screen. A configuration may be adopted in which the second area (that is, opponent images 1521 of 98 opponents) is displayed on the display screen.

Further, in another embodiment, the series of processes related to the game process of each user may be executed in an information processing system including a plurality of information processing devices. For example, in an information processing system including a terminal-side device and a server-side device that can communicate with the terminal-side device via a network, even if part of the above-described series of processes is executed by the server-side device, good. Further, in an information processing system including a terminal-side device and a server-side device capable of communicating with the terminal-side device via a network, the server-side device executes main processing in the series of processing, A part of the processing may be executed in the terminal-side device. For example, the main game processing may be performed by the server-side device, and the terminal-side device may receive and display the game image generated as a result of the game processing by the server-side device to proceed with the game. good. In the above information processing system, the system on the server side may be configured by a plurality of information processing apparatuses, and the processing to be executed on the server side may be shared by the plurality of information processing apparatuses.

1 game system 2 main unit 3 left controller 4 right controller 12 display 81 processor 84 storage unit

Claims (20)

A game program executed in a computer of an information processing device for providing a competitive game to a user, the computer comprising:
game execution means for executing a first game process that progresses independently of a second game process related to an opponent of the user based on an operation of the user;
acquisition means for sequentially acquiring situation data indicating a second game situation of the second game process related to the plurality of opponents;
A first image reflecting the first game situation of the first game process, and a plurality of second images reflecting the second game situation indicated by the plurality of situation data acquired by the acquiring means. and image generation means for sequentially generating display images including
A policy for automatically selecting at least one of a plurality of opponents during play of the competitive game, which one of a plurality of preset policies is selected based on the user's operation. a policy selection means for selecting one policy;
identifying means for identifying at least one of the plurality of opponents as a target based on the selected policy during play of the competitive game;
A game program that functions as change instruction means for instructing to change the game situation of an opponent identified as a target by the identification means when the game situation of the user satisfies a predetermined condition. The acquisition means sequentially acquires the situation data including to-be-identified information data indicating whether or not each of the plurality of opponents has identified the user as a target,
When the specified information data indicates that the opponent has identified the user as a target, the image generating means can determine that the opponent has identified the user as a target. 2. The game program according to claim 1, wherein the display images including the third image of are sequentially generated. Based on the situation data acquired by the acquisition means, the image generation means generates the second image so as to include a display in which the ranking of each of the plurality of opponents can be determined, and includes the second image in the display image. 3. The game program according to claim 1 or 2. The image generation means is
When the opponent becomes unable to continue the game, the second image is generated and displayed so as to include a display in which the order determined at the time when the opponent becomes unable to continue the game can be identified. 4. The game program according to claim 3, which is included in the image for use. The acquisition means continues to sequentially acquire the situation data even after the game situation of the user has reached a state where the game cannot be continued,
5. The image generating means sequentially generates display images including the second image based on the situation data even after the game situation of the user becomes such that the game cannot be continued. A game program according to any one of 6. The method according to any one of claims 1 to 5, wherein said image generating means sequentially generates said display images such that said first image is arranged in a first area and each of said plurality of second images is arranged in a second area. A game program according to any one of the above. The image generating means arranges the first image in a first area located in the center of the display image, and arranges each of the second images in a second area located at a position different from the first area. 7. The game program according to claim 6, wherein the display image is generated sequentially as follows. The image generating means arranges the first image in a first area located in the center of the display image, arranges the second areas one by one at positions on the left and right of the first area, and 7. The game program according to claim 6, wherein the display images are sequentially generated such that each of the second images is arranged in the second area of the . 9. The game program according to any one of claims 2 to 8, wherein said image generation means sequentially generates display images including a target image for enabling identification of an opponent specified as a target by the user. In the game program, the game situation of the opponent specified as the target by the user is a defeat condition defined in advance based on the instruction given by the change instruction means of the information processing device of the user. further functioning the computer as adding means for adding a predetermined value to the number of defeat inductions associated with the user when
The situation data includes defeat induction number information indicating the number of defeat inductions of the opponent,
10. The game program according to any one of claims 1 to 9, wherein said image generating means generates said second image containing information indicating the number of defeat inductions possessed by said opponent, based on said defeat induction number information. . The battle game is a puzzle game in which puzzle objects that increase over time within a predetermined play field are erased,
The change instruction means instructs to increase the number of opponent puzzle objects identified as targets by the identification means,
The game program determines that the game cannot be continued if the arrangement state of the puzzle objects within the play field satisfies a pre-defined defeat condition, and determines that the game cannot be continued. 3. The game program according to claim 2, further causing the computer to function as victory/loss judgment means for judging that the victory condition is satisfied when the player remains out of all the opponents without satisfying the defeat condition. When adding a predetermined value to the number of defeat inductions associated with the user, the addition means adds, as the predetermined value, a value obtained by adding the number of defeat inductions possessed by the opponent who has satisfied the defeat condition. The game program according to claim 10 . 11. The game program according to claim 10, wherein, when the policy selected by said policy selection means is the first policy, said specifying means specifies the opponent with the largest number of defeat inducements as said target. When the policy selected by the policy selection means is the second policy, the identifying means identifies the opponent who has identified the user as a target based on the to-be-identified information data as a target of the user. The game program according to claim 11 . 12. The game program according to claim 10 or 11, wherein if the selected policy is the third policy, the user is targeted to the opponent closest to the losing condition. 2. The game program according to claim 1, wherein at least one of the plurality of opponents is targeted based on the instruction of the user regardless of the selected policy. 2. The game program of claim 1, wherein if the selected policy is the fourth policy, the user is targeted to a randomly determined opponent. A game device for providing a competitive game to a user,
game execution means for executing a first game process that progresses independently of a second game process related to an opponent of the user based on an operation of the user;
acquisition means for sequentially acquiring situation data indicating a second game situation of the second game process related to the plurality of opponents;
A first image reflecting the first game situation of the first game process, and a plurality of second images reflecting the second game situation indicated by the plurality of situation data acquired by the acquiring means. and image generation means for sequentially generating display images including
A policy for automatically selecting at least one of a plurality of opponents during play of the competitive game, which one of a plurality of preset policies is selected based on the user's operation. a policy selection means for selecting one policy;
identifying means for identifying at least one of the plurality of opponents as a target based on the selected policy during play of the competitive game;
a change instruction means for instructing to change the game situation of the opponent identified as the target by the identification means when the user's game situation satisfies a predetermined condition. A game system for providing a competitive game to a user,
game execution means for executing a first game process that progresses independently of a second game process related to an opponent of the user based on an operation of the user;
acquisition means for sequentially acquiring situation data indicating a second game situation of the second game process related to the plurality of opponents;
A first image reflecting the first game situation of the first game process, and a plurality of second images reflecting the second game situation indicated by the plurality of situation data acquired by the acquiring means. and image generation means for sequentially generating display images including
A policy for automatically selecting at least one of a plurality of opponents during play of the competitive game, which one of a plurality of preset policies is selected based on the user's operation. a policy selection means for selecting one policy;
identifying means for identifying at least one of the plurality of opponents as a target based on the selected policy during play of the competitive game;
a change instruction means for instructing to change the game situation of the opponent identified as the target by the identification means when the game situation of the user satisfies a predetermined condition. A game processing control method executed by an information processing device for providing a competitive game to a user, comprising:
a game execution step of executing a first game process that progresses independently of a second game process related to an opponent of the user based on an operation of the user;
an obtaining step of sequentially obtaining situation data indicating a second game situation of the second game process related to the plurality of opponents;
A first image that reflects the first game situation of the first game process, and a plurality of second images that reflect the second game situation indicated by the plurality of situation data acquired in the acquiring step. an image generating step for sequentially generating display images including
A policy for automatically selecting at least one of a plurality of opponents during play of the competitive game, which one of a plurality of preset policies is selected based on the user's operation. a policy selection step of selecting either one of the policies;
an identifying step of identifying at least one of the plurality of opponents as a target based on the selected policy during play of the competitive game;
and a change instruction step of giving an instruction to change the game situation of the opponent identified as a target in the identification step when the game situation of the user satisfies a predetermined condition.

Images