JP6519745B2 - Game system, game control device, and program - Google Patents

Description

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

  BACKGROUND Conventionally, a game system is known that executes a game in which a user and an opponent play a match. For example, Patent Document 1 describes a game system that executes a game in which an enemy game character is generated at a predetermined frequency in a game where a game character operated by a user and an enemy game character fight. There is.

JP 2000-014928 A

  However, in the technique of Patent Document 1, since the enemy game character is generated at a predetermined frequency, the game becomes monotonous and there is a possibility that a change can not be sufficiently given. In this respect, since the game character of the opponent who occurs in the middle greatly affects the game balance, for example, if the game character of the opponent is completely generated randomly, the game character of the opponent abnormally generates a large amount It is possible for the game balance to be greatly disrupted, as it may happen.

  The present invention has been made in view of the above problems, and an object thereof is to provide a game system, a game control apparatus, and a program capable of maintaining a game balance when generating an opponent's object. is there.

  In order to solve the above-mentioned subject, the game system concerning one mode of the present invention is a means to acquire the above-mentioned association stored by storage means which memorizes association of user identification information and a user object, and the above-mentioned user identification information Behavior control means for causing 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 identified user, and change by the behavior control means Including: accumulated information acquiring means for acquiring accumulated information based on the change amount of the game parameter; and opponent object generating means for generating an opponent object as an opponent of the user based on the accumulated information. It features.

  A game control apparatus according to an aspect of the present invention is a user associated with the user identification information by changing a game parameter associated with the user identification information for identifying the user based on a user operation. An opponent as an opponent of the user based on action control means for causing an object to act, cumulative information acquisition means for obtaining cumulative information based on the change amount of the game parameter changed by the action control, and the cumulative information. And an opponent object generating means for generating an object.

It is a figure showing the whole composition of the game system concerning the embodiment of the present invention. It is a figure which shows an example of the map at the time of game start. 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 a detailed information image when the point which the enemy army is suppressing is selected. It is a figure which shows the game image at the time of an ally deck moving to a point. It is a figure which shows an example of a detailed information image when a user selects a point. It is a figure which shows an example of a battle | competition preparatory image. It is a figure which shows an example of a battle | competition image. It is a figure which shows an example of a battle result image. 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 when a user selects a point. It is a figure which shows the state in which the ally deck is isolated. It is a figure which shows the case where an enemy deck will be in isolation. It is a figure which shows the state which the friendly forces suppressed all around the point which is an enemy army's base. It is a figure which shows the state which the enemy army suppressed the circumference of the point which is the base of a friendly army. It is a figure which shows a mode that an enemy deck newly generate | occur | produces. It is a figure which shows an example of a detailed information image at the time of selecting the point which the friendly army is controlling in the state which has an enemy deck. It is a functional block diagram showing the function relevant to the present 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 a friendly 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 flowchart which shows an example of the process performed in a game system. It is a flowchart which shows an example of the process performed in a game system. It is a flowchart which shows an example of the process performed in a game system. It is a flowchart which shows an example of the process performed in a game system. It is a flowchart which shows an example of the process performed in a game system. It is a flowchart which shows an example of the process performed in a game system. It is a flowchart which shows an example of the process performed in a game system. It is a flowchart which shows an example of the process performed in a game system. It is a functional block diagram of the modification about the 3rd art.

  Hereinafter, an embodiment according to the present invention will be described based on the drawings. In the drawings, the same or corresponding components are denoted by the same reference numerals, and repeated description may be omitted.

[1. Overall configuration of game system]
FIG. 1 is a diagram showing an entire 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, 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. For this reason, mutual data communication is possible between the terminal 10 and the server 30.

  The terminal 10 is a terminal device (computer) used by a user. In the present embodiment, the terminal 10 is a computer that a user uses to play a game. For example, the terminal 10 may be a mobile phone (including a smart phone), 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 the like, or an information processing function Multifunction television receiver (smart television) or the like. In addition, below, the case where the mobile phone (smart phone) provided with the touch panel is the terminal 10 and the program supplied from the server 30 is executed in the mobile phone (smart phone) 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 executes processing in accordance with an operating system and other programs. The storage unit 12 includes a main storage unit (for example, a RAM) and an auxiliary storage unit (for example, a non-volatile semiconductor memory), and is for storing programs and data. For example, when the terminal 10 is a stationary game machine, a business game machine, a laptop computer, or a desktop computer, 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, a button, and the like, and is used by 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 game machine for business use, a laptop computer, a desktop computer or the like, the input unit 14 may be a key, a lever, a game controller (game pad), a mouse, a touch pad Or a keyboard etc. may be included. The display unit 15 is, for example, a liquid crystal display panel or an organic EL display, and displays an image according to an instruction of the control unit 11. The input unit 14 and the display unit 15 may not be built in the terminal 10, and may be an external device connected to the terminal 10.

  The server 30 is implemented 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, a 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 32 may be supplied to the terminal 10 or the server 30 via the network N, for example. In addition, 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 disc 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. Outline of the game executed by the game system]
The game system 1 associates at least one of a plurality of first objects operated by each of a plurality of users and one or more second objects as opponents with each of the plurality of points and the points. Run a game that can move between other points.

  In the present embodiment, the “plural users” are users who cooperate and play the game. The “plurality of users” may belong to a user group in advance, or may not belong to any user group in particular. The user group is, for example, a group of users who are in a peer relationship. The users belonging to the same user group can communicate with each other such as chat. Moreover, when a predetermined game event is held, users of the same user group can cooperate with each other. The user group is called team guild legion or the like. In the present 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. Also, for example, the “object” is a target of collection by the user. Specifically, for example, a game card, a game character, or a game item corresponds to an example of the “object”. Alternatively, a deck composed of a plurality of game cards, a plurality of game characters, or a plurality of game items or the like corresponds to the "object". In the present embodiment, there are two “objects”, a user object and an opponent object. The "user object" is an object operated by the user. The "opposition object" is an opponent of the user object. In the present embodiment, the case where the deck corresponds to an "object" and the deck of each user corresponds to a user object will be described. The group consisting of the decks of each user in a cooperative relationship is hereinafter referred to as a friendly army.

  The "opponent" is an object that fights against the user's deck in the game. This object may be under the control of a computer, or may be operated by a user as an opponent. In the present embodiment, a case will be described where a deck placed under control of a computer corresponds to an "opposition opponent" (opposite object). Subsequently, the user's deck is described as an allied deck, and the opponent of the allied deck is described as an enemy deck. Also, a group consisting of multiple enemy decks is called an enemy army.

  The "point" is a base, a building, a place, and a position in the virtual world. A plurality of "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, an object that a friendly army or an enemy army controls (occupies) an enemy army. In this embodiment, the case where a plurality of points are set in a two-dimensional map will be described.

[2-1. Overview of the whole game]
Here, a game in which each of a plurality of users belonging to a team cooperates to fight an enemy deck while moving an ally deck in a map is exemplified. FIG. 2 is a diagram showing an example of the map at the game start time. The x-y axes in FIG. 2 are coordinate axes of two-dimensional coordinates. As shown in FIG. 2, in the map M, a plurality of points P _{1 to} P ₃₀ are set. Hereinafter, when it is necessary to refer to the drawings, it will be described by attaching a code such as "Point P ₁ ", and when it is not particularly necessary, it will be described without a code such as "Point". . The position of each point is specified by two-dimensional coordinates in the map M.

And ally deck _D 1 to D ₅ of each user, the enemy deck _E 1 _{to E 12,} is disposed in any location. As in the case of points, when it is necessary to refer to the drawings for the ally deck and the enemy deck as well, a code such as "ally deck D ₁ " or "enemy deck E ₁ " is given, and in particular When it is not necessary, it will be described without a code just like "friend deck" or "enemy deck". At each point, not only one team deck or one enemy deck but one body may be arranged. Since the map M in FIG. 2 is at the start of the game, the friend deck and the enemy deck are present at the initial position.

  In addition, when it describes like "the point where a deck exists" by the following description, it means the point linked | related with the deck on data. That is, it means that information identifying any point is stored as information indicating the current position of the deck. In other words, in the image indicating each point displayed on the display unit 15, the point indicated by the image displayed at the same position as the image indicating the deck or at a position within a predetermined distance is meant.

As shown in FIG. 2, a plurality of roads R _{1 to} R ₃₈ are set in the map M. As with points, for roads, when it is necessary to refer to the drawings, it will be described with a code such as "road R ₁ ", and when it is not particularly necessary, it will be simply a code such as "road" I will explain without the. Each point is connected by road with one or more other points. For example, the friendly deck can move to another point connected to the current point by consuming the energy points described later. For example, ally deck _{D 1} being in point _{P 12} can be moved in one way _{R 12, R 16, R 17} , point tethered by _{R 21 P 7, P 11,} P 13, P 18 . Similarly, other ally deck D ₂ to D ₅ are also enabled to be moved to other points that are connected by the current point and the road. Although the enemy deck may also be movable, in the present embodiment, a case where the enemy deck does not move will be described in order to simplify the description.

  In the map M, there are a point at which the friendly army is suppressing, a point at which the enemy army is suppressing, and a neutral point at which neither the friendly army nor the enemy army is suppressing. In FIG. 2, the points where the friendly army is controlling is indicated by hatching, the points where the enemy forces are suppressing are indicated by halftone dots, and the neutral points are indicated by white without any pattern. At the start of the game, the friendly deck is at any point where the friendly army is taking over. An enemy deck, on the other hand, exists at any point where the enemy army is overthrowing. In the example shown in FIG. 2, the enemy decks are arranged at all the points where the enemy army is controlling, but even if the enemy forces are at a point where the enemy decks are not arranged. Good.

Also, any point where the friendly army is taking control is set as the friendly army's home base. One of the points where the enemy army is overthrowing is set as the home of the enemy army. In Figure 2, it is the home of the point P ₂₂ is friendly forces, the point P ₉ is the home of the enemy troops. The home location is used to determine the outcome of the game. For example, if the point P ₉ is the home of the enemy troops ally army was conquered, it becomes the ally forces of victory, when the point P ₂₂ is the home of the ally army enemy army conquered, the enemy of victory.

  In each point, in principle, the controlling army changes based on the match result between the allied deck and the enemy deck at that point. For example, when the user moves an ally deck to a point where the enemy army is taking control by consuming energy points, the user can consume battle points to be described later and can play against the enemy deck at that point. Become.

  For example, when the ally deck wins the battle at the point where the enemy army is overthrowing, the ally army can overshadow the point. If an ally deck can not win in a battle where the enemy army is overthrown, the enemy army will still control over that spot. Even if the enemy deck can not be won, the ally deck may remain at the point where the battle was played. Because of this, the friendly deck is able to challenge the enemy deck again. The enemy deck may weaken each time it plays against an ally deck. The extent to which the enemy deck in this case is weakened may be determined based on the content of the battle with the allied deck.

On the other hand, an enemy deck is generated at a point where an ally is under control, and if the enemy deck can not be won for a certain period of time, the point is overwhelmed by the enemy army. For this reason, the user moves the ally deck to the point where the enemy deck has been generated to play a match. If the ally deck can not win the enemy deck and the spot is overwhelmed by the enemy army, the ally deck may be forced to return to the spot P ₂₂ which is the home of the friendly army. In this case, the energy points may be consumed by a predetermined value. If an ally deck wins the enemy deck for a certain period of time, the ally will remain in control of the spot where the enemy deck occurred.

  If the friendly deck moves to a neutral spot, the friendly army can control the spot without playing a match. Similarly, when an enemy deck occurs at a neutral point, that point is suppressed by the enemy army without specifically playing a match.

As described above, the user moves his ally deck in Map M to control each point, and while aiming to protect the base of the friendly army, finally aims to win and control the base of the enemy army. . When the game starts, a game image showing the current state of the game being played is displayed on the display unit 15. Following describes an example of an image displayed on the terminal 10 of the user operating the ally deck D _1.

FIG. 3 is a diagram showing an example of a game image. As shown in FIG. 3, the game image G10, the current value and the maximum value of the energy points for moving the ally deck D _1, the current value and the maximum value of the battle point for play against the enemy deck, team overall The score acquired in and the score etc. which the user acquired individually are displayed.

  The user can move the friendly deck in the map M by consuming energy points. For example, if the user moves to the adjacent point connected by the way to the point where his / her deck is, energy point is consumed by 2 pt. The friendly deck can not be moved unless energy points remain above a certain level. 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 consume battle points to play a match between the teammate deck and the enemy deck. For example, when the user uses his or her own deck to play against the enemy deck, it consumes 1 pt of battle points. If there are no battle points remaining above a certain level, you can not compete. 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 state of part of 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 indicating detailed information of the point is displayed on the display unit 15.

FIG. 4 is a diagram showing an example of the detailed information image. As shown in FIG. 4, in the detailed information image G20, the suppression status of the point selected by the user and the presence or absence of the friendly deck and the enemy deck are displayed. Here it is shown a detailed information image G20 in the case where the user selects a point P _23. As shown in FIG. 4, the detailed information image G20, the point P ₂₃ is conquered teammate army, is displayed that no ally deck and the enemy deck.

Further, in the detailed information image G20, the processing objects OB20 and OB21 are displayed. The “processing object” is an image, a symbol, a text or the like associated with the processing. Processing object OB20, the processing for moving the ally deck D ₁ of the user at a point that is displayed in the detailed information image G20 is associated. Therefore, when the user selects the processing object OB20, the point that is displayed in the detailed information image G20, it is possible to move their ally deck D _1. Further, the processing object OB21 is associated with processing for returning to the game image G10. Therefore, when the user selects the processing object OB21, the game image G10 is returned to.

As described above, each ally deck can move to an adjacent point directly connected to the current point by a road, but in the present embodiment, it is possible to go only through the point where the ally forces control. For example, instead of moving one by one, it is possible to move at one time. For example, from the point P ₁₂ where the friendly deck D ₁ is located, to the point P ₂₃ selected by the user, only the point where the friendly army controls is able to pass (for example, road R ₁₆ → road R ₂₀ → road R ₂₈ ) , Allied deck D ₁ can move to point P ₂₃ at a time. In this case, more energy points (e.g., 10 pt) may be consumed as compared to moving one, or the same energy point (e.g., 2 pt) may be consumed as moving one.

FIG. 5 is a view showing an example of the detailed information image G20 when the point where the enemy army is suppressing is selected. In Figure 5, shows a detailed information image G20 in the case where the user selects a point P _13. As shown in FIG. 5, the details information image G20, information indicating that the enemy is conquered point P ₁₃ is displayed. Further, the fact that the enemy deck E ₉ is present at this point P ₁₃ is displayed in the detailed information image G 20. Besides, the names and parameters of the game characters constituting the enemy deck E ₉ may be displayed.

The process object OB22, processing for moving the ally deck D ₁ to a point P ₁₃ selected by the user is associated. When the user selects a processing object OB22, ally deck D ₁ by consuming energy point moves to the point P _13, the game image G10 is displayed on the display unit 15.

Figure 6 is a diagram showing a game image G10 when ally deck _{D 1} has moved to the point _{P 13.} As shown in FIG. 6, when the ally deck _{D 1} is moved to the point _{P 13,} the map display area A10 is updated. As shown in FIG. 6, the point P _13, since there are ally deck D ₁ and the enemy deck E _9, it is possible to match to conquer point P _13. For example, the detailed information image G20 displayed on the display unit 15 by the user selecting a point P _13, it is possible to instruct the match.

Figure 7 is a diagram showing an example of the detailed information image G20 in the case where the user selects a point P _13. As shown in FIG. 7, the details information image G20, the point P _13, displays the fact that there are ally deck D ₁ and the enemy deck E _9, Battle point of the user is displayed. Processing object OB23, the processing for a match with the ally deck D ₁ and the enemy deck E ₉ is associated. When the user selects the processing object OB 23, a battle preparation image is displayed on the display unit 15.

FIG. 8 is a view showing an example of the battle preparation image. As shown in FIG. 8, the battle preparation image G30, detailed information such as a game character and parameters constituting the enemy deck E _9, the presence or absence of effects that occur in competition, and information concerning the point P ₁₃ is displayed. When the user selects the processing object OB31, the game image G10 may be returned. The processing object OB30 is associated with processing for starting a battle. When the user selects the processing object OB 30, the battle starts, and a battle image is displayed on the display unit 15.

FIG. 9 is a diagram showing an example of the battle image. As shown in FIG. 9, the fighting image G40, and the image of the game character constituting the ally deck D _1, and the image of the game character constituting the enemy deck E _9, are displayed. The battle itself can be performed by various known processes. For example, the battle may be executed until _{one of} the allied deck D ₁ and the enemy deck E ₉ is destroyed until the annihilation of the opponent may be won, or the battle may be performed for a predetermined number of turns. You may make it run. When the battle is over, a 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 of the enemy deck E ₉ , the battle result, and the game item and score acquired in the battle. Here, since the ally deck D ₁ of the user winning the match result image G50, the point P ₁₃ is displayed that the ally army conquered. The process 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 view showing an example of the game image G10. As shown in the map display area A10 of FIG. 11, in the battle of the point P _13, since the ally deck D ₁ of the user has won, the point P ₁₃ is ready to ally forces took control from the state in which the enemy has been conquered ing. And the enemy deck E _{9 which} has lost in the battle of the point P ₁₃ is lost from the map M. And later, the user may select the next point to be conquered, it will be the match by moving his ally deck D _1.

In the present embodiment, it is assumed that the point where the enemy army is controlling can not move unless the friendly army is controlling the point connected by the road. For example, in the state shown in FIG. 2, among the points where the enemy army is controlling, only the point P ₁₃ is that the friendly army is suppressing the points connected by the road. For this reason, the ally deck of the friendly army can move only to the point P _{13 and} can not move to other points P ₈ etc. among the points where the enemy army is taking over. .

Figure 12 is a diagram showing an example of the detailed information image G20 in the case where the user selects a point P _15. Similar to FIG. 5, the details information image G20 of FIG. 12, but the information related to the point _{P 15} is displayed, a point _{P 15} is the point connected by road _{P 10,} the point _{P 14,} the point _{P 21} are all Because the enemy army is overthrowing, it will be displayed that it can not move. Therefore, the processing object OB22 is not displayed.

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

[2-2. Summary of the First Technology]
According to the first technique, when the ally deck is isolated and surrounded by the enemy deck, the ally deck has an adverse effect in the battle. Similarly, according to the first technique, when the enemy deck is isolated and surrounded by the ally deck, the enemy deck has an adverse effect in the battle.

FIG. 13 is a diagram showing a state in which the team deck is isolated. As shown in FIG. 13, although the friendly army controls the point P ₁₈ where the friendly deck D ₁ is located, the points P ₁₂ and P ₁₉ connected by roads R ₂₁ and R ₂₅ are both enemy enemy forces. It is overwhelmed. For this reason, as well as trying to move from the point P ₂₂ is the home of the friendly forces to the point P _18, you can not go through the only point at which the ally forces are conquered. In the present embodiment, such a state is called an isolated state.

In addition, the point P ₇ where the friendly deck D ₂ is located is connected by the route R ₆ and the friendly army controls the point P _3, but it also moves from the point P ₂₂ which is the base of the friendly army to the point P ₇ Even if you try, you can not go only through the point where the friendly army is taking control. For this reason, the ally deck D ₂ also has become an isolated state. In the present embodiment, at the isolated state as ally deck D _1, D _2, or reduces the ally deck D _1, D ₂ of the capacity, by or improved enemy deck capability, ally deck D ₁ , D ₂ is disadvantageously generated. Similarly, even if the enemy deck is in an isolated state, the enemy deck has an adverse effect.

FIG. 14 shows the case where the enemy deck is in an isolated state. As shown in FIG. 14, the point P ₂₁ there are enemy deck E ₁₀ is enemy is conquered, attempting to move from the point P _9, home to the enemy to the point P _21, suppression is enemy You can not go through just the point you are doing. The same applies to the point P ₂₀ where the enemy deck E ₁₁ is present and the point P ₂₆ where the enemy deck E ₁₂ is present. For this reason, the enemy deck _E 10 _{~E 12} has become an isolated state. It becomes orphaned state as an enemy deck _E 10 _{to E 12,} or reduced ability of the enemy deck _E 10 _{to E 12,} by or improved ally deck _D 1, _{D 2} of ability, the enemy deck _{E 10} ~E ₁₂ is effect occurs a disadvantage.

[2-3. Outline of the second technology]
In the second technique, and overwhelm the periphery of the point P ₉ is the home of the enemy forces in all friendly forces, the effect of the enemy deck E ₅ who are at the point P ₉ is the home of the enemy is at a disadvantage in the competition occurs It is supposed to be. Similarly, in the second of the technology, and overwhelm with all the periphery of the point P ₂₂ is the home of the friendly forces enemy forces, the effect of allies deck you are in the point P ₂₂ is the home of the friendly forces is at a disadvantage in the competition occurs It is supposed to

FIG. 15 is a diagram showing a state in which all the surrounding ally forces took control of the point P ₉ is the home of the enemy troops. As shown in FIG. 15, the friendly army makes all of the points P ₅ , P ₈ , P ₁₀ and P ₁₄ which are connected by the route R ₈ , R ₁₀ , R ₁₁ and R ₁₄ at the point P ₉ which is the base of the enemy army. It is overpowered. Hereinafter, in the present embodiment, such a state is referred to as a state surrounding the home. For example, the enemy deck E ₅ 's ability at point P ₉ is reduced or its allied decks D ₁ , D ₂ , D ₃ , D ₄ 's ability is improved when the enemy army's base is surrounded. , Enemy deck E ₅ is an adverse effect occurs.

FIG. 16 is a diagram showing a state in which all enemy forces around the point P ₂₂ is the home of the ally army conquered. As shown in FIG. 16, the enemy forces control all of the points P ₁₆ , P ₂₃ and P ₂₇ which are connected by the points P ₂₂ which is the base of the friendly army and the roads R ₂₇ , R ₃₁ and R ₃₃ . Thus, when a state surrounding the home of the friendly forces, for example, the ability of the ally deck _{D 5} being in the point _{P 22} is or improving the ability of the or an enemy deck _{E 13, E 14, E 15} decreases Then, the effect that the allied deck D ₅ becomes disadvantageous occurs.

[2-4. Outline of third technology]
In the third technology, when the consumption of energy points and battle points is accumulated by moving or fighting an allied deck of the allied army, an enemy deck is newly generated in the map M.

FIG. 17 is a view showing how an enemy deck is newly generated. In the example shown in FIG. 17, a new enemy deck E ₁₃ is generated at a point P ₁₉ connected by a point R ₂₀ where the enemy army is suppressing and a road R ₂₅ . Since the point P ₁₉ was originally neutral, it will be changed to a state in which the enemy army has suppressed without particularly playing a match. Also, an enemy deck E ₁₄ is newly generated at a point P ₁₃ at which the enemy army is taking over. For this reason, when you try to overwhelm the point P _13, it would have to be to win in two of the enemy deck E _9, E _14.

In addition, to also point _{P 7,} are newly enemy deck _{E 15} is generated. Point P ₇ is an ally army is conquered, there are no ally deck. In this case, if the user moves the ally deck to the point P ₇ within a predetermined time (for example, 10 minutes) and plays against the enemy deck E ₁₅ and wins, the point P ₇ is controlled by the enemy army. It changes to the state. In order to play against the enemy deck E ₁₅ that occurred at the point P _7, the user selects a point P ₇ from the game image G10 in a state where the movement of the ally deck to the point P _7.

FIG. 18 is a view showing an example of the detailed information image G20 in the case where an enemy deck is in the state of selecting a point which the friendly army is controlling. As shown in FIG. 18, the details information image G20, the enemy deck E ₁₅ is displayed indicating that the generated point P ₇ ally forces are conquered. The process object OB24, are associated with the process for a match with the ally deck D ₁ and the enemy deck E _15. When the user selects the processing object OB 24, a battle preparation image similar to that shown in FIG. 8 is displayed on the display unit 15 so that a battle can be made.

[3. Functions Implemented in 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 process related to the game is executed by the server 30 will be described. Therefore, the server 30 includes the data storage unit 300, the information acquisition unit 310, the identification unit 320, the battle execution unit 330, the change unit 340, the effect generation unit 350, the outcome determination unit 360, the behavior control unit 370, and the total 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 by the storage unit 32, and the information acquisition unit 310, the identification unit 320, the battle execution unit 330, the change unit 340, the effect generation unit 350, the outcome determination unit 360, the behavior control unit 370, and total information acquisition 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. In addition, you may make it the terminal 10 perform the main process regarding a game, as it demonstrates by the below-mentioned modification.

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

  FIG. 20 is a diagram showing an example of the user information table. The user information table TBL101 is a data table for storing various information related to the user. For example, in the user information table TBL101, in association with the "user ID" which is an example of user identification information, the "user name" indicating the name of the user, the "team ID" identifying the team to which the user belongs, 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 battle points are stored. Note that "user identification information" is information for uniquely identifying a user. For example, "user identification information" is a user ID, a user's name, a user account, an e-mail address. In the following description, the case where the user ID corresponds to "user identification information" will be described.

  FIG. 21 is a diagram showing an example of the friendly army information table. The friendly army information table TBL102 is a data table for storing various information related to the friendly army. For example, in the allied army information table TBL102, the "all deck ID" uniquely identifying the all deck, the "user ID" of the user who operates the all deck, the "point" where the all deck is located, and the game card constituting the all deck "Card ID" and "serial number" to identify the "game card name", various game parameters such as "rare degree" · "HP" · "attack power" · "defense power" · "cost" Information such as an "enemy occurrence point" described later is stored. In addition, when a user owns two or more same game cards, although "card ID" of these game cards is the same, "serial number" differs. As the serial number, when a game card is given to the user, a number capable of identifying the game card is issued.

  FIG. 22 is a diagram showing an example of an enemy force information table. The enemy army information table TBL 103 is a data table for storing various information related to the enemy deck. For example, in the enemy army information table TBL103, "deck ID" for identifying the enemy deck, "point" for which the enemy deck is located, "card ID" and "serial number" for identifying the game cards constituting the enemy deck, game card Information such as “name” of the game card, “rare degree” of the game card, “HP”, “attack power”, “defense power”, “cost” and various parameters are stored. A serial number may not be assigned to the game cards constituting the enemy deck.

  FIG. 23 is a diagram showing an example of the map status table. The map status table TBL 104 is a data table that stores the current status of the map M. For example, in the map status table TBL104, “Points” of the map M, “adjacent points” indicating other points connected to each point by way, “control states” indicating the control status of the points, the base of allied forces The information such as "Allied Forces Base" indicating "," and "Enemy Force Base" indicating the bases of enemy forces is stored. The "control status" stores information for identifying any one of "friend forces", "enemy forces" and "neutral". In this embodiment, this information is respectively "1", "2", "0".

  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 to execute the game. For example, the data storage unit 300 may store a data table storing basic information of a game card, or may store a data table storing a game card owned by a user. In addition, for example, the data storage unit 300 may store a data table storing basic information of a team to which the user belongs. Further, for example, the data storage unit 300 may store data regarding an enemy deck newly generated on the map M.

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

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

  The "first identification information" is information identifying a friendly army from among a plurality of forces in the game. In other words, “first identification information” is information that can identify a plurality of allied decks as a whole, and is information common to a plurality of allied decks. That is, the "first identification information" is information for identifying a friendly army. In the case of a game in which a plurality of users who belong to a team cooperate as in this embodiment, the team ID may correspond to "first identification information". In the present embodiment, the case where the numerical value of “1” representing the friendly army corresponds to the “first identification information” will be described.

  The “second identification information” is information for identifying an enemy army from among a plurality of troops in the game. In other words, “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 an enemy army. If there is one opponent's object, the "second identification information" is information identifying the object itself. In the present embodiment, the case where the numerical value of “2” representing an enemy army corresponds to “second identification information” will be described.

  The “association information” is information for identifying whether each point is associated with the friendly army or the enemy army. "Associating" is linking and storing data and data. Also, for example, “associate” means making one data of the two data available for reference to the other. In the present embodiment, a case where the correspondence between the “point” and the “control status” in the map status table TBL 104 corresponds to “association information” will be described. The case where the stored "control status" corresponds to "association information" will be described. For this reason, "associate" can be said to manage "points" and "control status" in the same table. The information acquisition unit 310 acquires map situation data with reference to the data storage unit 300.

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

  The specifying unit 320 may specify an allied deck and an enemy deck within a predetermined distance from a certain point as decks that can participate in the battle. For example, the identifying unit 320 identifies an ally deck or an enemy deck at a point connected to a point by way R as a deck that can participate in the battle. In addition, you may make it specify not the adjacent point but the ally deck and enemy deck which exist in the point which separated two or more as a deck which can participate in a battle. For example, if the ally deck or enemy deck has a predetermined attack range and can attack even on a point farther than the adjacent point, the identifying unit 320 participates in the battle based on the attack range. Identify possible decks.

[3-1-3. Battle Runner]
The battle execution unit 330 executes a battle for each of a plurality of points. For example, the battle execution unit 330 executes, for each of a plurality of points, a battle to determine whether the friendly force or the enemy force suppresses the point. The match may be any match as long as the outcome is determined under predetermined conditions, and various match may be applied. For example, as in the present embodiment, the battle format may not be based on the user-owned deck, and the game may be played based on the user's operation, not based on the user-owned deck. May be For example, the match may be like a lottery or money.

  In the present embodiment, the battle execution unit 330 executes a battle for each of a plurality of points based on the friend deck and the enemy deck identified by the identification unit 320. For example, the match execution unit 330 executes a match based on the parameters of the game card constituting the team deck and the parameters of the game card constituting the enemy deck. In this case, the match execution unit 330 reduces the HP of the game card constituting the enemy deck by the damage determined based on the attack power of the game card constituting the ally deck and the defensive power of the game card constituting the enemy deck. Also, the match execution unit 330 reduces the HP of the game card constituting the ally deck by the damage determined based on the attack power of the game card constituting the enemy deck and the defensive power of the game card constituting the ally deck.

  Game cards with HP of 0 will not be able to participate in the match. For this reason, the game card whose HP has become 0 can not attack the opponent. The battle execution unit 330 may execute the battle until either the allied deck or the enemy deck disappears, or the battle may be ended when the battle is performed for a predetermined number of turns or for a predetermined time. .

[3-1-4. Change section]
The changing unit 340 changes the “control status” of the map status table TBL 104 based on a predetermined condition. The predetermined condition may be a predetermined condition. The changing unit 340 changes the map status table TBL 104 when a predetermined condition is satisfied. For example, the fact that the game being executed is in a predetermined situation corresponds to the satisfaction of a predetermined condition.

  In the present embodiment, the changing unit 340 changes the “control status” of the map status table TBL 104 based on the result of the battle executed by the battle execution unit 330. The changing unit 340 changes the "control status" of the map status table TBL104 when the match is a predetermined result, and changes the "control status" of the map status table TBL104 when the match is not a predetermined result. Not going to change.

  The predetermined result is that one of the friendly army and the enemy army who is not taking control of the spot wins the battle. In other words, the predetermined result is that the one who controls the point loses the match. That is, if the one who controls the point wins or draws in the match, the predetermined result is not obtained. In other words, if the one who is not taking over the point loses or draws in the match, it does not have a predetermined result.

  In the present embodiment, the changing unit 340 changes the “control status” of the map status table TBL 104 based on the winning in the battle executed by the battle execution unit 330. For example, the change unit 340 changes the "suppression status" of the map status table TBL 104 so that the point which is the party of the allied army and the enemy army that has won in the match is associated.

[3-1-5. Effect generation section]
The effect generating unit 350 generates an adverse game effect on the deck based on the association information of the points on the path connecting the points where the decks (friend decks and enemy decks) exist and the specific points. .

  The “specific point” is a predetermined point in the map M. For example, a point for determining the outcome of the game or a point for generating a specific effect on the game corresponds to the specific point. In this embodiment, the base of the friendly army or the base of the enemy army corresponds to the “specific point”.

  A “route” is a route that travels from one point to another. There may be only one “path” or a plurality of “paths”.

  The "adverse effect" is that it becomes difficult to win in the match. For example, changing the parameters of the deck. For example, to reduce the ability of the deck. For example, to reduce the ability of game cards on the deck. Also, for example, it may be to strengthen an opponent's deck adjacent to an isolated deck. Also, for example, the deck can not activate a predetermined skill. Another example is to limit the behavior of the deck. For example, not moving the deck not to play is equivalent to restricting the action of the deck.

  In the present embodiment, the effect generating unit 350 generates an adverse effect by changing parameters associated with the deck (friend deck, enemy deck). For example, the effect generation unit 350 makes the allied deck disadvantageous by reducing the ability of the allied deck or improving the ability of the enemy deck. Also, for example, the effect generation unit 350 makes the enemy deck disadvantageous by reducing the ability of the enemy deck or improving the ability of the allied deck. In addition, for example, the effect generating unit 350 may make the allied deck disadvantageous by decreasing the HP of the allied deck or increasing the HP of the enemy deck. Similarly, the effect generating unit 350 may make the enemy deck disadvantageous by increasing the HP of the friendly deck or decreasing the HP of the enemy deck.

  In the present embodiment, the effect generating unit 350 generates an adverse effect when the association information of points on the route satisfies a predetermined condition, and generates an adverse effect when the predetermined condition is not satisfied. To release. The “point on the route” is a point that passes when moving along the route.

  The "predetermined condition" is that the control situation of the point on the route becomes a predetermined condition. For example, the "predetermined condition" is that the number or ratio in which the friendly army is suppressing is equal to or higher than a reference, and that the number or ratio in which the enemy army is suppressed is equal to or higher than the reference. In the present embodiment, the case where the isolated state is a predetermined condition will be described.

  To "cancel the occurrence of the adverse effect" is to stop the occurrence of the adverse effect, and to return to the state before the adverse effect occurs. In the present embodiment, the effect generation unit 350 stops the generation of the effect that the allied deck or the enemy deck becomes disadvantageous when the allied deck or the enemy deck is not isolated.

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

If the first effect generation unit 351 does not have a route passing only a point associated with the friendly army in the route connecting the point where the friendly deck exists and the point P ₂₂ which is the base of the friendly army, the friendly effect Generates an adverse game effect on the deck. For example, the first effect generator 351 refers to the map status table TBL104, identifying a point where the ally deck exists, a point P _22, home ally forces, the path connecting the. Then, the first effect generation unit 351 determines whether or not there is a route passing only the point associated with the friendly army by referring to the suppression status of all the points on the route for each identified route. Do.

The method by which the first effect generation 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 may be prepared to indicate whether it is possible to pass from the base location only through the point where the friendly army has controlled, and the flag may be used. In this case, the first effect generator 351, first, is connected to the point P _22, home ally forces, and determines whether or not the point where friendly forces are conquered. The first effect generator 351 is connected to the point P _22, home ally forces, and the point where friendly forces are conquered turns on the flag. Then, the first effect generation unit 351 determines whether or not the friendly army is in control and the flag is adjacent to the on point. The first effect generation unit 351 turns on the flag at a point adjacent to the point at which the friendly army is suppressing and the flag is on. Thereafter, the first effect generation unit 351 repeats the determination until the change of the flag disappears. If the flag no longer changes, the friendly army is taking control, and the point where the flag is off becomes the isolated point.

If there is no path passing only a point associated with the enemy army in the path connecting the point where the enemy deck is present and the point P ₉ which is the base of the enemy army, the second effect generation unit 352 Generates an adverse game effect on the deck. For example, the second effect generator 352 refers to the map status table TBL104, and the point where the enemy deck is present, the point P _9, home to the enemy, it identifies a path connecting. Then, the second effect generation unit 352 determines whether or not there is a route passing only a point associated with the enemy army by referring to the suppression status of all the points on the route for each identified route. Do.

The method by which the second effect generation unit 352 determines the isolated state is not limited to the above example. For example, similarly to the method described in the first effect generation unit 351, for each point of the map status table TBL104, a flag indicating whether it can go through only the point where the enemy army suppressed from the base location is prepared. You may use For example, the second effect generation unit 352 determines whether or not each point of the map status table TBL 104 is connected to the point P ₉ which is the base of the enemy army and is a point where the enemy army is overthrowing Do. The second effect generator 355 is connected to the point P _9, home to the enemy, and the point where the enemy is conquered turns on the flag. Then, the second effect generation unit 352 determines whether the enemy army is under control and the flag is adjacent to the on point. The second effect generator 352 turns on the flag at a point adjacent to the point at which the enemy army is suppressing and the flag is on. Thereafter, the second effect generation unit 351 repeats the determination until the change of the flag disappears. If the flag no longer changes, the friendly army is taking control, and the point where the flag is off becomes the isolated point.

[3-2. Function Related to Second Technology]
The second technique is mainly realized by the information acquisition unit 310, the match execution unit 330, the change unit 340, the effect generation unit 350, and the outcome determination unit 360. The information acquisition unit 310, the match execution unit 330, and the change unit 340 are the same as the contents described in the first technology.

[3-2-1. Victory judgment section]
In the present embodiment, since the plurality of points in the map M, includes the home point P ₂₂ that is associated with the previously friendly forces, the home point P ₉ in associated with previously enemy, and outcome determination unit 360 Determines the outcome of the game based on the “control status” of the map status table TBL 104 of the point P ₂₂ and the point P ₉ . When the point P ₂₂ which is the base of the allied army is associated with the “enemy army”, the victory / loss determination unit 360 determines that the enemy army is victory (the allied army's defeat) and the point P ₉ which is the home of the enemy army is If it is associated with the "Allied Forces", it will be determined that the Allied Forces victory (the enemy army's defeat).

  In the present embodiment, the outcome of the battle between the decks (competitions to be executed for each point) and the entire game by controlling the home base (hereinafter referred to as the meaning of a general “game”) are distinguished as victory or defeat. In order to make it a map game, there are two ways. It can be said that the battle between the decks is decided on a deck basis or a point basis. In other words, the deck-to-deck battle is performed to win the map game, and just because the deck-to-deck battle does not necessarily win the map game. On the other hand, since the map game is played for each map M, it can be said that the outcome is determined on a map M basis or a military basis.

3-2-2. Effect generation section]
Although the effect generation unit 350 in the second technology is the same as the contents described in the first technology, some processes are different from the first technology. For example, the meanings of “specific location”, “path”, and “adverse effect” are the same as those described in the first technology. Hereinafter, processing different from the effect generation unit 350 in the first technology will be described. The effect generation unit 350 sets the deck to a disadvantageous effect on the game based on the “suppression status” of the map status table TBL 104 of the other point associated with the point at which the deck (the ally deck, the enemy deck) exists. generate.

  The "other associated point" is another point associated with a certain point. For example, the point stored in the "adjacent point" of the map status table TBL 104 corresponds to the "associated other point". In the present embodiment, the point connected by the road corresponds to the “other point associated with”. In other words, it can be said that a point that can be reached with a minimum energy consumption point from a certain point corresponds to the “other point associated with”.

  For example, the effect generating unit 350 generates an adverse effect when the control situation at another point is a predetermined state. The predetermined situation may be a predetermined situation, for example, that the number or percentage of ally forces being controlled is equal to or greater than the reference, or the number or percentage of throttling of enemy forces is equal to or greater than the reference It is. In the present embodiment, being in a state of surrounding the home base corresponds to being in a predetermined situation. That is, the effect generation unit 350 sets a deck (a friendly deck, an enemy deck) existing at a base location on the basis of the “control status” of the map status table TBL 104 of another point corresponding to the base location. It will cause an adverse effect on the game. As in the first technique, the occurrence of the disadvantageous effect may be canceled when the control situation at another point is not a predetermined situation. The meaning of “canceling the occurrence of the adverse effect” is the same as that described in the first technology.

  In the second technique, the first effect generation unit 351 sets the game on the game based on the number of points associated with the enemy army among other points associated with the points where the ally deck exists. Generate an adverse 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 is equal to or greater than a reference, or may be associated with a point where an ally deck exists. An 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 and ratio of points associated with the enemy army increase. In this case, the first effect generator 351, as the number and percentage points associated with the enemy increases, or reduce the ability of the teammate deck are in point P _22, home ally forces, enemy deck capacity Improve Additional example, the first effect generator 351, as the number and percentage points associated with the enemy increases or decreases the HP of the ally deck are in point P ₂₂ is the home of the friend forces, enemy deck You may increase the HP.

  The second effect generation unit 352 causes the enemy deck to play an adverse effect on the game based on the number of points associated with the friendly army among other points associated with the enemy deck. generate. For example, the second effect generation unit 352 may generate an effect when the number or ratio of points associated with the friendly army is equal to or greater than a reference, or is associated with a point where an enemy deck exists. An effect may be generated when all other points are associated with the friendly army.

In addition, for example, the second effect generation unit 352 may generate an effect that becomes more disadvantageous as the number and ratio of points associated with the friendly army increase. In this case, the second effect generator 352, as the number and percentage points associated with the friendly forces increases, or reduce the ability of the enemy deck are in point P _9, home to the enemy, ally deck capacity Improve Additional example, the second effect generator 352, as the number and percentage points associated with the friendly forces increases, or decreases the HP of the enemy deck are in point P _9, home to the enemy, ally deck You may increase the HP.

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

[3-3-1. Behavior control section]
The action control unit 370 changes the game parameters (energy point, battle point) associated with the user ID based on the user's operation identified by the user ID, thereby acting on the ally deck associated with the user ID. Let "Varying game parameters" means to increase or decrease game parameters.

  The friendly deck may be capable of performing multiple types of actions. In this case, it is assumed that data indicating the relationship between the action of the friend deck and the change amount of the game parameter is stored in the data storage unit 300 in advance. Depending on the type of action, the type and amount of change of the game parameter may vary. For example, the action is movement or attack of an ally deck. 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 causes the ally deck to battle in exchange for the battle point associated with the user ID.

  For example, the behavior control unit 370 determines whether or not the energy point associated with the user ID is more than the necessary amount for moving the friend deck. When it is determined that the action control unit 370 determines that it remains, the action control unit 370 moves the ally deck by reducing the energy point by the necessary amount, and when it is determined 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 are more than the necessary amount for the teammate deck to play a match. If it is determined that the action control unit 370 determines that it remains, the action control unit 370 causes the teammate deck to play a battle by reducing the battle point by the necessary amount, and when it is determined that the game player does not remain, it does not cause the teammate deck to play the battle.

  In the present embodiment, the case where different types of parameters change in accordance with the type of action of the friendly deck is described, but only one parameter common to a plurality of types of actions may be prepared.

[3-3-2. Total Information Acquisition Department]
The accumulated information acquisition unit 380 acquires accumulated information based on the amount of change of the game parameter (energy point, battle point) changed by the action control unit 370. The "cumulative information" may be a total value of the increase or decrease of the game parameter, or may be a value obtained by substituting the increase or decrease in a predetermined equation. That is, it may be a mere total or a weighted total. Furthermore, a simple total or weighted total may be multiplied by a coefficient. From now on, cumulative information is called enemy occurrence point.

  In the present embodiment, the cumulative total information acquisition unit 380 is configured to calculate an enemy occurrence point using a random value generated by a random number. For example, the accumulated information acquisition unit 380 calculates (“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) Calculate as an enemy occurrence point. Note that the method of calculating the enemy occurrence point is not limited to this. Even in the case of using a random value, it is sufficient to calculate the enemy point using the random value as a coefficient. The enemy generation point may be calculated by substituting the energy point or the change amount of the battle point into a given formula.

3-3-3. Parameter change section]
The parameter changing unit 390 changes energy parameters and battle parameters based on the passage of time. For example, the parameter changing unit 390 recovers energy parameters and battle parameters as time passes. Further, for example, the parameter changing unit 390 restores the energy parameter and the battle parameter each time a predetermined time passes. The predetermined time may differ depending on the type of parameter, or may be common to each parameter. Further, the recovery amount of the parameter may be different depending on the type of parameter, and may be the same regardless of the type of parameter.

3-3-4. Achievement judgment part]
The achievement determination unit 400 determines whether a given game task has been achieved based on the action of the allied deck. The "game task" is a task set for the game. The achievement condition of the game task is determined in advance, and when the achievement condition is satisfied, the game task is achieved and the game is cleared. The achievement determination unit 400 determines whether the game task has been achieved by comparing data indicating the status of the game being executed (in the present embodiment, the map status table TBL 104) with the achievement condition.

In the present embodiment, it is equivalent to the game task to overwhelm the ally forces the point P ₉ is the home of the enemy. That is, meeting the conditions for winning in the map game corresponds to the game task. For this reason, the achievement determining unit 400 determines whether or not the friendly army has defeated the point P ₉ with reference to the map status table TBL 104. The achievement condition of the game task is not limited to the control of the home base, but may be to obtain many scores or to win 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 from the start of the game to the achievement of the game task.

  Further, in the present embodiment, since the enemy occurrence point is common to each user, information based on the respective change amounts of the plurality of game parameters (energy point, battle point) respectively associated with the plurality of user IDs It can be said. The enemy deck generating unit 410 generates 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 a determination unit 411. The determination unit 411 determines whether the enemy occurrence point has become equal to or higher than a reference. The enemy deck generation unit 410 determines whether the enemy generation point is equal to or more than a threshold. The threshold 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 game being executed. 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 a reference.

  The enemy deck generator 410 may generate any number of enemy decks at any point. For example, the enemy deck generation unit 410 may generate an enemy deck at any point where the enemy army is controlling, or among the points where the enemy army is suppressing, the one closest to the base of the friendly army. An enemy deck may be generated at an adjacent point. Also, 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. Furthermore, the enemy deck generation unit 410 may generate one enemy deck or may generate a plurality of enemy decks. The number of enemy deck occurrences may be determined randomly, or may be determined according to the level of the map M or the like.

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

[3-4-1. Operation reception unit]
The operation accepting unit 100 is realized mainly by the control unit 11. The operation receiving unit 100 receives various inputs from the input unit 14. For example, the operation receiving unit 100 receives an operation for selecting a point or an operation for selecting the processing object OB 20 or 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 display unit 15 to display the detailed information image G20, the battle preparation image G30, the battle image G40, and the battle result image G50 as the game image G10.

[4. Processing Executed in Game System 1]
FIGS. 24 to 31 are flowcharts showing an example of processing executed in the game system 1. The processing illustrated in FIGS. 24 to 31 is performed 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 blocks illustrated in FIG. 19 are realized by executing the processing 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 of a predetermined format including information for identifying an 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, etc. are also transmitted, and the server 30 can identify from which terminal 10 the data has been received. It has become.

  In the server 30, when the display request is received, the control unit 31 generates and transmits display data of the game image G10 based on each of the tables (FIGS. 20 to 23) stored in the storage unit 32 (S301). ). The display data may be in a predetermined format readable by the terminal 10, and may be, for example, 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 display data in the following description. In addition, in the case of generating display data, the tables of FIGS. 20 to 23 are also referred to, and the same applies to the following description. The contents of the map status table TBL 104 may be transmitted together with the display data of the game image G10.

  In the terminal 10, when the display data is received, the control unit 11 causes the display unit 15 to display the game image G10 (FIG. 3) (S103). The control unit 11 specifies the user's operation based on the signal from the input unit 14 (S105). Here, it is assumed that either a scroll operation of the map display area A10 or an operation of selecting a 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). Although publicly known processing may be executed for the scroll control itself, for example, it is assumed that display range information indicating a range displayed on the map display area A10 in 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 in accordance with the scroll operation.

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

  In the server 30, when the display request is received, the control unit 31 controls the user's friendly deck (that is, the friendly deck associated with the user ID received together with the display request) based on the friendly army information table TBL102. It is determined whether or not the point where the user is present is selected (S303). In S303, the control unit 31 compares the point where the user's deck stored in the friendly army information table TBL 102 is with the point selected by the user.

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

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

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

  In the server 30, upon receiving the movement request, 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 2 pt if the point where the ally deck is located and the point which is the movement destination are connected by the road, and 10 pt otherwise. Note 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 the form of a formula or in the form of a table.

  The control unit 31 refers to the user information table TBL101 and determines whether the current value of the energy point of the user is equal to or more than the necessary amount determined in S309 (S311). If it is determined that the amount is not the necessary amount or more (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, since the energy point of the user is insufficient, the movement of the friendly deck is not performed.

  On the other hand, when it is determined that the amount is equal to or more than the necessary amount (S311; N), the control unit 31 refers to the map status table TBL104 and moves the friendly deck (S315). In S315, the control unit 31 updates the “point” of the friend deck of the user who made the movement request in the map status table TBL 104 to the point selected by the user in S315. The control unit 31 refers to the user information table TBL101, reduces the energy point of the user by the necessary amount (S317), proceeds to the processing of S351 described later, and generates enemy generation points based on the energy point reduction amount in S317. Calculation is performed. When the energy point is decreased, the control unit 31 may record the decreased amount in the storage unit 32 as a history.

  When the user selects the processing object OB21 in S113 (S113; OB21), the process returns to S101. In this case, the game image G10 based on the latest map situation 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 moves to FIG. 26, and the control unit 31 connects by road based on the map status table TBL104. It is determined whether the friendly army is taking control of the point (S319). When the friendly army is controlling the point connected by the route R (S319; Y), the control unit 31 generates and transmits display data of the detailed information image G20 (FIG. 5) including the processing objects OB21 and OB22. (S321).

  In the terminal 10, when the display data is received, the control unit 11 causes the display unit 15 to display the detailed information image G20 (S117). The control unit 11 specifies the user's operation based on the signal from the input unit 14 (S119). Here, it is assumed that an operation to select one of the processing objects OB 21 and 22 in the map display area A10 can be performed. As shown in FIG. 26, the following 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 friendly army is not suppressing the points connected by the road (S; Y), the process moves to FIG. 27, and the control unit 31 displays the detailed information image G20 including the processing object OB21 (FIG. 12). Is generated and transmitted (S333).

  In the terminal 10, when the display data is received, the control unit 11 causes the display unit 15 to display the detailed information image G20 (S123). The control unit 11 determines whether the processing object OB 21 is selected based on the signal from the input unit 14 (S125). If it is determined that the processing object OB21 is selected (S125; Y), the processing returns to S101.

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

  In the terminal 10, when the display data is received, the control unit 11 causes the display unit 15 to display the detailed information image G20 (S127). The control unit 11 specifies the user's operation based on the signal from the input unit 14 (S129). Here, it is assumed that an operation to select one of the processing objects OB 21 and 23 can be performed. When the user selects the processing object OB21 (S129; OB21), the processing returns to S101. In this case, the match is not executed.

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

  In the server 30, upon receiving the battle execution request, the control unit 31 acquires the necessary 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 advance in the storage unit 32. Here, 1 pt is used, but the necessary amount may be different depending on whether the friendly army or the enemy army is suppressing the point where the battle is to be performed.

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

FIG. 30 is a diagram showing the details of the battle process performed in S345. As shown in FIG. 30, the control unit 31 refers to the map status table TBL 104 and determines whether the point at which the battle is to be performed is a home base of a friendly army or an enemy army (S3451). If it is determined not to be the home base (S3451; N), the control unit 31 refers to the suppression status of the point where the battle is to be performed (S3453). If the match is overwhelm the enemy a point is performed (S3453; enemy), the control unit 31, from the point P _9, home to the enemy, to the point where the competition takes place, and suppression enemy troops It is judged whether it can move only through a certain point (S3455). The determination method in S3455 is as described above. That is, the control unit 31 refers to the map status table TBL104, from the point P _9, home to the enemy to identify a point on the route to the point where competition takes place, the suppression status of the specified point It will be referred to.

  If it can not move (S3455; N), the control unit 31 reduces the capability of the enemy deck (S3457). In S3457, the control unit 31 reduces the attack power and defense power of the opponent deck, which is the opponent, by a predetermined value. The reduction amount of the enemy deck's ability may be a fixed value or a variable value. On the other hand, when it is possible to move (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, if the match is Suppression teammate forces the point is performed (S3453; friendly forces), the control unit 31, from the point _{P 22,} home ally forces, to the point where the competition takes place, ally It is determined whether it is possible to move through only the point where the army is suppressing (S3459).

  When it is not possible to move (S3459; N), the control unit 31 reduces the ability of the friendly deck (S3461). In S3461, the control unit 31 reduces the attack power and the defense power of the allied deck by a predetermined value. The amount of decrease in the ability of the allied deck may be a fixed value or a variable value. On the other hand, when it is possible to move (S3459; N), the process of S3461 is not executed. In this case, the friendly deck will not be disadvantageous.

On the other hand, in S3451, if it is the base of the enemy army (S3451: enemy base), the process moves to FIG. 31, and the control unit 31 refers to the control status of the point connected with the base of the enemy army by way (S3463). In S3463, the control unit 31 refers to the map status table TBL104, reference will be made to the suppression status point _{P 5, P 8, P 10} , P 14.

  If the friendly army controls all points connected to the enemy army's base by the way (S3463: All friendly army), the control unit 31 reduces the ability of the enemy deck at the headquarters (S3465). The process of S3465 is the same as that of S3457. The capacity reduction amount may be the same as or different from S3457. On the other hand, if there is an enemy army overthrowing at a point connected to the base of the enemy army by way R (S3463: enemy army), the process 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, if it is the base of the friendly army (S3451: friendly home base), the process moves to FIG. 31 and the control unit 31 refers to the control situation at the point connected with the friendly military base by the road (S3467). ). In S3467, the control unit 31 refers to the map status table TBL104, reference will be made to the suppression status point _{P 16, P 23, P 27} .

  If the enemy army controls all points connected to the base of the friendly army on the road (S3467; all enemy forces), the control unit 31 reduces the ability of the friendly deck at the base (S3469). The process of S3469 is the same as that of S3461. The reduction amount of the capability may be the same as or different from that of S3461. On the other hand, if there is an area where the friendly army is taking control at a point connected to the friendly army's base and the road (S3467; friendly army), the processing of S3469 is not executed.

  The control unit 31 starts the battle based on the allied deck and the enemy deck, and determines the battle result (S3471). In S3471, when the ability is lowered in any of S3457, S3461, S3465, and S3469, the control unit 31 executes the battle based on the lowered ability. The battle processing itself is as described above, and for example, the control unit 31 executes the battle until either one is eliminated based on the parameters of the allied deck and the parameters of the enemy deck. In S3471, the control unit 31 changes the army that controls the battle point, based on the battle result.

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

  Referring back to FIG. 29, the control unit 31 refers to the match result determined in S3471, and determines whether the home location is suppressed (S347). When it is not determined that the base location is 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).

  In the terminal 10, when the display data is received, the control unit 11 causes the display unit 15 to display the battle result image G50 (S135). The control unit 11 determines whether the processing object OB 50 is selected based on the signal from the input unit 14 (S137). If it is determined that the processing object OB50 is selected (S137; Y), the processing returns to S101.

  On the other hand, in the server 30, the control unit 31 refers to the friendly army information table TBL102, and calculates an enemy occurrence point which is a total value of the users belonging to the team (S351). As described above, since the history of the energy points consumed by each user and the battle points is recorded in the storage unit 32, the control unit 31 uses the energy points and battle points consumed by each member of the team in the past. , S317, S331, and S3473, by substituting the energy point or the battle point consumed in the given equation, the enemy occurrence point will be calculated.

  The control unit 31 determines whether the enemy occurrence point has become equal to or more than the threshold (S353). The threshold may be stored in advance in the storage unit 32. The threshold value of the enemy occurrence 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 threshold may be set higher as the level of the map M is higher, or the threshold may be set higher as the number of points or roads is larger. Also, the threshold may be set according to the number of users participating in the game or the number of users belonging to the team. In this case, the threshold may be set higher as the number of users participating in the game or the number of users belonging to the team increases.

If it is determined that the enemy occurrence point has become equal to or greater than the threshold (S353; Y), the control unit 31 refers to the enemy army information table TBL103, generates an enemy deck in the map M (S355), and selects the enemy occurrence point. It returns to 0 (S357). In S355, the control unit 31 determines the number of occurrences and the occurrence position of the enemy deck. The number of occurrences may be determined randomly, or may be calculated according to the level of the map M, or the number of points or roads. Generation position, out of the point where the enemy is conquered, it may be generated in the place closest to the point P ₂₂ is the home of the friendly forces, are connected by a point and the road that enemy forces have been conquered It may be generated at a point where a neutral or friendly army is overthrowing.

On the other hand, when it is determined in S347 that the base location is determined to be suppressed (S347; Y), the present process ends. If the ally forces the point P ₉ is the home of the enemy army conquered become a victory of the user side, the defeat of the user side if the point P ₂₂ is the home of the ally army enemy army conquered.

  Although the description is omitted in the above process flow, when an enemy deck is generated at a point where the friendly army is suppressing the control in S355, the control unit 31 stores the time when the enemy deck is generated. It is recorded in the section 32, and it is determined whether or not the allied deck has won the enemy deck within a fixed period (for example, 10 minutes) from that point. The battle process in this case may be the same as S345. When the ally deck has won the enemy deck within a predetermined period, the control unit 31 deletes data corresponding to the enemy deck from the enemy army information table TBL103. On the other hand, when the ally deck can not win the enemy deck within a predetermined period, the control unit 31 updates the map status table TBL 104, assuming that the enemy army has suppressed the point where the enemy deck is generated. Thereafter, the process of S347 may be executed to determine whether the home location has been suppressed.

[Summary of the first technology]
According to the first technique of the game system 1 described above, the ally deck and the enemy deck are selected based on the control situation of the point on the route connecting the ally deck and the enemy deck and the specific point. Each user is aware of the control situation of the points on the route, not just the positions where the friendly decks or enemy decks exist, so that each user will not be disadvantaged or the enemy will be disadvantaged because it will be disadvantageous. Therefore, the strategicity of the game can be enhanced. Also, for example, even if there is a user with a weak ally deck among a plurality of users, the user is not required to rely solely on the strength of the ally deck, since the enemy is disadvantageous due to the association information of points on the route. Be strategically considered, and even weak users can be active.

  In addition, the control status of the point is changed based on the result of the battle executed for each of the plurality of points, thereby affecting the result of the battle of the point against changing the suppression status of a certain point. The game can be made more strategic.

  In addition, since the ally decks and enemy decks that can participate in the battle to be executed for each point are specified based on the points where each ally deck and enemy decks are present, it is considered what kind of arrangement should be made for the battle. The game can be made more strategic.

  Also, since each point is associated with the victory in the match, it is possible to give motivation to win in the match related to each point. Further, since the condition for associating the points is the victory of the match, the user can easily understand the condition for associating the points.

  In addition, when there is no route that passes only the point where the friendly army controls the route between the point where the friendly deck operated by the user and the specific point such as the base of the friendly army, the friendly deck is disadvantageous. By generating the following effects, for example, it is possible to express in the game a situation that would be disadvantageous because the supply to the allied deck was cut off. Similarly, if there is no path passing only at the point where the enemy army suppressed the route between the point where the enemy deck is located and the specific point such as the base of the enemy army, the effect that the enemy deck becomes disadvantageous is By generating the game, for example, it is possible to express a situation in the game that is disadvantageous because the supply to the enemy deck is cut off.

  Also, by changing the parameters of the friendly deck and the enemy deck, for example, it can be expressed that it is disadvantageous because the supply to the friendly deck and the enemy deck is cut off.

  In addition, since the situation is not disadvantageous if the isolation state is eliminated, the user can play the game in order to eliminate the situation in which they are disadvantaged as quickly as possible, or keep the situation in which the opponent is disadvantaged as much as possible. Because you play or, you can further enhance the strategy of the game.

[Summary of second technology]
According to the second technique of the game system 1 described above, the ally deck and the enemy deck become disadvantageous based on the control situation of the other point associated with the ally deck and the spot where the enemy deck exists. The strategy of the game is that each user is aware of the control situation at other points, not just at the point where the friendly deck or enemy deck exists, so that they are not at a disadvantage or that the enemy is at a disadvantage. Can be enhanced. Also, for example, even if there is a user having a weak ally deck or enemy deck among a plurality of users, the enemy is disadvantageous due to the suppression situation of the other point corresponding to the spot where the opponent ally deck or enemy deck exists. As a result, the user can strategically think of the game without relying solely on the strength of the allied deck, and it becomes possible for even weak users to be active.

  In addition, the control situation of a point adjacent to a specific point may cause the allied deck or enemy deck existing at a specific point to be disadvantageous, so each point can have a change in importance, so Strategicity can be further enhanced.

  Moreover, the strategic point of a game can be improved more by making it not only the specific point which becomes a factor which the outcome of a game decides but the other point matched with the said specific point. Furthermore, for example, even if there are users who have weak ally decks among multiple users, they can play an active role by making the enemy disadvantageous, so that weak users can play an active role even in important scenes that determine the outcome of the game. it can.

  In addition, since the control status of the point is changed based on the result of the battle executed for each of the plurality of points, changing the control status of a certain point affects the result of the match of the position Can improve the strategicity of the game.

  Also, since each point is associated with the victory in the match, it is possible to give motivation to win in the match related to each point. Further, since the condition for associating the points is the victory of the match, the user can easily understand the condition for associating the points.

  In addition, since an adverse effect occurs based on the number of points associated with the user side or the opponent side, processing such as making the position more disadvantageous as the number of points is larger 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.

  Also, by changing the parameters of the friendly deck and the enemy deck, for example, it can be expressed that it is disadvantageous because the friendly deck and the enemy deck are isolated.

[Summary of the third technology]
According to the third technology of the game system 1 described above, since the enemy deck is generated based on the energy generation point which changes according to the action of the ally deck or the enemy deck or the enemy generation point calculated from the battle points Since it is possible to prevent the enemy deck from being generated when there is no change in energy points or battle points, etc., it is possible to maintain the game balance when generating the enemy deck. That is, if enemy decks are generated one after another despite the fact that the friendly decks are not operating, it is possible that the enemy decks will be lost without being made up by a large number of enemy decks, Since the enemy generation point is acquired based on the action of the ally deck, the enemy deck can be generated in accordance with the user's activity amount and activity time, and the game balance can be maintained.

  Further, even when 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, a common enemy occurrence point is prepared for a plurality of users, and the action of each ally deck can be made to affect the common enemy occurrence point to generate an enemy deck, so the game play between the users is mutually influenced. It is easy to give As a result, more varied games can be provided. Further, even in the game play by a plurality of users, the enemy deck can be generated more appropriately because the enemy generation point is used based on the amount of change changed by the action of each of the plurality of friendly decks.

  Also, in a game in which a plurality of users belonging to a team and an opponent play battles, an enemy deck is generated based on the enemy occurrence points to mutually affect the game play between the users so that the users belonging to the same team can Can give more opportunities for communication. In addition, since users who know each other can participate in the game, it is possible to advance the game while discussing in advance strategies and the like.

  In addition, when it is determined that the enemy occurrence point is equal to or more than the reference, the enemy deck can be generated, so that the reference for generating the enemy deck can be set in advance, and the game balance can be easily maintained.

  Also, by changing energy points and battle points based on the passage of time, the strategicity of the game can be enhanced. For example, changing energy points or battle points based on the passage of time is likely to be relatively long from the start of the game to the achievement of the game task, so even in such a case, it is appropriate. Enemy deck can be generated at any time.

[5. Modified example]
The present invention is not limited to the embodiments described above. It can change suitably, in the range which does not deviate from the meaning of the present invention.

[5-1. Modification of the first technology]
For example, in the embodiment, a game of a plurality of users vs. computers belonging to a team is exemplified, but a game of a plurality of users vs. a plurality of users may be employed. Furthermore, a plurality of users do not have to belong to the same team, as long as they participate in the same map M game. Therefore, users who participate in the game may be matched each time the game is executed.

  Also, for example, although the case has been described where the ally deck is moved to the point where the enemy deck is located to execute the battle with the enemy deck, it may be possible to attack from the point where the enemy deck is located and the road , You may be able to attack from a distance from two or more points away. 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 where the enemy army is suppressing, if all of the multiple enemy decks are won, the friendly army can suppress the point. Similarly, if there is a plurality of ally decks at a point where the ally forces are taking control, the point is suppressed by the enemy forces if all of the plurality of ally decks are defeated.

  Also, for example, the winning condition of the match may not be to control the home base. For example, a player who has acquired more scores in a battle or the like within a predetermined time may be set as a victory.

Also, for example, a state in which the enemy army can not go without passing through a point controlled by the enemy army may correspond to the isolated state of the ally deck in the route connecting the ally deck and the point P ₂₂ which is the base of the ally army. . In other words, the enemy deck, a point P ₉ is the home of the enemy forces, the path that connects the state can not go in without passing through the point at which the allies took control may also be equivalent to the isolated state of the enemy deck.

  Also, for example, as a disadvantageous effect generated by the effect generation unit 350, the action of the friendly deck or the enemy deck may be limited. For example, the effect generating unit 350 restricts the teammate deck or the enemy deck not to perform a predetermined action (such as movement or battle). For example, the effect generation unit 350 may limit the number of times that the player can play a match in a predetermined period. For example, the action restriction may restrict the action by increasing the parameters consumed when the friend deck or the enemy deck acts.

5-2. Modification of second technology]
Further, for example, in the second technology, the first effect generation unit 351 is one of the points P ₅ , P ₈ , P ₁₀ , and P ₁₄ connected by a road to the point P ₉ that is the base of the enemy army. An adverse effect may be generated on the enemy deck based on the ratio between the number the friendly army is controlling and the number the enemy forces are suppressing. Similarly, the second effect generation unit 352 is a point P ₁₆ , a point P ₂₃ , and a point P ₂₇ connected by a road to the point P ₂₂ , which is the base of the friendly army, and the number and enemies of the friendly army controlling. An adverse effect may be generated on the friendly deck based on the ratio with the number the army is suppressing.

  Also, the specific point is not limited to the base of friendly forces and enemy forces. For example, when there are points where scores can be obtained by moving the friendly deck or points where parameters of the friendly deck are restored, these points may correspond to specific points.

[5-3. Modification of the third technology]
FIG. 32 is a functional block diagram of a modification relating to the third technique. As shown in FIG. 32, in the present modification, the server 30 includes a cumulative information notification unit 420. The accumulated information notification unit 420 is mainly implemented by the control unit 31.

  (3-1) For example, the accumulated information notifying unit 420 notifies the user of the enemy occurrence point acquired by the accumulated information acquiring unit 380. The accumulated information notification unit 420 displays an image indicating the numerical value of the enemy occurrence point or displays an image indicating the size of the enemy occurrence point. The image indicating the size of the enemy generation point may be an image that becomes larger as the enemy generation point is higher, or may be an image whose luminance is higher as the enemy generation point is higher. In addition, the association between the size of the enemy occurrence point and the color of the image may be stored in the data storage unit 300, and the enemy occurrence point may be notified by the color of the image. The accumulated information notification unit 420 may notify an enemy occurrence point by an arbitrary image, for example, may notify an enemy occurrence point 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 which is a condition for generating the enemy deck, for example, while thinking how much the enemy deck will be generated if the ally deck is made to act Since the game can be played, more strategic games 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, but the enemy deck generation unit 410 finally generates the enemy regardless of the enemy generation point. An enemy deck may be newly generated when a predetermined time has elapsed since the generation of the deck.

  Further, for example, when the enemy occurrence point is equal to or more than the threshold and the enemy deck is generated, the enemy deck generation unit 410 may not generate an enemy deck anew for a predetermined time. In this case, even if the enemy generation point becomes equal to or more than the threshold again during the predetermined time, the enemy deck generation unit 410 does not generate the enemy deck but generates the enemy deck after a predetermined time has elapsed.

  Further, for example, in the embodiment, the case has been described where a plurality of users have common enemy occurrence points, but enemy generation points may be prepared for each user. In this case, the enemy generation point of a certain user changes according to the action of the friendly deck of the user. The enemy deck generation unit 410 may newly generate an enemy deck when the enemy generation point of any user reaches or exceeds the threshold.

5-4. Other Modifications]
For example, as shown in FIG. 2 etc., although the case where each point was arrange | positioned at the grid | lattice form was demonstrated, arrangement | positionings other than grid | lattice form may be sufficient. Each point may be disposed at any position on a two-dimensional plane or in a three-dimensional space. For example, as shown in FIG. 2 etc., the X and Y coordinates of each point may not be uniform, and the X and Y coordinates of each point may be disjoint. Similarly, the road connecting the points may not be straight, but may be a curved road.

  Also, for example, the energy point consumed when the team deck moves may be changed according to the control situation of the destination point. For example, when an ally deck moves to a point where the ally forces are taking control, it consumes more than when the ally deck moves to the point where the enemy forces are taking over or when the ally deck moves to the neutral point. Energy points may be reduced.

  Also, for example, although the embodiment has described the case where the enemy deck does not move, the enemy deck may move under a predetermined condition. Also, for example, there may be points for reducing energy point consumption, and points for giving more scores. These points may correspond to the specific points described in the embodiment.

  Further, for example, in the game system 1, the case where the main functions are realized by the server 30 has been described, but may be realized on the terminal 10 side. In this case, the terminal 10 corresponds to a game control device, the data storage unit 300 is realized mainly by the storage unit 12, and the other respective functions are realized mainly by the control unit 11. Furthermore, in this case, each terminal 10 may transmit and receive data by P2P without the presence of the server 30. Furthermore, the functions described above may be shared by the terminal 10 and the server 30.

  For example, when the data storage unit 300 is realized by the server 30 and each other function is realized by the terminal 10, each data such as an enemy occurrence point acquired by the terminal 10 is transmitted to the server 30, and the data is a server It is stored in the 30 data storage units 300. Further, for example, when the data storage unit 300 is realized by the terminal 10, it is assumed that transmission and reception of data stored in the data storage unit 300 are performed between the terminals 10 and consistency is obtained.

  Also, for example, although an example in which a battle is performed based on a deck made up of game cards has been described, a game system for executing a game in which a battle is performed based on various game objects such as game items and game characters The invention can be applied.

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

[6-1. Invention according to the first technology]
1-1) A game system (1) according to an aspect of the present invention includes at least one of a plurality of first objects operated by each of a plurality of users and one or more second objects as opponents. A game system (1) for executing a movable game between each of a plurality of points and another point associated with the point, wherein each of the plurality of points and the plurality of points are Information acquisition means for acquiring association information between first identification information for identifying the first object of the second identification information and second identification information for identifying the one or more second objects ( 310) and changing means (340) for changing the association information based on a predetermined condition, the point on the path connecting the point where the object exists, and the specific point Based on the marked information, the effect generating means for generating a disadvantageous effect on the game to the object (350), characterized in that it comprises a.

  1-8) A game control apparatus (10, 30) according to an aspect of the present invention is a game control device (10, 30) comprising: a plurality of first objects operated by each of a plurality of users; and one or more second objects as opponents At least one of the plurality of points is a game control device (10, 30) that executes a game movable between the respective points and another point associated with the point, the plurality of points Association information between each of the first identification information for identifying the plurality of first objects and any one of second identification information for identifying the one or more second objects; On a route connecting information acquiring means (310) to be acquired, changing means (340) for changing the association information based on a predetermined condition, the point where an object exists, and the specific point Based on the association information of the serial point to the effect generating means for generating a disadvantageous effect on the game to the object (350), characterized in that it comprises a.

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

  1-10) An information storage medium according to an aspect of the present invention is a computer readable information storage medium storing the above program.

  According to the present invention, since each game object is disadvantaged based on the association information of the points on the movable route of the point where each game object exists and the specific point, each user can In order not to be disadvantageous, or to make the enemy disadvantageous, not only the location where the game object is present, but also the association information of points on the route, it is possible to enhance the strategicity of the game. Also, for example, even if there are users whose game object is weak among a plurality of users, the user is not required to rely solely on the strength of the game object because the enemy is disadvantageous due to the association information of points on the route. Be strategically considered, and even weak users can be active.

  1-2) In one aspect of the present invention, the game system (1) further includes battle execution means (330) for executing a battle at each of the plurality of points, and the change means (340) performs the battle execution. The association information is changed based on the result of the battle executed by the means (330).

  According to the invention described in 1-2), the association information of the points is changed based on the result of the battle executed for each of a plurality of points. The game's strategic nature can be further enhanced because it can influence the result of the point match.

  1-3) In one aspect of the present invention, the game system (1) is provided with an identification unit (320) for identifying the first object and the second object capable of participating in the battle for each of the plurality of points. The game execution means (330) may further include executing the game for each of the plurality of points based on the first object and the second object identified by the identification means (320). It features.

  According to the invention described in 1-3), the objects that can participate in the battle to be executed for each point in the game space are specified based on the points of each object, so if the arrangement is made, the battle is performed The game can be made more strategic because it can be thought good.

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

  According to the invention described in 1-4), since each point is associated with the winning in the match, it is possible to give motivation to win the match in relation to each point. Further, since the condition for associating the points is the victory of the match, the user can easily understand the condition for associating the points.

  1-5) In one aspect of the present invention, the effect generating means (350) is associated with the first identification information in a route connecting the point where the first object is present and the specific point. Means (351) for causing the first object to generate an adverse effect on the game when there is no route passing only through the point, the point where the second object is present, and the specific point; Means for causing the second object to generate the adverse effect on the game (352) if there is no path passing only through the point associated with the two identification information in the path connecting It is characterized by

  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 and the specific point, the game object By generating an effect that is disadvantageous, for example, it is possible to express a situation in which the game object is disadvantageous because the supply to the game object is cut off. For example, by generating an effect that the game object becomes disadvantageous when there is no point associated with the second identification information on the route of the opponent game object and the specific point, for example, It is possible to express in the game a situation that would be disadvantageous due to the supply of the game object being turned 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 a parameter associated with the object.

  According to the invention described in 1-6), by changing the parameter of an object, for example, it is possible to make a representation that has become disadvantageous because the supply to the object is interrupted.

  1-7) In one aspect of the present invention, when the association information of the point on the route satisfies a predetermined condition, the effect generating unit (350) generates the adverse effect, and the predetermined condition Is canceled, the occurrence of the adverse effect is cancelled.

  According to the invention described in 1-7), the user plays the game in order to eliminate the situation in which the users are disadvantaged as soon as possible, or the game is continued in order to continue the condition in which the opponent is disadvantaged as much as possible. As you play, you can further improve the strategy of the game.

6-2. Invention according to second technology]
2-1) A game system (1) according to an aspect of the present invention includes at least one of a plurality of first objects operated by each of a plurality of users and one or more second objects as opponents. A game system (1) for executing a movable game between each of a plurality of points and another point associated with the point, wherein each of the plurality of points and the plurality of points are Information acquisition means for acquiring association information between first identification information for identifying the first object of the second identification information and second identification information for identifying the one or more second objects ( 310) and changing means (340) for changing the association information based on a predetermined condition, and based on the association information of the other points associated with the point where the object exists. An effective generation means (350) for generating a disadvantageous effect on the game to the object, characterized in that it comprises a.

  2-8) The game control device (10, 30) according to an aspect of the present invention is a game control device (10, 30) comprising: a plurality of first objects operated by each of a plurality of users; At least one of the plurality of points is a game control device (10, 30) that executes a game movable between the respective points and another point associated with the point, the plurality of points Association information between each of the first identification information for identifying the plurality of first objects and any one of second identification information for identifying the one or more second objects; The association of the other point associated with the point where the object exists, and the change means (340) which changes the association information based on a predetermined condition, and the information acquisition means (310) to acquire Based on the distribution, the effect generating means for generating a disadvantageous effect on the game to the object (350), characterized in that it comprises a.

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

  2-10) An information storage medium according to an aspect of the present invention is a computer readable information storage medium storing the above program.

  According to the present invention, since the game object becomes disadvantageous based on the association information of the other points associated with the point where each game object exists, each user is prevented from being disadvantaged or It is possible to improve the strategicity of the game because the enemy is not only at a point where the game object is present, but also because it is aware of the association information of other points. Also, for example, even if there is a user whose game object is weak among a plurality of users, the enemy is disadvantaged by the association information of other points associated with the point where the opponent game object is present. Can be considered strategically without relying only on the strength of the game object, allowing even weak users to be active.

  2-2) In one aspect of the present invention, the effect generation means (350) is configured to associate an object present at a specific point with other point information associated with the specific point, Generating an adverse effect on the game.

  According to the invention described in 2-2), the user object or the opponent object existing at a specific point may be disadvantageous depending on the association status of the points adjacent to the specific point. The ability to make changes can further enhance the strategic nature of the game.

  2-3) In one aspect of the present invention, the plurality of points are a first point specified in advance associated with the first identification information, and a second point associated in advance with the second identification information. Means (360) for determining the outcome of the game based on the association information of the first specific point and the second specific point, the game system (1) including a specific point; Further comprising

  According to the invention described in 2-3), the strategicity of the game can be realized by not only the specific point that is the factor that determines the outcome of the game, but also the other point associated with the specific point. Can be raised more. Furthermore, even if there are users who have weak game objects among multiple users, for example, they can play an active role by making the enemy disadvantageous, so that weak users can play an active role even in important scenes that determine the outcome of the game. it can.

  2-4) In one aspect of the present invention, the game system (1) further includes match execution means (330) for playing a match for each of the plurality of points, and the change means (340) performs the match execution. The association information is changed based on the result of the battle executed by the means (330).

  According to the invention described in 2-4), since the association information of the points is changed based on the result of the battle executed for each of the plurality of points, it is possible to change the association information of a certain point. The game's strategic nature can be further enhanced because it can influence the result of the point match.

  2-5) In one aspect of the present invention, the changing unit (340) changes the association information on the basis of a winner of the match performed by the match execution unit (330). I assume.

  According to the invention described in 2-5), since each point is associated with the winning in the match, it is possible to give motivation to win the match in relation to each point. Further, since the condition for associating the points is the victory of the match, the user can easily understand the condition for associating the points.

  2-6) In one aspect of the present invention, the effect generating means (350) is associated with the second identification information among other points associated with the point where the first object exists. The means (351) for causing the first object to generate an adverse effect on the game based on the number of points, and the other points among the other points associated with the points where the second object exists And at least one of: means (352) for causing the second object to generate an adverse effect on the game based on the number of points associated with the first identification information.

  According to the invention described in 2-6), an adverse effect occurs based on the number of points associated with the user side or the opponent side, so that the processing is more disadvantageous as the number of the points increases. Can be performed. 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 a parameter associated with the object.

  According to the invention described in 2-7), by changing the parameter of an object, for example, it is possible to make a representation that is disadvantageous because the object is isolated.

6-3. Invention according to third technology]
3-1) A game system (1) according to an aspect of the present invention comprises means (310) for acquiring the association stored by storage means (300) for storing association between user identification information and a user object. Behavior control means (370) for causing the user object associated with the user identification information to act by changing the game parameter associated with the user identification information based on the user's operation identified by the user identification information An accumulative information acquiring unit (310) acquiring accumulative information based on the change amount of the game parameter changed by the action control unit (370), and an opponent object as an opponent of the user based on the accumulative information An opponent object generating means (410) for generating And butterflies.

  3-8) A user object associated with the user identification information by changing a game parameter associated with the user identification information for identifying the user based on an operation of the user according to one aspect of the present invention Action control means (370) for causing the user to act, cumulative information acquisition means (310) for obtaining cumulative information based on the change amount of the game parameter changed by the behavior control means (370), and based on the cumulative information An opponent object generating means (410) for generating an opponent object as an opponent of the user.

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

  3-10) An information storage medium according to an aspect of the present invention is a computer readable information storage medium storing the above program.

  According to the present invention, since the opponent object is generated based on the accumulated information of game parameters which changes according to the action of the user object, the opponent is not moved when the user object does not act and the game parameter is not changed. Since it is possible to prevent the generation of an object, etc., it is possible to maintain the game balance in the case of generating an opponent's object. That is, even if the user object does not act, when the opponent object is generated one after another, it is possible that the user object has nothing to do with the generated opponent object. However, since the accumulated information is acquired based on the action of the user object, it is possible to generate the opponent object according to the amount of activity and the 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 means (400) for determining whether a given game task has been achieved based on the action of the user object, The opponent object generating means (410) is characterized in that the opponent object is generated based on the accumulated information from the start of the game to the achievement of the game task. .

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

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

  According to the invention described in 3-3), it is considered, for example, how long the user character is made to act to generate the opponent object by notifying the user of the accumulated information which is the condition for generating the opponent object. Since the game can be played while being played, a more strategic game can be provided.

  3-4) In one aspect of the present invention, the accumulative information is information based on the variation of each of the plurality of game parameters respectively associated with the plurality of pieces of user identification information, and 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 pieces of user identification information.

  According to the invention described in 3-4), it is possible to prepare common accumulated information for a plurality of users, and to cause the opponent object to be generated by affecting the action of each user character on the common accumulated information. , It can be made easy to mutually influence the game play of users. As a result, more varied games can be provided. Further, even with game play by a plurality of users, it is possible to generate a match object more appropriately because cumulative information based on the amount of change changed by the action of each of the plurality of user objects is used.

  3-5) In one aspect of the present invention, the opponent object generating means (410) generates the opponent object as an opponent of a plurality of the users identified by each of a plurality of pieces of user identification information, Each of the plurality of pieces of user identification information and group identification information for identifying a group of the plurality of users 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 a match, an opponent object is generated based on the accumulated information to mutually affect the game play between the users. By giving it, the user who belongs to the same user group can be given the opportunity to communicate more. In addition, since users who know each other can participate in the game, it is possible to advance the game while discussing in advance strategies and the like.

  3-6) In one aspect of the present invention, the opponent object generating means (410) includes means (411) for determining whether or not the cumulative total information exceeds a reference, and the cumulative total is above the reference And generating the opponent object when it is determined that it has become.

  According to the invention described in 3-6), when it is determined that the opponent object is generated when it is determined that the accumulated information becomes equal to or more than the reference, the reference for generating the opponent object can be set in advance. , It becomes easy to keep the game balance.

  3-7) In one aspect of the present invention, the game system (1) is characterized by further including means (390) for changing the game parameter based on the passage of time.

  According to the invention described in 3-7), it is possible to enhance the strategicity of the game by changing the game parameters based on the passage of time. For example, if game parameters are changed based on the passage of time, the time from the start of the game to the achievement of the game task is likely to be relatively long. An opponent object can be generated.

  1 game system, N network, 10 terminals, 11 control units, 12 storage units, 13 communication units, 14 input units, 15 display units, 30 servers, 31 control units, 32 storage units, 33 communication units, D friend 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 identification unit, 330 match execution unit, 340 change unit, 350 effect generation unit, 360 win / loss determination unit, 370 action control unit, 380 Cumulative information acquisition part, 390 parameter change part, 400 achievements Department, 410 enemy deck generating unit, 420 cumulative information notification unit, TBL101 user information table, TBL102 ally military information table, TBL103 enemy information table, TBL104 map status table.

Claims (9)

Means for acquiring the association stored by the storage means for storing the association between the user identification information and the user object;
Action control means for causing a user object associated with the user identification information to act by consuming a game parameter associated with the user identification information based on the user's operation identified by the user identification information;
Recovery means for recovering the game parameters;
Cumulative information acquisition means for acquiring cumulative information based on the consumption amount of the game parameter consumed by the action control means for causing the user object to act, the cumulative information not changing even when the game parameter is recovered ;
Opposite object generating means for generating an opponent object as an opponent of the user based on the accumulated information;
A game system characterized by including. The game system further includes means for determining whether a given game task has been achieved based on the action of the user object,
The opponent object generating means from Gate beam is started until the game task is achieved, on the basis of the cumulative information, to generate the opponent object,
The game system according to claim 1, characterized in that: The game system is a means for notifying the user of the accumulated information acquired by the accumulated information acquiring means.
The game system according to claim 1, further comprising: The accumulated information is information based on a total value of consumption of each of a plurality of game parameters associated with a plurality of the user identification information, respectively.
The opponent object generating means generates the opponent object as an opponent of a plurality of the users identified by each of the plurality of pieces of user identification information.
The game system according to any one of claims 1 to 3, characterized in that. The opponent object generating means generates the opponent object as an opponent of a plurality of the users identified by each of a plurality of pieces of user identification information,
Each of the plurality of user identification information and group identification information for identifying a group of the plurality of users are associated in advance,
The game system according to any one of claims 1 to 4, characterized in that. The opponent object generating means includes means for determining whether or not the accumulated information exceeds a standard, and generates the opponent object when it is determined that the accumulated information exceeds the standard.
The game system according to any one of claims 1 to 5, characterized in that. It said recovery means based on the time elapsed, Ru to restore the game parameter,
The game system according to any one of claims 1 to 6, characterized in that: Action control means for causing a user object associated with the user identification information to act by consuming a game parameter associated with the user identification information for identifying the user based on the user's operation;
Recovery means for recovering the game parameters;
Cumulative information acquisition means for acquiring cumulative information based on the consumption amount of the game parameter consumed by the action control means for causing the user object to act, the cumulative information not changing even when the game parameter is recovered ;
Opposite object generating means for generating an opponent object as an opponent of the user based on the accumulated information;
A game control apparatus comprising:   A program for causing a computer to function as the game system according to any one of claims 1 to 7 or the game control device according to claim 8.

Images