JP2010124874A - Game program, storage medium, and computer - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide: a game program that can uniquely control the actions of multiple subcharacters and realistically depict the mode of the subcharacters acting as a group; a memory medium that memorizes the program; and a computer that performs the program. <P>SOLUTION: When a predetermined condition like an appearing character being other non-player character or player character existing in an action area of multiple non-player characters is satisfied, the action area of the multiple non-player characters is scaled down from e.g. the game stage 1 to a predetermined area of the game stage 1. The multiple non-player characters are made to protect the appearing character as the periphery of the appearing character being the predetermined area or the multiple non-player characters are made to attack the appearing character as a prefixed area in the game stage being the predetermined area. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to a program, a storage medium, and a computer device for executing a game such as an action game in which a plurality of enemy characters fighting against a player character appear on one game stage.

There is a hunting action game as a game that is currently popular with many people.
In a hunting action game, a player character operated by a player becomes a hunter, and a mission (quest) is achieved by subjugating a monster (main monster) that is an enemy character, and the game proceeds. The main monster (large monster) is a monster with high attack power and high physical strength, and one (or two) appears in each quest. On the other hand, sub monsters (small monsters) are monsters with low attack power and low physical strength (weak), and many appear in each game stage where a quest is performed. Among these sub-monsters, there is a main monster that corresponds to a boss whose appearance and characteristics are similar (Non-patent Document 1).

  Thus, in this game, the power relationship that the main monster is stronger than the sub monster is set. For example, when a main monster appears on a game stage where a sub monster is present, the sub monster is allowed to escape to another stage to express a hostile relationship. Also, for example, sub monsters appear on the same game stage in response to a call from the main monster to express the master-slave relationship.

"Monster Hunter Portable 2nd Official Guidebook" Enterbrain Corporation, July 18, 2007, p.88-98

  However, the relationship between the sub monster and the main monster as described above is expressed by the action of each of the plurality of sub monsters, and is not unified as a whole sub monster. For this reason, the behavior of the sub monsters acting as one group cannot be realistically expressed because each sub monster takes a disjointed action or the timing of performing the action is too shifted.

  The present invention provides a game program capable of realistically expressing the ecology of sub characters acting as a group while independently controlling the actions of a plurality of sub characters, a storage medium storing the program, and a computer device executing the program The purpose is to provide.

  According to the first aspect of the present invention, a computer generates game space control means for generating a game space in which a player character and a non-player character act, a player character operated by a player is generated in the game space, and the player's A player character control means for controlling the action of the player character in the game space according to an operation, a plurality of non-player characters are generated in the game space, and the action of the non-player character in the game space is controlled. A non-player character control unit that functions as a non-player character control unit, wherein the non-player character control unit reduces the action range of the plurality of non-player characters in the game space when a predetermined condition is satisfied. Features.

  According to a second aspect of the present invention, in the first aspect of the invention, the predetermined condition includes that an appearance character that is another non-player character exists in the action range of the plurality of non-player characters. Features.

  According to a third aspect of the present invention, in the first aspect of the present invention, the predetermined condition includes an appearance character that is a player character in the action range of the plurality of non-player characters.

  The invention of claim 4 is the invention according to any one of claims 1 to 3, wherein the game space control means generates one or a plurality of game stages in the game space, and controls the non-player character. The means sets the action ranges of the plurality of non-player characters as one game stage, and sets the action ranges of the plurality of non-player characters as a predetermined area in the one game stage when the predetermined condition is satisfied. It is characterized by.

  According to a fifth aspect of the present invention, in the invention according to the second or third aspect, the non-player character control means sets the area around the appearance character as the predetermined area.

  According to a sixth aspect of the invention, in the fifth aspect of the invention, the non-player character control means causes the plurality of non-player characters to perform an action of protecting the appearance character within the predetermined area. .

  The invention according to claim 7 is the invention according to claim 4, wherein the non-player character control means sets a predetermined fixed area in the game stage as the predetermined area. To do.

  The invention according to claim 8 is the invention according to claim 7, wherein the non-player character control means causes the plurality of non-player characters to perform an action of attacking the appearance character within the predetermined area. To do.

  The invention according to claim 9 is the invention according to claim 8, wherein the non-player character control means acts to attack the appearing characters against the plurality of non-player characters when the appearing characters are in the predetermined area. If the parameter indicating the possibility of attack of the plurality of non-player characters against the appearance character is equal to or greater than a predetermined value, the appearance character is included in the plurality of non-player characters. It is characterized by causing an action to attack.

  The invention according to claim 10 is the invention according to claim 9, wherein the non-player character control means increases the parameter indicating the attack possibility as the distance between the plurality of non-player characters and the appearing character is shorter. The non-player character is raised so as to be damaged by the attack from the appearing character.

  The invention according to claim 11 is the invention according to claim 4, wherein the non-player character control means has an attribute indicating whether it is a friend or enemy of the plurality of non-player characters with respect to the appearance character. It is set, and the predetermined area is determined to be one of a surrounding area of the appearing character and a predetermined fixed area in the game stage according to the attribute of the appearing character.

  According to a twelfth aspect of the present invention, in the invention according to the fourth aspect, the non-player character control means sets a status indicating an action form or an action ability for the appearance character, and sets the predetermined area as the appearance. According to the status of the character, it is determined to be one of a surrounding area of the appearing character and a predetermined fixed area in the game stage.

  According to a thirteenth aspect of the present invention, in the fourth aspect of the present invention, when the non-player character control means does not satisfy the predetermined condition, the action ranges of the plurality of non-player characters are set as the first game stage. And returning to the first game stage from the predetermined area.

  A fourteenth aspect of the present invention is a computer-readable storage medium storing the game program according to any one of the first to thirteenth aspects.

  A fifteenth aspect of the invention is a computer device that reads and executes the game program according to any one of the first to thirteenth aspects.

  According to this invention, by providing a territory for a sub monster and reducing the range of action, it is possible to emphasize the behavior as a group of sub monsters in relation to the main monster, and to express the ecology of the sub monster more realistically. can do.

≪Description of game system≫
A game system 6 to which the present invention is applied will be described with reference to the drawings.
FIG. 1 is an external view for explaining the game system 6. Hereinafter, the game system 6 of the present invention will be described using a stationary game apparatus as an example.

  In FIG. 1, a game system 6 includes a stationary game device (hereinafter simply referred to as a game device) connected to a monitor device 9 such as a home television receiver having a speaker 9a and a display 9b via a connection cord. 10) and a controller 7 for giving operation information to the game apparatus 10. An optical disk 4 which is an example of a replaceable storage medium is set in the game apparatus 10, and a removable memory card 5 for storing game save data and the like in a non-volatile manner is mounted as necessary. The game apparatus 10 is provided with a power ON / OFF switch that is a main power source of the game and an eject switch for attaching and detaching the optical disk 4.

  The controller 7 is an apparatus that is operated by a player and transmits an operation signal indicating the operation content to the game apparatus 10. The game apparatus 10 performs control such as starting and ending the game in accordance with the operation signal transmitted from the controller 7 and advancing the game. Communication between the controller 7 and the game apparatus 10 is performed wirelessly. As a communication unit for this communication, the controller 7 includes a communication unit 75 (see FIG. 4), and the game apparatus 10 includes a receiving unit 36a (see FIG. 2). One to four controllers 7 can be wirelessly connected to one game apparatus 10.

  Note that light emitting units 8 </ b> L and R for informing the controller 7 of the position of the monitor device 9 are attached to the left and right upper surfaces of the monitor device 9. The light emitting units 8L and 8R each incorporate an infrared LED, and emit light with infrared rays while the game apparatus 10 is in operation.

  Next, the functional configuration of the game apparatus 10 will be described with reference to the block diagram of FIG. In FIG. 2, the game apparatus 10 includes a CPU (Central Processing Unit) 30 that executes various programs. The CPU 30 executes a boot program stored in a boot ROM (not shown), initializes a memory such as the main memory 33, and the like, and then executes a game program stored in the optical disc 4 according to the game program. Game processing and the like. A GPU (Graphics Processing Unit) 32, a main memory 33, a DSP (Digital Signal Processor) 34, and an ARAM (Audio RAM) 35 are connected to the CPU 30 via a memory controller 31. In addition, a controller I / F (interface) 36, a video I / F 37, an external memory I / F 38, an audio I / F 39, and a disk I / F 41 are connected to the memory controller 31 via a predetermined bus 42. The receiving unit 36a, the monitor device 9, the external memory card 5, the speaker 9a, and the disk drive 40 are connected to each other.

  The GPU 32 performs image processing based on a command from the CPU 30, and is configured by a semiconductor chip that performs calculation processing necessary for displaying 3D graphics, for example. The GPU 32 generates an image of each frame (two-dimensional image by a known perspective projection method) in a three-dimensional virtual space (game space) using a memory dedicated to image processing (not shown) and a partial storage area of the main memory 33. Then, a game image generated by combining an image such as a cursor with this image is output to the monitor device 9 (display 9b) via the memory controller 31 and the video I / F 37. The main memory 33 is a storage area used by the CPU 30 and appropriately stores a game program read from the optical disc 4 and various data (such as various tables (FIGS. 6 to 10) described later).

  The DSP 34 processes sound data generated by the CPU 30 when the game program is executed, and is connected to an ARAM 35 for storing the sound data. The ARAM 35 is used when the DSP 34 performs a predetermined process (for example, storage of a pre-read game program or sound data). The DSP 34 reads the sound data stored in the ARAM 35 and outputs the sound data to the speaker 9 a provided in the monitor device 9 via the memory controller 31 and the audio I / F 39.

  The memory controller 31 controls the overall data transfer and is connected to the various I / Fs described above. The receiving unit 36a is connected to the memory controller 31 via the controller I / F 36. As described above, the reception unit 36 a receives transmission data from the controller 7 and outputs the transmission data to the CPU 30 via the controller I / F 36 and the memory controller 31. A monitor device 9 is connected to the video I / F 37. An external memory card 5 is connected to the external memory I / F 38 and can access a backup memory or the like provided in the external memory card 5.

  A speaker 9 a built in the monitor device 9 is connected to the audio I / F 39. The speaker 9a outputs sound data read from the ARAM 35 by the DSP 34 and sound data directly output from the disk drive 40. A disk drive 40 is connected to the disk I / F 41. The disk drive 40 reads data stored on the optical disk 4 arranged at a predetermined reading position, and outputs the data to the bus 42 and the audio I / F 39 of the game apparatus 10.

Next, the controller 7 will be described with reference to FIG.
The controller 7 has a housing 71 formed by plastic molding, for example. The housing 71 has a substantially rectangular parallelepiped shape whose longitudinal direction is the front-rear direction, and is a size that can be gripped with one hand of an adult or a child as a whole.

  A cross key 72 c is provided on the center front side of the upper surface of the housing 71. The cross key 72c is a cross-shaped four-direction push switch, and operation portions corresponding to four directions (front and rear, left and right) indicated by arrows are arranged on the cross-shaped projecting piece at intervals of 90 °. When the player presses the operation unit in any direction of the cross key 72c, an operation signal indicating the direction is transmitted from the controller 7 to the game apparatus 10.

  A large number of button switches are provided behind the cross key 72 c on the top surface of the housing 71, and when each button is turned on, a corresponding operation signal is transmitted from the controller 7 to the game apparatus 10. Among these button switches, the A button 72a is provided in the forefront (closer to the cross key 72c).

  On the other hand, a recess is formed on the lower surface of the housing 71. The recess on the lower surface of the housing 71 is formed at a position where the player's index finger or middle finger is positioned when the player holds the housing 71. A button switch 72b is provided on the rear inclined surface of the recess. The button switch 72b is an operation unit that functions as a B button.

  The button switch 72h provided on the front side of the cross key 72c on the upper surface of the housing 71 is a power switch for turning on / off the game apparatus 10 main body remotely.

  In addition, an imaging element 743 (see FIG. 4) for capturing an image in front of the controller 7 is provided on the front surface of the housing 71. The imaging element 743 constitutes a part of the imaging information calculation unit 74 (see FIG. 4). When the controller 7 is supported toward the monitor device 9, the image sensor 743 images the light emitting units 8 </ b> L and R provided on the upper surface of the monitor device 9. The imaging information calculation unit 74 detects the orientation of the controller 7 based on the imaging positions of the light emitting units 8L and R in the imaging element 743.

Next, the internal configuration of the controller 7 will be described with reference to the block diagram of FIG.
In FIG. 4, the controller 7 includes a communication unit 75, an acceleration sensor 701, and a vibrator 704 in addition to the operation unit 72 and the imaging information calculation unit 74 described above.

  The imaging information calculation unit 74 includes an infrared filter 741, a lens 742, an imaging element 743, and an image processing circuit 744. The infrared filter 741 allows only infrared light to pass through from light incident from the front of the core unit 70. The lens 742 condenses the infrared light that has passed through the infrared filter 741 and outputs the condensed infrared light to the image sensor 743. The image sensor 743 is a solid-state image sensor such as a CMOS sensor, for example, and images the infrared rays collected by the lens 742. Therefore, the image sensor 743 captures only the infrared light that has passed through the infrared filter 741 and generates image data. Image data generated by the image sensor 743 is processed by an image processing circuit 744. Specifically, the image processing circuit 744 processes the image data obtained from the image sensor 743 to detect light from the high-luminance part, that is, the light emitting units 8L and 8R, and generates coordinate data indicating their position coordinates. Output to the communication unit 75.

  The acceleration sensor 701 is an acceleration sensor that detects acceleration on three axes of the controller 7 in the vertical direction, the horizontal direction, and the front-rear direction. Data indicating the acceleration detected by the acceleration sensor 701 is output to the communication unit 75.

  The communication unit 75 includes a microcomputer (microcomputer) 751, a memory 752, a wireless module 753, and an antenna 754. The microcomputer 751 controls the wireless module 753 that wirelessly transmits transmission data while using the memory 752 as a storage area during processing.

  An operation signal (key data) from the operation unit 72, an acceleration signal (acceleration data) from the acceleration sensor 701, and coordinate data from the imaging information calculation unit 74 are output to the microcomputer 751. The microcomputer 751 temporarily stores the input data (key data, acceleration data, coordinate data) in the memory 752 as transmission data to be transmitted to the receiving unit 36a.

  Here, the wireless transmission from the communication unit 75 to the receiving unit 36a is performed every predetermined cycle, but since the game processing is generally performed in units of 1/60, a shorter cycle than that is performed. It is necessary to send in. When the transmission timing to the receiving unit 36a comes, the microcomputer 751 outputs the transmission data stored in the memory 752 as a series of operation information and outputs it to the wireless module 753. The wireless module 753 radiates operation information from the antenna 754 as a radio wave signal using a carrier wave having a predetermined frequency.

  The vibrator 704 may be a vibration motor or a solenoid, for example. Since the vibration is generated in the core unit 70 by the operation of the vibrator 704, the vibration is transmitted to the hand of the player holding it, and a so-called vibration-compatible game can be realized.

≪Description of game program≫
Next, a game program executed on this game apparatus will be described. This game program is a so-called hunting action game, in which a player character operated by a player becomes a hunter and a mission (quest) is achieved by subjugating a monster that is an enemy character.

  A monster lives in a field (hunting ground) formed by a plurality of game stages (hereinafter, stages). There are two types of monsters: a main monster that acts as a boss, and a sub-monster that inhabits a “flock”. A group means an aggregate of a plurality of (for example, 3 to 10) sub-monsters that gather in a predetermined area (territory) and perform actions to protect the territory.

  The main monster is a monster with high attack and physical strength, and the sub monster is a monster with low attack and physical strength. Although each sub monster has low attack power and physical strength, each of the sub monsters forms a group and attacks simultaneously, which hinders the player character from achieving the quest.

  A power relationship is set between the main monster and the sub monster. First, among the main monsters, there is a main monster (a ally main monster) that is a boss of a specific sub monster, and a master-slave relationship is set between the sub monster and the ally main monster. Sub monsters and friendly main monsters are similar in appearance and characteristics, and sub monsters act according to the orders of allied main monsters.

  On the other hand, a hostile relationship is set between the sub monster and the main monster (enemy main monster) that does not correspond to the boss, and the sub monster threatens the enemy main monster or performs an attacking action.

  In order to emphasize these power relationships, in this embodiment, when a main monster is present on the same stage, the action range of the sub monster is reduced to a predetermined area (territory), and the relationship with the main monster as one group. The “territory processing” is performed to make an action according to the situation.

  Here, the territory refers to a predetermined area where a group of sub-monsters acts and corresponds to a “predetermined area” in the claims. Further, a main monster (a friend main monster or an enemy main monster) existing on the same stage as the sub monster corresponds to an “appearing character” in the scope of claims. Furthermore, in the present embodiment, “the main monster is present on the same stage as the sub monster” corresponds to the “predetermined condition” in the claims.

  Hereinafter, an example of territory processing will be shown. If there is no main ally monster or enemy main monster on the same stage, the sub-monster performs a normal action (FIG. 7A) with the “normal area” (for example, one stage as a whole) as the action range. On the other hand, if an ally main monster or enemy main monster is present on the same stage, the action range of the sub-monster is reduced from “normal area” to “predetermined area”. The “predetermined area” is set, for example, around a friend main monster when a friend main monster is present, and is set to a predetermined fixed area within the stage when an enemy main monster is present. By this territory processing, it can be emphasized that the sub monsters are acting in groups, and the hostile relationship and the master-slave relationship with the main monster can be made clearer.

  The main monster is provided with a state (status) that is a monster's action mode corresponding to the game situation, and one of “normal state” and “battle state” is set. The normal state is a state in which an enemy (player character or other main monster in hostile relationship) has not been found and normal actions such as walking or looking around are performed. The battle state is a state in which an enemy has been found (the enemy is once caught in the field of view) and is engaged in a battle action such as biting and tail attack.

  A state is set for each sub-monster instead of an individual unit, and any one of “normal state”, “warning state”, and “attack state” is set for the group. When the above-mentioned territory processing is performed, the group state is shifted from the normal state to the alert state or the attack state. When the territory processing ends, the flock state is returned from the alert state or the attack state to the normal state.

  First, if there are ally main monsters in a master-slave relationship on the same stage, sub monsters are gathered in a `` predetermined area '' centered on the ally main monster, and actions corresponding to the actions of the ally main monster in that area are performed. “Friend territory processing” (FIG. 12) is performed. By this process, it is possible to express how the sub monster is powerful due to the presence of the ally main monster as a boss.

  Specifically, when an ally main monster is fighting an enemy, set the state of the flock to the attack state, set up a territory around the ally main monster, and attack the enemy in battle with the ally main monster on the sub monster Attack action (FIG. 7B or FIG. 7C) is performed as a target (target), and if there is no enemy around the sub monster, the sub monster is moved into the territory (FIG. 7D). Note that “there are enemies around” indicates, for example, that the player character and the enemy main monster are within a radius of 30 m centering on the sub-monster.

  On the other hand, when the ally main monster is in a “drown” state and is escaping, a territory is provided around the ally main monster to cause the sub monster to perform an action to help the ally main monster escape. First, the flock state is set to the normal state, and if there is no sub monster in the territory range, the sub monster is moved into the territory range (FIG. 8 (D)) and a warning action is performed (FIG. 8 (C)). . If there is an enemy within the territory, the sub-monster is caused to perform an attacking action (FIG. 8A) against the enemy. Further, even if there is no enemy in the territory range, the sub monster is made to perform an attacking action (FIG. 8B) on an enemy whose hate value, which is a parameter indicating the attack possibility of the monster, is a certain value or more. The hate value will be described later with reference to FIG. The processing based on the action lottery table in FIGS. 8A to 8D is referred to as “single territory processing” (FIG. 14).

  Here, the moribund state refers to a state in which the physical strength value that is a parameter indicating vitality is equal to or less than a predetermined value (for example, 30% or less of the MAX value). When the main monster is attacked by a player character, etc., and the health value falls below the specified value, the main monster becomes moribund, performs an escape action to return to the nest to recover the health value, and moves to another stage To do.

  In addition, when enemy main monsters that are hostile exist on the same stage, sub monsters are gathered in a “predetermined area” that is a fixed area in the stage, and an action to protect the flock in that area is performed. (FIG. 13). By this processing, it is possible to express a situation where the sub monster is afraid of the enemy main monster and escapes to the territory.

  Specifically, when there are enemy main monsters on the same stage, the group is set to the alert state, the sub monster is moved to a predetermined territory range in the stage (FIG. 9 (D)), and the alert action is performed. (FIG. 9C). Then, if there is an enemy within the territory range, the sub monster is caused to perform an attacking action (FIG. 9A) against the enemy. Further, even if there is no enemy in the territory range, the sub monster is made to perform an attacking action (FIG. 9B) on an enemy whose hate value, which is a parameter indicating the attack possibility of the monster, is a certain value or more. The processing based on the action lottery table in FIGS. 9A to 9D is referred to as “single territory processing” (FIG. 14).

  In addition, because the behavior pattern is the same for the single territory processing in the “friendly territory processing” and the same processing in the “enemy territory processing”, but the state of the flock is different (the normal state and the alert state) The action lottery tables used are different (FIGS. 8 and 9), and the types of actions and the lottery probabilities are different.

  A game system as shown in FIG. 5 can be functionally realized by causing the above-described game device to read a game program for executing such a game. The game system includes an operation detection unit 50, a game progress control unit 51, a drawing processing unit 58, and the like. The game progress control unit 51 includes a player character control unit 52, a non-player character control unit 53, and a game space control unit 56. Further, the non-player character control unit 53 includes a main monster control unit 54 that controls the action of the main monster and a sub monster control unit 55 that controls the action of the sub monster. Furthermore, the game space control unit 56 includes a game stage control unit 57 that generates and controls a plurality of stages.

  The operation detection unit 50 includes a data processing unit such as the CPU 30 and the GPU 32 and the controller 7, detects various operations of the player, and transmits them to the game progress control unit 51. The game progress control unit 51 includes a data processing unit such as the CPU 30 and the GPU 32, generates a virtual game space and characters, and changes the above-described game space according to the player's operation and the passage of time. The game is advanced by performing processing such as making the character act.

  The player character control unit 52 generates a player character in the game space and controls the action based on operation information input from the operation detection unit 50. The non-player character control unit 53 generates non-player characters including a main monster and a sub-monster that act in the generated game space, and uses each table (FIGS. 6 to 10) described later to use the non-player character. To control the behavior.

  The main monster control unit 54 generates a main monster and controls its behavior in accordance with an instruction from the game progress control unit 51 based on preset appearance conditions. The sub monster control unit 55 randomly generates a sub monster based on a preset appearance condition or based on a lottery performed by the game progress control unit 51 and controls its action.

  The game space control unit 56 generates a game space for the field selected based on the operation information input from the operation detection unit 50, and controls the environment such as weather and day / night changes in the game space. The game stage control unit 57 further generates a plurality of stages in the field generated by the game space control unit 56 and controls the environment. The drawing processing unit 58 includes a data processing unit such as the CPU 30 and the GPU 32, generates a game space and a game image generated by projecting the game progress control unit 51 on a two-dimensional screen, and outputs the game image to the monitor 9b.

  Hereinafter, each table for managing the sub-monsters and the main monster will be described with reference to FIG. First, FIG. 6A is a diagram showing a status table of sub-monsters. The status of all sub-monsters on the stage is managed by this table. The monster name, physical strength MAX value, physical strength value, hate value, and swarm number are managed.

  The monster name is a name given to the monster, and similar names are given to the sub monster and the ally main monster corresponding to the boss. For example, for the sub-monster “Ranpos” (FIG. (A)), the main friend monster is named “Doslanpos” (FIG. (C)). The physical strength value is a parameter indicating vitality, and the MAX value and the current value are managed in this table.

  The hate value is a parameter indicating the possibility of monster attack, and is provided for each enemy (player character or other main monster in hostile relationship) existing on the same stage. The hate value is updated every frame (for example, 1/30 seconds) and is managed in this table. A method for calculating the hate value will be described later with reference to FIG. The group number is a number indicating which group the sub-monster belongs to.

  Next, FIG. 6B is a diagram illustrating a sub-monster group table. Normally, each sub-monster is controlled independently, but if there are enemies on the same stage, sub-monsters are controlled in groups based on this table. For each group, a status flag, a friendly main monster appearance flag, and a stage number are managed.

  The status flag is a flag that is set when the group status is determined. When the state flag is 0, it is a normal state, when it is 1, a warning state, and when it is 2, it is an attack state. When there is an enemy main monster on the same stage, the flock is put on alert (enemy territory processing). Also, when a ally main monster is present on the same stage and fighting an enemy, the flock is set to attack (ally territory processing).

  The friendly main monster appearance flag is a flag that is set when a friendly main monster that is a boss of the group appears on the same stage. When this flag is 1 (ON), the above-mentioned ally territory process is performed. The stage number is a number indicating in which stage the group exists.

  In the example of FIG. 5B, first, the groups with the group numbers 1 and 5 are present on the stages 2 and 5, respectively, and are in the normal state. Next, the groups with the group numbers 2 and 4 exist in the stage 1, and the enemy main monster also exists in the same stage, and is in the alert state. Thus, a plurality of groups may exist on the same stage. In addition, the group with the group number 3 exists in the stage 3, and the main main monster also exists in the same stage, and is in an attack state.

  Next, FIG. 6C is a diagram showing a status table of the main monster. In this table, the monster name, the physical strength MAX value, the physical strength value, and the hate value are managed as in the status table of the sub monster shown in FIG. In addition, the state flag of the main monster is set, and “1” is set in the “normal state” and “2” is set in the “battle state”. Unlike the sub monsters, the main monsters have a state set for each individual, so the state is managed by the table of each main monster.

  7-10 is a figure which shows the action lottery table which determines the action of a monster. Each table stores the action type of the monster and its lottery probability. The behavior of the monster is determined by lottery based on this behavior lottery table. 7 to 9 are sub monsters, and FIG. 10 is a main monster action lottery table. The action lottery table is provided for each monster state, and by switching this table and performing the lottery, variations according to each state can be given to the monster's action. For the sub-monsters, the action lottery table is selected based on the group status.

  FIG. 7 is a diagram illustrating an action lottery table for sub-monsters when the flock is in a normal state or an attack state. FIG. 11A is a table when the flock is in a normal state and there are no enemies around (see S45 in FIG. 13), and normal actions such as standby action and search action are stored with a predetermined probability. . The position in each action of this table is selected by lottery from the left, right, front and back at 25% each.

  (B) and (C) are tables when the flock is in the normal state and the attack state and there are enemies around (see S45 in FIG. 13 and S26 in FIG. 12). Both tables are sub-monsters and enemies. Depending on the distance to the player character or other main monster in hostile relation, it can be used properly. As the distance, a super short distance, a short distance, a medium distance, a long distance, and others (super far distance) are provided for each predetermined distance.

  FIG. 5B is a table when the distance between the sub-monster and the enemy is from a very short distance to a short distance. The attacking action for the enemy near the tail attack and the first stage with biting is stored with a high probability. FIG. 4C is a table when the distance between the sub monster and the enemy is a distance other than the above (middle distance or more). The attacking actions for distant enemies such as moving to small jump and one step with follow-up biting are stored with a high probability.

  FIG. 11D is a table when the flock is in an attacking state and there are no enemies around (see S27 in FIG. 12), and moves to a randomly determined point within the territory with a probability of 100%. Is remembered.

  FIG. 8 is a diagram illustrating a sub-monster action lottery table when the group is in a normal state and the single territory process (FIG. 14) is performed. This table is used when the ally territory processing is performed for the sub monster, and a territory is provided around the ally main monster to cause the sub monster to perform an action to help the ally main monster escape. (See S17 in FIG. 12). (A) to (D) are properly used depending on conditions such as the positional relationship between the sub-monster and the enemy.

  FIG. 4A is a table used when an enemy is in a territory (see S53 in FIG. 14). The attacking action performed on the enemy with the highest hate value within the territory is stored with a predetermined probability.

  FIG. 7B is a table used when the enemy is outside the territory range but the hate value is equal to or greater than a certain value (see S55 in FIG. 14). Attacking actions to be performed on enemies with a hate value above a certain value in a stage outside the territory range are stored with a predetermined probability.

  FIG. 6C is a table used when the sub monster is within the territory range and the enemy is outside the territory range (see S57 in FIG. 14). Warning actions such as intimidation and backlash are stored with a predetermined probability.

  FIG. 4D is a table used when the sub monster is outside the territory (see S58 in FIG. 14). It is memorized to move to a randomly determined point within the territory with a probability of 100%.

  FIG. 9 is a diagram illustrating a sub-monster action lottery table when a group is in a state of caution and performs a single territory process (FIG. 14). This table is used when the enemy territory processing is performed on the sub-monster, and the state of the flock becomes a warning state due to the presence of the enemy main monster, and a warning action or the like is performed (see S50 in FIG. 13). Similar to the table of FIG. 8, (A) to (D) are selectively used depending on conditions such as the positional relationship between the sub-monster and the enemy, but the action type and the lottery probability are different from those of the table of FIG.

  FIG. 4A is a table used when an enemy is in a territory (see S53 in FIG. 14). The attacking action performed on the enemy with the highest hate value within the territory is stored with a predetermined probability.

  FIG. 7B is a table used when the enemy is outside the territory range but the hate value is equal to or greater than a certain value (see S55 in FIG. 14). Attacking actions to be performed on enemies with a hate value above a certain value in a stage outside the territory range are stored with a predetermined probability.

  FIG. 6C is a table used when the sub monster is within the territory range and the enemy is outside the territory range (see S57 in FIG. 14). Warning actions such as intimidation and backlash are stored with a predetermined probability.

  FIG. 4D is a table used when the sub monster is outside the territory (see S58 in FIG. 14). Similar to the table of FIG. 8D, the table is stored so as to move to a randomly determined point within the territory range with a probability of 100%.

  FIG. 10 is a diagram showing an action lottery table for the main monster in the battle state. In this table, (A) to (D) are properly used depending on the distance between the main monster and the enemy (player character or other main monster in hostile relationship). 3A is used when the distance is very short, FIG. 1B is the short distance, FIG. 3C is the medium distance, and FIG. 4D is the distance other than the above (long distance or more). By switching these tables according to the distance between the main monster and the enemy and performing a lottery, it is possible to perform a battle action that matches the distance from the enemy.

  The action types and the lottery probabilities shown in the above action lottery tables (FIGS. 7 to 10) are merely examples, and can be arbitrarily set. Further, the type and provision of the action lottery table are not limited to the above patterns, and may be freely set for each game situation. Depending on the content of the action lottery table and how it is provided, it is possible to give the character personality and expand the variations of the game.

  In the main monster and the sub monster, a “hate value” that is a parameter indicating the degree of disgust with the enemy is set for each enemy (FIGS. 6A and 6C). The hate value is a parameter for determining the attack target, and the monster targets the player character or other monster having the highest hate value as the attack target.

  For example, when a monster approaches an enemy or receives damage from an enemy attack, the hate value for that enemy increases. Conversely, when a monster attacks an enemy, the hate value for that enemy decreases. Thus, by providing a hate value and changing the value according to the action of the monster or enemy, it is possible to prevent the attack target of the monster from being biased. In the present embodiment, the maximum value of the hate value is set to 20000.

  Hereinafter, a method for calculating the monster hate value will be described with reference to FIG. Note that the calculation formulas and values in each table are changed between the hate value for the player character and the hate value for other monsters (FIGS. 11B and 11C).

  First, FIG. 4A is a diagram showing a monster distance range. In the monster 1, distance ranges (1) to (4) are set in order from the vicinity. Then, the hate value is changed depending on which distance range of the monster 1 the enemy exists. Specifically, the hate value is higher as the enemy is closer to the monster 1, and the hate value is lower as the enemy is farther away. In the example of FIG. 5A, the player character 2 exists in the distance range (2) of the monster 1.

FIG. 5B is a diagram showing a table for calculating a hate value for the player character. The hate value for the player character is updated, for example, every frame by the following calculation formula.
Hate value = previous hate value + (A value + B value + C value + D value) Equation 1

  First, the previous hate value refers to the hate value calculated by Equation 1 in the previous frame. The frame immediately after the monster appears is calculated with the previous hate value set to 0 (initial value). By adding a value (A value + B value + C value + D value) based on the behavior of the monster and the player character in the frame to the previous hate value, the hate value can be updated in units of frames.

  Next, the A value is an increase / decrease value depending on the distance between the monster and the player character, and is set according to the distance range of the monster in which the player character exists ((B) (a) in the figure). In case of distance range (1) (distance from monster is less than 8m), A value is +4, in case of (2) (less than 15m), in case of +2, and in case of (3) (15m or more) In the case of -2, and (4) (outside the stage), it is set to -5. In this way, the A value is increased as the player character is closer to the monster, and the A value is decreased as the player character is farther away.

  Next, the B value is a decrease value due to the monster attacking the player character, and is set to -20 every frame during the attack ((B) and (b) in the figure). While the monster is performing an attacking action, by lowering the hate value of the attacking player character, it is possible to prevent the same opponent from becoming an attack target for a long time.

  Next, the C value is an increase value due to the item use of the player character. When the player character performs a challenge issuance action with an item such as a horn on the monster, the frame is set to +200 for each frame while the effect of the item is continuing (for example, while the sound continues to ring) (see FIG. (B) (c)). The player character can use his / her item such as a horn to rapidly increase his hate value to attract the monster to the attack target and help the fellow player character who was the attack target.

  Next, the D value is an increase value due to the monster being attacked by the player character. When the monster is damaged by the attack of the player character, it is set to + damage value × 10 + 200 ((B) (d) in the figure). By rapidly raising the hate value of the attacking player character, a player character who is willing to fight can be targeted for monster attack, and a natural battle can be performed. The D value is added only in the frame immediately after the attack.

FIG. 6C is a diagram showing a table for calculating hate values for other monsters. The hate value for other monsters is updated, for example, every frame by the following calculation formula.
Hate value = previous hate value + (A value + B value + D value) Equation 2

  In Equation 2, unlike the above-described Equation 1 for calculating the hate value for the player character, the C value is not set because other monsters do not use items. Further, in Expression 2, the A value and the B value are set so as to be less likely to rise and to be easily lowered than in Expression 1 (FIGS. 10C, 10A, and 10B). That is, the hate value for other monsters is set so as to be less likely to rise than the hate value for the player character. This makes it easier for the player character to be a monster attack target than other monsters.

  As in FIGS. 2B and 2A, the A value is set according to the distance range in which other monsters exist (FIGS. 1C and 1A). In case of distance range (1) (distance from monster is less than 8m), A value is +3, in case of (2) (less than 15m), +1, in case of (3) (15m or more) In the case of the same -4 and the same (4) (outside the stage), it is set to the same -5. Other monsters are more likely to be attacked as they are closer to the monster, but are less likely to be attacked than player characters in the same distance range.

  Next, the B value is set to -24 every frame while the monster is attacking another monster ((C) and (b) in the figure). Similarly to FIGS. 5B and 5B, while the monster is performing an attacking action, the hate value of the other monster to be attacked is lowered, but is set to be lower than the player character.

  Next, as in FIGS. 4B and 4D, the D value is set to + damage value × 10 + 200 when the monster is damaged by the attack of another monster ((C) ( c)). By rapidly raising the hate value of other monsters that have attacked and allowing monsters to fight each other, the monster's ecology can be realistically expressed. It should be noted that the D value is added only in the frame immediately after the attack as in Equation 1.

  Hereinafter, the friendly territory process, the enemy territory process, and the single territory process performed in both processes will be described with reference to the flowcharts of FIGS. FIG. 12 is a flowchart for explaining the friendly territory processing, FIG. 13 is a flowchart for explaining the enemy territory processing, and FIG. 14 is a flowchart for explaining the single territory processing. Each processing is repeatedly executed, for example, for each frame. In each flowchart, “enemy” refers to a player character that is an enemy to a sub monster (or a friend main monster) and another main monster in a hostile relationship. Further, the processing according to these flowcharts is executed for each group of sub-monsters.

  FIG. 12 is a flowchart for explaining the ally territory process performed by the sub-monster control unit 55. The ally territory process is a process that gathers sub monsters in a predetermined area centering on the ally main monster when the ally main monster is on the same stage, and causes the monster to act according to the action of the ally main monster in that area. is there.

  First, it is determined whether or not a teammate main monster is present on the same stage (S11). If there is no teammate main monster (NO in S11), the enemy territory process shown in FIG. 13 is performed (S12). When the ally main monster exists (YES in S11), it is determined whether or not this ally main monster is in a battle state (S13). If the ally main monster is not in a battle state (NO in S13), the enemy territory process of FIG. 13 is performed (S12).

  In S13, when the ally main monster is in a battle state (YES in S13), it is determined whether or not the ally main monster is in a moribund state and is performing an escape action (S14). When the ally main monster is performing the escape behavior (YES in S14), the group state is set to the normal state (S15). Then, a group of territory is set to a predetermined area (for example, a circle with a radius of 12 m) centered on the main monster (S16), and the single territory process of FIG. 14 is performed (S17).

  In S14, when the ally main monster is not escaping (NO in S14), it is determined whether the ally main monster is moving on the stage (S18). The ally main monster moves the stage when a predetermined time elapses or when there is a monster stronger than itself. If the ally main monster is moving on the stage (YES in S18), the group's action range is set to the normal area (entire stage) (S19), and the enemy territory process of FIG. 13 is performed (S20).

  In S18, when the ally main monster is not moving on the stage (NO in S18), the group state is set to the attack state (S21). Then, the territory of the group is set to a predetermined area centered on the main monster (S22), and the target of the main monster (enemy with the highest hate value of the main monster) is set as the target of the group (S23).

  After S24, processing is repeated for the number of sub-monsters in order to perform processing for each sub-monster (unit) belonging to the group. First, in order to process the first submonster, 1 is substituted for n (S24), and it is determined whether or not there is a target around the submonster (S25).

  If there is no target around the sub monster (NO in S25), the sub monster is moved into the territory (S27). This movement is performed based on the table of FIG. The position to be moved is randomly determined from the coordinates within the territory. On the other hand, when there is a target around the sub monster (YES in S25), the sub monster is caused to perform an attacking action on the target (S26). This attacking action is performed based on the table of FIG.

  After the process of S26 or S27, n + 1 is substituted for n in order to process the next sub-monster (S28). If n is less than or equal to the number of sub-monsters (NO in S29), the processes of S25 to S28 are repeated. If n is greater than the number of sub-monsters (YES in S29), the process in this frame is terminated. Return.

  FIG. 13 is a flowchart illustrating enemy territory processing performed by the sub-monster control unit 55. The enemy territory process is a process in which, when the enemy main monster exists on the same stage, the sub monsters are gathered in a predetermined area in the stage and the action of defending the flock in the area is performed.

  First, it is determined whether there is an enemy main monster on the same stage (S40). If there is no enemy main monster on the same stage (NO in S40), it is determined whether the group is in a normal state (S40). S41). If the group state is not the normal state (NO in S41), the group state is set to the normal state (S42), and the group action range is set to a normal region (entire stage) (S43).

  In S44 to S47, in order to perform processing for each sub monster (single unit) belonging to the group, the processing is repeated for the number of sub monsters. First, in order to perform processing for the first sub-monster, 1 is substituted for n (S44), and the sub-monster is caused to perform a normal action (S45). This normal action is performed based on the table shown in FIG. 7A when there is no enemy around the sub-monster, and based on the table shown in FIG. 7B or C when there is an enemy.

  Thereafter, in order to process the next sub-monster, n + 1 is substituted for n (S46). If n is less than the number of sub-monsters (NO in S47), the processes of S45 and S46 are repeated. If n is larger than the number of sub-monsters (YES in S47), the process in this frame is terminated. Return.

  In S40, if there is an enemy main monster on the same stage (YES in S40), the flock state is set to the alert state (S48). Then, a group of territory is set in a predetermined area in the stage (S49), and the single territory process of FIG. 14 is performed (S50).

  FIG. 14 is a flowchart for explaining a single territory process performed by the sub-monster control unit 55. The single territory process is a process for causing each sub monster (single) belonging to the group to perform an action according to the positional relationship and hate value of the sub monster and the enemy. As described above, this process is performed when helping the main monster to escape in the normal state in the ally territory process, or when the flock is in the alert state in the enemy territory process.

  Since this process is a process for each sub monster (unit), the process is repeated for the number of sub monsters. First, in order to process the first sub-monster, 1 is substituted for n (S51), and it is determined whether there is an enemy in the territory (S52). If there is an enemy within the territory (YES in S52), if there is only one enemy (head), the sub monster is caused to perform an attacking action on the enemy. Further, if there are a plurality of enemies (heads), the enemy with the highest hate value of the sub-monster is caused to perform an attacking action. This attacking action is performed based on the table of FIG. 8A when the flock is in the normal state (friend territory processing) and based on the table of FIG. 9A when the flock is in the alert state (enemy territory processing). Further, the territory range is set around the main monster when the group is in the normal state or the attack state, and is set to a predetermined area (fixed area) in the stage when the group is in the alert state.

  In S52, when there is no enemy in the territory range (NO in S52), it is determined whether or not there is an enemy in the stage outside the territory range whose monster has a hate value of a certain value (for example, 8000) or more (S54). . If there is an enemy with a hate value above a certain value in the stage (YES in S54), if there is only one person (head) above the certain value, that enemy has the highest value if there are multiple people (heads) The sub monster is made to attack the enemy against the enemy (S55). This attacking action is performed based on the table of FIG. 8B when the flock is in the normal state (friendly territory processing) and based on the table of FIG. 9B when the flock is in the alert state (enemy territory processing). The processing of S54 and S55 is processing for preventing the sub monster that has escaped from the territory from being attacked unilaterally by a remote attack (such as a bow or a gun) from an enemy outside the territory. Moreover, these processes are not essential and may not be provided.

  In S54, when there is no enemy whose hate value is equal to or greater than a certain value in the stage (NO in S54), it is determined whether or not the sub-monster itself is within the territory range (S56). If the sub-monster is within the territory (YES in S56), a warning action is performed (S57). This warning action is performed based on the table of FIG. 8C when the group is in a normal state (friendly territory processing), and when the group is in a warning state (enemy territory processing).

  On the other hand, if the sub-monster is not within the territory (NO in S56), it is moved into the territory (S58). This movement is performed based on the table of FIG. 8D when the flock is in the normal state (friend territory processing) and based on the table of FIG. 9D when the flock is in the alert state (enemy territory processing). The position to be moved is randomly determined from the coordinates within the territory.

  In addition, even if it is set so that the called sub monster always calls the ally main monster together with a sub monster that has been called by the boss's ally main monster. Good (for example, when “friend call” is won in the action lottery based on the table of FIG. 10). In this case, in S20 of FIG. 12, the sub-monster is not subjected to enemy territory processing, and the stage is moved together with the main monster.

  In the present embodiment, the territory processing is performed on the condition that “the main monster or enemy main monster exists on the same stage as the sub monster”, but the territory processing may be performed based on other conditions. For example, territory processing may be performed in order for the sub-monsters to survive on condition that the health value of half or more of the sub-monsters has become a predetermined value or less.

  Further, in this embodiment, the behavior of the sub monster is controlled (territory processing) according to predetermined “attributes” such as the ally main monster and the enemy main monster, but the parameter ( For example, the behavior of the sub monster may be controlled in accordance with the main monster's status, such as a health value, a hate value, and a state.

  For example, when the physical strength value of the ally main monster is greater than or equal to a predetermined value or when the state is a battle state, the sub monsters are gathered around the main monster. On the other hand, when the ally main monster is in a moribund state (physical strength value is a predetermined value or less) or a normal state, the sub monsters are gathered in a fixed area (territory) of the stage.

  Furthermore, in this embodiment, although the predetermined area (circle in the example) centering on the ally main monster is a gathering area (territory), the shape is not limited to a circle as long as it is an area around the ally main monster, Any shape is acceptable. Further, the ally main monster does not necessarily have to be at the center of the gathering area, and for example, the gathering area may be a straight line behind a ally main monster by a predetermined distance.

  In the present embodiment, the non-player character (ally main character, enemy main character) has been described as an appearance character. However, the player character may be included in the appearance character. In this case, the character having an action range around the player character is not a sub-monster, but a character that is a friend of the player character.

  In this embodiment, the “territory range” is defined as a predetermined area in one stage, but the entire game space composed of a plurality of stages is defined as a “normal area” of the sub monster's action range, One entire stage may be a “territory range”.

  The game stage may be one instead of plural. In this case, all or a part of one game stage is set as a “normal area”, and the territory processing is performed when the main monster exists in this area. The “territory range” in this case is a predetermined area in the “normal area” or around the main monster.

  In the present embodiment, the enemy character has been described as a monster. However, the enemy character is not limited to a monster, and may be a fighter or a humanoid enemy character. When a fighter is an enemy character, for example, a configuration of a shooting game in which a plurality of enemy fighters attack a fighter that is a player character may be employed. By controlling a plurality of fighters as one group, the movement of the controlled army can be expressed realistically. Therefore, the present invention can be suitably applied to any game that performs a battle between a player character and an enemy character regardless of genre.

  In the present embodiment, a game device which is a stationary home game machine has been described as an example. However, the game control program may be incorporated into another general-purpose computer such as a portable game device or a personal computer. Is possible. It can also be implemented as an arcade game machine.

External view for explaining a game system to which the present invention is applied Functional block diagram of the game apparatus shown in FIG. The perspective view which shows the external appearance structure of the controller shown in FIG. Block diagram showing the configuration of the controller The figure which shows the structure of the game system comprised with a game program and a game device. The figure explaining the table set up in the game program The figure explaining the table set up in the game program The figure explaining the table set up in the game program The figure explaining the table set up in the game program The figure explaining the table set up in the game program The figure explaining the table set up in the game program A flowchart showing the operation of the game system A flowchart showing the operation of the game system A flowchart showing the operation of the game system

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Monster 2 Player character 50 Operation detection part 51 Game progress control part 52 Player character control part 53 Non-player character control part 54 Main monster control part 55 Sub monster control part 56 Game space control part 57 Game stage control part 58 Drawing process part

Claims (15)

Computer
Game space control means for generating a game space in which a player character and a non-player character act,
Player character control means for generating a player character operated by a player in the game space and controlling the action of the player character in the game space in accordance with the player's operation;
Non-player character control means for generating a plurality of non-player characters in the game space and controlling actions of the non-player character in the game space;
A game program that functions as
The non-player character control means includes
A game program that reduces the action range of the plurality of non-player characters in the game space when a predetermined condition is satisfied.   The game program according to claim 1, wherein the predetermined condition includes an appearance character that is another non-player character in the action range of the plurality of non-player characters.   The game program according to claim 1, wherein the predetermined condition includes an appearance character being a player character in the action range of the plurality of non-player characters. The game space control means generates one or a plurality of game stages in the game space;
The non-player character control means sets the action ranges of the plurality of non-player characters as one game stage, and sets the action ranges of the plurality of non-player characters within the one game stage when the predetermined condition is satisfied. The game program according to claim 1, wherein the game program is a predetermined area.   The game program according to claim 2 or 3, wherein the non-player character control means sets the periphery of the appearing character as the predetermined area.   The game program according to claim 5, wherein the non-player character control means causes the plurality of non-player characters to perform an action of protecting the appearing character within the predetermined area.   The game program according to claim 4, wherein the non-player character control means sets a predetermined fixed area in the game stage as the predetermined area.   The game program according to claim 7, wherein the non-player character control means causes the plurality of non-player characters to perform an action of attacking the appearance character within the predetermined area. The non-player character control means causes the plurality of non-player characters to perform an action of attacking the appearing character when the appearing character is in the predetermined area,
An action of attacking the plurality of non-player characters against the non-player character when the appearance character is outside the predetermined area and the parameter indicating the attack possibility of the non-player characters against the appearance character is a predetermined value or more; The game program according to claim 8, wherein the game program is executed.   The non-player character control means increases a parameter indicating the attack possibility as the distance between the plurality of non-player characters and the appearing character is closer, and the non-player character is damaged by the attack from the appearing character. The game program according to claim 9, wherein the game program is raised as much as possible. The non-player character control means includes
For the appearance character, set an attribute indicating whether it is a friend or enemy of the plurality of non-player characters,
The said predetermined area | region is determined according to the said attribute of the said appearance character as either one of the circumference | surroundings of the said appearance character, or the predetermined fixed area | region in the said game stage. Game program. The non-player character control means includes
For the appearance character, set a status indicating the action form or action ability,
The said predetermined area | region is determined to either the surroundings of the said appearance character, or the predetermined fixed area | region in the said game stage according to the said status of the said appearance character. Game program.   The non-player character control means returns the action range of the plurality of non-player characters from the predetermined area in the one game stage to the one game stage when the predetermined condition is not satisfied. 4. The game program according to 4.   A computer-readable storage medium storing the game program according to any one of claims 1 to 13.   A computer device that reads and executes the game program according to any one of claims 1 to 13.