JP5770513B2 - Program and game information generation device - Google Patents

Description

  The present invention relates to a program, an information storage medium, and a game information generation device.

  An online battle game in which a plurality of players battle each other online with game characters via the network is known and is popular.

  As such an online battle game, a game in which a dedicated server is installed and game data is transmitted to the game device via the server and a plurality of game devices are in communication battle is known.

JP 2004-041414 A

  However, installing a dedicated server and managing the transmission of game data by the server increases costs, increases the network load, and easily generates traffic due to communication. There is also a method in which multiple game devices are connected by Peer to Peer (Peer to Peer, Peer-to-Peer), and game data is sent and received between game devices. However, as the number of participating game devices increases, the load on the network increases. Communication traffic is likely to occur.

  If the communication frequency is reduced to reduce the communication traffic, the load on the network will decrease, but due to the delay of the game data, game images that do not reflect the game data of other game machines will be generated, giving the player a sense of incongruity There was a problem that.

  The present invention has been made to solve the above-described problems. According to some aspects of the present invention, a program, an information storage medium, and game information capable of performing efficient communication control that minimizes the influence on a game due to communication delay while preventing an increase in network load A generation device can be provided.

(1) One aspect of the present invention is
A program for a game machine that transmits / receives game data to / from other nodes via a network,
A communication control means for configuring a network between nodes and transmitting and receiving game data between nodes via the network;
Game calculation means for performing a game calculation based on input information and game data received from another node;
Image generating means for generating a game image of the game world based on the game calculation result;
Make your computer work,
The game calculation means includes
Game evaluation value calculating means for calculating a game evaluation value for group determination based on at least one of the game situation and the game parameter of the player character,
The communication control means includes
Nodes are grouped based on the game evaluation value for group determination, and the communication frequency for transmitting / receiving game data between the nodes in the group and the communication frequency for transmitting / receiving game data between nodes outside the group are controlled to be different. The present invention relates to a program for performing at least one of communication frequency control and network connection control for controlling the network connection between nodes in a group to be different from the density of network connections between nodes outside the group.

  A node is a communication unit set corresponding to a player or a player character. The generated game image may be a two-dimensional image or a three-dimensional image. In intra-group communication, game data of each node is exchanged with other nodes in the group. Communication with nodes outside the group may be performed by a representative of the group. That is, the representative of each group may exchange game data in the group with representatives of other groups.

  The present invention relates to a technique for performing a communication battle in a multiplayer game by a Peer to Peer (Peer to Peer, Peer to Peer) method, and a node is connected to one or more other nodes by Peer to Peer. Peer to Peer (Peer to Peer) is one of the architectures when communicating between a large number of terminals, and is a communication system characterized by peer peers communicating with each other.

  According to the present invention, when a communication battle is performed in a multiplayer game, a communication battle can be performed by a large number of people without using a dedicated server.

  Generally, it is preferable to update the information of characters of other nodes located near in the game world without time lag because the probability of being reflected in the game image is high, but the information of characters of other nodes located far away in the game world is Since the probability of being reflected in the game image is low, there is often no problem even if there is some time lag even though it is reflected due to communication delay.

  According to the present invention, the game evaluation value for group determination is obtained based on at least one of the game situation and the game parameter of the player character, and grouped based on the obtained game evaluation value. Then, the communication frequency control for making the communication frequency for transmitting / receiving game data to / from the nodes in the group higher than the communication frequency for transmitting / receiving game data to / from the nodes outside the group, and the network connection with the nodes in the group outside the group. It is possible to perform at least one of network connection control that is denser than the network connection with the other node. Accordingly, the communication environment between the nodes in the group can be made better than the communication environment between the nodes outside the group, so that the time lag for the other nodes in the group is smaller than the time lag for the other nodes outside the group. can do. In other words, the communication environment between nodes can be sharpened according to the situation of the game world, so that efficient communication control that minimizes the effect on the game due to communication delay is performed while preventing an increase in network load. be able to.

(2) In this program, information storage medium, and game information generation device,
The communication control means includes
Clustering processing means for clustering the nodes constituting the group;
Intra-cluster communication control processing means for configuring a network between nodes belonging to the same cluster and transmitting and receiving game data via the network;
Cluster representative judging means for judging a representative node of the cluster based on at least one of the information on the communication state of the nodes belonging to the cluster and a predetermined rule;
An inter-cluster communication control processing means for configuring a network between representative nodes of the cluster and transmitting and receiving game data;
Communication frequency control for controlling the communication frequency for sending and receiving game data between nodes in the cluster and the communication frequency for sending and receiving game data between nodes outside the cluster, and network connection between nodes in the cluster And / or network connection control for controlling the degree of density of network connection between nodes outside the cluster to be different.

(3) In this program, information storage medium, and game information generation device,
The communication control means includes
Communication frequency control that makes the communication frequency of sending / receiving game data between nodes in the cluster higher than the communication frequency of sending / receiving game data between nodes outside the cluster, and network connection between nodes in the cluster outside the cluster It is also possible to perform at least one of network connection control that is denser than the network connection between the nodes.

(4) In this program, information storage medium, and game information generation device,
At least one of the game situation and the game parameters (position data, etc.) of the player character includes information on the position of the player character,
The game evaluation value calculation means includes
Based on the information related to the position of the player character, the game evaluation value of the player character may be calculated.

  The game parameter may be position data, for example. The information related to the position of the player character may be position coordinates, area information to which the position belongs, a positional relationship with other player characters, a field of view range, and a virtual camera position.

  In this way, the communication environment of the node corresponding to the player character can be sharpened according to the position of the player character in the game world. For example, by clustering characters that may be included in the same game image (characters located nearby in the game world) into clusters, the effect of communication delay is minimized while effectively preventing an increase in network load. can do.

(5) In this program, information storage medium, and game information generation device,
The clustering processing means includes
When a cluster suitable for a node changes to a cluster different from the cluster assigned to the node due to a change in the game evaluation value, a cluster change process for changing the cluster assigned to the node may be performed.

  In this way, dynamic cluster change can be performed in accordance with the game situation and the change in the game parameters of the player character.

(6) In this program, information storage medium, and game information generation device,
The intercluster communication control processing means includes:
Based on the neighboring cluster information that defines the information of the cluster that is directly connected to the cluster to which the cluster representative is connected, the cluster representative node that is defined as the neighboring cluster is connected via the network for inter-cluster communication. May be.

  Inter-cluster communication is not performed directly with the representative node of the cluster that is not defined as the adjacent cluster in the adjacent cluster information, and the game data is not transmitted via the representative node of the adjacent cluster, and the representative nodes of other clusters. Transmission and reception may be performed. Even if there is some delay in the game data of the distant cluster, the game image of the node is not affected so much, and traffic by communication can be effectively reduced without any harmful effect.

(7) In this program, information storage medium, and game information generation device,
The communication control means includes
Test communication processing means for receiving node information of the master node and performing test communication with the master node to a node other than the master node;
The master node causes the communication status information of the node that performed the test communication based on the result of the test communication to be stored as node information in association with the node, and the stored node information is another node (may be a representative node of the cluster) It may function as node information management processing means for performing processing to be transmitted to the server.

(8) In this program, information storage medium, and game information generation device,
The clustering processing means includes
The number of nodes in the cluster may be limited, and the process of clustering the nodes may be performed within a range where the number of nodes in the cluster does not exceed the limit value.

(9) In this program, information storage medium, and game information generation device,
In any one of Claims 1 thru | or 6.
The clustering processing means includes
If there is a limit on the number of nodes in the cluster and the number of nodes in the cluster exceeds the limit value, the cluster may be divided into multiple clusters that are composed of nodes that do not exceed the limit value. Good.

(10) In this program, information storage medium, and game information generation device,
The intra-cluster communication control processing means includes:
Intra-cluster communication may be performed by interconnecting nodes belonging to the same cluster with a full-connect network structure.

  A fully connected network structure is a state in which each node is connected to all other nodes. Even if one node fails, it is free to communicate regardless of communication with other nodes. Because it can be connected, fault tolerance is the highest in the network.

(11) In this program, information storage medium, and game information generation device,
The clustering processing means includes
Clustering multiple nodes representing the cluster as the upper cluster,
The intra-cluster communication control processing means includes:
Configure a network between nodes belonging to the same upper cluster, send and receive game data via the network,
The cluster representative judging means is:
Based on at least one of the information regarding the communication state of the nodes belonging to the upper cluster and the predetermined rule, the representative node of the upper cluster is determined,
The intercluster communication control processing means includes:
A network may be configured between the representative nodes of the upper cluster, and game data may be transmitted and received.

(12) In this program, information storage medium, and game information generation device,
The game world is divided into a plurality of areas,
At least one of the game situation and the game parameter of the player character includes area information to which the player character belongs,
The game evaluation value calculation means includes
Based on the area information, a game evaluation value corresponding to the area to which the player character belongs may be obtained.

(13) In this program, information storage medium, and game information generation device,
At least one of the game situation and the game parameter of the player character includes virtual camera information related to the placement of the virtual camera,
The game evaluation value calculation means includes
A game evaluation value corresponding to the player character may be obtained based on the virtual camera information.

  The virtual camera information related to the placement of the virtual camera may include at least one piece of information on the position, rotation, and angle of view of the virtual camera.

(14) One aspect of the present invention provides
The present invention relates to a computer-readable information storage medium storing any one of the programs described above.

(15) One aspect of the present invention provides
In a game information generating device for transmitting / receiving game data to / from other nodes via a network and generating game information,
A communication control means for configuring a network between nodes and transmitting and receiving game data between nodes via the network;
Game calculation means for performing a game calculation based on input information and game data received from another node;
Image generation means for generating a game image of the game world based on the game calculation result,
The game calculation means includes
Game evaluation value calculating means for calculating a game evaluation value for group determination based on at least one of the game situation and the game parameter of the player character,
The communication control means includes
Nodes are grouped based on the game evaluation value for group determination, and the communication frequency for transmitting / receiving game data between the nodes in the group and the communication frequency for transmitting / receiving game data between nodes outside the group are controlled to be different. The present invention relates to a game information generation device that performs at least one of communication frequency control and network connection control for controlling the network connection between nodes in a group and the density of network connections between nodes outside the group to be different.

  The game information means information generated during the game, and may be game output information, game results, or information on game results. The game output information may be, for example, a game image (image drawing data or a command or data for causing another computer to generate an image), game music, or the like.

The functional block diagram of the image generation system of this embodiment. The figure which shows an example (clustering process) of grouping of this Embodiment. The figure for demonstrating a cluster change process. The figure for demonstrating a cluster change process. The figure explaining the hierarchical structure of a cluster. The figure for demonstrating the flow of participation in a game, and withdrawal. The figure for demonstrating the node information of this Embodiment. 8A to 8C are diagrams for explaining cluster information. The figure for demonstrating an upstream node and a downstream node. The figure for demonstrating the flow of participation in a game, and withdrawal. The flowchart which shows the flow of the process at the time of game participation. The flowchart which shows the flow of a process of the communication control according to the role of a node. The flowchart which shows the flow of a cluster change process (process of the node which changes a cluster). The flowchart which shows the flow of a process when the other node in a cluster leaves | leaves a cluster. The flowchart which shows the flow of a cluster division process. The figure which shows an example of a game image.

  Hereinafter, this embodiment will be described. In addition, this embodiment demonstrated below does not unduly limit the content of this invention described in the claim. In addition, all the configurations described in the present embodiment are not necessarily essential configuration requirements of the present invention.

1. Configuration FIG. 1 shows an example of a functional block diagram of an image generation system (an example of a game information generation device, a computer, a terminal, and a game device) of the present embodiment. Note that the image generation system of the present embodiment may have a configuration in which some of the components (each unit) in FIG. 1 are omitted.

  The operation unit 160 is for a player to input operation information of a player character (including a player character operated by the player, a moving object, a player object, and a game character), and functions thereof are a lever, a button, a steering wheel, This can be realized by a microphone, a touch panel display, or a housing.

  The storage unit 170 serves as a work area for the processing unit 100, the communication unit 196, and the like, and its function can be realized by a RAM (VRAM) or the like.

  The information storage medium 180 (computer-readable medium) is used for inputting programs, data, and the like, and functions as an optical disk (CD, DVD), magneto-optical disk (MO), magnetic disk, hard disk, and magnetic tape. Alternatively, it can be realized by a memory (ROM), a memory card, or the like. The processing unit 100 performs various processes of the present embodiment based on a program (data) input to the information storage medium 180. That is, the information storage medium 180 stores a program for causing a computer to function as each unit of the present embodiment (a program for causing a computer to execute processing of each unit).

  The display unit 190 outputs an image generated according to the present embodiment, and its function can be realized by a CRT, LCD, touch panel display, HMD (head mounted display), or the like. The sound output unit 192 outputs the sound generated by the present embodiment, and its function can be realized by a speaker, headphones, or the like.

  The communication unit 196 performs various controls for communicating with the outside (for example, other devices, servers, and other game systems), and functions thereof include hardware such as various processors or communication ASICs, It can be realized by a program.

  Note that the image generation apparatus may download a program (data) for causing a computer to function as each unit of the present embodiment from a server via a network and store the program in the information storage medium 180. The output of the program input to such a server can also be included in the scope of the present invention.

  The processing unit 100 (processor) performs processing such as game calculation processing, image generation processing, or sound generation processing based on operation information (an example of input information) from the operation unit 160 and a program. The processing unit 100 performs various processes using the main storage unit 172 in the storage unit 170 as a work area. The functions of the processing unit 100 can be realized by hardware such as various processors (CPU, DSP, etc.), ASIC (gate array, etc.), and programs.

  The processing unit 100 includes a game calculation unit 110, an object space setting unit 111, a virtual camera control unit 112, a movement / motion processing unit 113, a game evaluation value calculation unit 115, a communication control unit 120, a drawing unit 130, and a sound generation unit 140. Including. Note that some of these may be omitted.

  The game calculation unit 110 performs a game calculation based on the input information and game data received from another node. The game calculation means 110 advances the game when the game calculation means game start condition is satisfied. There are a process, a process of arranging an object such as a character or a map, a process of displaying an object, a process of calculating a game result, or a process of ending a game when a game end condition is satisfied.

  The game calculation unit 110 according to the present embodiment sets the physical strength value of each player to an initial value (for example, 100) at the start of the game, and a game period (for example, for 90 seconds) from the start of the game to the end of the game. ) For each frame, hit determination processing is performed based on input information from each player, and based on the hit determination result, the stamina value of each player character is subtracted, and the stamina value of each player character becomes zero. An arithmetic process for determining a game result (win / loss, draw) based on whether or not the game has been performed may be performed. It should be noted that, when the player's physical strength value is greater than 0 at the time when the game period has elapsed, the game calculation unit 110 determines that the physical strength value of one player character is higher than the physical strength value of the other player character. If the value is large, one player character may be determined to win, the other player character may be determined to lose, and if the physical strength values are the same, it may be determined to be a draw.

  The object space setting unit 111 is a primitive such as a player character, a moving body, a building, a stadium, a car, a tree, a pillar, a wall, a display object such as a map (terrain) (polygon, free-form surface, or subdivision surface). The object is configured to be placed in the object space. In other words, the position and rotation angle of the object in the world coordinate system (synonymous with direction and direction) are determined, and the rotation angle (rotation angle around the X, Y, and Z axes) is determined at that position (X, Y, Z). Arrange objects.

  The virtual camera control unit 112 performs a virtual camera control process for generating an image that can be viewed from a given (arbitrary) virtual camera (viewpoint) in the object space. Specifically, processing for controlling the position (X, Y, Z) or rotation angle (rotation angle about the X, Y, Z axis) of the virtual camera (processing for controlling the viewpoint position, the line-of-sight direction or the angle of view) I do. Further, the angle of view may be controlled.

  For example, when an object (for example, a player character, a ball, or a car) is photographed from behind using a virtual camera, the virtual camera position or rotation angle (virtual) is set so that the virtual camera follows changes in the position or rotation of the object. Control camera orientation). In this case, the virtual camera can be controlled based on information such as the position, rotation angle, or speed of the object obtained by the movement / motion processing unit. Alternatively, the virtual camera may be controlled to rotate at a predetermined rotation angle or to move along a predetermined movement path. In this case, the virtual camera is controlled based on the virtual camera data for specifying the position (movement path) or rotation angle of the virtual camera. When there are a plurality of virtual cameras (viewpoints), the above control process is performed for each virtual camera.

  The movement / motion processing unit 113 performs a movement / motion calculation (movement / motion simulation) of a model (character, car, train, airplane, etc.). That is, the model is moved in the object space or the object is moved (motion, animation) based on operation data input by the player through the operation unit 160, a program (movement / motion algorithm), various data (motion data), or the like. ) Process. Specifically, object movement information (position, rotation angle, speed, or acceleration) and motion information (position or rotation angle of each part that constitutes the object) are sequentially transmitted every frame (1/60 seconds). Perform the required simulation process. A frame is a unit of time for performing object movement / motion processing (simulation processing) and image generation processing.

  In particular, the movement / motion processing unit 113 of the present embodiment can perform processing for moving / moving the player character to be operated by the player based on input information from the player.

  Further, based on the game data of the other node included in the packet transmitted by the communication control unit 120 described later, the player character of the other node is moved / moved in the same object space as the player character of the own node. Processing can be performed.

  Further, the destination information can be the IP address and port number of each node constituting the game system. The IP address may be a global IP address for specifying a specific game machine on the Internet or WAN, or may be a private IP address for specifying a specific game machine on the LAN.

  Communication control unit 120, processing for generating a packet to be transmitted to another node (may be another game device), processing for designating the IP address and port number of the game machine that is the packet transmission destination, and data included in the received packet Processing to be stored in the storage unit 170, processing to analyze received packets, control processing related to transmission / reception of other packets, and the like are performed.

  A packet is a cluster that communicates via a network, and refers to data composed of a header including a transmission source IP address and a transmission destination IP address, and data written at the transmission source as a payload.

  Further, in order to realize application-level communication, a packet is generated by designating a port number that identifies the type of application corresponding to the TCP or UDP protocol to be used. For example, the TCP protocol has high data transmission / reception reliability, and uses, for example, an acknowledgment or retransmission. Further, the TCP protocol can perform retransmission processing of lost data, and can further secure a data transmission order and transmit a packet to a destination game machine. On the other hand, in the UDP protocol, even if data is lost in the middle of transmission, it may not be retransmitted and may be transmitted in a reversed order. However, since the UDP protocol has no overhead compared to the TCP protocol, it may be suitable for online games that transmit data in real time. When using the UDP protocol, the game data to be input to the buffer is input in the order of identification numbers (ascending order). If the game data of the identification numbers to be input has not arrived, a request is made to another machine. It may be. In this embodiment, any protocol can be supported. If the UDP protocol is used, the input order of game data to the buffer may be controlled to be input in ascending order of identification information (identification number).

  The communication control unit 120 according to the present embodiment generates a packet according to the frame rate at which an image is drawn, and performs processing for transmitting the generated packet to another node at the connection destination. More specifically, for example, when the frame rate is 60 fps, the IP address of the second game machine is used for the transmission destination IP address and transmission destination port number of the packet header every 1/60 seconds. Specify the port number to be used, specify the IP address and source port number of the header in the header, specify the IP address of the first game machine and the port number to be used, and input data including game data into the payload of the packet Then, a process of transmitting the generated packet to another node is performed.

  Data including input information (including operation information) from a player who operates the game machine for each frame. For example, the game data can be data indicating the presence or absence of input information, or the content of the input information when there is input information. For example, when the game data is indicated by a numerical value, the game data is set to “0” when there is no input information, and the game data is set to “1” when there is input information and the content is input from the A button. If there is input information and the content is input from the B button, the game data is “2”. If there is input information and the content is input from the A and B buttons, the game data is “3”. It is good also as.

  Here, the identification information is data common to a plurality of game machines (first and second game machines) given for each frame. In the present embodiment, the information given to each frame according to the elapsed time can be used with reference to the time when the connection between the first game machine and the second game machine is established. For example, in a game machine, a sequential identification number (a positive integer starting from 1) associated with game data acquired according to the frame rate can be used.

  For example, considering the case where the frame rate is 60 fps, identification information is associated with game data acquired every 1/60. For example, in each of the first game machine and the second game machine, the game data acquired when the connection is established is associated with the identification number “1” and acquired 1/60 seconds after the connection is established. An identification number “2” is associated with the game data, and an identification number “3” is associated with the game data acquired 2/60 seconds after the connection is established.

  In addition, the communication control unit 115 according to the present embodiment performs a process of receiving a packet transmitted from the second game machine. Then, the received packet is analyzed, and data including game data included in the payload of the packet is acquired.

  The communication control unit 120 configures a network between nodes and transmits / receives game data between nodes via the network, and includes a network setting unit 125.

  The network setting unit 125 performs processing for obtaining and managing network information necessary for the game system. In particular, the network setting unit of the present embodiment is individually assigned to identify each node (game machine or player character of the game machine) node identification information (nodes that can participate in the online game). Data) and destination information for specifying the destination of the packet associated with the node identification information are acquired and managed.

  The game evaluation value calculation unit 115 calculates a game evaluation value for group determination based on at least one of the game situation and the game parameter of the player character, and the communication control unit 120 determines a node based on the game evaluation value for group determination. Communication frequency control for grouping and making the communication frequency for transmitting / receiving game data between nodes in the group higher than the communication frequency for transmitting / receiving game data between nodes outside the group, and network connection between nodes in the group Network connection control is performed to make the network connection denser than the network connection between nodes outside the group.

  The communication control unit 120 also has a clustering processing unit 121 for clustering the nodes constituting the group, and an intra-cluster communication control process for configuring a network between nodes belonging to the same cluster and transmitting / receiving game data via the network. A network between the cluster representative node 123, the cluster representative determination unit 123 that determines the representative node of the cluster based on at least one of the information on the communication state of the nodes belonging to the cluster and the predetermined rule, and the game An inter-cluster communication control processing unit 124 that performs data transmission / reception, and a communication frequency for transmitting / receiving game data between nodes in the cluster and a communication frequency for transmitting / receiving game data between nodes outside the cluster. Communication frequency control and class to control differently At least one network connection control for controlling differently the degree of density of the network connection between the network connection and outside the cluster of nodes between nodes of the inner may be performed.

  In addition, the communication control unit 120 controls the communication frequency so that the communication frequency for transmitting and receiving game data between nodes in the cluster is higher than the communication frequency for transmitting and receiving game data between nodes outside the cluster, and the nodes in the cluster. Network connection control may be performed so that the network connection between the nodes is denser than the network connection between nodes outside the cluster.

  At least one of the game situation and the game parameters (position data, etc.) of the player character includes information regarding the position of the player character, and the game evaluation value calculation unit 115 performs the game evaluation of the player character based on the information regarding the position of the player character. The value may be calculated.

  When the cluster suitable for a node changes to a different cluster from the cluster assigned to the node due to a change in the game evaluation value, the clustering processing unit 121 performs a cluster change process for changing the cluster assigned to the node. You may go.

  The inter-cluster communication control processing unit 124 uses the cluster representative node defined as the adjacent cluster and the network based on the adjacent cluster information that defines the cluster information directly connected to the cluster to which the cluster belongs. You may connect and perform communication between clusters.

  The communication control unit 120 receives the node information of the master node from a node other than the master node and performs test communication with the master node based on the result of the test communication. A node information management processing unit 127 that performs processing for associating the communication state information of the selected node with the node as node information and transmitting the stored node information to other nodes.

  The clustering processing unit 121 may limit the number of nodes in the cluster and perform processing for clustering the nodes within a range in which the number of nodes in the cluster does not exceed the limit value.

  The clustering processing unit 121 sets a limit on the number of nodes in the cluster. When the number of nodes in the cluster exceeds the limit value, the clustering processing unit 121 divides the cluster into a plurality of clusters configured with a number of nodes that do not exceed the limit value. You may perform the process to do.

  The intra-cluster communication control processing unit 122 may perform intra-cluster communication by interconnecting nodes belonging to the same cluster with a full-connect network structure.

  The clustering processing unit 121 performs processing for clustering a plurality of nodes representing the cluster as upper clusters, and the intra-cluster communication control processing unit 122 configures a network between nodes belonging to the same upper cluster, and passes through the network. The game data is transmitted and received, and the cluster representative determining unit 123 determines the representative node of the upper cluster based on at least one of the information regarding the communication state of the node belonging to the upper cluster and the predetermined rule, and the inter-cluster communication control processing unit 124 may configure a network between the representative nodes of the upper cluster to transmit / receive game data.

  The game world is divided into a plurality of areas, and at least one of the game situation and the game parameters of the player character includes area information to which the player character belongs, and the game evaluation value calculation unit 115 is based on the area information. The game evaluation value corresponding to the area to which the player character belongs may be obtained.

  At least one of the game situation and the game parameter of the player character includes virtual camera information related to the placement of the virtual camera, and the game evaluation value calculation unit 115 obtains a game evaluation value corresponding to the player character based on the virtual camera information. May be.

  The drawing unit 130 performs drawing processing based on the results of various processing (game processing) performed by the processing unit 100, thereby generating an image and outputting the image to the display unit 190. When generating a so-called three-dimensional game image, first, object data (model data) including vertex data (vertex position coordinates, texture coordinates, color data, normal vector, α value, etc.) of each vertex of the object (model) ), And vertex processing (shading by a vertex shader) is performed based on vertex data included in the input object data (model data). When performing the vertex processing, vertex generation processing (tessellation, curved surface division, polygon division) for re-dividing the polygon may be performed as necessary. In the vertex processing, according to the vertex processing program (vertex shader program, first shader program), vertex movement processing, coordinate conversion (world coordinate conversion, camera coordinate conversion), clipping processing, perspective processing, and other geometric processing are performed. On the basis of the processing result, the vertex data given to the vertex group constituting the object is changed (updated or adjusted). Then, rasterization (scan conversion) is performed based on the vertex data after the vertex processing, and the surface of the polygon (primitive) is associated with the pixel. Subsequent to rasterization, pixel processing (shading or fragment processing by a pixel shader) for drawing pixels (fragments forming a display screen) constituting an image is performed. In pixel processing, according to a pixel processing program (pixel shader program, second shader program), various processes such as texture reading (texture mapping), color data setting / change, translucent composition, anti-aliasing, etc. are performed, and an image is processed. The final drawing color of the constituent pixels is determined, and the drawing color of the perspective-transformed object is output (drawn) to the image buffer 174 (buffer that can store image information in units of pixels; VRAM, rendering target). That is, in pixel processing, per-pixel processing for setting or changing image information (color, normal, luminance, α value, etc.) in units of pixels is performed. Thereby, an image that can be seen from the virtual camera (given viewpoint) in the object space is generated. Note that when there are a plurality of virtual cameras (viewpoints), an image can be generated so that an image seen from each virtual camera can be displayed as a divided image on one screen.

  Note that the vertex processing and pixel processing are realized by hardware that enables polygon (primitive) drawing processing to be programmed by a shader program written in a shading language, so-called programmable shaders (vertex shaders and pixel shaders). Programmable shaders can be programmed with vertex-level processing and pixel-level processing, so that the degree of freedom of drawing processing is high, and expressive power is greatly improved compared to conventional hardware-based fixed drawing processing. Can do.

  The drawing unit 130 performs geometry processing, texture mapping, hidden surface removal processing, α blending, and the like when drawing an object.

  In the geometry processing, processing such as coordinate conversion, clipping processing, perspective projection conversion, or light source calculation is performed on the object. Then, the object data (positional coordinates of object vertices, texture coordinates, color data (luminance data), normal vector, α value, etc.) after geometry processing (after perspective projection conversion) is stored in an object data storage unit (not shown). Saved.

  Texture mapping is a process for mapping a texture (texel value) stored in the texture storage unit of the storage unit 170 to an object. Specifically, the texture (surface properties such as color (RGB) and α value) is read from the texture storage unit of the storage unit 170 using the texture coordinates set (given) to the vertex of the object. Then, a texture that is a two-dimensional image is mapped to an object. In this case, processing for associating pixels with texels, bilinear interpolation or the like is performed as texel interpolation.

  As the hidden surface removal processing, hidden surface removal processing can be performed by a Z buffer method (depth comparison method, Z test) using a Z buffer (depth buffer) to which a Z value (depth information) of a drawing pixel is input. . That is, when a drawing pixel corresponding to the primitive of the object is drawn, the Z value input to the Z buffer is referred to. Then, the Z value of the referenced Z buffer is compared with the Z value at the drawing pixel of the primitive, and the Z value at the drawing pixel is a Z value (for example, a small Z value) on the near side when viewed from the virtual camera. In some cases, the drawing process of the drawing pixel is performed and the Z value of the Z buffer is updated to a new Z value.

  α blending (α synthesis) is a translucent synthesis process (usually α blending, addition α blending, subtraction α blending, or the like) based on an α value (A value).

  The α value is information that can be stored in association with each pixel (texel, dot), for example, plus alpha information other than color information. The α value can be output as mask information, translucency (equivalent to transparency and opacity), bump information, and the like.

  The drawing unit 130, the object space setting unit 111, and the virtual camera control 112 function as an image generation unit that generates a game image of the game world based on the game calculation result.

  The sound generation unit 140 performs sound processing based on the results of various processes performed by the processing unit 100, generates game sounds such as BGM, sound effects, or sounds, and outputs the game sounds to the sound output unit 192.

2. Method of the present embodiment (1) Clustering process In this embodiment, in a multiplayer game that performs online communication battles and cooperative play, a game with Peer to Peer (Peer to Peer, Peer to Peer) without installing a dedicated server. Connect the machines and configure a network topology that allows multiple players to play. Peer to Peer (Peer to Peer) is one of the architectures when communicating between a large number of terminals, and is a communication system characterized by peer peers communicating with each other.

  FIG. 2 is a diagram showing an example of grouping (clustering processing) according to the present embodiment.

  The nodes ND001 to ND009 are communication units set corresponding to the player characters PC1 to PC9 (may be a player who operates the player character), and are connected to one or more other nodes to transmit and receive game data. .

  The game data is data determined according to game specifications, and may be, for example, character position and rotation information, game parameters, key information (input key information), counter information, and event information. Information such as a trigger may be used.

  When a game is played by connecting a plurality of game devices corresponding to one player to one game device (which may be a game information generation device), one node exists in one game device. Further, for example, when a plurality of game devices (game devices corresponding to n players for one game device) are connected to perform a communication battle by dividing a screen and playing n players on one game machine, There are n nodes in the game device. In such a case, a plurality of nodes corresponding to one game machine have different port numbers with the same IP address.

  In the present embodiment, the nodes are grouped based on the game evaluation value for group determination, and the communication frequency for transmitting / receiving game data between the nodes in the group is the communication frequency for transmitting / receiving game data between the nodes outside the group. At least one of communication frequency control to be higher and network connection control to make network connection between nodes in the group denser than network connection between nodes outside the group.

  The game evaluation value is a value determined based on at least one of the game situation and the game parameter of the player character. For example, the game evaluation value may be determined based on position data of the player character in the game world (an example of a game parameter). For example, based on the distribution of position coordinates in the game world, player characters whose distances are within a predetermined value (near) may be grouped. The distance between the player characters in the game world may be obtained at a given timing (for example, at the start of the game), and the player characters whose distances are within a predetermined value may be grouped. Then, after forming the group, the nodes constituting the group may be changed by recalculating the distance between the player characters in a predetermined cycle. Further, the group to which the node belongs may be changed by changing the position of each player character.

  Alternatively, a plurality of player characters that represent the group may be extracted, and the player characters that are in a predetermined positional relationship (may be within a predetermined distance) with the player character may be grouped based on the extracted player characters.

  Further, the game space may be divided into a plurality of areas, and a game evaluation value corresponding to the area to which the player character belongs may be obtained. For example, in the case of a game in which the virtual camera follows the player character, the game evaluation value of the player character may be obtained based on the arrangement (position, rotation, angle of view) of the virtual camera.

  Here, the game evaluation values of the player characters PC1 to PC9 corresponding to the nodes ND001 to ND009 are GV1 to GV9, respectively GV1 = 1, GV2 = 1, GV3 = 1, GV4 = 2, GV5 = 1, GV6 = 3. , GV7 = 3, GV8 = 3, and GV9 = 3. In such a case, a set of nodes ND001 to D003 having a player character game evaluation value of 1 is grouped (KL001), and a set of nodes ND004 and D005 having a player character game evaluation value of 2 is grouped (KL002). ), And a set of nodes ND006 to D009 having a player character game evaluation value of 3 may be grouped (KL003). Within a group, each node may be interconnected (interconnected with a fully connected network structure) with all other nodes in the group. In inter-node communication α1, α2, and α3 within the group, game data is exchanged at the first communication frequency.

  Since game data of nodes in other groups (nodes outside the group) is also necessary, game data is transmitted and received between groups. Data transmission / reception between groups may be performed by a group representative (called a cluster server).

  Grouping may be realized by clustering processing. Hereinafter, the group is referred to as a cluster. In FIG. 2, the cluster server of the cluster KL001 is the node ND001, the cluster server of the cluster KL002 is ND004, and the cluster server of the cluster KL003 is ND006.

  For example, the game data of the cluster KL001 (which may be a set of game data of the nodes ND001, ND002, and ND003 constituting the cluster KL001) is the cluster server of the cluster ND001 of the cluster KL001 and the cluster server of the adjacent cluster (cluster directly connected) KL002. Send to ND004. The cluster server ND001 of the cluster KL001 receives the game data of the cluster KL002 and the game data of the non-adjacent cluster (cluster not directly connected) KL003 from the cluster server ND004 of the adjacent cluster KL002. In this way, the cluster server receives the game data of the non-adjacent cluster (cluster not directly connected) KL003 via the cluster server ND006 of the adjacent cluster KL002.

  Such game data transmission / reception of the inter-cluster communication β is performed at a second communication frequency lower than the first communication frequency. By doing so, the time lag for other nodes in the group (in the cluster) can be made smaller than the time lag for other nodes outside the cluster (outside the group). In other words, the communication environment between nodes can be sharpened according to the situation of the game world, so that efficient communication control that minimizes the effect on the game due to communication delay is performed while preventing an increase in network load. be able to.

  The received cluster information is transmitted from the cluster server ND001 to the other nodes ND002 and ND003 in the cluster (intra-cluster communication). As described above, the nodes ND002 and ND003 other than the cluster server in the cluster receive the game data of the other clusters KL002 and KL003 via the cluster server ND001, and the other clusters KL002 and ND002 via the cluster server ND001. Game data can be transmitted to KL003.

  Node connection information is managed within the node. As will be described later with reference to FIG. 8, each node may hold a connection information table between nodes. Each node may hold connection information for all nodes, or may have connection information for only some nodes. In addition, since connection information of distant clusters is often unnecessary, each node may hold node connection information only for a cluster to which the node belongs and a cluster to which the node is directly connected.

  As shown in FIG. 2, the cluster servers do not have to be fully connected. The game data of the cluster server that is not directly connected may be obtained via the cluster server that is directly connected.

  FIG. 9 is a diagram for explaining the upstream node and the downstream node.

  Node ND001, which is the cluster server of cluster KL001, node ND004, which is the cluster server of cluster KL002, and node ND006, which is the cluster server of cluster KL003, are group A (320), and nodes ND002, ND003, ND005, ND007, ND008, and ND009 Assuming group B (310), group A (320) is an upstream node of group B (310). Group B (310) is a downstream node of group A (320).

  The cluster server is a node having a good communication environment in each cluster (for example, the communication state information 240 shown in FIG. 7 is good, and the communication state information is given in round trip time (RTT), the RTT is shorter) You may make it become.

  In this way, the upstream node has a better communication state than the downstream node. The upstream node is connected to an adjacent upstream node and exchanges data of its own downstream node between the upstream nodes. When a node moves to another cluster as described in the cluster change process described later, the connection of the node in the cluster is reestablished. When the upstream node moves to another cluster, the communication environment on the downstream node The better node becomes the upstream node.

  By clustering nodes according to game evaluation values, even if there is some delay in game data of a distant cluster, it is possible to prevent the game image of the node from being affected so much, and traffic caused by communication is adversely affected. Can be effectively reduced.

  In the present embodiment, the same program is installed in each game device (node). The program includes an algorithm for realizing a plurality of functions, and is configured so that a function corresponding to the role of the node can be realized. For example, the program can be called “intra-cluster communication control processing routine (processing when the node is a cluster server)”, “inter-cluster communication control processing routine”, “cluster representative judgment processing routine” or “test communication processing routine (node is master). If the node is a cluster server, the “inter-cluster communication control processing routine (processing when the node is a cluster server)” is included. However, if the node is not a cluster server, the “inter-cluster communication control processing routine (processing when the node is a cluster server)” is not executed. In the present embodiment, since the cluster server may change during the game, a program capable of executing all the above processes is installed in all nodes.

(2) Cluster Server Determination Processing Next, cluster server determination processing will be described. Each node determines a cluster server with the same algorithm (program) based on the communication state information of the nodes belonging to the cluster. Each node can obtain the communication state information of the node included in the node information held by itself.

  The information possessed by each node may be node information (including an IP address, a port number, and communication state information) of all nodes, and cluster information that identifies nodes constituting the same cluster.

  FIG. 7 is a diagram for describing node information according to the present embodiment.

  The node information 200 is information including an IP address 220, a port number 230, and communication state information 240 of each node, and is stored in association with the node ID 210 of each node. The communication status information 240 is information relating to the communication status of each node, and is, for example, a round trip time (RTT) or a round trip delay time in test communication with the master node. (The time it takes for the confirmation response of the other party to return after sending certain data) may be used. The test communication with the master node may be performed when the node participates in the game. Thereafter, the update may be performed at a predetermined timing, or may not be updated in order not to increase the network load.

  Each node has node information of all nodes participating in the game (in the same game world). Information on all nodes participating in the game is managed by a node set as a master node. That is, when the communication status information 240 is not updated, the node information is updated when a new node participates in the game or when a node currently participating in the game leaves the game. When a new node participates in a game, as described later, a game node application is submitted to the management server, the master node managing the game world to be joined is introduced from the management server, and the master node permits participation. Will receive. Therefore, since the master node knows the node participating in the game, the node information is updated when the participation permission is given. That is, node information related to a newly joined node is added. The node that has applied for participation and the master node perform test communication, and at that time, the RTT information may be used as the communication state information 240 of the node.

  8A to 8C are diagrams for explaining the cluster information.

  8A is cluster information of the cluster KL001 in FIG. 2, FIG. 8B is cluster information of the cluster KL002 in FIG. 2, and FIG. 8C is a cluster information in the cluster KL003 in FIG. Information. The cluster information includes configuration node information (node ID of the configuration node) 210 that is information for specifying the nodes configuring each cluster. In addition, the position information 270 of the player character corresponding to the constituent node and the cluster server flag 280 indicating whether or not the constituent node is a cluster server may be included, but are not essential. Note that the player character position information 270 may refer to the player character position information included as game data.

  Each node belonging to the cluster has cluster information regarding its own cluster. That is, the nodes ND001, ND002, and ND003 belonging to the cluster KL001 in FIG. 2 have the cluster information of the cluster KL001 (FIG. 8A), and the nodes ND004 and ND005 belonging to the cluster KL002 in FIG. 2 are the clusters of the cluster KL002. The nodes ND006, ND007, ND008, and ND009 belonging to the cluster KL003 of FIG. 2 have the cluster information of the cluster KL003 (FIG. 8C).

  The node of each cluster grasps which node is the cluster server of the cluster to which the cluster belongs based on the cluster information of the cluster to which the cluster belongs, and based on the node information shown in FIG. 7, the communication address (IP address and port number) of the cluster address ) Can be obtained. For example, the node ND001 grasps that the nodes belonging to the same cluster as the node ND002 and ND003 are based on the cluster information of the cluster KL001. Based on the node information, the communication status information of the nodes ND001, ND002, and ND003 can be acquired, and the cluster server is determined based on the communication status information. For example, as a rule for selecting a cluster server, it is determined that “the node with the best communication state in the cluster is the cluster server”, so that each node in the cluster can determine the cluster server individually. The same node can be uniquely determined as a cluster server.

  The cluster server is determined when the cluster server is changed for some reason. If a new cluster server is determined when the cluster server is changed, the cluster server flag in the cluster information is updated. As long as the cluster server is not changed, the cluster server flag is referenced to determine the node that is the cluster server.

(3) Cluster Change Processing FIGS. 3 and 4 are diagrams for explaining the cluster change processing.

  In this embodiment, when a cluster suitable for a node is changed to a cluster different from the cluster assigned to the node due to a change in the game evaluation value, a cluster change process is performed for changing the cluster assigned to the node. Here, a case where the game world is divided into a plurality of areas, a game evaluation value corresponding to the area to which the player character belongs is obtained, and a cluster is formed will be described as an example.

  FIG. 3 shows changes in the position of the player character in the game world. The game world is divided into a plurality of areas E1 to E10 as shown in FIG. 400-t1 indicates the position distribution of the player characters PC001 to PC009 in the game world at time t1. As shown in the drawing, the player characters PC001 to PC003 exist in the area E1, the player characters PC004 and PC005 exist in the area E2, and the player characters PC006 to PC009 exist in the area E3.

  Since the nodes as communication units are set corresponding to the player characters, ND001 to ND009 correspond to PC001 to PC009, respectively.

  In such a case, nodes corresponding to player characters existing in the same area may be assigned to the same cluster and clustered.

  Since player characters existing in the same area are located close together in the game world, there is a high possibility that they will appear in the same image. FIG. 16 shows an example of a game image generated for the player character PC001. The game image 410 generated for the player character PC001 is a game image displayed on the display unit of the player who operates the player character PC001, and the game space (game world is three-dimensional) from the virtual camera following the player character PC001. (If it is). In the game image 410, as shown in FIG. 16, there is a high possibility that images of the player characters PC002 and PC003 that are close to the player character PC001 (present in the same area) will be generated. On the other hand, there is a low possibility that images of the player characters PC004 to PC009 separated from the player character PC001 (existing in different areas) will be generated. That is, it is preferable to update the information of player characters located in the same area without time lag because the probability of being reflected in the game image is high, but the probability that the information of player characters located in different areas in the game world is reflected in the game image In many cases, there is no problem even if there is some time lag even though it is reflected by communication delay.

  400-t1 in FIG. 4 indicates the network configuration of the node corresponding to the player character in the position distribution of 400-t1 in FIG.

  At time t1, nodes ND001 to ND003 corresponding to player characters PC001 to PC003 belonging to the same area E1 in the game world are clustered in the same cluster KL001.

  At time t1, the nodes ND004 and ND005 corresponding to the player characters PC004 and PC005 belonging to the same area E2 in the game world are clustered in the same cluster KL002.

  At time t1, nodes ND006 to ND009 corresponding to player characters PC006 to PC009 belonging to the same area E3 in the game world are clustered in the same cluster KL003.

  400-t2 in FIG. 3 indicates the position distribution of the player characters PC001 to PC009 in the game world at time t2. The player character PC02 located in the area E1 at time t1 is located in the area E2 at time t2. Further, the player character PC006 located in the area E3 at the time t1 leaves the game and does not exist in the game world at the time t2. Therefore, at time t2, the player characters PC001 and PC003 exist in the area E1, the player characters PC002, PC004, and PC005 exist in the area E2, and the player characters PC007 to PC009 exist in the area E3.

  400-t2 in FIG. 4 shows the network configuration of the node corresponding to the player character in the position distribution of 400-t2 in FIG.

  As the area of the player character PC002 changes from time t1 to time t2, the cluster to which the node ND002 corresponding to the player character PC002 belongs has changed from KL001 to KL002. When the node ND002 detects that the area to which the player character PC002 belongs has changed from E1 to E2, the node ND002 determines that the cluster suitable for the node corresponding to the player character PC002 is KL002. However, since the cluster assigned to the node ND002 at that time is KL001, a process of leaving the cluster KL001 and joining the cluster KL002 is performed.

  When leaving, a notification to leave is transmitted to the other nodes ND001 and ND002 belonging to the cluster KL001 that belonged so far. The nodes ND001 and ND003 in the cluster that have received the leave notification update the cluster information held by themselves. That is, the node ND002 is deleted from the configuration node information of the cluster information of KL001. Since the node ND002 is not a cluster server, the process for determining a new cluster server is not performed. If the node that made the leave notification is a cluster server, a process for determining a new cluster server of the cluster is performed.

  Further, the node ND002 determines which node the cluster server of the cluster KL002 is based on the cluster information of the cluster KL002, and applies to the node that is the cluster server.

  In the description of the cluster information in FIG. 8, each node has been described as holding cluster information of the cluster to which it belongs, but each node also has cluster information (referred to as adjacent cluster information) of the directly connected cluster. You may hold. For example, in FIG. 2, the cluster KL001 is directly connected to the cluster KL002, but is not directly connected to the cluster KL003. In such a case, each of the nodes ND001 to ND003 belonging to the cluster KL001 has the cluster information of the cluster KL002 as the adjacent cluster information.

  Further, for example, at 400-t1 in FIG. 4, the cluster KL001 is directly connected to the clusters KL002 and KL003. In such a case, the nodes ND001 to ND003 belonging to the cluster KL001 have the cluster KL002 and the cluster KL003 as adjacent cluster information. Cluster information.

  Therefore, the node ND002 recognizes that the cluster server of the cluster KL002 is ND004 based on the cluster information of KL002, acquires the IP address and port number of ND004 based on the node information (see FIG. 7), and sends it to the node ND004. In contrast, an application for participation in cluster KL002 is transmitted. The node ND004 that has received the participation application determines whether to participate or not.

  For example, when there is a limit on the number of nodes in the cluster, participation is permitted if the number of nodes in the cluster does not exceed the limit value. In addition, if the number of nodes in the cluster exceeds the limit value, the cluster is divided into a plurality of clusters composed of nodes that do not exceed the limit value, and participation in any of the clusters after the division is performed. You may allow it.

  In FIG. 4, the node ND002 is allowed to participate in the cluster KL002, and the nodes constituting the cluster KL002 are ND002, ND004, and ND005. The node ND004, which is the cluster server of the cluster KL002, updates the cluster information of the KL002 held by itself and notifies the other nodes ND005 in the cluster of the participation of the new node ND002. The nodes ND005 and ND002 in the cluster that have received the participation notification update the cluster information held by itself. That is, the node ND002 is added to the configuration node information of the cluster information of KL002.

  The configuration of the cluster KL003 to which the node ND006 corresponding to the player character PC006 belongs has changed as the player character PC006 leaves the game world or is disconnected from time t1 to time t2. For example, when the node ND006 leaves the game world, the node ND006 transmits a leave notification to the other nodes ND007 to ND009 belonging to the same cluster, so that the other nodes ND007 to ND009 belonging to the same cluster that have received the node ND006 Know the withdrawal. Further, for example, when the communication disconnection of the node ND006 occurs, the other nodes ND007 to ND009 belonging to the same cluster grasp the communication disconnection of the node ND006 because the communication with the node ND006 becomes impossible.

  The other nodes ND007 to ND009 belonging to the same cluster that grasped the disconnection or communication disconnection of the node ND006 know that the node ND006 was a cluster server based on the cluster information held by the node ND006. Perform the decision process. Each node uniquely determines a new cluster server as the node ND009 based on the same algorithm, node information and cluster information held by each node, and updates its own cluster information.

  Also, the node ND009 that has become a new cluster server of the cluster KL003 transmits / receives game data of the cluster to / from nodes ND001 and ND004 that are cluster servers of other clusters.

(4) Cluster Hierarchical Structure When there are many clusters, more efficient processing can be performed by clustering cluster servers.

  FIG. 5 is a diagram for explaining the hierarchical structure of a cluster.

  Nodes ND001, ND004, and ND006 that are cluster servers are clustered to form an upper cluster SKL01, and nodes ND0010, ND013, and ND015, which are cluster servers, are clustered to form an upper cluster SKL02.

  The nodes ND001, ND004, and ND006, which are cluster servers belonging to the same upper cluster SKL01, may be interconnected (interconnected in a full-connect network structure) with all other nodes in the upper cluster SKL01. In inter-node communication β1, β2, and β3 in the upper cluster, game data is exchanged at the third communication frequency.

  Since game data of nodes of other upper cluster SKL02 is also necessary, game data is transmitted and received between the upper clusters. Data transmission / reception between the upper clusters may be performed by a cluster server of the upper cluster.

  In FIG. 5, the cluster server of the upper cluster SKL01 is the node ND006, and the cluster server of the upper cluster SKL02 is ND0010.

  For example, the game data of the upper cluster SKL01 is transmitted from the cluster server ND006 of the upper cluster SKL01 to the cluster server ND010 of the adjacent upper cluster (directly connected upper cluster) SKL02. Further, the cluster server ND006 of the upper cluster SKL01 receives the game data of the upper class STA02 from the cluster server ND010 of the adjacent upper cluster SKL02.

  Such transmission / reception of the game data of the upper inter-cluster communication γ is performed at a fourth communication frequency lower than the third communication frequency. By doing in this way, the time lag with respect to the other nodes in the higher cluster can be made smaller than the time lag with respect to the other nodes outside the higher cluster.

(5) Flow of participation and withdrawal in game FIGS. 6 and 10 are diagrams for explaining the flow of participation and withdrawal in the game.

  First, when the node ND-A participates in a game in a given game world, it makes an inquiry (b1 in FIG. 10) to the management server (b1 in FIG. 10), and the management server 510 in the given virtual world. The master node (ND-M in FIG. 10) that receives an application for participation in the game is introduced. Specifically, the IP address and port number of the master node are received from the management server 510.

  The node ND-A receiving the introduction of the master node makes an application for participation in the game in the given virtual world to the master node ND-M (a1 in FIGS. 6 and 10). When the permission of participation is received from the master node (a2 in FIGS. 6 and 10), the node ND-A determines the start point (belonging cluster). For example, when the start point of the game (the start point of the player character of the node ND-A) is the area E1 in FIG. 3, the belonging cluster is determined to be KL001. Which node is the cluster server of the affiliated cluster KL001 may be determined by obtaining cluster information of the affiliated cluster from the master node.

  A cluster affiliation request is made to the cluster server (upstream node of the cluster) of the affiliation cluster (a3 in FIGS. 6 and 10), and the connection between the node ND-A and the nodes ND001, ND002, and ND003 in the cluster is established. (A4 in FIG. 6, a4-1, a4-2, a4-3 in FIG. 10), the game data of the node ND-A is transmitted to the cluster server ND001 which is the cluster upstream node and the ND002 and ND003 which are the cluster downstream nodes. (A5 and a6 in FIG. 6), the game data of the cluster server ND001 that is the cluster upstream node and the ND002 and ND003 that are the cluster downstream nodes are transmitted to the node ND-A (a7 and a8 in FIG. 6), and the information in the cluster When the nodes can be shared with each other, the node ND-A can start the game (a9 in FIG. 6).

  When the node ND-A needs information other than the belonging class KL001, the node ND-A makes a request at any time via the node (upstream node) ND001 which is the cluster server of the belonging cluster (a10 in FIG. 6). Information other than the belonging class KL001 is received via the node (upstream node) ND001 which is a cluster server of the belonging class KL001 cluster (a11 in FIG. 6).

  When a cluster downstream node (for example, ND003) leaves a cluster change or game (free out), the cluster downstream node (for example, ND003) leaves the node (upstream node) ND001 that is a cluster server of the belonging class KL001 cluster. An application is made (a12 in FIG. 6). When the node (upstream node) ND001 which is a cluster server of the belonging class KL001 cluster permits the withdrawal, it notifies the cluster downstream node (for example, ND003) of the withdrawal permission (a13 in FIG. 6), and the other cluster A withdrawal notice is sent to the downstream nodes (including node ND-A) (a14 in FIG. 6), and a withdrawal notice is also sent to the master node (a15 in FIG. 6).

3. Processing of this Embodiment FIG. 11 is a flowchart showing the flow of processing when participating in a game.

The node that wishes to participate in the game makes an inquiry to the matching server (step S10), and receives master node information from the matching server (step S20).
Next, an application for participation is made to the master node, and test communication is performed together (step S30). The master node creates node information of the node that has accepted the participation application. At this time, the round trip time (RTT) of the node is acquired in the test communication and stored as the communication state information of the node information of the node.

  When the node that wishes to participate in the game receives the participation permission notification and the cluster allocation information from the master node (step S40), the node applies to the cluster server of the allocated cluster based on the cluster allocation information (step S50). . The cluster assignment is performed based on the start point of the player character of the node. The cluster assignment may be performed by a node that wants to participate in the game or by the master node, but information for specifying the cluster server of the assigned cluster is required. The information for identifying the cluster server of the assigned cluster may be held by the previous node as a table for managing a list of cluster servers, for example. Since the master node holds the cluster information of all clusters, a table (for example, a node ID 210 in FIG. 7) that manages the cluster server information and the cluster server list that is assigned from the master node. You may receive.

  Then, the cluster information is received from the cluster server, and the connection is confirmed with other nodes constituting the cluster (step S60).

  FIG. 12 is a flowchart showing the flow of communication control processing according to the role of the node.

  The node transmits / receives game data to / from other nodes in the cluster at the first communication frequency (step S110).

  If the node is a cluster server (step S120), game data is transmitted / received to / from the cluster server of the adjacent cluster defined in the adjacent cluster information at a second communication frequency lower than the first communication frequency. This is performed (step S130).

  FIG. 13 is a flowchart showing the flow of cluster change processing (processing of a node that changes a cluster).

  Based on the information relating to the position of the player character, the game evaluation value of the player character is calculated (step S210).

  When the game evaluation value of the player character changes by a predetermined value or more (step S220), a cluster suitable for the node corresponding to the player character is obtained based on the game evaluation value of the player character (step S230).

  If the suitable cluster is different from the cluster to which it currently belongs (step S240), the current cluster is left and joined to the suitable cluster (step S250).

  FIG. 14 is a flowchart showing the flow of processing when another node in the cluster leaves the cluster.

  If there is a cluster leave notification from another node in the same cluster, the following processing is performed (step S310).

  If it is the cluster server that leaves (step S320), the next cluster server of the cluster to which it belongs is determined based on the node information (communication status information) of the nodes that make up the cluster (step S330). When the self is the next cluster server (step S340), the change of the cluster information is notified to the cluster server of the adjacent cluster defined in the adjacent cluster information (step S350).

  FIG. 15 is a flowchart showing the flow of cluster division processing.

  When there is an application for cluster participation from a given node (step S410), the following processing is performed.

  If the number of nodes in the cluster exceeds the limit due to cluster participation of a given node (Y in step S420), the nodes constituting the cluster are divided into a plurality of clusters configured with a number of nodes that do not exceed the limit. (Step S430). If the number of nodes in the cluster does not exceed the limit due to the cluster participation of the given node (N in step S420), the given node is made a member of the cluster (step S440).

  Connection confirmation is performed with other nodes constituting the cluster in which the device belongs (step S45).

  When self is a cluster server (step S460), the cluster information change is notified to the cluster server of the adjacent cluster defined in the adjacent cluster information (step S470).

  The present invention is not limited to that described in the above embodiment, and various modifications can be made. For example, terms cited as broad or synonymous terms in the description in the specification or drawings can be replaced with broad or synonymous terms in other descriptions in the specification or drawings.

  If the characters are in a situation where the influence of communication delay is high, the characters are grouped into the same group, and if the characters are in a situation where the influence of communication delay is low, the character Any configuration that is grouped into different groups is within the scope of the present invention. The case where the characters are in a situation where it is determined that the influence of communication delay is high may be, for example, the case where the positions of the characters in the game space are close or in the same area. Further, the group may be changed according to the character's ability (such as the ability to extend limbs) and the equipped item (such as a sniper gun). In other words, it is possible to determine that the influence of the communication delay is high even if the distance in the game space is slightly distant from a character that can attack even a distant target such as a character with a limb extending or a sniper gun.

  The present invention can also be applied to various game systems such as a business game system, a home game system, a portable game system, and a system board for generating a game image.

100 processing unit, 110 game calculation unit, 111 object space setting unit, 112 virtual camera control unit, 113 movement / motion calculation unit, 115 game evaluation value calculation unit, 120 communication control unit, 130 drawing unit, 140 sound processing unit 160 operation Unit, 180 information storage medium, 190 display unit, 170 storage unit, 172 main storage unit, 192 sound output unit, 196 communication unit

Claims (14)

A program for a game machine that transmits / receives game data to / from other nodes via a network,
A communication control means for configuring a network between nodes and transmitting and receiving game data between nodes via the network;
Game calculation means for performing a game calculation based on input information and game data received from another node;
Image generating means for generating a game image of the game world based on the game calculation result;
Make the computer work,
The game calculation means includes
Including a game evaluation value calculating means for calculating a game evaluation value based on the information on the position of the player character ,
The communication control means includes
Communication frequency of the group the nodes on the basis of the game evaluation values and inter-node control the degree of communication frequently between the communication frequency and outside the group of nodes transmit and receive game data to transmit and receive game data differently in in the group A program for performing at least one of control and network connection control for controlling the degree of density of network connection between nodes in the group and network connection between nodes outside the group to be different. In claim 1,
The communication control means includes
A program that groups nodes corresponding to a player character and nodes corresponding to other player characters that have a predetermined positional relationship with the player character. In claim 1 or 2,
The communication control means includes
A process of obtaining a distance between player characters based on the position of each player character and grouping nodes corresponding to the player characters whose distance is within a predetermined distance.
Program. In any one of Claims 1-3 ,
The game world is divided into a plurality of areas ,
The game evaluation value calculation means includes
A program for obtaining a game evaluation value corresponding to an area to which the position of a player character belongs. A program for a game machine that transmits / receives game data to / from other nodes via a network,
A communication control means for configuring a network between nodes and transmitting and receiving game data between nodes via the network;
Game calculation means for performing a game calculation based on input information and game data received from another node;
Based on the game calculation result, the computer functions as an image generation means for generating a game image of the game world visible from the virtual camera,
The game calculation means includes
Based on virtual camera information relating to the placement of the virtual camera, including game evaluation value calculation means for calculating a game evaluation value;
The communication control means includes
Communication frequency for grouping nodes based on the game evaluation value and controlling the communication frequency for transmitting / receiving game data between nodes in the group and the communication frequency for transmitting / receiving game data between nodes outside the group to be different A program for performing at least one of control and network connection control for controlling the degree of density of network connection between nodes in the group and network connection between nodes outside the group to be different. In claim 5,
The virtual camera information is at least one of a position, rotation, and angle of view of the virtual camera. In any one of Claims 1-6 ,
The communication control means includes
A program for judging a representative node of a group based on at least one of information on a communication state of a node belonging to the group and a predetermined rule, and transmitting / receiving game data between the representative nodes of the group . In any one of Claims 1-7 ,
The communication control means includes
The communication frequency for transmitting and receiving game data between nodes in a group, outside the group between nodes communication frequency control to be higher than a communication frequency for transmitting and receiving game data, and outside the group of network connection between nodes in the group A program for performing at least one of network connection control to be denser than the network connection between nodes. In any one of Claims 1-8 ,
The communication control means includes
The change in the game evaluation values, groups appropriate for node, if changes to the group different from the group that is assigned to the node, the program performing the group change process for changing the group to be assigned to the node. In any one of Claims 1-9 ,
The communication control means includes
The primary node of the group, based on the neighboring group information which defines information groups connected directly to the belonging group, and to perform the transmission and reception of the primary node and the game data of the group that is defined as a contiguous group. In any one of Claims 1-10 ,
The communication control means includes
Test communication processing means for receiving node information of the master node and performing test communication with the master node to a node other than the master node;
The master node, the communication state information of the node that tested communication based on test communication result is held as a node information in association with the node, held cormorants line processing to transmit the node information and the other nodes a node A program that functions as information management processing means. In any one of Claims 1-11 ,
The communication control means includes
It performs processing for grouping a plurality of nodes is representative of the group as a superior group, to perform the transmission and reception of game data between nodes belonging to the same upper group,
Based on at least one of the information on the communication state of the nodes belonging to the upper group and the predetermined rule, the representative node of the upper group is determined ,
Program to perform the transmission and reception of game data between the primary node of the upper group. In a game information generating device for transmitting / receiving game data to / from other nodes via a network and generating game information,
A communication control means for configuring a network between nodes and transmitting and receiving game data between nodes via the network;
Game calculation means for performing a game calculation based on input information and game data received from another node;
Image generation means for generating a game image of the game world based on the game calculation result,
The game calculation means includes
Including a game evaluation value calculating means for calculating a game evaluation value based on the information on the position of the player character ,
The communication control means includes
Communication frequency of the group the nodes on the basis of the game evaluation values and inter-node control the degree of communication frequently between the communication frequency and outside the group of nodes transmit and receive game data to transmit and receive game data differently in in the group A game information generating apparatus that performs at least one of control and network connection control for controlling the degree of density of network connections between nodes in a group and network connections between nodes outside the group to be different. In a game information generating device for transmitting / receiving game data to / from other nodes via a network and generating game information,
A communication control means for configuring a network between nodes and transmitting and receiving game data between nodes via the network;
Game calculation means for performing a game calculation based on input information and game data received from another node;
Image generation means for generating a game image of the game world visible from the virtual camera based on the game calculation result,
The game calculation means includes
Based on virtual camera information relating to the placement of the virtual camera, including game evaluation value calculation means for calculating a game evaluation value;
The communication control means includes
Communication frequency for grouping nodes based on the game evaluation value and controlling the communication frequency for transmitting / receiving game data between nodes in the group and the communication frequency for transmitting / receiving game data between nodes outside the group to be different A game information generating apparatus that performs at least one of control and network connection control for controlling the degree of density of network connections between nodes in a group and network connections between nodes outside the group to be different.

Images