JP3984643B2 - Synchronous communication method and synchronous communication apparatus - Google Patents

Abstract

A synchronous communication device for processing communication synchronously among a plurality of information terminals connected to a communication line, comprising: judging means for judging whether or not the plurality of information terminals connected to the communication line are in a normal communication state; input information setting means for, when on the basis of the result from the judging means judgment is made that an anomaly has occurred in at least one information terminal among the plurality of terminals and that synchronization of the one information terminal with another information terminal among the plurality of terminals is not possible, setting as assumed input information the input information of the synchronization immediately prior to the synchronization in which synchronization is not possible; and computing means for, on the basis of the assumed input information set by the input information setting means, determining the synchronization state of the synchronization in which synchronization is not possible, by executing a predetermined computing process; wherein each process is repeated until the judging means judges that synchronization with the other information terminal among the plurality of information terminals becomes possible through recovery of the communication state of the information terminal in which the anomaly has occurred.

Description

  The present invention relates to a synchronous communication apparatus and a synchronous communication method for performing communication processing while synchronizing a plurality of information processing terminals connected by a communication line.

  As a conventional synchronous communication device, for example, a NES communication system as described in Japanese Patent Laid-Open No. 02-041190 is known. This NES communication system performs communication between at least two NES connected via a communication line, and includes means for correcting a time lag of data input from an input unit of each NES, and repeatedly The generated number code is sent to the counterpart device in synchronization with the key scan pulse, and the counterpart is configured to correct the time lag using the number code.

FIG. 16 is a timing chart for explaining the timing of data in the NES communication system. The operation of the NES communication system will be described below with reference to FIG.
In FIG. 16, (a) and (b) show key scan pulses generated from each NES, and the state of the keypad is taken into the NES as data by these key scan pulses (a) and (b). When a communication adapter is used, as shown in (c) and (d), a delay corresponding to the time between times t1 to t2 and t3 to t4 occurs when data is sent to the other modem. In order to play a game with two NES at the same time, it is necessary that the order of a pair of data indicated by m and n in the drawing is correctly sent to the NES. That is, it is necessary that the player data captured at the time of the m pulse and the opponent data captured at the time of the n pulse are input as the data of each NES in the correct order.

In FIG. 16, data is input from one to the other NES at the time of n + 3 pulse due to communication delay, and data is input from the other to the NES at the time of m + 3 pulse. For example, if data fetched at the timing of m and n is delayed until the timing of m + 3 and n + 3, the data sent to both NES becomes a pair of data delayed by 3 pulses.
Since the power supplies of both NESs are not always turned on at the same time, the time difference between m and n changes by one pulse at maximum. For this reason, assuming that there are N pulses, as shown in FIG. 1, the data at m is sent to the other party at N + 2. However, the data at N cannot reach until it reaches m + 4. If data is sent to the NES in this state, the necessary data cannot be received when necessary, and the two NES perform different operations. As is apparent from the above, the delay occurring between the NES is the sum of the data communication delay and the key scan pulse delay.

Here, the delay in data communication is relatively constant because it depends on hardware and communication speed. However, the delay of the key scan pulse changes depending on the timing at which the device is operated, and gradually changes due to the phase difference between the key scan pulses in the two devices. In order to correct this, a number code repeatedly generated in synchronization with the key scan pulse is sent to the other party. The side receiving the number code sends out its own data in synchronization with the contents of this number code.
In order to detect a delay and send data in synchronization, the other party's number code and own number code are stored, and a timer is operated. Next, when the timer is stopped at its own scan pulse, the delay from the input of the partner's data to the occurrence of its own scan pulse is measured. This operation is performed several times to obtain an average value. The delay is correctly detected by comparing the average value with a preset numerical value.

The variable shift register is necessary for delaying the key data taken by itself by several pulses. For example, when sending m-pulse data to the NES with m + 3, a three-stage shift register is required. The number of pulses to be delayed needs to be variable in order to follow the fluctuating key scan pulse.
In short, the NES communication system is configured to prevent a decrease in processing speed due to a communication delay by using information input at the Nth synchronization for information processing at the N + m (m> 0 integer) synchronization. Has been.

  However, in the above-mentioned NES communication system, when input information cannot be received from a partner within a predetermined time, it is necessary to wait until the information is received. It gives a sense of incongruity to users who use NES communication systems. In particular, when a communication line such as the Internet whose communication quality is not guaranteed is used, there is a problem that a suspension may be caused every few seconds, and the commercial value of the system is remarkably impaired.

  The present invention has been made in view of the problems in the above-described conventional NES communication system. Even when input information from the other party cannot be received within a predetermined time, the synchronization processing is not temporarily stopped. It is an object of the present invention to provide a synchronous communication method and a synchronous communication apparatus that can advance the synchronization process.

  The above-described problem of the present invention is a synchronous communication device that performs communication processing while synchronizing a plurality of information terminals connected to a communication line, and the plurality of information terminals connected to the communication circuit are in normal communication. Determining means for determining whether or not the communication state of at least one information terminal of the plurality of information terminals has occurred due to a result of the determination means, and other information terminals of the plurality of information terminals When it is determined that the synchronization is not established, the input information setting means for setting the input information of the synchronization immediately before the synchronization that cannot be synchronized as the input information is set, and the input information setting means Calculation means for executing a predetermined calculation process based on the assumed input information to obtain the synchronization state of the synchronization at which the synchronization cannot be established, and the determination means determines the communication state of the information terminal in which the abnormality has occurred. The other information terminal and synchronization of the plurality of information terminals until it is determined that take, is achieved by the synchronous communication device and repeating said each processed.

  The above-mentioned problem of the present invention is a synchronous communication method for performing communication processing while synchronizing a plurality of information terminals connected to a communication line, wherein the plurality of information terminals connected to the communication circuit are in normal communication. Determining whether it is in a state and a result of the determination, an abnormality occurs in a communication state of at least one information terminal of the plurality of information terminals, and synchronization with other information terminals of the plurality of information terminals is performed. If it is determined that the input is not taken, the step of setting the input information of the synchronization immediately before the synchronization that cannot be taken as the assumed input information, and a predetermined calculation process based on the set assumed input information To obtain the synchronization state of the synchronization at which the synchronization cannot be achieved, and until the communication state of the information terminal in which the abnormality has occurred is recovered and synchronization with the other information terminals of the plurality of information terminals is achieved. Stage It is achieved by the synchronous communication method characterized by comprising the steps of repeating.

  According to the synchronous communication device of the present invention, with the above configuration, the synchronization process can be executed even if the input information from the other party cannot be received within a predetermined time, so the synchronization process can be performed without pausing the synchronization process. The effect that can be advanced.

  Similarly, according to the synchronous communication method of the present invention, the synchronization process can be executed even if the input information from the other party cannot be received within a predetermined time according to the above steps, so that the synchronization process is not temporarily stopped. There is an effect that the synchronization process can be advanced.

  In the synchronous communication device of the present invention, the calculation means may be configured to execute a calculation process for obtaining a synchronized state of the game at the synchronization stage where the synchronization cannot be established as the predetermined calculation process.

  In the synchronous communication apparatus of the present invention, the calculation means may be configured to return the information terminal to a backup of the synchronization state.

  In the synchronous communication device of the present invention, even if the input information is regarded as input information and continues to be set, if the determination unit determines that it is impossible to align all the information terminals in the same synchronization state, The computing means may be configured to return the information terminal to a backup of the synchronization state.

  In the synchronous communication device of the present invention, the arithmetic means stores the actual input information while using the deemed input information, and when the normal synchronization processing is resumed, the calculated information is stored as the input information. An arbitrary number may be used by skipping.

  In the synchronous communication device of the present invention, the calculation process may be any one of a calculation of a game character position, a hit determination, or a score calculation, or a combination of two or more.

  In the synchronous communication device according to the present invention, the input information setting means regards input information of any synchronization before the synchronization that cannot be synchronized as input information instead of synchronization input information that cannot be synchronized. You may comprise so that it may set.

  In the synchronous communication method of the present invention, the step of calculating may be configured to execute, as the predetermined calculation process, a calculation process for obtaining a synchronized state of the game at the synchronization stage where the synchronization cannot be established.

  In the synchronous communication method of the present invention, the step of calculating may be configured to return the information terminal to a backup of the synchronization state.

  In the synchronous communication method of the present invention, if it is determined that it is impossible to align all the information terminals in the same synchronization state in the determination step even if the input information is regarded as input information and is continuously set, The calculating means may be configured to return the information terminal to a backup of the synchronization state.

  In the synchronous communication method of the present invention, the calculating step stores the actual input information while using the deemed input information, and stores the stored information as input information when normal synchronization processing is resumed. Any number may be skipped and used.

  In the synchronous communication method of the present invention, the calculation process may be any one of a game character position calculation, a hit determination, or a score calculation, or a combination of two or more.

  In the synchronous communication method of the present invention, in the step of setting the input information, the input information of any arbitrary synchronization prior to the synchronization that cannot be synchronized is regarded as input instead of the synchronization input information that cannot be synchronized. You may comprise so that it may set as information.

Hereinafter, preferred embodiments of a synchronous communication method and a synchronous communication device according to the present invention will be described with reference to the accompanying drawings.
FIG. 1 is a schematic block diagram showing a configuration of a synchronous communication game system of a form in which a plurality of users participate simultaneously as an embodiment of a synchronous communication apparatus according to the present invention.

  The synchronous communication game system 1 shown in FIG. 1 is connected to the synchronous server 10 that is a determination unit that plays a role as a server in order to perform synchronous communication processing, and data communication between the synchronous server 10 and the information terminal 30 The communication network 20 is a communication line for performing the game, and the information terminal 30 includes two information terminals 30a and 30b that are configured to input and output predetermined data and are arranged on the game participant side.

  In this embodiment, the information terminal 30 includes two information terminals 30a and 30b. However, the present invention is not limited to these, and three or more information terminals 30a to 30N (N = c -Z). Here, for simplification, the case of two terminal devices 30a and 30b will be described.

The synchronous communication game system 1 in FIG. 1 allows game participants to exchange information with each other by connecting their information terminals 30a and 30b to the synchronous server 10 via the communication network 20. It is configured.
The information terminals 30a and 30b are external information input units 40a and 40b that constitute a part of the input information setting means, and a synchronization that constitutes a part of the input information setting means that serves as a client in order to perform synchronous communication processing. Clients 50a and 50b, calculation units 60a and 60b, which are calculation means, and information output units 70a and 70b are configured.
Hereinafter, when the synchronous clients 50a and 50b are collectively referred to, they are simply expressed as the synchronous client 50. Similarly, the calculation units 60a and 60b are also simply referred to as the calculation unit 60 below when collectively called.
In addition, the steps related to the synchronization client 50a and the calculation unit 50a are represented as SXXXa (XXXX is an arbitrary numerical value), and the steps related to the synchronization client 50b and the calculation unit 50b are expressed as SXXXXb (XXXX is an arbitrary numerical value). When calling both together without distinguishing, both a and b at the end are omitted and expressed as SXXX (XXXX is an arbitrary numerical value).

Next, with reference to FIG. 2, an operation when the game is actually performed in the synchronous communication game system 1 shown in FIG. 1 will be described. As a premise, it is assumed that the Nth synchronization process is executed from now.
First, the synchronization client 50a of the information terminal 30a acquires the input information a_N that has been input to the external information input unit 40a by the game participant (step S0000a).

  The synchronization client 50a transmits the input information a_N to the synchronization server 10 (step S0001a). The synchronization server 10 that has received the input information a_N transmits the input information a_N to all the synchronization clients 50 of the opponents, in this embodiment, only the synchronization client 50b (step S0002a).

Similarly, the synchronization client 50b of the information terminal 30b acquires the input information b_N input to the external information input unit 50b by the game participant (step S0000b) and transmits it to the synchronization server 10 (step S0001b). The input information b_N received by the synchronization server 10 is transmitted to the synchronization client 50a (step S0002b).
The synchronization client 50a receives the input information b_N transmitted from the synchronization server 10 (step S0003a), and prepares input information for the Nth synchronization, that is, input information a_N and input information b_N (hereinafter referred to as input information INa_N). be able to.

Similarly, the synchronization client 50b can receive the input information a_N (step S0003b), and can align input information of the Nth synchronization, that is, input information a_N and input information b_N (hereinafter, referred to as input information INb_N). Here, the input information INa_N = input information INb_N. When the input information of the Nth synchronization in the two synchronization clients 50a and 50b is equal in this way, the input information IN_N will be representatively represented below.
In this way, the input information IN_N of all the information terminals 30a and 30b necessary for performing the N-th synchronization process can be shared by the respective synchronization clients 50a and 50b.

  Next, the synchronization client 50a transfers the input information IN_N to the calculation unit 60a (Step S0004a). The computing unit 60a performs arithmetic processing based on the input information IN_N and the synchronization state Sa_N-1 of the immediately previous game in the information terminal 30a, and calculates the synchronization state Sa_N of the Nth synchronization game (step S0005a). The synchronization state Sa_N is displayed by the information output unit 70a.

  Similarly, the synchronization client 50b also performs arithmetic processing based on the input information IN_N and the previous game synchronization state Sb_N-1 in the information terminal 30b, and calculates the Nth game synchronization state Sb_N. The synchronization state Sb_N is displayed by the information output unit 70b.

  Here, if the synchronization state Sa_N-1 = synchronization state Sb_N-1, since the input information INa_N = input information INb_N, the synchronization state Sa_N = synchronization state Sb_N (in this way, the synchronization state of the Nth synchronization is equal) Hereinafter, it is represented as a representative synchronization state S_N).

In this way, the information terminals 30a and 30b can share the same synchronization state by sharing the same input information.
The synchronization clients 50a and 50b advance the number N of synchronizations to N + 1 and repeat the next synchronization processing (steps S0000a to S0000b) in the same manner. As long as the same input information continues to be shared by both the synchronization clients 50a and 50b, the same synchronization state is shared.

Next, the operation when the communication state between the synchronization client 50a and the synchronization server 10 temporarily deteriorates during the game will be described with reference to FIG.
Here, it is assumed that communication between the synchronization client 50a and the synchronization server 10 has deteriorated. At this time, the synchronization client 50a cannot transmit the input information a_N to the synchronization server 10 within a predetermined time (step S0101a).

  When the conventional technique is used, information from the other party cannot be received, and the synchronization process is temporarily stopped until the communication state is recovered and information from the other party is received. For this reason, the movement of the screen suddenly stops in the middle of the game, which gives the game user a sense of incongruity and causes a significant reduction in the product value of the game. In the following description of the present embodiment, a method of proceeding without causing such a temporary stop will be described.

  The subsequent processing is processing that prevents the above-described pause, but it is noted that the synchronization client 50a continues resending processing until input information a_N is successfully transmitted to the server 10 during this time. Further, the number of times of synchronization N at this time is expressed as W below in order to distinguish from the number of times of synchronization N that is generally used.

  Since the synchronization client 50a cannot transmit the input information a_W within a predetermined time, the synchronization client 50a determines that the communication state has deteriorated. For this reason, after this, the process which avoids that a synchronous process is suspended temporarily by the deterioration of a communication state is performed. Specifically, first, it is attempted to transmit to the synchronization server 10 that the normal processing has been performed up to the W-1th synchronization (step S0107a). Since the communication state is actually bad, the retransmission process is continued until transmission is possible (step S0107a). As described above, the following process is performed in parallel. In addition, unless otherwise specified, when a retransmission process (or reception waiting process) is performed because information cannot be transmitted / received due to a poor communication state, subsequent processes are performed in parallel with the retransmission process, etc. And

On the other hand, the synchronization client 50b transmits the input information b_W to the synchronization server 10 (step S0101b). The synchronization server 10 transmits the received input information b_W to the synchronization client 50a. Since the communication state is actually poor, the retransmission process is continued until transmission is possible (step S0102b). The synchronization client 50b cannot receive the input information a_W within a predetermined time because the communication state on the information terminal 30a side is poor (step S0103b). The synchronization client 50b determines that the communication state has deteriorated, and enters the process of avoiding the temporary stop while maintaining the reception waiting state as described above. The synchronization client 50b transmits to the synchronization server 10 that it has been processed normally up to the W-1th synchronization (step S0104b).
The synchronization server 10 receives that the synchronization client 50b has successfully processed until the W-1th synchronization (step S0105b).

  Next, the operation following FIG. 3 will be described with reference to FIG. The synchronization client 50a notifies the computing unit 60a that the communication state has deteriorated (step S0201a). The computing unit 60a backs up the synchronization state S_W-1 of the immediately previous game currently held (step S0202a).

  The synchronization client 50a cannot create the input information INa_W due to the deterioration of the communication state. Therefore, instead, the immediately preceding input information (= INa_W−1 = IN_W−1) is passed to the computing unit 60a as “deemed input information” (step S0203a). The arithmetic unit 60a performs arithmetic processing based on the assumed input information IN_W-1 received instead of the regular input information, and calculates the game synchronization state at the W-th synchronization (step S0204a). The synchronization state Sa_W calculated here is a “provisional” value on the information terminal 30a side because it is calculated using “deemed input information”. The synchronization client 50a advances the number of synchronizations W to W + 1 and repeats the next temporary synchronization process (steps S0203a ~) in the same manner. That is, the calculation of the “provisional” N-th synchronization state Sa_N is repeated using the deemed input information IN_W−1. In this way, even if the communication state temporarily deteriorates, the synchronization process can be continued without pausing.

  Similarly, the synchronization client 50b notifies the deterioration of the communication state (step S0201b), performs the backup of the synchronization state (step S0202b), and repeats the provisional synchronization process using “deemed input information” (steps S0203b˜). ). These repetitions are performed until the communication state is recovered.

Hereinafter, the operation after the communication state is recovered will be described with reference to FIGS.
As the communication state is recovered, the information “successfully processed until the W-1th synchronization on the information terminal 30a side” transmitted in step S0101a in FIG. 3 reaches the synchronization server 10 (step S0301a).
The synchronization server 10 determines whether the number of synchronizations normally performed by all the synchronization clients 50 is the same number (step S0302). In the case of the present embodiment, the synchronization processing is normally performed up to the W-1th synchronization in all the synchronization clients 50, and the provisional synchronization processing using “deemed input” is performed from the Wth synchronization. Assume that the number of synchronizations performed is the same. In such a case, it is guaranteed that the same input information has been passed to all the synchronization clients 50 (that is, input information INa_N = input information INb_N), and the synchronization state is the same. (That is, synchronization state Sa_N = synchronization state Sb_N) is guaranteed.
For this reason, if the normal synchronization processing is resumed after all the synchronization clients 50 have the same number of synchronizations, the synchronization state in all the synchronization clients 50 is kept the same. For this reason, it aims at making the frequency | count of synchronization the same in all the synchronous clients 50 in subsequent processes.

The synchronization server 10 notifies all the synchronization clients 50 that the communication has been recovered (step S0303). Thereafter, one communication is performed between the synchronization client 50 and the synchronization server 10 (specifically, from step S0305 to step S0505), but the number of synchronization processes required during the communication is notified ( Step S0303). This number is estimated based on the communication time that has been performed between the server and the client. For example, if it takes 70 ms for one communication and 32 ms for one synchronization process, 70 ÷ 32 = 2 remainder 6 and the required number of synchronizations is 2 + 1 = 3. In this embodiment, the number of times is K.
Further, it is transmitted how many times the partner synchronization client 50 has performed the synchronization process normally and how many times the partner synchronization client 50 has transmitted its own synchronization information (step S0303).

  When the communication recovery notification is received from the synchronization server 10, the number of temporary synchronization processes performed in the synchronization client 50a is M. Similarly, the number of temporary synchronization processes performed in the synchronization client 50b is L. The synchronization client 50a receives a communication recovery notification from the synchronization server 10 (step S0304a), and returns the number of synchronizations (= W + M−1) for which the current processing has been completed to the synchronization server 10 (step S0305a). Similarly, the synchronization client 50b also receives communication recovery from the synchronization server 10 (step S0304b), and returns the number of synchronizations (= W + L-1) for which processing is currently completed to the synchronization server 10 (step S0305b). The synchronization server 10 receives the number of synchronizations for which processing is currently completed from all the clients 50 (step S0306).

In addition, each synchronization client 50 receives how many times the partner has transmitted its synchronization information in step S0304. Therefore, each synchronization client 50 can know how many pieces of information that the other party has sent to itself have not yet been received. Specifically, the synchronization client 50a has not received the input information b_W, and the synchronization client 50b has not received the input information a_W. As the communication state is recovered, the synchronization client 50a can receive the input information b_W (step S0403a). Similarly, when the communication state is recovered, the synchronization server 10 can receive the input information a_W (step S0402a).
Receiving the input information a_W, the synchronization server 10 transmits the input information a_W to the synchronization client 50b (step S0402a). The synchronization client 50b receives the input information a_W (step S0403b). In addition, since it is not necessary to wait for these processes to be completed, it should be noted that the following processes are performed in parallel. The a_W and b_W received here are discarded because they do not need to be held.

  Until the notification from the synchronization server 10 (step S0505a), the synchronization client 50a continues to execute and display the temporary synchronization process using the assumed input information INa (steps S0501a and S0502a), and the synchronization process is temporarily stopped. prevent. The same applies to the synchronization client 50b (steps S0501b and S0502b). During this time, the following processing is performed in parallel on the synchronization server 10 side.

  In order to eliminate the difference in the number of received synchronizations (= LM), the synchronization server 10 calculates how many times each synchronization client 50 should perform the synchronization processing thereafter (how many times) Step S0503). For example, when the number of times transmitted by the synchronization client 50a is 1036 times and the number of times transmitted by the synchronization client 50b is 1039 times, the difference is three times. In the synchronization client 50a, one synchronization process is performed nine times at a speed of 32 ms, while in the synchronization client 50b, if one synchronization process is performed six times at a speed of 48 ms, the number of synchronizations and the synchronization state in both synchronization clients 50 are Finally, they coincide at the same time (= 288 ms later).

  The synchronization server 10 notifies the calculated synchronization processing speed and number of times to each synchronization client 50 (step S0504). During this time, as described above, the synchronization client 50 repeats the temporary synchronization processing using the assumed input information INa so that the synchronization processing does not stop (steps S0501 and S0502). Further, the notification from the synchronization server 10 is performed within the number of synchronizations (= K times) calculated in step S0303. If the notification from the synchronization server 10 cannot be received within K times, the process is suspended until it can be received, so K needs to be sufficiently large.

  The synchronization client 50a receives from the synchronization server 10 the synchronization processing speed and provisional synchronization processing count (= J times) necessary to match the synchronization count with the synchronization client 50b (step S0505a). The synchronization client 50a ends the K temporary synchronization processes at a normal speed (steps S0506 and S0507), and then repeats the J temporary synchronization processes according to the synchronization processing speed received from the synchronization server 10 (steps S0601a and S0601a). Step S0602a).

  Similarly, the synchronization client 50b receives the synchronization processing speed and the number of temporary synchronization processes (= J−L + M times) from the synchronization server 10 (step S0505b). Similarly, the synchronization client 50b ends the K temporary synchronization processes at a normal speed, and then repeats the JL + M temporary synchronization processes according to the synchronization processing speed received from the synchronization server 10 (steps S0601b and S0602b). ).

At this time, the number of synchronization processes in the synchronization client 50a is (W-1) + M + K + J times. Further, the number of synchronization processes in the synchronization client 50b is (W−1) + L + K + (J−L + M) times = (W−1) + M + K + J times, and the number of synchronizations in both synchronization clients 50 is equal. That is, the synchronization client 50a and the synchronization client 50b return to a state where they share the same synchronization state. Thereafter, normal synchronization processing (steps S0000a to S0006a, steps S0000b to S0006b) can be repeated.
Thereby, even when the communication state deteriorates, there is an effect that the process enters a waiting state until the other party's information is received and the process is continued without temporarily stopping the synchronization process.

Next, with reference to FIG. 9, the case where the timing at which the communication state deteriorates slightly deviates from the previous time will be described.
Here, it is assumed that the number of times of synchronization N is N = W. The synchronization client 50a transmits the input information a_W to the synchronization server 10 (step S1001a). The synchronization server 10 receives the input information a_W. This time, it is assumed that the communication state on the information terminal 30a side deteriorates after the reception of the input information a_W is completed. The synchronization server 10 transmits the received input information a_W to the synchronization client 50b (step S1002a).
Similarly, the synchronization client 50b transmits the input information b_W to the synchronization server (step S1001b). The synchronization server receives the input information b_W, but cannot transmit the input information b_W to the other party because the communication state on the information terminal 30a side has already deteriorated (step S1002b).
Since the communication state has deteriorated, the synchronization client 50a cannot receive the input information b_W within a predetermined time (step 1003a).

On the other hand, since the synchronization client 50b can receive the input information a_W (step S1003b), it can create the synchronization input information INb_W (step S1004b). The calculation unit 60b receives the synchronization input information INb_W, executes normal processing of the W synchronization, and displays the state of the W synchronization (step S1005b). For this reason, the number of synchronizations of the synchronization client 50b is advanced by one compared to the synchronization client 50a.
Subsequently, the synchronization client 50b advances the number of synchronizations to W + 1 and transmits the input information b_W + 1 to the synchronization server 10 (step S1006b). The synchronization server 10 receives the input information b_W + 1, but cannot transmit the input information b_W to the synchronization client 50a because the communication state on the information terminal 30a side is bad as in the previous time (step S1007b).
The synchronization client 50a cannot receive the input information b_W (step S1003a), and determines that the communication state has deteriorated. For this reason, a process for preventing the synchronization process from being suspended is subsequently performed. In the same manner as described above, information indicating that the normal processing has been performed until the W-1th synchronization is transmitted to the synchronization server 10 (step S1004a). Actually, since the communication state is bad, the retransmission process is continued.

On the other hand, the synchronization client 50b cannot receive the input information a_W within the predetermined time (step S1008b). Similarly, the synchronization client 50b determines that the communication state has deteriorated, and transmits to the synchronization server 10 that the normal processing has been performed until the W-th synchronization (step S1009b).
Note that the synchronization client 50a has processed normally until the W-1th synchronization, whereas the synchronization client 50b has processed normally until the Wth synchronization.
The synchronization client 50a notifies the computing unit 60a that the communication state has deteriorated (step S1101a). The computing unit 60a backs up the immediately preceding synchronization state S_W-1 (step S1102a). In order to prevent the synchronization processing from being temporarily stopped, the synchronization client 50a performs the provisional synchronization processing similarly to the previous time while using the previous synchronization input information IN_W-1 as “deemed input information” (steps S1103a and S1104a). ).

On the other hand, the synchronous client 50b similarly notifies the computing unit 60b that the communication state has deteriorated (step S1101b). The computing unit 60b backs up the immediately preceding synchronization state S_W (step S1102b). Here, it should be noted that the calculation unit 60a backs up the synchronization state when the number of synchronizations is W-1, while the calculation unit 60b backs up the synchronization state when the number of synchronizations is W. .
In order to prevent the synchronization processing from being temporarily stopped, the synchronization client 50b similarly performs provisional synchronization processing using the immediately preceding synchronization input information IN_W as “deemed input information” (steps S1103b and S1104b).
Note that the synchronous client 50a uses the synchronous input information IN_W-1 as “deemed input information”, whereas the synchronous client 50b uses the synchronous input information IN_W as “deemed input information”. To do.

Next, the case after the communication state is recovered will be described with reference to FIG.
By the recovery of the communication state, the information transmitted in step S1004a in FIG. 9 that “the information terminal 30a has been successfully processed until the W-1th synchronization” reaches the synchronization server 10 (step S1201a). The synchronization server 10 determines whether or not the number of synchronizations normally performed by all the synchronization clients is the same number (step S1202). In the case of the present embodiment, the W-1 synchronization is performed on the information terminal 30a side, whereas the information terminal 30b side is normally processed up to the W synchronization. The synchronization server 10 checks whether the synchronization input information INb_W has the same input content as the synchronization input information IN_W-1 (step S1203).

Consider a case where the synchronization input information INb_W and the synchronization input information INb_W-1 are the same. On the information terminal 30a side, after notifying the deterioration of the communication state (step S1101a), the synchronous input information INa_W-1 is continuously used as “deemed input information”. On the other hand, on the information terminal 30b side, the synchronous input information INb_W is continuously used as “deemed input information”. Here, although the number of synchronizations of “deemed input information” continued to be used on each of the information terminal 30a side and the information terminal 30b side is not equal between W−1 and W, as a result, the input information continued to be used in both. Will be the same. This is because synchronous input information INb_W = synchronous input information INb_W-1 and synchronous input information INa_W-1 = synchronous input information INb_W-1 (synchronization processing is normally performed up to the W-1th synchronization). Therefore, note that the input information is the same on both sides). Therefore, at any number of times of synchronization N, it is guaranteed that the synchronization input information INa_N = synchronization input information INb_N, and that the synchronization state Sa_N = synchronization state Sb_N.
For this reason, if the normal synchronization process is resumed after all the synchronization clients 50 have the same number of synchronizations, the synchronization state in all the clients 50 is kept the same. This situation is exactly the same as the above example (see FIG. 5), and by performing the same processing (steps S0303 to S0306 in FIGS. 7 and 8), it is possible to lead to normal synchronization processing resumption. The difference from the above is that the synchronization client 50b transmits up to the input information b_W + 1 (step S1006b) (compare step S0101b, step S1001b, and step S1006b).

Next, processing corresponding to the processing described in FIG. 6 will be described with reference to FIG.
Each synchronization client 50 receives how many times the partner has transmitted its synchronization information in step S0304. Therefore, each synchronization client 50 can know how many pieces of information that the other party has sent to itself have not yet been received. Specifically, the synchronization client 50a has not received the input information b_W and the input information b_W + 1. Further, the synchronization client 50b has not received the input information a_W + 1. In addition, the synchronization client 50a can know that the other party is waiting to receive the input information a_W + 1, but note that the input information a_W + 1 has not been transmitted yet.
As the communication state is recovered, the synchronization client 50a can receive the input information b_W (step S1303a). Subsequently, since the synchronization client 50b waits for reception of the input information a_W + 1, the synchronization client 50a transmits the input information a_W + 1 (step S1304a). The synchronization server 10 receives the input information a_W + 1 and transmits it to the other party (step S1305a). The synchronization client 50b receives the input information a_W + 1 (step S1306b). Further, the synchronization client 50a receives the input information b_W + 1 transmitted in step S1007b (step S1306a). With the above processing, all waiting states for transmission / reception can be resolved.

  Next, a process when the synchronization input information INb_W and the synchronization input information INb_W−1 are not equal in step S1203 will be described. In this case, the synchronization input information INa_N and the synchronization input information INb_N are not equal at N equal to or greater than W. That is, different input information continues to be passed in each synchronization client 50. Therefore, it is not guaranteed that the synchronization state Sa_N and the synchronization state Sb_N are equal in N greater than or equal to W. For this reason, it is necessary to resume normal synchronization processing after returning the synchronization state in each synchronization client 50 to the backed-up state immediately before the communication state deteriorates.

If the state is backed up in this state, the synchronization count of the synchronization client 50a returns to W-1 (step S1102a), whereas the synchronization count of the synchronization client 50b returns only to W (step S1102a). S1102b).
Subsequently, the synchronization client 50b returns to the reception waiting state for the input information a_W + 1 (continuation of step S1008b). In order for the input information a_W + 1 to be delivered to the synchronization client 50b, the synchronization client 50a receives the input information b_W, performs computation processing for the number of times of synchronization W, and then transmits the input information a_W + 1, which passes through the synchronization server 10. Must be transmitted to the synchronization client 50b. Since this operation takes a longer time than usual, if the synchronization client 50b fails to receive the input information a_W + 1 within a predetermined time, it is erroneously determined that the communication state has deteriorated again, and the synchronization processing is temporarily stopped. The process to prevent this will start again.
Such a state may cause a chain of temporary stop prevention processing and may result in a state in which no input processing is accepted as a result. For this reason, the following procedure is performed to resume the synchronization process after the state in which the pause prevention process is not started again.

Next, with reference to FIG. 13, a process for achieving the above object will be described.
The synchronization server 10 notifies the synchronization client 50 that the communication state has been recovered (step S1401), and notifies that the synchronization state needs to be restored to the state backed up in S1102 (step S1401).
The synchronization client 50 receives that the communication state has been recovered (step S1402), and knows that it needs to return to the backed up state.

Here, with reference to FIG. 14, the process for aligning the synchronization input information with the partner in each synchronization client 50 will be described.
The synchronization client 50a receives the input information b_W transmitted in step S1002b (step S1503a). As a result, the synchronization input information IN_W can be created, but this is backed up for later use (step S1503a).
Subsequently, the synchronization client 50a transmits the input information a_W + 1 (step S1504a). The synchronization server 10 that has received the input information a_W + 1 transmits it to the synchronization client 50b (step S1505a). The synchronization client 50b receives the input information a_W + 1 (step S1506b). As a result, the synchronization input information IN_W + 1 can be created, but this is backed up for later use (step S1506b).
Subsequently, the synchronization client 50a receives b_W + 1 transmitted in step S1007b (step S1506a). Similarly, the synchronization input information IN_W + 1 can be created, but this is also backed up for later use (step S1506a).
At this point, the input information up to the (W + 1) th synchronization can be prepared in both synchronization clients 50. Even during these processes, each synchronization client 50 performs a temporary synchronization process using “deemed input information” (step S1103a, step S1104a, step S1103b, step S1104b), thereby synchronizing. The process is prevented from being paused.
Each synchronization client 50 notifies the synchronization server 10 of completion when the creation of the synchronization input information IN_W + 1 for the (W + 1) th synchronization is completed (steps S1403a and S1403b). The synchronization server 10 receives that the creation of necessary input information has been completed from all the synchronization clients 50 (step S1404). After the synchronization server 10 returns to the backup state and returns to the normal synchronization process, the number of synchronizations can be the same at the same time if the synchronization process is performed at each synchronization client 50 at what synchronization processing speed. Is calculated (step S1405). Specifically, the difference in the number of synchronizations between the synchronization client 50a and the synchronization client 50b is one time. Accordingly, one synchronization process is performed twice at 32 ms in the synchronization client 50a, whereas if one synchronization process is performed once at 64ms in the synchronization client 50b, the number of synchronizations of both coincide after 64 ms and the synchronization state also coincides. . The synchronization server 10 notifies the calculation result to each synchronization client 50 (step S1405). The synchronization client 50 receives an instruction to return the synchronization state to the backed up state (step S1406). The synchronization client 50a returns the synchronization state to S_W-1 (step S1406a). On the other hand, the synchronization client 50b returns the synchronization state to S_W (S1406b).

Next, with reference to FIG. 15, processing until returning to normal synchronization processing will be described.
The time when the synchronization client 50 returns to the synchronization state is t = 0 ms. The synchronization client 50a executes and displays the W-th synchronization process at time t = 32 ms using the created synchronization input information IN_W (step S1503a) (steps S1601a and S1602a). Further, using the generated synchronization input information IN_W + 1 (step S1506a), the process of the W + 1th synchronization is executed and displayed at time t = 64 ms (steps S1601b and S1602b).
In this way, the number of synchronizations and the synchronization states in all the synchronization clients 50 can be made the same 64 ms after the synchronization state is restored to the backed up one. After that, by performing normal processing, the processing can be continued without temporarily stopping the synchronization processing.

Next, another synchronous processing operation using the synchronous communication game system shown in FIG. 1 will be described as a second embodiment of the present invention.
First, with reference to FIG. 17, a case will be described in which the game progresses while using the information input at the Nth synchronization in the process of N + m (where m> 0 is an integer) synchronization. In order to perform data transmission / reception between the synchronization clients 50, the synchronization server 10 performs data relay processing in the same manner as in the above-described embodiment (hereinafter also referred to as the first embodiment). The description of is omitted for the sake of simplicity.
Hereinafter, the case where m = 2 is specifically described. It is assumed that the N + 2th synchronization process is currently being performed (steps S2003a to S2003b). The synchronization client 50a uses input information IN_N (= a_N and b_N) before two synchronizations instead of using IN_N + 2 as input information. b_N is transmitted from the synchronization client 50b before two synchronizations (step S2001b). For this reason, if b_N is transmitted to the synchronization client 50a during the N-th and N + 1-th processing, the process can proceed without waiting for the reception of input information from the synchronization client 50b. The synchronization client 50a passes IN_N to the calculation unit 60a instead of passing IN_N + 2 (step S2003a). The computing unit 60a performs N + 2th synchronization processing based on IN_N (step S2004a). A similar process is performed in the synchronous client 50b. In this way, the same input information can be shared by all the synchronization clients 50, and the same synchronization state can be shared.

  Next, an operation when the communication state between the synchronization client 50a and the synchronization server 10 temporarily deteriorates during the game will be described with reference to FIG. Specifically, it is assumed that when the synchronization client 50a is trying to perform the W-th synchronization process, a_W can be transmitted, but b_W-2 cannot be received (step S2101a). . Similar to the above-described embodiment, the synchronization client 50a continues the retransmission process until it can be transmitted to the synchronization server 10 that the communication state has been successfully processed until the W-1th synchronization due to the deterioration of the communication state (step S2102a). Similarly, assuming that the communication state between the synchronization client 50b and the synchronization server 10 temporarily deteriorates, b_W can be transmitted in the synchronization client 50b as well, but a_W-2 Is assumed (step S2101b). Similar to the above-described embodiment, the synchronization client 50b continues the retransmission process until it can be transmitted to the synchronization server 10 that the communication state has been successfully processed until the W-1th synchronization due to the deterioration of the communication state (step S2102b).

  The synchronization client 50a notifies the computing unit 60a that the communication state has deteriorated (similar to step S0201a) as in the embodiment described above. Similar to the embodiment described above, the computing unit 60a backs up S_W-1 (similar to step S0202a). Similarly, the synchronization client 50b notifies the calculation unit 60b of the deterioration of the communication state (same as step S0201b), and the calculation unit 60b backs up S_W-1 (same as step S0202b). Similar to the embodiment described above, the synchronization client 50a continues to transfer IN_W-1 to the calculation unit 60a as deemed input information (similar to step S0203a). As in the above-described embodiment, the calculation unit 60a performs processing after the W-th synchronization using the assumed input information IN_W-1 (similar to step S0204a). Similar processing is performed for the synchronization client 50b and the calculation unit 60b. In this way, even when the communication state deteriorates, by performing processing using deemed input information instead of normal input information, it is possible to prevent the suspension of the synchronization processing, and the discomfort such as the screen being paused. Need not be given to the user.

  Next, processing when the communication state between the synchronization client 50a and the synchronization server 10 and the communication state between the synchronization client 50b and the synchronization server 10 are recovered will be described. As in the above-described embodiment, the information “successfully processed until the W-1th synchronization” that was being transmitted in S2102a is transmitted from the synchronization client 50a to the synchronization server 10 (similar to step S0301a). ). Similarly, information indicating that “successfully processed until the W-1th synchronization” is transmitted to the synchronization server 50b. Similar to the above-described embodiment, the synchronization server 10 checks whether the number of synchronizations normally performed in all the synchronization clients 50 is the same (same as step S0302). In the present embodiment, the number of synchronizations normally performed in all the synchronization clients 50 is the same as W-1. As in the above-described embodiment, the synchronization server 10 notifies the synchronization client 50 that communication has been recovered, and the number of synchronization processes on the synchronization client 50 side required until the next inter-server communication (the above-described embodiment). And the number of times that the synchronization client 50 of the other party has normally performed synchronization processing is transmitted (similar to step S0303).

  Each synchronization client 50 that has received the communication recovery notification notifies the synchronization server 10 of the current number of synchronizations as in the above-described embodiment, and the synchronization server 10 receives this (step S0305a, step S0305b, step Same as S0306). As in the embodiment described above, the number of temporary synchronization processes performed in the synchronization client 50a is M times, and the number of temporary synchronization processes performed in the synchronization client 50b is L times.

  Further, as in the above-described embodiment, each synchronization client 50 receives information that the other party has sent to itself that has not yet been received (similar to steps S0402a and S0403a).

  Similar to the above-described embodiment, the synchronization server 10 calculates the temporary synchronization processing count and speed in each synchronization client 50 necessary to eliminate the difference in received synchronization count (= LM) (step S0503). The same). The synchronization server 10 notifies the calculated processing speed and number of times to each synchronization client 50 (similar to step S0504), as in the above-described embodiment.

  Each synchronization client 50 can resume normal synchronization processing after performing synchronization processing using deemed input information as many times as necessary, as in the embodiment described above (same as in FIGS. 7 and 8). ). Assume that the number of synchronizations when restarting the synchronization process is V times. In the present embodiment, the input information of the Vm synchronization is used to perform the process of the V synchronization. For this reason, it is desirable that input information for the V-m, V-m + 1,. By setting in this way, in order to perform the V-th synchronization process, it is not necessary to wait for the input information of the Vm synchronization to arrive from the other party, and the next synchronization process can be performed promptly.

  Next, a processing method when only the communication state between the synchronization client 50a and the synchronization server 10 temporarily deteriorates in the case of m = 2 will be described. Specifically, it is assumed that the synchronization client 50a can transmit a_W while trying to perform the W-th synchronization process, but cannot receive b_W-2 ( Step S2201a). Similar to the above-described embodiment, the synchronization client 50a continues the retransmission process until it can be transmitted to the synchronization server 10 that it has been successfully processed until the W-1th synchronization due to the deterioration of the communication state (step S2202a). On the other hand, since the synchronization client 50b can receive up to a_W from the synchronization server 10, the process can proceed normally to the W + 2th synchronization (steps S2201b to S2206b). Since the synchronization client 50b cannot receive a_W + 1, the synchronization client 10b transmits to the synchronization server 10 that the normal processing has been performed up to the W + 2th synchronization due to the deterioration of the communication state (step S2207b).

  Similar to the embodiment described above, the synchronization client 50a notifies the computing unit 60a that the communication state has deteriorated, and the computing unit 60a backs up S_W-1 (similar to steps S1101a and S1102a). Thereafter, provisional synchronization processing is performed using the assumed input information INa_W-1 until normal synchronization processing is resumed (similar to steps S1103a and S1104a). Similarly, for the synchronization line and 50b, S_W + 2 is backed up, and provisional synchronization processing is performed using INb_W + 2 as the input information (similar to steps S1101b to S1104b).

  Next, processing when the communication state between the synchronization client 50a and the synchronization server 10 is restored will be described. The information transmitted in step S2202a reaches the synchronization server 10 (similar to step S1201a). This time, since the number of synchronizations normally performed in each synchronization client 50 is different (W−1 ≠ W + 2), it is confirmed whether INb_W + 2, INb_W + 1, INb_W, and INb_W−1 are all the same (step S1203). If all of these are the same, the same input information has been continuously passed in each calculation unit, and the synchronization state at each synchronization count is the same. Similar to the above-described embodiment, if the synchronization counts of the respective synchronization clients 50 are matched, the synchronization state can be made the same, and normal synchronization processing can be resumed. The subsequent processing is the same processing as in the above-described embodiment.

  On the other hand, if any one of INb_W + 2, INb_W + 1, INb_W, and INb_W-1 is different, different input information is passed in each sync client, and the sync state in each sync client is no longer the same. That cannot be guaranteed. For this reason, as in the embodiment described above, the synchronization server 10 notifies each synchronization client 50 that it is necessary to return the synchronization state to the backed up state (same as step S1401). Thereafter, as in the above-described embodiment, after the prepared input information is prepared and the synchronization process is performed according to the calculated processing speed, the normal synchronization process can be resumed. Similarly to the above-described embodiment, when the number of times when the synchronization process is resumed is V, Vm, V-m + 1,..., V-1 synchronization period before the synchronization process is resumed. It is desirable to keep the input information of.

Further, in the above-described embodiment, all button operations performed by the user after the start of using the deemed input information and before the normal synchronization process is resumed are ignored. To prevent this, the actual input information is saved separately while using the assumed input information, and the saved information is used as input information when normal synchronization processing is resumed. The input process performed by the user can be used without being discarded. However, if all the stored information is used, the information input by the user is always used with a delay, and the user always feels uncomfortable. In order to prevent this, for example, as shown in FIG. 20, by using one piece of stored information, the information input by the user can be used without delay, and a part of the information input by the user can be used. Can be reflected.
The skipping of input information is not limited to one skipping. For example, the input information may be used for skipping n, where n is an integer of 1 or more.
By configuring as described above, the actual input information while using the deemed input information is saved, and after n pieces of the input information are used later, all the information input by the user is discarded. Can be prevented.

Here, the outline of the above-described processing will be described collectively with reference to FIG.
The synchronous communication game system 1 shown in FIG. 1 executes a synchronization process (step S3001), checks whether a communication failure has occurred for each synchronization (step S3002), and a communication failure has occurred in step S3002. If it is determined that the current synchronization is in progress, the current normal synchronization state is backed up (step S3003). On the other hand, if it is determined in step S3002 that no communication failure has occurred, the process returns to step S3001 to execute synchronization processing.
Subsequent to step S3003, until the normal synchronization process is resumed, the previous normal input information is regarded as the input information and the provisional synchronization process is performed (step S3004). Next, it is determined whether or not the communication state has been recovered (step S3005). If it is determined in step S3005 that the communication state has been recovered and recovery has been confirmed, temporary synchronization is performed at the same synchronization time in all clients. It is determined whether or not the process has been started (step S3006). If it is determined in step S3006 that the temporary synchronization process has been started at the same synchronization time in all clients, the number of synchronizations is the same in all clients. The input information to be used later is prepared in advance (step S3007), and normal synchronization processing is resumed (step S3008). On the other hand, if it is determined in step S3006 that temporary synchronization processing has not been started at the same synchronization time in all clients, the synchronization information (including deemed input information) used by each client is the same as a result. If the result of determination in step S3009 is the same, the process in step S3007 described above is performed, and the normal process shown in step S3008 described above is performed. Resume the synchronization process. On the other hand, as a result of the determination in step S3009, if the synchronization information used by each client is not the same, input information to be used later is prepared in advance (step S3010). The synchronized state is returned to the backed up synchronized state (step S3011). Then, after returning the synchronization state to the one that was backed up, the normal synchronization processing shown in step S3008 described above is resumed.

It is a schematic block diagram which shows the structure of the synchronous communication game system of the form with which the some user participates simultaneously which is one Embodiment of the synchronous communication apparatus by this invention. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating operation | movement of the synchronous communication game system shown in FIG. It is a timing chart which shows the timing of the data by the conventional NES communication system. It is an operation | movement flowchart for demonstrating the operation | movement in another embodiment of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating the operation | movement in another embodiment of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating the operation | movement in another embodiment of the synchronous communication game system shown in FIG. It is an operation | movement flowchart for demonstrating the operation | movement in another embodiment of the synchronous communication game system shown in FIG. FIG. 21 is a flowchart for explaining an outline of operations shown in FIGS. 17 to 20; FIG.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Synchronous communication game system 10 Synchronous server 20 Communication network 30a Information terminal 30b Information terminal 40a External information input part 40b External information input part 50a Synchronous client 50b Synchronous client 60a Operation part 60b Operation part 70a Information output part 70b Information output part

Claims (12)

A synchronous communication device that performs communication processing while synchronizing between a plurality of information terminals connected to a communication line,
Determining means for determining whether or not the plurality of information terminals connected to the communication line are in a normal communication state;
When it is determined by the result of the determination means that an abnormality has occurred in the communication state of at least one information terminal of the plurality of information terminals and the information terminal is not synchronized with the other information terminals of the plurality of information terminals. The input information setting means for setting the input information of any synchronization prior to the synchronization that cannot be synchronized as input information instead of the synchronization input information that cannot be synchronized;
Calculation means for executing a predetermined calculation process based on the deemed input information set by the input information setting means to obtain the synchronization state of the synchronization that cannot be synchronized;
With
The determination means repeats the processes until it is determined that the communication state of the information terminal in which the abnormality has occurred is recovered and synchronization with the other information terminals of the plurality of information terminals is achieved. apparatus. The synchronous communication apparatus according to claim 1, wherein the arithmetic means executes arithmetic processing for obtaining a synchronized state of the game at the synchronization time when the synchronization cannot be established as the predetermined arithmetic processing. The synchronous communication apparatus according to claim 1, wherein the calculation unit returns the information terminal to a backup of the synchronization state. If the determination means determines that all the information terminals cannot be aligned in the same synchronization state even if the input information is regarded as input information, the calculation means 2. The synchronous communication apparatus according to claim 1, wherein the synchronous state is restored to a backed up one. The arithmetic means stores actual input information while using the deemed input information, and uses the stored information by skipping an arbitrary number as input information when normal synchronization processing is resumed. The synchronous communication apparatus according to claim 1. The synchronous communication apparatus according to claim 1, wherein the arithmetic processing is one or a combination of two or more of game character position calculation, hit determination, and score calculation. A synchronous communication method for performing communication processing while synchronizing multiple information terminals connected to a communication line,
Determining whether the plurality of information terminals connected to the communication line are in a normal communication state;
If it is determined that the communication state of at least one information terminal of the plurality of information terminals is abnormal and is not synchronized with the other information terminals of the plurality of information terminals, as a result of the determination, In place of the input information of the synchronization that cannot be synchronized, the step of setting the input information of any synchronization before the synchronization that cannot be synchronized as the input information,
Performing a predetermined calculation process based on the set deemed input information to obtain a synchronization state of synchronization that cannot be synchronized;
A step of repeating the steps until the communication state of the information terminal in which the abnormality has occurred is recovered and synchronization with other information terminals of the plurality of information terminals is established. The synchronous communication method according to claim 7, wherein in the calculating step, as the predetermined calculation process, a calculation process for obtaining a synchronized state of the game at a synchronization time in which the synchronization cannot be established is executed. The synchronous communication method according to claim 7, wherein in the calculating step, the information terminal is returned to a backup of the synchronization state. If it is determined that it is impossible to align all the information terminals in the same synchronization state in the determination step even if the input information is regarded as input information, the step of calculating includes the step of calculating 8. The synchronous communication method according to claim 7, wherein the information terminal is returned to a backup of the synchronization state. The computing step stores actual input information while using the deemed input information, and skips an arbitrary number of the stored information as input information when normal synchronization processing is resumed. The synchronous communication method according to claim 7, wherein: The synchronous communication method according to claim 7, wherein the arithmetic processing is one or a combination of two or more of game character position calculation, hit determination, and score calculation.

Images