JP2006314717A - Game program, and game apparatus - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an unconventional game with much savor by which a player runs away in the position of a mole to be whacked, contrary to a Whack-A-Mole game. <P>SOLUTION: A plurality of holes are arranged in the two or three-dimensional virtual game space of a game apparatus. The player selects one of the holes and performs an operation to display the image of a player character. The player plays the game by aiming at displaying the image of the player character at the outer side of the holes for a longer time. When the image of the player character is displayed at the outer side of the holes, a mole character having a hammer comes near to attack the player character, so that the player character has to hide in the hole not to be attacked by the mole character. The game aims at the displaying of the image of the player character at the outer side of the holes as long as possible. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a game program and a game apparatus, and more specifically, a game program and a game for executing a game that runs away from a player who is hit by a player, as opposed to a conventional game of hitting a player. Relates to the device.

Conventionally, a so-called mole hitting game has been proposed in which a player hits a target appearing from an opening on a play board surface. As an example of a mole hitting game, there is a game device described in Patent Document 1.
JP-A-57-170276

  The conventional mole hitting game described in Patent Document 1 has a mechanism in which a player plays by hitting a mole appearing from an opening. However, since this basic mechanism has not changed at all from the beginning of the invention, there is no novelty as a game device. Game devices are always aimed at attracting players with fresh novelty, but it can be said that conventional mole-playing games are no longer sufficient to perform this function.

  Therefore, an object of the present invention is to provide a game program and a game apparatus for executing a game in which the player runs in a mole position where the player is beaten, contrary to the conventional mole hitting game.

  The present invention employs the following configuration in order to solve the above problems. Note that the reference numerals in parentheses and supplementary explanations in this section show the correspondence with the embodiments described later in order to help understanding of the present invention, and do not limit the present invention.

The first invention is an image of a game space in which a player character (player character 70) operated by a player and a first non-player character (mole character 74 to 76) that is controlled by a computer and moves based on a predetermined rule appear. Is a game program that is executed by the computer (CPU 31) of the game device (3) that displays the image on the display device (TV 2). The game program includes a first position determination step, a player character display step, a first cumulative time measurement step, a first non-player character display step, a first determination step, and a first game processing step. And causing the computer to execute a first game display step. In the first position determination step, the position where the image of the player character is to be displayed is determined in accordance with the operation of the game controller (controller 6) by the player. In the player character display step, an image of the player character is displayed at the position determined in the first position determination step while the player continues to input a specific operation. When there is no input of the specific operation, the player character display Does not display images. Alternatively, when there is no specific operation, the player character image is displayed at the position determined in the first position determination step, and the player character image is not displayed while the specific operation is being input. . In the first accumulated time measuring step, the accumulated time (90 to 93) of the display time during which the player character image is displayed is measured. In the first non-player character display step, an image of the first non-player character is displayed. In the first determination step, when the player character image is displayed, it is determined that the display position of the first non-player character image and the position determined in the first position determination step are in a predetermined relationship. To do. In the first game process step, a predetermined game process is performed when it is determined in the first determination step that there is a predetermined relationship. In the first game display step, display according to the accumulated time measured in the first accumulated time measuring step is performed.

In the second invention, the first movement step of moving the first non-player character toward the position determined by the first position determination step when the image of the player character is displayed. Let it run.

In the third invention, in the first position selection step, one position may be determined from a plurality of predetermined positions (100 to 110).

  In the fourth invention, the position may be determined by moving the cursor (80) displayed on the screen in the first position determining step.

In the fifth invention, in the first game processing step, when the first non-player character performs an attacking action on the player character and the attack hits the player character, the player character moves for a certain period of time. The first cumulative time measurement step may not be measured while the player character is inoperable.

  In the sixth invention, the remaining time (94) until the game program ends is measured and displayed on the screen, and when the remaining time runs out, an end step of ending the game program is executed.

In the seventh invention, in the second position determination step, the computer selects a position where an image of the second non-player character (rival characters 71 to 73) controlled by the computer is displayed. In the second non-player character display step, an image of the second non-player character is displayed at the position determined in the second position determination step. In the second accumulated time measuring step, the accumulated time (91 to 93) of the display time during which the image of the second non-player character is displayed is measured. In the second moving step, the first non-player character is displayed as an image of the player character or the second non-player character that is closest in distance among the player character whose image is displayed or the second non-player character. Move towards position. In the second determination step, when the image of the second non-player character is displayed, the display position of the image of the first non-player character and the position determined by the second position determination step are in a predetermined relationship. Judge that. In the second game process step, a predetermined game process is performed when it is determined in the second determination step that the predetermined relationship is established. In the second game display step, display according to the accumulated time measured in the first and second accumulated time measuring steps is performed.

According to an eighth aspect of the present invention, in the second game processing step, when the first non-player character performs an attack action on the second non-player character and the attack hits the second non-player character, The second non-player character may be disabled for a certain period of time, and measurement may not be performed while the second non-player character is disabled in the second cumulative time measurement step.

  In the ninth invention, in the second display step, the player character and the second non-player character at the time point when the game program ends at the end step are compared, and the player who has the most accumulated time is compared. The character or the second non-player character may be displayed as a winner.

  In the tenth invention, in the first position determination step and the second position determination step, the player character or the second position is determined at the position already determined by another first position determination step or second position determination step. When the non-player character is displayed, the position may not be determined by another first position determination step or second position determination step.

  In addition, the present invention may be provided in the form of a game device having a function equivalent to a function realized by executing the game program.

  According to the first invention, the player can freely operate to display or not display the image of the player character by designating a position where the player character is to be displayed. Thereby, the player can perform the same operation as the mole in the conventional mole hitting game. A predetermined game process is executed when the first non-player character controlled by the computer has a predetermined positional relationship with the player character. Thereby, it is possible to cause the computer to execute the same operation as the player who hits the mole in the conventional mole hitting game. In the first invention, the game is further changed according to the accumulated time during which the player character is displayed. Thus, the player character is displayed with a position farther away from the first non-player character moving in real time, and the player character image is a little longer before being attacked by the first non-player character. It is possible to enjoy the strategy according to the game situation, such as continuously displaying and acquiring the accumulated time. In addition, it is possible to enjoy a game in which reflexes are competed such that the player character is operated so as not to be displayed immediately before the position between the two becomes a predetermined relationship and more accumulated time is acquired. Therefore, according to the first aspect of the invention, it is possible to provide an interesting game that does not exist in the past, in which the player runs around so as not to be beaten and hit.

  Further, according to the second invention, since the first non-player character controlled by the computer moves toward the position where the player character is displayed, there are more opportunities for the player character to be attacked. You can enjoy a tense game.

  Further, according to the third aspect, since the position for displaying the player character is determined from a plurality of predetermined positions, it is easy to designate the position by operating the cross key (62) of the game controller.

  According to the fourth invention, since the position is determined by moving the cursor displayed on the screen, it becomes easy to specify the position by operating the cross key or the like of the game controller.

  Further, according to the fifth invention, the penalty is that the first non-player character attacks the player character like a player who hits a mole in a conventional mole hitting game, and if the attack hits, the player character becomes inoperable for a certain period of time. You can enjoy a more tense game.

  In addition, according to the sixth invention, it is possible to enjoy a strategic and tense game in which more accumulated time is acquired until the game ends.

  According to the seventh aspect of the invention, the computer controls the display of the image by determining the display position of the second non-player character in the same manner as the player character. Then, the accumulated display time is measured. Thereby, the second non-player character can be a competitor to the player character.

  According to the eighth invention, the first non-player character attacks the second non-player character in the same manner as the player character, and when the attack hits, the player character becomes inoperable for a certain period of time as with the player character. Take a penalty. As a result, the second non-player character becomes a completely equal competitor with the player character, so that a more heated game can be enjoyed.

  Further, according to the ninth aspect, it is possible to play a game in which the second non-player character is a competitor to the player character, and the player who has acquired more accumulated time is the winner.

  According to the tenth aspect, the player character and the second non-player character are not displayed at the same position at the same time, thereby preventing the characters from overlapping and becoming difficult to see.

  Hereinafter, a game apparatus and a game program according to an embodiment of the present invention, and a game system including the game apparatus will be described. FIG. 1 is an external view of the game system 1. In the present embodiment, a stationary game device will be described as an example of the game device according to the present invention, but the game system is not limited to this, and for example, a portable game device, an arcade game device, a portable game device, and the like. The present invention can be applied to a device equipped with a computer that executes a game program, such as a terminal, a mobile phone, or a personal computer.

  In FIG. 1, a game system 1 includes a stationary game device (hereinafter simply referred to as a game device) 3 and a television receiver (example of a display device connected to the game device 3 via a connection cord). (Hereinafter simply referred to as television) 2. A controller 6 having a plurality of operation switches that can be operated by a player is connected to the game apparatus 3. The game apparatus 3 is detachably mounted with an optical disk 4 as an example of an information storage medium storing the game program according to the present invention. Furthermore, a cartridge 5 equipped with a flash memory or the like for storing game save data or the like is detachably attached to the game apparatus 3 as necessary. The game apparatus 3 displays a game image obtained by executing a game program stored on the optical disc 4 on the television 2. Furthermore, the game apparatus 3 uses the save data stored in the cartridge 5 to execute a continuation of a game executed in the past or reproduce a game state executed in the past, and transfer a game image to the television 2. It can also be displayed. The player of the game apparatus 3 can enjoy the game by operating the controller 6 while viewing the game image displayed on the television 2.

  The controller 6 is detachably connected to the game apparatus 3 via the connection cord as described above. The controller 6 is an operation means for mainly operating a player object appearing in the game space displayed on the television 2 (an object (character) that is an operation target of the player). As a plurality of operation switches, an operation button, It has input units such as keys and sticks. Specifically, the controller 6 is formed with a grip portion that is gripped by the player. The controller 6 includes a main stick 61 and a cross key 62 that can be operated with the thumb of the left hand of the player, a C stick 67 and an A button 63 that can be operated with the thumb of the right hand, and the like. In addition to the above buttons, the controller 6 includes a B button 64, an X button 65, a Y button 66, a start-pause button, an R button and a Z button that can be operated with the index finger of the player's right hand, and the player's left hand. Includes an L button that can be operated with an index finger or the like. In addition, the game system 1 allows a plurality of players to play a game simultaneously by connecting a plurality of controllers 6 to the game apparatus 3.

  Next, the configuration of the game apparatus 3 according to the present invention will be described with reference to FIG. FIG. 2 is a functional block diagram of the game system 1. In FIG. 2, the game apparatus 3 includes a CPU (Central Processing Unit) 31 that executes various programs. The CPU 31 executes a startup program stored in a boot ROM (not shown), initializes a memory such as the work memory 32, and the like, and then once loads a game program stored in the optical disk 4 into the work memory 32. The game program is executed, and a game process corresponding to the game program is performed. The CPU 31 includes a work memory 32, a video RAM (VRAM) 33, an external memory interface (I / F) 34, a controller interface (I / F) 35, a GPU (Graphics Processing Unit) 36, and an optical disk drive 37 via a bus. Connected.

  The work memory 32 is a storage area used by the CPU 31 and appropriately stores a game program and the like necessary for the processing of the CPU 31. For example, the work memory 32 stores a game program read from the optical disc 4 by the CPU 31 and various data. The game program and various data stored in the work memory 32 are executed by the CPU 31. The VRAM 33 stores game image data for displaying a game image on the television 2. The external memory I / F 34 connects the game apparatus 3 and the cartridge 5 in a communicable manner by fitting the cartridge 5 into a connector (not shown). The CPU 31 accesses the backup memory provided in the cartridge 5 via the external memory I / F 34. The controller I / F 35 connects the external device and the game apparatus 3 so that they can communicate with each other by a connector (not shown). For example, the controller 6 is engaged with the connector via a connection cord and connected to the game apparatus 3 via the controller I / F 35. The controller 6 outputs operation data indicating the operation contents to the game apparatus 3 in response to the operation of the analog stick 61 and the C stick 67 by the player and the pressing operation of the operation buttons 62 to 66. The GPU 36 is configured by a semiconductor chip that performs processing such as vector calculation and rendering processing necessary for displaying 3D graphics in accordance with an instruction from the CPU 31, and a game image rendered by the GPU 36 is displayed on the television 2. The The optical disk drive 37 reads various data such as a game program, image data, and sound data stored in the optical disk 4 in response to an instruction from the CPU 31.

  Hereinafter, game processing executed in the game apparatus 3 by the game program stored on the optical disc 4 will be described. First, the outline of the game in this embodiment will be described. This game is a game in which a plurality of holes are installed in a two-dimensional or three-dimensional virtual game space, and one of the plurality of holes is selected to display an image of a character operated by the player. The player plays the game for the purpose of displaying the image of the player character outside the hole for a longer time. However, while the image of the player character is displayed outside the hole, the mole character with the hammer approaches to attack the player character, so it must be hidden in the hole so that it is not attacked by the mole character. . Thus, it is an object of the present game to display the image of the player character outside the hole for as long as possible while hiding in the hole so as not to be attacked by the mole character.

  In this game, a plurality of characters appear in the game space. The character may be a player character operated by the player, a mole character imitating a mole attacking the player character (corresponding to a first non-player character), or a rival character (first character) that competes with the player character in the same manner as the player character. Equivalent to 2 non-player characters). Hereinafter, a character that can be operated by the player is referred to as a player character, a character that imitates a mole that attacks the player character is referred to as a mole character, and a character that competes with the player character by performing the same operation as the player character is referred to as a rival character. . The player character and rival character that are attack targets of the mole character are collectively referred to as attack target characters.

  The player character is a character that can be operated by the player. The player can perform detailed operations using the controller 6 such as an operation for determining a hole (position) for displaying the player character and an operation for displaying the player character in the determined hole. Specifically, in this embodiment, one of the plurality of holes is selected by the cursor, and the player character is placed at the position of the hole selected by the cursor only while the player is pressing the A button 63. Displayed (the player character is not displayed while the A button 63 is released). Further, when the player tilts the main stick 61, the hole being selected is changed to a hole adjacent to the direction in which the main stick 61 is tilted. Note that the player character may be displayed at the position of the selected hole only while the player releases the A button 63, and the player character may not be displayed while the A button is pressed.

  On the other hand, the movement of the mole character is controlled by the game apparatus 3. That is, the game apparatus 3 controls the movement of the wobble character based on a predetermined action rule that is determined in advance. As an action rule, for example, a rule “go to attack target character displayed at a position closest to you” or a rule “attack the attack target character that is playing the most advantageous game” Etc. are considered. In addition, in order to produce the individuality of a plurality of mole characters, different motion rules may be assigned to each mole character. The game apparatus 3 controls the movement of the mole character according to the assigned movement rules.

  The rival character is controlled by the game device 3. That is, the game apparatus 3 controls the movement of the rival character based on a predetermined movement rule that is determined in advance. For example, a rule that “selects the hole farthest from the mole character and displays the image of the character” or “a hole that is not determined by another attacking character is selected at random. A rule such as “display an image of” may be considered. In addition, in order to produce the individuality of a plurality of rival characters, different operation rules may be assigned to each rival character. The game apparatus 3 controls the movement of the rival character according to the assigned movement rule. When two or more players play a game, the rival character may be operated by an opponent player (a player different from the player who operates the player character).

  FIG. 3 is a diagram illustrating an example of a game screen in the present embodiment. As shown in FIG. 3, an image of the game space viewed from the virtual camera is displayed on the screen of the television 2. In FIG. 3, a player character 70 operated by the player, rival characters 71 to 73 competing with the player for the game, and mole characters 74 to 76 attacking the player character and the rival character's attack target character appear. A plurality of holes 100 to 110 exist in the game space, and the player character and the rival character select one of the holes and display an image.

  When selecting a hole, the cursors 80 to 83 are moved to select the hole. The cursor 80 corresponds to the player character 70, the cursor 81 corresponds to the rival character 71, the cursor 82 corresponds to the rival character 72, and the cursor 83 corresponds to the rival character 73. In the present invention, in order to easily distinguish the cursor 80 of the player character 70 and the cursors 81 to 83 of the rival characters 71 to 73, the former is displayed with a dotted line and the latter is displayed with a solid line. However, in an actual game, all the cursors are displayed in different colors so that they can be distinguished.

  In the four corners of the screen, the accumulated time of the time when the images of the player character and the rival character are displayed is displayed. The accumulated time 90 corresponds to the player character 70, the accumulated time 91 corresponds to the rival character 71, the accumulated time 92 corresponds to the rival character 72, and the accumulated time 93 corresponds to the accumulated time of the rival character 73.

  The remaining time of the game is displayed at the top of the screen. This remaining time is subtracted from the time at the start of the game (30 in FIG. 3), and the game ends when it reaches zero. The attack target character that has acquired the most accumulated time until the remaining time becomes 0 becomes the winner of the game.

  Since FIG. 3 is a screen at the time of starting the game, a message notifying that the game “START!” Has started is displayed in the center of the screen. All characters are arranged in a specific position. In addition, the accumulated time is all zero. The remaining time at the start of the game is 30, and the game proceeds until it becomes zero.

  Next, the progress of the game will be described. FIG. 4 is a diagram showing a game screen after a certain period of time has elapsed since the start of the game in FIG. The accumulated time during which the images of the player character 70 and the rival characters 71 to 73 are displayed is displayed in the accumulated time 90 to 93 from FIG. 3 to FIG. The remaining time 94 changes from 30 to 15.

The player can cause the player character 70 to perform detailed actions. Specifically, by tilting the analog stick 61 of the controller 6 in a desired direction, the cursor 80 can be moved to any of the holes 100 to 110 existing in the direction corresponding to the tilted direction of the analog stick 61. it can. Further, by pressing the A button 63 of the controller 6, the image of the player character 70 can be displayed in the hole selected by the cursor 80. When the A button 63 is not pressed, only the cursor 80 is displayed. In FIG. 4, the cursor 80 is moved to the hole 105 and selected, and an image of the player character 70 is displayed.

  The rival character 71 moves the cursor 81 to the hole 102 to select it, and displays an image of the rival character 71. The rival character 72 moves the cursor 82 to the hole 110 and selects it, and displays an image of the rival character 72. The rival character 73 is selected by moving the cursor 83 to the hole 104, but the image of the rival character 73 is not displayed. The mole character 74 attacks the player character 70 as an attack target. Mole characters 75 and 76 are moving with the rival character 72 as an attack target. The operations of the rival characters 71 to 73 and the round characters 74 to 76 are controlled by the game apparatus 3 based on a predetermined operation rule.

  In FIG. 4, images of the player character 70, the rival character 71, and the rival character 72 among the attack target characters are displayed. However, since the player character 70 is attacked by the mole character 74, the player character 70 becomes inoperable for a certain period of time. During this time, the accumulated time 90 counted while the image is displayed is not counted, and the operation by the controller 6 cannot be performed. The accumulated time 91 of the rival character 71 and the accumulated time 92 of the rival character 72 are counted. The accumulated time 93 of the rival character 73 is not counted.

  FIG. 5 is a diagram showing a game screen after a certain time has elapsed from FIG. The accumulated time during which the images of the player character 70 and the rival characters 71 to 73 are displayed is displayed in the accumulated time 90 to 93 from FIG. 3 to FIG. The remaining time 94 changes from 15 to 10.

In FIG. 4, the player character 70 is in an inoperable state, but in FIG. 5, it has returned to a normal state. The player tilts the analog stick 61 of the controller 6 to the upper left and moves the cursor 80 to the hole 101. Further, since the A button 63 of the controller 6 is not pressed, the image of the player character 70 is not displayed.

  The rival character 71 has moved the cursor 81 to the hole 100, but the image of the rival character 71 has not been displayed yet. The rival character 72 moves and selects the cursor 82 in the hole 110 and displays an image of the rival character 72. However, since the rival character 72 has been attacked, the rival character 72 is disabled. The rival character 73 moves the cursor 83 to the hole 104 to select it, and displays an image of the rival character 73. In FIG. 3, the mole character 74 has the play or character 70 as an attack target. However, since the image of the player character 70 is no longer displayed, another character is changed to the attack target. In FIG. 3, the mole character 75 is set to the rival character 72 as an attack target. However, since the rival character 72 is already attacking another mole character 76, the rival character 73 displayed nearby is changed to the attack target. Is moving. The mole character 76 attacks the rival character 72 as an attack target.

  In FIG. 5, images of the rival character 72 and the rival character 73 among the attack target characters are displayed. However, the rival character 72 is inoperable for a certain period of time because the attack of the mole character 76 is hit. During this time, the accumulated time 93 counted while the image is displayed is not counted. The accumulated time 93 of the rival character 73 is counted.

  FIG. 6 is a diagram showing a game screen after a certain time has elapsed from FIG. The accumulated time during which the images of the player character 70 and the rival characters 71 to 73 are displayed is displayed in the accumulated time 90 to 93 from FIG. 3 to FIG. The remaining time 94 changes from 10 to 5.

Although the player character 70 is not displayed in FIG. 5, it is displayed at the position of the hole 101 in FIG. The player presses the A button 63 of the controller 6 to display the image of the player character 70. Since the mole characters 74 to 76 are at a distant position, there is a chance to display images for a lot of time.

  The rival character 71 has moved the cursor 81 to the hole 100, but the image of the rival character 71 has not yet been displayed. Since there is a round character 75 in the vicinity, the player is wary. Although the rival character 72 was inoperable in FIG. 5, it has returned to the normal state and is hidden in the hole 110. This is to avoid attacking the mole character 76 again. The rival character 73 moves the cursor 83 to the hole 104 to select it, and displays an image of the rival character 73. The mole character 74 is moving with the rival character 73 being changed to an attack target. The mole character 75 is moving with the rival character 73 as an attack target. In FIG. 5, the mole character 76 has set the rival character 72 as an attack target, but since the image of the rival character 72 is not displayed, another character has been changed to the attack target.

  In FIG. 6, images of the player character 70 and the rival character 73 among the attack target characters are displayed. The accumulated time 90 of the rival character 70 and the accumulated time 93 of the rival character 73 are counted.

  FIG. 7 is a diagram illustrating a screen in which the game is over after a certain period of time has elapsed from FIG. The accumulated time during which the images of the player character 70 and the rival characters 71 to 73 are displayed is displayed in the accumulated times 90 to 93 from FIG. 3 to FIG. The remaining time 94 changes from 5 to 0. In the center of the screen, a message indicating that the game “Finish!” Has ended is displayed.

  FIG. 8 is a diagram showing a screen in which a winner is determined from the player character 70 and the rival characters 71 to 73 after the game is over. The character with the longest accumulated time at the end of the game becomes the winner. In FIG. 8, since the rival character 73 has the longest accumulated time 93, the rival character 73 is displayed in the center as a winner, and the other player characters 70 and rival characters 71 to 72 are driven off the screen by the mole character 74. It is. In FIG. 8, the player character 70 and the rival character 71 have already been driven out of the screen, and only a part of the rival character 72 is displayed.

  As described above, in this embodiment, the player can display an image of the player character 70 operated by the player by selecting one of the plurality of holes. The player plays the game for the purpose of displaying an image of the player character 70 outside the hole for a longer time. However, while the image of the player character 70 is displayed outside the hole, the mole characters 74 to 76 with a hammer come to attack the player character 70, so that the mole characters 74 to 76 are not attacked. Need to hide in the hole. Thus, it is an object of this game to display the image of the player character 70 outside the hole for as long as possible while hiding in the hole so that it is not attacked by the mole characters 74 to 76. Thereby, contrary to the conventional mole hitting game, it is possible to realize an unprecedented interesting game in which the player runs away in the spot where the player is hit.

  Moreover, in this embodiment, by making the rival characters 71 to 73 appear, it is possible to enjoy a heated game in which a player competes with the rival characters 71 to 73 for acquisition of accumulated time. Since the mole characters 74 to 76 are directed toward the rival characters 71 to 73 as the attack target in the same manner as the player character 70, for example, while the ragged characters 74 to 76 are moving with the rival character 71 as the attack target. In addition, it is possible to enjoy a strategic game in which the player character 70 is displayed in a hole away from the rival character 71. Moreover, since the player character cannot be displayed for the holes where the rival characters 71 to 73 are already displayed, it is possible to enjoy a strategic game of competing with the rival characters 71 to 73 for advantageous holes.

  The rival characters 71 to 73 are controlled by the computer based on a predetermined rule, but when two or more players play a game, the rival characters are opponent players (the player who operates the player character and the player who operates the player character). May be operated by another player). Thereby, it is possible to enjoy a more incandescent game such that friends compete with each other.

  Next, details of the game processing performed in the game apparatus 3 by executing the game program will be described. First, main data used in the game process will be described with reference to FIGS. FIG. 9 is a diagram showing main image data stored in the work memory 32 of the game apparatus 3. Character image data 110, cursor image data 111, terrain image data 112, accumulated time image data 113, remaining time image data 114, and the like are stored as image data.

  The character image data 110 is data indicating an image of each character such as the player character 70 and the rival characters 71 to 73 and the round characters 74 to 76. The cursor image data 111 is data indicating images of the cursors 80 to 83 for designating holes for the player character 70 and the rival characters 71 to 73 to display images. The color of the cursor is different for each character. The terrain image data 112 is data indicating an image of terrain such as the ground and holes 100 to 110 forming the game space. The accumulated time image data 113 is data indicating an image of accumulated times 90 to 93. The remaining time image data 114 is data indicating an image of the remaining time 94. The image data stored in the work memory 32 is stored in advance on the optical disc 4 and is stored in the work memory 32 from the optical disc 4 at an appropriate timing after the game apparatus 3 is turned on.

FIG. 10 shows other main data used in the game process stored in the work memory 32 of the game apparatus 3. Player character data 120, mole character data 121, rival character data 122, remaining time data 123, and the like are stored.

  The player character data 120 is data indicating various states of the player character 70. The player character data 120 includes position data 120a, state data 120b, inoperable time data 120c, and accumulated time 120d. The position data 120a is data indicating the position where the cursor 80 of the player character 70 exists. The position data 120a indicates one of the holes 100 to 110. That is, data indicating the positions of the holes 100 to 110 is stored in advance (not shown), and any one of these data is selectively set as the position data 120a. The state data 120b is data indicating the current state of the player character 70. Specifically, “normal”, “displaying”, or “inoperable” is indicated. “Normal” indicates that the player character 70 can be operated and is not displayed on the screen. “Display” indicates that the player character 70 can be operated and is displayed on the screen. “Inoperable” indicates that the player character 70 is in an inoperable state. The inoperable time data 120c indicates the time that has elapsed since the player character 70 became inoperable. When the inoperable time reaches a predetermined value, the status data returns to normal from the inoperable state. The accumulated time data 120d is the accumulated time of display acquired by the player character 70.

  The mole character data 121 is data indicating various states of the mole character. The mole character data 121 includes position data 121a and attack target data 121b. The position data 121a is data indicating the position where the mole character exists. The position data 121a covers all coordinates in the screen. In the attack target data 121b, a character currently set as an attack target is set. Specifically, one of the player character 70 and the rival characters 71 to 73 is set. Mole character data 121 exists as many times as Mole characters appear. In the present invention, three mole characters 74 to 76 appear, so there are three mole character data 121.

  The rival character data 122 is data indicating various states of the rival character. Each data is the same as the player character data 120. There are as many rival character data 122 as there are rivals. In the present invention, since three rival characters 71 to 73 appear, three rival character data 122 exist.

  The remaining time data 123 stores the value of the remaining time from the start to the end of the game. It is subtracted from the value at the start of the game.

  Next, details of the game process performed in the game apparatus 3 by executing the game program will be described with reference to FIGS. FIG. 11 is a flowchart showing a flow of game processing executed in the game apparatus 3. When the power of the game apparatus 3 is turned on, the CPU 31 of the game apparatus 3 executes a start program stored in a boot ROM (not shown), and each unit such as the work memory 32 is initialized. Then, the game program stored in the optical disc 4 is read into the work memory 32, and the CPU 31 starts executing the game program. The flowchart shown in FIG. 11 is a flowchart showing a game process performed after the above process is completed.

  In step S1 of FIG. 11, first, various data are initialized. Specifically, the position data 120a of the player character data 120 is set to a predetermined position, the state data 120b is set to a normal state, the inoperable time data 120c and the accumulated time data 120d are set to 0, and the position data of the mole character data 121 is set. 121a is set at a predetermined position, no attack target data 121b is set, the position data 122a of the rival character data 122 is set at a predetermined position, the state data 122b is being displayed, the inoperable time data 122c and the accumulated time data 122d. Is set to 0, and the remaining time data 123 is set to a predetermined value. In subsequent step S2, a game space is constructed. Specifically, based on the terrain image data 112, a game space image composed of the ground, holes 100 to 110, etc. is generated and displayed. In the subsequent step S3, images of the player character 70 and the round characters 74 to 76 and the rival characters 71 to 73 are generated and displayed based on the position data. In subsequent step S4, images of cursors 80 to 84 corresponding to the characters are generated and displayed based on the position data. A game space image including a character and a cursor is generated based on the game space image generated in step S2, the character image generated based on the processing in steps S3 and S4, and the cursor image, and is output to the television 2. To be processed. In the subsequent step S5, the accumulated time 90 to 93 and the remaining time 94 of the player character 70 and the rival characters 71 to 73 are displayed. At the start of the game, all accumulated time is zero. In the subsequent step S6, an image “START!” Indicating the start of the game is displayed.

  After step S7, the operation input by the player is accepted and the game is started. In step S7, the remaining time 94 is subtracted and displayed according to the game progress time.

  In step S8, a game operation by the player is accepted. Specifically, the CPU 31 reads operation data indicating a game operation by the player from the controller 6. In the subsequent process of step S9, a game process corresponding to the game operation accepted in step S4 is performed.

  FIG. 12 is a flowchart showing detailed processing of step S9 shown in FIG. In the player character operation process, first, in step S21, it is determined whether or not the player character 70 is in an inoperable state. Specifically, the state data 120b of the player character data 120 is determined. If the player character data 120 is in an inoperable state, the process of step S22 is performed. In subsequent step S22, it is determined whether the inoperable time has exceeded a predetermined value. When the inoperable time exceeds the predetermined value, the status data 120b is returned to the normal status in the following step S23. Specifically, the count of the inoperable time 120c is started from the time when the player character 70 becomes inoperable, and when the predetermined value is reached, the state data 120b is returned to the normal state and the player character 70 can be operated. To. If the inoperable time does not exceed the predetermined value, the inoperable time 120c is counted in step S24 and the inoperable state is continued.

  On the other hand, if it is determined in step S21 that the operation is not disabled, the process of step S25 is performed. In subsequent step S25, it is determined whether or not the operation accepted in step S8 is an operation for moving the cursor 80 and determining a position (holes 100 to 110) for displaying the player character 70. Specifically, the CPU 31 refers to the operation data read in step S8 and determines whether or not an operation on the analog stick 61 has been performed. If it is determined in step S25 that the operation accepted in step S8 is a position determination operation, the process of step S26 is performed. In step S26, referring to data (not shown) indicating the positions of the holes 100 to 110, a hole existing in the operation direction of the analog stick 61 indicated by the operation data is determined from the position indicated by the current position data 120a. In step S27, the position data of the player character 70 is changed to the determined hole position. In subsequent step S28, the cursor 80 is displayed at the position of the current position data 120a.

  In step S29, it is determined whether or not the operation accepted in step S8 is an operation for displaying the player character 70. Specifically, the CPU 31 refers to the operation data read in step S8 and determines whether or not an operation on the A button 63 has been performed. If it is determined in step S29 that the operation accepted in step S8 is a display operation, it is determined in subsequent step S30 whether or not the rival characters 71 to 73 are already displayed at the current hole positions. Specifically, it is determined whether there are rival characters 71 to 73 whose position data 122a is the same as the current hole position and whose state data 122b is being displayed. If it is determined in step S30 that there is no rival character that has the same position data 122a and is being displayed, the processes in steps S31 to S34 are performed. In the subsequent step S31, the state data 120b of the player character data 120 is set to be displayed, and in the subsequent step S32, the image of the player character 70 is displayed at the position of the position data 120a. In the subsequent step S33, the accumulated time data 120d is increased, and in the following step S34, the accumulated time display 90 is updated. On the other hand, if it is determined that the operation is not to display the player character 70, the state data 120b is set to the normal state in step S35.

  Returning to the description of FIG. 11, in step S10 following step S9, mole character action processing is performed. The mole character action process is a process for the game apparatus 3 to control the mole characters 74 to 76. Hereinafter, details of the wobble character action process will be described with reference to FIG.

  FIG. 13 is a flowchart showing detailed processing of step S10 shown in FIG. In the mole character action process, first, in step S41, it is determined whether or not the player character 70 or the rival characters 71 to 73 that are in the display state exist. Specifically, it is determined whether there is a display state among the state data 120b and 122b of all the player characters 70 and the rival characters 71 to 73. If it is determined in step S41 that there is a character that is in the display state, processing in step S42 and subsequent steps is performed.

  In step S42, the distance between the player character 70 and the rival characters 71 to 73 in all display states is calculated. Specifically, the CPU 31 detects the position data 120a and 122a of the player character 70 and the rival characters 71 to 73 whose state data 120b and 122b are displayed, and the position data of the target mole character (any one of 74 to 76). The distance to 121a is calculated. In the subsequent step S43, the player character 70 or the rival characters 71 to 73 that are closest to each other are set as attack targets in the attack target data 121b. In step S44, the character moves toward the character set in the attack target data 121b. Specifically, the position data 121a is updated so as to move to the position data 120a or 122a of the player character 70 or the rival characters 71 to 73 set in the attack target data 121b at a predetermined speed.

  In step S45, the distance from the character set in the attack target data 121b is calculated again. In the subsequent step S46, it is determined whether the calculated distance is within a predetermined distance. If it is determined in step S46 that the distance is within the predetermined distance, then in step S47, an attack action is performed on the character set in the attack target data 121b. Specifically, the hammer of the mole character is raised to hit the attack target character. In step S48, when the mole character performs an attack action, it is determined whether the attack target character is still in the display state. If it is determined in step S48 that the attack target character is in the display state, then in step S49, the attack target character state data 120b or 122b is set to an inoperable state. In step S50, counting of the inoperable time is started. Specifically, the counting of the inoperable time 120c or 122c of the attack target character is started.

  In step S51, it is determined whether or not the processing of steps S41 to 50 has been executed for all mole characters 74 to 76. If it is determined in step S51 that the process has been executed for all mole characters, the mole character motion process is terminated. If it is determined that the process has not yet been performed for all mole characters, the processes of steps S41 to S50 are performed for the target mole character.

  Returning to the description of FIG. 11, a rival character action process is performed in step S11 following step S10. The rival character action process is a process for the game apparatus 3 to control the actions of the rival characters 71 to 73. Details of the rival character action process will be described below with reference to FIG.

  FIG. 14 is a flowchart showing detailed processing of step S10 shown in FIG. In the rival character action process, first, in step S61, it is determined whether or not the rival characters 71 to 73 are in an inoperable state. Specifically, the state data 122b of the rival character data 122 is determined, and if it is in an inoperable state, the process of step S62 is performed. In a succeeding step S62, it is determined whether the inoperable time exceeds a predetermined value. When the inoperable time exceeds the predetermined value, the status data 122b is returned to the normal status in the following step S63. Specifically, counting of the inoperable time 122c is started from the time when the rival characters 71 to 73 become inoperable, and when the predetermined value is reached, the state data 122b is returned to the normal state, and the rival characters 71 to 73 are restored. 73 is enabled. If the inoperable time does not exceed the predetermined value, the inoperable time 122c is counted in step S64 and the inoperable state is continued.

  On the other hand, if it is determined in step S61 that the operation is not disabled, the process of step S65 is performed. In subsequent step S65, the cursors 81 to 83 are moved to determine the positions (holes 100 to 110) where the rival characters 71 to 73 are displayed. Specifically, the CPU 31 calculates the position based on a random number. In subsequent step S66, the position data of the rival characters 71 to 73 is changed to the determined position. In subsequent step S67, cursors 81 to 83 are displayed at the position of the current position data 122a.

  In step S68, it is determined whether to perform a display operation. Specifically, the CPU 31 determines whether or not to display the rival character image at the position specified by the position data 122a based on the random number. In step S69, it is determined whether or not the display operation is determined to be executed in step S68. If it is determined in step S69 that it is determined to execute the display operation, whether or not the player character 70 or other rival characters 71 to 73 are already displayed at the current hole position in the subsequent step S70. judge. Specifically, the player character 70 whose position data 120a is the same as the current hole position and the state data 120b is being displayed, or the position data 122a is the same as the current hole position and the state data 122b is It is determined whether there are other rival characters 71 to 73 that are being displayed. If it is determined in step S70 that there is no player character or other rival character that has the same position data and is being displayed, the processing in steps S71 to S74 is performed. In subsequent step S71, the state data 122b of the rival character data 122 is set to be displayed, and in the subsequent step S72, images of the rival characters 71 to 73 are displayed at the position of the position data 122a. In the subsequent step S73, the cumulative time data 122d is increased, and in the subsequent step S74, the cumulative time displays 91 to 93 are updated. On the other hand, if it is determined not to perform the display operation, the state data 122b is set to the normal state in step S75.

  In step S76, it is determined whether or not the processing of steps S61 to 74 has been executed for all the rival characters 71 to 73. If it is determined in step S75 that the process has been executed for all rival characters, the rival character action process is terminated. If it is determined that the process has not been executed for all the rival characters, the processes of steps S61 to S74 are executed for the target rival character.

  Returning to the description of FIG. 11, it is determined in step S12 following step S11 whether or not to end the game. Specifically, when the remaining time data 123 becomes 0, the game is ended. If the game is not finished, steps S7 to S11 are repeated.

If it is determined in step S12 that the game is to be ended, the process of step S13 is performed. In the subsequent step S13, a winner determination process is performed. The winner determination process is a process for determining a winner when the game is over. The details of the winner determination process will be described below with reference to FIG.

  FIG. 15 is a flowchart showing detailed processing of step S13 shown in FIG. In the winner determination process, first, in step S81, an image indicating the end of the game is displayed. Specifically, an image “Finish!” Is displayed on the screen to notify that the game is over. In subsequent step S82, the accumulated times of the player character 70 and the rival characters 71 to 73 are compared. Specifically, the values of the accumulated time data 120d and 122d of the player character 70 and the rival characters 71 to 73 are compared, and the largest one is selected. In the subsequent step S83, the character having the longest accumulated time is determined as the winner, and in the subsequent step S84, the image of the winning character is displayed in the center of the screen. Specifically, the image of the player character 70 or the rival characters 71 to 73 having the longest accumulated time is displayed large in the center of the screen, appealing that the target character has won, and ending the game.

  As described above, according to the present embodiment, a game is played for the purpose of displaying an image of a player character outside the hole for as long as possible while hiding in the hole so as not to be attacked by the mole character. Thereby, contrary to the conventional mole hitting game, it is possible to realize an uninteresting game that does not exist in the past and runs away as a player who is hit by the player. In addition, by introducing a rival character that competes in the same manner as the player character, it is possible to enjoy a heated game that competes with the rival character for victory or defeat.

  In the above-described embodiment, the motion rules of the mole characters 74 to 76 are such that the player character 70 or the rival character 71 to 73 whose image is displayed closest is attacked. Rules may be used. For example, you may make it attack preferentially the character which advances the game most advantageously, ie, the character with the longest accumulation time in the player character 70 or the rival characters 71-73. Thereby, since the character with a short accumulated time can advantageously advance the game, the possibility of reversal is also increased, and a heated game can be enjoyed in a close battle state.

  Further, state data may be set for the mole character so that the action rule changes according to the state. For example, data indicating three states of doing nothing, attacking, and moving are set in the mole characters 74 to 76. If the player character 70 is set in the attack target data 121b of the mole character 74 and the state data is under attack, even if another mole character 75 is near the player character 70, it is another rival character. 71-73 are targeted for attack. Thereby, by referring to the state data of the mole characters between the mole characters, the attack target is made as small as possible and the attack can be performed efficiently.

  Moreover, in the said embodiment, although the movement rule of the rival characters 71-73 determined the position which displays an image based on a random number, and decided whether to display an image based on a random number, it uses another movement rule. Also good. For example, a position that is a predetermined value or more away from all mole characters 74 to 76 may be calculated and determined as a position for displaying an image. If the rival characters 71 to 73 perform a smart action so that they are not easily attacked by the mole characters 74 to 76, the competitiveness of the player can be stimulated. Or you may increase the frequency which tries to display an image, as the rival characters 71-73 whose accumulation time is short. A rival character with a short accumulated time is impatient and can often appear to display images, and the rival character can feel human.

  Moreover, in the said embodiment, although the movement rules of the mole character 74-76 and the rival characters 71-73 are all the same, you may make it a different operation rule for every character. For example, the mole character 74 targets the closest player character 70 or rival character 71 to 73 as an attack target, the mole character 75 targets the farthest character as an attack target, and the mole character 76 circulates through the characters displaying images one after another. You may make it attack target. Alternatively, the movement of the cursor and the speed at which the image is displayed or hidden may be changed for each of the rival characters 71 to 73. As a result, the action of the character controlled by the computer can be individually produced, and the strength of the rival character can be varied to make the game interesting.

  As described above, the present invention can provide an uninteresting game that does not exist in the past, such as a player who flutters in the position of a player who is hit by the player, contrary to the conventional game of hitting a mole.

1 is an external view of a game system including a game device according to an embodiment of the present invention. Functional block diagram of the game system The figure which is an example of the game screen in this embodiment, and shows a game screen when a game is started A figure showing a game screen after a certain time has elapsed since the game was started The figure which shows the game screen which fixed time passed from the game screen of FIG. The figure which shows the game screen which the fixed time passed from the game screen of FIG. The figure which shows the game screen when the game ends The figure which shows the game screen which displays the winner of the game after the game ends The figure which shows the main image data memorize | stored in the work memory 32 of the game device 3 The figure which shows the main other data memorize | stored in the work memory 32 of the game device 3 The flowchart which shows the flow of the game process performed in the game device 3 The flowchart which shows the detailed process of step S9 shown in FIG. The flowchart which shows the detailed process of step S10 shown in FIG. The flowchart which shows the detailed process of step S11 shown in FIG. The flowchart which shows the detailed process of step S13 shown in FIG.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Game system 2 Television receiver 3 Game device 4 Optical disk 6 Controller 31 CPU
32 Work memory 70 Player character 71-73 Rival character 74-76 Mole character 80-83 Cursor 90-93 Cumulative time 94 Remaining time 100-110 hole

Claims (11)

A game program to be executed by a computer of a game device that causes a display device to display an image of a game space in which a player character operated by a player and a first non-player character that is controlled by a computer and moves based on a predetermined rule appear. There,
A first position determining step for determining a position where an image of the player character is to be displayed in response to a player operation;
While the player continues to input a specific operation, the image of the player character is displayed at the position determined in the first position determination step, and when there is no input of the specific operation, the image of the player character Is not displayed, or when the specific operation is not performed, the image of the player character is displayed at the position determined in the first position determination step, and the specific operation is continuously input. A player character display step of not displaying an image of the player character;
A first cumulative time measuring step of measuring a cumulative time of a display time during which the image of the player character is displayed;
A first non-player character display step for displaying an image of the first non-player character;
When the player character image is displayed, a first determination is made to determine that the display position of the first non-player character image and the position determined by the first position determining step are in a predetermined relationship. A determination step;
A first game processing step for performing a predetermined game process when it is determined by the first determination step that the predetermined relationship is established;
A game program for causing a computer to execute a first game display step for performing display according to the cumulative time measured in the first cumulative time measurement step. When the image of the player character is displayed, the computer further executes a first movement step of moving the first non-player character toward the position determined by the first position determination step. The game program according to claim 1. The game program according to claim 1, wherein the first position selecting step determines one position from a plurality of predetermined positions. The game program according to claim 1, wherein the first position determining step determines the position by moving a cursor displayed on a screen. The first game processing step causes the first non-player character to perform an attacking action on the player character,
When the attack hits the player character, the player character is disabled for a certain period of time,
The game program according to claim 1, wherein the first cumulative time measurement step does not measure while the player character is inoperable. The game program according to claim 1, wherein a remaining time until the game program ends is measured and displayed on a screen, and when the remaining time runs out, the computer further executes an end step of ending the game program. A second position determining step in which the computer determines a position at which an image of a second non-player character controlled by the computer is displayed;
A second non-player character display step for displaying an image of the second non-player character at the position determined in the second position determination step;
A second cumulative time measuring step of measuring a cumulative time of a display time during which the image of the second non-player character is displayed;
The first non-player character is moved toward the position at which the image of the player character or the second non-player character closest to the player character or the second non-player character on which the image is displayed is displayed. A second movement step for movement;
When the image of the second non-player character is displayed, it is determined that the display position of the image of the first non-player character and the position determined by the second position determining step are in a predetermined relationship. A second determination step;
A second game processing step for performing a predetermined game process when it is determined by the second determination step that the predetermined relationship is established;
7. The computer according to claim 1, wherein the computer executes a second game display step of performing display according to the cumulative time measured by the first and second cumulative time measuring steps. Game program. The second game processing step causes the first non-player character to perform an attacking action on the second non-player character,
When the attack hits the second non-player character, the second non-player character is disabled for a certain period of time;
The game program according to any one of claims 1 to 7, wherein the second cumulative time measurement step does not measure while the second non-player character is inoperable. The second display step compares the total accumulated time of the player character and all the second non-player characters at the time when the game program is terminated in the ending step, and the player who has the largest total accumulated time. The game program according to claim 1, wherein the character or the second non-player character is displayed as a winner.   In the first position determination step and the second position determination step, the player character or the second non-player character is displayed at the position already determined by another first position determination step or second position determination step. The game program according to any one of claims 1 to 9, wherein the position cannot be determined by another first position determination step or a second position determination step. A game device that causes a display device to display an image of a game space in which a player character operated by a player and a first non-player character that is controlled by a computer and moves based on a predetermined rule appear.
First position determining means for determining a position where an image of the player character is to be displayed in response to a player operation;
While the player continues to input a specific operation, the image of the player character is displayed at the position determined in the first position determination step, and when the specific operation is not input, the image of the player character is displayed. Player character display means not to,
First cumulative time measuring means for measuring a cumulative time of a display time during which the image of the player character is displayed;
First non-player character display means for displaying an image of the first non-player character;
When the player character image is displayed, a first determination is made to determine that the display position of the first non-player character image and the position determined by the first position determining step are in a predetermined relationship. A determination means;
First game processing means for performing a predetermined game process when it is determined in the first determination step that the predetermined relationship is established;
A game device that causes a computer to execute first game display means for performing display according to the accumulated time measured in the first accumulated time measuring step.

Images