JP2003135849A - Game device and game controlling method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To solve the problems of a conventional Othello (R) game in which an opponent player can put his/her piece in only a limited space and the progress of the game can be easily predicted and the result becomes a clear to some extent in the midway of the game. SOLUTION: In this game, a player cannot place his/her own piece adjacently to another his/her own piece basically, however, if the player can put an opponent's piece between his/her already placed piece and a newly placed piece, the newly placed piece may be placed in the position adjacent to an already placed his/her piece. In the state of the game shown in a figure, a newly placed black piece can be arranged in one of the positions (the coordinates (3, 1), (4, 1), (4, 3)) in which white piece/pieces on the game board can be put between black pieces, and positions (the coordinate (4, 2), (5, 1), (5, 2), (5, 3), (5, 4), (6, 2), (6, 3), (6, 4)) not adjacent to the already arranged black piece.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention arranges one's piece on the board and replaces the opponent's piece on the board sandwiched between the piece and the piece already arranged with one's piece. The present invention relates to a device or a method for controlling a game in which a game of finally competing for the number of pieces arranged on the board is performed.

[0002]

2. Description of the Related Art A widely known Othello game (registered trademark) will be described below. Two operators alternately place black stones and white stones on the board surface composed of the vertical and horizontal 6 × 6 cells shown in FIG. 17A. At the start of the game, two black stones 321 and 322 and two white stones 441 and 442 are placed in the center of the board, and pieces are placed on the board according to the following rules. The values of the X coordinate and the Y coordinate are written above and to the left of the board, respectively.

First, when the opponent's piece on the board can be sandwiched between the already placed piece and the piece to be placed, the piece is placed at that position. You can For example, in the situation shown in FIG. 17B, positions where the white stone 443, the white stone 444, or the white stone 445 can be sandwiched, that is, the coordinates (1,1), the coordinates (5,
Black stones can be placed at 1) or at coordinates (5,2).

Secondly, when a player's piece is placed on the board, if the opponent's piece is sandwiched between the piece and the piece already placed, the sandwiched piece of the opponent's piece Replace with. In addition, not only when sandwiched in the X-axis direction and Y-axis direction, but also when sandwiched in the diagonal direction,
Replace all the sandwiched pieces with your own piece.
For example, in the situation shown in FIG. 17B, when a black stone is arranged at the coordinates (1,1), the white stone 443 is replaced with the black stone.

Thirdly, when the player cannot arrange his / her own frame on the board, the other party arranges the frame. Also,
The game ends when all the squares on the board are placed. At the end of the game, the win or loss is determined by the number of pieces arranged on the board.

[0006]

However, in the above-mentioned Othello game (registered trademark), there are few positions where the opponent can place the pieces, and it is easy to predict the development of the game. Therefore, in some cases, the outcome of the game may be known while the game is in progress. In addition, there is little possibility of upset when two players with different progresses compete.

The present invention solves such a problem by
An object of the present invention is to provide a game device and a game control method that allow a wide range of game development and increase the difficulty of predicting the game development.

[0008]

[Means for Solving the Problems and Effects of the Invention] (1) (2)
(3) The game device of the present invention comprises a display unit, an input operation unit,
A device that includes a control unit and a storage unit, in which an opponent places a first frame or a second frame on the board of the display unit to execute a game in which the number of frames at the end of the game is competed. In response to a command input by the operator who is a player from the input operation unit or a command generated by the control unit that is a virtual opponent, the first frame or the second frame is placed at the position on the board specified by the command. Arranging, and arranging means for executing the arranging process for storing the position of the first frame or the second frame in the storage unit, and when the first frame is arranged, The second piece on the board sandwiched by the arranged first pieces is replaced with the first piece, and when the second piece is arranged, the second piece and the already arranged pieces are replaced. The first piece on the board sandwiched between the two pieces Replacement means for performing replacement processing for replacing with the second frame and storing in the storage section, and the arranging means sandwiches a frame of another type with a frame of the same type already arranged. It is characterized in that the arrangement processing is executed so as to permit the arrangement of a new frame only at any position that is not adjacent to a previously arranged frame of the same type.

As a result, the number of positions where the first frame (or the second frame) can be arranged is increased as compared with the conventional Othello game (registered trademark), so that the game development can be widened. The degree of difficulty in predicting the deployment can be increased. In other words, it is unlikely that a situation in which the outcome of a game is known will be known while the game is in progress. In addition, even when people with different progresses compete against each other, the possibility of upset is increased.

(4) In the game device according to the present invention, the replacement processing is performed by the first piece arranged on the board surface and the second piece on the board surface by the first piece already arranged on the board surface. Is sandwiched in the vertical direction, the horizontal direction, or the diagonal direction, all of the sandwiched second frames are replaced with the first frames.

(5) In the game device of the present invention, the replacement processing is performed by the first piece arranged on the board surface and the second piece on the board surface by the first piece already arranged on the board surface. Is sandwiched in the vertical direction, the horizontal direction or the diagonal direction, the second frame selected by the operator among the sandwiched second frames is replaced with the first frame.

As a result, in the above (5), the game development can be predicted to some extent, and in the above (6), the game development can be made almost unpredictable.

(6) The game device of the present invention is characterized in that at the start of the game, two first frames and two second frames are arranged at each of the four corners of the board. As a result, the conventional Othello game (registered trademark)
The game development different from can be realized.

(7) In the game device according to the present invention, the placement processing is performed by the first piece and the second piece on the board surface, except when there is no position where one of the pieces can be placed on the board surface. It is characterized by alternately arranging the frames and arranging the other frame when there is no position on the board where one of the frames can be arranged. This allows the game to proceed even if there is no position where one of the pieces can be placed.

(8) In the game device according to the present invention, the arrangement processing is characterized in that the game play is ended when there is no position on the board where the first frame and the second frame can be arranged. There is. As a result, the game play can be ended when the game cannot be progressed.

(9) The server device of the present invention is connected to a terminal device used by an operator via a network, has a control unit and a storage unit, and an operator who is an opponent can use the terminal device as a terminal device. Command received by the controller, the first frame is placed at the position on the board specified by the command, the position of the first frame is stored in the storage unit, and the command generated by the control unit is received. In response to the instruction, the second frame is placed at the position on the board designated by the command, and the placement means for performing the placement process of storing the position of the second frame in the storage unit, and the first frame. When the second piece is placed, the second piece on the board sandwiched by the first piece and the already placed first piece is replaced with the first piece when To the second frame and already The first frame on the board sandwiched by the arranged second frame is replaced with a second frame, and a replacement unit for executing a replacement process stored in the storage unit is provided, and the arrangement unit includes: Arranged to allow placement of a new frame only at a position that sandwiches a frame of another type with a frame of the same type that has already been arranged, or a position that is not adjacent to a frame of the same type that has already been arranged It is characterized by executing processing.

Thus, for example, by inputting a first frame placement command at a terminal device capable of communicating with the server device via the Internet, the server device can be played as an opponent.

(10) In order to execute a game in which the computer of the present invention is provided with a storage unit, the opponent places the first frame or the second frame on the board and competes for the number of frames at the end of the game. In response to the placement command of the top, the first top or the second top is placed at the position on the board specified by the instruction, and the position of the first top or the second top is placed. Is a placement process for storing in the storage unit, either a position where another type of frame is sandwiched between already-placed same-type frames, or a position which is not adjacent to an already-placed same-type frame. When the first frame is arranged, it is sandwiched between the first frame and the already-arranged first frame when the first frame is arranged, and the arrangement means for executing the arrangement process to allow the arrangement of the new frame only The second piece on the board is the first When a second piece is placed and replaced with a piece, the first piece on the board sandwiched between the second piece and the already placed second piece is replaced with the second piece and stored. It is characterized in that it is provided with a replacement means for executing the replacement processing stored in the unit, and an output means for outputting the arrangement position of the top on the board after the replacement processing is executed.

Thus, for example, by inputting a frame placement command at a terminal computer that can communicate with the computer via the Internet, the output from the computer (the placement position of the frame on the board) can be obtained. You can The computer is not limited to the case where an operator places a frame placement command from the terminal computer, but includes the case where a frame placement command generated by the terminal computer itself is obtained.

In the present invention, "first frame"
Corresponds to a black stone arranged by the operator A in the following embodiment. The “second frame” corresponds to Shiraishi arranged by the operator B in the following embodiment. In the following embodiment, the “replacement process” refers to FIG.
Corresponds to step S28 shown in. The “placement process” corresponds to step S26 shown in FIG. 5 in the following embodiment.

"Virtual opponent" means a case where the opponent is not a human but a computer (game device).

"Non-adjacent position" means (1) a position that is not adjacent in the vertical and horizontal directions,
(2) Includes both cases where the positions do not adjoin in the vertical direction, the horizontal direction, and the diagonal direction. The following embodiment is the case of the above (1), and, for example, “a position not adjacent to the already-arranged first frame” refers to the first frame on the board surface in the vertical and horizontal directions (X In the axial direction and the Y-axis direction), it means a position that is not adjacent. That is, the position diagonally adjacent to the first frame on the board corresponds to the "non-adjacent position".

The "recording medium on which the program is recorded" means
The concept includes flexible disks, CD-ROMs, hard disks, memory cards, ROMs, punch cards, tapes, and the like. In addition to a recording medium recording a program that can be directly executed by a computer, a recording medium recording a program that can be executed once it is installed in another recording medium (such as a hard disk) or encrypted or , Is a concept that includes a recording medium that records a compressed program. What is a "program"?
It is a concept that includes not only a program that can be directly executed by a CPU but also a source format program, a compressed program, an encrypted program, and the like.

[0024]

BEST MODE FOR CARRYING OUT THE INVENTION 1. Game Rules The game rules executed by the game machine of the present invention in one embodiment will be described below. Operator A and operator B, who is the opponent, are each on the board (operator A:
Black stone, operator B: white stone) are arranged alternately. At the start of the game, two black stones 21 and 22 and two white stones 41 and 42 are placed at the four corners of the board, respectively, and the following rules (a) to (c)
Accordingly, the pieces are arranged on the board. The values of the X coordinate and the Y coordinate are written above and to the left of the board, respectively. In the following description, the black stone placed at the coordinate (X, Y) is referred to as "black stone: X, Y" and the coordinate ( The white stones located in (X, Y) are referred to as "white stones: X, Y". For example, Kuroishi 2
2 is written as "Kuroishi: 6,6".

(A) As a general rule, one should not place his / her frame on a board adjacent to his / her frame. Note that the “position adjacent to one's own frame” can be arranged diagonally adjacent to each other only in a position adjacent in the X-axis direction and the Y-axis direction. However, if the opponent's piece on the board can be sandwiched between your own piece already placed and the piece you are going to place, even if it is adjacent to your already placed piece, its position Can be placed at.

For example, in the situation shown in FIG. 2A, in principle, a black stone is located at a position adjacent to "black stone: 1,1", "black stone: 3,6", "black stone: 4,3", and "black stone: 6,6". Can not be placed. However, the position where the white stone can be sandwiched,
That is, black stones can be placed at the coordinates (2,1) and the coordinates (5,6) even if they are adjacent to the already placed black stones.

(B) When the player's piece is placed on the board, if the opponent's piece is sandwiched by the piece and the piece already placed, the sandwiched opponent's piece is set as the own piece. replace. Note that not only the case of sandwiching in the X-axis direction and the Y-axis direction, but also the case of sandwiching in an oblique direction, all the sandwiched opponent's frames are replaced with their own frames.

For example, in the situation shown in FIG. 2A, when a black stone is placed at the coordinate (2,1), "white stone: 3,2" is replaced with a black stone, and the situation moves to the situation shown in FIG. 2B.

(C) When the player's own frame cannot be placed on the board, the other party places the frame. Further, when both cannot arrange the pieces, the game ends. At the end of the game, the win or loss is determined by the number of pieces arranged on the board.

2. Configuration of Game Machine FIG. 3 shows the hardware configuration of the game machine. The CPU 101 has a ROM 102, a RAM 103, and operation keys 10 via a bus line.
4, display 105, speaker 106, recording medium driver 1
07 etc. are connected. The RAM 103 has a board surface table 111 for storing layout data on the board and the above rule (a) to
A game control program 112, etc. for updating the arrangement data of the board surface table 111 is stored according to (c). The game control program 112 and the like are stored in the RAM 1 via the recording medium driver 107 from the recording medium 108.
It was installed on 03. The CPU 101 performs image processing and sound processing of the game based on the game control program 112 stored in the RAM 103 according to the operator's instruction from the operation keys 104.

FIG. 4 shows the structure of the operation keys 104 of the game machine. This includes cross button 121, A button 122, B button
123, a start button 124, a select button 125 and the like are provided. The cross button 121 is for giving a movement command of the cursor position or the like to the CPU 101 in order to determine the arrangement position of the frame. The A button 122 sends a frame placement command to the CPU 101.
To give to. That is, by operating the cross button 121 to move the cursor on the square of the coordinates (A, B) and pressing the A button 122, it is possible to give the CPU 101 a placement instruction to the coordinates (A, B). .

The start button 124 gives a start command of the game control program 112 to the CPU 101. The select button 125 is used to give the CPU 101 a command to change the environment settings such as the size of the board.

3. Operation of the game machine 3.1 At the time of start, the operator A (Kuroishi) and the operator B who is the opponent of the operator A
(Shiraishi) will explain the processing of the CPU 101 when playing by alternately using the above game machines. First, at the start of the game, the CPU 101 displays the board surface shown in FIG. Figure
FIG. 5 shows a flowchart of the CPU 101 when arranging black stones.

The CPU 101 determines that there is a position where the black stone can be placed (step S10), and prompts the operator A in front to place the black stone (step S12). Note that step S10
The routine processing of will be described later.

The operator A follows the above rule (a)
Consider the placement of black stones. That is, the position (coordinates (1,2) (2,1)) adjacent to "Kuroishi: 1,1" and "Kuroishi: 6,
The position other than the position adjacent to "6" (coordinates (5,6) (6,5)) is determined. In this embodiment, it is assumed that the placement command is given to the coordinate (3,3).

The CPU 101 receives the placement command (step S1
2) Obtain the coordinates (3,3) of the position where the black stone is to be placed (step S16). Then, from the board surface table 111 shown in FIG. 6A, it is determined whether or not a frame exists at the coordinate (3, 3) (step S18 in FIG. 5). If it is determined that the white stone is not present, it is determined based on the board surface table 111 whether or not the white stone can be sandwiched in the X, Y direction or the oblique direction (step S20). This routine process will be described later.

When the CPU 101 determines that the white stone cannot be sandwiched, it determines whether or not a black stone exists adjacent to the coordinates (3, 3) based on the board surface table shown in FIG. 6A (step in FIG. 5). S22). If it is determined that they do not exist, a black stone is placed at coordinates (3,3) (step S24). That is, the data of the board table 111 is updated, and the updated data (see FIG. 6).
A new phase is displayed on the display 105 based on (see B).

Next, the CPU 101 judges whether or not there is a position where the white stone can be arranged, and when it judges that there is a position where the white stone can be arranged, the CPU 101 arranges the white stone for the operator B. Encourage. Thereafter, white stones and black stones are alternately arranged on the board by the same processing as described above. CPU101
Displays an error if the placement command is issued at the position where the frame has already been placed (steps S18, S3
0).

3.2 Phase 1 In the case of the operator A (Kuroishi) 's turn, the case where the phase becomes as shown in FIG. 7A will be described below as an example. Operator A
Is prompted to place black stones (Fig. 5, steps S10, S1
2) Consider the placement of black stones according to the above rule (a). In the situation shown in FIG. 7A, the position where the white stone is sandwiched on the board is coordinates (3,1) (4,1) (4,3). Therefore, at such a position, or a position that is not adjacent to an already placed black stone (coordinates (4,2) (5,1) (5,2) (5,3)
It can be placed in any of (5,4) (6,2) (6,3) (6,4)). In this embodiment, it is assumed that the operator A issues a placement command to the coordinates (3,1).

The CPU 101 receives the placement command for the coordinate (3,1) (steps S14 and S16 in FIG. 5), and determines whether or not there is a frame at the coordinate (3,1) from the board surface table 111 shown in FIG. 8A. It is determined (step S18). If it is determined that the white stone is not present, it is determined based on the board surface table 111 whether or not the white stone can be sandwiched in the X, Y direction or the oblique direction (step S20). This routine process will be described with reference to FIG.

First, the direction in which the white stone exists at the position adjacent to the coordinate (3,1) is acquired (step S40). In this case, when it is determined that “Shiraishi: 3,2” exists in the Y direction (step S40), the data of the next adjacent position in the Y direction is acquired from the board surface table 111 shown in FIG. 8A. In this case, “Shiraishi: 3,3” existing at a position adjacent to “Shiraishi: 3,2” is acquired. If it is Shiraishi, the process of step S42 is performed again. Therefore, “Shiraishi: 3,4” at the next adjacent position in the Y direction is acquired from the board table 111. Further, the process of step S42 is performed to acquire "Kuroishi: 3,5" at the next adjacent position from the board surface table 111.

Therefore, it is determined that the white stone can be sandwiched (step S44 in FIG. 9), the black stone is arranged at the coordinate (3,1) (step S26 in FIG. 5), and "black stone: 3,"
Convert all Shiraishi ("Shiroishi: 3,2", "Shiraishi: 3,3", "Shiraishi: 3,4") sandwiched between 5 "into black stone (Fig. 5, step S2.
8). That is, the data of the board surface table 111 shown in FIG. 8A is updated, and the new phase shown in FIG. 7B is displayed on the display 105 based on the updated data (see FIG. 8B).

In step S42, if the next adjacent position is blank, it is determined that the white stone cannot be sandwiched (step S46), and the processing from step S22 onward in FIG. 5 is executed. For example, when trying to place a black stone at coordinates (3,1) in the situation shown in FIG. 10A,
Coordinates (3,4) are blank, and "Shiraishi: 3,2""Shiraishi: 3,
This is because the 3 ”cannot be sandwiched.

Further, in step S42, if there is no next adjacent position (no square), it is judged that the white stone cannot be sandwiched (step S46), and the step of FIG.
The processing after S22 is executed. . This is because, for example, in the situation shown in FIG. 10B, when trying to place a black stone at coordinates (3,4), "white stone: 3,5" and "white stone: 3,6" cannot be sandwiched. Is.

3.3 Phase 2 A case will be described below as an example in which the phase progresses further and the phase of operator A (Kuroishi) turns into the phase shown in FIG. 11A. When the operator A is prompted to arrange the black stone (steps S10 and S12 in FIG. 5), the operator A issues a placement command to the coordinates (5, 2), and the CPU 101 performs the same processing as above to perform the “white stone: 4, Replace "3" with black stone (Fig. 5 Steps S14 ~ S2
8). FIG. 11B shows the phase after the black stone is placed at the coordinates (5,2).

Next, it is determined whether or not there is a position where the white stone can be placed. This routine process will be described with reference to FIG. First, the CPU 101 determines, based on the board surface table 111 (not shown), whether pieces have been arranged in all the squares (step S60). If it is determined that they are not arranged, it is determined based on the board table 111 whether or not there is a position that is not adjacent to Shiraishi (step S62). Here, in the situation shown in FIG. 11B, there is no position that is not adjacent to Shiraishi. Therefore, it is determined that there is no position that is not adjacent to Shiraishi.

Further, based on the board surface table 111, it is judged whether or not there is a position where the black stone can be sandwiched (step S64). Here, in the situation shown in FIG. 11B, there is no position where the black stone can be sandwiched. Therefore, it is determined that there is no position where the black stone can be sandwiched. From the above, according to the above rule (a), it is determined that there is no position where the white stone can be placed.

In this case, the process proceeds to step S66, and it is determined whether or not there is a position which is not adjacent to the black stone (step S66). Here, in the situation shown in FIG. 11B, there is a position (coordinates (2, 2)) that is not adjacent to the black stone. Therefore, the operator A is urged to place the black stone.

3.4 Phase 3 When the phase further progresses and all the squares on the board are arranged as shown in FIG. 13, the game play is ended according to the above rule (c) (step in FIG. 12). S60).
In this case, the victory of operator B (Shiraishi) is determined by the number of pieces arranged on the board. In this embodiment, the game ends because all the pieces are arranged on the board, but the game ends even when both pieces cannot be arranged according to the above rule (a).

4. Other Examples In the above embodiment, two black stones and two white stones are arranged at each of the four corners of the board at the start of the game (see FIG. 1). However, the present invention is not limited to this, and the player may start in a state in which no pieces are arranged at all, or the four squares in the center (coordinates (3,3) (3,4)
Two black stones and two white stones may be arranged at (4,3) and (4,4)).

Further, in the above embodiment, when the player's frame is arranged, all of the opponent's frames sandwiched between the frame and the frame already arranged on the board are
I am replacing it with my frame. However, the operator may be allowed to select a frame to be replaced with his / her frame. That is, it is possible to replace only a part of the frames of the opponent sandwiched by his / her frame and selected by the operator with his / her frame.
In this case, based on the operator's intention, all of the opponent's frames sandwiched between his / her own frames may be left as they are.

Further, in the above embodiment, when one frame sandwiches the other frame in the vertical, horizontal and diagonal directions, the other frame is converted (the above rule).
(See (b)). However, in one of the vertical direction, the horizontal direction, and the diagonal direction, or in any two directions, when one frame sandwiches the other frame, the other frame may be converted.

Further, in the above embodiment, the CPU 101 determines whether or not the white stone can be sandwiched, and then determines whether or not the white stone is adjacent to the black stone (steps S20 and S2 in FIG. 5).
See 2). However, it may be determined whether or not the black stone can be arranged by determining whether or not the white stone can be sandwiched after determining whether or not the black stone is adjacent to the black stone.

Further, the above embodiment is based on the rule that "in principle, one's own frame should not be placed at a position adjacent to one's frame on the board in the X-axis direction and the Y-axis direction". (The above rule
(See (a)). However, "in principle, the X-axis direction,
You may not arrange your own frame at a position adjacent to each other in the Y-axis direction and the diagonal direction. ”

Further, in the above-mentioned embodiment, the board surface of 6 × 6 squares is described as an example. However, the present invention is not limited to this, and the height and width are 8 × 8 squares and the height and width are 10 × 10.
It may be the board of the trout. Further, the operator may be allowed to arbitrarily select the size of the board surface according to the degree of improvement in play and the like. An example of the board setting screen at this time is shown in FIG. For example, the inside of the 6 × 6 square is white, the outside of the 6 × 6 square is gray inside the 8 × 8 square, and the outside of the 8 × 8 square is inside the 10 × 10 square. By making the color green, the operator can at first glance assume the size of the frame.

Further, in the above embodiment, two operators are competing by alternately using one game machine.
However, you may compete using two game machines which can communicate mutually. Also, the opponent may be a computer.

In the above embodiment, the game control program 112 and the like are installed in the game machine from the recording medium 108 and the game machine is played. However, the game control program 112 or the like may be installed in a terminal computer from a server computer connected to the terminal computer, and the terminal computer may be used for playing.

Further, in the above embodiment, two operators are competing by alternately using one game machine.
However, a terminal device that can communicate with the server device via the Internet may be used, and the server device may be the opponent. An example of the system in this case will be described with reference to FIG. The server device 201 receives the placement command from the terminal device 202, places the black stone on the board according to the above rule, and transmits the placed board data to the terminal device 202 via the Internet. Further, the server device 201 arranges the white stones on the board according to the above rule, and transmits the arranged board data to the terminal device 202 via the Internet. Note that the terminal device 202 is not limited to receiving a command from the operator and transmitting the placement command to the server device 201, but the terminal device 202 itself transmits the placement command to the server device 201 based on a predetermined program. You may. Further, the terminal device 202 may receive an instruction from another computer and transmit an arrangement instruction to the server device 201.

Alternatively, two operators may compete with each other by using a terminal device capable of communicating with the server device via the Internet. An example of the system in this case will be described with reference to FIG. The server device 211 receives the placement command from the terminal device 212, places a black stone on the board according to the above rule, and transmits the placed board data to the terminal devices 212 and 213 via the Internet. Further, the server device 211 receives the placement command from the terminal device 213, places the white stone on the board surface according to the above rules, and transmits the board surface data after the placement to the terminal device 212 and the terminal device 213 via the Internet. . The terminal device 212 or the like is not limited to the case of receiving the instruction from the operator and transmitting the placement command to the server device 211, but the terminal device 212 or the like itself sends the placement command to the server device 211 based on a predetermined program. May be sent.

[Brief description of drawings]

FIG. 1 is a diagram showing an arrangement position of pieces on a board at the time of starting a game.

FIG. 2 is a diagram showing an arrangement position of tops on a board in a certain situation.

FIG. 3 is a diagram showing a hardware configuration of a game machine according to an embodiment.

FIG. 4 is a diagram showing a configuration of operation keys 104 of the game machine according to the embodiment.

FIG. 5 is a flowchart showing processing of the CPU 101 according to the embodiment.

FIG. 6 is a diagram showing a board surface table 111 according to an embodiment.

FIG. 7 is a diagram showing an arrangement position of tops on a board in a certain situation.

FIG. 8 is a diagram showing a board surface table 111 according to an embodiment.

FIG. 9 is a flowchart showing processing of the CPU 101 according to the embodiment.

FIG. 10 is a diagram showing an arrangement position of tops on a board in a certain situation.

FIG. 11 is a diagram showing arrangement positions of the tops on the board in a certain situation.

FIG. 12 is a flowchart showing processing of the CPU 101 according to the embodiment.

FIG. 13 is a diagram showing an arrangement position of the tops on the board in the final phase.

FIG. 14 is a diagram showing a board surface setting screen according to the embodiment.

FIG. 15 is a diagram showing a system for executing a game between a server device and a terminal device.

FIG. 16 is a diagram showing a system for executing a game between a server device and a terminal device.

FIG. 17 is a diagram showing arrangement positions of pieces on a board in a conventional Othello game (registered trademark).

[Explanation of symbols]

101-CPU 102 ・ ・ ・ ・ ・ ROM 103 ・ ・ ・ ・ ・ RAM 104 ・ ・ ・ ・ ・ Operation keys 105 ... Display 111 ・ ・ ・ ・ ・ Board surface table 112 ・ ・ ・ ・ ・ Game control program 121 ・ ・ ・ ・ ・ Cross button 122 ・ ・ ・ ・ ・ A button 201, 211 ・ ・ ・ ・ ・ Server device 202, 212, 213 ... Terminal device

Claims (11)

[Claims] 1. A display unit, an input operation unit, a control unit and a storage unit, and the opponent arranges the first frame or the second frame on the board of the display unit, and the number of frames at the end of the game. A game device for executing a game for competing for a command, which is designated by the command received by a player who is an opponent from the input operation unit or a command generated by a controller which is a virtual opponent. An arrangement means for arranging the first frame or the second frame at a position on the board surface and executing an arrangement process for storing the position of the first frame or the second frame in the storage section; When a piece was placed, the second piece on the board sandwiched by the first piece and the already placed first piece was replaced with the first piece, and the second piece was placed. When the second frame and the Replacement means for replacing the first piece on the board sandwiched by the second pieces with the second piece and executing the replacement processing stored in the storage section, wherein the arrangement means has already been arranged. The placement process is performed to allow placement of a new frame only at a position that sandwiches another type of frame with the same type of frame that is already placed, or at a position that is not adjacent to an already placed frame of the same type. A game device characterized by being. 2. A command input to a computer having a display unit, an input operation unit, a control unit and a storage unit from an input operation unit by an operator who is an opponent or an instruction generated by a control unit which is a virtual opponent. In response to this, the placement process of placing the first frame or the second frame at the position on the board specified by the command and storing the position of the first frame or the second frame in the storage unit. When the first piece is placed, the second piece on the board sandwiched between the first piece and the already placed first piece is replaced with the first piece, and the second piece is executed. When a top frame is placed, a replacement process of replacing the first top on the board sandwiched by the second top and the second top already placed with the second top and storing it in the storage unit To run A new frame is placed only at a position where another type of frame is sandwiched between the same type that has already been placed, or a position that is not adjacent to an already placed type of frame. A program to execute the placement process to allow the. 3. A recording medium on which the program according to claim 2 is recorded. 4. The game device, program or recording medium according to any one of claims 1 to 3, wherein the replacement process includes a first piece arranged on a board surface and a first piece already arranged on the board surface. When the second frame on the board is vertically, horizontally, or diagonally sandwiched by the above-mentioned frame, all of the sandwiched second frames are replaced with the first frame. thing. 5. The game device, program or recording medium according to any one of claims 1 to 3, wherein the replacement processing is a first piece arranged on a board surface and a first piece already arranged on the board surface. When the second frame on the board is sandwiched vertically, horizontally or diagonally by the frame, the second frame selected by the operator among the sandwiched second frames is Characterized by replacing with one frame. 6. The game device, program or recording medium according to any one of claims 1 to 5, wherein at the start of the game, two first frames and two second frames are arranged at four corners of the board. It is characterized by keeping it. 7. The game device, program, or recording medium according to any one of claims 1 to 6, wherein, in the placement process, a position where either one of the pieces can be placed does not exist on the board surface. The first frame and the second frame are alternately arranged on the board surface, and if there is no position on the board surface where either one of the frames can be arranged, the other piece is arranged. 8. The game device, program or recording medium according to any one of claims 1 to 7, wherein the arranging processing is performed when there is no position where the first frame and the second frame can be arranged on the board. Is characterized by ending the game play. 9. A server device, which is connected to a terminal device used by an operator via a network and has a control unit and a storage unit, and a command input by the operator who is an opponent at the terminal device. In response, the first frame is placed at the position on the board specified by the command, the position of the first frame is stored in the storage unit, and the command generated by the control unit is received. The second frame is arranged at the position on the board specified by the command, and the arrangement unit for executing the arrangement process for storing the position of the second frame in the storage unit and the first frame are arranged. In this case, the second frame on the board sandwiched by the first frame and the already arranged first frame is replaced with the first frame, and when the second frame is arranged, Second piece and already placed The first frame on the board sandwiched by the second frame is replaced with the second frame, and the replacement unit executes a replacement process to be stored in the storage unit. Placement processing is performed to allow placement of a new frame only at a position that sandwiches another type of frame with the same type of frame that is already placed, or at a position that is not adjacent to an already placed frame of the same type. A server device characterized by executing. 10. A computer having a storage unit for executing a game in which an opponent places a first piece or a second piece on the board and competes for the number of pieces at the end of the game. In response to the placement command, the first frame or the second frame is placed at the position on the board specified by the command, and the position of the first frame or the second frame is stored in the storage unit. In the placement process, a new frame is only created at a position where another type of frame is sandwiched between it and a previously placed frame of the same type, or at a position which is not adjacent to an already placed frame of the same type. Placement means for performing placement processing to allow placement, and a second piece on the board surface sandwiched between the first piece and the already placed first piece when the first piece is placed Replace the top with the first top and replace the second A replacement process for replacing the first frame on the board sandwiched between the second frame and the already arranged second frame with the second frame and storing it in the storage unit when the frame is arranged A computer comprising: a replacement unit that executes the replacement process; and an output unit that outputs an arrangement position of the frame on the board after the replacement process is executed. 11. A position at which a first piece to be arranged is narrowed by a second piece on the board surface by the first piece and the first piece already arranged on the board surface, or on the board surface. Placed on one of the positions not adjacent to the first piece already placed on the board, and by the first piece placed on the board and the first piece already placed on the board, the second piece on the board The game control method is characterized in that, when the frame is sandwiched, the computer is controlled so that the sandwiched second frame is replaced with the first frame.