JP2001178967A - Game device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a new puzzle game. SOLUTION: In this game device capable of changing the position of an object displayed on a screen and capable of erasing successively connected objects when the same kinds of the objects are successively connected, an object erasing condition is set beforehand, the objects more than the number of pieces erasable by the erasing condition are displayed on the screen in an array erasable at least by the set erasing condition and whether or not a player satisfies the condition and erases the objects is judged.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a game system using an optical disk, a magnetic disk, a cassette type recording medium using a semiconductor memory, etc., on which game data is recorded, and which is suitable for a continuous connection of the same kind. The present invention relates to a method of moving an object in a game in which the object is erased, a game device, a game system, and a recording medium.

[0002]

2. Description of the Related Art Many game systems have been proposed. Examples of the system include a home dedicated machine and a television monitor, a professional dedicated machine, and a system including a personal computer or a workstation, a display, and an audio output machine. Each of these systems includes a controller for a player to operate, a recording medium on which game data including game program data and data such as images and sounds are recorded, and generation of sounds and images based on the game program data. C to control for
PU, a processor for processing images, a processor for processing audio, and a CR for displaying images
T and a speaker for outputting sound.
As the recording medium, a CD-ROM, a semiconductor memory,
There are many cassettes with built-in semiconductor memory. The configuration of the game system is as described above.

On the other hand, the types of games are steadily increasing, and the contents of games are becoming more complex and diversified day by day. Recently, many games called so-called “fallen objects” have been proposed.

Generally, in a game called a falling object, a falling object of a specific shape that appears at the top of the screen sequentially moves toward the bottom of the screen, accumulates at the bottom of the screen, and the accumulated falling object. When the top of reaches the top of the screen, the game is over. When the deposited fallen objects form a specific arrangement with other fallen objects, only that portion is erased from the screen. Therefore, in order to prevent the game from being over, the game player operates the controller to move the moving falling object, and when the falling object accumulates, the falling object is moved together with other falling objects. For example, it is necessary to arrange them in a horizontal line without gaps.

[0005] More specifically, the following games are referred to as falling objects. The spheres of various colors that appear at the top of the screen move sequentially down the screen and accumulate at the bottom of the screen.
In some cases, when a predetermined number or more of continuous spheres are connected, all of the connected spheres of a predetermined number or more are erased from the screen. The role of the game player in this game is to operate the controller to move the balls that have already been deposited by the cursor by operating the controller, so that balls of the same color are continuously connected for a predetermined number or more when they are deposited. Is to place it.

[0006]

By the way, in most games called falling objects, falling objects accumulate from the top of the screen to the bottom, and the tip of the accumulated falling objects is located at the top of the screen. It adopts basic rules such as game over when reaching. Therefore, there are many games called "falling objects", but the differences are in the shape and color of the falling objects and the pattern in which the accumulated falling objects are erased, and there is almost no difference in the content of the game itself. Therefore, a new type of game is demanded.

[0007] The present invention has been made in view of the above points, and an object of the present invention is to provide a game which can respond to the above demand.

[0008]

[Means for Solving the Problems]

The present invention is a game device in which the position of an object displayed on a screen is changed, and when the same type of object is continuously connected, the continuously connected object is deleted. An erasing condition is set, and objects more than the number that can be erased under the condition are displayed on the screen in an array that can be erased at least under the setting condition, and the player satisfies the condition and erases the object Is determined.

In the present invention, the erasing condition may be any one of the number of chains, which is the number of erasures, the maximum number of objects to be erased in one chain, the number of movements or exchanges, or any of these conditions. A combination is preferred.

In the present invention, the type of the object is:
It is preferable that the shape, the color, and the pattern be a combination of the shape, the color, and the pattern.

In the present invention, it is preferable that the object is at least one of an object to be erased and an object not to be erased.

In the present invention, it is preferable that a cursor for pointing or holding the object can be arbitrarily moved by the player, and a part or all of the cursor is animated.

[0014]

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

[First Embodiment] The contents of the game in the first embodiment are as follows. This game is a so-called competitive game in which at least two sets of game players compete with each other. When a game player plays a game by himself, the opponent of the game player is the CPU 1. In this game, a state is provided in which arbitrary large and small balls are rising from the bottom of the field on the screen over time. Then, the game is over when the leading portion of the large ball and the small ball that is coming up reaches the upper end of the field or a predetermined position thereon. The game player is provided with one large ball for replacement.
The game player can exchange the ball for a desired ball in the field by operating the controller 22. At the start, replacement balls are given,
This ball and the ball in the field will be exchanged, but if the ball in the field is designated for exchange while holding the replacement ball, the ball will be placed vertically in the game space. Fall in the direction. At this time, the ball is not held, and only the cursor is used. When a ball in the field is selected in this state, the ball in the field is held as a replacement ball.

When a large ball is exchanged by the game player and the large ball exchanged and moved into the field and the large ball of the same type as the large ball are continuously connected, the continuously connected large ball is returned. Are all erased. Then, when the large ball moved by this erasing and the large ball of the same type as the large ball are continuously connected, all the continuously connected large balls are erased. In the same manner, such a sequential erasure is performed. The number of balls equal to the number of balls deleted at this time is added as attacking balls on the opponent's field. Also, all the small balls adjacent to the deleted large ball are changed to large balls. In this embodiment,
When large balls of the same type are continuously connected, they are all erased, which is referred to as “chain”. For example, if twelve red large balls are continuously connected and erased, and then ten large white balls are continuously connected and erased, the number of chains is two. Also, the number of large balls that are erased in one chain is referred to as the “number of erases”. In this embodiment, “exchange” means “1. 1. Exchanging the empty state with the empty state held by the cursor, that is, holding the ball existing in the field by the cursor. Swapping the ball you have with the cursor with nothing, that is, returning the ball you have with the cursor to the field,
3. This involves swapping the ball you have with the cursor for the ball that is in the field.

FIG. 1 is a configuration diagram showing a configuration example of a game system as one embodiment of the present invention. The game system shown in FIG. 1 includes a game machine main body, and a recording medium 30 on which game data including images, sounds, and program data is recorded. The game console body is C
The PU 1 and the CPU 1 are connected to a bus 2 comprising an address, data and control bus.
Interface circuit 4, main memory 5, ROM
6, parallel port 8, serial port 9, drawing processor 10 and buffer 11, audio processor 1
3 and buffer 14, decoder 17 and buffer 18,
The interface circuit 20 and the memory 21 are connected to each other. Further, the television monitor 12 is connected to the drawing processor 10, the speaker 16 is connected to the audio processor 13 via the amplifier circuit 15, and the decoder 17 is connected.
Is connected to a recording medium driver 19, and an interface circuit 20 is connected to a controller 22.

Here, the form of the game system differs depending on the application. That is, the game system:
When configured for home use, the television monitor 12 and the speaker 16 are separate from the game machine body. Of course, in that case, the controller 22 is not provided with the coin insertion slot 22g. Further, when the game system is configured for business use, all the components shown in FIG. 1 are housed in one integrated housing. When the game system is configured with a personal computer or a workstation as a core, the television monitor 12 corresponds to a display for the computer, and the drawing processor 10 and the audio processor 13 The interface circuit 4, the parallel port 8, and the serial port 9 correspond to a part of the game program data recorded on the recording medium 30 or hardware on an expansion board mounted on an expansion slot of a computer. The interface circuit 20 corresponds to hardware on an expansion board mounted in an expansion slot of the computer. Also,
The buffers 11, 14 and 18 correspond to respective areas of the main memory 5 or an extended memory (not shown), respectively. In the present embodiment, a case where the game system is configured for business use will be described as an example.

Next, each component shown in FIG. 1 will be described in more detail. The interface circuit 4 is for an interface of a peripheral device such as a pointing device such as a mouse or a trackball. The RO
Program data as an operating system of the game system is stored in M6. Speaking of personal computers, BIOS (Basic Imp
out Output System).

The rendering processor 10 performs rendering on the buffer 11 based on the contents of the data register on the main memory 5. The buffer 11 has a display area and a non-display area. Image data read from the recording medium 30 is stored in the non-display area.

The audio processing processor 13 includes a recording medium 30
Is stored in the buffer 14, and the PCM data stored in the buffer 14 is used as a sound source. The PCM data is supplied to the audio processor 13 and subjected to various processes, and then output from the speaker 16 as audio.

The recording medium driver 19 is, for example, a hard disk drive, an optical disk drive, a flexible disk drive, a silicon disk drive, a cassette medium reader, or the like. The recording medium 30 is, for example, a hard disk, an optical disk, a flexible disk, a semiconductor memory, or the like. The recording medium driver 19 reads out image, sound, and game program data from the recording medium 30 and supplies the read data to the decoder 17. The decoder 17 applies an ECC (Error Correction C) to the reproduction data from the recording medium driver 19.
mode), and supplies the error-corrected data to the main memory 5 or the audio processor 13.

The controller 22 has a lever 22L, a start button 22a, a select button 22b, a first button 22c, a second button 22d, a third button 22e, a fourth button 22f, and a coin slot 22g. Lever 22
L is for the game player to give commands indicating up, down, left and right to the CPU 1. Start button 22
“a” is for the game player to instruct the CPU 1 to start the game program data loaded from the recording medium 30. The select button 22b allows the game player to make various selections regarding game program data loaded from the recording medium 30 to the main memory 5 by pressing C.
This is for instructing PU1. The lever 22
L, first to fourth buttons 22c, 22d, 22e, 22f
Function differs depending on the game program data loaded from the recording medium 30.

A power switch (not shown) is turned on,
The game system is powered on. At this time, if the recording medium 30 is loaded in the recording medium driver 19,
The CPU 1 instructs the recording medium driver 19 to read game data from the recording medium 30 based on the operating system stored in the ROM 6.
Thereby, the recording medium driver 19 reads out the image, the sound, and the game program data from the recording medium 30.
The read image, sound, and game program data are supplied to the decoder 17, where an error correction process is performed. The image data that has been subjected to the error correction processing in the decoder 17 is supplied to the drawing processor 10, which uses the buffer 11.
Is written to the non-display area of

The audio data subjected to the error correction processing in the decoder 17 is supplied to the main memory 5 or the audio processing processor 13 and written into the main memory 5 or the buffer 14. The game program data subjected to the error correction processing in the decoder 17 is supplied to the main memory 5 and written into the main memory 5. Thereafter, the CPU 1 proceeds with the game based on the game program data stored in the main memory 5 and the content specified by the game player via the controller 22. That is, the CPU 1 appropriately controls image processing and audio processing based on the instruction content instructed by the game player via the controller 22.
Controls internal processing.

The drawing process is as follows. That is, the CPU 1 alternately writes data including the storage address of the image to be drawn, the type indicating the color and size of the ball, the display address, and the like into the two data registers on the main memory 5 for each frame. Then, the CPU 1 supplies the contents of one of the two data registers to the drawing processor 10. The drawing processor 10 writes the image data read from the non-display area of the buffer 11 to the display area of the buffer 11 based on the information. The information written in the buffer 11 is read out by the drawing processor 10 and, after being encoded into, for example, an NTSC color television signal, supplied to the television monitor 12 and displayed as an image on the display screen. .

FIG. 2 is an explanatory diagram showing functions of the CPU 1 shown in FIG. The CPU 1 has the functions shown in FIG. 2 by reading the program data read from the recording medium 30 shown in FIG. 1 and stored in the main memory 5. The functions of the CPU 1 shown in FIG. 2 include a button operation detecting unit 1a, a variable setting unit 1b,
c, calculation means 1d, flag management means 1e, ball type determination means 1f, ball exchange means 1g, register information management means 1
h, map information managing means 1i, mark map information managing means 1j, attacking ball information managing means 1k, ball changing means 1m,
And result information output means. These means are the main subjects of the control described in the items E to G, respectively.

FIG. 3A is an explanatory diagram showing an example of data stored in the data register. FIG. 3B is an explanatory diagram showing an example of a table including a data string indicating the type of ball according to the number of balls. Is an explanatory diagram showing an example of a map showing the state of the field on the player's side, FIG. 3D is an explanatory diagram showing an attacking ball information area in which type data of attacking ball from the opponent is stored, and FIG. FIG. 3F is an explanatory diagram showing an example of a map showing the state of the field of the attacking ball, FIG. 3F is an explanatory diagram showing an attacking ball information area in which type data of the attacking ball from the player's side is stored, and FIG. FIG. Description will be made in order from FIG. 3A.

The data register shown in FIG. 3A is formed on the main memory 5. The data register stores storage address data as an address on a non-display area of the buffer 11, type data indicating the type of the image data, and display address data as an address on the display area of the buffer 11 for each image. Registered in. The data register has 2
Are prepared and used alternately for each frame.

The table shown in FIG.
0, which is read from the recording medium 30 and stored in the main memory 5 when the game system is powered on. In this table, data strings of data indicating types of balls according to the number of balls are registered. This table, when you get a ball to drop to the opponent,
It is for preparing balls according to the number. Less than,
The ball dropped into the opponent type is called an attack ball. This attack ball will be described later in detail.

The map shown in FIG. 3C is a map on the own side. This map is formed on the main memory 5. In this example, six in the x direction and one in the y direction
Three balls, a total of 78 balls, can be displayed. The address x of this map increases from left to right on the page, and the address y increases from bottom to top on the page. Each cell of the map indicates a position on the display area of the buffer 11. “0” or the address Ad is written in the storage area corresponding to each cell.
“0” indicates that there is no ball at the position, and Ad indicates in which address area of the data register the information of the ball at the position is stored. FIG.
The attack ball information area indicated by D stores the type data of the attack ball from the opponent. In addition, about the attack ball,
Details will be described later.

The map shown in FIG. 3E is a map of the other party. This map is formed on the main memory 5. In this example, six in the x direction and one in the y direction
Three balls, a total of 78 balls, can be displayed. The address x of this map increases from left to right on the page, and the address y increases from bottom to top on the page. Each cell of the map indicates a position on the display area of the buffer 11. “0” or the address Ad is written in the storage area corresponding to each cell.
“0” indicates that there is no ball at the position, and Ad indicates in which address area of the data register the information of the ball at the position is stored. FIG.
In the attack ball information area indicated by F, the type data of the attack ball from the player's side is stored. The attack ball will be described later in detail.

In the mark map shown in FIG. 3G, the large ball newly moved into the field by the exchange or the same type of large ball continuously connected to the large ball moved in the field by erasing the large ball. Information indicating whether or not is registered. In the example shown in FIG. 3G,
Indicates that "1" is marked. By referring to this map, the CPU 1 determines whether or not the large balls are continuously connected. In this embodiment,
It is assumed that when three or more large balls of the same type are continuously connected, those large balls are deleted.

FIGS. 4 to 15 are screen display examples for explaining an example of erasure, on the assumption that three large balls of the same color are erased side by side for convenience of explanation.

FIGS. 4 to 6 show a given ball (large ball).
Is exchanged with another large ball in the field, and thereby three horizontally arranged large balls of the same color are erased as a screen display example. FIGS. 7 to 9 show, as a screen display example, an example in which a large ball newly obtained is exchanged for another large ball in the field, and thereby three large balls of the same color arranged side by side are erased. Have been. FIG. 10 to FIG.
By the erasure, the large ball that was above the large ball fell down,
An example in which three large balls of the same color arranged side by side are thereby erased is shown as a screen display example. 13 to 15
Shows an example of a screen display example in which small balls adjacent to the erased large ball are changed to large balls, thereby removing three large balls of the same color arranged side by side. Hereinafter, description will be made in order.

As shown in FIG. 4, the screen structure includes a field for displaying the score and the like, and a field for one's own side and a field for the other party's side are displayed on both sides of the area. The background is displayed in each of the fields. For convenience of explanation, a state in which a large ball is displayed only in the field on its own side is shown. Further, although color display is performed on an actual screen, color display cannot be performed due to the drawing. Therefore, for convenience, a large white ball is `` white large ball '', a large ball with fine white dots on a black background is `` gray large ball '', and a large ball with coarse black dots on a white background is `` yellow large ball '' on a black background. Large balls with coarse white dots are referred to as "brown large balls". The small balls are indicated by diamonds smaller than the large balls. Hereinafter, description will be made sequentially.

As shown in FIG. 4, in the field on the own side, in the bottom row, in order from the left, yellow large ball, white large ball, white large ball, brown large ball, yellow large ball, brown Large ball is displayed. In the second row, gray large balls, gray large balls, brown large balls, and white large balls are displayed in order from the left. On the third row, a large white ball is displayed.
Also, what is displayed so as to overlap the second large brown ball is a ball that is moved together with the cursor. In this example, the possessed ball is a large gray ball. The shape of the cursor is a shape with wings on the left and right sides of the ring. The large gray ball held by the cursor can be moved up, down, left, and right in the field by operating the controller 22.

The position of the cursor is changed to the position of the large brown ball in the second row, after which the first button 2
When 2c is pressed, as shown in FIG. 5, the brown large ball that has been placed in the field until now is held by the cursor, and the gray large ball that has been held in the cursor so far is:
It is placed at the position of the big brown ball. As shown in FIG. 5, by this replacement, three large brown balls are arranged in the second row. Therefore, as shown in FIG.
The three large brown balls are erased. As shown in FIG. 6, when the image is deleted, an image is displayed as if the large ball had burst.

Subsequently, as shown in FIG. 7, when the brown large ball held by the cursor is replaced with the yellow large ball in the first row, as shown in FIG. In the second row, there are three large brown balls. Therefore, as shown in FIG. 9, the three large brown balls are eliminated. At this time, as in the above, an image is displayed as if the large ball had burst. Then, when the large brown balls in the first row are erased, the large white balls in the second row fall down and three large white balls are arranged as shown in FIG. Therefore, as shown in FIG. 11, the three large white balls arranged side by side are deleted. Also in this case, as in the case described above, an image is displayed as if a large white ball pops out.
Then, as shown in FIG. 12, one large yellow ball remains in the first row and one large white ball remains in the second row.
The cursor is now holding a large yellow ball.

Next, FIG. 1 shows a case where a small ball exists.
This will be described with reference to FIGS. As shown in FIG. 13, white small balls, white small balls, white small balls, yellow small balls, yellow large balls, and brown large balls are displayed in the first row in order from the left. In the column of the row, from the left, gray kodama, gray kodama, gray kodama, yellow kodama, brown kodama, brown big kodama are displayed in order from the left, and in the third row, from the left, Yellow small balls, brown small balls, and white large balls are displayed. In the fourth row, yellow small balls, brown small balls, and white large balls are displayed in order from the left, and in the fifth row, From the left, small brown balls, large white balls, and large gray balls are displayed. In addition, a small yellow ball is held as a possessed ball by the cursor.

The yellow ball held by the cursor is
After being stacked on the fifth stage brown pebble, the controller 2
When the second first button 22c is pressed, as shown in FIG. 14, the brown small balls in the fifth row are held by the cursor, and the yellow small balls that have been held by the cursor until now are displayed in the fifth row. Are placed in the row where the brown pebbles were. Subsequently, as shown in FIG. 15, the small brown balls are replaced with the large white balls in the fifth row. Then, the large white ball is superimposed on the gray large ball in the fifth row. At this time, when the game player presses the first button 22c of the controller 22, the gray large ball in the fifth row is replaced with the white large ball held by the cursor. Therefore, in the field, three large white balls are arranged in the vertical direction.

By the way, in this embodiment, the small ball adjacent to the deleted large ball is changed to a large ball. Therefore, when the large white balls are deleted, the small brown balls in the third, fourth, and fifth rows, which are adjacent to the large white balls, are respectively changed to large brown balls. When changed to large balls, three brown large balls are already lined up, and these are deleted. When they are erased, their neighbors 3, 4
And the yellow small balls in the fifth row are changed to yellow large balls, respectively. When changed to a large ball, three yellow large balls are already lined up, and these are deleted.

FIGS. 16 to 20 are flow charts for explaining the control operation by the main routine of the game. Note that only step S1 is a control operation by the operating system stored in the ROM 6 shown in FIG. Another step is a control operation based on the game program data read from the recording medium 30. Further, as described above, the subject of control based on the game program data is each unit as a function of the CPU 1 shown in FIG.

In step S1, the CPU 1 determines whether or not a coin has been inserted through the coin insertion slot 22g.
If “YES”, the process moves to step S2.

In step S2, the recording medium driver 19 reads out the image, the sound, and the game program data from the recording medium 30 in accordance with an instruction of the operating system. Of the read data, the program data is
It is stored in the main memory 5. Thereby, the CPU 1
Has the function shown in FIG. At this time, the image data is stored in the non-display area of the buffer 11 of the drawing processor 10. The audio data is stored in the buffer 14 of the audio processor 13.

In step S3, the CPU 1 issues a drawing command for drawing the selected image to the drawing processor 10 shown in FIG. Drawing processor 1
0 develops the image data of the selected image on the display surface of the buffer 11 based on the drawing command. As a result, the selected image is displayed on the display surface of the television monitor 12. In step S4, the button operation means 1a determines whether or not the start button 22a of the controller 22 has been pressed.
Move to

In step S5, the CPU 1 sets the selected game. Here, "selected" means that the game player refers to the selected image displayed in step S3, selects a game using the lever 22L, and then presses the start button 22a. . In step S6, the CPU 1 issues a drawing command indicating the drawing of the initial image of the selected game to the drawing processor 10. This allows
The drawing processor 10 writes the image data of the initial image on the display area of the buffer 11. Thus, the initial image is displayed on the display surface of the television monitor 12.

In step S7, the variable setting means 1h
The flags and variables held in the main memory 5 are reset. In step S8, the register information management unit 1
h registers the storage address data, the type data, and the display address data of the cursor and the default large image in the data register on the main memory 5, respectively. Hereinafter, the storage address data, the type data, and the display address data are referred to as “image information data”. The image information data registered in the data register is read by the register information management means 1h in the next frame. The read image information data is supplied to the drawing processor 10. The drawing processor 10 reads image data from the non-display area of the buffer 11 based on the image information data, and stores the image data in the buffer 1.
Write to the display area of 1. The image data written in the display area of the buffer 11 is supplied to a television monitor 12 after being converted into, for example, an NTSC color television signal. Therefore, the image of the cursor and the image of the default large ball are displayed on the screen of the television monitor 12.

Here, as described above, the pattern of the cursor is a pattern in which wings grow on both ends of a ring-shaped object. Then, the animation is displayed as if the wings are flapping. This is performed by preparing several types of image data of cursors having different wing shapes, and displaying the image data alternately for each field or frame, that is, by so-called animation display.

In step S 9, the CPU 1 stores the cursor and information about the large ball displayed together with the cursor in the main memory 5. In step S10, the button operation detecting means 1a determines whether or not the lever 22L has been operated, and if "YES", the process proceeds to step S11 and "N
If "O", the process moves to step S13.

In step S11, the CPU 1 changes the values of the display address data of the cursor and the large ball stored in the main memory 5. In step S12, the register information management means 1h writes the cursor and large display address data stored in the main memory 5 on the corresponding data area of the data register. As a result, the cursor and the image of the large ball are displayed on the screen of the television monitor 12.

In step S13, the button operation detecting means 1a determines whether or not the first button 22a has been pressed.
If “YES”, the process shifts to step S15, and “NO”
If so, the process proceeds to step S14. In the present embodiment, even if the first button 22a is pressed in a state where the cursor has neither a large ball nor a small ball, it is not determined that the first button 22a is pressed. In step S14, the CPU 1 temporarily stores information of the map corresponding to the position of the cursor in the main memory 5.

In step S15, the CPU 1 stores the display address (x, y) of the cursor and the address data on the map of the position in a predetermined area of the main memory 5. In step S16, the ball type determination means 1f
The type data in the image information data stored in the main memory 5 is read, and the type of the ball indicated by the type data is
It is determined whether it is a large ball or a small ball. If "YES", the process shifts to the step S17.
Move to

In step S17, the ball exchange means 1g
The image information data of the data register, which is indicated by the address at the position indicated by the address of the cursor, is the image information data of the large ball or the small ball moving with the cursor,
rewrite. In step S18, the ball exchange means 1g
The image information data read in step S15 is stored in the main memory 5 as large or small image information data that moves together with the cursor. These steps S
By the processing of 17 and S18, the player
When 2a is pressed, the image data of the large or small ball at the position on the field where the cursor is located is exchanged with the image data of the large or small ball that has been moved together with the cursor.

In step S19, the ball exchange means 1g
The image information data of the large ball or the small ball that moves with the cursor is written into the corresponding position of the data register as the image information data of the position on the map indicated by the address of the cursor. In step S100, processing according to a drop routine is performed. In step S200, a process according to an erasing routine is performed.

In step S20, the flag management means 1e
Changes the value of the flag to the value of the other party. Step S
At 21, the attacking ball information management means 1k reads out ball type data corresponding to the value of the number of erases ERA from the table.

In step S22, the attack ball management means 1k
Writes the ball type data read from the table as the attack ball type data in the attack ball information area of the opponent. In step S23, the flag management unit 1e changes the value of the flag to the value of the own device.

In step S24, the attacking ball information managing means 1k reads the stored contents of the attacking ball information area on the main memory 5 on its own side. In step S25, the judgment means 1
c determines whether there is an attack ball from the opponent, and
If “ES”, the process proceeds to step S26. If “YES”, the process proceeds to step S26. If “NO”, the process proceeds to step S31.

In step S26, the register information management means 1h obtains image information data based on the attack ball type data stored in the attack ball information area, and registers the image information data in the data register. Further, the map information management means 1i registers the address data on the data register of the image information data newly registered in the data register on the map. In step S27, the attacking ball information management unit 1k clears the attacking ball information area on its own side.

In step S28, the calculating means 1d subtracts "1" from the maximum value Ymax in the vertical direction on the map. In step S29, the map information management means 1i
Reads the information on the position on the map corresponding to the value of Y, and supplies the information to the determination unit 1c. The determining means 1c
It is determined whether or not the information from the map information management means 1i is "0", and if "YES", the process shifts to step S30.
If "NO", the process returns to step S26.

In step S31, the calculating means 1d subtracts "1" from the first timer data T1. In step S32, the determining means 1c determines that the first timer data T1
Is "0" or not, and if "YES", the flow shifts to the step S33, and if "NO", the flow shifts to the step S9 again.

In step S33, the variable setting means 1b
Substitutes the first default timer data for the second timer data T1. In step S34, the calculating means 1
d adds “1” to the second timer data T2.

In step S35, the judging means 1c judges whether or not the value of the second timer data T2 is "16".
If “YES”, the process shifts to step S36, and “NO”
If so, the process returns to step S9. Step S36
Then, the variable setting means 1b sets the second timer data as
Substitute “0”. The processes performed in steps S31 to S36 are timer processes. Step S
The processing from 31 to S33 is processing as a lower timer. The processing from step S34 to step S36 is processing as an upper timer. In the present embodiment, if a certain time is measured by this timer processing, the ball on the player's side is increased by one column in the x direction. Steps S37 to S45 described later are processing steps for increasing the ball on the player's side by one column in the x direction.

In step S37, the variable setting means 1b
Substitutes “1” for the horizontal address x and “13” for the vertical address y. This is because the processing is started from the bottom of the map shown in FIG. 3C or FIG. 3E.
Address (1, 13) in FIG. 3C or FIG. 3E
Is the top position, that is, the left position of the top position of the map. In step S38, the map information management means 1i
Determines whether or not there is a ball based on whether or not address data has been written at the position on the map indicated by the address (x, y). If “YES”, the process proceeds to step S39, and “ If "NO", the process moves to step S42.
Here, the “address data” is “ad” shown in FIGS. 3A, 3C, and 3E, respectively.

In step S39, the calculating means 1d adds "1" to the uppermost ball number NUM. In step S40, the map information management unit 1i deletes the address data on the ball map detected in step S38. In step S41, the register information management unit 1h
Deletes the ball detected in step S38, that is, the image information data in the data register indicated by the address data on the ball map. Here, the uppermost ball number NUM
Refers to the number of balls existing at the top of the map shown in FIGS. 3C and 3E. In the present embodiment, when the ball reaches the top row of the map shown in FIGS. 3C and 3E, the player of the map loses. Therefore,
If the uppermost ball number NUM is “1” or more, the player to whom the map is assigned loses. Of course, a virtual step not displayed on the display surface (for example, (1, 14))
And the ball may be defeated when it reaches that level.

In step S42, the calculating means 1d adds "1" to the horizontal address x. In step S43, the determining means 1c determines whether or not the value of the horizontal address x is larger than "6". If "YES", the flow shifts to step S44.
Move to 8. As described above, steps S37 to S43 are steps for performing processing for detecting whether or not a ball has reached the top row of the map.

In step S44, the variable setting means 1b
Substitutes "1" for the horizontal address x and "12" for the vertical address y. In step S45, the map information management unit 1i determines whether or not there is a ball based on whether or not the address data ad (see FIGS. 3A, 3C, and 3E) is written at the position on the map indicated by the address (x, y). It is determined whether or not “YES”, and if “YES”, the process shifts to step S46 and “N
If "O", the process moves to step S48.

In step S46, the map information management means 1i moves the address data ad of the position on the map indicated by the address (x, y) to the position on the map indicated by the address (x, y + 1). This process is a process of moving a ball from a lower address to an upper address, and the ball is displayed on the display surface so as to rise from the bottom to the top. In step S47, the register information management unit 1h determines the y direction of the display address data in the image information data on the data register (see FIG. 3A) indicated by the address data ad at the position on the map indicated by the address (x, y + 1). Value of 1
Increase by unit.

In step S48, the calculating means 1d adds "1" to the horizontal address x. In step S49, the determination means 1c determines whether or not the value of the horizontal address x has exceeded "6".
The process proceeds to 50, and if “NO”, the process returns to step S45. As is clear from the above description, step S
In steps S45 to S49, a process of moving all the balls existing in one row in the state in which the value of y is fixed to one stage is performed.

In step S50, the variable setting means 1b
Substitutes “1” for the horizontal address x. Step S
At 51, the calculating means 1d subtracts "1" from the vertical address y.

In step S52, the judging means 1c judges whether or not the value of the vertical address y is "0".
If "S", the process proceeds to step S53, and if "NO", the process proceeds to step S45 again. And step S
50 to S52 are processes for shifting the process to the next higher stage on the map. In step S53, the judgment unit 1c
Determines whether the value of the uppermost ball number NUM is other than 0,
If “YES”, the process shifts to step S9 again, and “N
If "O", the process moves to step S54. As described above, the process detects the presence or absence of the topmost ball on the map, and as a result, determines whether or not the player on the map loses.

In step S54, the result information output means 1
n supplies a command to the drawing processor 10 indicating that it outputs information indicating that the player has lost.
The drawing processor 10 develops image data indicating that the player has lost on the display area of the buffer 11 based on the command. As a result, an image indicating that the player has lost is displayed on the screen of the television monitor 12. In step S55, the button operation detecting means 1a determines whether any button has been pressed, and if "YES", the process proceeds to step S56. In step S56, the variable setting means 1b initializes all parameters.

FIG. 21 is a flowchart for explaining the control operation by the drop processing routine S100.

In step S101, the variable setting means 1b
Assigns “1” to the horizontal address x and the vertical address y, respectively. In step S102, the determination unit 1
c determines whether the data at the position (x, y) on the map shown in FIGS. 3C and 3E is “0”, and if “YES”, the process shifts to step S103, and If there is, the process proceeds to step S109.

In step S103, the variable setting means 1b
Assigns the value of the horizontal address x to the variable Ux and the value of the vertical address y + 1 to the variable Uy. Step S1
In 04, the judgment means 1c sets the (Ux, Uy) on the map.
It is determined whether or not the data at the position of is other than “0”,
If "S", the process moves to step S105, and if "NO", the process moves to step S109. In this step, it is determined whether or not there is a ball immediately below (Ux, Uy) on the map, that is, immediately below (x, y + 1).

In step S105, the map information management means 1i stores the address (x, y). First, the address data (x, y) stored here is the vertical address y having the largest value. In step S106,
The map information management means 1i moves the address data ad at the position on the map indicated by (Ux, Uy) to the position on the map indicated by (x, y). This is a ball drop process on the map.

In step S107, the display address data in the image information data on the data register indicated by the address data ad at the position on the map indicated by (Ux, Uy) corresponds to (x, y) on the map. Rewrite with display address data. This is a process of dropping a ball on the data register. The display address on the data register is rewritten to a display address at a position directly below on the display surface, so that the display address is visually dropped on the display surface. In step S108, the map information management means 1i
Writes “0” at the position on the map indicated by (Ux, Uy). This is because the ball at this address (Ux, Uy) has fallen. In step S109, the calculating means 1d adds "1" to the vertical address y. In step S110, the determination unit 1c determines that the vertical address y
Is determined to be not less than "13", and if "YES", the flow shifts to the step S111, and if "NO", the flow shifts to the step S102 again.

In step S111, the variable setting means 1b
Substitutes "1" for the vertical address y. In step S112, the calculating means 1d sets the horizontal address x to:
"1" is added. In step S113, the determination unit 1
It is determined whether or not c is equal to or larger than the horizontal address x. If “YES”, the process proceeds to step S114, and if “NO”, the process proceeds to step S102 again. In step S114, “1” is added to N. In the step S115, it is determined whether or not N exceeds “12”. If “YES”, the process shifts to the step S116.
If “NO”, the process returns to step S101. In step S116, N is set to "0". Then, the process exits the drop routine. Here, in step S115, it is determined whether or not N exceeds “12”.
This is because the balls are moved by one square (see FIGS. 3C and E) in the vertical direction in one process of the loop from step S101 to step S113. The vertical cell is x
Since there are thirteen in each direction, all balls can be moved by repeating the loop 12 times. The following example would be simple: For example, there is a ball at the highest address (x, 13) (x = 1, 2, 3,... 6) in the vertical direction, and the ball at this position is located at (x, 1) (x = 1,
To move to 2, 3,... 6), the loop may be executed 12 times. Thus, FIGS. 3C and E
Are searched from the bottom to the top over the entire area of the map shown in FIG.

FIG. 22 to FIG. 25 are flow charts for explaining the control operation by the erase routine. In step S201, the determining means 1c determines whether or not an address (x, y) exists in a predetermined area of the main memory 5,
If “YES”, the process shifts to step S202 and “N
If "O", the process exits this erasing routine. Here, the predetermined area of the main memory 5 refers to a predetermined area from a certain address to a certain address on the main memory 5. In this predetermined area, the address (x, y) of the cursor is stored in step S15.
In 5, the destination address (x, y) of the ball after falling
Is stored. In step S202, the variable setting means 1
b denotes the value of the horizontal address x, the value of the vertical address y to the horizontal addresses X1 and X2, and the value of the vertical address Y to the vertical address Y.
1 and Y2, respectively.

In step S203, the map information management means 1i reads the address data at the position on the map indicated by the value of the address (X1, Y1). Subsequently, the register information management means 1h reads the image information data stored at the position indicated by the value of the address data on the data register. In step S204, the calculating means 1d substitutes the horizontal address X2 with a value obtained by adding "1" to the horizontal address X1.

In step S205, the map information management means 1i reads the address data ad at the position on the map indicated by the value of the address (X2, Y2). Subsequently, the register information management means 1h reads the image information data stored at the position indicated by the value of the address data ad on the data register. In step S206, the determination unit 1c
The image information data read from the data register by the address data on the map indicated by the value of the address (X1, Y1) and the image information data read from the data register by the address data on the map indicated by the value of the address (X2, Y2). It is determined whether or not the image information data has the same contents, and "NO"
If so, the process proceeds to step S207, and if “YES”, the process proceeds to step S214. In this step, it is detected whether or not the image data having the same content is arranged one immediately to the right. In the present embodiment, the fact that "information has the same content" of the balls arranged in the horizontal direction means that the balls are large and have the same color.

In step S207, the calculating means 1d
"1" is subtracted from the horizontal address X2, and "1" is subtracted from the vertical address Y2. In step S208, the map information management unit 1i stores the address (X2, Y
The address data ad at the position on the map indicated by the value of 2) is read. Subsequently, the register information management means 1h reads the image information data stored at the position indicated by the address data ad on the data register.

In step S 209, the judgment means 1 c
Image information data read from the data register by the address data ad on the map indicated by the value of the current address (X2, Y2) and read from the data register by the address data on the map indicated by the value of (X1, Y1). It is determined whether or not the outputted image information data has the same contents.
If "S", the process proceeds to step S214, and if "NO", the process proceeds to step S210. In this step,
It is determined whether image data of the same content is located immediately below. In the present embodiment, the fact that "information has the same content" of balls arranged in the vertical direction means that the balls are large and have the same color. In step S210, the calculating means 1d subtracts "1" from the horizontal address X2 and subtracts "1" from the vertical address Y2. Step S21
1, the map information management means 1i stores the address (X2, Y
The address data ad at the position on the map indicated by the value of 2) is read. Subsequently, the register information management means 1h reads the image information data stored at the position indicated by the address data ad on the data register. In step S212, the judging means 1c uses the address data ad on the map indicated by the value of the current address (X2, Y2) to read the image information data read from the data register and the map information indicated by the value of (X1, Y1). It is determined whether or not the image information data read from the data register has the same content according to the address data. If "YES", the flow shifts to step S214, and if "NO", the flow shifts to step S201 again. In this step, it is detected whether or not the image data having the same content is located one line to the left.

In step S214, the mark map information management means 1j sets "1" in the corresponding position of the mark map.
Write. Here, “1” is a flag indicating that the large ball corresponding to the position has the same color as the large ball used as the reference for comparison. Further, the “corresponding position” means two positions. One position is determined in step S206.
, The information determined to have the same content as the information indicated by the value of the address (X1, Y1) is registered.
This is a position on the mark map corresponding to the position on the map indicated by the value of the address (X2, Y2). The other position is the address (X2, Y2) in which information determined to have the same content as the information indicated by the value of the immediately preceding address (X2, Y2) is registered in step S209.
This is a position on the mark map corresponding to the position on the map indicated by the value of 2). The writing of "1" corresponding to the position on the mark map corresponding to the position on the map indicated by the value of (X1, Y1) is performed in steps S229 to S232.
Done in

In step S215, the variable setting means 1b
Substitutes “1” for the erase number ERA. Step S21
At 6, the variable setting means 1b substitutes the value of the horizontal address X2 for the horizontal address X3 and the value of the vertical address Y2 for the vertical address Y3.

In step S217, the variable setting means 1b
Is the address (X3, Y3 + 1) in the upper address UAd.
Is set. In step S218, the map information management unit 1i reads the address data from the position on the map indicated by the value of the upper address UAd. Subsequently, the register information management means 1h reads out the image information data from the data register according to the address data.

In step S 219, the judgment means 1 c
The image information data read from the data register by the address data on the map indicated by the value of the upper address UAd and the image information data read from the data register by the address data on the map indicated by the address (X2, Y2) It is determined whether or not the contents are the same. If “YES”, the process shifts to the step S220. If “NO”, the process shifts to the step S223. In step S220, the mark map information management means 1j writes "1" in the corresponding position of the mark map.

In step S221, the calculating means 1d
"1" is added to the erase number ERA. In step S222, the map information management unit 1i sets the upper address UAd as
It is stored in a predetermined area of the main memory 5.

In step S223, the variable setting means 1b
Is the address (X3, Y3-1) in the lower address DAd.
Is assigned. In step S224, the map information management unit 1i reads the address data from the position on the map indicated by the value of the lower address DAd. Subsequently, the register information management means 1h reads out the image information data from the data register according to the address data.

In step S225, the judgment means 1c determines
The image information data read from the data register by the address data on the map indicated by the value of the lower address DAd and the image information data read from the data register by the address data on the map indicated by the address (X2, Y2) It is determined whether or not the contents are the same. If “YES”, the process shifts to the step S226. If “NO”, the process shifts to the step S229. In step S226, the mark map information management means 1j writes "1" in the corresponding position of the mark map.

In step S227, "1" is added to the erase number ERA. In step S228, the map information management unit 1i stores the value of the lower address DAd in a predetermined area of the main memory 5.

In step S229, the variable setting means 1b
Is the address (X3-1, Y3) in the left address LAd.
Is assigned. In step S230, the map information management unit 1i reads the address data from the position on the map indicated by the value of the left address LAd. Subsequently, the register information management means 1h reads out the image information data from the data register according to the address data.

In step S231, the judgment means 1c
The image information data read from the data register by the address data on the map indicated by the value of the left address LAd and the image information data read from the data register by the address data on the map indicated by the address (X2, Y2) It is determined whether or not the contents are the same. If “YES”, the process shifts to the step S232; if “NO”, the process shifts to the step S235. In step S232, the mark map information management means 1j writes "1" at the corresponding position of the mark map.

In step S233, the calculating means 1d sets
"1" is added to the erase number ERA. In step S234, the map information management unit 1i sets the value of the left address LAd in a predetermined area of the main memory 5.

In step S235, the variable setting means 1b
Is the address (X3 + 1, Y3) in the right address RAd.
Is assigned. In step S236, the map information management unit 1i reads the address data from the position on the map indicated by the value of the right address RAd. Subsequently, the register information management means 1h reads out the image information data from the data register according to the address data.

In step S237, the judgment means 1c sets
The image information data read from the data register by the address data on the map indicated by the value of the right address RAd and the image information data read from the data register by the address data on the map indicated by the address (X2, Y2) It is determined whether or not the contents are the same. If “YES”, the process shifts to the step S238. If “NO”, the process shifts to the step S241. In step S238, the mark map information management means 1j writes "1" in the corresponding position of the mark map.

In step S239, the calculating means 1d sets
"1" is added to the erase number ERA. In step S240, the map information management means 1i stores the right address RAd
It is stored in a predetermined area of the main memory 5.

In step S241, the judgment means 1c
It is determined whether or not the stored address exists. If “YES”, the process shifts to the step S242; if “NO”, the process shifts to the step S229. Here, the "stored addresses" are initially the addresses UAd, DAd, LAd, and RAd on the top, bottom, left, and right of the address (X2, Y2). Top, bottom, left and right addresses UAd, DAd, LAd, and RAd
Are sequentially substituted and used for processing. The following are the upper, lower, left, and right addresses similarly detected from these addresses. Steps S 217 to S 241 are performed until all of the upper, lower, left, and right searches are completed for all these addresses.
Repeated for two types of balls. When steps S217 to S240 are processed again, the type of the ball in the data register corresponding to the position indicated by the address data ad on the map is set to the immediately preceding step S217 to S240.
In the case where the type of the ball to be processed is the same as the type, the corresponding position on the mark map is successively marked with “1”. In step S242, the variable setting unit 1b
Substitutes the stored address for the address (X3, Y3). Here, the "stored address" is the upper, lower, left and right addresses UAd, DAd,
LAd and RAd.

In step S243, the judgment means 1c sets
It is determined whether the value of the number of erases ERA is “3” or more, and “Y”
If “ES”, the process moves to step S244, and if “NO”, the process moves to step S255. Step S244
Then, the variable setting means 1b sets the value of the erase number ERA to ERAn
(N = 1, 2, 3,...) And set ERA to 0. In step S245, the calculating means 1d sets the number of chains RU
"1" is added to N. In step S246, the variable setting means 1b sets all addresses (x,
y) is deleted. This is because the processing by the drop routine is performed after this processing, it is necessary to obtain a new address (x, y) again, and the old address (x, y) is not required. In step S247, the register information management unit 1h sets the position on the data register indicated by the address data ad registered at the position on the map corresponding to the position where "1" is registered on the mark map. The registered image information data, that is, the storage address, type, and display address are deleted.

In step S248, the map information management means 1i stores the address data a of the position on the map corresponding to the position where "1" is written on the mark map.
Erase d. In step S249, the map information management unit 1i stores the upper, lower, left, and right address data ad of the position on the map where the information has been deleted in a predetermined area of the main memory 5.

In step S250, the mark map information management means 1j deletes all "1" on the mark map. In step S251, the register information management unit 1h stores the image on the data register, which indicates the address data stored in a predetermined area of the main memory 5 and registered in the upper, lower, left, and right positions on the map from which the information has been deleted. Read information data.

In step S252, the judgment means 1c determines
From the contents of the type data in the image information data, it is determined whether or not the ball at the upper, lower, left, and right positions on the map from which the information has been deleted is a small ball. If so, the process moves to step S254. In step S253, the register information management unit 1h rewrites the type data in the image information data of the small ball to the type data indicating a large ball.

In step S254, the judgment means 1c sets
It is determined whether the processing has been completed for all the addresses stored in the predetermined area of the main memory 5 and “YE
If "S", the process returns to step S100, and "NO".
If so, the process returns to step S251. here,
The “address” is an address stored in a predetermined area of the main memory 5 in step S249, and means an upper, lower, left, and right address on the map from which information has been deleted.

[Effects of the First Embodiment] As described above, in the present embodiment, the game player operates the controller 22 to operate the cursor by operating the controller 22 in a state where large and small balls compete from bottom to top. When the ball specified in the above is replaced with another ball in the field, and three or more large balls of the same color in the field are connected in succession, all of the large balls are deleted. And
When the large ball is moved by the erasure, it is detected whether or not there is a large ball of the same color continuously connected to the large ball, and when the number of continuously connected large balls is 3 or more, all of the large balls are deleted. I did it. Furthermore, when a small ball is adjacent to the erased large ball, the small ball is changed to a large ball, and it is detected whether or not the large ball of the same color is continuously connected to the large ball. All big balls are deleted. Therefore, the game is completely different in form from the so-called “fallen object” game that has been conventionally proposed. Therefore, for the game player,
There is an effect that a newer form of game can be provided. Although the exchange pattern is not described separately, the exchange pattern is as follows: (1) When a ball is held by a cursor, the pattern is replaced with another ball in the field; (3) After the pattern of (2) is completed, the replacement process is performed when there is no ball in the field while holding the ball.
There are three patterns of selecting a ball in the field and holding it for replacement. These patterns are appropriately processed by the steps shown in the above-described flowchart.

[Modification 1] In the above embodiment,
The case where the number of continuous connections is "3" or more has been described. However, this is merely an example, and a condition based on a shape such as "6" or a horizontal row may be used. In addition, the total number of balls in the field is set to 6 horizontally and 13 vertically, but it goes without saying that the number can be increased or decreased according to the size of the ball (the number of constituent pixels). Further, although a two-dimensional display is used, a pseudo three-dimensional display may be used. In this case, the viewpoint position is fixed, the texture data of the ball is mapped to the polygon, and the light source calculation is performed at any time based on the position of the ball to change the luminance of the ball. realizable. In the case of the pseudo three-dimensional display as described above, an aesthetic appearance can be further generated, and a more comfortable game space can be provided to the game player.

[Second Embodiment] In the second embodiment, it is possible to graphically notify the game player whether or not the ball can be used in the first embodiment. It is further added to the content of the game.

FIGS. 26 and 27 are screen display examples for explaining the second embodiment. As shown in FIG. 26, in the present embodiment, when the condition that the ball cannot be used is valid, an image in which the ball is connected by a chain is displayed. In the example shown in FIG. 26, the images of possessed balls linked by chains are displayed at the upper center. FIG. 27 is an enlarged view of the image. At the top is displayed "mochi-dama", and at the bottom is displayed an image in which the ball of the player and the opponent are connected to a chain. The condition that the possessed ball cannot be used is, for example, when the large ball is erased or when the opponent is under attack, as shown in FIG. When the possessed ball can be used, it means that the large ball is not displayed, the cursor and the large ball itself are not displayed, or they are not connected by a chain.

[Effects of the Second Embodiment] In this embodiment, in addition to the effects of the first embodiment, the useable balls are displayed so that they can be used or not, so that they can be visually understood. A more comfortable game environment can be provided to the game player.

[Third Embodiment] In the third embodiment, the judgment processing for making the game over is more detailed. And furthermore, if the pattern which is essentially a game over, that is, if all the balls in the uppermost row have been erased before a certain time has elapsed since the ball was present in the uppermost row,
Game over is avoided.

FIG. 28 is a flowchart replacing FIG. 20 in FIGS. 16 to 20 used in the first embodiment. In the third embodiment, FIG.
19 to 28 constitute a main routine.
The parts corresponding to those in FIG. 20 are denoted by the same reference numerals, and description thereof will be omitted. Steps added in the third embodiment are denoted by reference numerals in the 60's. Further, in the third embodiment, in addition to the means shown in FIG. 2, "timer means" and "notification means" are used. . Step S
If “NO” is determined in 52, the flow shifts to step S45 in the flowchart in FIG.

In step S60, the judgment means 1c judges whether or not the vehicle is stopped. If "YES", the flow shifts to step S64. If "NO", the flow shifts to step S61. Here, "stopping" is equivalent to step S53 in the flowchart shown in FIG. In step S61, the determination unit 1c determines that NUM is greater than 0,
In addition, it is determined whether or not there is a ball on the uppermost row or on the uppermost row. If "YES", the process shifts to step S62. If "NO", the process shifts to step S64.

In step S62, the timer means sets a stop timer. In step S63, the notifying unit notifies a danger state. Here, the notification of the dangerous state means that the game is about to be over, and for example, the entire screen is displayed in red.

In step S64, the timer means determines whether or not the timer value ST is "0". If "YES", the process shifts to step S66. If "NO", the process proceeds to step S66.
Move to 65. In step S65, the timer means
The reference value STref is subtracted from the timer value ST.

In step S66, the judging means 1c judges whether or not there is a ball on the uppermost row. If "YES", the flow shifts to step S67; if "NO", the flow chart shown in FIG. The process moves to step S9. In step S67, the CPU 1 performs a game over process.

[Effects of Third Embodiment] In this embodiment, when a ball is present in the uppermost row, a grace period is given for a certain period of time. Since this is not the case, the fun of the game can be further improved.

[Fourth Embodiment] Next, FIGS.
The fourth embodiment will be described with reference to FIG. FIGS. 29 to 35 are explanatory diagrams showing screen display examples in the “quiz mode” of the fourth embodiment, and FIGS. 36 to 38 are flowcharts for explaining control operations in the “quiz mode”.

On the select screen of step S3 in FIG. 16, a "quiz mode" (described as "flash mode" (quiz) in the figure) is also displayed as shown in FIG. 29, and further, as shown in FIG. A screen for selecting a character to be displayed during the quiz mode is displayed. "Quiz mode" is selected in step S3, and the character shown in FIG. 30 is selected (in this example, character CHR1 is selected). When the start button is pressed in step S4, "quiz mode" is selected in step S5. Is set, and the initial screen of the "quiz mode" is output in step 6 as shown in FIG. 31, and the flags and variables are initialized in step S7. Thereafter, the game in the quiz mode is developed. The control process in the quiz mode will be described below. FIG. 31 shows the first screen in the quiz mode.
This is a display example of the first quiz as described as “first question”. On the right, the selected character CH
The image of R1 is displayed so as to perform an operation according to the playing state of the player. On the left side, balls corresponding to the quiz (for convenience, large balls are indicated by large circles and small balls are indicated by small squares) are displayed. These balls are picked with the cursor Ca and exchanged for other balls in the field. In this example, the questions are "two chains" and "two moves". Then, three large balls of the same color (shown by diagonal lines for convenience) and three small balls of the same color are displayed. Also, "maximum chain" under "problem" means the number of chains to be chained. is there. In this example, "two or more chains" is a condition in the erasing process. Below this is "the number of remaining moves", and further below this is "2 hands". Here, the “remaining number of hands” refers to the number of exchanges Rn. Therefore, in this example, the erasure must be performed under the above conditions within the number of replacements Rn of “2”. However, the "exchange" in the present embodiment means to hold the ball in the field with the cursor, return the ball in the field to the field, and exchange the ball in the field with the ball in the cursor. Including. The above condition is satisfied by the following processing. The player moves the cursor Ca to the position of the large ball at the lower left end of the lower row, presses the first button 22c, and holds the large ball with the cursor Ca (first move).
Then, the small ball on the left end of the upper row falls to the position of the large ball you just took. Next, the player moves the cursor Ca and the cursor Ca to the position where the small ball is dropped and vacant, that is, the left end of the upper row.
When the large ball held by is moved and then the first button 22c is pressed (second hand), three large balls of the same color are continuously connected in the upper row. Therefore, these large balls are deleted.
This is the first chain. Next, by removing these large balls, the lower balls adjacent to these large balls are changed to large balls of the same color. And the three small balls in the lower row are
As soon as it changes to a large ball of the same color, it is erased because it is continuously connected. This is the second chain. That is, the “two-chain” given as a condition is changed to “2
You have cleared it with your hands. In step S301, the variable setting means 1b reads quiz data corresponding to the value of the quiz stage number Sn. Incidentally, the value of Sn is initialized to a default value “1”, and the maximum value is “99”. The quiz data is composed of ball arrangement data and clear condition data. In the present embodiment, 99 quiz stages are prepared for the number of quiz stages Sn. As the clear condition data, one of the number of chains RUN2 and the number of replacements Rn, or the number of simultaneous erasures ERAn and the number of replacements Rn is selected. The number of exchanges Rn is counted when the ball is held or exchanged, and is not counted when the exchange button is pressed in a state where there is no ball and the cursor has nothing. In step S302, the variable setting unit 1b sets, initializes, and displays each parameter according to the read quiz data. In step S303, the button operation detecting means 1a determines whether or not the select button 22b has been pressed. If "YES", the process exits this routine. If "NO", the process proceeds to step S304. In step S304, the button operation detecting means 1a determines whether or not the second button 22d has been pressed, and "YES".
If it is, the process proceeds to step S305, and if “NO”, the process proceeds to step S400. In step S305, the result information output unit 1n outputs a message indicating the retry (see FIG. 34). As shown in FIG. 35, a character image of “redo” is used as a message indicating retry. In FIG. 35, "Erase All" means that all the balls existing on the field as well as the ball held by the cursor are erased. In step S400, a process according to the quiz routine shown in FIGS. 37 and 38 is performed. In step S306, the calculating means 1d subtracts "1" from the number of replacements Rn. Here, the number of exchanges Rn is the value of the number of exchanges Rn, which is the clear condition data in the quiz data read in step S302. In step S307, the determination unit 1c
It is determined whether or not is the actual number ≧ the condition number. If “YES”, the process shifts to the step S308. If “NO”, the process shifts to the step S311. Here, the actual number is the number of chains RUN2 and the number of simultaneous deletions ER generated by the operation of the player.
An, and the condition number is any of the number of chains RUN2 in the quiz data and the number of simultaneous deletions ERAn. In step S308, the result information output unit 1n outputs a message indicating success (see FIG. 33). As shown in FIG. 33, a character image of "correct answer" is used as a message indicating success, and the expression of the character displayed on the right side is changed to an expression indicating joy. Step S309
Then, the calculating means 1d adds "1" to the number of quiz stages Sn. In step S310, the determination means 1c determines whether or not the number of quiz stages Sn is larger than "99".
If “YES”, the process exits this routine. If “NO”, the process returns to step S301. Step S31
In step 1, the determining means 1c determines whether or not the number of replacements Rn is 0, and if "YES", the flow shifts to step S312.
If "NO", the process returns to step S303. In step S312, the result information output unit 1n outputs a message indicating failure (see FIG. 32). As shown in FIG. 32, a character image of “failure” is used as a message indicating failure, and the expression of the character displayed on the right side is displayed to indicate dissatisfaction.

Next, the control operation of the quiz routine will be described with reference to FIGS. 37 and 38. In FIGS. 37 and 38, steps for performing the same processing as in FIGS. 16 to 20 are denoted by the same reference numerals in parentheses, and description thereof is omitted. In step S412, the determination means 1c selects the largest value of all the simultaneous erase numbers ERAn (n = 1, 2, 3,...). Step S4
In step 13, the simultaneous erase number ERAn selected by the determination means 1c is stored. In step S414, the variable setting means 1b substitutes the number of chains RUN for the number of chains RUN2. Step S4
At 15, the variable setting means 1b sets the number of chains RUN to 0.

[Effects of the Fourth Embodiment] As described above, in the present embodiment, conditions are set in advance, it is determined whether or not the player satisfies the conditions and erases. Since it is possible to shift to the next stage only when the condition is satisfied, it is possible to make the player more motivated for the game.

[0120]

According to the present invention described above, the objects sequentially displayed on the screen are moved from one direction on the screen to the other direction, and the same kind of objects are continuously connected. This is a method of moving an object in a game in which the same kind of continuously connected objects are erased, which is an erasing condition of an object to be formed, and replaces an object designated by a cursor with an object located at another position on the screen. . Therefore, there is an effect that the motivation of the game player to play the game can be further improved.

In the invention, the type of the object is a shape, a color, a pattern, and a combination of the shape, the color, and the pattern. Therefore, there is an effect that the erasing condition can be easily understood for the game player.

Further, in the above invention, when it is not possible to perform the process of replacing the object specified by the cursor with an object located at another position on the screen, it is visually notified that the replacement process is not possible, and the cursor is designated. When the process of replacing the object with the object at another position on the screen can be performed, it is visually notified that the replacement process is possible. Therefore,
There is an effect that a more intuitive game environment can be provided to the game player.

In the above invention, at least two or more display areas are provided on the same screen, and the game processing is performed in one of the display areas and the other display area. Therefore, there is an effect that two or more players can play a game on one screen.

Further, in the above invention, the number of objects corresponding to the number of objects respectively erased in one display area or the other display area is added to the other display area. Therefore, there is an effect that a competitive game can be realized.

In the invention, the object is at least one of an object to be erased and an object not to be erased. Therefore, by mixing objects that can be erased and objects that cannot be erased, the game contents can be made more difficult, and the game player can be more interested.

In the above invention, the non-erased object adjacent to the erased object is regarded as the object to be erased. Therefore, there is an effect that the game player can be more interested by complicating the content of the game.

Further, in the above invention, the shape of the cursor is changed to a shape indicating that the cursor can be moved, and a part or all of the cursor is animated. Therefore,
There is an effect that the position of the cursor on the display surface can be easily understood.

Further, according to the present invention, there is provided a game apparatus in which the position of an object displayed on a screen is changed, and when the same kind of object is continuously connected, the continuously connected object is deleted. An erasing condition is set in advance, and the number of objects equal to or greater than the number erasable under the condition is displayed on the screen at least in an array such that the object can be erased under the setting condition. Since it is determined whether or not erasing is being performed, a newer form of the game can be provided to the player.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of a game system according to a first embodiment of the present invention.

FIG. 2 is a functional block diagram showing functions of a CPU 1 shown in FIG.

FIG. 3 is an explanatory diagram for explaining the game system shown in FIG. 1; FIG. 3A is an explanatory diagram showing an example of data stored in a data register. FIG. 3B is an explanatory diagram showing an example of a table including a data string indicating types of balls according to the number of balls. FIG. 3C is an explanatory diagram showing an example of a map indicating a state of a field on its own side. FIG. 3D is an explanatory diagram showing number data of attack balls. FIG. 3E is an explanatory diagram showing an example of a map indicating a state of a field on the partner side. FIG. 3F is an explanatory diagram showing number data of attack balls. [FIG. 3G] It is explanatory drawing which shows an example of the map for marks.

FIG. 4 is an explanatory diagram showing an example of a screen display in a case where three large balls of the same type are arranged by replacing the balls and these three large balls are deleted.

FIG. 5 is an explanatory diagram showing an example of a screen display in a case where three large balls of the same type are arranged by replacing balls, and these three large balls are deleted.

FIG. 6 is an explanatory diagram illustrating a screen display example in a case where three large balls of the same type are arranged by replacing a ball, and these three large balls are deleted.

FIG. 7 is an explanatory diagram showing a screen display example in a case where an original large ball becomes a replacement ball, and by replacing the ball, three large balls of the same type are arranged and these three large balls are deleted. is there.

FIG. 8 is an explanatory diagram showing an example of a screen display in a case where three large balls of the same type are arranged and three large balls are erased by replacing an original large ball with a replacement ball; is there.

FIG. 9 is an explanatory diagram showing a screen display example in the case where an original large ball becomes a replacement ball, and by replacing the possessed ball, three large balls of the same type are arranged and these three large balls are erased. is there.

FIG. 10 is an example of a screen display in a case where a large ball that was at the top is deleted by deleting the large ball that was at the bottom, and three large balls of the same type are thereby arranged, and these three large balls are deleted. FIG.

FIG. 11 is an example of a screen display in a case where a large ball located above is erased to drop a large ball located above, thereby arranging three large balls of the same type, and these three large balls are erased. FIG.

FIG. 12 is an example of a screen display in a case where a large ball located above is dropped by deleting a large ball located below, whereby three large balls of the same type are arranged, and these three large balls are deleted. FIG.

FIG. 13 shows a screen display example in a case where a large ball is changed from a small ball to a large ball by erasing an adjacent large ball, and three large balls of the same type as the large ball are arranged, whereby these three large balls are deleted. FIG.

FIG. 14 shows a screen display example in a case where a large ball changes from a small ball to a large ball by erasing an adjacent large ball, and three large balls of the same type as the large ball are lined up to erase these three large balls. FIG.

FIG. 15 shows an example of a screen display in a case where a large ball changes from a small ball to a large ball when an adjacent large ball is deleted, and three large balls of the same type as the large ball are lined up to delete these three large balls. FIG.

FIG. 16 is a flowchart illustrating a control operation by a main routine of the game program.

FIG. 17 is a flowchart illustrating a control operation by a main routine of a game program.

FIG. 18 is a flowchart illustrating a control operation by a main routine of the game program.

FIG. 19 is a flowchart illustrating a control operation by a main routine of a game program.

FIG. 20 is a flowchart illustrating a control operation by a main routine of the game program.

FIG. 21 is a flowchart illustrating a control operation according to a drop routine S100.

FIG. 22 is a flowchart illustrating a control operation according to an erasing routine S200.

FIG. 23 is a flowchart illustrating a control operation according to an erasing routine S200.

FIG. 24 is a flowchart illustrating a control operation according to an erasing routine S200.

FIG. 25 is a flowchart illustrating a control operation according to an erasing routine S200.

FIG. 26 is an explanatory diagram illustrating an example of a screen display according to the second embodiment;

FIG. 27 is an explanatory diagram illustrating an example of a screen display according to the second embodiment;

FIG. 28 is a flowchart illustrating a control operation according to a main routine according to a third embodiment.

FIG. 29 is an explanatory diagram illustrating a screen display example according to the fourth embodiment;

FIG. 30 is an explanatory diagram illustrating a screen display example according to the fourth embodiment;

FIG. 31 is an explanatory diagram illustrating a screen display example according to the fourth embodiment;

FIG. 32 is an explanatory diagram illustrating a screen display example according to the fourth embodiment;

FIG. 33 is an explanatory diagram illustrating a screen display example according to the fourth embodiment;

FIG. 34 is an explanatory diagram illustrating a screen display example according to the fourth embodiment;

FIG. 35 is an explanatory diagram illustrating a screen display example according to the fourth embodiment;

FIG. 36 is a flowchart illustrating a control operation according to the fourth embodiment.

FIG. 37 is a flowchart illustrating a control operation according to the fourth embodiment.

FIG. 38 is a flowchart illustrating a control operation according to the fourth embodiment.

[Explanation of symbols]

 1 CPU 1a Button operation detecting means 1b Variable setting means 1c Judging means 1d Computing means 1e Flag managing means 1f Ball type discriminating means 1g Ball exchanging means 1h Register information managing means 1i Map information managing means 1j Mark map information managing means 1k Attack ball Information management means 1m Ball changing means 1n Result information output means 2 Bus 4, 20 Interface circuit 5 Main memory 6 ROM 8 Parallel port 9 Serial port 10 Drawing processor 11, 14, 18 Buffer 13 Audio processor 15 Amplifier circuit 16 Speaker 17 Decoder 19 Recording medium driver 22 Controller

 ────────────────────────────────────────────────── ─── Continued on the front page (72) Inventor Yasuyuki Nakane 7-3-3 Minatojima Nakamachi, Chuo-ku, Kobe City, Hyogo Prefecture Within Konami Co., Ltd. (72) Inventor Toshio Kodaira 7-3, Minatoshimanakamachi, Chuo-ku, Kobe City, Hyogo Prefecture 2-2 Konami Co., Ltd. (72) Inventor Junichi Ishida 7-3-7 Minatojima Nakamachi, Chuo-ku, Kobe-shi, Hyogo 2-2 Konami Co., Ltd. (72) Inventor Shinichi Kasahara Kita-ku, Kita-ku, Sapporo City, Hokkaido Address 1 Konami Entertainment Sapporo

Claims (5)

[Claims] 1. A game device wherein the position of an object displayed on a screen can be changed and, when objects of the same kind are continuously connected, the continuously connected objects can be erased. In the above, an object erasing condition is set in advance, and the number of the objects equal to or greater than the number erasable under the erasing condition is displayed on the screen in an array such that at least the object can be erased under the set erasing condition. It is determined whether or not the object satisfies the condition and the object is erased. 2. The erasing condition includes the number of chains that is the number of erasures, the maximum number of the objects to be erased in one chain, the number of movements of the object, and the number of replacements of the object. The game device according to claim 1, wherein the game device is at least one of the following. 3. The game device according to claim 1, wherein the object is composed of a plurality of types, and the type of the object is a shape, a color, a pattern, and a combination of the shape, the color, and the pattern. 4. The game device according to claim 1, wherein the object is one of an object to be erased and an object not to be erased. 5. The apparatus according to claim 1, wherein a cursor capable of pointing or holding the object is arbitrarily movable by the player, and a part or all of the cursor is animated. The game device according to 1.