JP3373240B2 - Computer Go formation calculation method and system - 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 system for performing formation calculation at the end of a computer Go device incorporating Go game software, and more particularly to a terminal device for one instructor and a plurality of people. The present invention relates to a game calculation method suitable for a multi-faced communication Go system and a system for connecting the terminals of the trainees to each other through communication lines so that the instructor can teach the trainees the game of Go.

[0002]

2. Description of the Related Art In the field of Go, there has been conventionally provided a teaching Go communication system in which one instructor and one student play one on one. As is well known, it is necessary to calculate the formation at the end of Go. In this formation calculation, dead stones are picked up and useless is done. With regard to the useless gadgets, in the conventional system, all blank portions of the useless parts are filled with go stones on the display screen.
Such a method or system has a problem that it takes too much time when the number of failures is large. Especially, in the multi-faceted communication Go system provided here, one instructor deals with many students,
It is important to be able to finish the work in a short time.

[0003]

SUMMARY OF THE INVENTION Therefore, the technical problem to be solved by the present invention is to enable a computer Go device or system to perform formation calculation including a dislocation in a final scene in a short time. is there.

[0004]

In order to solve the above technical problems, according to the present invention, a formation calculation method and system thereof having the following configurations are provided.

That is, this formation calculation method is applied to the game of Go.
Computer software with built-in software
At the end, at the end of the display means (18) screen and the storage device is a formation calculation method for sequentially searching for all the grid coordinates after deleting the dead stones using the input means, the search for each grid coordinate, It consists of the following steps.

[0006] That is, for each square coordinates, a first step of determining whether the blank coordinates, if the first step of the determination is blank coordinates surrounding the coordinates, to
That is, when the stone coordinates adjacent to each other in the vertical and horizontal directions or the coordinates on the extension line on the X axis or the Y axis are surrounded by either the end of the board or the black stone, the black counter is incremented by 1, When the coordinates around it or the coordinates on the extension line on the X axis or the Y axis are surrounded by either the edge of the board or the white stone, the second step is to set the white background counter to +1.
A second step is included, in which when the coordinates around it are on the edge of a board or surrounded by both black stones and white stones, the white background is not counted as a black background.

A system (apparatus) for implementing the formation calculation method is a combination of Go game software.
Formation calculation system in a complicated computer Go device
In the system, a formation calculation system for sequentially retrieving all the grid coordinates after deleting dead stones from the screen of the display means (18) and the storage device at the end of the system, and has the following means.

That is, the first means for judging whether or not each board coordinate is a blank coordinate, and when the judgment by the first means is a blank coordinate, the coordinates around it, that is, the upper coordinate .
When the stone coordinates adjacent to the lower left and right, or the coordinates on the extension line on the X axis or the Y axis are surrounded by either the edge of the board or the black stone, the black background counter is incremented by 1, while the surrounding area. Coordinates , that is, stone coordinates adjacent to the top, bottom, left, and right, or X
If the coordinate on the axis or the extension line on the Y axis is surrounded by either the edge of the board or the white stone, the white background counter is +
1 and the coordinates around it, that is, adjacent to the top, bottom, left, and right
If the stone coordinates are at the edge of the board or surrounded by both stones of black stone and white stone, the second means that does not count on white or black ground as useless is provided.

[0009]

In the formation calculation method and system thereof configured as described above, the formation calculation command is input only once from the input means, and the subsequent steps are executed in accordance with the instructions of the software for the Go game incorporated in the computer. It

In the above method or system, no special work is required for damaging. That is,
This is because the black and white backgrounds are counted in the ground search step, and the uselessness that is characterized by being surrounded by both white and black stones is not calculated for either black or white ground. Therefore, the useless procedure required in the conventional system is completely omitted, and thus the time required for formation calculation is greatly reduced. In this way, the intended technical problem of the present invention is achieved. In addition, in formation calculation, it is natural to consider dead stones, swallowtail, and Komi value, and this point is common to the conventional system.

[0012]

EXAMPLES An example of the present invention will be described in detail below. In addition, this embodiment has been described taking the case of a multi-faceted Go communication system as an example.

FIG. 1 shows that a professional Hoshikawa professional in Kochi, that is, an instructor, uses a telephone line, and multiple trainees from all over Japan, such as Sumita in Sapporo, Ishihara in Tokyo, Okano in Osaka, Nakatani in Kyushu. Shows a communication network for multi-faceting against students such as Ms. Ushida and Ms. Ushida of Okinawa.

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

FIG. 3 shows the instructor terminal device 1.
This terminal device 1 is usually composed of a personal computer, and is preferably composed of a laptop personal computer in order for an instructor to carry it easily. As is clear from FIG. 3, 10 is a CPU and 11 is
A converter 12 for converting a serial signal from the serial communication input / output terminal into an 8-bit parallel signal is connected to the Moschler jack 13 on the one hand and the converter 1 on the other hand.
1 is a modem connected. Reference numeral 14 is a ROM that stores a startup program and the like, and 15 is a RAM, which also includes a VRAM (video RAM). Reference numeral 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 according to a signal from the display control device 17. Reference numeral 19 denotes an external storage device from which application programs and the like are read from the device.
It is transferred to AM15. Reference numeral 20 is a printer interface connected to a printer output terminal, 21 is a power supply, 22 is an input device such as stone data, 23 is a sound generation circuit for generating a special sound, and 24 is a speaker connected to the circuit 23. Is.

FIG. 4 shows the RAM 15 and the like in the terminal device 1 in detail. This RAM 15 is a data storage area for each student 15a, 15b ...
15n and a commentary registration area 15z that is pre-standardized for the teacher to send special comments to the students
And a video RAM area 15x. Each student's data storage area 15a, 15b, ... 15n has individual student's gravel coordinate data, instructor's gravel coordinate data, and individual information such as participant's manual allocation, participant's name, and playing strength. Area 15a-1 for storing, the area 15a-3 for storing graphic data obtained by converting the struck stone coordinate data, and whether or not there is a stone on the board, and determination of prohibited hands, swallowtail, ko, etc. It includes a working RAM area 15a-2 for performing. The conversion into 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 of the AM area 15x is displayed on the display device 18 through the display control device 17 according to the steps by the program described later.

FIG. 5 shows the main body of the terminal device of each student. As shown in FIG. 2, each student terminal device 2a, 2b has a television CRT, a printer,
A telephone circuit, an input device, etc. 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 gravel data from the instructor and input data such as the gravel of the student himself. 32 is a kanji ROM, 33 is a non-volatile ROM for storing current and past game records, 3
Reference numeral 4 is a display control device, 35 is a VRAM, and 37 is a CPU. Reference numeral 38 denotes 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 a telephone and a modem. Reference numeral 45 is a telephone / serial switch for switching connection of the modem 42 or the serial communication terminal to the CPU 37, 41 is a dial / push-phone generation circuit connected between the CPU 37 and the modem 42, and 36 is connected between the CPU 37 and the modem 42. It is a sound control circuit. The input data from the mouse as the input means is displayed on the display controller 34.
Entered in. The sound control circuit 36 is connected to the audio input terminal of the speaker of the television. The display control device is connected to a video signal conversion circuit 39, which is an RGB circuit.
Terminal, S-video terminal or composite terminal. Each of these terminals is connected to a CRT 47 as a display device. A printer interface 40 is connected to the printer terminal of the printer 48.

6 and 7 show a board, a black stone struck, a white stone and a cursor which appear 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 trainee's transmission data is received by the instructor's terminal, and the data stored in the RAM of the terminal 1. The flowchart of this receiving program will be described in detail below. The receiving program is also stored in the terminal device on the student side. Step S
₇ and S ₈ are only in the program of the student side terminal device, not in the instructor side terminal device.

The outgoing data of the students is distributed in step S ₁ . As described above, the RAM 15 of the terminal 1 has a student-specific data storage area. Therefore, it is necessary to classify the outgoing data of each student, which is transmitted in random order by packet communication, for each student and store it in the data storage area of the corresponding student. This process is the distribution process in step S ₁ . First, personal information transmitted from each student is stored in the student-specific data storage area of the RAM 15. This personal information includes the name of the other party, that is, the name of the student, the playing power of the person, the ratio of hands, that is, the number of child stations, and the presence or absence of a comment as described above. Next, the coordinate data of the smashed black stones (normally students have black stones) transmitted sequentially by the students is sequentially stored. In this data storage area, as shown in FIG. 8 (II), the coordinate data of the instructor's struck stone, that is, white stone, is also stored.

Next, in step S ₂ , the received coordinates of the stoned stone data of the student are converted. Of FIG. 7 (II)
The (a) shows the game status displayed on the display device. As shown in (a), since the instructor and the student are playing a game, the position of the board is different by 180 ° depending on the player. Therefore, in order to reproduce the state in which both the instructor and the student are hitting the actual board, the instructor screen and the student screen are 180 ° as shown in (b) and (c). It is converting. Therefore, the coordinate data of the stones sent from the students is (X = 20-X,
It is necessary to perform coordinate conversion by the calculation formula of Y = 20−Y).

Next, in step S ₃ , the stone smashing procedure (the coordinate-converted stone smashing coordinates X ₁ , Y ₁ ; X ₃ , Y ₃ ) is sequentially stored.

Next, when the learner's latest stoning causes swallowing, a swallowing process is performed in step S ₄ . This swallowtail treatment and stoning are shown in FIG. 6 (II). (a) shows the state before the start of the white stone, that is, the state that the struck stone is blank, and (b) shows the state after the white stone is placed. Now, when a black stone is struck around the white stone shown in (b) and this white stone becomes a swallowtail, it is returned to the state of (a). In other words, the shiraishi which becomes a swallowtail on the display screen in this way is erased. As a matter of course, as a premise, the coordinate data and graphic data of the white stone, which is the swallowtail, stored in the RAM 15 is erased.

Next, in step S ₅ , the struck black stone is immediately converted from the coordinate data into struck graphic data and stored in the graphic data area of the RAM.

Next, in step S ₆ , the latest starting point of Kuroishi is updated. Since this communication system enables multiple hits, the game screens of the instructor's terminal are sequentially switched to show the game screens of different trainees who have been stoned. In this case, if all the black stones struck by each student are displayed in the same manner, it is impossible to instantly determine which stone is the final struck stone. Therefore, in this embodiment, as shown in FIG. 6 (III), when the final crushed stone has a solid pattern other than the final crushed stone, a star-shaped mark is attached to the center of the stone. There is. Therefore, even if the game screen is switched, the leader can identify the latest black stone starting point by paying attention to the stone marked with the star, and can instantly remember the progress of the game. Since this system does this, it is necessary to update the latest starting point each time a black stone is struck. 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. The latest black stone is now the nth stone. When the nth black stone is struck, in step _S61 , the n-2nd stone struck coordinates are changed to graphic data other than the final struck stone. Next, in step _S62 , the graphic data of the nth hand is changed to the final starting point display, that is, the display with the star mark shown in FIG. 6 (III).

Returning to FIG. 8 again, in the leader side terminal, after step S ₆ , the process proceeds to step S ₉ .
In step S _9, the screen switching request is made. That is, it is required to switch the screen on the display device of the instructor to the screen of the trainee who has already been stoned. The reception flow chart is ended by this step S ₉ .

On the other hand, steps S ₇ and S ₈ are executed at the student terminal. In step S ₇ , a buzzer sound indicating that the smashing of white stones is completed 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 explanatory auxiliary diagram of the subroutine.

In step S ₈₁ , it is determined whether or not the instructor struck the stone. Then, while the instructor is not crushing stones, the process proceeds to step S ₈₂ . In step _S82 , the cursor is moved and displayed according to the amount of change of the input device. That is, the operating state of the input device and the moving state of the cursor always match. On the other hand, when the teacher smashes the stone in step S ₈₁ , the graphic coordinates (Gx, Gy) of the cursor are converted. The conversion formula is Gx
= X + XDOT (X-1), Gy = y + YDOT (Y-1).
That is, in graphic coordinates, it is indicated by the number of dots on the x-axis and the y-axis. In the above formula, XDOT indicates the number of dots in one cell on the grid in the x-axis direction. Also, YDOT is y
It shows the number of dots and the number in the axial direction. Coordinates on the 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) is the graphic coordinate of the cursor
(Gx, Gy) will coincide with the coordinates of this white stone.

Next, in step S ₈₄ , the cursor instantaneously moves to the positions of Gx and Gy. In this state,
When the student operates the input device, the cursor moves again from the position shown in the figure according to the operation. Normally,
Since he often hits his next stone near the opponent's stone, the amount of cursor movement is small.

Returning to FIG. 8 (I) again, in the leader side terminal, after step S ₆ is completed, step S ₉
At, a screen switching request is made.

Next, a flow chart (FIG. 11) of the program when the instructor sends stoned data or the like will be described.
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
There is no ₁₁₂ 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. If the instructor judges that the learner's stoning is very bad and the learner must immediately give up, the instructor gives the learner a "waiting" process. This is a process for sending a message to the trainee that "waiting" is allowed, and for the trainee to respond to this message. The details of this waiting processing are shown in the subroutine of FIG. Figure 1
2 (I) shows the subroutine, and (II) shows the details of the procedure storage area of the RAM 15 as an explanatory auxiliary diagram of the subroutine.

Now, it is assumed that the student has made a stone for the nth hand. 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 "waited" in step S _122, leader sends the student to "rethink" message.

[0033] 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, if "waits", the coordinates of the pointer in the procedure storage area of the RAM are erased 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. When this step is completed, the process proceeds to step _S111 in FIG.

[0034] If Referring back to FIG. 11 again, after the processing of step S ₁₀₀ is performed, leaders, step S ₁₀₁
At, embark on pebbles. The sub-routine for this move is shown in FIG. This subroutine is based on the premise that the input device on the instructor side and the input device on the student side have the configuration shown in FIG. In FIG. 14, reference numeral 61 is a button for temporarily pressing or for selecting a menu mode displayed on the display device. Reference numeral 62 is a button for confirming the temporarily struck stone. Also, 63 are four cursor movement buttons for moving the cursor respectively.

First, in step S ₁₂₆ , it is determined whether or not the student wants the explanation. At this time, when the “request for explanation” is stored as the personal information data of each student (see FIG. 8II), the program is stepped.
Proceeds to _124, the process proceeds to step S ₁₃₁ otherwise.
At step ₁₂₇ , the instructor determines as soon as the hand the learner has undertaken requires commentary. If the explanation is required, the leader selects the explanation term in step _S128 .

As described above, the explanatory terms are RAM15.
It is coded and stored in the registered data area. The details are shown in FIG. Here, for example, as shown in FIG. 23, if “bad hand” is selected for the 76th black eye, the comment code “4” is the coordinate data for the 76th black eye in the next step S _129. The description is stored in the code area. At this time, the comment code "4" is also recorded in the transmission area. This comment code is transmitted to the student together from the instructor's next struck stone, that is, stone struck data of stone 77 from the transmission area (step _S110 ).

From step S ₁₃₁ , the instructor's actual next stone starts. In step _S131 , the instructor operates the cursor movement button 63 to move Shiraishi to the starting point. If the button 63 is pressed down, step _S145
Go to and the cursor will move. When this move ends,
The program moves from step S ₁₃₁ to step S ₁₃₂ . Then, the stoning / selection button 61 is pushed down.
Then, in step S _132, the striking stone / select button 61 is judged whether depressed, this button is depressed, the process proceeds to step S _133, there is already a stone embarked point at step S ₁₃₃ It is determined whether or not. 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. Step S
_{At 134} , it is determined whether the starting point has already been provisionally struck. Then, if the provisional hit has not been made, that is, if it is a new provisional hit, the provisional hit mark is displayed on the screen in the next step _S135 , the provisional hit coordinates are stored in the RAM, and the timer is started. Let the program go back. FIG. 7 shows an example of the temporary hitting mark. The square mark shown in FIG. 7 (I) is a temporary marking mark.

In step _S134 , if it is determined that the provisional hit has already been made, that is, if the present provisional hit is the second provisional hit, the process proceeds to the next step _S142 . In step S ₁₄₂ , it is determined whether or not the second temporary hitting is the same as the previous temporary hitting coordinate. Then, in the case of the same, the process proceeds to the next step _S143 , the temporary hit display is erased, the temporary hit memory information is erased, and the timer is ended. That is, the flow of steps _S134 , _S142 , and _S143 is a step for canceling the first provisional hit.

If it is determined in step S ₁₄₂ that the current temporary hit coordinate is different from the previous temporary hit coordinate, the process proceeds to step S ₁₄₄ to erase the previous temporary hit display and
The temporary tap mark of this time is displayed and the timer is restarted, and the process returns to step S ₁₃₂ . 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 stone hitting / selection button has not been depressed yet, the process returns from step _S143 or _S144 to step S132 again.
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 .

If it is determined in step _S137 that the timer is operating, the process proceeds to the next step _S138 , and steps _S132 , _S136 , S are executed until the timer is completed.
The cycle of ₁₃₇ and _S138 is 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 S ₁₄₁ , and the provisional hitting mark is forcibly changed to the go stone display.

[0042] 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 it has been tentatively hit, the process proceeds to step S ₁₄₁ . On the other hand, if the temporary-handed still, the step S ₁₄₀
And a buzzer sound is emitted to prompt a temporary strike.
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 move} of ₁₀₁ is completed, it is determined in the next step S ₁₀₂ whether the struck stone 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 buzzer sound causes the leader to recognize that the wrong move has been started and to start again. If the move is not a prohibited move, it is determined in the next step _S103 whether the move is a ko. If it is a ko, the process proceeds to step S ₁₀₄ as in the case of the prohibited hand. Then, if not Kou whether Agehama by undertake occurs is determined in step S _105. If there is a swallowtail, the swallowtail process is performed in step S ₁₀₆ . The swallowing process has already been described in the flowchart of FIG. 8 (I).

The process proceeds to the next step S ₁₀₇ if made Agehama processing in step S _106. Also, step S
Even if there is no swallowing in ₁₀₅ , the process proceeds to step S ₁₀₇ . In step _S107 , the procedure started is RA.
It is stored in M15. In this case, the procedure is RAM15
It 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 S ₁₁₀ , the instructor's starting coordinates and the explanation 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 showing that it is the other party's turn, that is, the trainee's turn, in other words, a display showing that the instructor has finished hitting stones is made. In addition, the sent pebbles data and the explanation code are received by the student terminal and R
It is stored in both the AM 31 and the ROM 33. This explanation code is converted into text and displayed in the message area of the screen display means of the terminal. This commentary is also displayed when past game records are read from the ROM 33 and reproduced.

After step S ₁₁₀ , in step S ₁₁₁ , a screen switching request from each student, that is,
It is determined whether or not there is a screen switching request in step S ₉ of FIG. 8 (I). 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 Is done. Also, video R
Aspects of the student are 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 trainee's start has already been completed. Next, in the next step _S114 , the cursor control described in FIG. 10 is performed, and then the process returns to the original.

Now, the final processing in step S ₉₉ will be described in detail with reference to FIG. 27 showing the subroutine.

As a final post-processing, it is decided whether the instructor should show the change diagram of the model instruction go to the learner only if the learner wants "explanation" in step S.
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 _211, displays a mark only those Remarks code to each droplet stone data embarked-procedure storage area of ROM15 is added. It is preferable that this mark has a color different from that of the normal color (black) of the flint itself. For example, in the commentary, flints with commentary codes such as "I am good at" and "I am wearing right" are displayed in light blue, while instructions such as "I am bad" and "I am disappointed" are given. The stones to which the explanation code of words is added are displayed in red. By doing so, the leader can instantly remember the past phase development. The leader takes the next step S
_{At 212} , the coordinates of a specific stone such as a bad hand are designated on the screen. This specific pebbles means that the instructor will demonstrate exemplary Go for further development.

Now referring to FIG. 24 showing the final screen (see FIG.
In Fig. 4, 100 hands and subsequent hands are omitted for clarity of illustration), and 76th black hand (12
No. 6) If you want to create a model change chart of the Go model from this point onward, specify this black 76th hand. When this designation is made, in step _S213 , all the stones after the 76th black hand are erased from the screen (the erased screen is shown in FIG. 25). The instructor next refers to black 1 in FIG.
Stones 3 of 3 (black 76). Then, as shown in FIG. 26, a change diagram is created by alternately smashing examples of good hands up to white 77, black 78, white 79, ... Black 82 in black and white. The instructor decides how many hands to make, and step S
₂₁₄ and _S215 are repeated. The procedure of the change diagram is stored in the change diagram procedure storage area in the start / procedure storage area of the RAM 15 as shown in FIG.

If it is determined in step _S215 that the instructor has finished creating the change diagram, then in step _{S215
At 216} , the display of the go stones that make up 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 (black and white calculation result and win / loss result) is transmitted to the students.

The process from the start to the end of the game is performed according to the above program. At the end of the game, the following procedure is generally required from the prior art. That is,
If the phase ends, (1) care, (2) uselessness, (3) seki designated or dead stone designated, (4) and finally formation calculation,
Is carried out. In the present embodiment, the transmission signal is designed to be minimized with respect to the designation of the cough, the designation of the dead stone and the formation calculation. These will be described in detail below.

(1. Seki Designation) First, a program for sex designation will be described. The program designated by Seki is set on the terminals of both the instructor and the student. That is to say, this security designation itself is made by the instructor side, and after the end, the consent of the other side, that is, the trainee is requested. However, it is also possible to confirm the Seki designation only by the judgment of the instructor.

Conventionally, when calculating the ground formation at the end of Go, it is necessary to devise not to calculate it as the ground because the cough is neither of the grounds. According to the conventional method, a blank stone that composes a seki is filled with a go stone, or when a seki is specified, there are several seki, so it is necessary to specify multiple blank parts for each seki. There was. According to the method according to the present embodiment, all the seki can be designated automatically by designating the stone of one coordinate for the seki of one block.

FIG. 15 illustrates the security. (I) indicates one block of sekis A ₁ , A ₂ , and A ₃ surrounded by a broken line.
In (II), a seki mark is displayed at each of the sekis A ₁ , A ₂ , and A ₃ . (III) is a diagram illustrating a method for specifying a sex. This will be described in detail with reference to (III) and the security designation flowcharts of FIGS.

In [0054] 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 Let it be a search stone. At the same time, the coordinates of the designated stone are set as the 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 the designated stone, that is, the first search stone. Then
In step S ₁₅₁ , the stone around the coordinates of the retrieved stone a is searched and judged. That is, the search stone coordinates on the right in the figure,
For the four surrounding stones below, left, and above, it is determined whether it is the same stone as the retrieved stone, is blank, or is a partner stone, that is, a black stone, or is the end of a board. Then, only when the surrounding stones are blank or the same stone, the blank coordinates and the same stone coordinates are temporarily stored and the searched processing is performed. In the present embodiment, the right white stone (7, 2), the left white stone (5, 2) and the upper blank coordinate (6, 1) are temporarily stored.

Then, in the next step _S153 , it is determined whether or not the stone of the first search coordinate is blank. If it is blank, the process proceeds to step S ₁₅₆ , and if not, the process proceeds to step S ₁₅₄ . In step _S154 , it is determined whether or not the first stage safety designation is completed.
In other words, the procedure for specifying this Seki is to search for the stones around the stone with the first stone specified as the first search stone,
Only when the stone is the same stone or the blank, the stones or the blanks around them are respectively the second, the third ...
... The Nth search stone or search coordinates are sequentially and repeatedly searched. Therefore, while all the searches for the temporarily stored stones or blanks are not completed, the process proceeds to step _S155 . In step _S155 , the temporarily stored stone coordinates are sequentially changed to new search coordinates, that is, the second, third ...
Returning to ₁₅₁ , the process is continued until the first stage Seki designation is completed. In step S ₁₅₁ , the searched coordinates are subjected to the searched processing, so the searched coordinates are skipped in the second search and thereafter. In other words, of course
Therefore, duplicate search is avoided. Otherwise, the program
Will not end. For example, if the i-th search coordinate is at the position of Seki A ₁ , that is, the blank coordinate (6,1), or if it is at the position of Seki A ₂ , that is, the blank coordinate (3,1), in step S ₁₅₃ , a blank Then, in the next step S ₁₅₆ , it is determined whether or not a blank mark is already attached to the blank. Then, when the blank mark is not added yet, the blank portion is marked, that is, the square mark shown in FIG. 15 (II) is displayed, and the blank code stored in the RAM is changed to the blank code. Then, the process proceeds to 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 cancellation flow of a sekimark when a sekimark is mistakenly added. 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. Then, when it is determined that the stone is the partner stone, that is, the black stone, one coordinate of the partner stone, that is, the coordinate of the black stone is set as the search coordinate of the second stage. When the process of step _S159 ends, the process proceeds to step _S154 . That is, the stone around the blank coordinate b, that is, the white stone at the coordinate (4,1), the black stone at the coordinate (3,2) and the black stone at the coordinate (2,1), the coordinate (3,2) is the step. In _S160 , the next search coordinate, that is, the second designated stone is designated. And step S
The second stage search starts from ₁₆₁ . That is, in step S ₁₆₁ , the opponent stone, that is, the black stone with coordinates (3, 2) is the second
It is designated as the first search stone of the stage, and its coordinates (3, 2) are used as the search coordinates. Then, the program of step S ₁₆₂ and thereafter is executed. Step S ₁₆₂ to Step S
Step ₁₆₉ is substantially the same as steps S _{151 to} S ₁₅₈ described above. However, in the search for the second stage, the step corresponding to step S ₁₅₉ are unnecessary. In this way, the remaining seki A ₃ is marked with a seki mark.
These sekimarks displayed on the instructor side terminal are also transmitted to the student side terminal. The data sent to the students is the first designated stone (first search stone) for each block.
Only. Since the student side terminal device also has a program similar to the instructor side terminal, the same mark is reproduced and displayed on the student side display device. However, the students themselves cannot specify the first designated stone. The procedure for specifying a sex described above will be described more specifically in the embodiment of FIG. (1st stage) When you enter the program for specifying the first designated stone a and set it to Seki: 1: Make the first designated stone a the first search coordinate (6, 2). 2: Shiraishi (5,2), (7, around the coordinates of the first search coordinate (6,2)
2) is temporarily stored as the same stone coordinate, and coordinate A1 (6,1) is temporarily stored as a blank coordinate. 3: The coordinate (5, 2) is temporarily stored as the second search coordinate from the temporarily stored coordinates, and the white stone (5, 1) around the coordinate is temporarily stored as the same stone coordinate. 4: The coordinate (7, 2) is temporarily stored as the third stone coordinate among the temporarily stored coordinates, and the white stone (7, 1) around the coordinate is temporarily stored as the same stone coordinate. 5: The coordinate A1 (6,1) is set as the fourth search coordinate from the temporarily stored coordinates, and the blank is changed to the safe display and the blank coordinate is changed to the safe code. In this case, since there is no opponent stone (black stone) around the coordinates, the second designated stone is not stored. 6: The coordinate (5,1) is temporarily stored as the fifth stone coordinate among the temporarily stored coordinates, and the white stone (4,1) around the coordinate is temporarily stored as the same stone coordinate. 7: The coordinates (7,1) are used as the sixth search coordinates from the temporarily stored coordinates, and the coordinates around the coordinates are searched. However, there is no temporary storage around that coordinate. 8: Using coordinates (4,1) as the seventh search coordinate from the temporarily stored coordinates, a coordinate around that coordinate is searched, and the coordinate A2 is searched.
Temporarily store (3,1) as a blank coordinate. 9: Using the coordinate A2 (3,1) as the eighth search coordinate from the temporarily stored coordinates, the blank is changed to the safe display and the blank coordinate is changed to the safe code. Then, the opponent 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 coordinate (3, 2). 11: The black stones (2,2) and (4,2) around the first search coordinate (3,2) are temporarily stored as opponent stones. 12: The coordinate (2,2) is temporarily stored as the second stone coordinate and the black stones (1,2) and (2,1) around the coordinate are temporarily stored as the same stone coordinate. 13: the coordinates (4,2) out of the temporary storage coordinates in the third search coordinates <br/>, retrieves the coordinates around it. However, there is no temporary storage around that coordinate. 14: The coordinate (1,2) is set as the fourth search coordinate from the temporarily stored coordinates, the coordinates around the coordinate are searched, and the coordinate A3 (1,1) is searched.
Is temporarily stored as a blank coordinate. 15: The coordinate (2,1) is used as the fifth search coordinate from the temporarily stored coordinates and the coordinates around it are searched. However, there is no temporary storage around that coordinate. 16: A3 (1,1) is searched as the sixth search coordinate from the temporarily stored coordinates, and the blank is changed to the safe display and the blank coordinate is changed to the safe code. Since there is no coordinate to temporarily store around that coordinate and no coordinate to temporarily store black stones and blanks, the security designation of the block ends.

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

(2. Dead Stone Designation) Next, dead stone designation will be described in detail. Generally, when calculating the formation at the end of Go, it is necessary to pick up dead stones before making the calculation. In the conventional designation method, it was necessary to designate dead stones one by one.
In addition, when sending dead stone data using a telephone line, there has been a problem that the sending time is long because all dead stone data is conventionally sent. The dead stone designation method according to the present embodiment uses that dead stones within one block surrounded by the opponent stone or the edge of the board are always connected by blanks or dead stones,
The feature is that all dead stones can be specified only by specifying one coordinate within the block.

FIG. 18 (I) shows a total of 5 blocks a, b, c, d and e.
The dead stones in one block are shown with a dead stone mark, and (II) shows the state where all dead stones are erased. Further, FIG. 19 shows a flowchart for designating dead stones. The dead stone designation method will be described with reference to this dead stone designation flowchart. The dead stone designation program is also stored in both terminals of the instructor side and the student side, or the dead stone designation itself is performed by the instructor side.

First, in step S ₁₈₀ , one of the dead stones in the ground of one block is designated and the designated stone is set as the first search coordinate. In the present embodiment, it is assumed that one dead stone f in the block d is now the designated stone. Then, in the next step _S181 , the search coordinates, that is, the stone on the lower right and the upper left around the dead stone f, is searched to determine whether it is the partner stone, that is, the white stone, or blank or the same stone, that is, the black stone, Coordinates and the same stone coordinates are temporarily stored, and at the same time the searched processing is performed. Therefore, the coordinate of the designated stone f is (1
0,16), the upper left and lower coordinates (10,1)
The three coordinates 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 S ₁₈₄ , the dead stone mark is displayed, the dead stone coordinates are stored, and the process proceeds to the next step S ₁₈₅ . . In this embodiment, first, the designated dead stone f is marked with a cross 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 for canceling the dead stone mark when it is first erroneously added. When the process of step _S187 is completed, the process proceeds to step _S185 . Furthermore, if it is determined in step _S183 that the search coordinates are blank, the process directly proceeds to step S183.
Proceed to ₁₈₅ . In step _S185 , it is determined whether the search in one block is completed. That is,
In step _S181 , it is determined whether or not the search for the next candidate search stone temporarily stored has been completed.
In step _S185 , if not finished, step S185
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. If this flow is repeated, all areas within the white stone area surrounding the dead stone in block d including dead stone f will be searched and all dead stones within that area will be marked with an X. Become. In other words, the temporarily stored coordinates are used as the second, third ... And block d
When all the searches in the above are completed, it is determined to be completed in step _S185 , and the flowchart for designating dead stones is completed. Then, with respect to the other blocks, the dead stone designation process similar to that of the block d is performed. Therefore,
In this embodiment, since there are 5 blocks as dead stone areas, all dead stones can be designated by five dead stone designations. The number of dead stones is 32.

The data of the dead stone mark designated by the instructor side is transmitted to the student side. In this case, one piece of coordinate data representing each block is sent to the other party without sending all dead stone data, and all dead stone marks are added based on the transmitted coordinate data according to the program on the student side. Then, after the trainee has examined all dead stones and agreed to them, a signal indicating the agreement is transmitted to the instructor side. As a result, the dead stone is confirmed, and the input operation by the instructor causes the dead stone in FIG.
Clear the dead stone from the screen as shown in I). However,
Before erasing dead stones from the screen, count them as separate black and white swallowtails.

(3. Geometry calculation) Go ends with the geography calculation. According to the conventional method, the misalignment is performed before the formation calculation is performed. In this case, in general, the time required for misuse is very long, and there has been a problem that the communication time becomes long in a game using a telephone line. In the present embodiment, formation calculation is performed without specially performing this step.

FIG. 20 is a view showing a state in which dead stones have been erased.
It is the figure which put the code | symbol of "A" in the disordered place on the board of 8 (II). Do not use the sign "A" to calculate the formation because it is not on either side. In this embodiment, the formation calculation is performed according to the formation calculation flowchart shown in FIG.

In this texture calculation flow, all coordinates (1, 1) to (19, 19) are searched and the white background and the black background are counted. The order of the search is to sequentially search the column of x = 1, and sequentially search each column of x = 2, 3, ... First, in step S ₁₉₀ , the coordinates (x, y)
Be (1,1). Then, in the next step _S191 , it is determined whether or not the coordinates (x, y) are blank. It is blank in FIG. 20, and in this case, the process proceeds to step _S196 . In step _S196 , it is determined whether the four sides of the coordinate (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, there are black stones and white stones in the coordinates on all four sides. Therefore, in this case, it is determined that the four sides are not surrounded by the edges of the board and black _stones, and the process proceeds to the next step S ₁₉₈ . Also in step _S198, it is similarly determined whether the four sides are surrounded by the edges of the board or white stones. According to the embodiment, as in the case of step _S196 , it is not enclosed,
Then, the process proceeds to next step _S192 . Therefore, the coordinates (1,1), which is not good, are not counted on the black background or the white background.

If it is determined in step S ₁₉₁ that the coordinate (x, y) is not blank, the process proceeds to step S ₁₉₂ and then to step S ₁₉₃ . In other words, the value of coordinate y is 2,
3 ... 19 will be changed and searched.
If it is determined in step S ₁₉₁ the current coordinates (1,3),
Blank and is determined, the process proceeds to step S _196, step S
_{In 196} , it is judged that the four sides are surrounded by the edges of the board or black stones. If the surrounding area is blank,
It is determined whether the extension line on the x-axis or the y-axis is the end of the board or 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 coordinate (1,17) is the search stone,
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 judged in step _S193 whether the coordinate is (y = 20), that is, whether it is outside the board. If y = 20, that is, the column with coordinate x = 1 is searched. When the process is completed, the process proceeds to the next step S ₁₉₄ , and the search of the coordinate x + 1, that is, the next column is performed from the coordinate y = 1 to the coordinate y = 19 in order. And step S
_It is determined in ₁₉₅ whether x = 20, and if x = 20, that is, the search for the last coordinate (19, 19) ends, this flow ends.

With the above flow, it is possible to accurately count the white background and the black background by eliminating the spoilers without performing the spoilers in a special step.

As for the winning / losing calculation method, a program is stored in the ROM of each terminal in advance. Usually, the student's land is (white swallowtail at the time of the game) + (white dead stone at the time of the game) + (count value of the black background)
Calculated as On the other hand, the leader's land is (black swallowtail at the time of the game) + (black dead stone at the end of the game) + (white background count value) + (commit value)
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 more preferable.

If the trainee is strong or the trainee's hand is too good, the player may become obsessed with the game and the teacher may be obsessed with the game and forget to give instruction. In order to solve this problem, if the student wishes to give a comment, or if there is no comment after a certain number of steps, for example, 50 moves, the warning message "Please explain more" is displayed on the instructor terminal itself. .

Further, when the instructor has a long thought or a lagging stone during multi-striking, data is successively sent from each student terminal device, so that data is accumulated in the instructor terminal device. Therefore, the trainees will have to wait for a long time. However, the instructor may not be aware of this. Therefore, the alarm sound is made to sound after a certain period of time, for example, 15 seconds or more after the data comes to the instructor side.

[Brief description of drawings]

FIG. 1 is an explanatory diagram showing a communication network in which each student and one instructor all over Japan are connected 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 side 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 the hardware of each student terminal.

FIG. 6 (I) is a diagram showing a board displayed on the screen of the display device of the instructor side terminal. (II) is an explanatory view showing a case where Shiraishi is hit on a board and a state of swallowing. (III) is a diagram relatively showing the final struck stone and the other struck stones displayed on the display device.

FIG. 7 (I) is an explanatory diagram showing a temporary hitting mark when temporarily hitting and a stone hitting condition when finalized. (II) (a, b,
c) is a diagram showing a game status, an instructor screen, and a student screen, respectively.

FIG. 8 (I) is a diagram showing a flow chart at the time of reception at 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 diagram showing data stored in the RAM in the flowchart of (I).

FIG. 10 (I) shows a flowchart of cursor control. (II) is a diagram showing a part of a 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 showing 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.
It is a figure which shows the subroutine of "start" of ₁₀₁ .

FIG. 14 is a diagram showing an example of input means.

FIG. 15 is a view showing a part of a board for explaining the designation of the safety.

FIG. 16 is a diagram showing a first half of a flowchart for specifying a safety.

FIG. 17 is a diagram showing the latter half of the flowchart for specifying a security.

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

FIG. 19 is a diagram showing a flowchart for specifying a dead stone.

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

FIG. 21 is a diagram showing a flow chart of formation calculation.

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

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

FIG. 24 is a diagram showing one game screen.

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

FIG. 26 is a game record change diagram showing a state in which the instructor has made a model go from the state of FIG. 25.

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

[Explanation of symbols]

1 Terminal device for instructor 2a, 2b Terminal device for student 3 Relay device 4a Nearest telephone exchange station 4b Sapporo packet exchange station 4c Osaka packet exchange station 4d Takamatsu packet exchange station 4e Kochi packet exchange station 4f Nearest telephone exchange station 10 CPU 11 Serial signal / parallel signal converter 12 Modem 13 Modular jack 14 ROM 15 RAM 15a, 15b, ... 15n ... Student data recording area 15z Explanatory text 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 Nonvolatile 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 / push-phone generation circuit 42 Modem 43 Telephone busy detection circuit 44 Modular jack 45 Telephone / serial communication selector switch 46 Telephone / modem changeover switch 47 CRT 48 Printer 49 Input device 50 Mouse / remote control changeover switch 61 Stone / selection button 62 Confirm button 63 Cursor move button

Claims (2)

(57) [Claims] 1. A method for calculating a formation in a computer Go device incorporating a game software of Go, in which a screen of a display unit (18) and an input unit (22) from a storage unit (15) are used at the end. After the dead stones are erased, the formation calculation method is used to sequentially search for all the board coordinates, and the search for each board coordinate is whether the board coordinates (x = 1, y = 1) are blank coordinates. And the left and right when the judgment of the first step is a blank coordinate.
When the coordinates of the stone adjacent to the right or the coordinates on the extension line on the X-axis or the Y-axis are either the edge of the board or the black stone , the black background counter is incremented by +1 while the stones adjacent to the top , bottom, left and right
When the coordinate or the coordinate on the extension line on the X axis or the Y axis is either the edge of the board or the white stone , the white background counter is set to +1 and the stone coordinates adjacent to the top , bottom, left , and right are the edges of the board or the black stone. When it is surrounded by both white and white stones, the second step that does not count on white or black ground as useless,
A computer go formation calculation method characterized by including. 2. In a formation calculation system in a computer Go device incorporating a game software of Go, at the end, a dead stone is displayed using a screen of a display unit (18) and an input unit (22) from a storage device. In the formation calculation system that sequentially retrieves all the grid coordinates after erasing, the first means for determining whether each grid coordinate is a blank coordinate, and when the judgment by the first means is a blank coordinate Up , down, left and right
While the black counter and +1 when the coordinates or checkerboard end or on an extension line of the stone coordinate or X-axis or on the Y-axis adjacent either of black stone, the stone seats that are vertically and horizontally adjacent to each
If the coordinates on the mark or the extension line on the X-axis or the Y-axis is either the end of the board or the white stone, the white background counter is +
1 and the second means that does not count on white ground or black ground as useless when the stone coordinates adjacent to the top , bottom, left and right are surrounded by the edges of the board or both black and white stones. Characteristic computer Go formation calculation system.