JP2015164540A - Game system, and program for realizing game system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a game capable of generating a possibility to allow a player to adopt a new strategy in a game and restricting the strategy in the game from becoming stereotypical.SOLUTION: An enemy line boss EC and enemy foot soldiers ZC being the enemy line boss's followers match with a player character PC in a virtual game space concerning a game machine. The game machine includes: count means for counting the number of the enemy foot soldiers ZC existing around the line boss EC; parameter value change means for increasing a probability that the line boss EC allows the enemy foot soldiers ZC to make a concerted attack on the player character PC as the number counted by the count means is greater; and action control means for controlling the action of the line boss EC on the basis of a lottery result by the probability. Thus, there is a possibility that a player adopts a new strategy to attack the line boss EC after defeating the enemy foot soldiers ZC in order to avoid the concerted attack.

Description

  The present invention relates to a game system that activates at least two types of characters in a virtual game space, and a program for realizing the game system.

  2. Description of the Related Art Conventionally, an action game has been developed in which a player operates a predetermined character and fights against an enemy character in a virtual game space. Hereinafter, a character operated by the player is referred to as a “player character”, and an enemy character is referred to as an “enemy character”.

  Among action games, there is a game in which a stage can be cleared by defeating a predetermined enemy character (hereinafter referred to as “boss character”). In such an action game, generally, a plurality of enemy characters (hereinafter referred to as “Zako characters”) are arranged around the boss character. When a player character or a subordinate character (hereinafter referred to as “subordinate character”) enters an attack range set around him, the Zako character is controlled to attack the player character or subordinate character. Yes. In this way, the Zako character protects the boss character by controlling the Zako character to attack the player character or the like who wants to attack the boss character. That is, the Zako character is controlled to indirectly protect the boss character.

  FIG. 7 is a diagram for explaining a scene of a conventional action game, where the player character PC is a subordinate character BC1 to BC4 (in FIG. 7, the torso is a white character other than the player character PC. The same applies in FIG. )), Showing the scene of attacking the boss character EC team. Around the boss character EC, eight Zako characters ZC1 to ZC8 (characters other than the boss character EC in FIG. 7 whose black body portion is the same as in FIG. 2) are arranged. Zako characters ZC1, ZC4 and ZC7 are fighting against subordinate characters BC1, BC3 and BC4, respectively, which are in their attack range, and protect boss character EC from attacks of subordinate characters BC1, BC3 and BC4.

  Japanese Patent Laid-Open No. 2001-149655 describes a battle method in which each horse soldier composing a group is independently controlled to search for and battle enemy horse soldiers.

JP 2001-149655 A

  However, in such an action game, since the Zako character is not directly controlled to protect the boss character, the player operates the player character so as to ignore the Zako character and defeat only the boss character. be able to. For example, in FIG. 7, when the player character PC is moved by the route of the dotted arrow passing behind the subordinate characters BC1, BC3 and the Zako characters ZC1, ZC4 in battle, avoiding the Zako characters ZC5, ZC8, You can fight directly with the boss character EC avoiding attacks. In this case, even if there are a lot of Zako characters ZC around the boss character EC, their existence becomes completely meaningless, and the player can clear the stage by defeating only the boss character EC. There is a risk that the strategy will be uniform.

  If there are many zako characters around the boss character, if the player character is set so that it is difficult to defeat the boss character, the player can adopt the strategy of defeating the zako character first to make it easier to defeat the boss character. Sex comes out. However, an action game that changes the ease of defeating the boss character according to the number of Zako characters around the boss character has not been developed.

  In addition, an action game that changes the strength of a boss character or player character according to the number of zako characters or subordinate characters existing around the boss character or player character has not been developed. Also, in games of a type other than the action game, the strength, speed, size, action probability, etc. of a certain character are determined according to the number of predetermined characters existing around the certain character in the virtual game space. The game which changes the parameter value of has not been developed conventionally.

  The present invention has been conceived under the above circumstances, and by setting a predetermined parameter value of another character to be changed in accordance with the number of predetermined characters existing in a predetermined area. An object of the present invention is to provide a game in which a player can possibly adopt a new strategy on the game, and the strategy on the game can be prevented from becoming uniform.

  In order to solve the above problems, the present invention takes the following technical means.

  A program provided by the first aspect of the present invention is a game in which a computer activates at least one first character and at least one second character other than the first character in a virtual game space. A program for causing a computer to function, wherein the computer is configured to count the number of the second characters existing in a predetermined area, and according to the number counted by the counting means, the first Functioning as parameter value changing means for changing a predetermined parameter value set for one character, and action control means for controlling the action of the first character based on the predetermined parameter value, The predetermined area is an area within a predetermined distance from the first character, and the predetermined parameter is Value, the first character, the a predetermined area or a predetermined area outside of the second character, the probability of performing the predetermined instruction behavior, characterized in that.

  A game system provided by the second aspect of the present invention executes a program storage unit that stores a program applied according to the first aspect of the present invention and a process based on the program stored in the program storage unit A computer.

  According to the present invention, the predetermined parameter value set for the first character is changed according to the number of the second characters existing in the predetermined area, and the motion of the first character changes. Therefore, it can suppress that the content of a game becomes uniform.

  That is, for example, when the first character and the second character are enemy characters that play against the player character, the player operates the player character to defeat the second character and reduce the number thereof. You can change the character's behavior. As a result, it is possible to prevent the player from adopting a new strategy that has not been assumed in the past, and to prevent the game strategy from being uniform.

  Further, the predetermined parameter value is a probability that the first character causes the second character to attack the player character all at once, and the larger the number of second characters existing around the first character, the larger the predetermined parameter value. For example, the following strategy can be adopted when the value is set to be high. That is, if the number of second characters existing around the first character is large, the probability that the player character is subjected to a simultaneous attack increases, and it is difficult to defeat the first character. Therefore, in addition to the strategy of ignoring the second character and attacking the first character, the strategy of attacking the first character after lowering the probability of receiving a simultaneous attack by defeating the second character first. There is a possibility that the player will adopt it. Thereby, it can suppress that the strategy on a game becomes uniform.

  Other features and advantages of the present invention will become more apparent from the detailed description given below with reference to the accompanying drawings.

It is a figure for demonstrating the structure of each team in a certain battle. It is a figure for demonstrating one scene of the action game which concerns on this embodiment. It is a figure which shows an example of a calling probability table. It is a figure which shows an example of a probability table. It is a block diagram which shows the game device which concerns on this invention. It is a flowchart for demonstrating a camp general action process. It is a figure for demonstrating one scene of the conventional action game.

  Hereinafter, as a preferred embodiment of the present invention, a case where a game program according to the present invention is applied to game software will be specifically described with reference to the accompanying drawings. In the following description, a case where an action game is progressing in a home game device (hereinafter referred to as “game device”) will be described as an example.

  The action game according to the present embodiment is an action game set in the age of Sengoku in Japan. The player feels as if he / she became a warrior warrior and battles with other warlords by using the warrior warrior he / she selected as a player character and operating that player character Can enjoy. In this game, a plurality of modes are set such as a world unified mode in which the player becomes a warrior general and fights against enemy troops spreading throughout the country, aiming to unify the world while expanding his territory. In World Unification mode, the game progresses by fighting with armies of other countries, defeating enemy generals and winning the battle. In each battle, the enemy general has set up multiple teams on his territory, and each team is defending each team.

  FIG. 1 is a diagram for explaining the configuration of each team in a battlefield (stage). This figure shows a state in which four enemy teams (dotted team) and one teammate (open team) are arranged in the virtual game space. A general general (indicated by a black large circle) is arranged in one of the enemy lines, and a general general (indicated by a gray large circle) is arranged in each other enemy line. In addition, a plurality of enemy footsteps (indicated by white small circles) that are subordinates of the general or camp general are arranged in each enemy team. The player can occupy the enemy team by defeating the general, and can win the battle by defeating the general. In addition, you cannot occupy the enemy team just by defeating the enemy. In addition, the defeated camp general is deleted from the game space.

  When the player character attacks the enemy team and occupies it, the occupied enemy team can be used as a friendly team. In this case, a general camp (shown by a white Daimaru) and a plurality of teammates who are their subordinates (shown by a white small circle) are arranged on the team. The battlefield teams at the start of the battle are all enemy teams, and there are no friendly teams. The state shown in the figure is a state in which one of the five enemy lines is occupied by the player character to become a teammate. Conversely, when a teammate is attacked by an enemy character and the team general is defeated, the teammate is occupied by the enemy character to become an enemy team, and the enemy team general and enemy footsteps are arranged.

  FIG. 2 is a diagram for explaining one scene of the action game according to the present embodiment, and shows a scene where the player character is attacking a certain enemy team. FIG. 5A shows a scene in which the player character PC leads the subordinates' footlights BC1 to BC3 to attack the team general EC. Enemy feet ZC1 to ZC5, who are subordinates of Jin Admiral EC, exist in the enemy team.

  In the following description, the subordinate footlights BC1 to BC3 are referred to as “subordinate footlight BC”, and the enemy footlights ZC1 to ZC5 are referred to as “enemy footlight ZC”. In an actual game, there are a lot of subordinate footlights BC and enemy footlights ZC, but they are omitted in the figure as described above. Further, the broken line arc A described in the figure is a part of a circle with a predetermined radius centered on the camp general EC, and is not displayed on the actual screen. The broken line arc A is described for convenience in order to explain whether or not the enemy footsteps ZC1 to ZC5 exist around the camp general EC. Actually, the distance between the enemy footlights ZC1 to ZC5 and the position coordinates of the camp general EC are calculated, and an enemy footlight ZC whose distance is equal to or smaller than a predetermined radius is placed around the camp general EC. It is judged that it exists.

  The enemy footlight ZC is controlled to attack the player character PC or the subordinate footlight BC when the player character PC or the subordinate footlight BC enters the attack range set around him. The attack range is an area set in advance for each enemy character, and is, for example, a circular area having a predetermined radius centered on the position of each enemy character. By controlling the player character PC or the like that is going to attack the camp general EC by this control, the enemy lighter ZC protects the camp general EC and the camp. Hit points are set for each enemy footlight ZC. The hit point is an endurance value set in accordance with the endurance for each character, and decreases with an attack. When the hit point of the enemy footlight ZC becomes zero due to the attack of the player character PC or the like, the enemy footlight ZC is defeated and disappears from the virtual game space.

  When the enemy foot ZC existing in the surrounding area is reduced, the camp general EC is likely to be attacked by the player character PC or the like. The camp general EC can defend itself against an attack from the player character PC or the like alone, but can also instruct the enemy footwork ZC to strengthen the defense of the enemy team. Jin Admiral EC's instructions to the enemy Ashikaga ZC include (1) an action to collect the enemy Ashikaga ZC around Jin Admiral EC (hereinafter referred to as “calling”), and (2) around the Jin Admiral EC. An action that causes an existing enemy footlight ZC to perform a simultaneous attack on the player character PC (hereinafter, this action is referred to as “Kakare”), (3) A predetermined item (for example, a recovery item) is given to all enemy footlight ZCs in the team There are three types of actions (hereinafter referred to as “falling down”). The camp general EC makes full use of these instruction actions and his own attack / defense ability (abilities depending on weapons, armor, etc.) to play against the player character PC and the like, and to defend the enemy team. The action of the camp general EC is controlled based on the camp general action process described later.

  If the camp general EC fulfills a predetermined condition, the enemy general EC may perform a “call” to collect the enemy light ZC around him in order to protect him. The probability that the camp general EC performs “calling” (hereinafter referred to as “calling probability”) is set according to the number of enemy light ZCs existing around the camp general EC. It should be noted that “Jin Admiral EC” corresponds to the “first character” of the present invention, and “Enemy Footlight ZC” corresponds to the “Second Character” of the present invention. Further, “around Jincho EC” corresponds to “predetermined area” of the present invention, and “calling probability” corresponds to “predetermined parameter value” of the present invention.

  FIG. 3 is a diagram illustrating an example of a call probability table in which a call probability is set.

  The left column of the figure shows the number of enemy light ZCs existing around the camp general EC, and the right column shows the call probability. As shown in the figure, the calling probability is set so as to increase as the number of enemy light ZCs existing around the camp general EC decreases. When the number of enemy footlights ZC existing around the camp general EC is small, the camp general EC is more likely to be directly attacked by the player character PC or the like, and the camp general EC is easily defeated. Since the enemy camp is occupied when the camp general EC is defeated by the player character PC, the enemy footlight ZC that protects the camp general EC becomes weaker and the call-in probability increases to reinforce the defense power of the enemy footwork ZC. , To keep the enemy ’s defenses as high as possible. In addition, in order to perform “Kakare”, which will be described later, it is necessary that a predetermined number or more of the enemy footsteps ZC exist around the camp general EC. In order to allow the predetermined number of enemy footlights ZC to exist around the camp general EC, the call probability is set to be higher as the number of surrounding enemy footlights ZC is smaller.

  Note that the calling probability table shown in the figure is merely an example, and how to set each probability is not limited to this. For example, if there are 6 or more enemy footlight ZCs around Jincho EC, “calling” may not be performed (calling probability is 0%), or there are 0 enemy footlight ZCs. In this case, “calling” may be necessarily performed (calling probability is set to 100%). Further, the calling probability may be calculated based on the number of enemy light ZCs instead of setting in a table. In the present embodiment, the next “calling” is not performed at least for a predetermined time (for example, 30 seconds) after the “calling” is performed.

  In FIG. 2 (a), since there are two enemy footlights ZC around the camp general EC (area in the broken arc shown in the figure), the camp general EC performs “calling” with a probability of 70% (FIG. 2). 3). FIG. 2 (b) shows a scene when Jin Admiral EC “calls”. In FIG. 5B, the enemy footlights ZC6 to ZC8 that did not exist around the camp general EC appear around the camp general EC because the camp general EC “calls”. In addition, you may make it call the footsteps (for example, enemy footsteps ZC3-ZC5 shown in FIG.2 (b), or the enemy footsteps ZC which are not displayed on the game screen but are in the side) in the line. .

  In addition, when a predetermined condition is satisfied, the camp general EC may perform “Kakare” that causes the enemy character ZC existing in the vicinity to perform a simultaneous attack on the player character PC. The camp general EC does not “kakare” when the number of enemy foot ZCs existing around the camp general EC is less than a predetermined number (for example, 5), and with the probability set only when the number is greater than the predetermined number. "Kakare". Hereinafter, the probability that Jin Admiral EC will “kakare” is referred to as “kakare probability”. Note that the “probability” corresponds to the “predetermined parameter value” of the present invention.

  FIG. 4 is a diagram illustrating an example of a probability table in which a probability is set.

The left column of the figure shows the number of enemy light ZCs that exist around the camp general EC, and the right column shows the probability. As shown in the figure, when there are 4 or less enemy footlight ZCs around the camp general EC, it is set not to perform “Kare”, and when it is 5 or more, the probability is 70 to 90%. Is set. In the case of five or more bodies, the probability is changed in accordance with a preset difficulty level of the whole game (hereinafter referred to as “ease of occupation” for convenience of explanation). That is, when the occupation ease of the team is set to “normal”, it is set to 70%, and when it is set to “difficult”, it is set to 80%. Is set to 90%. In the case of 4 or less bodies, since the effect of the simultaneous attack is small, it is set not to perform “Kare”. In the case of four or less bodies, instead of setting not to perform “Kare”, the probability may be set as 0%.

  Note that the probability table shown in the figure is merely an example, and how to set each probability is not limited to this. For example, the probability may be set even when there are 4 or less enemy footlights ZC around the general camp EC, or the probability is not fixed when the number is 5 or more, depending on the number of enemy footlights ZC. It may be set differently. Also, the probability may increase as the number of enemy foot ZCs increases, and conversely, the probability increases as the number of enemy foot ZCs decreases. Further, the probability is not set by a table, but may be calculated based on the number of enemy light ZCs. In the present embodiment, the next “Kare” is not performed at least for a predetermined time (for example, 10 seconds) after the “Kare” is performed.

  In FIG. 2B, since there are five enemy foot ZCs around the camp general EC (the area within the broken arc shown in the figure), the ease of occupation of the camp is set to “normal”. If there is, the general camp EC “kakare” with a probability of 70% (see FIG. 4). FIG. 2 (c) shows a scene when Jin Admiral EC performs “Kakare”. In FIG. 8C, when the camp general EC performs “Kakare”, the enemy lighters ZC1, ZC2, and ZC6 to ZC8 around the camp general EC attack the player character PC. Yes. In this embodiment, the enemy footlights ZC8 and ZC7 that have been fighting against the subordinate footlights BC1 and BC3 are also attacking the player character PC, but the enemy footlight ZC8 and ZC7 are fighting against the subordinate footlights BC1 and BC3. You may make it give priority.

  In addition, the camp general EC performs “falling” to give a predetermined item to the enemy footlight ZC existing in the camp every predetermined time (for example, 120 seconds). The item given to the enemy Ashikaga ZC by the camp general EC is set for each camp, and the effect when the item is received is set corresponding to the received item. For example, in the team that gives the recovery item “rice ball” (hereinafter referred to as “recovery team”), the hit point of the enemy foot ZC that received “rice ball” is recovered. Further, in the team that gives “sword”, the attack power of the received enemy footlight ZC increases for a predetermined time, and in the team that gives “楯”, the defense power of the received enemy footlight ZC increases for a predetermined time.

  In the present embodiment, “fall down” is performed regardless of the number of enemy light ZCs existing around the camp general EC, but is not limited thereto. For example, “lowering” may be performed only when a predetermined number or more of enemy footlight ZCs exist around (or within) the camp general EC, or “falling” is performed according to the number of enemy footlight ZCs. The probability may be changed. Further, the degree of recovery of hit points, the degree of increase in attack power and defense power, or the time during which the attack power and defense power increase may be changed according to the number of enemy light ZCs.

  FIG. 2 (d) shows a scene when Jin Admiral EC “falls”. FIG. 4D shows a case where the team is a “recovery team”. When the team general EC “drops”, the enemy footsteps ZC1 to ZC8 existing around the team general EC are displayed. Is given a “rice ball” (a white triangle item shown at the tip of the left hand of enemy footlights ZC1 to ZC8), and the hit points of enemy footlights ZC1 to ZC8 have been recovered.

  Further, when the player character PC is in the attack range when the above-mentioned “calling”, “kakare”, and “falling” are not performed, the camp general EC attacks the player character PC. In the present embodiment, the attack range of the camp general EC is set to be narrower than the area within the broken line arc A (that is, the predetermined radius for defining the attack range is the predetermined radius for defining the periphery of the camp general EC). Smaller.) Further, in the present embodiment, when the player character PC is within the attack range, the camp general EC attacks the player character PC regardless of the number of enemy light ZCs existing around the camp general EC. However, it is not limited to this. For example, the attack may be performed only when a predetermined number or more of the enemy footsteps ZC exist around the camp general EC, or the probability of attacking may be changed according to the number of enemy footsteps ZC.

  It should be noted that the camp general EC cannot attack the player character PC while performing the above “calling”, “kare”, and “falling”. Therefore, the player can attack the camp general EC aiming at the time when the camp general EC is performing an action other than the attack.

  In addition, when the general general EC receives an attack from the player character PC or the subordinate foot light BC1 to BC3, the general defense EC defends against the attack regardless of the above. Whether or not the defense is successful is determined by a lottery using guard probabilities set according to the hit points of the camp general EC. In this embodiment, the hit point of the camp general EC is small in order to suppress that the hit point immediately becomes zero and the camp general EC is defeated by an attack received when the hit point is small. The guard probability is set to be higher. In the present embodiment, when an attack from the player character PC or the like is received regardless of the number of enemy light ZCs existing around the camp general EC, the camp general EC protects against the attack. However, it is not limited to this. For example, the defense may be performed only when a predetermined number or more of the enemy footlight ZC exists around the camp general EC, or the probability of the defense may be changed according to the number of enemy footlight ZC. . Further, when the defense is performed, the guard probability may be changed according to the number of enemy light ZCs existing around the camp general EC.

  Next, the hardware configuration of this embodiment will be described.

  FIG. 5 is a block diagram showing a game apparatus according to the present invention. The game apparatus 1 includes a main body 11, an operation controller 12, and a monitor 13. The operation controller 12 and the monitor 13 are connected to the main body 11 by a dedicated cable. The main body 11 is loaded with a disk 14 on which a game program and game data are recorded, and a memory card 15 for storing game data as necessary.

  The main body 11 includes a control unit 111, a drawing processing unit 112, an audio processing unit 113, a disk drive unit 114, a memory card connection unit 115, an I / O interface unit 116, and a communication processing unit 117. The control unit 111 is connected to a drawing processing unit 112, an audio processing unit 113, an I / O interface unit 116, and a communication processing unit 117. Further, the disk drive unit 114, the memory card connection unit 115, the operation controller 12, and the monitor 13 are connected to the I / O interface unit 116.

  In the game apparatus 1, the disc 14 on which the software for the action game is recorded is mounted on the disc drive unit 114, and the game program and game data in the disc 14 are read from the disc drive unit 114 into a RAM 111 c (described later) in the control unit 111. It is. When the read game program is executed by a CPU 111a (described later), the player can enjoy the game contents. The player can operate the player character by operating operation members 12a to 12c (described later) of the operation controller 12, and can advance the game.

  The game data in the disk 14 includes characters such as player characters and enemy characters, image data such as backgrounds, sound data such as sound effects, and various tables that are referred to during game progress and drawing.

  The control unit 111 has a microcomputer that controls the overall operation of the main body 11. The microcomputer includes a CPU 111a, a ROM 111b, a RAM 111c, and the like, and each unit is connected by a bus line.

  The CPU 111a performs overall control of the game progress by executing a game program read from the disk 14 to the RAM 111c by the disk drive unit 114. More specifically, when an operation signal is input from the operation controller 12 by the player's operation, the CPU 111a performs a predetermined game progress process for the operation signal in accordance with the game program. The CPU 111a displays the processing result on the monitor 13 as, for example, a three-dimensional image, and outputs it from a speaker 13a (described later) of the monitor 13 using sound effects.

  In the present embodiment, the CPU 111a counts the number of enemy footsteps ZC existing around the enemy team general EC. That is, the distance between the positions of each enemy foot ZC and the position coordinates of the enemy camp general EC is calculated, and the number of enemy shoes ZC whose distance is equal to or less than a predetermined radius is counted. In addition, the CPU 111a refers to a call probability table (see FIG. 3) stored in the RAM 111c, and performs a lottery using the call probability corresponding to the counted number of enemy feet. For example, when the call probability table shown in FIG. 3 is set, if the counted number of enemy feet is three, the CPU 111a performs a lottery by setting 50% as the probability of “call”. Further, the CPU 111a refers to the probability table (see FIG. 4) stored in the RAM 111c, and performs lottery using the counted odds of enemy footage and the probability of occupation of the team. For example, in the case where the probability table shown in FIG. 4 is set, if the counted number of enemy footsteps is 5 and the ease of occupation of the team is “normal”, the CPU 111 a A lottery is performed with a probability of 70% being set. Further, the CPU 111a controls the action of the enemy team general EC based on these lottery results and the like. The action processing of the enemy team general EC executed by the CPU 111a will be described later.

  The ROM 111b stores a basic program indicating a basic function of the game apparatus 1 such as a disk loading function, a game program recorded on the disk 14, and a procedure for reading game data. When the disk 14 is loaded in the disk drive unit 114, the CPU 111a operates the disk drive unit 114 according to the basic program in the ROM 111b, reads the game program and game data from the disk 14 into the RAM 111c, and sets the game start state.

  The RAM 111c provides an area for storing game programs and game data read from the disk 14 by the disk drive unit 114, and a work area for the CPU 111a to execute the game programs.

  The game program is configured by combining a plurality of programs. For example, the game progress program or the monitor 13 controls the movement of the player character displayed on the monitor 13 based on the operation signal of the player from the operation controller 12. It is constituted by a graphic control program for controlling a three-dimensional image to be displayed.

  In the present embodiment, the RAM 111c stores a call probability table (see FIG. 3) and a probability table (see FIG. 4) as game data.

  Based on the player's operation signal from the operation controller 12, the CPU 111a reads a game program, image data, and the like from the disk 14 into the RAM 111c as necessary, and processes these data and executes the game program. The contents of the three-dimensional image to be displayed on the monitor 13 are determined.

  The drawing processing unit 112 performs various arithmetic processes necessary for the drawing process. For example, the CPU 111a outputs a drawing command to the drawing processing unit 112 every 1/60 seconds. At this time, the CPU 111a determines an image to be displayed on the monitor 13, reads out image data (polygon data of an object such as a character and background data) necessary for drawing the image, light source data, and the like from the RAM 111c and draws them. This is supplied to the processing unit 112. Further, the CPU 111 a supplies position data of each character and operation signals input from the operation controller 12 to the drawing processing unit 112.

  Based on the image data and the operation signal supplied from the CPU 111a, the drawing processing unit 112 receives data necessary for drawing (positional relationship between each object and background, coordinates of polygons constituting each object on the screen of the monitor 13, The texture corresponding to each polygon and the data such as the reflection characteristics of each polygon are calculated, and the display screen of one frame (one frame) is displayed in a VRAM (not shown) in the drawing processing unit 112 based on the calculation result. Create image data. The generated image data of the display screen is output and displayed on the monitor 13 as a video signal every 1/60 seconds, for example.

  The audio processing unit 113 performs various arithmetic processes necessary for processing for generating sound such as sound effects. When the CPU 111a determines a sound effect or BGM sound content to be output from the speaker 13a of the monitor 13, the CPU 111a outputs a voice command to the voice processing unit 113. The sound processing unit 113 reads out sound effects or BGM sound data from the RAM 111c based on a sound command from the CPU 111a, performs predetermined processing and D / A conversion, and then outputs the processed sound to the speaker 13a.

  The disk drive unit 114 reads a game program and game data recorded on the disk 14 based on a loading command from the CPU 111a (a read command designating a game program to be loaded and game data).

  The memory card connection unit 115 is a unit for writing / reading information relating to game progress to / from the memory card 15. When a “save data” command is issued from the player while the game is in progress or at the end of the game, the CPU 111a sends information related to the game progress to the memory card 15 via the memory card connection unit 115 (for example, the player The information includes information such as the type of game character that has been set and various privileges such as points and items that have been acquired). In addition, information regarding the game progress stored in the memory card 15 is read out to the RAM 111c before the game is started.

  The I / O interface unit 116 transmits the game program and game data read by the disk drive unit 114 and the memory card connection unit 115 and the operation signal from the operation controller 12 to the control unit 111, Video signals, audio signals, and the like from the drawing processing unit 112 and the audio processing unit 113 are transmitted to the monitor 13.

  The communication processing unit 117 performs control for transmitting and receiving data when communicating with another game apparatus 1 via a network. The communication processing unit 117 transmits an operation signal input from the operation controller 12 or a signal output from the CPU 111a to another game apparatus 1 via the network, and a signal transmitted from the other game apparatus 1 via the network. Is input to the CPU 111a.

  The operation controller 12 is operated by the player to operate the character or make various settings regarding the game, and includes a plurality of buttons 12a, a left lever 12b, and a right lever 12c. When the operation controller 12 is operated by the player, the operation signal is transmitted to the control unit 111, and the character displayed on the monitor 13 performs a predetermined action. Examples of the predetermined action include a movement action such as running, squatting, jumping, and an attack action for attacking an opponent using a weapon. The moving operation is mainly operated by the left lever 12b, and the attacking operation is mainly operated by the plurality of buttons 12a and the right lever 12c.

  The monitor 13 displays a display screen indicating the game progress state according to the video signal sent from the main body 11, or outputs sound such as sound effects from the speaker 13 a according to the voice signal sent from the main body 11. It is a device for. The monitor 13 is composed of, for example, a television receiver having an external input terminal for inputting a video signal and an audio signal.

  The disk 14 is an optical disk such as a DVD-ROM or a CD-ROM. The disc 14 stores a game program and various data and image data necessary for executing the game program. The memory card 15 is a non-volatile recording medium capable of rewriting data, such as a flash memory. Since the recording of the work area of the RAM 111c disappears when the power of the game apparatus body 11 is turned off, the memory card 15 stores information on the game progress that should remain without being erased from the recording of the work area of the RAM 111c. Record.

  The game apparatus 1 can be connected to the network line 2 such as the Internet line via the network adapter 16. In this case, it is also possible to play a game between a plurality of game devices 1 via the network line 2 (so-called “online game”). In the present embodiment, a game performed by the game apparatus 1 alone has been described, but the present invention can also be applied to such an online game.

  Next, the action process of the enemy team general EC will be described with reference to FIG.

The action of the enemy team general EC is controlled by the CPU 111a. As described above, there are five actions (i.e., (1) “calling”, (2) “kakare”, (3) “falling”, (4) “attack”, and (5) ) “Defense”), and Jin Admiral EC will perform each action when it meets the requirements for performing each action (if “Call” and “Kakare” are selected in the lottery) Do.

  FIG. 6 is a flowchart for explaining the action process of the enemy camp general EC (hereinafter referred to as “camp general action process”) performed by the CPU 111 a of the game apparatus 1. The camp general action process is a process for controlling the action of the camp general EC, and is started when the player character PC enters the enemy team in order to attack the enemy team. If the camp general EC is defeated, the camp general action process is terminated.

  First, it is determined whether or not a predetermined time (for example, 30 seconds) has elapsed since the previous “calling” (S1). If the predetermined time has not elapsed (S1: NO), “calling” processing (described later) is not performed, and thus the process proceeds to step S5. On the other hand, when the predetermined time has elapsed (S1: YES), a “calling” lottery process is performed (S2), and it is determined whether or not the winning is made (S3). The “calling” lottery process is a process for drawing whether or not to perform “calling”, a process for counting the number of enemy light ZCs existing around the camp general EC, a calling probability table (see FIG. 3). And a process of determining a calling probability corresponding to the enemy foot number counted with reference to, and a process of performing a lottery using the determined calling probability.

  If the “calling” lottery is not won (S3: NO), the “calling” process is not performed, and the process proceeds to step S5. On the other hand, when the “calling” lottery is won (S3: YES), the “calling” process is performed (S4), and the process returns to step S1. The “calling” process is a process for causing the camp general EC to perform a “calling” process, a process for causing the camp general EC to call the enemy footlight ZC and a process for moving the enemy footlight ZC around the camp general EC. By this process and a drawing process that is performed separately, a video where Jin Admiral EC calls the enemy Ashikaga ZC (hereinafter referred to as “calling motion” as appropriate) and an image where the enemy Ashikaga ZC appears around Jin Admiral EC Is displayed (see FIG. 2B). The number of enemy light ZCs that appear around Jin General EC differs depending on the number of enemy light ZCs that exist around Jin General EC, the parameter values set for each Jin General EC, etc. It is restricted so that it does not become more.

  In step S5, it is determined whether or not a predetermined time (for example, 10 seconds) has elapsed since the previous “Kakare” was performed (S5). If the predetermined time has not elapsed (S5: NO), the “Kakare” process (described later) is not performed, and the process proceeds to step S10. On the other hand, if the predetermined time has elapsed (S5: YES), it is determined whether or not the number of enemy footsteps ZC existing around the camp general EC is a predetermined number (for example, five) or more (S6). ). If the number is less than the predetermined number (S6: NO), the “Kare” process is not performed, and the process proceeds to step S10. On the other hand, if the number is greater than or equal to the predetermined number (S6: YES), “Kare” lottery processing is performed (S7), and it is determined whether or not the winning is made (S8). The “Kakare” lottery process is a process for drawing whether or not “Kakare” is to be performed, and refers to the probability table (see FIG. 4) to determine whether or not the probability corresponding to the ease of occupation of the team. And a lottery process using the determined probability. In the probability table, the probability when the number of enemy footsteps is a predetermined number or less may be set to 0%. In this case, in the “Kakare” lottery process in step S7, the number of enemy footsteps ZC existing around the camp general EC is counted, and the heel probability corresponding to the counted number of enemy footsteps and the ease of occupation of the camp is calculated. It may be determined.

  If the “Kakare” lottery is not won (S8: NO), the “Kakare” process is not performed, and the process proceeds to Step S10. On the other hand, when the “Kakare” lottery is won (S8: YES), “Kakare” processing is performed (S9), and the process returns to Step S1. The “Kare” process is a process that causes the camp general EC to perform the “Kakare” process, a process for performing a cue action for setting a simultaneous attack on the player character PC, and an enemy foothold ZC existing around the camp general EC. The player character PC is attacked regardless of the attack range. By this process and a drawing process that is executed separately, a video of the general camp EC performing a signal for the simultaneous attack and a video of the enemy footlight ZC existing around the camp general EC simultaneously attacking the player character PC are displayed. (See FIG. 2 (c)).

  In step S10, it is determined whether or not a predetermined time (for example, 120 seconds) has elapsed since the previous “lowering” was performed (S10). If the predetermined time has not elapsed (S10: NO), the “lowering” process (described later) is not performed, and the process proceeds to step S13. On the other hand, when the predetermined time has elapsed (S10: YES), it is determined whether or not the camp general EC is displayed on the game screen (S11). The determination is made based on the position coordinates and orientation of the virtual camera for displaying the game screen, and the position coordinates of the camp general EC. That is, when the virtual camera is not facing the camp general EC, it is determined that the camp general EC is not displayed on the game screen. If “lowering” is performed when the camp general EC is not displayed on the game screen, the player cannot recognize that “lowering” has been performed. In this case, the hit points of the enemy footlight ZC are recovered or the attack power of the enemy footlight ZC is increased without the knowledge of the player. Therefore, in the present embodiment, when the camp general EC is not displayed on the game screen, “lowering” is not performed. It should be noted that “fall down” may be performed regardless of whether the camp general EC is displayed on the game screen.

  If the camp general EC is not displayed on the game screen (S11: NO), since the “lowering” process is not performed, the process proceeds to step S13. On the other hand, when the camp general EC is displayed on the game screen (S11: YES), a “fall” process is performed (S12), and the process returns to step S1. The “falling” process is a process for causing the camp general EC to perform the “falling” process. A process for giving the camp general EC an action of giving a predetermined item (for example, a rice ball) to the enemy foothold ZC existing in the camp, A process of recovering the hit points of ZC or increasing the attack power or the like (determined according to a given predetermined item) is performed. By this process and a drawing process that is executed separately, an image in which the camp general EC gives a predetermined item to the enemy light ZC is displayed (see FIG. 2D). In the present embodiment, recovery of hit points or the like is not expressed in the video, but the recovery state may be visualized.

  In step S13, it is determined whether or not the player character PC is within the attack range of the camp general EC (S13). This determination is made by calculating the distance between the position coordinates of the player character PC and the position coordinates of the camp general EC and determining whether or not the distance is equal to or smaller than a predetermined radius for defining the attack range.

  If the player character PC is within the attack range of the camp general EC (S13: YES), attack processing is performed (S14), and the process returns to step S1. The attack process is a process for causing the camp general EC to attack the player character PC, and the processing content changes depending on whether or not the defense of the player character PC against the attack is successful. A video corresponding to the processing content is displayed by the processing and the drawing processing separately performed. That is, when the player character PC does not defend, and when the defense of the player character PC fails, the hit points of the player character PC are reduced, and a video in which the attack of the camp general EC hits the player character PC is displayed. Is done. On the other hand, when the defense of the player character PC is successful, the hit points of the player character PC are not reduced, and an image in which the player character PC defends the attack of the camp general EC is displayed.

  On the other hand, if the player character PC is not within the attack range of the camp general EC (S13: NO), the process returns to step S1 after waiting. In this case, the camp general EC does not perform any action for a predetermined number of frames. In this embodiment, the ease of occupation of the team is set according to the number of frames to wait. When the number of frames to be waited is large, the ratio of the time when the camp general EC is not performing any action is relatively high, so that the player can easily attack the camp general EC. Therefore, since it becomes easy to defeat the camp general EC, the difficulty level of the occupation is reduced. On the other hand, when the number of frames to be waited is small, when the player character PC is within the attack range of the camp general EC, the ratio of the attack time by the camp general EC is relatively high, so that the player is difficult to attack. . In addition, when the player character PC is not within the attack range of the camp general EC, the rate at which “calling”, “kakare”, and “falling” are relatively high, and the player is less likely to attack. Therefore, it becomes difficult to defeat the camp general EC, so the difficulty level of occupation of the camp increases.

  In addition, (5) “Defense” among the actions of the camp general EC is controlled by a process different from the camp general action process. Note that a detailed description of the “defense” process is omitted.

  According to the present embodiment, the probability that Jin Admiral EC performs “Kakare” varies depending on the number of enemy light ZCs existing around Jin General EC. When it is less than the body, it is 0%, and when it is 5 or more, it is 70 to 90% depending on the ease of occupation. When the camp general EC performs “Kakare”, the enemy footlight ZC makes a simultaneous attack on the player character PC, so that it becomes difficult for the player character PC to defeat the camp general EC. In other words, when there are five or more enemy light ZCs around Jin General EC, it is difficult to defeat Jin General EC. Therefore, in order to make it easier for the player to defeat the camp general EC, there is a possibility that the player first employs a strategy of defeating the enemy foot ZC existing around the camp general EC. Thereby, it can suppress that the strategy on a game becomes uniform.

  In addition, according to the present embodiment, the probability that Jin Admiral EC “calls” changes according to the number of enemy light ZCs that exist around Jin General EC, and the enemy light ZCs that exist around Jin General EC. The smaller the number, the higher. When Jin Admiral EC “calls”, enemy Ashikaga ZC gathers around Jin Admiral EC. That is, when the number of enemy footlights ZC existing around the camp general EC decreases, the enemy footsteps ZC can be collected around the camp general EC, so the camp general EC cannot perform “Kakare”. It is possible to prevent the player character PC from being easily defeated.

  In addition, when the player adopts a strategy of reducing the number of enemy light ZCs around Jin General EC in order to avoid “Kare” by Jin General EC, if the number of enemy light ZCs is reduced too much, Jin General EC Is more likely to “call”. In this case, performing “calling” increases the possibility that the number of enemy footsteps ZC will increase, and there is a possibility that the possibility of performing “Kare” will increase. On the other hand, even if you keep the enemy footlight ZC around Jingun EC from 4 (the maximum number that Jinka EC does not do), avoid these 4 enemy footlight ZC. If it takes time to attack the Jin Admiral EC, the number of enemy Ashit ZCs around the Jin Admiral EC increases as the enemy Ashikaga ZC located away from the Jin Admiral EC approaches the Jin Admiral EC To do. In this case, there is a possibility that Jin Admiral EC will perform “Kakare”. Therefore, the player has a higher probability of performing the “calling” by the camp general EC, but can also adopt a strategy of quickly defeating the camp general EC by reducing the number of enemy light ZCs around the camp general EC at a stretch. However, it is also possible to adopt a strategy of defeating the camp general EC while keeping the four enemy foot ZCs around the camp general EC. Thereby, it can further suppress that the strategy on a game becomes uniform.

  Also, while playing the “calling motion”, Jin Admiral EC is defenseless. Therefore, using this, we adopted a strategy of defeating all enemy Ashikaga ZCs around Jin Admiral EC and inviting Jin Admiral EC to “call” and attacking defenseless Jin Admiral EC You can also Thereby, it can further suppress that the strategy on a game becomes uniform.

  In addition, although the said embodiment demonstrated the case where a calling probability or a certain probability was changed according to the number of enemy footstep ZC which exists around the enemy camp general EC, it is not restricted to this. Other action probabilities such as the probability of “falling”, the probability of performing an attack, the probability of performing a defense, and the probability of guarding may also be changed according to the number of enemy footsteps ZC existing in the vicinity. For example, if the setting is made such that the larger the number of enemy footlight ZCs that are present in the surrounding area, the higher the probability that the camp general EC will attack is that the number of enemy footlight ZCs that are present in the surrounding area is large, it is difficult to defeat the camp general EC. . Accordingly, it is possible to direct the player to adopt a strategy of first defeating the enemy footstep ZC existing in the surroundings and then attacking the camp general EC after the probability that the camp general EC will attack is low.

  In addition to the action probability, other parameter values such as the defense power and attack power of the camp general EC may be changed according to the number of enemy foot ZCs existing around the camp general EC. For example, if the defense power of the camp general EC is increased as the number of enemy light ZCs existing in the surroundings increases, it becomes difficult to defeat the camp general EC when the number of enemy foot ZCs present in the surroundings is large. Therefore, it is possible to direct the player to adopt a strategy of first defeating the enemy footstep ZC existing around and attacking the general general EC after the defense power of the general general EC becomes low. Also, the greater the number of enemy footlight ZCs that are in the surrounding area, the lower the defense power because the guards will be guarded and the defense will be sweeter. The smaller the number of enemy footlights ZCs that are in the surrounding area, the lower the defense power. Since it tightens, it can also be set that defense power becomes high. Further, the number of enemy light ZCs for changing the parameter value is not limited to the number of enemy light ZCs present around the enemy team general EC. For example, you may make it change according to the number of all the enemy footsteps ZC which exist in the said team.

  In addition, although the said embodiment demonstrated the case where the parameter value of enemy camp general EC was changed, it is not restricted to this. For example, the parameter value of the enemy general (see FIG. 1) may be changed in accordance with the number of enemy generals (ie, surviving enemy generals) existing in the virtual game space. . In this case, the “enemy general” corresponds to the “first character” of the present invention, the “enemy team general” corresponds to the “second character” of the present invention, and the entire battlefield (stage) "Corresponds to the" predetermined area "of the present invention. For example, if you set the enemy general general's defense power to be higher as the number of surviving enemy team generals increases, the inexperienced player first defeats the team general and the defense level of the general becomes lower. You can adopt a strategy of attacking the general. On the other hand, a skilled player can adopt a strategy of ignoring the general and suddenly attacking the general.

  Further, the parameter value of the teammate of the teammate (see FIG. 1) may be changed according to the number of teammates present around the teammate. In this case, the “friend of the teammate” corresponds to the “first character” of the present invention, and the “friend of foot” corresponds to the “second character” of the present invention.

  Further, the parameter value of the player character PC may be changed in accordance with the number of subordinate lighters BC existing around the player character PC. In this case, “player character PC” corresponds to the “first character” of the present invention, and “subordinate footlight BC” corresponds to the “second character” of the present invention.

  Further, the parameter value of the enemy team general EC may be changed in accordance with the number of subordinate lighter BCs existing around the enemy team general EC. In this case, “enemy camp general EC” corresponds to the “first character” of the present invention, and “subordinate footlight BC” corresponds to the “second character” of the present invention.

  Further, the parameter value of the player character PC may be changed according to the number of enemy light ZC existing around the player character PC. For example, when the player character PC is set to speed up in order to solve the siege network when surrounded by the enemy foot ZC, the player character PC increases as the number of enemy foot ZCs around the player character PC increases. What is necessary is just to set so that the parameter value of the operating speed of PC may be enlarged. In this case, the “player character PC” corresponds to the “first character” of the present invention, and the “enemy footlight ZC” corresponds to the “second character” of the present invention.

  In the above embodiment, an action game has been described as an example, but the present invention is not limited to this. The present invention can also be applied to other action games. In other action games, the so-called “boss character” corresponds to the “enemy camp general EC”, and the so-called “Zako character” corresponds to the “enemy foot light ZC”.

  Moreover, although the said embodiment demonstrated the action game as an example, it is not restricted to this. For example, the present invention can also be applied to a game in which a player character and an enemy character fight, such as an RPG (role playing game), a shooting game, or a fighting game. Further, the present invention is a game in which a character operated by a plurality of players or a character controlled by a CPU forms a team and cooperates with an enemy character, or a character operated by another player as an enemy character. It can also be applied to such games.

  Further, the present invention can be applied to a game in which two or more types of characters appear even if the game is not a game in which a player character and an enemy character fight. For example, in the adventure game, the moving speed of the player character or the appearance probability of the item may be changed according to the number of other characters existing around the player character.

  In addition, when a game is performed by combining a player character and a specific character, the player character (or a specific character) can play a special technique that can only be achieved when a combination with the specific character is combined. Also good. In this case, the “predetermined area” in the present invention can be considered as a virtual game space.

  In the above embodiment, the case where the game is executed on the home game device has been described, but the present invention is not limited thereto. The present invention can be applied without being limited to the type of game device on which a game is executed. For example, a game is executed on a portable game device, an arcade game device, and a personal computer on which game software is installed. It can also be applied to.

  Although the case where the game apparatus 1 is used alone has been described in the above embodiment, the present invention is not limited to this. In the present invention, a plurality of game apparatuses 1 are connected by cable or wireless communication, the game apparatus 1 is connected to a game server via a network line 2, or the game apparatuses 1 are connected to each other via a network line 2. The present invention can also be applied to the case where the game apparatus 1 is used to simultaneously play a game.

  The game system and program according to the present invention are not limited to the above-described embodiments. The game system and the specific configuration of the program according to the present invention can be modified in various ways.

DESCRIPTION OF SYMBOLS 1 Game apparatus 11 Main body 111 Control part 111a CPU (Counting means, parameter value change means, operation control means)
111b ROM
111c RAM
DESCRIPTION OF SYMBOLS 112 Drawing processing part 113 Audio | voice processing part 114 Disk drive unit 115 Memory card connection unit 116 I / O interface part 117 Communication processing part 12 Operation controller 13 Monitor 14 Disk 15 Memory card 16 Network adapter 2 Network line

Claims (2)

A program for causing a computer to function as a game device that activates at least one first character and at least one second character other than the first character in a virtual game space,
The computer,
Counting means for counting the number of the second characters existing in a predetermined area;
Parameter value changing means for changing a predetermined parameter value set for the first character according to the number counted by the counting means;
Action control means for controlling the action of the first character based on the predetermined parameter value;
To function,
The predetermined area is an area within a predetermined distance from the first character;
The predetermined parameter value is a probability that the first character performs a predetermined instruction action on the second character in the predetermined area or outside the predetermined area.
A program characterized by that. A program storage unit for storing the program according to claim 1;
A computer that executes processing based on a program stored in the program storage unit;
A game system comprising: