JP2007260410A - Data processing method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a data processing method, in which data are almost simultaneously processed among a plurality of computer game units connected through a communication network even where communication delay occurs among the computer game units. <P>SOLUTION: In a case where a computer game is done through the network having communication delay, delay time between the game units is determined before start of the game, and counted time in the respective game units is synchronized based on it. During the game, operation data signals are processed after the longest delay time among delay time of the game units from their occurrence that is preliminarily measured. The operation data signals can thus be simultaneously processed among a plurality of game units. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a data processing method in a computer game apparatus connected via a communication network, and more particularly to a data processing method for simultaneously processing data input from one apparatus in each apparatus.

  In recent years, home computer game devices having a communication function are becoming widespread. Such a computer game device is connected to one or more other computer game devices via a network such as the Internet, so that the player of each computer game device that is distant from each other can enjoy the game of the computer game. it can.

  However, when computer game devices that are separated from each other are connected via a network such as the Internet, communication delay becomes a problem. That is, in one computer game device, operation data generated in response to a player's operation (character movement, attack action, etc.) is processed in the one computer game device and sent to another computer game device. Are transmitted and processed in the same manner. At this time, in one computer game device, operation data is processed almost instantaneously and a corresponding screen is displayed, but in another computer game device, the operation data arrives after a predetermined transmission time, Processing is then performed and the corresponding screen is displayed.

  Thus, when a communication delay occurs, the game does not proceed at the same time because the processing time of the same data differs for each computer game device. Accordingly, the player of each computer game device operates while watching different game screens at a certain time, so that the player feels uncomfortable with the operation of the opponent, and further, the game result is different for each computer game device. The disadvantage of changing.

  Accordingly, an object of the present invention is to provide a data processing method in which data is processed almost simultaneously between computer game devices even when a communication delay occurs between a plurality of computer game devices connected via a network. It is to be.

According to the present invention for achieving the above object, when a computer game is played through a network having a communication delay, the delay time between the devices is obtained before the game is started, The time to count is synchronized. While the game is in progress, the operation data signal is processed after elapse of the longest delay time among the delay times between devices measured in advance from the occurrence thereof. Thereby, the operation data signal can be processed simultaneously in a plurality of apparatuses.

In order to achieve the above object, in the present invention, for example, in a data processing method between a plurality of computer game devices connected via a communication network,
A measuring step for measuring a delay time between each of the plurality of devices;
An obtaining step for obtaining the longest of the measured delay times;
A synchronization step for synchronizing times counted by a plurality of devices;
In a plurality of devices, a data processing method is provided that includes processing steps for processing data transmitted from each device when the longest delay time elapses from the transmitted time.

  Preferably, in the above invention, the data has information on the time when it was transmitted, and when data is received, the processing step is based on the difference between the time when the data was transmitted and the time counted by itself. Recognize when the longest time has elapsed.

More preferably, in the above invention, the synchronization step includes a transmission step of transmitting a count value of one device from one device of the plurality of devices to another device;
In another apparatus, a stop step for temporarily stopping the count-up is provided so that a difference between the own count value and the received count value becomes a delay time with respect to the one apparatus.

  As described above, according to the present invention, when a computer game is played through a network having a communication delay, the delay time between game devices is obtained before the game is started, and the time counted by each game device based on the delay time is obtained. Are synchronized. While the game is in progress, the operation data signal is processed after the longest delay time among the delay times between the game devices measured in advance from the occurrence thereof. Thereby, an operation data signal can be processed simultaneously in a plurality of game devices.

  Further, according to the present invention, in the network server that manages the network game, the burden on the main server that receives the first connection request from the game device can be reduced.

  Furthermore, according to the present invention, a plurality of players can participate in a network game from one computer game device.

  Furthermore, according to the present invention, in a communication game in which a plurality of players participate, when each player competes for time to respond to game information distributed from the server, the game device operated by each player sets the response time. By measuring and transmitting it to the server, an accurate response time can be obtained even when the distribution time of game information from the server to each game device is different.

  Embodiments of the present invention will be described below. However, the technical scope of the present invention is not limited to this embodiment.

  FIG. 1 is a schematic diagram of a computer game device connected via a network. In FIG. 1, each computer game device (hereinafter referred to as “game device”) A, B, and C is connected to another game device via the Internet by connecting to a server of an Internet provider. In addition, the player a operates the game apparatus A, the player b operates the game apparatus B, and the players c and d operate the game apparatus C. That is, the game apparatus C is operated by a plurality of players.

  FIG. 2 is a block diagram of a home computer game device having a communication function. The game device displays an image generated by computer graphic (CG) technology on a monitor. In the CG technology, an object arranged in a virtual three-dimensional space is composed of a plurality of polygons, and the polygon is composed of a plurality of pixels. The monitor displays an image obtained by projecting an object for each virtual three-dimensional space viewed from a predetermined viewpoint coordinate onto a two-dimensional plane.

  For this purpose, the game apparatus includes a CPU 10 that controls the entire system, a geometry processor 11 that performs geometry calculation, a system memory 12 such as a work RAM, a CD-ROM 13 as a storage medium that stores a game program, ROM 14 for start-up, bus arbiter 15 for performing bus control, rendering processor 16 for performing rendering, graphic memory 17, video DAC 18 for performing digital-analog conversion of graphic data, audio processor, audio memory 20, It comprises an audio DAC 21 that performs digital-analog conversion of audio data, and a modem 22 that is controlled by a bus arbiter. The game apparatus is connected to the Internet provider from the modem 22 via a communication line.

  FIG. 3 is a diagram for explaining the computer game exemplified in the embodiment of the present invention. In the present embodiment, a large number of mouse characters 101 and cat characters 102 run around on the board surface 100 in the screen. Characters 101 and 102 change their direction of travel when they hit a corner or wall 105. When hitting the wall 105, the characters 101 and 102 turn in one direction, for example, the right direction. Also, the player can place an arrow 103 on the grid by operation. When the characters 101 and 102 come to the grid of the arrow 103, the characters 101 and 102 change the traveling direction in the direction of the arrow.

  Then, one square is given to one player, and a hole 104 is set there. Then, the player competes to drop more mouse characters 101 into his hole than the opponent player. For this purpose, the player performs an operation of placing an arrow so as to guide the mouse character 101 into his hole. For example, up to three arrows 103 can be placed per player. Therefore, when the fourth arrow is placed, the oldest arrow disappears. One stage is, for example, 3 minutes, and the number of mouse characters 101 falling into the holes 104 of each player during that period is displayed as a score.

  Further, in this game, when the cat character 102 falls into the hole, the number of the mouse characters 101 that have already fallen into the hole is reduced at a predetermined rate (for example, a reduction of 2/3). Therefore, it is also one of tactics for the player to place an arrow so as to guide the cat character 102 into the hole of the opponent player.

  When such a game is played by a plurality of players via a network, if there is a communication delay as described above, the processing time corresponding to the operation of placing an arrow on a grid by a certain player differs depending on each game device. The position of the character running around on the screen of each game device will be different. Then, the game progressing in each game device is different, and the battle result is also different for each game device, so that the battle game cannot be executed via the network.

  Therefore, the embodiment of the present invention provides a data processing method described below so that a game progressing in a plurality of game devices connected via a network having a communication delay is the same. In the following description, as shown in FIG. 1, a case where three game apparatuses A, B, and C are connected via a network and a game is executed will be described. A data processing method described below is provided by a game program stored in the recording medium 13 in FIG.

  FIG. 4 is a process flowchart of the data processing method according to the embodiment of the present invention. First, before starting the game, in steps S1A, S1B, and S1C, test data is transmitted between the game devices, and the delay time is measured. For example, in step S1A, game device A transmits test data with its own ID attached to each of game devices B and C. When the game devices B and C receive the test data from the game device A, the game devices B and C attach their own IDs and send the test data back to the game device A as the transmission source. The game apparatus A can obtain a delay time between the game apparatuses B and C by transmitting the test data and measuring the time until it returns. The same measurement is performed on game devices B and C (steps S1B and S1C). Each game device has a built-in timer that counts in units of 1/60 seconds (referred to as 1 int), and the time can be measured using the count value of the timer.

  Further, the measurement is performed a plurality of times (for example, 50 times), and each game device acquires an average delay time and a maximum delay time with other game devices (steps S2A, S2B, and S2C). That is, the game apparatus A acquires the average delay time and the maximum delay time with each of the game apparatuses B and C (step S2A), and the game apparatus B acquires the average delay time and the maximum delay time with each of the game apparatuses A and C. (Step S2B), the game apparatus C acquires the average delay time and the maximum delay time with each of the game apparatuses A and B (Step S2C).

  Then, information of the average delay time Dtavg and the maximum delay time DTmax (hereinafter referred to as delay time information) with other game devices acquired by each game device is collected in one game device. For example, assuming that the game device (hereinafter referred to as a representative device) from which the delay time information is collected is the game device A, the game devices B and C notify the representative device A of the delay time information (steps S3B and S3C). .

  The representative device A determines the longest maximum delay time among the collected delay time information as the reference delay time DTref after the game starts, and notifies the other game devices B and C of the time DTref (step S4A). .

  Next, the representative device A transmits a reset notice signal for synchronizing the count value of the timer of each game device to the other game devices B and C (step S5A). Then, the representative device A resets the count value of the timer to “0 (zero)” after the first time T1 (for example, several seconds) has elapsed since the transmission of the reset notice signal (step S7A).

On the other hand, the game apparatuses B and C receive the reset notice signal from the representative apparatus A after the delay times DT _BA and DT _{CA have} elapsed, respectively (steps S6B and S6C). At this time, each of the game devices B and C estimates the delay time of the reset notice signal as the maximum delay times DTmax _BA and DTmax _CA with the game device A acquired in steps S2B and S2C, respectively, and receives the reset notice signal. Then, after the time obtained by subtracting the average delay time with the game apparatus A from the first time T1, the count value of each timer is reset to “0 (zero)” (steps S7B and S7C).

More specific description will be given with reference to FIG. FIG. 5 is a timing chart for explaining a method of synchronizing the times of the game apparatuses A, B, and C. For example, when the game apparatus B receives the reset notice signal, the game apparatus B recognizes the delay time DT _BA as the maximum delay time DTmax _BA with the game apparatus A. Similarly, the game apparatus C recognizes the delay time DT _CA of the reset notice signal as the maximum delay time DTmax _CA with the game apparatus A. Then, the game apparatus B resets the timer after (T1-DTmax _BA ) seconds after receiving the reset notice signal. Similarly, the game apparatus C resets the timer in (T1-DTmax _CA ) seconds after receiving the reset signal. As a result, the timers of the game apparatuses A, B, and C are reset to “0 (zero)” almost simultaneously, and a new count is started.

  However, the actual delay time in each game device is not necessarily the maximum delay time DTmax. Therefore, strictly speaking, there is a possibility that the reset timing of each game device is greatly shifted, and the time of each game device may not be accurately synchronized. Therefore, in the embodiment of the present invention, the time of each game device is more accurately synchronized by the next adjustment process performed while the second time T2 (for example, several seconds) has elapsed since the reset.

  Returning to FIG. 4, in step S8A, the representative device A transmits a count value signal including the count value “0” at that time to the other game devices B and C at the same time as the reset. Further, the game apparatus A may transmit a count value signal including a count value at a predetermined time after reset.

  When the game devices B and C receive the count value signal from the game device A after the delay time has elapsed, respectively, the game devices B and C read the count value of their own timer when the count value signal is received (steps S9B and S9C). Furthermore, the game apparatuses B and C calculate the delay time with the game apparatus A by calculating (the read counter value−the counter value of the counter value signal).

Then, as shown in FIG. 5, for example, calculated delay time DT _BA in the game apparatus B, the game device A and the average delay time DTavg _BA than a predetermined time (e.g., 3-4 count (3～4Int) If it is longer than this (step S10B in FIG. 4), the game apparatus B stops counting up the counter value of the timer for (delay time DT _BA -average delay time DTavg _BA ) (step S11B in FIG. 4). The same applies to game device C (steps S10C and S11C in FIG. 4).

  In the above description, the timer reset of the game apparatuses B and C is (T1-DTmax) after receiving the reset notice signal. Accordingly, since the game devices B and C are reset at the same time or earlier than the game device A, the game devices B and C are temporarily stopped based on the count value of the game device A, thereby The count values of B and C and the count value of the game apparatus A can be accurately synchronized.

  Thus, the time of each game device is synchronized to some extent by the timer reset in steps S7A, S7B, and S7C. In order to synchronize the time of each game device more accurately, the game devices (B, C) other than the representative device count the delay time of the counter value signal from the representative device A after the reset. Based on the value, the delay time is compared with the average delay time. Then, when the obtained delay time is larger than the average delay time by a predetermined time or more, the count-up of the timer is stopped by (delay time−average delay time), and each count measured by the timer is corrected by correcting the count value. It is possible to synchronize the time of the devices A, B, and C almost accurately.

  Then, when the second time T2 has elapsed, the game starts simultaneously in each of the game devices A, B, and C (steps S12A, S12B, and S12C). An operation data signal corresponding to an operation of a player in one game device (for example, an operation of placing an arrow in a predetermined cell in the computer game of FIG. 3) is processed by one game device and another game device. Is also transmitted to other game devices. At this time, as described above, the operation data signal needs to be processed simultaneously in one game device and another game device.

  FIG. 6 is a diagram illustrating an example of the format of the operation data signal. As shown in FIG. 6, the operation data signal includes, in the header section 30, counter value information at the time of transmission of operation data of the transmission source game device, and number information of players operated on the transmission source game device. The data unit 40 includes operation data for each player, and the operation data includes, for example, cursor position information and arrow position information.

  As shown in FIG. 1, in the computer game device according to the embodiment of the present invention, a plurality of players can participate in a competitive computer game via a network in one game device (in FIG. c and d operate the game apparatus C). Accordingly, operation data corresponding to a plurality of players is included in the data portion 40 of the operation data signal transmitted from one game device for each player. Therefore, the data length of the operation data signal varies depending on the number of players operating with one game device. In addition, the game device that receives the operation data signal recognizes the number of players who operate the transmission source game device based on the number information of the players included in the header portion 30, and thereby the length of the subsequent data portion 40. Can be recognized. In this case, the length of the operation data corresponding to one player is set to a constant length regardless of the amount of data.

  FIG. 7 is a process flowchart of each game device during the progress of the game. FIG. 7A shows a process when an operation data signal is received, and FIG. 7B shows a process when an operation data signal is transmitted.

  In FIG. 7A, when the game device receives the operation data signal in step S21, in step S22, by comparing the count value included in the operation data signal with the count value of its own timer at the time of reception, Calculate the delay time DT. Further, in step S23, the game device calculates a difference time between the reference delay delay time DTref and the calculated delay time. In step S24, the game device processes the operation data signal after a lapse of a difference time from when the operation data signal is received.

  In FIG. 7B, when the game apparatus transmits an operation data signal in step S31, the operation data signal is processed after the reference delay time DTref has elapsed in step S32.

  Returning to FIG. 5, for example, the data processing in each game device of the operation data signal transmitted from the game device C will be described. First, the game apparatus C does not process the transmitted operation data signal immediately, but processes the operation data signal when the reference delay time DTref has elapsed from the time of transmission (count value). On the other hand, when the game devices A and B receive the operation data signal from the game device C, the game devices A and B read the count value at the time of reception, and delay time DT (count value at the time of reception−count value included in the operation data signal). Calculate Furthermore, the game devices A and B respectively calculate a difference time (reference time DTref−DT) between the reference delay time and the delay time DT obtained above. Then, the operation data signal is processed after the difference time obtained after the operation data signal is received.

  Thereby, the operation data signal is processed in each of the game apparatuses A, B, and C after the reference delay time DTstd has elapsed from the time of transmission. Since the count values of the timers of the game devices A, B, and C substantially match with each other by the above-described synchronization processing, the operation data signal is transmitted after the predetermined reference delay time has elapsed. In B and C, simultaneous processing can be performed simultaneously.

  As described above, the reference delay time is the longest time among the maximum delay times between the game devices, so that all the game devices wait for the reference delay time from the transmission time of a certain operation data signal. All the game devices can reliably receive the operation data signal. Thus, in the present invention, in order to process the same operation data signal simultaneously on all game devices, the processing of the operation data signal is waited until all game devices receive the same operation data signal. In order to measure the waiting time, the time measured by the timer of each game device is synchronized, and further, the waiting time, that is, the reference delay time is set.

  By the way, a mouse character, a cat character, an arrow, and a background such as a board having a grid displayed on the computer game screen shown in FIG. 3 are image-processed as objects in a three-dimensional virtual space.

  FIG. 8 is a diagram showing a three-dimensional virtual space in which objects of the computer game according to the embodiment of the present invention are arranged. In FIG. 8, the object of the board surface 100, the mouse characters 101a and 101b and the cat character 102 on it is arrange | positioned on the three-dimensional virtual space. The mouse characters 101a and 101b and the cat character 102 are each given as an object that faces the traveling direction (front direction) on the board surface 100.

  FIG. 9 is a diagram illustrating an example of an image when the three-dimensional virtual space in FIG. 8 is viewed from a predetermined viewpoint. In the computer game of the present embodiment, when the game is progressing by the player's operation, an image obtained by viewing the three-dimensional virtual space from the viewpoint A, that is, as shown in FIG. The image seen from above is displayed on the monitor. In addition, during the demonstration before the game starts and between the stages during the game, an image viewed from the viewpoint B, that is, an image viewed from diagonally above as shown in FIG. 9B. Is displayed on the monitor.

  At this time, as in the image shown in FIG. 9A, an image from directly above the board surface 100 is an image that allows the player to see the movement of the character on the whole board most easily. Therefore, although it is optimal as an image in progress of the game, only the heads of the mouse characters 101a and 101b and the cat character 102 on the board surface 100 are displayed, and it is a drawback that the shape of the character is difficult to understand.

  Therefore, in the embodiment of the present invention, when an image viewed from a viewpoint (viewpoint A in FIG. 8) right above the board surface 100 is displayed, the direction of the character is inclined by a predetermined angle (for example, 45 degrees).

  FIG. 10 is a diagram for explaining the direction of the character. Although a mouse character is illustrated, the cat character is similarly tilted. FIG. 10A is a view of the mouse character as viewed from the side, and the mouse character faces the front which is the normal direction. In this direction, the mouse character viewed from the viewpoint A in FIG. 7 looks as shown in FIG. FIG. 10C is a side view of a mouse character tilted upward in the front direction. When the mouse character in this direction is viewed from the viewpoint A in FIG. 8, it looks as shown in FIG. As compared with FIG. 10B, the whole image of the mouse character is clearly expressed more clearly. FIG. 10E is a view of the mouse character viewed from the front, and the mouse character is tilted in the horizontal direction. When the mouse character in this direction is viewed from the viewpoint A in FIG. 8, it looks like FIG. 10 (f). As compared with FIG. 10B, the whole image of the mouse character is clearly expressed in an easy-to-understand manner.

  In the embodiment of the present invention, as described above, when the viewpoint is right above the character, the character is tilted by a predetermined angle in a predetermined direction. This makes it possible to display the shape of the character in an easy-to-understand manner even while the game is in progress. Further, the tilting direction may be fixed in one direction regardless of the moving direction of the character. For example, in FIG. 9A, it is assumed that the character is tilted upward (arrow X direction) in the drawing. Then, since the mouse character 101a is tilted upward in the front direction as shown in FIG. 10C, it is displayed as shown in FIG. Further, since the mouse character 101b is tilted in the horizontal direction (leftward in FIG. 10E) as shown in FIG. 10E, it is displayed as shown in FIG. 10F.

  As described above, in the embodiment of the present invention, the direction of the object changes according to the position of the viewpoint coordinates in the three-dimensional virtual space. Thereby, the object (character) displayed on the game screen can be displayed more easily.

(Another embodiment)
Incidentally, each of the game devices A, B, and C in FIG. 1 needs to recognize each other's opponent game device before starting the network battle game as described above. Therefore, before the game is started, the player first connects a game device serving as a client in the network system to a server that manages the network battle game (hereinafter referred to as a network server) and registers the game device in the network server. Thereby, a battle group is formed. Thus, a player who desires a network battle game first connects to this network server.

  FIG. 11 is a block configuration diagram of the network server in the embodiment of the present invention. In FIG. 11, the network server includes a main server 1, a plurality of secondary servers 2 a, 2 b, 2 c, 2 d and a shared memory 3. FIG. 12 is a flowchart of a registration procedure to the network server in the game apparatus, and FIG. 13 is a diagram illustrating a display screen example in the game apparatus in each procedure. 12 will be described with reference to FIGS. 11 and 13.

  First, in step S101, the player sets a recording medium (for example, a CD-ROM) storing a computer game program in the game device, and starts the computer game program. When the game program is activated, first, a game mode selection screen M1 shown in FIG. 13 is displayed. On the game mode selection screen, for example, “4 Players Battle”, which is a battle in the game device, “Stage Challenge” where the desired stage is selected and played, “Network Battle” which is the network battle mode, etc. are displayed. . The player operates the controller to select “Network Battle” (step S102).

  When the network battle mode is selected, a selection screen M2 (FIG. 13) for selecting the number of people participating in the network battle is displayed. The player operates the controller to select the number of participants (step S103). When there are a plurality of participants, one of the plurality of players operates the controller to select the number of participants. A plurality of (for example, four) controllers for operation by the player can be connected to the game device. Accordingly, it is assumed that a plurality of players participate in the network battle game from one game device.

  Conventionally, in a battle game played in a game device without going through a network, a plurality of players can play against each other by using a plurality of controllers connected to one game device. On the other hand, on the network, the network server only identifies the game device connected thereto, and cannot recognize the number of controllers (or the number of players) connected thereto.

  That is, conventionally, in a competitive game via a network, one connection is created between one game device and a network server, and the network server determines the number of controllers and players connected to the game device. I can't recognize it. For this reason, only one player from one game device can participate in the battle game via the network.

  Therefore, in the embodiment of the present invention, the number of players participating in the network battle game is notified in advance to the network server from one game device. Thereby, even if there is one connection between one game device and the network server, the number of players participating from one game device can be recognized by the network server. A plurality of players can participate in a network battle game. The selection of the number of participants is not limited to the case performed in step S103, and may be performed at any stage until the number of participants is notified to the network server.

  When the number of participants is selected, the game device calls the Internet provider via the modem (step S104), and notifies the network server of the connection request via the Internet provider. The connection request includes identification information of one player such as the player ID and password. When the Internet using the TCP / IP protocol is used, a connection partner can be specified by specifying an IP address and a port number. The game device first connects to the main server 1 of the network server by designating the IP address and port number of the main server 1. The game apparatus stores the IP address and port number of the main server 1 in advance. Here, the IP address identifies a network server, and the port number identifies each server therein. In FIG. 11, the main server and the secondary server are shown as being divided in software within one network server. When the main server and the secondary server are different systems, different IP addresses are given.

  Here, TCP / IP will be briefly described. FIG. 14 is a diagram showing the hierarchy of the TCP / IP protocol. In FIG. 14, the TCP / IP protocol has a five-layer structure. Compared to the OSI reference model, TCP is a protocol that provides a connection-oriented data link, is a stream-type interface to higher-level applications, and establishes connections between distant processes on the network. Corresponds to the transport layer. IP corresponds to a network layer for transferring data on a network, and two points on the network to which data is transferred are expressed by IP addresses. The upper layer of TCP is an application layer, and the IP layer is an interface layer and a physical layer. Ethernet and FDDI are known as lower layers.

  The socket included in the application layer of the TCP / IP protocol is an application programming interface (API) for creating applications that transmit and receive data by interprocess communication over TCP. For more details, see OSI. Corresponds to the session layer in the model. Sockets provide an environment in which a process user can handle interprocess communication as if it were a file input / output without being aware of the environment (system, network, etc.). Then, two processes to be connected (in this embodiment, a game device and a network server) create a socket (communication input / output port), and a data signal is transmitted and received between the sockets.

  Returning to FIG. 12, the connection request from the game device is accepted and further authenticated by the main server 1 in the network server (step S201). As described above, the main server 1 is a server that executes a reception process and an authentication process for a connection request from a game device. When the main server 1 accepts the connection request, the main server 1 executes an authentication process based on the user information registered beforehand and the notified identification information. If it is determined that the player is a valid player, the main server 1 notifies the game device of the information of the secondary server 2 together with the connection response. Thereby, the connection between the game device and the network server is established (step S105).

  The information of the secondary server 2 is, for example, information on the name, IP address, port number, and current registered number of each secondary server 2. Information on the current number of registered persons is stored in the shared memory 3 as will be described later. The primary server 1 reads information on the current registered number of each secondary server 2 from the shared memory 3. The secondary server 2 is a server for managing a network battle game that is actually executed, and a battle group is formed when a player is registered in the secondary server.

  When connected to the network server, a server guidance screen M3 is displayed on the game device. The name of the secondary server 2 is displayed on the screen M3. The player (one of the plurality of players when there are a plurality of participants) operates the controller to select one secondary server (step S106). Note that the number of players that can be registered in one secondary server is determined according to the capacity of the server. Therefore, when the secondary server 2 in which the maximum number of persons is already registered is selected, it is displayed that it cannot be selected. The player can also operate the controller to display the current number of registered users of each sub-server or connection availability information based thereon.

  When the secondary server 2 is selected, the main server 1 switches the connection with the game device to the selected secondary server 2 (step S202). Specifically, when the secondary server selected from the game device is notified, the main server 1 notifies the game device of the IP address and port number of the selected secondary server 2.

  When a secondary server is selected, a connection request is notified to the selected secondary server using the IP address and port number of the selected secondary server. When the selected secondary server accepts and processes the connection request (step S202), the selected secondary server notifies the game device of information on a plurality of registered areas (hereinafter referred to as rooms) classified in the selected secondary server 2. For example, when the maximum number of players that can play a network battle game is four, the secondary server 2 is provided with a plurality of rooms for registering four players. On the game device, a room guidance screen M4 (FIG. 13) is displayed. This information may be included in the information of the secondary server notified from the main server 1. In this case, when the secondary server is selected, it is not necessary to make a connection request to the secondary server.

  The player operates the controller to select one room (step S107). When a room is selected, the selected room and the number of participants are notified from the game device to the selected secondary server. Then, the selected secondary server registers the players for the number of participants in the notified room (step S203). The selected secondary server notifies the game device of the information of the player registered in the selected room. The registered player information is, for example, the name of the player and the IP address and port number of the game device of each player. In this way, each game device acquires the IP address and port number of the opponent game device.

  Information about the player registered in the selected room is displayed on the screen M5 (FIG. 13). On the screen M5 in FIG. 13, for example, when two players participate from one game device, the player names are displayed as player X1 and player X2. This is because the network server registers only one player's identification information for one game device. Then, one of the players registered in the selected room operates the controller and selects the start button on the screen M5, thereby starting the game (step S108).

  In addition, when the maximum possible number of players (for example, 4 people) is already registered in the selected room, or when the number of participants is 2 and registering 2 people exceeds the maximum possible number of players, or If the game has already started, the player cannot register in the selected room. The player can operate the controller to display the state of each room such as the number of people already registered and whether the game is in progress.

  Further, the room of the secondary server 2 may have a hierarchical structure. For example, the secondary server is a server that manages a plurality of types of network battle games and chats, and has a large room for each type of game and a large room for chatting. A plurality of small rooms may be set.

  In addition, the item “Exit” is displayed on each of the screens M2 to M5. By selecting this, you can return to the previous screen. Accordingly, when “Exit” is selected, if the room of the secondary server has a hierarchical structure, it returns to the next higher hierarchy. When “Exit” is selected on the screen M4, the screen returns to the screen M3, that is, the game apparatus connects to the main server 1 again. The player may change the secondary server to be registered, for example, when a remote friend is registered in a room included in another secondary server. In such a case, conventionally, the player has to select “Exit” on the screen M4, temporarily switch to the connection with the main server 1, and select another sub-server on the screen M3.

  However, if the secondary server changes frequently, there are the following problems. That is, there is a limit to the number of connection requests to the main server 1 that can be processed at one time due to the capability of the operating system (more generally software) of the main server 1. For this reason, when the number of connection requests exceeding the connection request processing capacity of the main server is temporarily concentrated on the main server 1, the main server 1 will not accept connection requests, so that the game device connects to the main server 1. Can not be.

  FIG. 15 is a block diagram of a conventional network server. In FIG. 15, conventionally, a plurality of secondary servers 2 are connected to the main server 1 and notify the main server 1 of its own information. On the other hand, since the secondary servers 2 are not connected, each secondary server 2 cannot obtain information on other secondary servers. Therefore, when switching the secondary server to which the game apparatus is connected, the game apparatus has to be reconnected to the main server once. Thus, the conventional network server has a structure in which connection requests are concentrated on the main server 1.

  Therefore, it is desirable to reduce the number of connection requests to the main server 1 as much as possible. Therefore, in the embodiment of the present invention, the connection of the game device is directly switched from the previously selected secondary server to another secondary server. For this purpose, the shared memory 3 is provided in the network server in FIG.

  The shared memory 3 stores information about each secondary server such as the operation status and registered number of each of the multiple secondary servers 2. Information on each secondary server 2 is updated regularly by itself (for example, every 0.5 seconds).

  The shared memory 3 can be accessed by the main server 1 and the plurality of secondary servers 2. The primary server 1 reads information about all secondary servers 2 from the shared memory 3. In addition, each secondary server 2 reads information related to other secondary servers 2 other than itself from the shared memory 3. By providing a shared memory that can be accessed from all servers, it becomes possible to acquire information of other servers without connecting each server in a one-to-one relationship.

  FIG. 16 is a diagram schematically illustrating an area of the shared memory 3. As shown in FIG. 16, information about each secondary server 2 is stored in a matrix, for example. In FIG. 16, four secondary servers 2a, 2b, 2c, and 2d write their current registered number of people to the columns of the other secondary servers in their own rows. Each of the secondary servers 2a, 2b, 2c, and 2d reads information on the other secondary servers written in its own column. In this way, since the read areas of the secondary servers 2a, 2b, 2c, and 2d are different, even when a plurality of secondary servers access the shared memory 3 simultaneously for reading information, they can be read simultaneously. it can. Further, the main server 1 reads information on each secondary server from the column of the main server 1 in the shared memory 3.

  When the information is read, the value of the read area is a numerical value (for example, “−1”) indicating that the information is read until the next information is updated. As a result, when the secondary server cannot write information due to some failure, the area of the shared memory 3 remains in the read state. Then, the other server recognizes that the secondary server is in failure.

  Returning to FIG. 13, on the screen M4, an item “transfer to another server” characteristic of the present invention is displayed. When this is selected, the selected secondary server 2 reads information on the other secondary server from its own column of the shared memory 3 and notifies the game device of it. The information related to the secondary server is information such as the name of the secondary server, the IP address, the port number, and the number of registered persons as described above. Each secondary server stores in advance information on the IP addresses and port numbers of other secondary servers.

  Then, a guidance screen M4-1 for another secondary server is displayed on the game device. On the screen M4-1, the names of other secondary servers other than the self are displayed. Similarly to step S106, when one secondary server is selected by the player, a connection request is notified to the selected secondary server using the IP address and port number of the selected secondary server. . Thereafter, the same processing as in FIG. 12 is executed.

  In this way, by storing information related to each secondary server and providing the shared memory 3 accessible to each secondary server, each secondary server can know the status of other secondary servers other than itself. . Accordingly, since it is possible to notify the game device of information related to other secondary servers from the currently connected secondary server, the connection of the game device can be switched directly between the secondary servers. That is, since it is not necessary to connect the game device to the main server 1 again as in the conventional case, the number of connection requests to the main server 1 can be reduced. Thereby, since the possibility that the main server 1 exceeds the connection request reception capability and receives the connection request is reduced, the case where the main server 1 rejects the connection request from the game device can be almost eliminated. This contributes to an improvement in service to players using the network.

  Furthermore, even if there are a plurality of players participating in the network battle game from one game device, there is one connection between the game device and the network server, that is, one socket is created. Therefore, as described above, the number of participants from one game device is notified in advance to the network server (specifically, the selected secondary server), and as shown in FIG. The data for the player is transmitted by one data signal using one socket.

  Connections for the number of participants may be established (sockets are created), but a connection request for the number of participants is required, and the above-described problem regarding the connection request reception capability arises. Therefore, in the present embodiment, the connection of the main server 1 is achieved by using one connection (one socket) between one game device and the network server regardless of the number of participants from one game device. The burden of request acceptance processing is reduced. Thereby, the processing delay in the main server 1 can be eliminated, which contributes to service improvement.

(Still another embodiment)
Further, communication delay in the network becomes a problem even in the following cases. For example, in the case where a quiz game (hereinafter referred to as a network quiz game) is performed between a plurality of players, the rank is determined in consideration of the answer time of the quiz problem in addition to the correct answer number (or correct answer rate). This is the case.

  FIG. 17 is a diagram illustrating a network in which a plurality of game devices are connected to the main server via a communication line. The communication time between the main server 1 and each game device differs depending on the geographical distance between the main server 1 and each game device, the line status (degree of congestion), the communication speed, the performance of the communication device, and the like. Each game device may be arranged geographically apart. For example, at least one game device is arranged at a store A,.

  In the case of a network quiz game, the main server 1 distributes a plurality of quiz questions as game information to each game device. The player answers each question displayed sequentially on the screen of the game device. The answer in each game device is transmitted to the main server 1. Alternatively, each game device may determine whether the answer is correct / incorrect, and if the answer is correct, information indicating that may be transmitted. The main server 1 determines win / loss and / or ranking based on the number of correct answers (or correct answer rate) of each player.

  At this time, it is assumed that there are a plurality of players with the same number of correct answers (or correct answer rate). In such a case, there is a method in which the answer times of all the questions of the quiz game in each player are compared, and the player with the shorter answer time is determined in the higher rank.

  When this answer time (response time) is measured by the main server 1, there is a problem that an accurate answer time cannot be measured due to a communication time shift in the network. The main server 1 measures the time from when a problem is delivered to each game device to when the answer information or correct information from each game device is received as the answer time. At this time, if the communication time between the main server 1 and each game device is the same, the difference in time from the above distribution to reception between the game devices indicates that a problem is displayed on each game device and the player Reflects the original answer time until answering.

  However, since the communication time between the main server 1 and each game device is different as described above, the time from the distribution to the reception between the game devices does not accurately reflect the original answer time. Although the communication time between the main server 1 and each game device may be measured in advance, the communication time may change during the quiz game due to a change in the congestion status of the line. Thus, the answer time in each game device cannot be measured by the main server 1.

  Therefore, in the embodiment of the present invention, each game device itself measures the answer time of each question, and notifies the main server 1 of the answer time together with the answer or correct / incorrect answer information. The answer time (response time) may be, for example, the time from the start or completion of reception of the quiz question distributed from the server until the player starts or completes the input of the answer. It may be the time from when the answer becomes possible (for example, when a quiz question is displayed on the screen) until the player starts or finishes inputting the answer.

  18 and 19 are flowcharts of the network quiz game according to the embodiment of the present invention. In FIG. 18, each game device provides a normal quiz game by each game device alone while the network quiz game is not being executed (S400 (normal quiz mode)). That is, the player answers a predetermined number of quizzes displayed on the game device, aiming for a correct answer rate as high as possible.

  When the network quiz game is executed, first, the main server 1 notifies each game device of an entry start signal for notifying that the network quiz game will be held after a predetermined time (S300). Upon receiving the entry start signal, each game device displays an entry acceptance screen (S401). When each game device receives an entry start signal and a normal quiz game is being executed by a single game device, the game device switches to the entry acceptance screen as soon as it is finished.

  FIG. 20 is an example of an entry reception screen. A player who wants to participate in the network quiz game inserts a predetermined amount of coins, selects characters displayed on the entry acceptance screen, and inputs a name (S402). The screen of the game device is, for example, a touch panel, and the player may select a character by touching the displayed character. Further, the player may select a character displayed by the operation lever.

  In FIG. 18, when the player inputs a name before the entry acceptance deadline and selects an end button, the game apparatus transmits an entry work end signal to the main server 1. The entry work end signal includes the input player name, store information where the game device is located, game device identification information, and the like.

  When the main server 1 receives the entry work signal, the main server 1 confirms the game device having the entry (S301). When a predetermined time (for example, 2 minutes) before the entry acceptance deadline, 2 minutes before the deadline is notified to each game device (S302). When each game device receives the signal two minutes before the deadline, the game device counts down the remaining time until the reception deadline on the entry reception screen in FIG. 20 (S403). When the remaining time until the entry acceptance deadline runs out, each game device deadlines entry acceptance (S404) and transmits an entry acceptance end signal to the main server 1. Similar to the entry work end signal, the entry acceptance end signal includes the name of the player who entered, store information, and game device identification information. The game device having no entry transmits an entry acceptance end signal including no entry information in place of the player's name.

  When the main server 1 receives entry acceptance end signals from all the game devices, it sorts the game devices with entries from all the game devices, and finally confirms each game device with entries and its player name (S303). At this time, the main server 1 distributes the explanation video of the quiz game by the virtual host character to the game device with entry (S304). Each game device displays an explanation video (S405), and when it finishes, sends an explanation end signal to the main server 1.

  When the main server 1 receives the explanation end signal from all the game devices with entries, the main server 1 starts the quiz. Specifically, when the number of quiz questions is 30 in total, for example, the main server 1 first distributes all 30 questions and their correct answers to the game devices with entries (S305). The distribution from the main server 1 may be performed simultaneously for all game devices (or all game devices with entries), or may be sequentially performed in a time division manner. In the case of sequential transmission, the main server 1 may transmit the problem and its correct answer to the game device that has transmitted it in response to reception of the explanation end signal. The number of participants is notified to the game device together with the problem and the correct answer. The problem and the correct answer may be divided and distributed. For example, the first 10 questions may be distributed first, the next 10 questions may be distributed before the end of the first 10 questions, and then the last 10 questions may be distributed.

  When the game apparatus receives the problem and the correct answer, the game apparatus counts down the time (for example, 20 seconds) until the quiz starts (S406). At this time, the number of participants is also displayed. Thereby, the player can know the number of participants. When the quiz starts, the game device moves to FIG. 19 and first selects the first question (S407).

  At this time, when the game apparatus displays a question, the game apparatus starts time measurement by a timer and measures the time to answer (S408). The player selects one answer corresponding to the question from a plurality of displayed options. When the screen of the game device is a touch panel, the player touches an option to be selected. Or you may select an option by lever operation. FIG. 21 is an example of a problem display screen.

  When the answer is selected by the player (S409), the game device stops time measurement and acquires the answer time (S410). Further, the correctness of the selected option is determined from the delivered correct answer (S410). In the case of a correct answer, the fact that it is correct is displayed on the screen, and the answer information including the question number and the correct answer and the acquired answer time are transmitted to the main server 1. In this way, in the embodiment of the present invention, each game device measures the answer time and transmits it to the main server 1, so that even if the communication time differs between the main server 1 and each game device, The server 1 can acquire an accurate answer time in each game device.

  On the other hand, in the case of an incorrect answer, the fact that the answer is incorrect is displayed on the screen, only the answer information including the question number and the answer that is incorrect is transmitted, and the answer time is not transmitted. In addition, even when a predetermined time given in advance for answering one question is exceeded, if an option is not selected (time over), it is regarded as an incorrect answer. The correct answer determination may be performed by the main server 1. In this case, the main server 1 transmits only the question to each game device, and each game device transmits the selected answer and the answer time for each question to the main server 1. The main server 1 determines whether the answer received for each game device is correct / incorrect, and adds the received answer time only when the answer is correct.

  When the main server 1 receives the answer information (correct answer or incorrect answer) and the answer time in the case of the correct answer, the main server 1 counts them and calculates the rank for each question (S306). If the number of correct answers is the same, the player with the smallest answer time is ranked higher. When the ranking is determined, the main server 1 notifies each game device of the individual progress ranking (S308). Further, when another display device for displaying the rank is arranged at the store where the game apparatus is arranged (see “rank display device” in FIG. 17), the main server 1 For example, the top 10 players and their progress are transmitted, and the rank display device is arranged at a position that can be seen by the player who operates each game device, and the player ranks the top rank for each question separately from his own rank. Can be known.

  When the game device receives the individual progress rank from the main server 1, it displays it in the rank display portion of FIG. 21, selects the next problem (S412), and repeats the above-described processes of S408 to S410.

  Then, in order to excite the quiz game, for example, at the end of the quiz game (the last 10 questions), the progress ranking may not be transmitted (of course, the ranking is calculated). In other words, the ranking is not displayed for production. Further, in order to enable reverse rotation, the ranking may be determined by doubling the count number and answer time for one correct answer. Specifically, when the main server 1 normally counts the number of correct answers for one correct answer (problems other than the last 10 questions), the main server 1 determines the correct answer for the last 10 questions. Multiple counts (for example, 2 counts). Further, the answer time for the correct answer is also multiplied by a predetermined time (for example, twice) and added to the total answer time so far. Thereby, compared with the normal case, the difference in answer time becomes large, and the reversal of the ranking easily occurs.

  When all the problems are finished (S307, S411), the main server 1 creates the final ranking, notifies each game device of the final ranking, and further displays the ranking of the player names and rankings higher in the final ranking. The device is notified (S309). The game device displays the final ranking (S413). Along with the transmission of the final ranking information, an effect video (such as the announcement of the higher ranking player) after the end of the quiz game by the virtual host character may be distributed. Further, different videos may be distributed to the game device of the higher ranking player and the game devices of other players. Then, the game device returns to the normal quiz mode screen after a predetermined time has elapsed since the final ranking display.

  The rank determination method is such that, when the number of correct answers (as described above, the correct answer count number when the number of correct answers for one question differs depending on the problem) is the same, the rank of the player with the short total answer time is ranked higher. In addition to the method, for example, a method of changing the number of points for the correct answer according to the answer time may be used. For example, if the answer is made within 5 seconds after displaying the question, the number of points increases as the answer time becomes longer, such as 100 points within 10 seconds, 80 points within 15 seconds, and 60 points within 15 seconds. May be reduced. In this case, the win and loss and / or ranking is determined by the total of points.

  As described above, in the quiz game via the network, the game device measures the answer time of the quiz question and transmits it to the main server 1. Thereby, even if the communication time between the main server and each game device is different, the main server that manages the quiz game can acquire the correct answer time for each question in each game device.

  Moreover, the said embodiment is applicable also to communication games other than a network quiz game. For example, a network battle typing game in which a plurality of players compete for the speed of accurately performing a character input presented from the server, or a network battle in which a plurality of players compete for a speed of accurately performing the input operation presented from the server. The present invention can also be applied to a game where players compete for response time until the player performs an input operation required by the game, such as a mole-tapping game. In the network competitive typing game, predetermined characters / codes are distributed as game information from the server. For example, after the player can perform an input operation corresponding to the distributed characters / code, until the player actually performs the input operation. Response time is measured. In addition, in a network fighting mole game, a position where a mole character appears and appears on the screen is distributed as game information. For example, after a mole is displayed on the screen until the player performs an input operation corresponding to the position. Response time is measured. The measured response time is transmitted to the main server, and win / loss and / or ranking is determined based on the total response time. In this case, the lower the total response time, the higher the rank.

  The protection scope of the present invention is not limited to the above-described embodiment, but covers the invention described in the claims and equivalents thereof.

It is a schematic diagram of the computer game device connected via a network. It is a block block diagram of a computer game device. It is a figure for demonstrating the computer game illustrated in embodiment of this invention. It is a process flowchart of the data processing method in embodiment of this invention. It is a timing chart for demonstrating the method to synchronize the time of game device A, B, C. FIG. It is a figure which shows the example of the format of an operation data signal. It is a process flowchart of each game device in progress of a game. It is a figure which shows the three-dimensional virtual space by which the object of the computer game in embodiment of this invention is arrange | positioned. It is a figure which shows the example of the image which looked at the three-dimensional virtual space of FIG. 8 from the predetermined | prescribed viewpoint. It is a figure explaining direction of a character. It is a block block diagram of the network server in embodiment of this invention. It is a flowchart of the registration procedure to the network server in a game device. It is a figure which shows the example of a display screen with the game device in each procedure of FIG. It is a figure which shows the hierarchy of a TCP / IP protocol. It is a block block diagram of the conventional network server. 3 is a diagram schematically illustrating an area of a shared memory 3. FIG. It is a figure which shows the network which a some game device connects to a main server via a communication line. It is a flowchart of the network quiz game in the embodiment of the present invention. It is a flowchart of the network quiz game in the embodiment of the present invention. It is an example of an entry reception screen. It is an example of a problem display screen.

Explanation of symbols

1 Primary server 2 Secondary server 3 Memory 10 CPU
11 Geometry processor 13 Recording medium (CD-ROM)
16 Rendering processor 22 Modem

Claims (6)

In a communication game method in which game information is distributed from a server to each of a plurality of game devices, and players of each game device battle each other by performing an operation corresponding to the game information.
The measuring means of each game device measures a response time from when the input operation responding to the game information of the player becomes possible until the input operation is started,
The communication means of each game device transmits the response time of the player or a value corresponding thereto to the server,
A communication game method, wherein the determination means of the server determines a win / loss and / or ranking of each player using a response time of each player or a value corresponding thereto. In claim 1,
The determination unit of each game device determines whether the input corresponding to the game information of each player is correct or not, and the communication unit of each game device corresponds to the response time of the player or at least the response time when it is determined that the input is correct. A communication game method, wherein a value is transmitted to the server. A server and a plurality of game devices connected to the server via a communication network, game information is distributed from the server to each game device, and a player of each game device performs an operation corresponding to the game information Thus, in the communication game system in which each player battles,
Each game device
Measuring means for measuring a response time from when an input operation in response to the game information of the player is enabled until the input operation is started;
Communication means for transmitting the response time of the player or a value corresponding thereto to the server,
The server
A communication game system, comprising: a determination unit that determines a win / loss and / or ranking of each player using a response time of each player or a value corresponding thereto. In claim 3,
Each game device includes a determination unit that determines whether an input corresponding to the game information of each player is correct.
The communication game system, wherein the communication means transmits at least the response time of the player when the input is determined to be correct or a value corresponding to the response time to the server. In a computer game device that receives game information from a server via a communication network, and a player performs an operation corresponding to the game information,
Measuring means for measuring a response time from when the player can perform an input operation in response to the game information until the input operation is started;
Communication means for transmitting the response time or a value corresponding thereto to the server and receiving from the server the player's response time or the player's win / loss and / or ranking determined using the response time or the value corresponding thereto. A computer game device. In a computer device that distributes game information to a plurality of computer game devices via a communication network,
Receiving means for receiving, from each computer game device, a response time from when an input operation in response to the game information of the player becomes possible until the input operation is started or a value corresponding thereto;
Determining means for determining the win and loss and / or ranking of each player using the response time of each player or a value corresponding thereto;
A computer device comprising: a transmission means for transmitting the determined win / loss and / or ranking of each player to each corresponding computer game device.

Images