JP2002166045A - Game device, game providing method, and information storing medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To judge the suitableness for an attack to an enemy game character by taking the moving speeds of ally game characters and a distance to the enemy game character under consideration in a combat scene of a role playing game or the like. SOLUTION: The ally game characters 44a and 44b are registered as the members of a buddy 44. When a game command is thrown in with the buddy 44 as a unit, the ally game characters 44a and 44b move in the combat field toward the energy game character 42. In this case, when a distance between the ally game character 44a or 44b and the enemy game character 42 is long, and also, a maximum moving distance (moving speed) of the enemy game character is short, even if the ally game character 44a or 44b starts moving to the enemy game character 42, the ally game character 44a or 44b does not reach the place of the enemy game character 42 during one turn, and the attack is postponed to the next turn or later.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a game apparatus, a game providing method, and an information storage medium, and more particularly to a technique for utilizing a moving speed of an ally game character in a role playing game to produce a battle with an enemy game character.

[0002]

2. Description of the Related Art Role-playing games are a category of games in which various ability parameters of friendly game characters are raised through battles with enemy game characters, thereby gradually clearing difficult game events. Game stories are often assembled on the theme of adventures in Japan, and have been popular among game fans.

[0003] In the battle scene of such a role-playing game, when a player gives game commands such as "attack", "defense", "magic", and "item use" to each ally game character at the beginning of each turn, In many cases, each ally game character follows it.

[0004]

In a conventional role-playing game, in a battle scene, an ally game player and an enemy game character are arranged at predetermined positions, and each game character attacks, defends, and uses magic based there. Most use items and return to the original position every turn. However, it is unnatural for a game character to return to a predetermined position every turn. If the game character can freely position during the battle, not only can such unnaturalness be eliminated, but also the degree of freedom of strategy can be increased, and the fun of the role playing game can be further increased.

[0005] However, if the ally game character can be freely positioned as described above, the distance to the enemy game character will change during the battle. At this time, if a direct attack can be performed immediately regardless of whether the character is a distant enemy game character or a nearby enemy game character, not only is the reality impaired, but also the free positioning of the ally game character can be achieved. Despite the possibility, the strategic nature of the game does not improve.

The present invention has been made in view of the above-mentioned problems, and an object of the present invention is to judge whether or not an attack on an enemy game character is possible in consideration of a moving speed of an ally game character and a distance from the enemy game character. It is an object of the present invention to provide a game device, a game providing method, and an information storage medium that can perform the game.

[0007]

In order to solve the above problems, a game device according to the present invention receives an instruction from a player every turn, and in accordance with the instruction, a plurality of friendly game characters and an enemy game character in a game space. In a fighting game device, a moving speed storage means for storing a moving speed of each ally game character, and a player with respect to at least one ally game character so as to move toward an enemy game character in a certain turn and launch an attack after moving. Attack instruction determining means for determining whether to attack in the same turn based on the moving speed of the friendly game character, the distance to the enemy game character, and the time of one turn, If it is determined that an attack is possible, the at least one friend game character is Moving the character toward the character, and launching an attack on the enemy game character after the movement, while determining that the attack is impossible in the same turn, the at least one ally game character is replaced with the enemy game character. And attack processing means for deferring an attack on the enemy game character after the next turn.

A game providing method according to the present invention is a game providing method for receiving a command from a player every turn, and providing a game in which a plurality of friendly game characters battle an enemy game character in a game space according to the command. When the player instructs at least one ally game character to move toward the enemy game character in a certain turn and launch an attack after the movement, the moving speed of the ally game character is set to the value of each ally game character. An attack possibility determining step of determining whether or not an attack in the turn is possible based on the moving speed, the distance to the enemy game character, and the time of one turn, while reading the moving speed of the character from the storage means; If it is determined that an attack is possible, the at least one ally game The character is moved toward the enemy game character, and after the movement, the enemy game character is attacked. On the other hand, if it is determined that the attack is impossible in the same turn, the at least one ally game character And moving the character toward the enemy game character, but deferring the attack on the enemy game character from the next turn onward.

Further, the information storage medium according to the present invention uses a computer to provide a game in which a plurality of ally game characters battle with an enemy game character in the game space in accordance with the instructions from the player every turn. The information storage medium, wherein when a player instructs at least one ally game character to move toward an enemy game character in a certain turn and launch an attack after the movement, the movement of the ally game character The speed is read from the storage means storing the moving speed of each ally game character, and the possibility of attack is determined based on the moving speed, the distance to the enemy game character, and the time of one turn. In the determining step, if it is determined that an attack is possible in the same turn, At least one ally game character is moved toward the enemy game character, and after the movement, the enemy game character is attacked. On the other hand, if it is determined that an attack is not possible in the same turn, An attack processing step of causing the computer to execute at least one ally game character toward the enemy game character, but to defer attacking the enemy game character from the next turn onward. It is something that I remember.

[0010] In the present invention, the moving speed of each ally game character is stored, and the player can turn the game character at a certain turn.
If at least one ally game character is instructed to move toward the enemy game character and launch an attack after the movement, the moving speed of the ally game character, the distance between the ally game character and the enemy game character, Based on the time of one turn, it is determined whether or not an attack in the same turn is possible. When it is determined that an attack is possible, the ally game character is moved toward the enemy game character, and after the movement, the enemy game character is attacked. On the other hand, if it is determined that an attack is impossible, the ally game character is moved toward the enemy game character, but the attack on the enemy game character is
Defer after the next turn.

According to the present invention, it is possible to determine whether or not to attack the enemy game character in consideration of the moving speed of the ally game character, the distance to the enemy game character, and the time of one turn. When the position can be freely set in the game space, it is possible to suitably produce an appearance in which the ally game character approaches and attacks the enemy game character. In addition, the player gives an instruction to the friendly game character in consideration of the moving speed of the friendly game character and the distance between the friendly game character and the enemy game character. Therefore, according to the present invention, the strategic nature of the game can be enhanced, and the interest of the game can be increased.

Further, according to one aspect of the present invention, the game apparatus further includes quickness storage means for storing quickness of attack preparation of each ally game character, wherein the attack possibility determination means moves toward the enemy game character in a certain turn. When the player instructs at least one ally game character to launch an attack after moving, and further determines whether or not to attack in the same turn based on the quickness of the attack preparation of the ally game character. . In this case, it is necessary to give an instruction to the ally game character in consideration of the quickness of the attack preparation of each ally game character, so that the strategy of the game can be further enhanced.

[0013]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Preferred embodiments of the present invention will be described below in detail with reference to the drawings.

FIG. 1 is a diagram showing a configuration of a game device according to an embodiment of the present invention. Hereinafter, a method for realizing a role-playing game to which the present invention is applied using the game device 10 shown in FIG.

A game apparatus 10 shown in FIG. 1 is configured by connecting a monitor 18 and a speaker 22 to a consumer game machine 11 and further mounting a DVD-ROM 25 as an information storage medium. Here, the game program (including game data; the same applies hereinafter) is used to execute the home game machine 11
DVD-ROM 25 is used to supply
-Any other information storage medium, such as a ROM or ROM card, can be used. Further, the game program can be supplied to the home game machine 11 from a remote place via a communication network 27 such as the Internet.

In the home-use game machine 11, a microprocessor 14, an image processing unit 16, a main memory 26, and an input / output processing unit 30 are connected via a bus 12 so as to be able to communicate with each other.
Further, a memory card 33, a controller 32, an audio processing unit 20, a DVD reproducing unit 24, and a communication unit 25 are connected to the input / output processing unit 30. Each component of the consumer game machine 11 other than the controller 32 is housed in a housing. The memory card 33 is provided detachably from the housing, so that players can save their own game data. For the monitor 18, for example, a home television receiver is used, and for the speaker 22, for example, its built-in speaker is used.

The microprocessor 14 has an R (not shown).
Based on an operating system (OS) stored in the OM and a game program read from the DVD-ROM 25, each unit of the consumer game machine 11 is controlled. The bus 12 is used for exchanging addresses and data between the units of the consumer game machine 11. The main memory 26
The game program read from the DVD-ROM 25 is written in the ROM as necessary. The image processing unit 16 is configured to include a VRAM, receives image data sent from the microprocessor 14, draws a game screen on the VRAM, converts the content into a video signal, and outputs the video signal to the monitor 18 at a predetermined timing. Output.

The input / output processing unit 30 is an interface for relaying data communication between the memory card 33, the controller 32, the audio processing unit 20, the DVD reproducing unit 24, the communication unit 25, and the microprocessor 14. The controller 32 is input means for the player to perform a game operation. The input / output processing unit 30 has a predetermined period (for example, 1/6
(Every 0 seconds), the operation state of various buttons of the controller 32 is scanned, and an operation signal indicating the scan result is transmitted to the bus 1.
2 to the microprocessor 14. The microprocessor 14 determines a game operation of the player based on the operation signal. The audio processing unit 20 is configured to include a sound buffer, reproduces data such as music and game sound effects read from the DVD-ROM 25 and stored in the sound buffer, and outputs the data from the speaker 22. The DVD-ROM playback unit 24 reads a game program recorded on the DVD-ROM 25 according to an instruction from the microprocessor 14. The memory card 33
Information for each player, for example, a play history and various game settings are stored. The communication unit 25 is an interface for connecting the game apparatus 10 to a communication network 27 such as the Internet, and includes, for example, a modem, a terminal adapter, and the like. For connection to the communication network 27, various methods such as a public telephone line, a cable television network, and an optical fiber network can be adopted.

Hereinafter, the game apparatus 10 having such a configuration will be described.
A method for realizing a role playing game using will be described in detail.

FIG. 2 shows a screen displayed first on the battle scene of the role playing game displayed on the monitor 18 of the game apparatus 10. In the role playing game, when an enemy game character is encountered in a dungeon (cave) or field (field), a battle start screen 40 shown in FIG. On the battle start screen 40, the friendly game characters 44a,
44b, 46a, 46b, 48a, 48b are displayed,
An enemy game character 42 is displayed on the upper side of the screen. Friendly game characters 44a, 44b, 46a, 46b, 4
8a, 48b and the enemy game character 42 are stored in the main memory 2
6 are arranged facing each other in the battle field in the game space (virtual three-dimensional space) constructed in 6,
Friendly game characters 44a, 44b, 46a, 46
A state in which the enemy game character 42 is viewed from the viewpoint arranged above and behind b, 48a, and 46b is superimposed and displayed on the monitor 18. Although the figure shows a human-shaped game character, any type of game character such as a robot, an animal, a monster, etc. may be used.

In this role playing game,
Friendly game characters 44a, 44b, 46a, 46
b, 48a and 48b are divided into three groups. Here, these groups will be called "buddies". The game characters 44a and 44b are buddy 4
4, the game characters 46a and 46b belong to the buddy 46, and the game characters 48a and 48b belong to the buddy 48.

The two ally game characters belonging to the same buddy are assigned to the front guard and the rear guard.
The avant-garde ally game character and the rear-guard ally game character are aligned and face the enemy game character 42, and the avant-garde ally game character is closer to the enemy game character 42, and the rear-guard ally game character is closer to the enemy game character 42. Each of them is arranged on a side far from the game character 42. FIG. 3 shows a more specific example of the battle start screen, and FIG. 4 schematically shows a state of an object space (game space) for synthesizing the screen.

It should be noted that the player can arbitrarily specify which buddy and where (avant-garde or rear-guard) to place which ally game character. At this time,
In this role playing game, the avant-garde ally game characters 44a, 46a, and 48a are easily damaged by an attack from the enemy game character 42, but are likely to damage the enemy game character 42 during the attack, while Rear guard ally game characters 44b, 46
Although b and 48b are hardly damaged by the attack from the enemy game character 42, they are controlled so as not to easily damage the enemy game character 42 at the time of the attack. For this reason, the player can advance the battle to an advantage by forming a buddy in an appropriate combination after carefully considering the characteristics of the teammate game character. That is, in this role playing game, the player can enjoy the pleasure of devising a combination of buddies.

FIGS. 5 and 6 are views for explaining an example of a user interface for a player to form a buddy. When forming a buddy, the player performs a predetermined operation as shown in FIG.
Is displayed on the monitor 18.
On the buddy registration screen 56, horizontally long member display columns 52a to 52c respectively corresponding to the buddies 1 to 3 are provided, and the names of the front and rear ally game characters and the rear and rear ally game characters are displayed in the respective member display columns 52. A game character name display frame 50 is displayed. In other words, which of the ally game characters are assigned to the avant-garde and the back-guard of the buddies 1 to 3 is shown in a matrix, and the game characters respectively corresponding to the avant-garde and the back-guard of the buddies 1 to 3 In the name display frame 50, the names of the friendly game characters assigned to the names are displayed. When the name is not displayed, it indicates that no friendly game character is assigned to the name.

The player displays the buddy registration screen 56 on the monitor 18, moves the cursor 54 indicating one of the game character name display frames 50 using the controller 32, and tries to allocate a friendly game character. Specify the buddy to perform and the front / back position (press the enter button).

FIG. 6 shows a screen displayed on the monitor 18 in response to the designation. The figure shows a friendly game character selection screen 60, in which the names of friendly game characters that can be selected by the player are displayed in a list, and where each friendly game character is currently located and in which buddy. Is also displayed. A friendly game character not registered in the buddy is displayed to that effect. The player moves the cursor 58 displayed so as to surround the name of the ally game character in the same figure using the controller 32, and specifies the ally game character to be assigned to the buddy specified on the buddy registration screen 56 and the front and rear position. . Thus, the player can register any game character at any position of any buddy. When a friend game character already registered in the buddy is designated, the original registration of the friend game character may be canceled.

FIG. 7 shows the role playing game in which the ally game characters 44a, 44b, 46a, 4
The screen displayed on the monitor 18 during the battle between the enemy game characters 42 and 6b, 48a, 48b is shown. In this role playing game, when a friendly game character encounters an enemy game character in a dungeon or a field, a battle starts. At this time, the battle is performed on a turn basis. That is, the battle is performed at regular intervals (turns), and the player gives instructions to the buddies 44 to 48 at the beginning of each turn. Performs an operation corresponding to the instruction in the turn, for example, attack, defense, magic, use of an item, and the like.

At this time, as shown in the in-combat screen 41 in FIG. 7, in this role playing game, the ally game character can freely move in the battle field set in the game space, and If the buddy instructed to attack includes a direct attack type ally game character such as “warrior”, the buddy starts moving toward the enemy game character 42. Then, at least one of the members approaches the enemy game character 42 and directly attacks the enemy game character 42. When a buddy instructed to attack by the player includes a remote attack type ally game character such as "bow warrior" or "shooter", the buddy stays there and the enemy game character 4
Attack 2

The buddy instructed to defend stays there to prepare for an attack from the enemy game character 42. Further, the buddy instructed to perform the spell approaches the enemy game character 42 and spells the spell, or spells the spell from the spot, depending on the type of the spell. The former is the case where the magical effect range is limited to a certain range from the casting position,
The latter is not limited.

FIGS. 8 and 9 show an example of an object space for synthesizing a screen during a battle, and FIGS. 10 to 13 show a situation in which a friend game character is using magic. Among them, FIG. 10 shows a case in which a type of magic that has an effect within a certain range from a specific target is used (a certain range type of target), and FIG. FIG. 12 shows a case in which a type of magic that has an effect on all enemies or friendly game characters within a certain range from a game character using magic is used (whole magic type).
FIG. 13 shows a case where a type of magic that has an effect on either an enemy or an ally within a certain range from the game character using the magic is used (single target type; the target is out of the effective range when the spell is executed) In this case, another target within the effective range is automatically selected.). In FIGS. 8 and 9, the friendly game characters drawn in light tones are for indicating the movement position during the battle.

In this role playing game,
What type of ally game character (Berserker (Berserker), attacking warrior, defense warrior, bow warrior, archer, wizard, etc.) is combined with which type of ally game character at which position (front and back) of the buddy In addition, how to behave is stored in advance as a table for each buddy instruction (game command) from the player, and specific behavior of each ally game character is determined based on the table. (Means behavior determination means). FIG. 14 shows an example of such a table.

Further, in the game apparatus 10, when the ally game character of the rear guard is attacked by the enemy game character 42, the DVD-ROM 25 stores, as a table, which of the front guard and the rear guard is in charge of the actual defense. In this role-playing game, the behavior of the front-guard ally game character when the rear-guard ally game character is targeted for attack is determined based on the table (group association means).
At the time of this behavior determination, the type and state (hit point) of the ally game character of the rear guard are referred to.

That is, in this role playing game, a hit point (parameter) is set for each ally game character, and when this hit point becomes zero, the ally game character stops operating according to the instruction from the player. I have. This is a situation in which a friend game character cannot participate in a battle in the game space. The hit points are reduced when, for example, the enemy game character 42 receives damage by an attack. In addition, depending on the growth degree of the character,
Alternatively, the maximum value of the hit points (the value when the hit points are most recovered) differs depending on the characteristics of the character.

In the table, for example, the avant-garde is a first type of ally game character (Berserker, attacking warrior, defensive warrior, bow warrior), and the rear guard is also a first type of ally game character. In this case, if the front guard is attacking or using magic or an item, the rear guard is directly attacked by the enemy game character 42. If the hit points of the ally game character are reduced to less than half of the maximum value and the hit points of the avant-garde ally game character are more than half of the maximum value,
The avant-garde takes the place of the rear guard and the enemy game character 42
It is defined to be attacked by Here, the behavior of the ally game character is determined depending on whether or not it is less than half of the maximum value of the hit point. However, the current value of the hit point, the maximum value of the hit point, etc. The behavior of the ally game character can be determined based on appropriate criteria. In addition to hit points, allied game characters are in a state of confusion,
Alternatively, the behavior may be determined according to various state parameters such as being poisoned.

Further, in the above table, for example, when the avant-garde is a first-type friendly game character and the rear-guard is a second-type friendly game character (shooter, magician), when the avant-garde is defending, of course. Even if the rear guard is attacked by the enemy game character 42 during the attack, it returns and is attacked on behalf of the enemy game character 42. However, when the front guard is using magic or an item, the rear guard keeps the enemy game character 42 as it is. It is also defined to be attacked from.

FIG. 15 shows an example of such a table. In the table shown in the figure, "warrior" refers to Berserker, attacking warrior, defense warrior and bow warrior,
"Arrow and magic" refers to archers and wizards. Also,"*
"1" means that if both hit points are equal to or greater than one, one of them is determined by the attack direction, and if one of the hit points is less than half the maximum amount of hit points, the remaining character will be protected by the game character. It indicates turning. "* 2" indicates that the avant-garde returns and goes to defense, but the Berserker-type friendly game character does not return to defense.

As described above, the avant-garde ally game character is substituted for the attack from the enemy game character 42 in accordance with the type and the hit point of the other ally game character in the buddy. , It is possible to produce a sense of unity and a sense of solidarity between the friendly game characters that constitute the game. In addition, the player sends a friendly game character with a small current value of the hit point or a friendly game character with a small maximum value of the hit point to the rear guard, and a friendly game character with a large current value of the hit point in the avant-garde or the maximum of the hit point. By arranging the ally game characters having a large value, the ally game characters of the rear guard can be protected, so that the formation of such buddies can be enjoyed.

In this role playing game,
As described above, when the player instructs the buddy to attack, for example, the ally game characters constituting the buddy start moving in the battle field, but at this time, the ally game characters constituting the buddy do not separate from each other by a predetermined distance or more. It has become. That is, more than half of the distance that the avant-garde ally game character can move in one turn (which represents the moving speed (foot speed) of the ally game character, and is hereinafter referred to as “maximum moving distance”) is a buddy. They cannot be separated from each other.

For example, if the maximum moving distance of the advancing ally game character is 20 and the maximum moving distance of the ally game character of the rear guard is 10, both cannot be separated by more than 10. For this reason, two vanguards were used in the first turn.
If 0 and the rear guard approach the enemy game character by 10, both of them can move only by 10 after the next turn. In this way, by preventing the ally game characters constituting the buddy from being separated from each other by a predetermined distance or more,
It is possible to avoid a problem that the ally game characters belonging to the same buddy are separated from each other in the battle field, and the player does not know which ally game character and which ally game character belong to the same buddy.

In this role playing game,
As described above, when the rear-guard ally game character is attacked by the enemy game character, depending on the situation, the front-guard ally game character returns to the rear-guard ally game character and takes the place of the attack as a substitute. However, as described above, the distance to the rear guard is limited to less than a certain value based on the maximum moving distance (moving speed) of the ally game character of the front guard, so that such an effect can be performed without discomfort. In this role playing game, the maximum moving distance is set in advance for each game character. The maximum moving distance may change according to the growth of the game character.

Further, in the role playing game, as described above, the ally game character and the enemy game character can freely position in the battle field, and the ally game character approaches the enemy game character, and There is an attack pattern of direct attack. At this time, the ally game character and the enemy game character are far apart,
If the feet of the friendly game character are slow (the maximum moving distance is small), even if the player instructs the buddy to attack directly, the player only approaches the enemy game character but does not reach the direct attack.

For this reason, in this role playing game, when the player inputs a game command at the beginning of each turn, a battle assistance window 70 illustrated in FIGS. 16 to 20 is displayed on the monitor 18. In these figures, the turn display 72 indicates a time axis, and vertical bars displayed at regular intervals indicate breaks in battle turns. In the turn display 72, three turns after the current time are sequentially displayed from the left to the right. The length between breaks represents one turn of time.

The attack preparation time gauge 80 indicates the time required for preparation for the ally game character to make a direct attack. This shows that the longer the attack preparation time gauge 80 is, the longer it takes to prepare for an attack. In this role-playing game, a parameter representing the quickness of the attack preparation is set for each ally game character, and the length of the attack preparation time gauge 80 is determined based on this parameter. ing.

Further, the movement time gauge 82 indicates the time required to reach a position where an enemy game character can be attacked. The longer the movement time gauge 82 is, the longer the movement takes. The length of the gauge is determined based on the maximum moving distance (moving speed) corresponding to each friendly game character and the distance from the friendly game character to the enemy game character.

Then, as shown in FIG. 16 (a) or (b), when the attack preparation time gauge 80 and the movement time gauge 82 fall within the current turn (the leftmost time range in the turn display 72). Indicates that it is possible to directly attack the enemy game character in the current turn. On the other hand, as shown in FIG. 17, if the attack preparation time gauge 80 and the movement time gauge 82 do not fit within the current turn, it is impossible to directly attack the enemy game character in the current turn, and You must start preparing for the attack as needed while approaching the character, and defer the direct attack from the next turn. In this case, the battle assist window 70 of FIG. 7A is displayed in the current turn, and the battle assist window 7 in FIG.
0 will be displayed. It should be noted that the attack preparation time gauge 80 and the movement time gauge 82 shown in the battle assistance window 70 of FIG. The portion corresponding to the next turn in 82 is displayed again.

If the ally game character is already close to the enemy game character and does not need to move,
As shown in FIG. 18, the movement time gauge 82 is not displayed in the battle assistance window 70, and the attack preparation time gauge 80 is repeatedly displayed as long as it fits in one turn time. The figure shows that two direct attacks are possible in the current turn.

In FIG. 16 and FIG. 17, the attack preparation time gauge 82 is based on an attack pattern in which the attack preparation is started in the middle of the movement and an attack is made immediately upon completion of the movement.
In the case of an attack pattern in which it is necessary to stop and prepare for an attack after arriving at the attackable area near the enemy game character, as shown in FIG. After that, the attack preparation time gauge 80 extends.

Further, if the movement time is shorter than the attack preparation time, the attack preparation time gauge 80 becomes longer than the movement time gauge 82 as shown in FIG. In this case, there is no difference from the case of directly attacking without moving.

If the battle assistance window 70 is presented to the player at the beginning of each turn in this way, if the player instructs the buddy to attack directly, the player can surely attack in the current turn or after the next turn At a glance, you can judge whether the attack will be delayed.

As described above, according to the present game apparatus 10, one of two ally game characters is registered as a front guard and the other as a rear guard in one buddy, and game commands are input in units of buddies. Therefore, the player can promptly input a game command.

Further, based on the moving speed (maximum moving distance) of the avant-garde, the ally game characters belonging to the same buddy are prevented from being separated from each other by a certain distance or more, so that the members can be kept separated in the battle field. . Also, it is possible to suitably produce a state in which the front guard returns to the rear guard as needed.

Further, based on the time of one turn, the distance between the enemy game character and the ally game character, and the moving speed (maximum moving distance) of the ally game character, the ally game character can reach the range that can be attacked in one turn. Approach the character and determine if a direct attack is possible,
If it is not possible, the direct attack is deferred from the next turn only by approaching the enemy game character, so that the game strategy can be diversified and the fun of the role playing game can be increased.

The present invention is not limited to the embodiments described above, and it is obvious that those skilled in the art can make various modifications within the scope of the present invention.

[0054]

As described above, according to the present invention,
Based on the time of one turn for each turn, the distance between the enemy game character and the friendly game character, and the moving speed of the friendly game character, it is determined whether or not an attack in the same turn is possible. In addition, the ally game character is moved toward the enemy game character, and an attack is performed after the movement. On the other hand, if it is determined that the ally game character is impossible, the ally game character is simply moved toward the enemy game character. , The attack will be deferred after the next turn,
Considering the distance between the enemy game character and the ally game character and the moving speed of the ally game character, it is possible to make it necessary to give an instruction to the ally game character, thereby increasing the fun of the game.

[Brief description of the drawings]

FIG. 1 is a diagram showing a configuration of a game device according to an embodiment of the present invention.

FIG. 2 is a diagram illustrating an example of a battle start screen of a role playing game.

FIG. 3 is a diagram showing a more specific example of a battle start screen.

FIG. 4 is a diagram schematically illustrating an object space for synthesizing the battle start screen of FIG. 3;

FIG. 5 is a diagram showing an example of a buddy (group) registration screen.

FIG. 6 is a diagram showing an example of a game character selection screen.

FIG. 7 is a diagram illustrating an example of a screen during a battle in a role playing game.

FIG. 8 is a diagram schematically illustrating an object space during a battle.

FIG. 9 is a diagram schematically illustrating an object space during a battle.

FIG. 10 is a diagram schematically illustrating an object section when an ally game character is using magic.

FIG. 11 is a diagram schematically illustrating an object section when a friendly game character is using magic.

FIG. 12 is a diagram schematically illustrating an object section when a friendly game character is using magic.

FIG. 13 is a diagram schematically illustrating an object section when a friendly game character is using magic.

FIG. 14 is a diagram showing an example of a table in which a command to a buddy and the behavior of each friendly game character in response to the command are recorded.

FIG. 15 is a diagram illustrating an example of a table that records which of the front-guard and rear-guard ally game characters is responsible for defense when the rear-guard ally game character becomes an attack target.

FIG. 16 is a diagram illustrating an example of a battle assistance window.

FIG. 17 is a diagram illustrating an example of a battle assistance window.

FIG. 18 is a diagram illustrating an example of a battle assistance window.

FIG. 19 is a diagram illustrating an example of a battle assistance window.

FIG. 20 is a diagram illustrating an example of a battle assistance window.

[Explanation of symbols]

10 game device, 11 home game machine, 12 bus, 14 microprocessor, 16 image processing unit, 1
8 monitors, 20 audio processing units, 22 speakers, 24
DVD playback unit, 25 DVD-ROM, 26 main memory, 27 communication network, 30 input / output processing unit, 3
1 communication unit, 32 controller, 33 memory card, 40 battle start screen, 41 battle screen, 42 enemy game character, 44, 46, 48 buddy, 44
a, 44b, 46a, 46b, 48a, 48b Friend game character, 50 character name display frame, 52a-
52c Member display column, 54, 58 Cursor, 56
Buddy registration screen, 60 friendly game character selection screen, 70 battle assistance window, 72 turn display, 8
0 Attack preparation time gauge, 82 movement time gauge.

Claims (4)

[Claims] A moving speed storage means for storing a moving speed of each ally game character in a game device which receives an instruction from a player for each turn, and in which a plurality of ally game characters fight against an enemy game character in the game space according to the instruction. When a player instructs at least one ally game character to move toward an enemy game character in a certain turn and launch an attack after the movement, the moving speed of the ally game character and the enemy game character Means for judging whether or not an attack can be made in the same turn based on the distance of one turn and the time of one turn; and when it is judged that an attack is possible in the same turn, the at least one ally game character is defeated by an enemy. Move toward the game character, and after the movement, The attacker launches an attack on the kuta, and if it is determined that the attack is not possible in the same turn, the at least one ally game character is moved toward the enemy game character. Attack processing means for deferring the attack from the next turn onward. 2. The game device according to claim 1, further comprising quickness storage means for storing quickness of each ally game character's preparation for attack, wherein said attack possibility determination means determines whether an enemy game character is to be turned on in a certain turn. If the player instructs at least one ally game character to move toward and launch an attack after the move, whether or not to attack in the same turn based on the quickness of the attack preparation of the ally game character A game device. 3. A game providing method for receiving an instruction from a player for each turn, and providing a game in which a plurality of ally game characters battle with an enemy game character in a game space in accordance with the instruction. When at least one ally game character is instructed by the player to move toward and attack after the movement, the moving speed of the ally game character is stored, and the moving speed of each ally game character is stored. As well as its speed, distance to the enemy game character,
And an attack determination step of determining whether an attack is possible in the same turn based on the time of the turn and, if it is determined that an attack is possible in the same turn, the at least one ally game character is set as an enemy game character. While moving toward the enemy game character after the movement, and if it is determined that an attack is not possible in the same turn, the at least one ally game character is directed toward the enemy game character. An attack processing step of deferring an attack on the enemy game character after the next turn even if the player character moves. 4. An information storage medium for receiving an instruction from a player for each turn and providing a game in which a plurality of ally game characters fight with an enemy game character in a game space according to the instruction using a computer. When the player instructs at least one ally game character to move toward the enemy game character in the turn and launch an attack after the movement, the movement speed of the ally game character is changed by the movement of each ally game character. In addition to reading the speed from the storage means, the moving speed, the distance to the enemy game character,
And an attack determination step of determining whether an attack is possible in the same turn based on the time of the turn and, if it is determined that an attack is possible in the same turn, the at least one ally game character is set as an enemy game character. While moving toward the enemy game character after the movement, and if it is determined that an attack is not possible in the same turn, the at least one ally game character is directed toward the enemy game character. An attack processing step of deferring an attack on the enemy game character after the next turn even if the computer is moved.