JP3291055B2 - Dead stone designation method and system for computer go - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method and a system for designating a dead stone in a computer Go device incorporating Go game software, and more particularly to a terminal device of one instructor and a plurality of terminals. The present invention relates to a dead stone designating method and system suitable for a multifaceted hit Go system in which each of the terminal devices of the students is connected by a communication line and the instructor instructs the students to go.

[0002]

2. Description of the Related Art In the field of Go, an instructed Go communication system in which one instructor and one student play one to one has been provided. As is well known, when calculating formation at the end of Go, it is necessary to take dead stones and then perform the calculation. In the conventional system, as long as the dead stones are not continuous, it is necessary to specify the dead stones as many times as the number of the dead stones. Such a method or system has a problem that it takes too much time when the number of dead stones is large. In particular, in the multifaceted communication Go system provided here, since one instructor deals with a large number of students, it is important that the dead stone can be specified in a short time.

[0003]

SUMMARY OF THE INVENTION Therefore, a technical problem to be solved by the present invention is to make it possible to designate a dead stone at a final scene in a short time in a computer game device or system.

[0004]

According to the present invention, there is provided a dead stone designating method and a dead stone designating system having the following configuration.

That is, this dead stone designating method is a method of designating a dead stone in a computer Go device incorporating Go game software, and displays a white or black background on the display screen of the display means after the game . When one dead stone in one block is designated as a designated stone by the player using the input device, the coordinates of the dead stone are set as the first search coordinates .
A first step, which is stored in the coordinate storage means , and four coordinates, that is, the periphery, the left, right, up, and down, of the first search coordinate are searched, and the same stone as the first search coordinate or the blank coordinate
But second, a second step of temporarily stored in the coordinate storage means as a third ... search coordinates are temporarily stored in the second step
The second, third,... Search coordinates are the same as in the second step.
Are sequentially repeated until the Nth search coordinate is reached.
The third step temporarily stored in the coordinate storage means without performing
And for each search coordinate in order from 1 to N
1 Whether the stone is the same as the search coordinate stone or blank coordinates
In the four steps determined by the CPU and the fourth step
If the result of the discrimination is the same stone coordinates,
At the same stone coordinates are marked dead stones,
And a fifth step in which the dead stone coordinates are stored in the marker storage means .

[0006] A system (apparatus) for implementing the dead stone specifying method has the following configuration.

That is, a computer Go dead stone designating system for designating a dead stone in a computer Go device incorporating Go game software, wherein a display screen of a display means after a game displays a first search coordinate Week
Search for each of the four coordinates:
The coordinates of the same stone or blank as the stone of the first search coordinates are the second,
Second means for executing <br/> second step is temporarily stored in the coordinate storage means as a third ... search coordinates, one second step
.. Are stored in the second, third,.
The same processing is repeated in sequence until the Nth search coordinates are reached.
Is temporarily stored in the coordinate storage means without duplication.
Third means for performing a third step that, each search coordinate Nitsu
In the order from the first to the Nth, the same stone as the stone at the first search coordinates
A fourth means for executing four steps in which the CPU determines whether or not there is a blank coordinate or a blank coordinate ;
If another result is the same stone coordinate, the result is displayed on the screen of the display means.
A dead stone mark is attached to the same stone coordinates of
And a fifth means for executing a fifth step in which the dead stone coordinates are stored in the storage means.

In the dead stone designating method and system having the above-described configuration, only the designated stone is designated by the hitter, but the subsequent steps are executed in accordance with the instructions of the Go game software installed in the computer. In other words, the player can specify all the dead stones in one block by specifying only one coordinate for the dead stone in one block,
That is, it is possible to add a dead stone mark for screen display and to store dead stone coordinates in a coordinate storage unit in the apparatus. Therefore, the dead stone designation is performed in a short time, and the intended technical problem of the present invention is achieved.

[0009]

An embodiment of the present invention will be described below in detail. In this embodiment, a case of a multi-sided Go communication system is described as an example.

[0010] Fig. 1 shows that a professional Hoshikawa, or instructor, in Kochi, uses a telephone line to train a plurality of students from all over Japan, namely Sumita in Sapporo, Ishihara in Tokyo, Okano in Osaka, and Nakatani in Kyushu. , And Ushida in Okinawa.

FIG. 2 shows the communication system of FIG. 1 in more detail. Student terminal devices 2a and 2b are installed at the homes of the students, respectively. On the other hand, an instructor terminal 1 is installed at the instructor's home. The terminal devices 2a and 2b of each student and the terminal device 1 of the instructor are connected via the exchanges of each telephone exchange and the relay device 3 of the relay center. In this embodiment, this relay center is located in Takamatsu, Shikoku. Taking the connection between Sumita-san in Sapporo and each terminal device of Hoshikawa Pro as an example, first, outgoing data transmitted from student terminal 2a in Sapporo-san will be sent to the nearest telephone exchange 4a via a telephone line. It is transmitted and transferred from the exchange 4a to the Sapporo packet exchange 4b. Then, the packet is transmitted from the Sapporo packet exchange 4b to the Takamatsu packet exchange 4d via the Osaka packet exchange by packet communication. Up to the Takamatsu packet exchange 4d, the transmission data from the terminals 2a and 2b of each student are transmitted in parallel with each other. And
The packet is transmitted from the Takamatsu packet exchange 4d to the relay device 3 of the relay center through the digital communication line dedicated for packet communication. The relay device 3 sequentially stores communication data from each student and sequentially transmits the communication data to the Kochi packet exchange 4e by packet communication. Then, the packet is transmitted from the Kochi packet exchange 4e to the nearest telephone exchange 4f at the instructor's home, and transmitted from the telephone exchange 4f to the terminal 1 of the instructor.

FIG. 3 shows the instructor terminal device 1.
The terminal device 1 is usually composed of a personal computer, and is preferably composed of a laptop personal computer so that the instructor can easily carry it. As is clear from FIG. 3, 10 is a CPU, and 11 is
A converter 12 for converting a serial signal from a serial communication input / output terminal into an 8-bit parallel signal is connected to the Moshler jack 13 on the one hand and the converter 1 on the other hand.
1 is connected to the modem. Reference numeral 14 denotes a ROM storing a start-up program and the like, and 15 denotes a RAM, which also includes a VRAM (video RAM). 16 is a kanji ROM for kanji conversion for outputting kanji, 17 is a display control device, and 18 is a display device for displaying data in accordance with a signal from the display control device 17. Reference numeral 19 denotes an external storage device.
It is transferred to AM15. Reference numeral 20 denotes a printer interface connected to a printer output terminal, 21 denotes a power supply, 22 denotes an input device for hitting stone data and the like, 23 denotes a sound generating circuit for generating a special sound, and 24 denotes a speaker connected to the circuit 23. It is.

FIG. 4 shows the RAM 15 and the like in the terminal device 1 in detail. The RAM 15 stores student-specific data storage areas 15a, 15b,.
15n, a commentary registration area 15z that is pre-formatted so that the instructor can send a special comment to the student.
And a video RAM area 15x. The data storage areas 15a, 15b,..., 15n for each participant store the hitting stone coordinate data of each student, the hitting stone coordinate data of the instructor, and personal information data such as the grouping of the students, the name of the students, and the playing power 15a-1, an area 15a-3 for storing graphic data obtained by converting hitting stone coordinate data and the like, and storing whether or not there is a stone on the go board, and determining a prohibited hand, agehama, ko, etc. Is performed, a working RAM area 15a-2 is included. Conversion to graphic data is executed by a conversion program described later. The graphic data in the storage area for each student is transferred at high speed to the VRAM area 15x according to the steps of the program described later. VR
The video data in the AM area 15x is displayed on the display device 18 via the display control device 17 in accordance with the steps of a program described later.

FIG. 5 shows the main body of the terminal device of each student. As shown in FIG. 2, each of the student terminal devices 2a and 2b has a terminal CRT, a printer,
A telephone circuit and an input device are connected and configured.

In the terminal device main body, 30 is a ROM for storing a predetermined program and the like, 31 is a RAM for storing transmission data such as hitting stone data from the instructor and input data such as hitting stones of the student himself, 32 is a kanji ROM, 33 is a non-volatile ROM for storing current and past game records, 3
4 is a display control device, 35 is a VRAM, and 37 is a CPU. 38 is a remote control light receiving device for receiving an infrared signal when the input device 49 is an infrared remote control device;
50 is a changeover switch for switching between a mouse as an input device and a remote control device, 44 is a modular jack, 43
Is a detection circuit for detecting whether the telephone is in use, 42
Is a modem, and 46 is a switch for switching between the telephone and the modem. 45 is a telephone / serial switch for switching the connection of the modem 42 or the serial communication terminal to the CPU 37; 41 is a dial / pushphone generation circuit connected between the CPU 37 and the modem 42; 36 is connected between the CPU 37 and the modem 42 It is a sound control circuit to be performed. Input data from a mouse as input means is transmitted to the display control device 34.
Is input to The sound control circuit 36 is connected to a sound input terminal of a television speaker. The display control device is connected to a video signal conversion circuit 39, and this circuit 39
Terminal, S-video terminal or composite terminal. These terminals are connected to a CRT 47 as a display device. A printer interface 40 is connected to a printer terminal of the printer 48.

FIGS. 6 and 7 show a go board, a struck black stone, a white stone, and a cursor appearing on the screen of the display device of the terminal 1 of the instructor. FIGS. 8 (I) and (II) show a flowchart of a reception program when the transmission data of the student is received by the terminal of the instructor and data stored in the RAM of the terminal 1. The flowchart of the receiving program will be described in detail below. This receiving program is also stored in the student's terminal device. Step S
₇ and S ₈ are not leaders terminal device be one that is only the program of the student-side terminal device.

The outgoing data of the student are distribution processing in step S _1. As described above, the RAM 15 of the terminal 1 has a data storage area for each student. Therefore, it is necessary to classify outgoing data of each student transmitted in random order by packet communication and store the data in the data storage area of the relevant student. This process is the distribution process in step S _1. In the data storage area for each student in the RAM 15, first, personal information transmitted from each student is stored. This personal information includes the name of the other party, ie, the name of the student, the player's chess strength, the cost, ie, the number of child stations, and the presence / absence of commentary. Next, the coordinate data of the struck black stone (the student usually has the black stone) sequentially transmitted by the student is sequentially stored. As shown in FIG. 8 (II), the data storage area also stores the instructor's hit stone, that is, the coordinate data of Shiraishi.

[0018] Then, in step S _2, conversion of the received coordinates of the die stone data of the student is performed. FIG. 7 (II)
(a) shows the game state displayed on the display device. As shown in (a), the instructor and the student are playing each other, and thus the position of the go board is 180 ° different depending on the players. Therefore, in order to reproduce the state in which both the instructor and the student are hitting the actual go board, the screen of the instructor and the screen of the student are set to 180 ° as shown in (b) and (c). It is converting. Therefore, the coordinate data of the struck stone sent from the student is (X = 20−X,
It is necessary to perform coordinate conversion using the calculation formula of Y = 20−Y).

[0019] Then, striking stone procedure in step S ₃ (hitting stones coordinates X _1, which is the coordinate _{transformation, Y 1; X 3, Y} 3) is sequentially stored.

[0020] Then, if the Agehama is caused by the latest hit stone Students Agehama process is performed in step S _4. FIG. 6 (II) shows this Agehama treatment and struck stone. (a) shows a state before the start of Shiraishi, that is, a state in which the struck stone is blank, and (b) shows a state after the start of placing the Shiraishi. Now, black stone is struck around the white stone shown in (b), and when this white stone becomes Agehama, it returns to the state of (a). In other words, the white stones that become age hama on the display screen are erased. Of course, the premise is that the coordinate data and graphic data of the shiraishi which will be the age stored in the RAM 15 are erased.

[0021] Then, in step S _5, black stones that are hit stones are stored in the graphic data area of the RAM is immediately converted from the coordinate data on striking stone graphic data.

[0022] Then, in step S _6, the update of the latest embarked point of black stone is performed. Since the present communication system enables multi-faceted hitting, the game screen of the terminal of the instructor is sequentially switched, and the game screens of different students who have been hit are displayed. In this case, if all the black stones hit by each student are displayed in the same manner, it cannot be instantaneously determined which stone is the last hit stone. Therefore, in the present embodiment, as shown in FIG. 6 (III), when the final struck stone is a solid-painted pattern other than the last struck stone, the center of the stone is marked with a star to represent it. I have. Therefore, even when the game screen is switched, the leader can identify the latest Kuroishi starting point by paying attention to the star-marked stone, and can instantly remember the progress of the game record. In the present system, since this is done, it is necessary to update the latest starting point every time a black stone is hit. FIG. 9 shows a subroutine for updating the latest starting point. In FIG. 9, (I) shows the subroutine, and (II) shows the procedure storage area in the RAM. Now, let the latest black stone be the nth stone. When the n-th black stone is hit, at step _S61 , the coordinates of the (n-2) th hit stone are changed to graphic data other than the final hit stone. Next, in step _S62 , the graphic data of the n-th movement is changed to a final starting point display, that is, a display with an asterisk shown in FIG. 6 (III).

[0023] Referring back to FIG. 8 again, in the leader's terminal, the next step S _6, the process proceeds to step S _9.
In step S _9, the screen switching request is made. That is, it is requested that the screen on the instructor's display device be switched to the screen of the trainee who has already hit the stone. Reception Flowchart This step S ₉ is completed.

On the other hand, in the student terminal, steps S ₇ and S ₈ are executed. In step S _7, a buzzer sound indicating that the striking stone Shiraishi has been finished is generated. Then, in step S _8, the position control of a cursor arrow shape shown in FIG. 6 (I) is carried out. This cursor control subroutine is shown in FIG. (I) shows the subroutine, and (II) is an auxiliary drawing for explaining the subroutine.

In step _S81 , it is determined whether or not the instructor has hit a stone. And while the leader is not carried out striking stone proceeds to step S _82. In step _S82 , the cursor is moved and displayed according to the change amount of the input device. That is, the operation state of the input device always matches the movement state of the cursor. On the other hand, when the striking stone leader is performed in step S _81, the conversion of the graphic coordinates of the cursor (Gx, Gy) is performed. The conversion formula is Gx
= X + XDOT (X-1), Gy = y + YDOT (Y-1).
That is, the graphic coordinates are represented by the number of dots on the x-axis and the y-axis. In the above equation, XDOT indicates the number of dots on the grid in the x-axis direction. YDOT is y
One dot and the number in the axial direction are shown. Coordinates on the go board
The graphic coordinates of (X, Y) = (1, 1) are represented by (x, y). Now, as shown in (II), the latest shiraishi coordinates (X, Y =
4,3), the graphic coordinates of the cursor
(Gx, Gy) coincides with the coordinates of the white stone.

Next, in step _S84 , the cursor is instantaneously moved to the position of Gx, Gy. In this state,
When the student operates the input device, the cursor moves from the position shown in the figure again according to the operation. Normally,
Since the player often hits the next stone near the opponent's hit stone, the amount of movement of the cursor is small.

Returning to FIG. 8 (I), the instructor-side terminal returns to step S ₉ after step S ₆ is completed.
Is requested to switch the screen.

Next, a description will be given of a flowchart (FIG. 11) of a program at the time of transmitting the instructor's hit stone data and the like.
The flowchart of FIG. 11 is basically the same as the flowchart of the transmission program of the student terminal. However, ※ sign of step _{S 98, S 99, S 100} , S 109, S 111, S
₁₁₂ is not on the student side. First, aspects in step S ₉₈ whether it is the ultimate is determined. If the ultimate program proceeds to step S _100, the ultimate process is performed in step S ₉₉ if not ultimate. In step S _100, the process of "waited" is made. This waiting process is performed when the instructor determines that the student's striking stone is very bad and must immediately terminate the student. This is a process for sending a message to the student to allow "waiting" and for the student to respond to this message. The details of the waiting process are shown in the subroutine of FIG. FIG.
2 (I) shows the subroutine, and (II) shows details of a procedure storage area of the RAM 15 as an auxiliary drawing for explaining the subroutine.

Now, suppose that the student has performed the n-th hitting stone. In step S _121, leaders determination for as soon as the other party stone corresponds to stone "waited", if it is determined that the determination does not correspond to "awaiting a", the flow goes to step S ₁₀₁ in FIG. 11. On the other hand, if it is determined that the user has waited, in step _S122 , the instructor transmits a "reconsideration" message to the student.

[0030] Then, the student sends leaders whether the answer to rethink in step S _123, students are to deny "waited", the flow proceeds to step S ₁₀₁ in FIG. 11. On the other hand, if the other party understands, that is, "waits", the coordinates of the pointer in the procedure storage area of the RAM are deleted in step _S124 , and (pointer-1)
Is a pointer. Then, in step S _125, if already Agehama processing is performed Agehama return process for returning the Agehama process based on is performed. Upon completion of this step, the flow proceeds to step _S111 in FIG.

[0031] If Referring back to FIG. 11 again, after the processing of step S ₁₀₀ is performed, leaders, step S ₁₀₁
In, start the striking stone. FIG. 13 shows a subroutine of this start. This subroutine is based on the premise that the input devices on the instructor side and the student side have the configuration shown in FIG. In FIG. 14, reference numeral 61 denotes a button for selecting a temporary mode or a menu mode displayed on the display device. Reference numeral 62 denotes a button for confirming the struck stone. Reference numeral 63 denotes four cursor movement buttons for moving the cursor.

First, in step _S126 , it is determined whether or not the student has requested commentary. At this time, if "explanation request" is stored as personal information data of each student (see FIG. 8II), the program proceeds to step
Proceeds to _124, the process proceeds to step S ₁₃₁ otherwise.
In step ₁₂₇ , the instructor determines whether or not the hand undertaken by the student needs commentary. If the commentary is necessary, the instructor selects a commentary term in step _S128 .

The explanation term is, as described above, the RAM 15
Is coded and stored in the comment sentence registration data area. The details are shown in FIG. Here, for example, as shown in FIG. 23, if “bad” is selected for the 76th black hand, in the next step _S129 , the explanation code “4” is set to the coordinate data of the 76th black hand. Is stored in the explanation code area. At this time, the commentary code "4" is also recorded in the transmission area. This commentary code is transmitted to the student together with the next hitting stone of the instructor, that is, hitting data of the stone 77 from the transmission area together with the hitting stone (step _S110 ).

From step _S131 , the instructor starts the actual next stone. In step _S131 , the instructor operates the cursor movement button 63 to move Shiroishi to the starting point. If the button 63 is pressed down, step _S145
And the cursor moves. When this move is complete,
The program moves from step _S131 to step _S132 . Next, the hitting / selection button 61 is depressed.
Then, in step _S132, it is determined whether or not the hit stone / selection button 61 has been pressed. If the button has been pressed, the process proceeds to step _S133 .
In step _S133 , it is determined whether there is already a stone at the starting point. When the started point of novel features, the process proceeds to the next step S _134. On the other hand, if there is already stone started point, the process proceeds to step S _140, a buzzer sound as a warning is made to occur. In step _S134 , it is determined whether the starting point has already been provisionally struck. If not, that is, if it is a new tacking, a tacking mark is displayed on the screen in the next step _S135 , the tacking coordinates are stored in the RAM, and the timer is started. Then the program returns. FIG. 7 shows an example of the provisional mark. The square mark shown in FIG. 7 (I) is a provisional mark.

In step _S134 , if it is determined that the temporary tapping has already been performed, that is, if it is determined that the current temporary tapping is the second temporary _tapping , the process proceeds to the next step _S142 . In step _S142 , it is determined whether or not the second time, that is, the current tacking is the same as the previous tacking coordinates. If they are the same, the process proceeds to the next step _S143 , where the temporary display is erased, the temporary storage information is erased, and the timer is terminated. That is, the flow of steps S ₁₃₄ , S ₁₄₂ , and S ₁₄₃ is a step for canceling the first temporary hit.

If it is determined in step _S142 that the current tacking is different from the previous tacking coordinates, the process proceeds to step _S144 to erase the previous tacking display and
The temporary mark is displayed and the timer is restarted, and the process returns to step _S132 . That flow of steps S _134, S _142, S ₁₄₄ is a step of performing again the temporary out.

If it is determined in step _S132 that the hit stone / selection button has not yet been depressed, the process returns from step _S143 or _S144 and returns to step S132.
If _{the 132} decision is made, the process proceeds to step S _136.
In step _S136 , it is determined whether the confirm button has been pressed. If this confirmation button has not yet been depressed, the process proceeds to step S _137, whether it is in the timer operation in step S ₁₃₇ is determined. If the timer is not operating, the process returns to step _S132 .

The process proceeds to the next step S ₁₃₈ if the timer is determined to be in operation in step S _137, until the timer has completed step S _132, S _136, S
The cycles of ₁₃₇ and _S138 are repeated. And step S
If it is determined in ₁₃₈ that the timer has been completed, that is, if it is determined that the predetermined holding time has elapsed, the process proceeds to step _S141 , and the temporary hit mark is forcibly changed to goishi display.

[0039] In step S _136, when the confirmation button is determined to have been depressed, the process proceeds to step S _139, in step S _139, whether done so temporarily beating is determined. If the temporary strike already, the process proceeds to step S _141. On the other hand, if the temporary beating has not yet been performed, step S ₁₄₀
, And a buzzer sound for urging a temporary beating is issued.
However, a mouse may be used as the input device on the instructor side.

Returning to FIG. 11, the description will be continued. Step S
_When the start of step ₁₀₁ is completed, it is determined in the next step _S102 whether or not the struck stone started is a prohibited move. And if this is a prohibited hand, the process proceeds to step S _104, and a buzzer sound is made to occur to indicate that a prohibition hand returns to step S _101. The leader recognizes the wrong start by the buzzer sound and starts again. If it is not a prohibited move, it is determined in the next step _S103 whether the start is a ko. If a term, as in the case of prohibiting the hand proceeds to step S _104. Then, if not Kou whether Agehama by undertake occurs is determined in step S _105. And if there is Agehama is the Agehama process is performed in step S _106. This Agehama processing has already been described in the flowchart of FIG.

The process proceeds to the next step S ₁₀₇ if made Agehama processing in step S _106. Step S
Even when there is no Agehama at _105, the process proceeds to step S _107. In step _S107 , the procedure started is RA
It is stored in M15. In this case, this procedure is performed in the RAM 15
Is stored not only in the start / procedure storage area but also in the transmission area. Then, in the next step _S108 , the coordinate data stored in step _S107 is converted into graphic data. Then, the graphic data is fast forwarded to Biteo RAM at the next step S _109. Then, in the next step _S110 , the starting coordinates of the instructor and the commentary code, that is, the data stored in the transmission area of the RAM 15, are transmitted to the student, and the next screen is displayed on the screen of the display device of the instructor terminal. A display indicating that it is the turn of the other party, that is, the turn of the student, in other words, a display indicating that the striking stone of the instructor has ended is displayed. The transmitted striking stone data and explanation code are received by the student terminal,
It is stored in both the AM 31 and the ROM 33. This commentary code is converted into text and displayed in a message area of the screen display means of the terminal. This commentary is also displayed when a past game record is read from the ROM 33 and reproduced.

[0042] After step S _110, in step S _111, the screen switching request from each student, namely,
Screen switching request in step S ₉ in FIG. 8 (I), a determination is made whether or not there. Then, the process proceeds to step S ₁₁₂ if the screen switching request has been made, the oldest of the recipient, that is the earliest graphic data palliative time longest student screen switching request has been made to achieve high speed transfer to the video RAM It is done. Also, video R
The attendee's aspect is displayed on the display device according to the video data of the AM. Then, in the next step _S113 , a start buzzer sound is generated to indicate that the start of the student has already been completed. Next, in the next step _S114 , the cursor control described with reference to FIG. 10 is performed, and thereafter, the process returns to the original position.

[0043] Now, the ultimate processing at step S _99, it will be described in detail with reference to FIG. 27 showing the subroutine.

As a final post-processing, only when the student desires "commentary", the instructor determines in step S whether or not it is better to show the change diagram of the exemplary instructed Go to the student.
Determined at _210, while the jumps to step S ₂₁₇ when determining that no need shown, when it is determined that there is need to show, the process proceeds to step S _211. In step S ₂₁₁ , a mark is displayed only on the hit stone data in the starting / procedure storage area of the ROM 15 to which the explanation code is added. This mark is preferably the color of the hitting stone itself and different from the normal hitting stone color (black). For example, in the explanation text, the striking stone with the commentary code of praise words such as "I am good at it" or "I'm wearing it properly" is displayed in light blue, while guidance such as "I'm bad" or "I'm missing" The striking stone to which the commentary code of the word is added is displayed in red. In this way, the instructor can instantly remember past developments. The instructor proceeds to the next step S
_{At 212} , the coordinates of a specific struck stone, such as a bad hand, are specified on the screen. This particular striking stone means that the instructor will show an exemplary instructor's go for subsequent developments.

Now, in FIG. 24 showing the final screen (FIG.
In FIG. 4, the hand after 100 is omitted for the sake of simplicity of the figure), and the 76th black hand (12
6) If the user wants to create a diagram of the change of the exemplary teaching go, specify the 76th move of black. When this designation is made, in step _S213 , all the struck stones after the 76th black are erased from the screen (the erased screen is shown in FIG. 25). The instructor then changes the black 1 in FIG.
Hits 3-3 (black 76). Then, as shown in FIG. 26, a change diagram is created by hitting black and white alternately with examples of good hands up to white 77, black 78, white 79... Black 82. The instructor decides how many hands to make, and the step S
₂₁₄ and _S215 are repeated. The procedure of the change diagram is stored in a change diagram procedure storage area in the start / procedure storage area of the RAM 15 as shown in FIG.

If the instructor determines in step _S215 that the creation of the change diagram has been completed, the process proceeds to step _S215 .
_{At 216} , the display of the go stones constituting the change diagram is deleted from the display screen, and the original game record, that is, the game record of FIG. 24 is reproduced on the screen. Then, in step S _217, cough designation to be described later, Damedzume death stone specification, after the ultimate treatment of such formation calculations, in step S _218, was changed view data and finally disposed stored in RAM15 The game result (the calculation result of the black background and the white background and the result of the win / loss) are transmitted to the student.

The process from the start of the game to the end is performed according to the above-mentioned program. At the end of the game, the following procedure is generally required conventionally. That is,
When the phase is over, (1) care, (2) no damage, (3) Seki designation or dead stone designation, (4) and finally formation calculation,
Is performed. In the present embodiment, with respect to the designation of the seki, the designation of the dead stone, and the formation calculation, a device is devised to minimize the transmission signal. These are described in detail below.

(1. Designation of Seki) First, the program of designation of Seki will be described. It should be noted that the program designated by sex is set in both the terminal of the instructor and the terminal of the student. In other words, the seki designation itself is performed on the instructor side, and after the end, the consent of the other party, that is, the student is requested. However, it is also possible to determine the sex designation only by the judgment of the leader.

Conventionally, when the formation is calculated at the end of the Go, since Seki is neither of the lands, it is necessary to devise not to calculate as a terra. According to the conventional method, when a blank part constituting a seki is filled with a go stone to fill the part, or when a seki designation is performed, there are several sekis, so it is necessary to specify a plurality of blank parts of each seki. There was. According to the method according to the present embodiment, it is possible to automatically designate all of the blocks only by specifying a stone at one coordinate.

FIG. 15 illustrates the seki. (I) shows blocks A ₁ , A ₂ , and A ₃ of one block surrounded by a broken line.
(II) shows a state in which the sex marks are displayed at the locations of the sexes A ₁ , A ₂ , and A ₃ . (III) is a diagram illustrating a method of designating a sex. This will be described in detail with reference to (III) and the flow charts of FIG. 16 and FIG.

In [0051] First, in step S _0.99 either black or white non-blank in dashed stone, that specifies the black or white either a stone constitutes a cough with which the first Search stone. At the same time, the coordinates of the designated stone are set as search coordinates (first search coordinates). In this embodiment, the white stone a, that is, the white stone a whose coordinates (X, Y) are (6, 2) is set as the designated stone, that is, the first search stone. Then
In step _S151 , a search is made for a stone around the coordinates of the search stone a. That is, the right of the search stone coordinates in the figure,
It is determined whether the four surrounding stones are the same stone as the search stone, the blank, or the opponent stone, that is, the black stone, or the edge of the board. Then, only when the surrounding stone is blank or the same stone, the blank coordinates and the same stone coordinates are temporarily stored and the searched-out processing is performed. In the present embodiment, the right white stone (7, 2), the left white stone (5, 2), and the upper blank coordinates (6.1) are temporarily stored.

Next, in the next step _S153 , it is determined whether the stone at the first search coordinates is blank. If it is blank, the process proceeds to step _S156 ; otherwise, the process proceeds to step _S154 . In step _S154 , it is determined whether or not the first-stage selection has been completed.
In other words, in the Seki specification procedure, the first specified stone is used as the first search stone, and the stones surrounding the stone are searched for.
Only when the stone is the same stone or blank, the same stones or blanks around those stones are second, third,.
... The search is repeatedly performed sequentially as the Nth search stone or the search coordinates. Therefore, the process proceeds to step _S155 while all searches for the temporarily stored stone or blank are not completed. In step _S155 , the temporarily stored coordinates of the stone are sequentially set as new search coordinates, that is, second, third,..., I.
Returning to ₁₅₁ , the process is continued until the first-stage setting is completed. In step _S151 , the searched coordinates are skipped in the second and subsequent searches because the searched coordinates are already processed. In other words, of course
Therefore, duplicate search is avoided. Otherwise, the program
Will not end. Now for example, if it is the i-th search coordinate position or a blank coordinates when a position or space coordinates of cough A ₁ (6,1) or coughing A ₂ (3,1), in step S _153, blank it is determined to be, in the next step S _156, whether Sekimaku its blank is already assigned is determined. Then, in the case where the cut mark has not been added yet, the blank portion is displayed as a cut, that is, the square mark shown in FIG. 15 (II) is displayed, and the blank code stored in the RAM is changed to the cut code. Proceed to the next step _S159 . If Sekimaku is determined to have already been assigned in step S ₁₅₆ proceeds to step S _158,
Changing the Sekikodo blank code with changing the Seki display blank in the step S _158. Step S
_The flow up to ₁₅₈ means a flow of canceling the sex mark when the sex mark is mistakenly attached. When the search stone is blank also stone around the search coordinates in step S ₁₅₁ as in step S ₁₅₉ (6,1) is whether a stone than or partner ore with whom stones Search・ It will be judged. If it is determined that the stone is a partner stone, that is, a black stone, the coordinates of one partner stone, that is, the coordinates of the black stone, are set as the next second stage search coordinates. _Upon completion of the process in the step _S159, the process proceeds to a step _S154 . That is, the stone around the blank coordinate b, that is, the white stone at the coordinates (4,1), the black stone at the coordinates (3,2) and the black stone at the coordinates (2,1) have the coordinates (3,2) of the step. In _S160 , the next search coordinate, that is, the second designated stone is designated. And step S
_{From 161} the second stage search starts. That is, in step _S161 , the partner stone, that is, the black stone at the coordinates (3, 2) is the second stone.
It is designated as the first search stone of the stage, and its coordinates (3, 2) are used as search coordinates. Next, the program from step _S162 is executed. Step _S162 to Step S
₁₆₉ is substantially identical to step S ₁₅₁ to S ₁₅₈ described above. However, in the search for the second stage, the step corresponding to step S ₁₅₉ are unnecessary. Is the is Sekimaku the remaining weir A ₃ are attached in this manner.
These sex marks displayed on the instructor terminal are also transmitted to the student terminal. The data sent to the student is the first designated stone (first searched stone) for each block.
Only. Since the student terminal device also has a program similar to that of the instructor terminal, the same mark is reproduced and displayed on the student display device. However, the designation of the first designated stone cannot be performed by the student. The procedure for designating the sex described above will be described more specifically with reference to the embodiment of FIG. (First stage) When the program for designating seki is designated by designating the first designated stone a: 1: The first designated stone a is set to the first search coordinates (6, 2). 2: Shiraishi (5,2), (7, around the coordinates of the first search coordinates (6,2)
2) is temporarily stored as the same stone coordinates, and the coordinates A1 (6, 1) are temporarily stored as blank coordinates. 3: The coordinates (5,2) are temporarily stored as the second search coordinates from the temporary storage coordinates, and the white stone (5,1) around the coordinates is temporarily stored as the same stone coordinates. 4: The coordinates (7, 2) are temporarily stored as the third search coordinates from the temporary storage coordinates, and the white stone (7, 1) around the coordinates is stored as the same search coordinates. 5: The coordinates A1 (6,1) are set as the fourth search coordinates from the temporarily stored coordinates, and the blank space is changed to a blank display, and the blank coordinates are changed to a blank code. In this case, the second designated stone is not stored because there is no opponent stone (black stone) around the coordinates. 6: The coordinates (5,1) are temporarily stored as the fifth search coordinates from the temporary storage coordinates, and the white stone (4,1) around the coordinates is temporarily stored as the same search coordinates. 7: Coordinates (7,1) are searched from the temporary storage coordinates as sixth search coordinates, and coordinates around the coordinates are searched. However, there are no coordinates temporarily stored around the coordinates. 8: Coordinates (4, 1) are set as seventh search coordinates in the temporary storage coordinates, and coordinates around the coordinates are searched, and the coordinates A2
(3,1) is temporarily stored as blank coordinates. 9: From the temporarily stored coordinates, the coordinates A2 (3,1) are used as the eighth search coordinates, and the blank is changed to the blank display, and the blank coordinates are changed to the safe code. Then, the partner stone (3, 2) around the coordinates is stored as the second designated stone. (Second stage) 10: The second designated stone is set as the first search coordinates (3, 2). 11: The black stones (2,2) and (4,2) around the first search coordinates (3,2) are temporarily stored as counter stones. 12: The coordinates (2, 2) are temporarily stored as the second search coordinates from the temporary storage coordinates, and the black stones (1, 2), (2, 1) around the coordinates are temporarily stored as the same stone coordinates. 13: the coordinates (4,2) out of the temporary storage coordinates in the third search coordinates <br/>, retrieves the coordinates around it. However, there are no coordinates temporarily stored around the coordinates. 14: The coordinates (1, 2) are set as the fourth search coordinates from the temporary storage coordinates, and coordinates around the coordinates are searched, and the coordinates A3 (1, 1) are obtained.
Is temporarily stored as blank coordinates. 15: The coordinates around the coordinates (2, 1) are searched from the temporary storage coordinates as the fifth search coordinates. However, there are no coordinates temporarily stored around the coordinates. 16: A3 (1,1) is searched as the sixth search coordinate from the temporary storage coordinates, and the blank is changed to the display and the space coordinates are changed to the search code. Since there are no coordinates to be temporarily stored around the coordinates and no temporary storage coordinates for the black stone and the blank, the specification of the block is ended.

According to the Seki designation based on the above steps,
By specifying one stone a, three blocks A ₁ , A ₂ and A ₃ of one block can be specified instantly.

(2. Dead Stone Designation) Next, dead stone designation will be described in detail. Generally, when calculating formation at the end of Go, it is necessary to pick up dead stones and then perform the calculation. In the conventional designation method, it was necessary to designate dead stones one by one. Further, when dead stone data is transmitted using a telephone line, there has been a problem that transmission time is long since all dead stone data is conventionally transmitted. The dead stone designation method according to the present embodiment utilizes the point that dead stones in one block of a white or black background surrounded by the opponent stone or the edge of the go board are always connected by blanks or dead stones. It is characterized in that all dead stones can be specified only by specifying one coordinate.

FIG. 18 (I) shows blocks a, b, c, d, and e for a total of 5 blocks.
This shows a state in which dead stones with crosses are marked on dead stones in two blocks, and (II) shows a state in which all dead stones are erased. FIG. 19 shows a flowchart of the dead stone designation. The dead stone designation method will be described according to the dead stone designation flowchart. The dead stone designation program is also stored in both the instructor and the trainee terminals, or the dead stone designation itself is performed by the instructor.

[0056] First, in step S _180, to the designated stone and the first search coordinate specifying one death stone in place of one block. In this embodiment, one dead stone f in the block d is assumed to be a designated stone. Then, in the next step _S181 , a search is made for the search coordinates, that is, the lower right and upper left stones around the dead stone f, and it is determined whether the stone is a partner stone, that is, a white stone, or a blank or the same stone, that is, a black stone. The coordinates and the same stone coordinates are temporarily stored, and at the same time, the searched process is performed. Therefore, the coordinates of the designated stone f are (1
0,16), the coordinates (10,1)
The three coordinates of (7), (9, 16) and (10, 15) are temporarily stored.

In the next step _S183 , it is determined whether or not the stone at the search coordinates has already been designated as a dead stone. If it is determined that the dead stone mark is not attached, the process proceeds to the next step _S184 , where the dead stone mark is displayed and the dead stone coordinates are stored, and the process proceeds to the next step _S185 . . In the present embodiment, first, the designated dead stone f is marked with an x mark, that is, a dead stone mark. On the other hand the process proceeds to step S ₁₈₇ if it is determined that the death stone marks granted in step S _183, death stone mark in said step is erased memory death stone coordinate with are removed. The flow up to step _S187 shows a flow in which, when a dead stone mark is first added by mistake, this is canceled. When the process in step _S187 ends, the process proceeds to step _S185 . Further, if it is determined in step _S183 that the search coordinates are blank, the process directly proceeds to step S183.
_Continue to ₁₈₅ . In step _S185 , it is determined whether the search in one block has been completed. That is,
In step _S181 , it is determined whether the search for the next candidate search stone temporarily stored has been completed.
In step S _185, if it is not finished, step S
Proceeds to _186, and set one of the coordinates that has been temporarily stored in the new search coordinates repeat the above flow returns to step S _181. By repeating this flow, all areas in the white stone area surrounding the dead stone in block d including the dead stone f are searched, and all the dead stones in that area are marked with x. Become. That is, the temporarily stored coordinates are sequentially and repeatedly used as the second, third,..., I. And block d
If all the searches in are completed, it is determined in step _S185 that the search has been completed, and the dead stone designation flowchart ends. Then, for the other blocks, the same dead stone designation processing as that of the block d is performed. Therefore,
In this embodiment, since five blocks exist as dead stone areas, all dead stones can be specified by specifying five dead stones. The number of dead stones is 32.

The dead stone mark data specified by the instructor is transmitted to the student. In this case, one piece of coordinate data representative of each block is sent to the other party without sending all dead stone data, and a whole dead stone mark is attached based on the transmitted coordinate data according to a program on the student side. Then, the student examines all dead stones, and if they agree, a signal indicating the agreement is transmitted to the instructor. As a result, the dead stone is determined, and FIG.
The dead stone is erased from the screen as shown in I). However,
Before erasing dead stones from the screen, a counting process is performed as black and white separate agehamas.

(3. Formation calculation) Go ends with formation calculation. According to the conventional method, damage is performed before formation calculation. In this case, the time for the damage is generally very long, and there has conventionally been a problem that the communication time is long in a game using a telephone line. In this embodiment, the formation calculation is performed without specially performing this useless step.

FIG. 20 is a view showing a state where dead stones have been erased.
It is the figure which put the code | symbol of "A" in the useless part in the go board of 8 (II), and was shown. Since the damage indicated by the symbol "A" is not the ground on either side, it should not be included in the formation calculation. In this embodiment, formation calculation is performed according to the formation calculation flowchart shown in FIG.

In this formation calculation flow, all coordinates (1, 1) to (19, 19) are searched, and white and black backgrounds are counted. The search order is to sequentially search for the column of x = 1, and to sequentially search for each column of x = 2, 3,... First, in step _S190 , coordinates (x, y)
Is (1, 1). Then, in the next step _S191 , it is determined whether or not the coordinates (x, y) are blank. In FIG. 20, it is blank, and in this case, the process proceeds to step _S196 . In step _S196 , it is determined whether the four sides of the coordinates (1, 1), that is, right, bottom, left, and top are the edges of the board or are surrounded by black stones. Since the coordinates (1, 1) are useless, black and white stones are present at the four coordinates. Therefore, in this case, it is determined that the four sides are not surrounded by the edge of the board and the black _stone, and the process proceeds to the next step _S198 . Also in step _S198, it is similarly determined whether the four sides are surrounded by the edge of the go board or a white stone. According to the embodiment, as in the case of step _S196 , it is not enclosed, and the process proceeds to the next step _S192 . Therefore, the bad coordinates (1, 1) are not counted on a black background or a white background.

[0062] When the coordinates (x, y) in step S ₁₉₁ is determined not to be blank, the process proceeds to step S ₁₉₃ Following addition step S ₁₉₂ thereto. That is, when the value of the coordinate y is 2,
The search is to be changed to 3 ... 19.
When the coordinates (1, 3) are determined in step _S191 ,
It is determined to be blank, and the process proceeds to step _S196 , where the process proceeds to step S196.
_{In 196} , it is determined that the four sides are surrounded by the edge of the go board or a black stone. If the surroundings are blank,
It is determined whether the extension line on the x-axis or the y-axis is the edge of the board or a black stone. Therefore, in this case, the process proceeds to step _S197 , and the black background counter is incremented by +1. On the other hand, if the coordinates (1, 17) are search stones,
Is determined not enclosed in step S _196, the process proceeds to the next step S _198, the four-way in the step S ₁₉₈ is determined as being surrounded by a cross-cut end or Shiraishi proceed to the next step S _199, In step _S199 , the white background counter is incremented by +1.

In this way, it is determined in step _S193 whether the coordinates are (y = 20), that is, whether the coordinates are outside the board. If y = 20, that is, the column of coordinates x = 1 is searched. Is completed, the process proceeds to the next step _S194 , and the search for the coordinate x + 1, that is, the next column, is sequentially performed from the coordinate y = 1 to the coordinate y = 19. And step S
_{At 195} , it is determined whether or not x = 20. When x = 20, that is, when the search for the last coordinates (19, 19) is completed, this flow ends.

According to the flow described above, it is possible to accurately count the white background and the black background, excluding the damage without performing the damage in a special step.

A program is also stored in the ROM of each terminal in advance for the method of calculating the win or loss. Normally, the student's location is (white agehama at the time of the game) + (white dead stone at the end of the game) + (black background count value)
Is calculated as On the other hand, the leader's land is (Black Agehama at the time of the game) + (Black dead stone at the end of the game) + (Count value on the white background) + (Komi value)
Is calculated as

The embodiment has been described in detail above.
The present invention can be implemented in various other modes. For example, the following is even better.

If the learner is strong or the learner's hand is too good, the game may be overtaken, the instructor may be engrossed in the game, and forget to comment on the instruction. In order to solve this problem, if the student wants a comment, if there is no comment after a certain number of moves, for example, 50 moves, a warning message "Please explain more" is displayed on the instructor terminal itself. .

Also, if the instructor takes a long thought or hits the stone during multiple hits, data is sent from each student terminal device one after another, and the data is accumulated in the instructor terminal device. As a result, the students will have to wait a long time. However, since the instructor may not notice this, a warning sound is sounded when a certain period of time, for example, 15 seconds or more after the data arrives at the instructor.

[Brief description of the drawings]

FIG. 1 is an explanatory diagram showing a communication network connecting each student and a single instructor all over Japan through a relay center in an embodiment of the present invention.

FIG. 2 is an explanatory diagram showing the communication network of FIG. 1 more specifically;

FIG. 3 is a block diagram showing hardware of a leader terminal.

FIG. 4 is an explanatory diagram showing a RAM, a display device, and the like in the instructor-side terminal.

FIG. 5 is a block diagram showing hardware of each student-side terminal.

FIG. 6I is a view showing a go board displayed on a screen of a display device of the instructor terminal. (II) is an explanatory view showing, as an example, a case where a white stone is hit on a go board and a state where a swallowing is performed. (III) is a diagram comparatively showing the final struck stone and other struck stones displayed on the display device.

FIG. 7 (I) is an explanatory view showing a temporary hit mark when a temporary hit is made and a hitting state when a temporary hit is fixed. (II) (a, b,
c) is a diagram showing the game state, the instructor screen, and the student screen, respectively.

FIG. 8I is a diagram showing a flowchart at the time of reception in each terminal. (II) is a diagram showing data stored in the RAM in the flowchart of (I).

FIG. 9 is a diagram showing a flowchart of updating the latest starting point in each terminal. (II) is an explanatory view showing data stored in the RAM in the flowchart of (I).

FIG. 10I is a diagram showing a flowchart of cursor control. (II) is a diagram showing a part of a go board for explaining the flowchart of (I).

FIG. 11 is a diagram showing a flowchart at the time of transmission in each terminal.

FIG. 12 is a diagram illustrating a flowchart of “waiting” in the instructor-side terminal. (II) is a diagram showing data stored in the RAM in the flowchart of (I).

FIG. 13 is a step S in the flowchart of FIG. 11;
It is a figure which shows the subroutine of ₁₀₁ "start".

FIG. 14 is a diagram illustrating an example of an input unit.

FIG. 15 is a diagram showing a part of a go board for explaining a sex designation.

FIG. 16 is a diagram illustrating a first half of a flowchart for setting a search;

FIG. 17 is a diagram illustrating the latter half of the flowchart for specifying a search.

FIGS. 18 (I) and (II) are diagrams showing a go board for explaining dead stone designation.

FIG. 19 is a diagram showing a flowchart of dead stone designation.

FIG. 20 is a diagram showing a go board for explaining formation calculation.

FIG. 21 is a diagram showing a flowchart of formation calculation.

FIG. 22 is an explanatory diagram showing comment contents stored in a comment sentence registration data area of a RAM 15 of the instructor terminal device 1 and codes thereof.

23 is a detailed view of a data area such as a hitting stone coordinate in the RAM 15 of FIG. 4;

FIG. 24 is a diagram showing one game record screen.

25 is a diagram showing a state in which the struck stones after the 76th black hand are deleted in the game record of FIG. 24.

FIG. 26 is a diagram showing a change of a game record showing a state where the instructor has hit the model Go from the state of FIG. 25.

FIG. 27 is a diagram showing a subroutine of step _S99 “final processing” in FIG. 11;

[Explanation of symbols]

1 Instructor's terminal 2a, 2b Student's terminal 3 Relay 4a Nearest telephone exchange 4b Sapporo packet exchange 4c Osaka packet exchange 4d Takamatsu packet exchange 4e Kochi packet exchange 4f Nearest telephone exchange 10 CPU 11 Serial / parallel signal converter 12 Modem 13 Modular jack 14 ROM 15 RAM 15a, 15b, ... 15n ... Student data recording area 15z Commentary registration data area 15x Video RAM
Area 16 Kanji ROM 17 Display control device 18 Display device 19 External storage device 20 Printer interface 21 Power supply 22 Input device 23 Sound generation circuit 24 Speaker 30 ROM 31 RAM 32 Kanji ROM 33 Non-volatile RO
M 34 display control device 35 VRAM 36 sound control circuit 37 CPU 38 remote control light receiving device 39 video signal conversion circuit 40 printer interface 41 dial / pushphone generation circuit 42 modem 43 telephone use detection circuit 44 modular jack 45 telephone / serial communication changeover switch 46 Telephone / modem changeover switch 47 CRT 48 printer 49 input device 50 mouse / remote control changeover switch 61 hitting / selection button 62 enter button 63 cursor movement button

Claims (2)

(57) [Claims] 1. A method for specifying the dead stones in Go Computer Go device comprising incorporating a game softwares of the display screen of the display unit after the remote station (18), white or black
When one dead stone (f) in one block of the ground is designated as a designated stone by the player using the input device (22), the coordinates of the dead stone (f) are first search coordinates. A first step stored in the coordinate storage means (15), and four coordinates, that is, the periphery, the left, right, up, and down of the first search coordinate, are searched, and the same stone as the first search coordinate or the blank space
Coordinates (10-17,9-16,10-15) second, and the second step is temporarily stored in the coordinate storage unit (15) as a third ... search coordinates, stored temporarily in the second step 2nd, 3rd ... search coordinates
(10-17,9-16,10-15) same processing as the second step
Are sequentially repeated until the Nth search coordinate is repeated.
The third step temporarily stored in the coordinate storage means (15).
And the first search location in order from the first to the Nth for each search coordinate.
The CPU (1
0) and the result of the determination in the fourth step is the same stone coordinates.
Indicates a dead stone mark at the same stone coordinates on the screen of the display means.
And the dead stone coordinates are stored in the coordinate storage means (15).
And storing the fifth step. 2. A computer Go dead stone designating system for designating a dead stone in a computer go device incorporating Go game software, comprising: When one of the dead stones (f) is designated as a designated stone by the player using the input device (22), the coordinates of the dead stone (f) are stored in the coordinate storage means (15) as the first search coordinates. the stored 1
First means for executing the step; four coordinates, that is, surrounding, left, right, up, and down, of the first search coordinates, and the same stone as the first search coordinates or a blank
Coordinates (10-17,9-16,10-15) second, and the second means for performing a third ... second step is temporarily stored in the coordinate storage unit (15) as the search coordinates, second The second, third,... Search coordinates temporarily stored in the step
(10-17,9-16,10-16) same processing as the second step
Are sequentially repeated until the Nth search coordinate is repeated.
The third step temporarily stored in the coordinate storage means (15).
Third means for executing the search , and for each search coordinate, a first search location in order from first to Nth.
The CPU (1
A fourth means for executing the four steps determined in step (0), and when the result of the determination in the fourth step is the same stone coordinate,
Indicates a dead stone mark at the same stone coordinates on the screen of the display means.
And the dead stone coordinates are stored in the coordinate storage means (15).
Fifth means for executing a stored fifth step. A dead stone designation system for a computer game.