JPH06218143A - Game communication system for multiface playing guidance - Google Patents

Abstract

PURPOSE:To realize multiface playing of GO (the game of GO) and SHOGI (the game of Japanese chess), etc., by connecting each terminal of plural guidance receiving persons with a terminal of one guidance teacher by using a communication circuit. CONSTITUTION:Terminals 2a, 2b of each guidance receiving person and a terminal 1 of a guidance teacher are connected by using a communication circuit through a repeater 3. By a communication between each guidance receiving person and a guidance teacher, the game of GO, etc., can be enjoyed by charging of a low cost, and also, by a guidance fee of a low amount of money, and moreover, while staying at home by utilizing a packet communication.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a multi-faced instruction game communication system, and more particularly, to a terminal of one instructor when playing various game games such as Go, Shogi, chess, and Othello (registered trademark) games. The present invention relates to a communication system for connecting a device and each terminal device of a plurality of students by a communication line so that the instructor can simultaneously instruct a plurality of students to play a game, that is, perform multiple hits.

[0002]

2. Description of the Related Art In the field of Go, there has been conventionally provided a teaching game communication system in which one instructor and one learner play one on one. However, in this case, there is a problem that one trainee occupies the whole time of one instructor during the game time, which inevitably increases the game fee. In the case of Go played using an actual board, one instructor usually performs multiple hits against multiple participants, but if this multiple hit can be adopted in the instruction game communication system, The game fee for each student will be very low.

[0003]

SUMMARY OF THE INVENTION Therefore, the technical problem to be solved by the present invention is to provide the above-mentioned multi-faced hitting game communication system.

[0004]

Means, Actions and Effects for Solving the Problems In order to solve the above technical problems, the present invention provides a multi-faced instruction game communication system having the following configuration.

That is, this multi-faced teaching game communication system is provided with one instructor terminal device and a plurality of student terminal devices, one of which is connected to the instructor terminal device by a communication line, and the other of which is connected to the instructor terminal device. A relay device that is connected to each student terminal device by a communication line, and receives student transmission data such as personal information data and pebbles data from each student terminal device, and stores the data at one time While being transmitted to the instructor terminal device, a relay device that distributes instructor transmission data such as stoning data from the instructor terminal device to each student data and transmits to each student terminal device . The instructor terminal device stores, for each student, a data storage area for each student, which stores student transmission data, input data such as instructor stone data, and graphic data obtained by converting those data by a conversion means. And a storage means having a storage area for storing commentary registration data, and the student transmission data from the relay device is divided into data for each student and transferred to each student-specific data storage area of the storage means. Distribution means for transmitting the instructor input data to the relay device, display means for displaying the graphic data stored in the storage means and the instructor's new input data, and data such as instructor gravel data and commentary data And input means for inputting.

According to the above construction, one instructor can make multiple hits against a plurality of trainees. Also,
According to the above configuration, in the instructor terminal device, the storage means has means for converting the student transmission data and the instructor input data into graphic data. When the game screen is switched, the phase data is prepared in advance as graphic data, so that data, that is, for example, the line pattern of the board and the stones that have been stoned can be instantly displayed on the display means. Therefore, the instructor can quickly respond to the game with the switched student.

Although a communication means such as a telephone line is usually used in the above structure, it is also possible to perform the system having the above structure in one venue by using serial communication. In addition, if the telephone line is used, the packet communication makes the communication charge very low. This packet communication is most suitable for games such as Go and Shogi where it takes a long time to complete the game, but it takes only a short time to send the stoned data for each move.

[0008]

EXAMPLES An example of the present invention will be described in detail below. In this embodiment, the game of Go is explained as an example.

In FIG. 1, 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 data, area 15-3 for storing graphic data obtained by converting struck stone coordinate data, and whether or not there is a stone on the board, and determining forbidden 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. VRA
The video data of the M 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 main body of the terminal device, 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 learner 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, a white stone, and a cursor, which are displayed on the screen of the display device of the instructor's terminal 1. 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. As described above, this personal information is the name of the other party, that is, the name of the student, the player's playing strength, the ratio of hands, that is, the number of child stations, and the like. Next, the smashed black stones sent by the students in sequence
Coordinate data (normally students have black stones) is stored sequentially. 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 stone crushing 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 a student's latest struck stone 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.

Next, a flow chart (FIG. 11) of the program when the instructor sends stoned data and 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, the steps S ₁₀₀ , S ₁₀₉ , S ₁₁₁ , S ₁₁₂ marked with * are not on the side of the student. First, the processing of "waited" is made in step S _100. 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. Figure 1 shows the details of this waiting process.
This is shown in the second subroutine. FIG. 12 (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 performed the nth stone stoning. 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.

[0028] 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.

[0029] 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 ₁₃₁ , the instructor operates the cursor movement button 63 to move Shiraishi to the starting point. If button 63 is pressed down, step S
Proceed to ₁₄₅ to move the cursor. When this movement 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 temporary hit has already been made, that is, if the present temporary hit is the second temporary 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 is different from the previous temporary hit coordinate, the process proceeds to step S _{144, in} which the previous temporary hit display is erased 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 _S143 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 the cycle of steps _S132 , _S136 , _S137 , _S138 is repeated until the timer is completed. If it is determined in step _S138 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 provisional hitting mark is forcibly changed to the go stone display. To be done.

[0034] 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 is a temporary hit, the process proceeds to step S ₁₄₁ . On the other hand, if the temporary-handed yet, the process proceeds to step S _140, a buzzer sound is emitted to promote provisional beating. 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).

If the Agehama processing is performed in step S ₁₀₆ , the process proceeds to the next step S ₁₀₇ . Also, step S
Even if there is no swallowing in ₁₀₅ , the process proceeds to step S ₁₀₇ . In step _S107 , the procedure started is RA.
Stored in M. Then, in the next step _S108 , the coordinate data stored in step _S107 is converted into graphic data. Then, the next step S ₁₀₉
In, the graphic data is transferred at high speed to the video RAM. Then, in the next step _S110 , the start coordinates of the instructor are transmitted to the student, and a display indicating that it is the other party's turn, that is, the student's turn is displayed on the screen of the display device of the instructor terminal. For example, a display indicating that the leader's stoning has been completed is displayed.

[0037] After step S _110, in step S _111, it is determined whether there is a screen switching request from the student. When the screen switching request has been made, the process proceeds to step S _112, the oldest recipient, that is, the most early screen switching request student graphic data being made is fast forwarded to Biteo RAM. Also, the situation of the student is displayed on the display device according to the video data of the video RAM. Then, in the next step _S113 , a start buzzer sound is generated to indicate that the trainee's start has already been completed. Then, in the next step _S114 , the cursor control described in FIG. 10 is performed, and then the process returns to the original. Note that the steps marked with * in FIG. 11, that is, the steps S ₁₀₉ , S ₁₁₁ , and S ₁₁₂ exist only in the terminal program on the instructor side, and do not exist in the terminal program on the learner side. Is.

From the start of the game to the end of the game, the program is performed according to the above-mentioned program. At the end of the game, the following procedure is generally required. 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 only on the instructor's terminal. In other words, the instruction is given 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 the formation is calculated at the end of the game 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 of the present embodiment, all blocks can be designated automatically by designating the stone of one coordinate for the block 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 [0042] 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 used as the search coordinates. In this embodiment, Shiraishi a,
That is, the white stone a whose coordinates (X, Y) are (6, 2) is set as the designated stone, that is, the search stone. Next, in step S ₁₅₁ , the stones around the coordinates of the search stone a are determined. That is, the four stones on the right, bottom, left, and top in the figure of the search cue coordinates are the same stones as the search stones, or blank, or the partner stone, that is, the black stone, or the edge of the board. To determine. Then, in the next step S ₁₅₂ , only when the surrounding stone is blank or the same stone, the blank coordinates and the same stone coordinates are temporarily stored. On the other hand, when the judgment in step _S151 is the opponent stone, that is, the black stone and the edge of the board, the process proceeds to step _S153 . In this embodiment, the white shiraishi (7, 2) on the right and the white shiraishi on the left
(5, 2) and the blank coordinates (6, 1) above are temporarily stored.

Then, in the next step _S153 , it is determined whether or not the stone of the search coordinates is blank or the stone. If it is blank, the process proceeds to step _S156 , and if it is the same stone, the process proceeds to step _S154 . In step _S154 , it is determined whether or not the first stage safety designation is completed. That is, the procedure for specifying this security is
Only when the first specified stone is the first search stone and the stones around the stone are the same stone or blank, the surrounding stones or blanks are sequentially set as the search stone or the search coordinates, respectively. The search is repeated. Therefore, while all the searches for the temporarily stored stones or blanks are not completed, the process proceeds to step _S155 . Step S
_{In 155} , the temporarily stored coordinates of the stone are set as new search coordinates, and the process returns to step S ₁₅₁ again, and is continued until the first stage of safety designation is completed. Now, for example, if the search coordinate is the position of Seki A ₁ , that is, the coordinates (6,1) or the position of Seki A ₂ , that is, the coordinates (3,1), it is determined to be blank in step S ₁₅₃ . Then, in the next step S ₁₅₆ , it is determined whether or not the blank is already marked. 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, to change 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 determines whether the stone around the search coordinates (6,1) in step S ₁₅₁ as in step S ₁₅₉ is stone than or partner ore with whom stones To be done. If the determination in step S ₁₅₉ is it is determined that the Shiraishi That other party ore proceeds to step S _154. On the other hand, if it is determined in step _S159 that the stone is the partner stone, that is, the black stone, the coordinates of the partner stone, that is, the coordinates of the black stone are set as the next search coordinates. When the process of step _S160 ends, the process proceeds to step _S154 . That is, the stone, the black stones of words coordinates (4,1) of Shiraishi, coordinate black stones and coordinates (3,2) (2,1) is stored as the next search coordinates in step S ₁₆₀ around the blank coordinates b . Then, from step _S161 to the second
The step search starts. That is, in step S ₁₆₁ , the partner stone, that is, the black stone of the coordinate (3, 2) is designated as the search stone, and the coordinate (3, 2) is set as the search coordinate. Then, the program of step S ₁₆₂ and thereafter is executed. The steps S ₁₆₂ to S ₁₆₉ are the same as the above-mentioned step S _151.
To S ₁₅₉ are substantially the same. In this way, the remaining seki A ₃ is marked with a seki mark. These sex marks displayed on the instructor side terminal are also transmitted to the student side terminal, and similar marks are displayed on the student side display device.

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.
(I) shows a state in which dead stones of a total of five blocks a, b, c, d, and e are marked with a dead stone mark (II).
Indicates a state in which all dead stones have been 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 only on the leader side terminal. That is, the dead stone is designated by the leader.

First, in step S ₁₈₀ , one of the dead stones in one block is designated and the designated stone is set as the search coordinate. In the present embodiment, it is assumed that one dead stone f in the block d is now the designated stone. Then, the next step S ₁₈₁
In, it is determined whether the search coordinates, that is, the stone at the lower right and the upper left of the dead stone f, is a partner stone, that is, a white stone, or a blank or the same stone, that is, a black stone. Then, the next step S ₁₈₂
At, the blank coordinates and the same stone coordinates are temporarily stored. Therefore, if the coordinate of the designated stone f is (10, 16), the coordinates (10, 17), (9, 16), (10,
The three coordinates of 15) will be temporarily stored. On the other hand, if it is determined in step _S181 that the surrounding stone is a partner stone, that is, a white stone, the process proceeds to step _S183 . In the present embodiment, the white stone to the right of the designated stone f corresponds to that.

In the next step _S183 , it is determined whether or not the stone of 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 _S182 , it is determined whether or not all searches for the next candidate search stone temporarily stored have 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. When all the searches in the block d are completed, it is determined to be completed in step _S185 , and the dead stone designation flowchart 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. In addition,
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 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 are 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, and the process proceeds to the 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 the 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 excluding the spoilers without performing the spoilers in a special step.

As for the winning / losing calculation method, a program is stored in advance in the ROM of each terminal. 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

[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.

[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 / pushphone 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 blasting / selection button 62 Confirmation button 63 Cursor movement button

─────────────────────────────────────────────────── ───

[Procedure amendment]

[Submission date] January 13, 1993

[Procedure Amendment 1]

[Document name to be amended] Statement

[Name of item to be amended] Claims

[Correction method] Change

[Correction content]

[Claims]

[Procedure Amendment 2]

[Document name to be amended] Statement

[Name of item to be corrected] 0005

[Correction method] Change

[Correction content]

That is, this multi-faced teaching game communication system is provided with one instructor terminal device and a plurality of student terminal devices, one of which is connected to the instructor terminal device by a communication line, and the other of which is connected to the instructor terminal device. A relay device that is connected to each student terminal device by a communication line, and receives student transmission data such as personal information data and pebbles data from each student terminal device, and stores the data at one time While being transmitted to the instructor terminal device, a relay device that distributes instructor transmission data such as stoning data from the instructor terminal device to each student data and transmits to each student terminal device . The instructor terminal device stores, for each student, a data storage area for each student, which stores student transmission data, input data such as instructor stone data, and graphic data obtained by converting those data by a conversion means. And a storage means having a storage area for storing commentary registration data, and the student transmission data from the relay device is divided into data for each student and transferred to each student-specific data storage area of the storage means. Distribution means for transmitting the instructor input data to the relay device, game display means for displaying the graphic data stored in the storage means and the new input data of the instructor, and the instructor's gravel data, commentary data, etc. Input means for inputting data, starting point display means for displaying the latest starting point of each student, and one starting point data which the instructor has started for one student. It is characterized in that it comprises a switching means for switching the display screen of the unit to an opposite station screen palliative time longest student.

[Procedure 3]

[Document name to be amended] Statement

[Correction target item name] 0006

[Correction method] Change

[Correction content]

According to the above construction, one instructor can make multiple hits against a plurality of trainees. Also,
According to the above configuration, in the instructor terminal device, the storage means has means for converting the student transmission data and the instructor input data into graphic data. When the game screen is switched, the phase data is prepared in advance as graphic data, so that data, that is, for example, the line pattern of the board and the stones that have been stoned can be instantly displayed on the display means. Therefore, the instructor can quickly respond to the game with the switched student. Also, in the case of multiple hits, the instructor needs to search for the latest starting point of the student every time the student screen switches, but since the starting point display means is provided, it is extremely easy to recognize the latest starting point. Therefore, it is possible to efficiently carry out multiple strikes. Further, since a means for switching the game screen is provided, when the start and transmission of one student are completed, the game screen of the next student is automatically switched to, in cooperation with the graphic data conversion means. Instructors can instantly start a game with the next student. As mentioned above, the system of the present invention is well suited for multiple strikes.

[Procedure amendment 4]

[Document name to be amended] Statement

[Correction target item name] 0007

[Correction method] Change

[Correction content]

Although a communication means such as a telephone line is usually used in the above structure, it is also possible to perform the system having the above structure in one venue by using serial communication. In addition, if the telephone line is used, the packet communication makes the communication charge very low. This packet communication is most suitable for games such as Go and Shogi where it takes a long time to complete the game, but it takes only a short time to send the stoned data for each move. Further, when using a telephone line or the like, there is an advantage that the number of lines on the instructor side is sufficient. Furthermore, when operating this system for commercial or non-commercial purposes, the operator can accurately grasp the total usage status of the system at the relay station.

[Procedure Amendment 5]

[Document name to be amended] Statement

[Correction target item name] 0012

[Correction method] Change

[Correction content]

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.

[Procedure correction 6]

[Document name to be amended] Statement

[Name of item to be corrected] 0025

[Correction method] Change

[Correction content]

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. Figure 8 (I) again
Returning to FIG. 7, the leader side terminal makes a screen switching request in step S ₉ after completion of step S ₆ .

[Procedure Amendment 7]

[Document name to be amended] Statement

[Correction target item name] 0034

[Correction method] Change

[Correction content]

[0034] 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.

[Procedure Amendment 8]

[Document name to be amended] Statement

[Name of item to be corrected] 0037

[Correction method] Change

[Correction content]

[0037] After step S _110, in step S _111, the screen switching request from each student, namely,
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 Biteo RAM Is done. Also, the video R
The aspect of the student is displayed on the display device according to the video data of AM. Then, in the next step _S113 , a start buzzer sound is generated to indicate that the trainee's start has already been completed. Then, in the next step _S114 , the cursor control described in FIG. 10 is performed, and then the process returns to the original. Note that the steps marked with * in FIG. 11, that is, the steps S ₁₀₉ , S ₁₁₁ , and S ₁₁₂ exist only in the terminal program on the instructor side, and do not exist in the terminal program on the student side. Is.

[Procedure Amendment 9]

[Document name to be amended] Statement

[Correction target item name] 0040

[Correction method] Change

[Correction content]

Conventionally, when the formation is calculated at the end of the game 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.

[Procedure Amendment 10]

[Document name to be corrected] Drawing

[Name of item to be corrected] Fig. 21

[Correction method] Change

[Correction content]

FIG. 21

─────────────────────────────────────────────────── ─── Continuation of the front page (51) Int.Cl. ⁵ Identification code Internal reference number FI Technical display location A63F 3/02 522 E 8403-2C G09B 5/08 7517-2C H04M 11/00 303 7470-5K

Claims (1)

[Claims] 1. An instructor terminal device (1) and a plurality of student terminal devices (2a, 2b), which are connected to the instructor terminal device (1) by a communication line, On the other hand, a relay device (3) connected to each student terminal device (2a, 2b) by a communication line, and each student terminal device (2a, 2b).
The student transmission data such as personal information data and pebbles data from 2b) are received and stored at once and transmitted to the instructor terminal device (1) sequentially, while the instructor terminal device (1) It is equipped with a relay device (3) that distributes instructor transmission data such as gravel data to each student data and transmits it to each student terminal device (2a, 2b). 4) is a data storage area for each student, which stores, for each student, the student transmission data, the input data such as the instructor's stoning data, and the graphic data obtained by converting those data by the conversion means. Storage means (15) having a storage area for storing the sentence registration data, and student transmission data from the relay device (3) is distributed to each student's data and stored in each student's data storage area of the storage means. While transferring, send the teacher input data to the relay device (3) Distributing means, display means (18) for displaying the graphic data stored in the storage means (15) and newly input data of the instructor, and input means for inputting data such as instructor's gravel data and commentary data (22) A multi-faced teaching game communication system comprising: