JP7065282B2 - Programs, game controls, and game systems - Google Patents

Description

The present invention relates to a game system, a game control device, and a program.

Conventionally, a game in which a game object such as a game character is moved in a game space is known. According to Patent Document 1, in a game in which a ally character and an enemy character move squares on a map to compete for a position, the enemy character is sandwiched between a plurality of ally characters or within an area surrounded by a plurality of ally characters. A game device that reduces the physical strength parameter of an enemy character when an enemy character is inserted is described.

Japanese Patent No. 5105730

However, in the technique of Patent Document 1, in order to reduce the physical strength parameter of the enemy character, it is sufficient to simply sandwich or surround the enemy character with the ally character, so that the user can only use the current position of the ally character or the enemy character. The game tended to be monotonous. For example, in a game such as Patent Document 1, if the user can be made aware of not only the point of the character but also other elements such as the route to the point, a more strategic game can be provided. Can be done.

The present invention has been made in view of the above problems, and an object of the present invention is to provide a game system, a game control device, and a program capable of enhancing the strategic nature of a game.

In order to solve the above problems, in the game system according to one aspect of the present invention, at least one of a plurality of first objects operated by each of the plurality of users and one or a plurality of second objects that are opponents. Is a game system that executes a game that can be moved between each of the plurality of points and the other points associated with the points, and each of the plurality of points and the plurality of objects. An information acquisition means for acquiring association information between the first identification information for identifying one object and the second identification information for identifying the one or a plurality of second objects, and a predetermined Based on the change means for changing the association information based on the condition of, and the association information of the point on the route connecting the point where the object exists and the specific point, the game is attached to the object. It is characterized by including an effect generating means for generating the above disadvantageous effect.

In the game control device according to one aspect of the present invention, at least one of a plurality of first objects operated by each of the plurality of users and one or a plurality of second objects as opponents is each of a plurality of points. A game control device that executes a game that can be moved between the point and another point associated with the point, in order to identify each of the plurality of points and the plurality of first objects. Based on the information acquisition means for acquiring the association information between the first identification information of the above and the second identification information for identifying the one or a plurality of second objects, and a predetermined condition. Based on the changing means for changing the association information and the association information of the point on the route connecting the point where the object exists and the specific point, the object is given a disadvantageous effect on the game. It is characterized by including a means for generating an effect to be generated.

It is a figure which shows the whole structure of the game system which concerns on embodiment of this invention. It is a figure which shows an example of the map at the start of a game. It is a figure which shows an example of a game image. It is a figure which shows an example of a detailed information image. It is a figure which shows an example of the detailed information image when the point which the enemy army is controlling is selected. It is a figure which shows the game image when the ally deck moves to a point. It is a figure which shows an example of the detailed information image when a user selects a point. It is a figure which shows an example of the battle preparation image. It is a figure which shows an example of a battle image. It is a figure which shows an example of the battle result image. It is a figure which shows an example of a game image. It is a figure which shows an example of the detailed information image when a user selects a point. It is a figure which shows the state which the ally deck is isolated. It is a figure which shows the case where an enemy deck becomes an isolated state. It is a figure which shows the state which the ally army controlled all around the point which is the home of the enemy army. It is a figure which shows the state which the enemy army controlled all around the point which is the home of the ally army. It is a figure which shows how the enemy deck newly occurs. It is a figure which shows an example of the detailed information image at the time of selecting the point which the ally army is controlling in the presence of an enemy deck. It is a functional block diagram which shows the function which is related to this invention among the functions realized by the game system. It is a figure which shows an example of a user information table. It is a figure which shows an example of the ally army information table. It is a figure which shows an example of an enemy army information table. It is a figure which shows an example of a map situation table. It is a flow diagram which shows an example of the process executed in a game system. It is a flow diagram which shows an example of the process executed in a game system. It is a flow diagram which shows an example of the process executed in a game system. It is a flow diagram which shows an example of the process executed in a game system. It is a flow diagram which shows an example of the process executed in a game system. It is a flow diagram which shows an example of the process executed in a game system. It is a flow diagram which shows an example of the process executed in a game system. It is a flow diagram which shows an example of the process executed in a game system. It is a functional block diagram of the modification which concerns on the 3rd technique.

Hereinafter, embodiments according to the present invention will be described with reference to the drawings. In the drawings, the same or corresponding configurations may be designated by the same reference numerals, and repeated description may be omitted.

[1. Overall configuration of the game system]
FIG. 1 is a diagram showing an overall configuration of a game system 1 according to an embodiment of the present invention. As shown in FIG. 1, the game system 1 according to the present embodiment includes a plurality of terminals 10-1, 10-2, ..., 10-N, and a server 30 (an example of a game control device). .. In the following, the contents common to the terminals 10-1, 10-2, and 10-N may be described as "terminal 10".

The terminal 10 and the server 30 are connected to the network N. Therefore, data communication is possible between the terminal 10 and the server 30.

The terminal 10 is a terminal device (computer) used by the user. In this embodiment, the terminal 10 is a computer used by the user to play a game. For example, the terminal 10 is a mobile phone (including a smartphone), a tablet computer, a laptop computer, a desktop computer, a portable game machine, a stationary game machine, a commercial game machine installed in a store, or an information processing function. It is a multifunctional television receiver (smart television) equipped with. In the following, a case where the mobile phone (smartphone) provided with the touch panel is the terminal 10 and the program supplied from the server 30 is executed on the mobile phone (smartphone) will be described.

As shown in FIG. 1, the terminal 10 includes a control unit 11, a storage unit 12, a communication unit 13, an input unit 14, and a display unit 15.

The control unit 11 includes, for example, at least one microprocessor and the like, and executes processing according to an operating system and other programs. The storage unit 12 includes a main storage unit (for example, RAM) and an auxiliary storage unit (for example, a non-volatile semiconductor memory) for storing programs and data. For example, when the terminal 10 is a stationary game machine, a business game machine, a laptop computer, a desktop computer, or the like, the storage unit 12 may include an auxiliary storage unit such as a hard disk drive or a solid state drive. good.

The communication unit 13 is for performing data communication via the network N. The input unit 14 includes, for example, a touch panel, buttons, and the like, and is for the user to perform an input operation such as a game operation. The input unit 14 may be for the user to perform an input operation by voice or gesture. When the terminal 10 is a stationary game machine, a portable game machine, a business game machine, a laptop computer, a desktop computer, or the like, the input unit 14 is a key, a lever, a game controller (game pad), a mouse, and a touch pad. , Or a keyboard or the like may be included. The display unit 15 is, for example, a liquid crystal display panel, an organic EL display, or the like, and displays an image according to the instructions of the control unit 11. The input unit 14 and the display unit 15 do not have to be built in the terminal 10, and may be an external device connected to the terminal 10.

The server 30 is realized by, for example, a server computer. As shown in FIG. 1, the server 30 includes a control unit 31, a storage unit 32, and a communication unit 33.

The control unit 31 and the communication unit 33 have the same functions as the control unit 11 and the communication unit 13 of the terminal 10. The storage unit 32 includes a main storage unit (for example, RAM) and an auxiliary storage unit (for example, a hard disk drive or a solid state drive), and is for storing programs and data.

The program or data described as being stored in the storage unit 12 or the storage unit 32 may be supplied to the terminal 10 or the server 30 via the network N, for example. Further, the terminal 10 or the server 30 may include a component for reading a program or data stored in an information storage medium (for example, an optical disk or a memory card). Then, the program or data may be supplied to the terminal 10 or the server 30 via the information storage medium.

[2. Overview of the game played by the game system]
In the game system 1, at least one of a plurality of first objects operated by each of the plurality of users and one or a plurality of second objects that are opponents is associated with each of the plurality of points and the points. Play a game that can be moved between and between other points.

In the present embodiment, the "plurality of users" are users who play games in cooperation. The "plurality of users" may belong to a user group in advance, or may not belong to a user group in particular. The user group is, for example, a group of users in a peer relationship. Users belonging to the same user group can communicate with each other such as chat. Further, when a predetermined game event is held, users in the same user group can cooperate with each other. User groups are called teams, guilds, legions, and so on. In this embodiment, a case where a team corresponds to a user group will be described.

An "object" is an object that can be used in a game. For example, an "object" is given to a user in a game. Further, for example, an "object" is an object to be collected by a user. Specifically, for example, a game card, a game character, a game item, or the like corresponds to an example of an "object". Alternatively, a deck composed of a plurality of game cards, a plurality of game characters, a plurality of game items, and the like corresponds to an "object". In this embodiment, there are two "objects", a user object and an opponent object. A "user object" is an object operated by a user. An "opponent object" is an opponent of a user object. In this embodiment, a case where a deck corresponds to an "object" and each user's deck corresponds to a user object will be described. Hereafter, the group consisting of the decks of each user who has a cooperative relationship is called the ally army.

An "opponent" is an object that fights a user's deck in the game. This object may be under the control of a computer or may be manipulated by an opponent user. In this embodiment, a case where a deck placed under the control of a computer corresponds to an "opponent" (an opponent object) will be described. Hereinafter, the user's deck is described as an ally deck, and the opponent of the ally deck is described as an enemy deck. A group consisting of multiple enemy decks is called an enemy army.

A "point" is a base, building, place, or location in a virtual world. Multiple "points" are set in the virtual world. The virtual world may be a three-dimensional space or may be represented by a two-dimensional image. The "point" is, for example, a target to be suppressed (occupied / contested) by a friendly army or an enemy army. In this embodiment, a case where a plurality of points are set in a two-dimensional map will be described.

[2-1. Overview of the entire game]
Here, an example is a game in which each of a plurality of users belonging to a team cooperates to fight an enemy deck while moving a friendly deck in the map. FIG. 2 is a diagram showing an example of a map at the start of the game. The xy axis in FIG. 2 is a coordinate axis of two-dimensional coordinates. As shown in FIG. 2, a plurality of points P1 to P30 are set in the map M. Hereinafter, when it is necessary to refer to the drawing, it will be described with a reference numeral such as “point P1”, and when it is not particularly necessary, it will be described without a reference numeral such as “point”. The position of each point is specified by the two-dimensional coordinates in the map M.

The friendly decks D1 to D5 and the enemy decks E1 to E12 of each user are arranged at any point. As with the points, when it is necessary to refer to the drawings for the friendly deck and the enemy deck, it is necessary to add a code such as "Friend deck D1" or "Enemy deck E1". If not, just explain it without a sign like "Friend deck" or "Enemy deck". At each point, not only one friendly deck or one enemy deck but also multiple decks may be placed. Since the map M in FIG. 2 is the one at the start of the game, the ally deck and the enemy deck will exist at the initial position.

In the following description, when the description is described as "the point where the deck exists", it means the point associated with the deck on the data. That is, it means that information for identifying any point is stored as information indicating the current position of the deck. In other words, among the images showing each point displayed on the display unit 15, it means the point indicated by the image displayed at the same position as the image showing the deck or at a position within a predetermined distance.

As shown in FIG. 2, a plurality of roads R1 to R38 are set on the map M. As with the point, when it is necessary to refer to the drawing, the road is described with a code such as "road R1", and when it is not particularly necessary, the code is simply used as "road". I will explain without attaching. Each point is connected by a road to one or more other points. For example, a friendly deck can move to another point connected to the current point by a road by consuming energy points, which will be described later. For example, the ally deck D1 at the point P12 can move to any of the points P7, P11, P13, and P18 connected by the roads R12, R16, R17, and R21. Similarly, other friendly decks D2 to D5 can move to other points connected to the current point by a road. The enemy deck may also be movable, but in the present embodiment, for the sake of simplification of the explanation, the case where the enemy deck does not move will be described.

In the map M, there are a point controlled by the ally army, a point controlled by the enemy army, and a neutral point controlled by neither the ally army nor the enemy army. In FIG. 2, the points controlled by the ally army are indicated by diagonal lines, the points controlled by the enemy army are indicated by halftone dots, and the neutral points are indicated by unpatterned white outlines. At the beginning of the game, the friendly deck is at one of the points controlled by the friendly army. On the other hand, the enemy deck exists at any of the points controlled by the enemy army. In the example shown in FIG. 2, the enemy decks are placed at all the points controlled by the enemy army, but the enemy decks may or may not be placed even at the points controlled by the enemy army. good.

In addition, any of the points controlled by the ally army is set as the home of the ally army. Any of the points controlled by the enemy army will be set as the home of the enemy army. In FIG. 2, point P22 is the home of the friendly army and point P9 is the home of the enemy army. The home base is used to determine the outcome of the game. For example, if the ally army controls the point P9, which is the home of the enemy army, the ally army wins, and if the enemy army controls the point P22, which is the home of the ally army, the enemy army wins.

At each point, as a general rule, the army to control changes based on the result of the battle between the friendly deck and the enemy deck at that point. For example, a user can spend energy points to move an ally deck to a point controlled by an enemy army, and then spend the battle points described below to play against an enemy deck at that point. Become.

For example, if a friendly deck wins a battle at a point controlled by an enemy army, the friendly army can control that point. If a friendly deck does not win in a match at a point controlled by the enemy army, that point remains controlled by the enemy army. Even if you can't beat the enemy deck, your ally deck may stay at the point where the match took place. For this reason, friendly decks can challenge enemy decks again. The enemy deck may be weakened each time it is played against a friendly deck. The degree to which the enemy deck becomes weak in this case may be determined based on the content of the battle with the ally deck.

On the other hand, an enemy deck will be generated at the point where the ally is controlling, and if you cannot win this enemy deck within a certain period of time, that point will be controlled by the enemy army. Therefore, the user moves the ally deck to the point where the enemy deck is generated and plays against it. If the ally deck cannot defeat the enemy deck and the point is overwhelmed by the enemy army, the ally deck may be forced to return to the point P22 which is the base of the ally army. In this case, energy points may be consumed by a predetermined value. If a friendly deck wins an enemy deck within a certain period of time, the point where the enemy deck is generated remains controlled by the friendly army.

If the ally deck moves to a neutral point, the ally army can control that point without any special battle. Similarly, when an enemy deck occurs at a neutral point, that point is overwhelmed by the enemy army without any special battle.

As mentioned above, the user moves his ally deck in the map M to control each point, defending the base of the ally army, and finally controlling the base of the enemy army and aiming to win. .. When the game starts, a game image showing the current state of the running game is displayed on the display unit 15. Hereinafter, an example of an image displayed on the terminal 10 of the user who operates the ally deck D1 will be described.

FIG. 3 is a diagram showing an example of a game image. As shown in FIG. 3, in the game image G10, the current value and the maximum value of the energy points for moving the ally deck D1, the current value and the maximum value of the battle points for playing against the enemy deck, and the team as a whole The score obtained and the score obtained by the user individually are displayed.

The user can spend energy points to move a friendly deck within the map M. For example, when a user moves to a point where his / her ally deck is located and an adjacent point connected by a road, 2 pt of energy points are consumed. You cannot move an ally deck unless you have more than a certain amount of energy points left. Energy points recover over time. The energy points may be recovered when a predetermined game item is used or when an in-game currency is used.

In addition, the user can spend battle points to play a battle between a friendly deck and an enemy deck. For example, when a user uses his or her ally deck to play against an enemy deck, it consumes 1 pt of battle points. If there are no more than a certain number of battle points left, you cannot play a match. Battle points recover over time. The battle points may be recovered when a predetermined game item is used or when an in-game currency is used.

Further, in the map display area A10 of the game image G10, a part of the state in the map M is displayed. The user can scroll the map M displayed in the map display area A10 by performing a predetermined scroll operation. When the user selects a point displayed in the map display area A1, a detailed information image showing detailed information of the point is displayed on the display unit 15.

FIG. 4 is a diagram showing an example of a detailed information image. As shown in FIG. 4, the detailed information image G20 displays the suppression status of the point selected by the user and the presence / absence of a friendly deck or an enemy deck. Here, the detailed information image G20 when the user selects the point P23 is shown. As shown in FIG. 4, in the detailed information image G20, it is displayed that the ally army is controlling the point P23 and there is no ally deck or enemy deck.

Further, the processing objects OB20 and OB21 are displayed on the detailed information image G20. A "processing object" is an image, symbol, text, or the like with which processing is associated. The processing object OB20 is associated with a process for moving the user's ally deck D1 to a point displayed on the detailed information image G20. Therefore, when the user selects the processing object OB20, he / she can move his / her ally deck D1 to the point displayed on the detailed information image G20. Further, the processing object OB21 is associated with a process for returning to the game image G10. Therefore, when the user selects the processing object OB21, the game returns to the game image G10.

As mentioned above, each ally deck can move to an adjacent point that is directly connected to the current point by a road, but in this embodiment, it is possible to go only through the point controlled by the ally army. For example, it is possible to move all at once instead of moving one by one. For example, since the point P12 where the ally deck D1 is located can go to the point P23 selected by the user only through the points controlled by the ally army (for example, road R16 → road R20 → road R28), the ally deck D1 can be used. You can move to point P23 at once. In this case, more energy points (for example, 10 pt) may be consumed as compared with the case of moving one, or the same energy points (for example, 2 pt) may be consumed as in the case of moving one.

FIG. 5 is a diagram showing an example of the detailed information image G20 when a point controlled by the enemy army is selected. FIG. 5 shows a detailed information image G20 when the user selects the point P13. As shown in FIG. 5, the detailed information image G20 displays information indicating that the enemy army is controlling the point P13. Further, the detailed information image G20 displays that the enemy deck E9 is present at this point P13. In addition, the names and parameters of the game characters constituting the enemy deck E9 may be displayed.

The processing object OB22 is associated with a process for moving the ally deck D1 to the point P13 selected by the user. When the user selects the processing object OB22, the ally deck D1 moves to the point P13 by consuming energy points, and the game image G10 is displayed on the display unit 15.

FIG. 6 is a diagram showing a game image G10 when the ally deck D1 moves to the point P13. As shown in FIG. 6, when the ally deck D1 moves to the point P13, the map display area A10 is updated. As shown in FIG. 6, since the ally deck D1 and the enemy deck E9 are at the point P13, it becomes possible to play against each other to control the point P13. For example, the user can instruct the battle from the detailed information image G20 displayed on the display unit 15 by selecting the point P13.

FIG. 7 is a diagram showing an example of the detailed information image G20 when the user selects the point P13. As shown in FIG. 7, in the detailed information image G20, it is displayed that the ally deck D1 and the enemy deck E9 are present at the point P13, and the battle point of the user is displayed. The processing object OB23 is associated with processing for playing a battle between the friendly deck D1 and the enemy deck E9. When the user selects the processing object OB23, the battle preparation image is displayed on the display unit 15.

FIG. 8 is a diagram showing an example of a battle preparation image. As shown in FIG. 8, the battle preparation image G30 displays detailed information such as game characters and parameters constituting the enemy deck E9, the presence / absence of an effect generated in the battle, information on the point P13, and the like. When the user selects the processing object OB31, the game image G10 may be returned. The processing object OB30 is associated with a process for starting a battle. When the user selects the processing object OB30, the battle starts, and the battle image is displayed on the display unit 15.

FIG. 9 is a diagram showing an example of a battle image. As shown in FIG. 9, the battle image G40 displays an image of the game character constituting the ally deck D1 and an image of the game character constituting the enemy deck E9. The match itself can be executed by various known processes. For example, the one who annihilate the opponent by executing the battle until one of the ally deck D1 and the enemy deck E9 is annihilated may be the winner, or the battle may be executed for a predetermined number of turns. You may do so. When the battle is completed, the battle result image G50 is displayed on the display unit 15.

FIG. 10 is a diagram showing an example of the battle result image G50. As shown in FIG. 10, the battle result image G50 displays detailed information on the enemy deck E9, battle results, and game items and scores acquired in the battle. Here, since the user's ally deck D1 has won, the battle result image G50 indicates that the ally's army has suppressed the point P13. The processing object OB50 is associated with a process of returning to the game image G10. When the user selects a processing object, the game image G10 is displayed on the display unit 15.

FIG. 11 is a diagram showing an example of the game image G10. As shown in the map display area A10 of FIG. 11, in the battle at the point P13, the user's ally deck D1 wins, so that the point P13 is in a state of being suppressed by the ally army from a state of being suppressed by the enemy army. Then, the enemy deck E9, which was defeated in the battle at the point P13, has disappeared from the map M. After that, the user selects the point to be suppressed next and moves his / her ally deck D1 to play a match.

In this embodiment, the point controlled by the enemy army cannot move unless the friendly army controls the point connected by the road. For example, in the state shown in FIG. 2, among the points controlled by the enemy army, only the point P13 is controlled by the ally army at the points connected by the road. For this reason, the ally deck of the ally army can move only to the point P13 among the points controlled by the enemy army, and cannot move to other points such as P8.

FIG. 12 is a diagram showing an example of the detailed information image G20 when the user selects the point P15. Similar to FIG. 5, the detailed information image G20 of FIG. 12 displays information about the point P15, but the point P15 is controlled by the enemy army at the points P10, P14, and P21 connected by the road. Therefore, it will be displayed that it cannot be moved. Therefore, the processing object OB22 is not displayed.

In this embodiment, three techniques related to such a game will be mainly described. Hereinafter, these are referred to as the first technique to the third technique.

[2-2. Outline of the first technique]
In the first technique, when an ally deck is surrounded by an enemy deck and becomes isolated, the effect that the ally deck becomes disadvantageous in the battle occurs. Similarly, in the first technique, when an enemy deck is surrounded by a friendly deck and becomes isolated, the effect that the enemy deck becomes disadvantageous in the battle occurs.

FIG. 13 is a diagram showing a state in which a friendly deck is isolated. As shown in FIG. 13, the point P18 where the ally deck D1 is located is controlled by the ally army, but the points P12 and P19 connected by the roads R21 and R25 are all controlled by the enemy army. Therefore, even if an attempt is made to move from the point P22, which is the home of the ally army, to the point P18, it is not possible to go through only the point controlled by the ally army. In this embodiment, such a state is referred to as an isolated state.

Also, the point P7 where the ally deck D2 is located is controlled by the ally army at the point P3 connected by the road R6, but even if you try to move from the point P22, which is the base of the ally army, to the point P7, the ally army You can't go only through the points that are overwhelming. Therefore, the ally deck D2 is also isolated. In this embodiment, when the ally decks D1 and D2 are isolated, the abilities of the ally decks D1 and D2 are reduced or the abilities of the enemy decks are improved, so that the ally decks D1 and D2 are disadvantageous. The effect is generated. Similarly, when an enemy deck becomes isolated, the effect that the enemy deck becomes disadvantageous occurs.

FIG. 14 is a diagram showing a case where the enemy deck is in an isolated state. As shown in FIG. 14, the point P21 where the enemy deck E10 is located is controlled by the enemy army, but even if the enemy army tries to move from the point P9 to the point P21, the point where the enemy army is controlling. Can't just go through. The same applies to the point P20 where the enemy deck E11 is located and the point P26 where the enemy deck E12 is located. Therefore, the enemy decks E10 to E12 are in an isolated state. When it becomes isolated like the enemy decks E10 to E12, the ability of the enemy decks E10 to E12 decreases and the ability of the ally decks D1 and D2 improves, so that the enemy decks E10 to E12 become disadvantageous. Occurs.

[2-3. Outline of the second technology]
In the second technique, if all the surroundings of the enemy army's home point P9 are suppressed by the ally army, the effect that the enemy deck E5 at the enemy army's home point P9 will be disadvantageous in the battle will occur. ing. Similarly, in the second technique, if the enemy army controls all around the point P22, which is the base of the ally army, the ally deck at the point P22, which is the base of the ally army, will have the effect of being disadvantageous in the battle. It has become.

FIG. 15 is a diagram showing a state in which the ally army has suppressed the entire area around the point P9, which is the home of the enemy army. As shown in FIG. 15, the ally army controls all the points P5, P8, P10, and P14 connected to the point P9, which is the base of the enemy army, by the roads R8, R10, R11, and R14. Hereinafter, in the present embodiment, such a state is referred to as a state surrounding the home base. When the enemy army's base is surrounded, for example, the ability of the enemy deck E5 at the point P9 decreases, or the ability of the ally decks D1, D2, D3, D4 improves, so that the enemy deck E5 is disadvantageous. The effect of becoming occurs.

FIG. 16 is a diagram showing a state in which the enemy army has suppressed the entire area around the point P22, which is the home of the ally army. As shown in FIG. 16, the enemy army controls all the points P16, P23, and P27 connected to the point P22, which is the base of the ally army, by the roads R27, R31, and R33. In this way, when it becomes a state surrounding the base of the ally army, for example, the ability of the ally deck D5 at the point P22 decreases, or the ability of the enemy decks E13, E14, E15 improves, so that the ally deck D5 Has the effect of becoming disadvantageous.

[2-4. Overview of the third technology]
In the third technique, when the ally deck of the ally army moves or fights and the consumption of energy points and battle points is accumulated, a new enemy deck is generated in the map M.

FIG. 17 is a diagram showing how an enemy deck is newly generated. In the example shown in FIG. 17, a new enemy deck E13 is generated at the point P20 connected by the road R25 to the point P20 controlled by the enemy army. Since point P19 was originally neutral, it will change to a state where the enemy army has suppressed it without any particular battle. In addition, an enemy deck E14 is newly generated at the point P13 controlled by the enemy army. Therefore, if you try to control the point P13, you have to win the two enemy decks E9 and E14.

Furthermore, an enemy deck E15 is newly generated at the point P7. Point P7 is controlled by a friendly army, but there is no friendly deck. In this case, if the user does not move the ally deck to the point P7 and play against the enemy deck E15 and win within a predetermined time (for example, 10 minutes), the point P7 changes to the state controlled by the enemy army. .. In order to play against the enemy deck E15 generated at the point P7, the user selects the point P7 from the game image G10 with the ally deck moved to the point P7.

FIG. 18 is a diagram showing an example of a detailed information image G20 when a point controlled by an ally army is selected in a state where an enemy deck is present. As shown in FIG. 18, the detailed information image G20 indicates that the enemy deck E15 is generated at the point P7 controlled by the ally army. The processing object OB24 is associated with processing for playing a battle between the friendly deck D1 and the enemy deck E15. When the user selects the processing object OB24, the battle preparation image similar to that in FIG. 8 is displayed on the display unit 15, and the battle can be performed.

[3. Functions realized in the game system]
FIG. 19 is a functional block diagram showing functions related to the present invention among the functions realized by the game system 1. In the present embodiment, the case where the main processing related to the game is executed on the server 30 will be described. Therefore, the server 30 includes a data storage unit 300, an information acquisition unit 310, a specific unit 320, a battle execution unit 330, a change unit 340, an effect generation unit 350, a win / loss determination unit 360, an action control unit 370, and a cumulative information acquisition unit 380. , A parameter change unit 390, an achievement determination unit 400, and an enemy deck generation unit 410. The data storage unit 300 is mainly realized as a storage unit 32, and includes an information acquisition unit 310, a specific unit 320, a battle execution unit 330, a change unit 340, an effect generation unit 350, a win / loss determination unit 360, an action control unit 370, and a cumulative information acquisition unit. The unit 380, the parameter change unit 390, the achievement determination unit 400, and the enemy deck generation unit 410 are mainly realized by the control unit 31. As will be described in the modified example described later, the main processing related to the game may be executed on the terminal 10.

First, the functions common to the first technique to the third technique will be described, and then the functions related to each of the first technique to the third technique will be described. Here, the data storage unit 300 will be described as a function common to the first technique to the third technique. The data storage unit 300 stores various data necessary for executing the game. Here, as an example of the data stored in the data storage unit 300, the user information table TBL101, the friendly army information table TBL102, the enemy army information table TBL103, and the map status table TBL104 will be described.

FIG. 20 is a diagram showing an example of a user information table. The user information table TBL101 is a data table that stores various information about the user. For example, in the user information table TBL101, a "user name" indicating a user's name, a "team ID" for identifying a team to which the user belongs, and an energy point of energy points are associated with a "user ID" which is an example of user identification information. Information such as "energy points" indicating the current value and the maximum value, and "battle points" indicating the current value and the maximum value of the battle points are stored. The "user identification information" is information for uniquely identifying a user. For example, the "user identification information" is a user ID, a user's name, a user account, and an e-mail address. In the following description, the case where the user ID corresponds to the "user identification information" will be described.

FIG. 21 is a diagram showing an example of an ally army information table. The friendly army information table TBL102 is a data table that stores various information about the friendly army. For example, in the ally army information table TBL102, a "ally deck ID" that uniquely identifies an ally deck, a "user ID" of a user who operates the ally deck, a "point" where the ally deck is located, and a game card that constitutes the ally deck. Various parameters such as "card ID" and "serial number", game card "name", game card "rareness", "HP", "attack power", "defense power", "cost", etc. Information such as the "enemy generation point" described later is stored. When the user owns a plurality of the same game cards, the "card ID" of these game cards is the same, but the "serial number" is different. As the serial number, when a game card is given to the user, a number that can identify the game card is issued.

FIG. 22 is a diagram showing an example of an enemy army information table. The enemy army information table TBL103 is a data table that stores various information about the enemy deck. For example, in the enemy army information table TBL103, a "deck ID" for identifying an enemy deck, a "point" where an enemy deck is located, a "card ID" and a "serial number" for identifying game cards constituting the enemy deck, and a game card Information such as the "name" of the game card, various parameters such as "rareness", "HP", "attack power", "defense power", and "cost" of the game card is stored. Note that the game cards that make up the enemy deck do not have to be given a serial number.

FIG. 23 is a diagram showing an example of a map status table. The map status table TBL104 is a data table that stores the current status of the map M. For example, in the map status table TBL104, the "point" of the map M, the "adjacent point" indicating each point and other points connected by a road, the "suppression status" indicating the suppression status of the point, and the home of the ally army. Information such as "friendly army base" indicating "friendly army base" and "enemy army base" indicating the enemy army base is stored. Information that identifies any of "friendly army", "enemy army", and "neutral" is stored in the "suppression status". In this embodiment, this information is "1", "2", and "0", respectively.

The data stored in the data storage unit 300 is not limited to the above example. The data storage unit 300 may store data necessary for executing the game. For example, the data storage unit 300 may store a data table in which basic information of the game card is stored, or may store a data table in which the game card owned by the user is stored. Alternatively, for example, the data storage unit 300 may store a data table that stores basic information of the team to which the user belongs. Further, for example, the data storage unit 300 may store data regarding a newly generated enemy deck in the map M.

[3-1. Functions related to the first technology]
The first technique is mainly realized by a data storage unit 300, an information acquisition unit 310, a specific unit 320, a battle execution unit 330, a change unit 340, and an effect generation unit 350.

[3-1-1. Information acquisition department]
The information acquisition unit 310 includes each of the plurality of points, one of the first identification information for identifying a plurality of ally decks and the second identification information for identifying one or a plurality of enemy decks. Get the association information of ,.

The "first identification information" is information for identifying an ally army from a plurality of armies in a game. In other words, the "first identification information" is information that can identify a plurality of ally decks as a whole, and is information common to the plurality of ally decks. That is, the "first identification information" is information for identifying an ally army. In the case of a game in which a plurality of users belonging to a team cooperate as in the present embodiment, the team ID may correspond to the "first identification information". In the present embodiment, the case where the numerical value of "1" representing the ally army corresponds to the "first identification information" will be described.

The "second identification information" is information for identifying an enemy army from a plurality of armies in a game. In other words, the "second identification information" is information that can identify the enemy deck as a whole, and is information common to the enemy decks. That is, the "second identification information" is information for identifying the enemy army. If the opponent's object is one, the "second identification information" is information for identifying this object itself. In the present embodiment, the case where the numerical value of "2" representing the enemy army corresponds to the "second identification information" will be described.

"Association information" is information for identifying whether a friendly army or an enemy army is associated with each point. "Associating" means associating and storing data with data. Further, for example, "associating" means making the other data referable from one of the two data. In this embodiment, a case where the correspondence between the “point” and the “suppression status” in the map status table TBL104 corresponds to the “association information” will be described. The case where the stored "suppression status" corresponds to the "association information" will be described. Therefore, "associating" can be said to manage "points" and "suppression status" in the same table. The information acquisition unit 310 will acquire map status data with reference to the data storage unit 300.

[3-1-2. Specific part]
The specific unit 320 identifies friendly decks and enemy decks that can participate in the battle based on the position information of the decks (friendly decks, enemy decks) at each of a plurality of points. In the present embodiment, the position information of the ally deck is the "point" stored in the ally information table TBL102, and the position information of the enemy deck is the "point" stored in the enemy army information table TBL103. The specific unit 320 identifies the friendly deck and the enemy deck that can participate in the battle based on the points and the positions of the friendly deck and the enemy deck. In this embodiment, the ally deck and the enemy deck at a certain point fight, so the specific unit 320 specifies the ally deck and the enemy deck at the point as decks that can participate in the battle at each of a plurality of points. become.

The specific unit 320 may specify an ally deck and an enemy deck within a predetermined distance from a certain point as decks that can participate in the battle. For example, the specific unit 320 specifies an ally deck or an enemy deck at a point connected to a certain point by a road R as a deck that can participate in a battle. It should be noted that a friendly deck or an enemy deck located at two or more distant points instead of adjacent points may be specified as decks that can participate in the battle. For example, if a friendly deck or an enemy deck has a predetermined attack range and can attack a point farther than the adjacent point, the specific unit 320 participates in the battle based on the attack range. Identify possible decks.

[3-1-3. Battle Execution Department]
The battle execution unit 330 executes a battle at each of a plurality of points. For example, the battle execution unit 330 executes a battle at each of a plurality of points to determine whether the friendly army or the enemy army controls the point. The battle may be any one as long as the victory or defeat is determined under predetermined conditions, and various battles can be applied. For example, it does not have to be a battle format based on a user-owned ally deck as in the present embodiment, and the battle is performed based on the user's operation, not particularly based on the user-owned ally deck. You may. For example, a match may be something like a lottery or rock-paper-scissors.

In the present embodiment, the battle execution unit 330 executes a battle at each of a plurality of points based on the ally deck and the enemy deck specified by the specific unit 320. For example, the battle execution unit 330 executes a battle based on the parameters of the game cards constituting the ally deck and the parameters of the game cards constituting the enemy deck. In this case, the battle execution unit 330 reduces the HP of the game cards constituting the enemy deck by the damage determined based on the attack power of the game cards constituting the ally deck and the defensive power of the game cards constituting the enemy deck. Further, the battle execution unit 330 reduces the HP of the game cards constituting the ally deck by the damage determined based on the attack power of the game cards constituting the enemy deck and the defensive power of the game cards constituting the ally deck.

Game cards with HP 0 will not be able to participate in battles. Therefore, the game card whose HP becomes 0 cannot attack the opponent. The battle execution unit 330 may execute the battle until either the ally deck or the enemy deck is completely destroyed, or may end the battle after executing the battle for a predetermined number of turns or for a certain period of time. ..

[3-1-4. Change part]
The change unit 340 changes the "suppression status" of the map status table TBL104 based on a predetermined condition. The predetermined conditions may be predetermined conditions. The change unit 340 changes the map status table TBL104 when a predetermined condition is satisfied. For example, the fact that the running game is in a predetermined situation corresponds to satisfying a predetermined condition.

In the present embodiment, the change unit 340 changes the "suppression status" of the map status table TBL104 based on the result of the battle executed by the battle execution unit 330. The change unit 340 changes the "suppression status" of the map status table TBL104 when the match has a predetermined result, and changes the "suppression status" of the map status table TBL104 when the match does not have the predetermined result. It does not change.

The prescribed result is that the ally or enemy army that does not control the point wins the match. In other words, the given result is that the one who controls the point loses the match. That is, if the person who controls the point wins or draws in the match, the predetermined result will not be obtained. In other words, if the person who does not control the point loses or draws in the match, the prescribed result will not be obtained.

In the present embodiment, the change unit 340 changes the "suppression status" of the map status table TBL104 based on the winner of the battle executed by the battle execution unit 330. For example, the change unit 340 changes the "suppression status" of the map status table TBL104 so that the winning side of the friendly army and the enemy army and the point are related to each other.

[3-1-5. Effect generation part]
The effect generation unit 350 generates a disadvantageous effect in the game on the deck based on the association information of the point on the route connecting the point where the deck (friendly deck, enemy deck) exists and the specific point. ..

The "specific point" is a predetermined point among the points in the map M. For example, a point for determining the outcome of a game or a point for producing a specific effect in a game corresponds to a specific point. In this embodiment, the home of the friendly army or the home of the enemy army corresponds to a "specific point".

A "route" is a route taken to move from one point to another. There may be only one "route" or a plurality of "routes".

The "disadvantageous effect" is that it becomes difficult to win a match. For example, changing the parameters of the deck. For example, reducing the ability of the deck. For example, reducing the ability of game cards in the deck. It may also be, for example, to strengthen an opponent's deck adjacent to an isolated deck. Also, for example, the deck cannot activate a predetermined skill. Another example is to limit the actions of the deck. For example, not moving the deck and not playing against it is equivalent to limiting the actions of the deck.

In the present embodiment, the effect generation unit 350 generates a disadvantageous effect by changing the parameters associated with the deck (friendly deck, enemy deck). For example, the effect generation unit 350 puts the ally deck at a disadvantage by reducing the ability of the ally deck or improving the ability of the enemy deck. Further, for example, the effect generation unit 350 puts the enemy deck at a disadvantage by reducing the ability of the enemy deck or improving the ability of the ally deck. In addition, for example, the effect generation unit 350 may make the ally deck disadvantageous by lowering the HP of the ally deck or increasing the HP of the enemy deck. Similarly, the effect generation unit 350 may make the enemy deck disadvantageous by increasing the HP of the ally deck or decreasing the HP of the enemy deck.

In the present embodiment, the effect generation unit 350 generates a disadvantageous effect when the association information of points on the route satisfies a predetermined condition, and generates a disadvantageous effect when the predetermined condition is not satisfied. unlock. The "point on the route" is the point to pass when moving on the route.

The "predetermined condition" means that the suppression status of a point on the route becomes a predetermined condition. For example, the "predetermined condition" is that the number or ratio controlled by the ally army is equal to or higher than the standard, and the number or ratio controlled by the enemy army is higher than the standard. In the present embodiment, a case where the isolated state is a predetermined condition will be described.

"Release the occurrence of the disadvantageous effect" is to stop the occurrence of the disadvantageous effect and to return to the state before the occurrence of the disadvantageous effect. In the present embodiment, the effect generation unit 350 stops the generation of the effect that makes the ally deck or the enemy deck disadvantageous when the ally deck or the enemy deck is no longer isolated.

For example, the effect generation unit 350 includes at least one of the first effect generation unit 351 and the second effect generation unit 352. The effect generation unit 350 may include only one of the first effect generation unit 351 and the second effect generation unit 352, or may include both.

If the route connecting the point where the ally deck exists and the point P22 which is the base of the ally army does not have a route passing only the point associated with the ally army, the first effect generation unit 351 is the ally deck. Causes a disadvantageous effect on the game. For example, the first effect generation unit 351 refers to the map status table TBL104 and identifies a route connecting the point where the ally deck exists and the point P22 which is the base of the ally army. Then, the first effect generation unit 351 determines whether or not there is a route that passes only the points associated with the ally army by referring to the suppression status of all the points on the route for each specified route. do.

The method by which the first effect generating unit 351 determines the isolated state is not limited to the above example. For example, for each point of the map status table TBL104, a flag indicating whether or not it is possible to go through only the points controlled by the ally army from the base may be prepared and the flag may be used. In this case, the first effect generation unit 351 first determines whether or not the point is connected to the point P22, which is the base of the ally army, and is controlled by the ally army. The first effect generation unit 351 is connected to the point P22, which is the base of the ally army, and the flag is turned on at the point controlled by the ally army. Then, the first effect generation unit 351 determines whether or not the ally army is controlling and the flag is adjacent to the on point. The first effect generation unit 351 is controlled by the ally army, and the flag is turned on at the point adjacent to the point where the flag is turned on. After that, the first effect generation unit 351 repeats the determination until the flag does not change. When the flag does not change, the point where the ally army is controlling and the flag is off becomes the isolated point.

If the route connecting the point where the enemy deck exists and the point P9 which is the base of the enemy army does not have a route passing only the point associated with the enemy army, the second effect generation unit 352 causes the enemy deck. Causes a disadvantageous effect on the game. For example, the second effect generation unit 352 specifies a route connecting the point where the enemy deck exists and the point P9 which is the base of the enemy army with reference to the map status table TBL104. Then, the second effect generation unit 352 determines whether or not there is a route that passes only the points associated with the enemy army by referring to the suppression status of all the points on the route for each specified route. do.

The method by which the second effect generating unit 352 determines the isolated state is not limited to the above example. For example, as in the method described in the first effect generation unit 351, for each point of the map status table TBL104, a flag indicating whether or not the enemy army can pass only the point controlled by the enemy army from the base is prepared, and the flag is prepared. May be used. For example, the second effect generation unit 352 determines whether or not each point of the map status table TBL104 is connected to the point P9, which is the base of the enemy army, and is controlled by the enemy army. .. The second effect generation unit 355 is connected to the point P9 which is the base of the enemy army, and the flag is turned on at the point where the enemy army is controlling. Then, the second effect generation unit 352 determines whether the enemy army is controlling and the flag is adjacent to the on point. In the second effect generation unit 352, the flag is turned on at the point where the enemy army is controlling and the point adjacent to the point where the flag is turned on. After that, the second effect generation unit 351 repeats the determination until the flag does not change. When the flag does not change, the point where the ally army is controlling and the flag is off becomes the isolated point.

[3-2. Functions related to the second technology]
The second technique is mainly realized by an information acquisition unit 310, a battle execution unit 330, a change unit 340, an effect generation unit 350, and a win / loss determination unit 360. The information acquisition unit 310, the battle execution unit 330, and the change unit 340 are the same as those described in the first technique.

[3-2-1. Win / Loss Judgment Department]
In the present embodiment, since the plurality of points in the map M include the home point P22 previously associated with the ally army and the home base point P9 previously associated with the enemy army, the win / loss determination unit 360 determines. The victory or defeat of the game is determined based on the "suppression status" of the map status table TBL104 of the points P22 and the points P9. If the point P22, which is the base of the ally army, is associated with the "enemy army", the victory / defeat determination unit 360 determines that the enemy army has won (the defeat of the ally army), and the point P9, which is the base of the enemy army, is the "ally". When associated with "army", it will be judged as a victory of the ally army (defeat of the enemy army).

In addition, in this embodiment, the victory or defeat is distinguished from the victory or defeat of the battle between decks (the battle executed at each point) and the whole game by controlling the base (hereinafter, the general meaning of "game"). Therefore, there are two things, winning and losing as a map game). It can be said that the battle between decks is decided on a deck-by-deck basis or on a point-by-point basis. In other words, deck-to-deck battles are played to win a map game, and winning a deck-to-deck battle does not necessarily mean winning a map game. On the other hand, since the map game is played for each map M, it can be said that the victory or defeat is determined in the map M unit or the military unit.

[3-2-2. Effect generation part]
The effect generation unit 350 in the second technique has the same contents as described in the first technique, but some processes are different from those in the first technique. For example, the meanings of "specific base", "route", and "disadvantageous effect" are the same as those described in the first technique. Hereinafter, processing different from that of the effect generation unit 350 in the first technique will be described. The effect generation unit 350 exerts a disadvantageous effect on the deck based on the "suppression status" of the map status table TBL104 of the other points associated with the point where the deck (friendly deck, enemy deck) exists. generate.

"Other associated points" are other points associated with one point. For example, the points stored in the "adjacent points" of the map status table TBL104 correspond to "other associated points". In the present embodiment, the points connected by the road correspond to "other associated points". In other words, it can be said that a point that can be reached from a certain point with the minimum energy consumption point corresponds to "another associated point".

For example, the effect generation unit 350 generates a disadvantageous effect when the suppression situation at another point is a predetermined situation. The predetermined situation may be a predetermined situation, for example, the number or ratio controlled by the ally army is above the standard, or the number or ratio controlled by the enemy army is above the standard. Is. In the present embodiment, the state surrounding the home base corresponds to a predetermined situation. That is, the effect generation unit 350 is based on the "suppression status" of the map status table TBL104 of other points associated with the base point on the deck (friendly deck, enemy deck) existing at the home base point. It will cause a disadvantageous effect on the game. As in the first technique, when the suppression situation at another point is no longer a predetermined situation, the occurrence of the disadvantageous effect may be canceled. The meaning of "eliminating the occurrence of a disadvantageous effect" is the same as that described in the first technique.

In the second technique, the first effect generation unit 351 is placed on the friendly deck in the game based on the number of points associated with the enemy army among other points associated with the point where the friendly deck exists. Causes the unfavorable effect of. For example, the first effect generation unit 351 may generate an effect when the number or ratio of points associated with the enemy army exceeds the standard, or is associated with a point where an ally deck exists. The effect may be generated when all other points are associated with the enemy army.

In addition, for example, the first effect generation unit 351 may generate an effect that becomes more disadvantageous as the number or ratio of points associated with the enemy army increases. In this case, as the number and ratio of points associated with the enemy army increase, the first effect generation unit 351 reduces the ability of the ally deck at the point P22, which is the home of the ally army, or reduces the ability of the enemy deck. To improve. In addition, for example, the first effect generation unit 351 reduces the HP of the ally deck at the point P22, which is the base of the ally army, as the number and ratio of the points associated with the enemy army increase, or the HP of the enemy deck HP may be increased.

The second effect generation unit 352 has a disadvantageous effect on the game based on the number of points associated with the ally army among other points associated with the point where the enemy deck exists. generate. For example, the second effect generation unit 352 may generate an effect when the number or ratio of points associated with the ally army exceeds the standard, or may be associated with a point where an enemy deck exists. You may also want the effect to occur when all other points are associated with a friendly army.

Alternatively, for example, the second effect generation unit 352 may generate an effect that becomes more disadvantageous as the number or ratio of points associated with the ally army increases. In this case, the second effect generation unit 352 reduces the ability of the enemy deck at the point P9, which is the base of the enemy army, or reduces the ability of the ally deck as the number and ratio of the points associated with the ally army increase. To improve. In addition, for example, the second effect generation unit 352 reduces the HP of the enemy deck at the point P9, which is the base of the enemy army, as the number and ratio of the points associated with the ally army increase, or the HP of the ally deck. HP may be increased.

[3-3. Functions related to the third technology]
The third technique is mainly realized by an information acquisition unit 310, an action control unit 370, a cumulative information acquisition unit 380, a parameter change unit 390, an achievement determination unit 400, and an enemy deck generation unit 410. The information acquisition unit 310 of the third technique may be the same as the first technique, but acquires the association stored by the data storage unit 300 that stores the association between the user ID and the ally deck. In the present embodiment, since the friendly army information table TBL102 corresponds to the association, the information acquisition unit 310 will acquire the friendly army information table TBL102.

[3-3-1. Behavior Control Department]
The action control unit 370 acts on the ally deck associated with the user ID by changing the game parameters (energy points, battle points) associated with the user ID based on the operation of the user identified by the user ID. Let me. "Changing the game parameters" means increasing or decreasing the game parameters.

A friendly deck may allow you to perform multiple types of actions. In this case, it is assumed that the data storage unit 300 stores in advance data indicating the relationship between the behavior of the ally deck and the amount of change in the game parameters. The type and amount of change of game parameters may differ depending on the type of action. For example, actions include moving and attacking friendly decks. In the present embodiment, the action control unit 370 moves the ally deck in exchange for the energy point associated with the user ID, and makes the ally deck play in exchange for the battle point associated with the user ID.

For example, the behavior control unit 370 determines whether or not the energy points associated with the user ID remain in excess of the required amount for moving the ally deck. When the action control unit 370 determines that it remains, it moves the ally deck by reducing the energy points by the required amount, and when it determines that it does not remain, it does not move the ally deck. Similarly, the action control unit 370 determines whether or not the battle points associated with the user ID remain in excess of the required amount for competing with the ally deck. If it is determined that the action control unit 370 is left, the battle points are reduced by the required amount to play against the ally deck, and if it is determined that there is no remaining, the ally deck is not played.

In this embodiment, a case where different types of parameters change depending on the type of action of the ally deck will be described, but only one parameter common to a plurality of types of actions may be prepared.

[3-3-2. Cumulative information acquisition department]
The cumulative information acquisition unit 380 acquires cumulative information based on the amount of change in the game parameters (energy points, battle points) changed by the action control unit 370. The "cumulative information" may be a total value of an increase amount or a decrease amount of a game parameter, or may be a value obtained by substituting the increase amount or the decrease amount into a predetermined mathematical formula. That is, it may be a mere cumulative total or a weighted cumulative total. Further, it may be a simple cumulative total or a weighted cumulative total multiplied by a coefficient. Hereafter, the cumulative information is called the enemy generation point.

In the present embodiment, the cumulative information acquisition unit 380 calculates the enemy generation point from the random value generated by the random number. For example, the cumulative information acquisition unit 380 is (“total value of energy points consumed by each user” + “total value of battle points consumed by each user” * 15) * random value (for example, 1 to 1.5). Is calculated as the enemy generation point. The calculation method of the enemy generation point is not limited to this. Even when a random value is used, the enemy generation point may be calculated using the random value as a coefficient. Enemy generation points may be calculated by substituting the amount of change in energy points and battle points into a given formula.

[3-3-3. Parameter change part]
The parameter change unit 390 changes the energy parameter and the battle parameter based on the passage of time. For example, the parameter change unit 390 recovers the energy parameter and the battle parameter as time passes. Further, for example, the parameter change unit 390 recovers the energy parameter and the battle parameter every time a certain time elapses. This fixed time may be different depending on the type of the parameter, or may be common to each parameter. Further, the recovery amount of the parameter may be different depending on the type of the parameter, or may be the same regardless of the type of the parameter.

[3-3-4. Achievement judgment unit]
The achievement determination unit 400 determines whether or not a given game task has been achieved based on the actions of the ally deck. The "game task" is a task set in the game. The achievement conditions of the game task are predetermined, and if the achievement conditions are satisfied, the game task is achieved and the game is cleared. The achievement determination unit 400 determines whether or not the game task has been achieved by comparing the data indicating the status of the running game (in this embodiment, the map status table TBL104) with the achievement conditions.

In this embodiment, it corresponds to the game task that the ally army controls the point P9 which is the base of the enemy. That is, satisfying the conditions for winning in a map game corresponds to a game task. Therefore, the achievement determination unit 400 will determine whether or not the ally army has suppressed the point P9 with reference to the map status table TBL104. The condition for achieving the game task is not limited to the suppression of the home base, and may be to obtain a large number of scores or to win in more battles.

[3-3-5. Enemy deck generator]
The enemy deck generation unit 410 generates an enemy deck as an opponent of the user based on the enemy generation point. In the present embodiment, the enemy deck generation unit 410 generates an enemy deck based on the enemy generation points between the start of the game and the achievement of the game task.

Further, in the present embodiment, since the enemy generation points are common to each user, information based on the amount of change of each of the plurality of game parameters (energy points, battle points) associated with the plurality of user IDs. It can be said that. The enemy deck generation unit 410 will generate an enemy deck as an opponent of a plurality of users identified by each of the plurality of user IDs.

For example, the enemy deck generation unit 410 includes the determination unit 411. The determination unit 411 determines whether or not the enemy generation point is equal to or higher than the reference point. The enemy deck generation unit 410 determines whether or not the enemy generation point is equal to or greater than the threshold value. The threshold value may be a predetermined fixed value or a variable value. If it is a variable value, it may be changed according to the situation of the running game. The enemy deck generation unit 410 generates an enemy deck when it is determined that the enemy generation point is equal to or higher than the standard.

The enemy deck generator 410 may generate any number of enemy decks at any point. For example, the enemy deck generator 410 may generate an enemy deck at any of the points controlled by the enemy army, or the point closest to the base of the ally army among the points controlled by the enemy army. Enemy decks may be spawned at adjacent points. Further, the enemy deck generation unit 410 may generate an enemy deck at one point, or may generate an enemy deck at a plurality of points. Further, the enemy deck generation unit 410 may generate one enemy deck or may generate a plurality of enemy decks. The number of enemy decks generated may be randomly determined, or may be determined according to the level of the map M or the like.

[3-4. Functions realized in terminals]
Next, the functions realized in the terminal 10 will be described. As shown in FIG. 19, the terminal 10 includes an operation reception unit 100 and a display control unit 110. These are mainly realized by the control unit 11.

[3-4-1. Operation reception section]
The operation reception unit 100 is mainly realized by the control unit 11. The operation reception unit 100 receives various inputs from the input unit 14. For example, the operation receiving unit 100 accepts an operation for selecting a point, an operation for selecting a processing object OB20, and the like.

[3-4-2. Display control unit]
The display control unit 110 causes the display unit 15 to display various images. For example, the display control unit 110 causes the display unit 15 to display various images based on the data received from the server 30. In the present embodiment, the display control unit 110 causes the game image G10 to display the detailed information image G20, the battle preparation image G30, the battle image G40, and the battle result image G50 on the display unit 15.

[4. Processing executed in game system 1]
24 to 31 are flow charts showing an example of processing executed in the game system 1. The processes shown in FIGS. 24 to 31 are executed by the control unit 11 operating according to the program stored in the storage unit 12, and the control unit 31 operating according to the program stored in the storage unit 32. In the embodiment, the functional block shown in FIG. 19 is realized by executing the process described below.

As shown in FIG. 24, in the terminal 10, the control unit 11 transmits a display request for the game image G10 to the server 30 (S101). The display request may be made by data in a predetermined format including information for identifying the image to be displayed. When data is transmitted from the terminal 10 to the server 30, the user ID, the IP address of the terminal 10, and the like are also transmitted, and the server 30 can specify from which terminal 10 the data was received. It has become.

Upon receiving the display request in the server 30, the control unit 31 generates and transmits the display data of the game image G10 based on the tables (FIGS. 20 to 23) stored in the storage unit 32 (S301). ). The display data may be in a predetermined format that can be read by the terminal 10, and may be in a predetermined format such as HTML. The display data includes image data of each image included in the game image G10. This point is the same for the display data in the following description. Further, the point that the tables of FIGS. 20 to 23 are referred to when the display data is generated is the same in the following description. The contents of the map status table TBL104 may be transmitted together with the display data of the game image G10.

Upon receiving the display data in the terminal 10, the control unit 11 causes the display unit 15 to display the game image G10 (FIG. 3) (S103). The control unit 11 identifies the user's operation based on the signal from the input unit 14 (S105). Here, it is assumed that either the scroll operation of the map display area A10 or the operation of selecting the point displayed in the map display area A10 can be performed.

When the user performs a scroll operation (S105; scroll operation), the control unit 11 changes the range displayed in the map display area A10 according to the scroll operation (S107). A known process may be executed for the scroll control itself, but for example, it is assumed that the display range information indicating the range displayed in the map display area A10 of the map M is stored in the storage unit 12. In S107, the control unit 11 changes the range displayed in the map display area A10 by changing the display range information according to the scroll operation.

On the other hand, when the user selects any point (S107; point selection operation), the control unit 11 transmits a display request for the detailed information image G20 corresponding to the point selected by the user to the server 30 (S109). In S109, the control unit 11 shall transmit information (for example, coordinate information) for identifying a point selected by the user together with the display request.

When the server 30 receives the display request, the control unit 31 determines the ally deck (that is, the ally deck associated with the user ID received together with the display request) based on the ally information table TBL102. The same applies.) It is determined whether or not the point where the presence is located is selected (S303). In S303, the control unit 31 compares the point where the user's deck stored in the friendly army information table TBL102 is located with the point selected by the user.

When the user selects a point where his / her ally deck is not present (S303; N), the control unit 31 refers to the suppression status of the point selected by the user based on the map status table TBL104 (S305). When the ally army controls the point selected by the user (S305; ally army), the control unit 31 generates and transmits the display data of the detailed information image G20 (FIG. 4) including the processing objects OB20 and OB21. (S307).

Moving on to FIG. 25, when the terminal 10 receives the display data, the control unit 11 causes the display unit 15 to display the detailed information image G20 (S111). The control unit 11 identifies the user's operation based on the signal from the input unit 14 (S113). Here, it is assumed that the operation of selecting any of the processing objects OB20 and 21 of the map display area A10 can be performed.

When the user selects the processing object OB20 (S113; OB20), the control unit 11 transmits a movement request for the ally deck (S115). This move request can be said to be a request for moving one's ally deck to a point selected by the user. The control unit 11 shall transmit information (for example, coordinate information) for identifying the destination point together with the movement request.

Upon receiving the movement request in the server 30, the control unit 31 determines the required amount of energy points for movement based on the movement request (S309). In S309, the control unit 31 sets 2pt if the point where the ally deck is located and the point to move to are connected by a road, and 10pt if they are not connected. It is assumed that the association between the destination point and the required amount of energy points is stored in the storage unit 32. This association may be in mathematical form or in table form.

The control unit 31 refers to the user information table TBL101 and determines whether or not the current value of the energy point of the user is equal to or greater than the required amount determined in S309 (S311). When it is determined that the amount is not more than the required amount (S311; N), the control unit 31 transmits a predetermined error message to the terminal 10 (S313), and returns to the process of S301. In this case, the user's energy points are insufficient, so the movement of the ally deck will not be executed.

On the other hand, when it is determined that the amount is equal to or greater than the required amount (S311; N), the control unit 31 refers to the map status table TBL104 and moves the ally deck (S315). In S315, the control unit 31 updates the "point" of the ally deck of the user who requested the movement in the map status table TBL104 to the point selected by the user in S315. The control unit 31 refers to the user information table TBL101, reduces the energy points of the user by a required amount (S317), shifts to the process of S351 described later, and based on the decrease amount of the energy points in S317, the enemy generation points. Calculation is performed. When the energy points are reduced, the control unit 31 may record the reduced amount as a history in the storage unit 32.

When the user selects the processing object OB21 in S113 (S113; OB21), the process returns to the processing of S101. In this case, the game image G10 based on the latest map status table TBL104 is displayed on the display unit 15.

On the other hand, in S305 of FIG. 24, when the enemy army is controlling the point selected by the user (S305; enemy army), the process proceeds to FIG. 26, and the control unit 31 is connected by a road based on the map status table TBL104. It is determined whether the friendly army is controlling the point (S319). When the ally army is controlling the points connected by the road R (S319; Y), the control unit 31 generates and transmits the display data of the detailed information image G20 (FIG. 5) including the processing objects OB21 and OB22. (S321).

Upon receiving the display data in the terminal 10, the control unit 11 causes the display unit 15 to display the detailed information image G20 (S117). The control unit 11 identifies the user's operation based on the signal from the input unit 14 (S119). Here, it is assumed that the operation of selecting one of the processing objects OB21, 22 of the map display area A10 can be performed. As shown in FIG. 26, subsequent S121 and S323 to S331 are the same as S115 and S309 to S317, respectively.

On the other hand, in S319 of FIG. 26, when the ally army does not control the point connected by the road (S; Y), the process proceeds to FIG. 27, and the control unit 31 moves to the detailed information image G20 (FIG. 12) including the processing object OB21. ) Is generated and transmitted (S333).

Upon receiving the display data in the terminal 10, the control unit 11 causes the display unit 15 to display the detailed information image G20 (S123). The control unit 11 determines whether or not the processing object OB21 is selected based on the signal from the input unit 14 (S125). When it is determined that the processing object OB21 is selected (S125; Y), the process returns to the processing of S101.

On the other hand, in S303 of FIG. 24, when the user selects a point where his / her ally deck is located (S303; Y), the process proceeds to FIG. 28, and the control unit 31 refers to the enemy army information table TBL103 and selects the user. It is determined whether or not there is an enemy deck at the point (S335). When it is determined that the enemy deck is at the point selected by the user (S335; Y), the control unit 31 generates and transmits the display data of the detailed information image G20 (FIG. 7) including the processing objects OB21 and OB23. (S337).

Upon receiving the display data in the terminal 10, the control unit 11 causes the display unit 15 to display the detailed information image G20 (S127). The control unit 11 identifies the user's operation based on the signal from the input unit 14 (S129). Here, it is assumed that the operation of selecting any of the processing objects OB21, 23 can be performed. When the user selects the processing object OB21 (S129; OB21), the process returns to the processing of S101. In this case, no match is executed.

On the other hand, when the user selects the processing object OB23 (S129; OB23), the control unit 11 transmits a match execution request (S131). This match execution request can be said to be a request for starting a match between the user's deck and the enemy deck at the same point. Although the processing is omitted here, the display data of the battle preparation image G30 may be transmitted from the server 30 to the terminal 10, and then the terminal 10 may accept the selection of the processing object OB30.

When the server 30 receives the battle execution request, the control unit 31 acquires the required amount of battle points for executing the battle based on the battle execution request (S339). It is assumed that the required amount of battle points is stored in the storage unit 32 in advance. Here, it is set to 1 pt, but the required amount may differ depending on whether the ally army or the enemy army is controlling the point where the battle is held.

The control unit 31 refers to the user information table TBL101 and determines whether or not the current value of the user's battle point is equal to or greater than the required amount acquired in S339 (S341). When it is determined that the amount is not more than the required amount (S341; N), the control unit 31 transmits a predetermined error message to the terminal 10 (S343). In this case, since the user's battle points are insufficient, the battle of the ally deck will not be executed. On the other hand, when it is determined that the amount is equal to or greater than the required amount (S341; N), the process proceeds to FIG. 29, and the control unit 31 executes a battle process between the ally deck and the enemy deck (S345).

FIG. 30 is a diagram showing details of the battle process executed in S345. As shown in FIG. 30, the control unit 31 refers to the map status table TBL104 and determines whether the point where the battle is performed is the home of the friendly army or the enemy army (S3451). When it is determined that it is not the home base (S3451; N), the control unit 31 refers to the suppression status of the point where the battle is performed (S3453). When the enemy army is controlling the point where the battle is held (S3453; enemy army), the control unit 31 is controlled by the enemy army from the point P9 which is the base of the enemy army to the point where the battle is held. It is determined whether or not it is possible to move only through the point (S3455). The determination method in S3455 is as described above. That is, the control unit 31 refers to the map status table TBL104, identifies a point on each route from the point P9, which is the base of the enemy army, to the point where the battle is held, and refers to the suppression status of the specified point. Will be done.

If it cannot move (S3455; N), the control unit 31 reduces the ability of the enemy deck (S3457). In S3457, the control unit 31 reduces the attack power and defense power of the opponent deck by a predetermined value. The amount of decrease in the ability of the enemy deck may be a fixed value or a variable value. On the other hand, if it can be moved (S3455; Y), the process of S3457 is not executed. In this case, the enemy deck will not be at a disadvantage.

On the other hand, in S3453, when the ally army controls the point where the battle is performed (S3453; ally army), the control unit 31 is the ally army from the point P22 which is the base of the ally army to the point where the battle is performed. It is determined whether or not it is possible to move only through the point where is suppressed (S3459).

If it cannot move (S3459; N), the control unit 31 reduces the ability of the ally deck (S3461). In S3461, the control unit 31 reduces the attack power and defense power of the ally deck by a predetermined value. The amount of decrease in the ability of the ally deck may be a fixed value or a variable value. On the other hand, if it can be moved (S3459; N), the process of S3461 is not executed. In this case, the friendly deck will not be at a disadvantage.

On the other hand, in S3451, when it is the home of the enemy army (S3451; the home of the enemy), it shifts to FIG. 31, and the control unit 31 refers to the suppression status of the point connected to the home of the enemy army by the road (S3463). In S3463, the control unit 31 refers to the map status table TBL104 and refers to the suppression status of the points P5, P8, P10, and P14.

When the ally army controls all points connected to the enemy army's home by a road (S3463; all ally's army), the control unit 31 reduces the ability of the enemy deck at the base (S3465). The processing of S3465 is the same as that of S3457. The amount of decrease in capacity may be the same as or different from S3457. On the other hand, if there is something controlled by the enemy army at the point connected to the base of the enemy army by the road R (S3463; enemy army), the processing of S3465 is not executed. In this case, the enemy deck will not be at a disadvantage.

On the other hand, in S3451 of FIG. 30, when it is the home of the ally army (S3451; the home of the ally), it moves to FIG. 31, and the control unit 31 refers to the suppression status of the point connected to the home of the ally army by the road (S3467). ). In S3467, the control unit 31 refers to the map status table TBL104 and refers to the suppression status of the points P16, P23, and P27.

When the enemy army controls all points connected to the base of the ally army by a road (S3467; all enemy forces), the control unit 31 reduces the ability of the ally deck in the base (S3469). The processing of S3469 is the same as that of S3461. The amount of decrease in capacity may be the same as or different from that of S3461. On the other hand, if there is something controlled by the ally army at the point connected to the base of the ally army by the road (S3467; ally army), the processing of S3469 is not executed.

The control unit 31 starts a battle based on the ally deck and the enemy deck, and determines the battle result (S3471). In S3471, when the ability is reduced in any of S3457, S3461, S3465, and S3469, the control unit 31 executes a battle based on the reduced ability. The battle processing itself is as described above. For example, the control unit 31 executes a battle based on the parameters of the ally deck and the parameters of the enemy deck until one of them is completely destroyed. In S3471, the control unit 31 will change the army that controls the point where the battle was held, based on the battle result.

The control unit 31 refers to the user information table TBL101 and reduces the user's battle points by a required amount (S3473). In S3473, the control unit 31 reduces the user's battle points by the required amount acquired in S339. Although the battle points are reduced at the end of the battle process here, the battle points may be reduced at the beginning of the battle process or before the execution. Further, as in the case of the decrease in energy points in S317 and S331, the control unit 31 may record the amount of decrease in battle points in S3473 in the storage unit 32 as a history.

Returning to FIG. 29, the control unit 31 refers to the battle result determined in S3471 and determines whether or not the home base has been suppressed (S347). When it is not determined that the home base has been suppressed (S347; N), the control unit 31 generates display data of the battle result image G50 (FIG. 10) and transmits it to the terminal 10 (S349).

Upon receiving the display data in the terminal 10, the control unit 11 causes the display unit 15 to display the battle result image G50 (S135). The control unit 11 determines whether or not the processing object OB50 is selected based on the signal from the input unit 14 (S137). When it is determined that the processing object OB50 is selected (S137; Y), the process returns to the processing of S101.

On the other hand, in the server 30, the control unit 31 refers to the friendly army information table TBL102 and calculates the enemy generation point which is the total value of each user belonging to the team (S351). As described above, since the history of energy points and battle points consumed by each user is recorded in the storage unit 32, the control unit 31 includes energy points and battle points consumed by each member of the team in the past. , S317, S331, and S3473, the energy points or battle points consumed in S317 are substituted into a given formula to calculate the enemy generation points.

The control unit 31 determines whether or not the enemy generation point is equal to or higher than the threshold value (S353). The threshold value may be stored in the storage unit 32 in advance. The threshold value of the enemy generation point may be a fixed value or a variable value. If it is a variable value, it may be calculated according to the level of the map M or the number of points or roads. For example, the higher the level of the map M, the higher the threshold value may be set, or the larger the number of points or roads, the higher the threshold value may be set. Further, the threshold value may be set according to the number of users participating in the game, the number of users belonging to the team, and the like. In this case, the threshold value may be set higher as the number of users participating in the game or the number of users belonging to the team increases.

When it is determined that the enemy generation point is equal to or higher than the threshold value (S353; Y), the control unit 31 refers to the enemy army information table TBL103, generates an enemy deck in the map M (S355), and generates the enemy generation point. Return to 0 (S357). In S355, the control unit 31 determines the number and position of occurrence of enemy decks. The number of occurrences may be randomly determined, or may be calculated according to the level of the map M or the number of points or roads. The position of occurrence may be the point closest to the point P22, which is the base of the ally army, among the points controlled by the enemy army, or it is connected to the point controlled by the enemy army by a road. It may be generated at a point that is neutral or controlled by a friendly army.

On the other hand, in S347, when it is determined that the home base has been suppressed (S347; Y), this process ends. If the ally army controls the point P9, which is the home of the enemy army, the user wins, and if the enemy army controls the point P22, which is the home of the ally army, the user loses.

Although the explanation is omitted in the above processing flow, in S355, when the enemy deck is generated at the point controlled by the ally army, the control unit 31 remembers the time when the enemy deck is generated. It is recorded in the unit 32, and it is determined whether or not the ally deck has won the enemy deck within a certain period (for example, 10 minutes) from that point. The battle processing in this case may be the same as in S345. If the ally deck wins the enemy deck within a certain period of time, the control unit 31 deletes the data corresponding to the enemy deck from the enemy army information table TBL103. On the other hand, if the ally deck cannot defeat the enemy deck within a certain period of time, the control unit 31 updates the map status table TBL104 assuming that the enemy army has suppressed the point where the enemy deck occurred. After that, the process of S347 may be executed to determine whether or not the home base has been suppressed.

[Summary of the first technology]
According to the first technique of the game system 1 described above, the ally deck or the enemy deck can be determined based on the suppression situation of the point on the route connecting the point where the ally deck or the enemy deck exists and the specific point. Since it is disadvantageous, each user is aware of the suppression situation of the point on the route as well as the position where the ally deck and the enemy deck exist so that they are not disadvantaged or the enemy is disadvantaged. Therefore, the strategic nature of the game can be enhanced. Also, for example, even if there is a user with a weak ally deck among multiple users, the enemy is disadvantaged by the association information of the points on the route, so that the user does not rely only on the strength of the ally deck, but the game. It becomes possible to think strategically, and even weak users can play an active role.

In addition, by changing the suppression status of a certain point based on the result of the battle executed at each of multiple points, the result of the battle at that point is affected against the change of the suppression status of a certain point. Because it can be made to, the strategy of the game can be further enhanced.

Also, since the friendly decks and enemy decks that can participate in the battle executed at each point are specified based on the points where each friendly deck and enemy deck are located, consider how to arrange the battle. Because it can be made to, the strategy of the game can be further enhanced.

In addition, since each point is associated with the person who won the match, it is possible to give motivation to win the match related to each point. In addition, since the condition for associating each point is the victory of the match, it becomes easier for the user to understand the condition for associating each point.

Also, if there is no route that passes only the point controlled by the ally army between the point where the ally deck operated by the user is located and the specific point such as the home of the ally army, the ally deck is disadvantageous. By generating the above effect, for example, it is possible to express in the game a situation in which it is disadvantageous because the supply to the ally deck is cut off. Similarly, if there is no route between the point where the enemy deck is and a specific point such as the base of the enemy army, which passes only the point controlled by the enemy army, the effect that the enemy deck is disadvantageous is By generating it, for example, it is possible to express in the game a situation where it is disadvantageous because the supply to the enemy deck is cut off.

In addition, by changing the parameters of the ally deck and the enemy deck, for example, it is possible to express that it is disadvantageous because the supply to the ally deck and the enemy deck is cut off.

Also, once the isolated state is resolved, it will not be a disadvantage, so users will play the game to eliminate the situation where they are disadvantaged as soon as possible, or the game so that the opponent will continue the situation where it is disadvantaged as much as possible. You can improve the strategy of the game by playing.

[Summary of the second technology]
According to the second technique of the game system 1 described above, the ally deck and the enemy deck are disadvantaged based on the suppression situation of the other points associated with the point where the ally deck and the enemy deck exist. Each user is aware of the suppression situation of other points as well as the point where the ally deck and the enemy deck exist so that they are not disadvantaged or the enemy is disadvantaged, so the strategy of the game It can enhance the sex. Also, for example, even if there is a user with a weak ally deck or enemy deck among multiple users, the enemy is disadvantaged due to the suppression situation of other points associated with the point where the opponent's ally deck or enemy deck exists. Therefore, the user can think strategically about the game without relying only on the strength of the ally deck, and even a weak user can play an active role.

Also, depending on the suppression status of points adjacent to a specific point, ally decks and enemy decks that exist at a specific point may be disadvantaged, so each point can have a change in importance, so the game It is possible to enhance the strategic nature.

In addition, the strategic nature of the game can be further enhanced by making people aware of not only the specific points that determine the outcome of the game but also other points associated with the specific points. Furthermore, for example, even if there are users with weak ally decks among multiple users, they can play an active role by putting the enemy at a disadvantage, so weak users can play an active role even in important situations that affect the outcome of the game. can.

In addition, since the suppression status of a certain point is changed based on the result of the battle executed at each of multiple points, changing the suppression status of a certain point affects the result of the battle at that point. Therefore, the strategy of the game can be further enhanced.

In addition, since each point is associated with the person who won the match, it is possible to give motivation to win the match related to each point. In addition, since the condition for associating each point is the victory of the match, it becomes easier for the user to understand the condition for associating each point.

Further, since a disadvantageous effect occurs based on the number of points associated with the user side or the opponent side, it is possible to execute a process such as making it disadvantageous as the number of the points concerned increases. In this way, it is possible to express a situation in which the more isolated the game object is, the more disadvantageous it is.

Also, by changing the parameters of the ally deck and the enemy deck, for example, it is possible to express that it is disadvantageous because the ally deck and the enemy deck are isolated.

[Summary of Third Technology]
According to the third technique of the game system 1 described above, the enemy deck is generated based on the energy points and the enemy generation points calculated from the energy points and battle points that change depending on the actions of the ally deck and the enemy deck, so that the ally deck acts. It is possible to prevent the generation of enemy decks when the energy points and battle points have not changed, so it is possible to maintain the game balance when generating enemy decks. That is, if the enemy decks are generated one after another even though the ally decks are not acting, the enemy decks generated in large numbers may cause the ally decks to be killed without any help. Since the enemy generation points are acquired based on the actions of the ally decks, it is possible to generate enemy decks according to the amount of activity and activity time of the user, and the game balance can be maintained.

Further, even if the user needs to play intermittently for a long period from the start of the game to the achievement of the game task, the enemy deck can be generated at an appropriate timing.

In addition, common enemy generation points can be prepared for multiple users, and the actions of each ally deck can affect the common enemy generation points to generate enemy decks, which affects the gameplay between users. Can be made easier to give. As a result, it is possible to provide a more varied game. Further, even in the game play by a plurality of users, since the enemy generation points based on the amount of change changed by the actions of the plurality of ally decks are used, the enemy decks can be generated more appropriately.

Also, in a game in which multiple users belonging to a team and an opponent play against each other, users belonging to the same team can generate enemy decks based on enemy generation points and influence each other's gameplay. Can give you a chance to communicate more. In addition, since users who know each other can participate in the game, it is possible to proceed with the game while discussing strategies in advance.

Further, if it is determined that the enemy generation point exceeds the standard, the enemy deck is generated, the standard for generating the enemy deck can be set in advance, and it becomes easy to maintain the game balance.

Also, by changing the energy points and battle points based on the passage of time, the strategic nature of the game can be enhanced. For example, if the energy points and battle points are changed based on the passage of time, the period from the start of the game to the achievement of the game task tends to be relatively long, so even in such a case, it is appropriate. You can generate an enemy deck at any time.

[5. Modification example]
The present invention is not limited to the embodiments described above. It can be changed as appropriate without departing from the spirit of the present invention.

[5-1. Modification example regarding the first technique]
For example, in the embodiment, a game of a plurality of users belonging to a team vs. a computer is given as an example, but a game of a plurality of users vs. a plurality of users may be used. Further, the plurality of users do not have to belong to the same team, and may participate in the game of the same map M. Therefore, each time the game is executed, the users participating in the game may be matched with each other.

Also, for example, in order to execute a battle with an enemy deck, we explained the case of moving an ally deck to the point where the enemy deck is, but it may be possible to attack from the point where the enemy deck is connected by a road. It may be possible to make a long-range attack from two or more points apart. In this case, the attackable range may be different for each ally deck or enemy deck.

Also, for example, a plurality of friendly decks or enemy decks may be arranged at one point. If there are multiple enemy decks at a point controlled by an enemy army, and if you win all of these multiple enemy decks, your teammates can control that point. Similarly, if there are multiple friendly decks at a point controlled by a friendly army, and if all of these multiple friendly decks are defeated, that point is controlled by the enemy army.

Also, for example, the victory condition for a match does not have to be to control the home base. For example, the winner may be the one who gets more scores in a match or the like within a predetermined time.

Further, for example, a state in which the route connecting the ally deck and the point P22, which is the base of the ally army, cannot be reached without passing through the point controlled by the enemy army may correspond to the isolated state of the ally deck. That is, the state in which the enemy deck cannot go to the route connecting the enemy deck and the point P9, which is the base of the enemy army, without passing through the point controlled by the ally may correspond to the isolated state of the enemy deck.

Further, for example, as a disadvantageous effect generated by the effect generating unit 350, the actions of the ally deck and the enemy deck may be restricted. For example, the effect generation unit 350 restricts a friendly deck or an enemy deck from performing a predetermined action (movement, battle, etc.). For example, the effect generation unit 350 may limit the number of battles that can be played in a predetermined period. In addition, for example, the action restriction may restrict the action by increasing the parameters consumed when the ally deck or the enemy deck acts.

[5-2. Modification example regarding the second technique]
Further, for example, in the second technique, the first effect generation unit 351 is controlled by the ally army among the points P5, P8, P10, and P14 connected by the road to the point P9 which is the base of the enemy army. You may want to have a negative effect on your enemy deck based on the ratio of the number you have to the number you have overwhelmed by the enemy army. Similarly, the second effect generation unit 352 is controlled by the number of points P16, point P23, and point P27 connected by a road to the point P22, which is the base of the ally army, and the number controlled by the ally army and the enemy army. You may want to have a negative effect on your deck based on the ratio to the number you have.

Also, the specific point is not limited to the home of the ally or enemy army. For example, if there are points where the score can be obtained by moving the ally deck or the parameters of the ally deck are restored, these points may correspond to specific points.

[5-3. Modification example regarding the third technique]
FIG. 32 is a functional block diagram of a modification of the third technique. As shown in FIG. 32, in this modification, the server 30 includes the cumulative information notification unit 420. The cumulative information notification unit 420 is mainly realized by the control unit 31.

(3-1) For example, the cumulative information notification unit 420 notifies the user of the enemy generation points acquired by the cumulative information acquisition unit 380. The cumulative information notification unit 420 displays an image showing the numerical value of the enemy generation point, or displays an image showing the magnitude of the enemy generation point. The image showing the magnitude of the enemy generation point may be an image that becomes larger as the enemy generation point is higher, or an image that becomes brighter as the enemy generation point is higher. Alternatively, the data storage unit 300 may store the association between the size of the enemy generation point and the color of the image, and notify the enemy generation point by the color of the image. The cumulative information notification unit 420 may notify the enemy generation point with an arbitrary image, for example, the enemy generation point may be notified in the game image G10 or the detailed information image G20.

According to the modification (3-1), by notifying the user of the enemy generation point that is the condition for the enemy deck to occur, for example, while thinking about how much more the ally deck should be acted to generate the enemy deck. Since the game can be played, a more strategic game can be provided.

(3-2) Further, for example, in the embodiment, the enemy deck is generated when the enemy generation point becomes equal to or higher than the threshold value, but the enemy deck generation unit 410 is finally the enemy regardless of the enemy generation point. When a predetermined time has passed since the deck was generated, a new enemy deck may be generated.

Further, for example, when the enemy generation point becomes equal to or higher than the threshold value and an enemy deck is generated, the enemy deck generation unit 410 may not generate a new enemy deck for a certain period of time. In this case, even if the enemy generation point becomes equal to or higher than the threshold value again within a certain period of time, the enemy deck generation unit 410 does not generate the enemy deck, but generates it after a certain period of time.

Further, for example, in the embodiment, the case where a common enemy generation point exists for a plurality of users has been described, but an enemy generation point may be prepared for each user. In this case, the enemy generation point of a user changes depending on the action of the user's ally deck. The enemy deck generation unit 410 may generate a new enemy deck when the enemy generation point of any user becomes equal to or higher than the threshold value.

[5-4. Other variants]
Further, for example, as shown in FIG. 2, the case where the points are arranged in a grid pattern has been described, but the arrangement may be other than the grid pattern. Each point may be arranged at an arbitrary position on a two-dimensional plane or in a three-dimensional space. For example, as shown in FIG. 2, the X-coordinates and Y-coordinates of each point may not be aligned, and the X-coordinates and Y-coordinates of each point may be different. Similarly, the road connecting the points does not have to be a straight line, and may be a curved road.

Further, for example, the energy points consumed when the ally deck moves may be changed depending on the suppression status of the destination point. For example, if a friendly deck moves to a point controlled by an enemy army, it consumes more than if the friendly deck moves to a point controlled by an enemy army or a friendly deck moves to a neutral point. You may reduce the energy points.

Further, for example, in the embodiment, the case where the enemy deck does not move has been described, but the enemy deck may move under predetermined conditions. Further, for example, the point may have a point for reducing the consumption of energy points and a point for giving a larger score. These points may correspond to the specific points described in the embodiments.

Further, for example, in the game system 1, the case where the main function is realized by the server 30 has been described, but it may be realized by the terminal 10. In this case, the terminal 10 corresponds to the game control device, the data storage unit 300 is mainly realized by the storage unit 12, and the other functions are mainly realized by the control unit 11. Further, in this case, each terminal 10 may send and receive data by P2P without the server 30 existing. Further, each function described above may be shared between the terminal 10 and the server 30.

For example, when the data storage unit 300 is realized by the server 30 and each of the other functions is realized by the terminal 10, each data such as an enemy generation point acquired by the terminal 10 is transmitted to the server 30, and the data is transmitted to the server. It will be stored in the data storage unit 300 of 30. Further, for example, when the data storage unit 300 is realized by the terminal 10, the data stored in the data storage unit 300 is transmitted and received between the terminals 10 to ensure consistency.

Also, for example, the example in which a battle is executed based on a deck consisting of game cards has been given, but this is a game system for executing a game in which a battle is executed based on various game objects such as game items and game characters. The invention can be applied.

[6. Summary of invention]
From the above description, the present invention can be grasped as follows, for example. In addition, in order to facilitate understanding of the present invention, the reference numerals described in the drawings are appropriately described in parentheses, but the present invention is not limited to the illustrated embodiment.

[6-1. Invention according to the first technique]
1-1) In the game system (1) according to one aspect of the present invention, at least one of a plurality of first objects operated by each of the plurality of users and one or a plurality of second objects that are opponents is used. , A game system (1) that executes a game that can be moved between each of a plurality of points and another point associated with the point, and each of the plurality of points and the plurality of points. Information acquisition means for acquiring association information between the first identification information for identifying the first object and the second identification information for identifying the one or a plurality of second objects. 310), the changing means (340) for changing the association information based on a predetermined condition, and the association information of the point on the route connecting the point where the object exists and the specific point. Based on this, it is characterized by including an effect generating means (350) that causes the object to generate a disadvantageous effect in the game.

1-8) The game control device (10, 30) according to one aspect of the present invention comprises a plurality of first objects operated by each of a plurality of users, and one or a plurality of second objects as opponents. At least one is a game control device (10, 30) that executes a game movable between each of the plurality of points and the other points associated with the points, and the plurality of points. And the association information between each of the above and one of the first identification information for identifying the plurality of first objects and the second identification information for identifying the one or the plurality of second objects. The information acquisition means (310) to be acquired, the change means (340) for changing the association information based on a predetermined condition, the said point on the path where the object exists, and the specific said point. It is characterized by including an effect generating means (350) that causes the object to generate a disadvantageous effect in the game based on the association information of the point.

1-9) The program according to one aspect of the present invention is the game system (1) according to any one of 1-1) to 1-7) below or the game control device (10) according to 1-8) above. , 30) to make the computer function.

1-10) The information storage medium according to one aspect of the present invention is a computer-readable information storage medium in which the above program is recorded.

According to the present invention, each user is disadvantaged because the game object is disadvantaged based on the association information between the point where each game object exists and the point on the movable path of the specific point. It is possible to enhance the strategic nature of the game by being aware of not only the position where the game object exists but also the association information of the points on the route so that the game object is not disadvantaged or the enemy is disadvantaged. Also, for example, even if there is a user with a weak game object among a plurality of users, the enemy is disadvantaged by the association information of points on the route, so that the user does not rely solely on the strength of the game object to play the game. It becomes possible to think strategically, and even weak users can play an active role.

1-2) In one aspect of the present invention, the game system (1) further includes a battle executing means (330) for executing a battle at each of the plurality of points, and the changing means (340) further includes the battle executing means (340). It is characterized in that the association information is changed based on the result of the match executed by the means (330).

According to the invention described in 1-2), the association information of a certain point is changed based on the result of the battle executed at each of a plurality of points. Since the result of the match at that point can be influenced, the strategic nature of the game can be further enhanced.

1-3) In one aspect of the present invention, the game system (1) provides specific means (320) for specifying the first object and the second object that can participate in the battle at each of the plurality of points. Further including, the battle executing means (330) executes the battle at each of the plurality of points based on the first object and the second object specified by the specific means (320). It is a feature.

According to the invention described in 1-3), the objects that can participate in the battle executed at each point in the game space are specified based on the points of each object. Since it makes you think about whether it is good or not, you can further enhance the strategic nature of the game.

1-4) In one aspect of the present invention, the changing means (340) changes the association information based on the winner of the battle executed by the battle executing means (330). And.

According to the invention described in 1-4), since each point is associated with the person who won the battle, it is possible to give the motivation to win the battle related to each point. In addition, since the condition for associating each point is the victory of the match, it becomes easier for the user to understand the condition for associating each point.

1-5) In one aspect of the present invention, the effect generating means (350) is associated with the first identification information on a route connecting the point where the first object exists and the specific point. When there is no route that passes only through the above-mentioned points, the means (351) that causes the first object to have an adverse effect on the game, the above-mentioned point where the second object exists, and the above-mentioned specific points. Includes at least one of means (352) that causes the second object to have a disadvantageous effect on the game when the route connecting the two objects does not include a route that passes only the point associated with the two identification information. It is characterized by that.

According to the invention described in 1-5), when there is no point associated with the first identification information on the route between the point where the game object operated by the user is located and the specific point, the game object is concerned. By generating an effect that makes the game object disadvantageous, for example, it is possible to express in the game a situation in which the game object is disadvantaged because the supply to the game object is cut off. For example, by generating an effect that the game object is disadvantageous when there is no point associated with the second identification information on the route between the point where the opponent's game object is and the specific point. It is possible to express in the game a situation that is disadvantageous because the supply to the game object is cut off.

1-6) In one aspect of the present invention, the effect generating means (350) is characterized in that the adverse effect is generated by changing the parameters associated with the object.

According to the invention described in 1-6), by changing the parameters of an object, for example, it is possible to express that it is disadvantageous because the supply to the object is cut off.

1-7) In one aspect of the present invention, the effect generating means (350) generates the disadvantageous effect when the association information of the point on the route satisfies a predetermined condition, and the predetermined condition. When is no longer satisfied, the occurrence of the disadvantageous effect is canceled.

According to the invention described in 1-7), users play a game in order to eliminate the situation in which they are disadvantaged as soon as possible, or play a game in order to continue the situation in which the opponent is disadvantaged as much as possible. Because you play, you can improve the strategy of the game.

[6-2. Invention of the second technique]
2-1) In the game system (1) according to one aspect of the present invention, at least one of a plurality of first objects operated by each of the plurality of users and one or a plurality of second objects that are opponents is used. , A game system (1) that executes a game that can be moved between each of a plurality of points and another point associated with the point, and each of the plurality of points and the plurality of points. Information acquisition means for acquiring association information between the first identification information for identifying the first object and the second identification information for identifying the one or a plurality of second objects. 310), the changing means (340) for changing the association information based on a predetermined condition, and the association information of the other point associated with the point where the object exists, to the object. It is characterized by including an effect generating means (350) that generates a disadvantageous effect on the game.

2-8) The game control device (10, 30) according to one aspect of the present invention comprises a plurality of first objects operated by each of a plurality of users, and one or a plurality of second objects as opponents. At least one is a game control device (10, 30) that executes a game movable between each of the plurality of points and the other points associated with the points, and the plurality of points. And the association information between each of the above and one of the first identification information for identifying the plurality of first objects and the second identification information for identifying the one or the plurality of second objects. The information acquisition means (310) to be acquired, the change means (340) for changing the association information based on a predetermined condition, and the association information of the other points associated with the point where the object exists. Based on this, it is characterized by including an effect generating means (350) that causes the object to generate a disadvantageous effect in the game.

2-9) The program according to one aspect of the present invention is the game system (1) according to any one of the above 2-1) to the following 2-7) or the game control device (10) according to the above 2-8). , 30) to make the computer function.

2-10) The information storage medium according to one aspect of the present invention is a computer-readable information storage medium in which the above program is recorded.

According to the present invention, the game object becomes disadvantageous based on the association information of the other points associated with the point where each game object exists, so that each user does not disadvantage themselves or Since the association information of other points as well as the point where the game object exists is conscious so that the enemy is disadvantaged, the strategic nature of the game can be enhanced. Further, for example, even if there is a user with a weak game object among a plurality of users, the enemy is disadvantaged by the association information of the other points associated with the point where the opponent's game object exists. Will be able to think strategically about the game without relying solely on the strength of the game object, allowing even weak users to play an active role.

2-2) In one aspect of the present invention, the effect generating means (350) is based on the association information of the other points associated with the specific point with respect to the object existing at the specific point. It is characterized in that it causes a disadvantageous effect on the game.

According to the invention described in 2-2), the user object and the opponent object existing at a specific point may be disadvantageous depending on the association status of the points adjacent to the specific point. Since it can be changed, the strategy of the game can be further enhanced.

2-3) In one aspect of the present invention, the plurality of points are the first specific point previously associated with the first identification information and the second identification information previously associated with the second identification information. A means (360), including a specific point, wherein the game system (1) determines the outcome of a game based on the association information between the first specific point and the second specific point. It is characterized by further containing.

According to the invention described in 2-3), the strategic nature of the game is achieved by making the player aware of not only a specific point that is a factor that determines the outcome of the game but also other points associated with the specific point. Can be further enhanced. Furthermore, for example, even if there is a user with a weak game object among multiple users, he / she can play an active role by making the enemy disadvantageous, so that the weak user can play an active role even in important situations that affect the outcome of the game. can.

2-4) In one aspect of the present invention, the game system (1) further includes a battle executing means (330) for executing a battle at each of the plurality of points, and the changing means (340) further includes the battle executing means (340). It is characterized in that the association information is changed based on the result of the match executed by the means (330).

According to the invention described in 2-4), the association information of a certain point is changed based on the result of the battle executed at each of a plurality of points. Since the result of the match at that point can be influenced, the strategic nature of the game can be further enhanced.

2-5) In one aspect of the present invention, the changing means (340) changes the association information based on the winner of the battle executed by the battle executing means (330). And.

According to the invention described in 2-5), since each point is associated with the person who won the battle, it is possible to give the motivation to win the battle related to each point. In addition, since the condition for associating each point is the victory of the match, it becomes easier for the user to understand the condition for associating each point.

2-6) In one aspect of the present invention, the effect generating means (350) is associated with the second identification information among the other points associated with the point where the first object is present. Of the means (351) that cause the first object to have an adverse effect on the game based on the number of the points, and the other points associated with the point where the second object is present. It is characterized by including at least one of means (352) for causing the second object to have a disadvantageous effect on the game based on the number of the points associated with the first identification information.

According to the invention described in 2-6), a disadvantageous effect occurs based on the number of points associated with the user side or the opponent side. Therefore, the larger the number of points, the more disadvantageous the process is. Can be executed. In this way, it is possible to express a situation in which the more isolated the game object is, the more disadvantageous it is.

2-7) In one aspect of the present invention, the effect generating means (350) is characterized in that the adverse effect is generated by changing the parameters associated with the object.

According to the invention described in 2-7), by changing the parameters of an object, for example, it is possible to express a disadvantage because the object is isolated.

[6-3. Invention of the Third Technique]
3-1) The game system (1) according to one aspect of the present invention includes a means (310) for acquiring the association stored by the storage means (300) for storing the association between the user identification information and the user object. Behavior control means (370) that causes a user object associated with the user identification information to act by changing a game parameter associated with the user identification information based on an operation of the user identified by the user identification information. And, the cumulative information acquisition means (310) that acquires the cumulative information based on the change amount of the game parameter changed by the action control means (370), and the opponent object as the opponent of the user based on the cumulative information. It is characterized by including an opponent object generation means (410) that generates the above.

3-8) A user object associated with the user identification information by changing the game parameters associated with the user identification information for identifying the user based on the user's operation according to one aspect of the present invention. Based on the behavior control means (370), the cumulative information acquisition means (310) for acquiring the cumulative information based on the amount of change of the game parameter changed by the behavior control means (370), and the cumulative information. It is characterized by including an opponent object generation means (410) that generates an opponent object as an opponent of the user.

3-9) The program according to one aspect of the present invention is the game system (1) according to any one of the above 3-1) to the following 3-7) or the game control device (10) according to the above 3-8). , 30) to make the computer function.

3-10) The information storage medium according to one aspect of the present invention is a computer-readable information storage medium in which the above program is recorded.

According to the present invention, since the opponent object is generated based on the cumulative information of the game parameters that change depending on the action of the user object, the opponent does not act and the game parameters do not change. Since it is possible to prevent the generation of objects, it is possible to maintain the game balance when generating the objects of the opponent. That is, if the opponent objects are generated one after another even though the user object is not acting, the user object may be killed by the large number of opponent objects. However, since the cumulative information is acquired based on the behavior of the user object, it is possible to generate an opponent object according to the activity amount and activity time of the user, and the game balance can be maintained.

3-2) In one aspect of the present invention, the game system (1) further includes a means (400) for determining whether or not a given game task has been achieved based on the behavior of the user object. The opponent object generation means (410) is characterized in that the opponent object is generated based on the cumulative information between the start of the game and the achievement of the game task. ..

According to the invention described in 3-2), an opponent object is generated at an appropriate timing even when the user needs to play intermittently for a long period of time from the start of the game to the achievement of the game task. be able to.

3-3) In one aspect of the present invention, the game system (1) further includes a means (420) for notifying the user of the cumulative information acquired by the cumulative information acquisition means (310). It is characterized by that.

According to the invention described in 3-3), by notifying the user of the cumulative information that is a condition for the opponent object to be generated, for example, it is considered how much more the user character should be acted to generate the opponent object. Since it is possible to play the game while letting it play, it is possible to provide a more strategic game.

3-4) In one aspect of the present invention, the cumulative information is information based on the amount of change of each of the plurality of game parameters associated with the plurality of user identification information, respectively, and the opponent object generation means ( 410) is characterized in that the opponent object is generated as an opponent of a plurality of the users identified by each of the plurality of user identification information.

According to the invention described in 3-4), it is possible to prepare common cumulative information for a plurality of users and influence the behavior of each user character on the common cumulative information to generate an opponent object. , It is possible to make it easy for users to influence each other's gameplay. As a result, it is possible to provide a more varied game. Further, even in a game play by a plurality of users, since the cumulative information based on the amount of change changed by each action of the plurality of user objects is used, it is possible to generate a battle object more appropriately.

3-5) In one aspect of the present invention, the opponent object generation means (410) generates the opponent object as an opponent of a plurality of the users identified by each of the plurality of user identification information. Each of the plurality of user identification information and the group identification information for identifying the group of the plurality of users are characterized in that they are associated in advance.

According to the invention described in 3-5), in a game in which a plurality of users belonging to a group and an opponent play against each other, an opponent object is generated based on cumulative information, and the game play between the users is influenced by each other. By giving, it is possible to give an opportunity for users belonging to the same user group to communicate more with each other. In addition, since users who know each other can participate in the game, it is possible to proceed with the game while discussing strategies in advance.

3-6) In one aspect of the present invention, the opponent object generation means (410) includes a means (411) for determining whether or not the cumulative information is equal to or higher than the reference, and the cumulative information is equal to or higher than the reference. It is characterized in that the opponent object is generated when it is determined that the item has become.

According to the invention described in 3-6), if it is determined that the cumulative information exceeds the standard, the opponent object is generated, so that the standard for generating the opponent object can be set in advance. , It becomes easier to keep the game balance.

3-7) In one aspect of the present invention, the game system (1) further includes means (390) for changing the game parameters based on the passage of time.

According to the invention described in 3-7), the strategic nature of the game can be enhanced by changing the game parameters based on the passage of time. For example, if the game parameters are changed based on the passage of time, the period from the start of the game to the achievement of the game task tends to be relatively long, so even in such a case, at an appropriate timing. You can spawn an opponent object.

1 game system, N network, 10 terminals, 11 control unit, 12 storage unit, 13 communication unit, 14 input unit, 15 display unit, 30 server, 31 control unit, 32 storage unit, 33 communication unit, D ally deck, E Enemy deck, M map, P point, R road, G10 game image, A10 map display area, G20 detailed information image, OB20, OB21, OB22, OB23, OB24 processing object, G30 battle preparation image, G40
Battle image, G50 battle result image, 100 operation reception unit, 110 display control unit, 300
Data storage unit, 310 information acquisition unit, 320 specific unit, 330 battle execution unit, 340 change unit, 350 effect generation unit, 360 win / loss judgment unit, 370 action control unit, 380 cumulative information acquisition unit, 390 parameter change unit, 400 achievement Judgment unit, 410 enemy deck generation unit, 420 cumulative information notification unit, TBL101 user information table, TBL102 ally information table, TBL103 enemy army information table, TBL104 map status table.

Claims (11)

It is a program to make a computer execute a game in which multiple points where the object operated by the user can move are set.
An information acquisition means for acquiring association information regarding whether or not each of the plurality of points is associated with the affiliation information to which the object belongs.
A changing means for changing the association information so that the association between the point where the object exists and the affiliation information is changed based on a predetermined condition.
Whether or not there is a route that passes only through the point associated with the affiliation information based on the association information of the point in the route connecting the point where the object exists and the specific point. An effect generating means that generates an effect on the game that is more disadvantageous than the case where the route exists in the object when the determination is made and the route does not exist.
To make the computer function as
The plurality of points include a middle location point that is not associated with any of the affiliation information or affiliation information different from the affiliation information.
The changing means changes the association information so that the middle location point is associated with the affiliation information or the different affiliation information based on a condition different from the predetermined condition.
It is determined that the route including the intermediate location point is not the route that passes only through the point associated with the affiliation information.
program. It is a program to make a computer execute a game in which multiple points where the object operated by the user can move are set.
An information acquisition means for acquiring association information regarding whether or not each of the plurality of points is associated with the affiliation information to which the object belongs.
A changing means for changing the association information so that the association between the point where the object exists and the affiliation information is changed based on a predetermined condition.
There is the route that does not pass through the point associated with the affiliation information different from the affiliation information based on the association information of the point in the route connecting the point where the object exists and the specific point. An effect generating means for generating an effect on the game, which is more disadvantageous to the object than when the route exists, when it is determined whether or not the route exists.
To make the computer function as
The plurality of points include a middle location point that is not associated with either the affiliation information or the different affiliation information.
The changing means changes the association information so that the middle location point is associated with the affiliation information or the different affiliation information based on a condition different from the predetermined condition.
It is determined that the route that does not include the point associated with the different affiliation information and includes the intermediate location point is the route that does not pass through the point associated with the different affiliation information.
program. Further, the computer is made to function as a battle execution means for executing a battle at each of the points.
The changing means changes the association information based on the result of the battle executed by the battle executing means.
The program according to claim 1 or 2. The effect generating means generates the effect by changing the parameters associated with the object.
The program according to any one of claims 1 to 3. The effect generating means is
If the route that passes only through the point associated with the affiliation information does not exist, the effect is generated, and if the route exists, the effect is not generated or the effect is not generated.
The effect generating means generates the effect when the route that does not pass through the point associated with the different affiliation information does not exist, and does not generate the effect when the route exists.
The program according to any one of claims 1 to 4. A means of moving the computer to move the object by consuming points,
The program according to any one of claims 1 to 5, further functioning as. A recovery means that allows the computer to recover the points over time,
The program according to claim 6, further functioning as. A game control device that executes a game in which multiple points where the object operated by the user can move are set.
An information acquisition means for acquiring association information regarding whether or not each of the plurality of points is associated with the affiliation information to which the object belongs.
A changing means for changing the association information so that the association between the point where the object exists and the affiliation information is changed based on a predetermined condition.
Whether or not there is a route that passes only through the point associated with the affiliation information based on the association information of the point in the route connecting the point where the object exists and the specific point. When it is determined that the route does not exist, the effect generating means for generating the effect on the game, which is more disadvantageous to the object than when the route exists,
Including
The plurality of points include a middle location point that is not associated with any of the affiliation information or affiliation information different from the affiliation information.
The changing means changes the association information so that the middle location point is associated with the affiliation information or the different affiliation information based on a condition different from the predetermined condition.
It is determined that the route including the intermediate location point is not the route that passes only through the point associated with the affiliation information.
Game control device. A game control device that executes a game in which multiple points where the object operated by the user can move are set.
An information acquisition means for acquiring association information regarding whether or not each of the plurality of points is associated with the affiliation information to which the object belongs.
A changing means for changing the association information so that the association between the point where the object exists and the affiliation information is changed based on a predetermined condition.
There is the route that does not pass through the point associated with the affiliation information different from the affiliation information based on the association information of the point in the route connecting the point where the object exists and the specific point. An effect generating means for generating an effect on the game, which is more disadvantageous to the object than when the route exists, when it is determined whether or not the route exists.
Including
The plurality of points include a middle location point that is not associated with either the affiliation information or the different affiliation information.
The changing means changes the association information so that the middle location point is associated with the affiliation information or the different affiliation information based on a condition different from the predetermined condition.
It is determined that the route that does not include the point associated with the different affiliation information and includes the intermediate location point is the route that does not pass through the point associated with the different affiliation information.
Game control device. It is a game system that executes a game in which multiple points where the object operated by the user can move are set.
An information acquisition means for acquiring association information regarding whether or not each of the plurality of points is associated with the affiliation information to which the object belongs.
A changing means for changing the association information so that the association between the point where the object exists and the affiliation information is changed based on a predetermined condition.
Whether or not there is a route that passes only through the point associated with the affiliation information based on the association information of the point in the route connecting the point where the object exists and the specific point. When it is determined that the route does not exist, the effect generating means for generating the effect on the game, which is more disadvantageous to the object than when the route exists,
Including
The plurality of points include a middle location point that is not associated with any of the affiliation information or affiliation information different from the affiliation information.
The changing means changes the association information so that the middle location point is associated with the affiliation information or the different affiliation information based on a condition different from the predetermined condition.
It is determined that the route including the intermediate location point is not the route that passes only through the point associated with the affiliation information.
Game system. It is a game system that executes a game in which multiple points where the object operated by the user can move are set.
An information acquisition means for acquiring association information regarding whether or not each of the plurality of points is associated with the affiliation information to which the object belongs.
A changing means for changing the association information so that the association between the point where the object exists and the affiliation information is changed based on a predetermined condition.
There is the route that does not pass through the point associated with the affiliation information different from the affiliation information based on the association information of the point in the route connecting the point where the object exists and the specific point. An effect generating means for generating an effect on the game, which is more disadvantageous to the object than when the route exists, when it is determined whether or not the route exists.
Including
The plurality of points include a middle location point that is not associated with either the affiliation information or the different affiliation information.
The changing means changes the association information so that the middle location point is associated with the affiliation information or the different affiliation information based on a condition different from the predetermined condition.
It is determined that the route that does not include the point associated with the different affiliation information and includes the intermediate location point is the route that does not pass through the point associated with the different affiliation information.
Game system.

Images