JP2002136768A - Game system and information storage medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a game capable of providing an interesting puzzle game full of variations with less power consumption, in hardware with a small display area not specialized for the game like a portable telephone. SOLUTION: An initial image including a square game field where plural characters and at least two check points fewer than the number of the characters are set to squares and at least one wall for disabling movement between adjacent squares is set on a grid is provided. The plural characters are moved in a direction instructed by external input along the squares of the square game field in the same direction and at the same speed. In the case that the plural characters simultaneously reach all the check points, the game is cleared.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] The present invention relates to a game system,
The present invention relates to an information storage medium and a program.

[0002]

2. Description of the Related Art Recent mobile phones have become more sophisticated, so that data communication can be performed even in communications that used to be only voice communication, and the mobile phone itself can download game data and the like. It has become possible to operate applications such as games.

In general, a dedicated game machine specialized for operating a game can perform processing such as animation necessary for the game at a high speed, and has a fast response from a button input to a reflection of the result on a screen.

[0004] However, mobile phones that are supposed to be used for general purposes have a slow response time from button input and a low ability to perform animation and the like. In addition, since the display area of the screen is smaller than that of a dedicated game machine, it is difficult to operate a game having a high action, which has been operated on a dedicated game machine, as it is on a mobile phone.

Further, when a portable information device such as a mobile phone operates an action game requiring animation processing or constant calculation, there is a problem that power consumption increases and battery life is shortened.

Here, it is difficult to increase the number of variations when trying to realize a game using a popular maze on a mobile phone having a narrow screen. For example, 16 × 1
It is difficult to increase the number of variations when trying to represent a character represented by 6 pixels on a 128 × 128 screen. In order to solve this, for example, a character can be represented by 8 × 8 pixels, but the expression of the character's expression, etc., is limited. Even if a maze is realized, it is difficult to realize an interesting rule on a device with a small screen and a low processing capability.

[0007] Further, in a game having a high action such that a game process is always performed, a player feels dissatisfied with a device such as a mobile phone having a poor key response. Further, in such a game, it is necessary to always perform processing, so that the life of the battery is shortened.

SUMMARY OF THE INVENTION The present invention has been made in view of the above-mentioned problems, and has as its object to reduce the power consumption and provide a wide variety of hardware in hardware such as a cellular phone which has a small display area and is not specialized for games. An object of the present invention is to provide a game system and an information storage medium that can provide an interesting puzzle game.

[0009]

According to the present invention, there is provided a game system, wherein a plurality of characters and at least two check points equal to or less than the number of characters are set in a square, and at least two adjacent check points are made immovable between adjacent squares. An initial screen providing means for providing an initial screen including a grid-shaped game field in which one wall is set on a lattice; and the plurality of characters in the grid of the grid-shaped game field in a direction designated by an external input. A character movement processing means for moving at the same speed in the same direction; and a means for clearing the game when a plurality of characters reach all check points simultaneously, wherein the character movement processing means If there is a wall, an end of the grid-shaped game field, or another immovable character in the direction of travel, Stopping the movement of the character at the end of the state game field or at the nearest square not exceeding another immovable character, and thereafter, the given character is immovable in the traveling direction. .

[0010] An information storage medium according to the present invention is an information storage medium usable by a computer, and includes a program for executing the above means. Further, a program according to the present invention is a program usable by a computer (including a program embodied in an information storage medium or a carrier wave), and includes a module for executing the above means.

Here, the grid-like game field is a game field composed of a plurality of grids, such as a chess board. Also, the walls set on the grid do not occupy the grid.

According to the present invention, the contents of the maze (square-shaped game field) in which the character moves can be changed by changing the contents of the wall to be arranged. Here, since the walls set on the lattice do not occupy the squares, a variety of mazes can be set even on a narrow screen, so that an interesting and timeless game can be provided.

In the case of a game having a high action such that the game is always processed, the player feels dissatisfied with a device having a poor key response and shortens the life of the battery. Since only the processing is performed, the life of the battery can be prolonged, and a key response that does not cause the player to feel dissatisfied even with a device with a poor key response can be secured.

[0014] In the game system, the information storage medium and the program according to the present invention, the character movement processing means may not move the other character when there is another character in the traveling direction of the given character. The method further includes means for recursively calling out a movement possibility judgment routine for judging whether or not the given character is immovable.

[0015]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, a case where a game system of the present invention is realized by a mobile phone will be described with reference to the drawings.

FIG. 1 is an external view of a mobile phone 200 functioning as a game system in the present embodiment.

The mobile phone 2 includes a plurality of keys 10 functioning as a key input unit, a liquid crystal display 20 functioning as a display unit on which characters and images are displayed, a speaker 22 functioning as an audio output unit, and a transmitting / receiving unit. It is configured to include a functioning antenna 90 and a microphone 24 for performing voice input.

FIG. 2 is an example of a functional block diagram of the game system of the present embodiment.

The game system includes an operation unit 160, a communication unit 196, a storage unit 170, a processing unit 100, an information storage medium 180, a display unit 190, and a sound output unit 192.
It is comprised including.

The processing unit 100 performs various processes such as control of the entire system, instruction of each block in the system, game processing, image processing, and sound processing. Processor (CPU, DSP)
Or an ASIC (gate array or the like) or a given program (game program).

The operation section 160 is for the player to input operation data, and its function can be realized by, for example, character input keys of a mobile phone.

The storage unit 170 temporarily stores, for example, received game information, and stores the received game information in the processing unit 100 and the communication unit 196.
Work area, etc., the main memory 172,
It functions as the frame buffer 174 and can be realized by hardware such as a RAM.

An information storage medium (storage medium that can be used by a computer) 180 stores information such as programs and data.
D, DVD) Hard disk or memory (ROM)
It can be realized by hardware such as.

A part or all of the information stored in the information storage medium 180 is transferred to the storage unit 170 when the power to the system is turned on. Information storage medium 1
The information stored in 80 is a program code for performing the processing of the present invention, image data, sound data, shape data of a display object, table data, list data, information for instructing the processing of the present invention, and instructions for the processing. The information includes at least one of information for performing processing according to.

The display section 190 outputs the generated game image, and its function can be realized by hardware such as an LCD.

The sound output section 192 outputs a generated game sound, and its function can be realized by hardware such as a speaker.

The communication unit 196 receives game information such as a game program and game data distributed from a predetermined program distribution server or the like via a network, and receives external information (for example, a host device or another game system).
It performs various controls for performing communication with the ASIC, and its function is performed by various processors or communication AS
This can be realized by hardware such as C or a program.

A program or data for executing the means of the present invention (this embodiment) is distributed from the information storage medium of the host device (server) to the information storage medium 180 via the network and the communication unit 196. It may be. Use of the information storage medium of such a host device (server) is also included in the scope of the present invention.

The processing section 100 includes a game processing section 110.

Here, the game processing section 110 sets a plurality of characters and at least two check points of the number of characters or less as squares, and at least one wall that makes it impossible to move between adjacent squares is formed on a grid. A process of providing an initial screen including the set grid-shaped game field; and moving the plurality of characters in the same direction along the grids of the grid-shaped game field in the same direction in a direction specified by an external input. A process and a process of clearing the game when a plurality of characters reach all check points simultaneously are performed.

Here, if there is a wall, an end of the grid-shaped game field, or another immovable character in the traveling direction of the given character, the wall, the end of the grid-shaped game field, or another immovable character. Then, the movement of the character is stopped at the nearest square not exceeding, and thereafter, the process of disabling the given character in the traveling direction is performed.

When there is another character in the traveling direction of the given character, a removability judgment routine for judging whether or not the other character is immovable is recursively called to execute the given character. A process for determining whether or not the character cannot move may be performed.

The functions of the image generation process and the sound generation process are as follows.
All of them may be realized by hardware, or all of them may be realized by a program. Alternatively, it may be realized by both hardware and a program.

Next, a specific example of the game of the present embodiment will be described.

FIG. 3 is a diagram for explaining the rules of the game according to the present embodiment.

In the game of the present embodiment, a square game field as shown in FIG. 3 is provided as an initial screen.

The grid-like game field 210 is a game field composed of a plurality of grids 212 formed in a grid like a chess board.

In the grid game field 210 provided on the initial screen, a plurality of characters 220 and 222 and at least two check points
At least one of the walls 240 and 242 is set to the squares and makes it impossible to move between the adjacent squares.
Is set on the grid.

The player operates a plurality of characters 22 by operating up, down, left and right movement keys provided on the operation unit.
0,222 can be moved in the same direction and at the same speed along the grid in the grid-shaped game field. Then, when the plurality of characters 220 and 222 reach all the check points 230 and 232 at the same time, the game is cleared.

Here, the wall 2 is set in the moving direction of the character.
40, 242, the edge 250 of the grid-shaped game field or other immovable characters if there is a wall, the edge of the grid-shaped game field or the nearest grid not exceeding the immovable other character. Stop moving,
It is impossible to move in the traveling direction.

FIGS. 4A to 4E are diagrams for explaining a specific example of the progress of the game.

FIG. 4A shows a grid game field 210 provided as an initial screen. Here, two characters 220 and 222 and two checkpoints 2
30, 232 are provided. When the two characters 220 and 222 simultaneously reach the two check points 230 and 232, the game is cleared.

When the player presses the leftward movement key continuously or five times, the character 1 (22) as shown in FIG.
0) and the character 2 (222) simultaneously proceed along the square in the left direction.

Then, the character 2 (222) hits the wall 242 when it has advanced one square, and stops at the square nearest to the wall 242, and thereafter does not advance even if the player presses the left key (see 262). At this point, the character 222 is on the check point 230,
Since there is no character on another check point 232, the game is not cleared.

Further, since the character 1 (220) hits the wall 240 when it has advanced 5 squares, it stops at the square closest to the wall 240 and thereafter does not advance even if the player presses the left direction key (see 260). After the character 2 stops, only the character 1 moves.

Next, when the player presses the downward movement key once, as shown in FIG. 4C, the character 1 (220) and the character 2 (222) stop at the last stop position (FIG. 4B).
), And advance by one cell along the cell at the same time (see 270 and 272).

Next, when the player presses the leftward movement key once, as shown in FIG. 4D, the character 1 (220) advances leftward by one cell (see 280), but the character 2 (222) Cannot move forward because of the wall 242 to the left, and remains stopped.

Next, when the player continues the upward movement key, the character 1 (22) as shown in FIG.
0) and the character 2 (222) simultaneously move upward along the grid.

The character 2 (222) hits the wall 242 when it advances by one square, and stops at the square nearest to the wall 242. After that, the character 2 (222) does not advance even if the player presses the up key (see 292). Character 2
The square closest to the wall 242 where (222) has stopped is the check point 230.

Since the character 1 (220) hits the wall 240 when it has advanced two squares, it stops at the square nearest to the wall 240, and thereafter does not advance even if the player presses the up key (290). Character 1
The check box 232 is the square closest to the wall 240 at which (220) has stopped.

At this point, two check points 23
Since the two characters 220 and 222 have reached 0 and 232 at the same time, the game is cleared. Either character may reach either checkpoint.

FIGS. 5A to 5E are diagrams for explaining another specific example of the progress of the game.

FIG. 5A shows a grid-shaped game field provided as an initial screen. Here, three characters 220, 222, 224 and three check points 230, 232, 234 are given. When the three characters 220, 222, and 224 reach the three check points 230, 232, and 234 at the same time, the game is cleared.

When the player moves the upward movement key once or continuously, as shown in FIG.
20) travels one space upward and hits the wall 240 and stops there (see 260). Character 2 (22
Both 2) and character 3 (224) are facing upward on wall 2
Because there is 40, it has been stopped.

At this point, the character 220 is on the check point 230, but the game is not cleared because there are no characters on the other two check points 232 and 234.

Next, when the player presses the leftward movement key once, as shown in FIG. 5C, the character 2 (222) and the character 3 (224) stop at the last stop position (FIG. 5B).
At the same time, advance by one cell in the left direction along the cell (see 272 and 274).

Next, when the player presses the downward movement key once, the character 3 (224) advances downward by one cell as shown in FIG. 5D (see 284). Character 1
(220) and character 2 (222)
Because there is 0, it cannot proceed and remains stopped.

At this point, two characters 220,
224 are two checkpoints 230 and 23 respectively.
4, but the game has not yet been cleared because there is no character on the remaining one checkpoint 232.

Next, when the player moves the leftward movement key twice or continuously, as shown in FIG.
(222) advances two squares along the square in the left direction and hits the wall 240, and stops at the square closest to the wall 240. After that, the player does not advance even if the player presses the up direction key (see 292).

Character 1 (220) and character 3
(224) cannot be advanced because the wall 240 is located to the left, and remains stopped.

At this point, three check points 23
0, 232, 234 with three characters 220, 22
The game is cleared because 2, 224 have arrived at the same time. FIG. 6 is a diagram for explaining each function of the present game system assigned to keys provided on a device such as a mobile phone.

510, 520, 530 and 540 are keys for moving up, right, down and left, respectively. By operating these keys, the character can be moved up, down, left, and right. For example, when the upward movement key is pressed once, the character moves upward by one cell. If the upward movement key is kept continuous, the character moves upward until it hits a wall.

FIG. 7 is a flowchart for explaining the flow of processing of the game system according to the present embodiment.

First, the number of characters is set in a variable i (step S10).

Next, it is checked whether or not the i-th character can be moved by calling a character movement possibility inspection routine (step S20).

Next, the value of i is decremented (step S30).

If i> 0, the process returns to step S20, and the processes from steps S20 to S40 are repeated.
If i> 0, the number of characters is set again in the variable i (steps S40 and S50).

If the i-th character can move in the designated direction, the i-th character is moved in the designated direction (steps S60 and S70). Here, whether or not the i-th character can move in the designated direction is determined by calling a character movement possibility inspection routine in step S20 to determine whether or not the i-th character can be moved in the designated direction. The judgment is made based on the result of the examination.

Next, the value of i is decremented (step S80).

If i> 0, the process returns to step S60, and the processes from steps S60 to S100 are repeated (step S90).

Next, the stage clear flag is turned ON, and the number of checkpoints is set in a variable i (step S).
100, S110).

If the character is in the same square as the i-th check point, the stage clear flag is set to OF
F and goes to step S160 (step S13
0).

If there is no character in the same square as the i-th checkpoint, i is decremented to i
If> 0, the process returns to step S120, and step S12
The processing from 0 to S150 is repeated (step S15
0).

Next, if the stage clear flag is ON, a stage clear process is performed (step S160,
S170).

FIG. 8 is a flowchart for explaining the flow of processing of the character movement possibility inspection routine according to the present embodiment.

When the character movement possibility inspection routine receives the character identification information to be inspected (for example, the character array number) and the movement direction, the character movement possibility inspection routine determines the character position and the wall position in the current square game field.
It checks whether or not the character can be moved, and returns a check result to the caller as a return value, and is configured to be recursively callable.

First, it is checked whether or not there is a wall between the square in the moving direction and the square of the character A. If there is a wall, "immovable" is set as a return value and the process returns (step S210). S220). Here, the character A is a character to be inspected.

If there is no wall in the moving direction, it is checked whether or not there is another character in the moving direction. If not, the return value is set to "I cannot move" and the process returns (steps S230 and S240).

If there is another character (character B) in the moving direction, the character movement possibility inspection routine is recursively called for another character in the moving direction (step S250).

If another character (character B) in the moving direction can be moved according to the inspection result of the character movement possibility inspection routine, the return value is set to "movable" and the process returns (steps S260 and S270). Here, the case where another character (character B) can be moved is a case where the return value of the called character movement possibility inspection routine is “movable”.

If another character (character B) in the moving direction cannot be moved, the return value is set to "I cannot move" and the process returns (steps S260 and S28).
0). Here, the case where another character (character B) cannot be moved is a case where the return value of the called character movement possibility inspection routine is “immovable”.

Although the preferred embodiment to which the present invention is applied has been described, the application of the present invention is not limited to the above-described embodiment.

For example, in the present embodiment, the case where the same number of characters and check points are arranged in the grid-shaped game field has been described, but the present invention is not limited to this. For example, the number of check points may be smaller than the number of characters.

Further, for example, in the above-described embodiment, an example is described in which the mobile phone 200 is applied as a game system.
Phones such as mobile phones and satellite communication phones, portable PCs, portable information terminals, portable game devices having a communication function, etc.
Various terminal devices such as a PC can be used.

Here, as the portable terminal device,
For example, a portable information terminal, a portable PC, a portable game device, a pager, a portable telephone, and the like are applicable.

[Brief description of the drawings]

FIG. 1 is an external view of a mobile phone functioning as a game system in an embodiment.

FIG. 2 is an example of a functional block diagram of the game system of the embodiment.

FIG. 3 is a diagram for explaining rules of the game according to the embodiment.

FIGS. 4A to 4E are views for explaining a specific example of the progress of a game.

5 (A) to 5 (E) are diagrams for explaining another specific example of the progress of the game.

FIG. 6 is a diagram for explaining functions of the present game system which are assigned to keys provided on a device such as a mobile phone.

FIG. 7 is a flowchart for explaining a processing flow of the game system of the present embodiment.

FIG. 8 is a flowchart for explaining a flow of processing of a character movement possibility inspection routine according to the present embodiment;

[Explanation of Reference Codes] 2 mobile phone 100 processing unit 110 game processing unit 160 operation unit 170 storage unit 180 information storage medium 190 display unit 192 sound output unit 196 communication unit 210 square game field 212 square 220 own character 222 own character 230 Checkpoint 232 Checkpoint 240 Wall 242 Wall

Claims (4)

[Claims] 1. A game system, wherein a plurality of characters and at least two checkpoints of a number equal to or less than the number of characters are set in a grid, and at least one wall that makes it impossible to move between adjacent grids is formed on a grid. Initial screen providing means for providing an initial screen including the set grid game field; and moving the plurality of characters in the same direction along the grid of the grid game field in the direction specified by the external input. And a means for clearing the game when a plurality of characters reach all the check points simultaneously, wherein the character movement processing means comprises: If there is an edge of the eye-shaped game field or other immovable characters, walls, grid-shaped game field Game system stops the movement of the character in the last squares not exceeding another character of the end or unmovable, thereafter, characterized in that the unmovable in the direction of travel of the given character. 2. The apparatus according to claim 1, wherein the character movement processing means determines whether or not the other character is immovable when another character is present in a traveling direction of the given character. A game system comprising means for recursively calling out a gender determination routine to determine whether the given character is immovable. 3. An information storage medium that can be used by a computer, wherein a plurality of characters and at least two checkpoints equal to or less than the number of characters are set in a grid, and at least one check mark is set to be immovable between adjacent grids. Screen providing means for providing an initial screen including a grid-shaped game field in which the walls of the grid are set on a grid; and lining the plurality of characters along the grid of the grid-shaped game field in a direction specified by an external input. The character movement processing means for moving the character at the same speed in the same direction, and a means for clearing the game when a plurality of characters reach all the check points at the same time. A wall in the direction of travel of a given character, the edge of a grid-shaped game field or other immovable character. If there is a kuta, stop the movement of the character at the wall, the edge of the grid-shaped game field, or the nearest square not exceeding other immovable characters, and thereafter move the given character in the direction of travel. Is an information storage medium including a program for making it immovable. 4. The character movement processing means according to claim 3, wherein the character movement processing means determines whether or not the other character is immovable when another character is present in the traveling direction of the given character. An information storage medium comprising a program for recursively calling out a gender determination routine to determine whether the given character is immovable.