JP6880102B2 - Game programs and game systems - Google Patents

Description

The present invention relates to game programs and game systems.

In a three-dimensional virtual space, which is a game space, there is a game in which a player character (player object) operated by a player and a non-player character such as an enemy character perform actions such as movement and attack (see, for example, Patent Document 1).

In such a game, for example, a dynamic object such as a non-player character may appear from a predetermined specific position in a three-dimensional virtual space, or may be selected from a plurality of preset candidate positions. Make it appear in a position.

JP-A-2017-74162

In the above-mentioned game, the appearance position of the dynamic object is determined in advance by the developer and included in the game data, but it is an issue to reduce the work load of such a developer. In particular, in recent years, there are games in which dynamic objects that are much larger in size than the player character appear. In addition, the number of games for which game programs are upgraded is increasing. With the version upgrade, the above-mentioned information on the appearance position is also updated. Therefore, the burden on developers is increasing.

An object of at least one embodiment of the present invention is to solve a shortage of related techniques.

From a non-limiting point of view, the game program according to the embodiment of the present invention is for realizing a function of controlling the progress of a game in which a player object operates based on a user's operation in a three-dimensional virtual space. In a game program, referencing terrain data that can specify the movable range of a player object in a three-dimensional virtual space, and calculating a plurality of candidate positions in which an object of a predetermined size can be placed in the three-dimensional virtual space. A calculation function and an arrangement function of arranging objects of a predetermined size in an area whose reference position is one candidate position selected from a plurality of candidate positions are realized. In the calculation function, objects are placed within a movable range. A function of performing collision determination and determining a position where an object of a predetermined size does not collide with another object as a candidate position is realized.

From a non-limiting point of view, the game program according to the embodiment of the present invention is a server connected by a communication network to a terminal device that executes a game in which a player object operates based on a user's operation in a three-dimensional virtual space. It is a game program for causing the device to control the progress of the game, and the server device refers to the terrain data that can specify the movable range of the player object in the three-dimensional virtual space, and has a predetermined size in the three-dimensional virtual space. A calculation function that calculates a plurality of candidate positions where objects can be placed, and a placement function that places an object of a predetermined size in an area with one candidate position selected from a plurality of candidate positions as a reference position. The calculation function realizes a function of determining a collision between objects within a movable range and determining a position where an object of a predetermined size does not collide with another object as the candidate position.

From a non-limiting point of view, the game system according to the embodiment of the present invention is based on a terminal device that executes a game in which a player object operates based on a user's operation in a three-dimensional virtual space, and a terminal device and a communication network. A game system equipped with a connected server device, which refers to terrain data that can specify the movable range of a player object in a three-dimensional virtual space, and arranges an object of a predetermined size in the three-dimensional virtual space. The calculation means includes a calculation means for calculating a plurality of possible candidate positions and an arrangement means for arranging an object of a predetermined size in an area using one candidate position selected from the plurality of candidate positions as a reference position. , The collision determination between objects is performed within the movable range, and the position where the object of a predetermined size does not collide with other objects is determined as the candidate position.

Each embodiment of the present application solves one or more deficiencies.

It is a block diagram which shows the example of the structure of the game system corresponding to at least one of the embodiments of this invention. It is a flowchart which shows the example of the calculation process corresponding to at least one of the Embodiments of this invention. It is a flowchart which shows the example of the arrangement process corresponding to at least one of the Embodiments of this invention. It is a block diagram which shows the example of the structure of the game system corresponding to at least one of the embodiments of this invention. It is a flowchart which shows the example of the operation of the server apparatus and the terminal apparatus when the server apparatus corresponding to at least one of the Embodiments of this invention executes a calculation process. It is a flowchart which shows the example of the operation of the server apparatus and the terminal apparatus when the server apparatus corresponding to at least one of the Embodiments of this invention executes arrangement. It is a block diagram which shows the example of the structure of the game system corresponding to at least one of the embodiments of this invention. It is a flowchart which shows the example of the arrangement process corresponding to at least one of the Embodiments of this invention. It is a block diagram which shows the example of the structure of the game system corresponding to at least one of the embodiments of this invention. It is a flowchart which shows the example of the calculation process corresponding to at least one of the Embodiments of this invention. It is a flowchart which shows the example of the arrangement process corresponding to at least one of the Embodiments of this invention. It is a figure which shows an example of the game space formed by the game system corresponding to at least one of the embodiments of this invention. It is a figure which shows an example of the player character PC and the fellow character FC formed by the game system corresponding to at least one of the embodiments of this invention. It is a figure which shows an example of the game space formed by the game system corresponding to at least one of the embodiments of this invention. It is a figure which shows an example of the determination object of the collision determination corresponding to at least one of the embodiments of this invention. It is a figure which shows an example of the game space formed by the game system corresponding to at least one of the embodiments of this invention. It is a figure which shows an example of the game space and the trigger volume formed by the game system corresponding to at least one of the embodiments of this invention. It is a figure which shows an example of the game space formed by the game system corresponding to at least one of the embodiments of this invention. It is a figure which shows an example of the game space formed by the game system corresponding to at least one of the embodiments of this invention. It is a figure which shows an example of the management table of a point volume and a candidate position corresponding to at least one of the Embodiments of this invention. It is a block diagram which shows the example of the structure of the game system corresponding to at least one of the embodiments of this invention. It is a flowchart which shows the example of the calculation process corresponding to at least one of the Embodiments of this invention. It is a flowchart which shows the example of the game progress processing corresponding to at least one of the Embodiments of this invention. It is a flowchart which shows the example of the arrangement process corresponding to at least one of the Embodiments of this invention.

Hereinafter, examples of embodiments of the present invention will be described with reference to the drawings. It should be noted that the various components in the examples of the respective embodiments described below can be appropriately combined as long as there is no contradiction or the like. Further, with respect to the contents described as an example of a certain embodiment, the description may be omitted in another embodiment. In addition, the contents of operations and processes not related to the characteristic parts of each embodiment may be omitted. Further, the order of the various processes constituting the various flows described below is in no particular order as long as there is no contradiction in the processing contents.

[First Embodiment]
FIG. 1 is a block diagram showing an example of a configuration of a game system 100 corresponding to at least one of the embodiments of the present invention. As shown in FIG. 1, the game system 100 includes, for example, a game terminal device (terminal device) 20 which is a computer used by a user (player). Note that FIG. 1 shows the configuration of the terminal device 20A, which is an example of the configuration of the terminal device 20. Further, the configuration of the game system 100 is not limited to this. For example, the user's terminal device may be connected to a server device (video game processing server) via a communication network, and the video game service may be provided from this server device to the terminal device (see FIG. 4). ..

The game system 100 has various functions of executing a video game in which a player object operates based on a user's operation in a three-dimensional virtual space (game space). The player object is an object operated by the user via the operation unit of the terminal device 20 and is an object that can move in the game space.

In the example of this embodiment, a game in which objects of a predetermined size are arranged (appear) is executed in the game space. An object of a predetermined size is arranged in an area whose reference position is one candidate position selected from a plurality of candidate positions in the game space. The area with the candidate position as the reference position is an area in which an object of a predetermined size can be arranged. That is, it is possible to arrange an object of a predetermined size in the above area without overlapping with other objects such as buildings and characters already arranged in the game space.

Each candidate position is calculated with reference to terrain data that can specify the movable range of the player object in the three-dimensional virtual space. Specifically, collision determination (atari determination) between objects is performed within the movable range, and a position where an object of a predetermined size does not collide with another object is determined as a candidate position.

The terminal device 20 is managed by a player who plays a video game, and can execute a video game such as a stationary game device, a personal computer, a mobile phone terminal, a PDA (Personal Digital Assistants), or a portable game device. It consists of a terminal device.

Further, the terminal device 20 includes an operation unit (touch panel, game pad, etc.) for executing a game, a storage unit such as a hard disk drive, a control unit including a CPU for executing a game and generating a game image, and a game. A display device (display unit) for displaying an image is provided, but since it is a general configuration, detailed description thereof will be omitted. Further, in the terminal device 20, software (game program) for executing a video game and controlling the progress of the game is stored in a storage unit. The game program also includes game data.

Next, the configuration of the terminal device 20A, which is an example of the configuration of the terminal device 20, will be described. The terminal device 20A includes at least a calculation unit (calculation function) 31 and an arrangement unit (arrangement function) 32 for controlling the progress of the game described above by the control unit executing the game program.

The calculation unit 31 refers to the terrain data that can specify the movable range of the player object in the three-dimensional virtual space, and calculates a plurality of candidate positions in which the object of a predetermined size can be arranged in the three-dimensional virtual space. Specifically, the calculation unit 31 determines a collision between objects within the movable range, and determines a position where an object of a predetermined size does not collide with another object as a candidate position. Note that the data of objects of a predetermined size, terrain data, etc. may be included in the game data. Further, the calculated plurality of candidate positions may be stored in the storage unit of the terminal device 20A, for example. The candidate position is, for example, the coordinate information of the coordinate system (world coordinate system) of the three-dimensional virtual space.

The arrangement unit 32 arranges an object of a predetermined size in an area whose reference position is one candidate position selected from a plurality of candidate positions. For example, an object of a predetermined size is placed at a reference position.

FIG. 2 is a flowchart showing an example of calculation processing executed by the system 100. In the calculation process, the process for calculating the plurality of candidate positions described above is performed. Hereinafter, a case where the terminal device 20A executes the calculation process will be described as an example.

The calculation process of the example of the present embodiment is executed, for example, every time a predetermined period elapses (for example, midnight) in a situation where the game is not executed.

In the calculation process, the terminal device 20A performs a determination process (step S10). In the determination process, for example, collision determination is performed at each position in the movable range of the game space with reference to the terrain data. In this case, the collision determination between the object including the object of a predetermined size and the object arranged in the game space may be performed.

Next, the terminal device 20A performs a determination process (step S11). In the determination process, for example, a position that does not collide with another object is determined as a candidate position and stored in the storage unit. After that, the terminal device 20A ends the calculation process.

FIG. 3 is a flowchart showing an example of the arrangement process executed by the system 100. In the placement process, a process of arranging the above-mentioned object of a predetermined size in the game space is performed. Hereinafter, a case where the terminal device 20A executes the arrangement process will be described as an example.

The placement process of the example of the present embodiment is executed, for example, when the placement of an object of a predetermined size is determined in a situation where the game is being executed.

In the arrangement process, the terminal device 20A executes a candidate position determination process (step S30). In the determination process, one candidate position is determined from a plurality of candidate positions. The terminal device 20A may select, for example, one candidate position closest to the current position of the player object. After that, the terminal device 20A performs the arrangement process (step S31). In the placement process, as described above, an object of a predetermined size is placed in an area with the selected candidate position as a reference position.

As described above, as one aspect of the first embodiment, since the terminal device 20A is configured to include the calculation unit 31 and the arrangement unit 32, a plurality of candidate positions in which objects of a predetermined size can be arranged are automatically set. Will be generated. Therefore, the workload of the developer can be reduced.

In the example of the first embodiment described above, the terminal device 20A executes the game program to control the progress of the game, but the present invention is not particularly limited to this. For example, a game system including a server device and a terminal device as shown in FIG. 4 may be configured such that the server device includes at least an object calculation unit 31 and an arrangement unit 32 instead of the terminal device 20A.

The server device includes a storage unit such as a hard disk drive (not shown) and a control unit composed of a CPU and the like. Further, the server device controls the progress of the video game in the same manner as the terminal device 20A by the control unit executing the above-mentioned game program stored in the storage unit. The server device has a general configuration for controlling the progress of a video game such as a control unit and a communication unit, but detailed description thereof will be omitted here.

The server device does not execute the video game unlike the terminal device 20A. The server device has, for example, a communication unit connected to an Internet line (communication network) and communicates with a terminal device that executes a video game. The server device receives an operation signal (operation information) or the like from a user (terminal device), and also transmits information (image information or the like) related to the progress of the game to the terminal device. Although FIG. 4 illustrates one server device and one terminal device, the server device communicates with a plurality of terminal devices regarding a video game and controls the progress of the video game of each terminal device. May be good. Further, a plurality of server devices may cooperate to execute the game program, or the server device and the terminal device may cooperate to execute the game program (control the progress of the game).

FIG. 5 is a flowchart showing an example of the operation of the server device and the terminal device when the server device executes the calculation process shown in FIG. In this case, the terminal device is in a state in which the game is not being executed.

In the calculation process, the server device performs a determination process (step S50). In the determination process, for example, collision determination is performed at each position in the movable range of the game space with reference to the terrain data. Next, the server device performs a determination process (step S51). In the determination process, for example, a position that does not collide with another object is determined as a candidate position and stored in the storage unit of the server device. After that, the server device ends the calculation process.

FIG. 6 is a flowchart showing an example of the operation of the server device and the terminal device when the server device executes the arrangement process shown in FIG.

In the placement process, the server device executes a candidate position determination process (step S60). In the determination process, one candidate position is determined from a plurality of candidate positions. The server device may select, for example, one candidate position closest to the current position of the player object. After that, the server device performs the placement process (step S61). In the placement process, as described above, an object of a predetermined size is placed in an area with the selected candidate position as a reference position.

Although not shown, the server device periodically generates image information for generating a game image according to the progress of the game, and transmits the image information to the terminal device.

On the other hand, the terminal device outputs (displays on the display unit) a game image based on the received image information (step S70). Then, the terminal device repeatedly executes the process of step S70 until it is determined that the game is finished (step S71: YES).

The calculation process of FIG. 5 may be executed by the server device, and the arrangement process of FIG. 6 may be executed by the terminal device. In this case, the server device may transmit the calculated plurality of candidate positions to the terminal device.

The above-mentioned player object corresponds to various objects such as characters, avatars, and fighters. The image data (texture image) for generating the object may be included in the game data.

As the above-mentioned object of a predetermined size, various objects can be adopted as in the player object, and it may be a static object or a dynamic object. A static object is, for example, a huge rock object. In this case, the player object may be configured to make a huge rock object appear in the game space by executing magic or the like. The dynamic object is a character object. In this case, the player object may have a configuration in which a huge fellow character appears (summons) in the game space by executing magic or the like.

Further, the object of a predetermined size may be a player object. In this case, for example, the player object may be configured to warp itself to another place in the game space by executing magic or the like. Further, the object having a predetermined size is not limited to one, and may be a plurality of objects. In this case, for example, the player object may warp itself to another place in the game space by executing magic or the like, and a huge fellow character may appear (summon) around the player object.

Further, as for the arrangement timing of the object of the predetermined size, for example, as described above, a predetermined operation such as magic of the player object may be executed.

Further, any selection method can be adopted for determining one candidate position for arranging an object of a predetermined size. For example, it may be randomly determined from a plurality of candidate positions. Further, for example, the candidate position closest to the player object may be determined.

Further, the object of the predetermined size can be arbitrarily arranged in the area with the candidate position of 1 as the reference position as long as it does not collide with other objects in the game space. For example, in the case where the player object warps itself to another place in the game space by executing magic or the like, and a huge fellow character appears (summons) around the player object, the player object is set as a reference position. It may be arranged in, and a fellow character may be arranged above the player object (see FIG. 13). Further, for example, the fellow character may be placed at the reference position, and the player object may be placed so as to be on the fellow character.

The above-mentioned terrain data includes, for example, a navigation mesh. The navigation mesh is data used when determining a movement path of an AI character (non-player character) in a game space, and is data for specifying a region in which a non-player character can move. The navigation mesh is also a range in which the player object can move in the game space. The navigation mesh is a data structure that forms a plurality of polygons (see FIG. 14).

For example, a collision determination is performed by arranging a simple-shaped object having a size covering an object of a predetermined size at the center of gravity of each polygon (for example, a triangular polygon) of the navigation mesh. The simplified polygon is, for example, a cylindrical object (see FIG. 15). The center position of the bottom surface of the cylinder is arranged at the center of gravity position, and it is determined whether or not the cylinder collides with other objects in the game space. The position of the center of gravity that did not collide becomes the above-mentioned candidate position.

As the above-mentioned game, any genre of game such as an action game, a role-playing game, and a training game may be adopted as long as the player object operates in the game space which is a three-dimensional virtual space.

[Second Embodiment]
FIG. 7 is a block diagram showing a configuration of a terminal device 20B, which is an example of the terminal device 20. In this example, the terminal device 20B includes at least a calculation unit 31 and an arrangement unit 32B.

The calculation unit 31 refers to the terrain data that can specify the movable range of the player object in the three-dimensional virtual space, and calculates a plurality of candidate positions in which the object of a predetermined size can be arranged in the three-dimensional virtual space. Specifically, the calculation unit 31 determines a collision between objects within the movable range, and determines a position where an object of a predetermined size does not collide with another object as a candidate position. Note that the data of objects of a predetermined size, terrain data, etc. may be included in the game data. Further, the calculated plurality of candidate positions may be stored in the storage unit of the terminal device 20B, for example.

The arrangement unit 32B arranges an object of a predetermined size in an area whose reference position is one candidate position selected from a plurality of candidate positions. For example, an object of a predetermined size is placed at a reference position. In the example of the present embodiment, the arrangement unit 32B selects one candidate position closest to the player object as a reference position from a plurality of candidate positions.

FIG. 8 is a flowchart showing an example of the arrangement process executed by the system 100. In the placement process, a process of arranging the above-mentioned object of a predetermined size in the game space is performed. Hereinafter, a case where the terminal device 20B executes the arrangement process will be described as an example. The flowchart showing the operation of the server device will be omitted from the viewpoint of avoiding duplicate explanations. Further, since the calculation process has the same configuration as that of the first embodiment described above, the description thereof will be omitted.

The placement process of the example of the present embodiment is executed, for example, when the placement of an object of a predetermined size is determined in a situation where the game is being executed.

In the arrangement process, the terminal device 20B executes a candidate position determination process (step S30-B). In the determination process, one candidate position is determined from a plurality of candidate positions. The terminal device 20B selects one candidate position closest to the current position of the player object. For example, the distance between the player object and each candidate position may be calculated, and the one candidate position having the shortest distance may be selected. After that, the terminal device 20B performs the arrangement process (step S31). In the placement process, an object of a predetermined size is placed in an area with the selected candidate position as a reference position.

As described above, as one aspect of the second embodiment, since the terminal device 20B is configured to include the calculation unit 31 and the arrangement unit 32B, a plurality of candidate positions in which objects of a predetermined size can be arranged are automatically set. Will be generated. Therefore, the workload of the developer can be reduced.

[Third Embodiment]
FIG. 9 is a block diagram showing a configuration of the terminal device 20C, which is an example of the terminal device 20. In this example, the terminal device 20C includes at least a calculation unit 31C and an arrangement unit 32C.

The calculation unit 31C refers to the terrain data that can specify the movable range of the player object in the three-dimensional virtual space, and calculates a plurality of candidate positions in which the object of a predetermined size can be arranged in the three-dimensional virtual space. Specifically, the calculation unit 31C determines a collision between objects within the movable range, and determines a position where an object of a predetermined size does not collide with another object as a candidate position. Note that the data of objects of a predetermined size, terrain data, etc. may be included in the game data.

Further, in the example of the present embodiment, the calculation unit 31C stores the calculated plurality of candidate positions in the storage unit of the terminal device 20C in association with the management area to which the calculation unit belongs. In the example of the present embodiment, a plurality of management areas are preset in the movable range of the game space (see FIG. 18). That is, the movable range is divided into a plurality of management areas. Then, each of the above candidate positions is associated with a management area including its own position. For example, the identification information of the management area and the coordinate information of the candidate position may be stored in association with each other. The data of each management area may be included in the game data.

The arrangement unit 32C arranges an object of a predetermined size in an area whose reference position is one candidate position selected from a plurality of candidate positions. In the example of the present embodiment, the arrangement unit 32C selects one candidate position closest to the player object as a reference position among the candidate positions associated with the management area where the player object is located. That is, the selection target is not all of the plurality of candidate positions, but the candidate positions associated with the management area in which the player object is located.

FIG. 10 is a flowchart showing an example of the calculation process executed by the system 100. In the calculation process, the process for calculating the plurality of candidate positions described above is performed. Hereinafter, a case where the terminal device 20C executes the calculation process will be described as an example. The flowchart showing the operation of the server device will be omitted from the viewpoint of avoiding duplicate explanations.

The calculation process of the example of the present embodiment is executed, for example, every time a predetermined period elapses (for example, midnight) in a situation where the game is not executed.

In the calculation process, the terminal device 20C performs a determination process (step S10). In the determination process, for example, collision determination is performed at each position in the movable range of the game space with reference to the terrain data. In this case, the collision determination between the object including the object of a predetermined size and the object arranged in the game space may be performed.

Next, the terminal device 20C performs a determination process (step S11-C). In the determination process, for example, a position that does not collide with another object is determined as a candidate position. Then, as described above, the plurality of management areas and the plurality of candidate positions are associated with each other and stored in the storage unit. After that, the terminal device 20C ends the calculation process.

FIG. 11 is a flowchart showing an example of the arrangement process executed by the system 100. In the placement process, a process of arranging the above-mentioned object of a predetermined size in the game space is performed. Hereinafter, a case where the terminal device 20C executes the arrangement process will be described as an example. The flowchart showing the operation of the server device will be omitted from the viewpoint of avoiding duplicate explanations.

The placement process of the example of the present embodiment is executed, for example, when the placement of an object of a predetermined size is determined in a situation where the game is being executed.

In the arrangement process, the terminal device 20C executes a candidate position determination process (step S30-C). In the determination process, one candidate position is determined from a plurality of candidate positions. The terminal device 20C selects one candidate position closest to the player object as a reference position among the candidate positions associated with the management area where the player object is located. For example, identify the management area that contains the current position of the player object. Then, the distance between the player object and each candidate position in the management area may be calculated, and the one candidate position having the shortest distance may be selected. After that, the terminal device 20C performs an arrangement process (step S31). In the placement process, an object of a predetermined size is placed in an area with the selected candidate position as a reference position.

As described above, as one aspect of the third embodiment, since the terminal device 20C is configured to include the calculation unit 31C and the arrangement unit 32C, a plurality of candidate positions in which objects of a predetermined size can be arranged are automatically set. Will be generated. Therefore, the workload of the developer can be reduced.

In addition, one candidate position closest to the player object is selected from the candidate positions in the management area where the player object is located. Therefore, since the candidate position is selected in the space where the player object is located, it is possible to prevent the object of a predetermined size from being placed in an unrelated space in the progress of the game.

For example, a case where an object of a predetermined size is an enemy character of a player object will be described. In this case, the enemy character is not placed in the space adjacent to the space where the player object is, but is placed at any position in the space where the player object is. Therefore, the battle between the player object and the enemy character can be started immediately after the placement.

Further, for example, a case will be described in which the player object warps itself to another place in the game space by executing magic or the like, and a huge fellow character appears (summons) around the player object. In this case, it is prevented from warping to the space adjacent to the current space where the player object is, and warps to any position in the current space where the player object is. Then, an object of a predetermined size can be summoned, and an enemy character or the like in the space can be attacked by the object of the predetermined size.

[Fourth Embodiment]
FIG. 12 is a diagram showing an example of a game space of an example of this embodiment. The terminal device 20D of the example of the present embodiment is a stationary game device having a communication function of communicating with another terminal device via a communication network such as the Internet. In the example of the present embodiment, in the game space 50, a game is executed in which a player character (player object) PC operated by the user is made to perform an action such as movement and is made to fight with an object such as an enemy character EC. The game space 50 is a three-dimensional virtual space defined by a world coordinate system of three axes (X-axis, Y-axis, Z-axis).

In the example of this embodiment, the user can activate the summoning skill on the player character PC. The summoning causes (calls), for example, a fellow character that helps the player character PC in the game space 50. As shown in FIG. 13, the companion character FC is a dynamic object larger than the player character, and corresponds to an object of a predetermined size. FIG. 13 is a diagram showing an example of a player character PC and a companion character FC. The fellow character FC disappears from the game space 50 after a predetermined time has elapsed since it appeared.

The summoning operation (summoning operation) is executed at the place where the player character PC is currently located. For example, the companion character FC appears above the current position of the player character PC, as shown in FIG. It should be noted that the fellow characters may appear around the player character PC, not limited to the upper part.

However, when the player character PC is in a narrow place where there is no space for the fellow character FC to appear, the summoning operation is continued after warping to the wide space, and the fellow character FC is made to appear. For example, when the summoning is started while the player character PC is in a narrow place as shown in FIG. 12, the player character PC warps to a wide place.

First, the warp position of the player character PC at the time of the above-mentioned warp will be described. The warp position is calculated by using one candidate position selected from a plurality of candidate positions as a reference position. The plurality of candidate positions are calculated by the terminal device 20D. The terminal device 20D refers to the terrain data that can specify the movable range of the player character PC in the game space 50, and sets a position where a space where the player character PC and the fellow character FC can be arranged exists as a candidate position.

In the example of this embodiment, a navigation mesh is used as the terrain data. The navigation mesh is data used when determining a movement route of an AI character (non-player character) such as an enemy character EC in the game space 50, and is data for specifying a region in which the non-player character can move. The navigation mesh is also a range in which the player character can move in the game space 50. Therefore, even if the player character PC warps, it does not become immovable. Since the navigation mesh has a general configuration, detailed description thereof will be omitted.

The navigation mesh (hereinafter referred to as a mesh) is an area indicating a movable range. A mesh is a data structure that forms a plurality of polygons. FIG. 14A is a diagram showing a mesh MA in the game space 50 illustrated in FIG. The mesh MA is formed of a plurality of triangular polygons, for example, as shown in the partially enlarged view of FIG. 14 (A).

In the example of this embodiment, the candidate position is calculated based on the center of gravity position NCG of each polygon of the mesh MA. Specifically, the collision determination is performed based on the center of gravity position NCG, and the candidate position is calculated. Since the collision determination is a general configuration, detailed description thereof will be omitted. The navigation mesh is included in the game data.

FIG. 15 is a diagram showing an example of a determination object CO used for collision determination. The determination object CO has a simple cylindrical shape and has a size capable of accommodating the player character PC and the companion character FC inside.

In the collision determination of the present embodiment, first, the determination object CO is arranged so that the center position of the bottom surface overlaps with the center of gravity position NCG of any one. Then, it is determined whether or not the determination object CO collides with other objects such as a wall surface and a rock arranged in the game space 50. In this case, if it is determined that there is no collision, the center of gravity position NCG of 1 above becomes a candidate position. On the other hand, if it is determined that a collision occurs, the determination object CO is moved above the center of gravity position NCG (Y-axis direction) of 1 above by a predetermined distance. A similar collision determination is made at the moved position. Then, with respect to the center of gravity position NCG of 1 above, the collision determination is repeatedly executed while moving the determination object CO upward by a predetermined distance until a position that does not collide is found or the moved position reaches the upper limit height. Will be done.

Then, for all the center-of-gravity positions NCG of the mesh MA, the collision determination is performed as described above, and the candidate positions are calculated.

For example, when the determination object CO is placed at the center of gravity position NCG-1 shown in FIG. 14A, it does not collide with other objects, so that the center of gravity position NCG-1 becomes a candidate position and the collision determination is completed. To do. Further, for example, with respect to the center of gravity position NCG-2 shown in FIG. 14A, since the collision determination object CO and the wall surface object collide with each other up to the upper limit height, it is determined that there is no candidate position CP. For example, in the game space 50 shown in FIG. 14 (A), the candidate position CP as shown in FIG. 14 (B) is calculated.

Further, for example, on the sloped ground W as shown in FIG. 16A, the mesh MA is also formed in a sloped shape, and the center of gravity position NCG is also on the slope. Therefore, for example, as shown in FIG. 16A, when the determination object CO is arranged at the center of gravity position NCG-3, the determination object CO collides with the ground W. Therefore, in the region of the sloping ground W, the position moved upward to at least a position that does not collide with the ground W is the candidate position CP. For example, in the center of gravity position NCG-3 shown in FIG. 16A, the candidate position CP-3 above the center of gravity position NCG-3 as shown in FIG. 16B is calculated as the candidate position CP.

Further, in the example of the present embodiment, the candidate position CP is calculated with reference to the trigger volume in addition to the mesh MA. The trigger volume is data that identifies a part of the game space 50 (trigger area). The trigger volume functions as an execution trigger for executing an in-game event such as movie playback, loading map data, and the like. For example, when the player character PC enters the trigger volume, the playback of the movie is started. In this case, the collision determination between the player character PC and the trigger volume is performed, and it is determined that the player character PC has entered the trigger volume. The trigger volume is at a position where the player character PC passes in the progress of the game.

Further, the trigger volume is within the movable range of the player character PC. The trigger volume TV has, for example, a three-dimensional shape of a thin plate as shown in FIG. 17 (A). As shown in FIG. 17B, the trigger volume TV has a data structure in which the outer peripheral surface is formed by a plurality of polygons. FIG. 17A shows an example of a trigger volume TV arranged in the game space 50. FIG. 17B is a diagram showing an example of a trigger volume TV. Note that FIG. 17A shows only the shape of the trigger volume TV for convenience of explanation. The mesh MA and the trigger volume TV are not displayed on the game screen when the user plays.

In the example of this embodiment, the candidate position is calculated based on the center of gravity position TCG and the internal point IP of the trigger volume TV. Specifically, the collision determination is performed based on the center of gravity position TCG and the internal point IP, and the candidate position is calculated. The center of gravity position TCG is the center of gravity of the polygon on the outer peripheral surface of the trigger volume TV. As shown in FIG. 17B, the internal point IP is an intersection when the inside of the trigger volume TV is divided into a grid by a grid of horizontal lines and vertical lines. For example, the positions of the grid lines may be determined so that the distance between the grid lines is even at a predetermined value.

In the collision determination in which Tory is a volume TV, it is first determined whether or not the selected 1 center of gravity position NCG or internal point IP is on the mesh (movable range) MA. When it is on the mesh MA, the determination object CO is arranged so that the center position of the bottom surface overlaps with the center of gravity position NCG or the internal point IP of 1 selected above. Then, it is determined whether or not the determination object CO collides with other objects such as a wall surface and a rock arranged in the game space 50. In this case, if it is determined that there is no collision, the center of gravity position NCG or the internal point IP of 1 selected above becomes the candidate position CP. On the other hand, if it is determined that there is a collision, it is not recognized as a candidate position CP. Then, with respect to all the center-of-gravity positions TCG and the internal point IP of the trigger volume TV, the collision determination is performed as described above, and the candidate position CP is calculated.

As described above, by providing the candidate position CP on the trigger volume TV, it is possible to prevent the player character PC from warping into the adjacent space without passing through the trigger volume TV. For example, in a state where the player character PC is in the game space 50-A shown in FIG. 17A, it is possible to prevent the player character PC from being warped to the game space 50-B without passing through the trigger volume TV.

The plurality of candidate position CPs calculated as described above are associated with any one of the plurality of point volumes and stored in the storage unit of the terminal device 20D. The point volume (management area) is data that identifies a part of the user's movable range (mesh MA). That is, the movable range is divided into a plurality of point volumes. The point volume is a data structure in which the outer peripheral surface is formed by a plurality of polygons, similar to the trigger volume TV described above. The collision determination detects that the player character PC has entered the point volume. Each candidate position CP is associated with a point volume that includes its own position.

FIG. 18 is a diagram showing an example of point volume PVs (PV-1, PV-2) arranged in the game space 50. The game space 50 shown in FIG. 18 is partitioned by objects on the wall WA. A candidate position CP-A is associated with the point volume PV-1. Further, the point volume PV-2 is associated with candidate positions CP-B to CP-H. For example, when the player character PC is in the point volume PV-2, the reference position is determined from the candidate positions CP-B to CP-H.

Further, a parent-child relationship is set in some of the point volume PVs of the example of the present embodiment. The parent-child relationship is a relationship in which the parent point volume PV includes the child point volume PV. For example, as shown in FIG. 19, the parent point volume PV-3 includes a child point volume PV-4. However, even in the case of two point volume PVs having a parent-child relationship, the candidate position CPs associated with each are different from each other. For example, the parent point volume PV-3 is not associated with the candidate positions CP-f to CP-j in the child point volume PV-4, and only the candidate positions CP-a to CP-e are associated. Associated. Further, only the candidate positions CP-f to CP-j are associated with the child point volume PV-4. Information on the parent-child relationship is included in the game data. The parent-child relationship is referred to when determining the candidate position CP as the reference position. Details will be described later.

FIG. 20A is a diagram showing an example of the management table 200 of the point volume PV. The management table 200 is composed of fields such as volume ID, area data, parent-child relationship, and flags. The identification information of the point volume PV is set in the volume ID field. Area data, parent-child relationships, and flags are associated with the volume ID.

In the area data field, the coordinate information of the polygon vertices that specifies the area of the point volume PV is set. The identification information of the child point volume PV is set in the parent-child relationship field. For example, the identification information of the child point volume PV-4 is set in the parent-child relationship of the point volume PV-3 described above. Information that identifies the corresponding control flag is set in the flag field. The control flag (ON / OFF flag) is associated only with the child point volume PV. For example, the information of the control flag FF is set in the point volume PV-4 which is a child. The details of the control flag will be described later. The management table 200 is included in the game data in advance.

FIG. 20B is a diagram showing an example of the management table 250 of the candidate position CP. The management table 200 is composed of fields such as a volume ID and an appearance point. The identification information of the point volume PV is set in the volume ID field. The appearance point is associated with the volume ID. In the field of the appearance point, the coordinate information of the candidate position CP of the corresponding point volume PV is set. For example, the coordinate information of the candidate positions CP-a to CP-e is set at the appearance point of the point volume PV-3 as described above.

The terminal device 20D calculates the above-mentioned plurality of candidate positions and generates the management table 250 each time a predetermined execution condition is satisfied. The management table 250 is stored in the storage unit of the management device 20D. The predetermined execution conditions are, for example, a situation in which the game is not being executed and a predetermined period has elapsed (for example, midnight). A situation in which the game is not running is a situation in which the user is not playing the game.

Next, the determination of the warp position when the summoning operation is performed in a narrow place will be described. As described above, when the player character PC is in a narrow space where the space for the fellow character FC to appear cannot be secured, the player character PC continues the summoning operation after warping to the wide space to make the fellow character FC appear.

The warp position is calculated by using one candidate position selected from a plurality of candidate positions as a reference position. Specifically, the warp position is the position where the reference position is moved vertically downward and collides with an object on the ground. That is, the warp position is determined on the ground immediately below the reference position. Therefore, when the player character is warped, the player character always performs the summoning operation while being on the ground as shown in FIG. It is not always necessary to perform the summoning operation on the ground. The reference position may always be the warp position.

For example, when the candidate position CP-1 illustrated in FIG. 14B becomes the reference position, the warp position becomes the candidate position CP-1 because the candidate position CP-1 is at the same position as the ground level. .. Then, the player character PC and the companion character FC are arranged.

Further, for example, when the candidate position CP-3 illustrated in FIG. 16B becomes the reference position, the position where the candidate position CP-3 collides with the ground W below the candidate position CP-3 (center of gravity position NCG-3) is the warp position. Become. Further, when the candidate position CP calculated in the trigger volume TV becomes the reference position, the warp position is determined by the same configuration.

The condition (selection condition) for selecting one candidate position as a reference position from a plurality of candidate positions is a valid candidate position among the candidate position CPs associated with the target point volume PV, and It is the closest candidate position to the player character PC.

The target point volume PV is basically the point volume PV in which the player character PC currently exists, as described with reference to FIG. However, when the player character PC exists in the point volume PV having a parent-child relationship, the target point volume PV is determined based on the value (ON / OFF) of the control flag described above. Specifically, when the control flag is ON (first state), both the parent point volume PV and the child point volume PV are targeted.

When the control flag is OFF (second state), either the parent point volume PV or the child point volume PV becomes the target point volume PV according to the position where the player character PC exists. .. Specifically, when the control flag is OFF and the player character PC is included in both the parent point volume PV and the child point volume PV, the child point volume PC is targeted. Further, when the control flag is OFF and the player character PC is included only in the parent point volume PV, the parent point volume PC is the target.

For example, the case of the point volumes PV-3 and PV-4 illustrated in FIG. 19 will be described. The parent point volume PV-3 is an area that includes the game spaces 50-S and 50-T. The child point volume PV-4 is an area including the game space 50-T. A control flag FF is associated with the child point volume PV-4. The value of the control flag FF changes according to the open / closed state of the object of the door DR that separates the game space 50-S and the game space 50-T. That is, the door DR: is open, and the control flag FF = 1 (ON). Further, when the door DR is closed, the control fluff FF = 0 (OFF). The door DR repeats opening and closing at regular intervals, for example.

For example, a case where the player character PC exists at the point Q1 in the game space 50-T will be described. In this case, if the door DR is open and the control flag FF = 1 (ON), the point volumes PV-3 and PV-4 are targeted. That is, the candidate positions CP-a to CP-j associated with the point volumes PV-3 and PV-4 are selected. When the candidate positions CP-a to CP-j are valid, the candidate position CP-e closest to the point Q1 is selected as the reference position. Further, if the door DR is closed and the control flag FF = 0 (OFF), only the point volume PV-4 is targeted. That is, the candidate positions CP-f to CP-j associated with the point volume PV-4 are selected. When the candidate positions CP-f to CP-j are valid, the candidate position CP-h closest to the point Q1 is selected as the reference position. Therefore, when the door DR is closed, it is prevented from warping to the other side of the door.

Further, for example, a case where the player character PC exists at the point Q2 in the game space 50-S will be described. In this case, if the door DR is open and the control flag FF = 1 (ON), the point volumes PV-3 and PV-4 are targeted. That is, the candidate positions CP-a to CP-j associated with the point volumes PV-3 and PV-4 are selected. Further, if the door DR is closed and the control flag FF = 0 (OFF), the point volume PV-3 is the target. That is, the candidate positions CP-a to CP-e associated with the point volume PV-3 are selected.

The ON / OFF of the control flag is not limited to the open / closed state of the door DR. It may be changed according to the situation of the game space in the parent's point volume PV. For example, in the progress of the current game, when the player character PC is prohibited from entering the space in the child's point volume, the control flag is turned off.

Next, a valid candidate position CP under the selection condition will be described. Whether or not the candidate position CP is valid is determined by whether or not it is included in a predetermined area centered on the filtered dynamic object. If the candidate position CP is not included in the predetermined area centered on the dynamic object, it is determined to be valid. On the other hand, if the candidate position CP is included in a predetermined area centered on the dynamic object, it is determined to be invalid. The dynamic object is, for example, a moving object such as an enemy character EC or a player character operated by another user.

By setting valid / invalid for the candidate position CP in this way, it is possible to prevent the player character PC and the fellow character FC from overlapping the dynamic object at the warp position.

It is desirable that the above-mentioned predetermined area is an area in which the player character PC and the companion character FC can be determined to be valid / invalid so as not to overlap with the dynamic object. For example, it may be a region in the form of the dynamic object itself, or it may be a region having a simple shape including the dynamic object. Further, for example, valid / invalidity may be determined by collision determination with a predetermined area with the candidate position.

It is not necessary to set all enemy character ECs as dynamic objects for determining the effectiveness of the candidate position CP. In the example of the present embodiment, for example, only the enemy character EC having a predetermined size or larger is targeted for determining the effectiveness of the candidate position CP. A filter is set in the identification information of the enemy character EC to be determined. That is, only the enemy character EC with the filter setting is the target for determining the effectiveness. The filter settings are included in the game data.

FIG. 21 is a block diagram showing a configuration of a terminal device 20D, which is an example of the terminal device 20. In this example, the terminal device 20D includes at least a calculation unit 31D, an arrangement unit 32D, an operation control unit 33D, an event generation unit 34D, and a setting unit 35D.

The calculation unit 31D calculates a plurality of candidate position CPs with reference to terrain data (navigation mesh MA) capable of specifying the movable range of the player character PC in the game space (three-dimensional virtual space) 50, trigger volume TV, and the like. .. As described above, the calculation unit 31D performs a collision determination at each position within the movable range, and determines a position where the determination object CO does not collide with another object as a candidate position CP. The data of the player character PC, the determination object CO, the companion character FC, the navigation mesh MA, the trigger volume TV, and the like are included in the game data.

When the predetermined execution condition is satisfied, the calculation unit 31D calculates a plurality of candidate position CPs as described above. Further, the calculation unit 31D generates a management table 250 in which the calculated plurality of candidate position CPs are associated with the point volume (management area) PV to which the calculation unit belongs. The management table 250 is stored in the storage unit of the terminal device 20D.

The arrangement unit 32D arranges a dynamic object such as a character in the game space 50. For example, when the summoning of the player character PC is started, the arrangement unit 32D arranges the fellow character FC above the player character as described above if the space is large. Further, in the case of a narrow space, the arrangement unit 32D warps the player character PC into a wide space (warp position) and then arranges the fellow character FC.

As described above, the arrangement unit 32D calculates the warp position using one candidate position CP selected from the plurality of candidate position CPs as a reference position. Then, the player character PC is arranged at the warp position, and the companion character FC is arranged above the player character PC. That is, the arrangement unit 32D arranges an object (player character PC and fellow character FC) of a predetermined size in an area whose reference position is one candidate position selected from a plurality of candidate positions. In the example of the present embodiment, the arrangement unit 32D refers to the management tables 200, 250, etc., and selects one candidate position CP that matches the above-mentioned selection conditions as the reference position.

The operation control unit 33D controls the operation of the player object (player character PC) according to the operation of the operation unit of the user. For example, the player character PC is made to execute the summoning operation. In addition, the motion control unit 33D controls the motions of the fellow character PC, the enemy character PC, and the like.

The event generation unit 34D makes a collision determination on the trigger volume TV, and when the player object (player character PC) moves to the trigger area (trigger volume TV), the event generation unit 34D displays an in-game event associated with the trigger volume TV. generate. The event means an event that occurs in the game space 50. As described above, the playback of a movie, the appearance of a predetermined enemy character EC, and the like correspond to an event.

The setting unit 35 sets the parent-child relationship (control flag) to either the first state or the second state according to the situation of the game space (three-dimensional virtual space) 50 in the parent management area (parent point volume PV). Set to one.

FIG. 22 is a flowchart showing an example of the calculation process executed by the system 100. In the calculation process, a process for calculating the plurality of candidate position CPs described above is performed. Hereinafter, a case where the terminal device 20D executes the calculation process will be described as an example. The flowchart showing the operation of the server device will be omitted from the viewpoint of avoiding duplicate explanations.

The calculation process of the example of the present embodiment is executed when a predetermined execution condition (every elapse of a predetermined period (for example, midnight) in a situation where the game is not executed) is satisfied.

In the calculation process, the terminal device 20D performs a determination process (step S10-D). In the determination process, as described above, the collision determination is performed at each position in the movable range of the game space 50 with reference to the terrain data (mesh MA), the trigger volume TV, and the like.

Next, the terminal device 20D performs a determination process (step S11-D). In the determination process, a position that does not collide with another object in the determination process is determined as a candidate position CP. Then, as illustrated in FIG. 20B, a management table 250 in which the plurality of management areas (point volume PV) and the plurality of candidate position CPs are associated with each other is generated and stored in the storage unit. After that, the terminal device 20D ends the calculation process.

FIG. 23 is a flowchart showing an example of a game progress process executed by the system 100. In the game progress processing, processing is performed for the player character PC to advance the game, such as playing against an enemy character EC or the like in the game space 50. Hereinafter, a case where the terminal device 20D executes the game progress process will be described as an example. The flowchart showing the operation of the server device will be omitted from the viewpoint of avoiding duplicate explanations.

The game progress process of the example of the present embodiment is executed, for example, when the user inputs an operation to start the game.

In the game progress process, the terminal device 20D performs the progress process (step S20-D). In the progress process, a process of controlling the behavior of objects such as the player character and the enemy character EC in the game space 50 is performed.

Further, in the progress processing, the terminal device 20D updates the value of the control flag according to the situation of the three-dimensional virtual space in the parent management area (parent point volume PV). For example, the value of the control flag FF is updated according to the opening and closing of the door DR illustrated in FIG.

Further, in the progress process, when the player character PC is made to execute the summoning operation, the terminal device 20D determines by collision determination whether or not there is a space for the fellow character FC to appear at the current position of the player character PC. When there is a space for the fellow character FC to appear, the terminal device 20D executes the summoning operation without moving (warping) the player character PC. Then, the fellow character FC appears (places) above the player character PC.

On the other hand, when there is no space for the fellow character FC to appear, the terminal device 20D executes the placement process described later to warp the player character PC into a wide space, and then causes (places) the fellow character FC.

After that, the terminal device 20D determines whether or not the game is finished (step S21-D). For example, when the player character PC is attacked by the enemy character EC and becomes incapable of fighting, it may be determined that the game is over. If not completed (step S21-D: NO), the terminal device 20D returns to the process of step S20-D. On the other hand, when finished (step S21-D: YES), the terminal device 20D ends the game progress process.

Next, the placement process executed in the above-mentioned progress process will be described. FIG. 24 is a flowchart showing an example of the arrangement process executed by the system 100. In the placement process, a process of warping the player character PC and arranging the fellow character FC in the game space 50 is performed. Hereinafter, a case where the terminal device 20D executes the arrangement process will be described as an example. The flowchart showing the operation of the server device will be omitted from the viewpoint of avoiding duplicate explanations.

The placement process of the example of the present embodiment is executed when the warp for summoning the player character PC is determined in the progress process in the situation where the game is being executed.

In the arrangement process, the terminal device 20D executes the process of determining the candidate position CP (step S30-D). In the determination process, as described above, one candidate position is determined from the plurality of candidate positions. The terminal device 20D selects one candidate position CP that matches the selection condition as described above.

After that, the terminal device 20D performs the arrangement process (step S31-D). In the placement process, as described above, the player character PC is placed at the warp position calculated from the reference position as the selected candidate position CP. Then, after the player character PC is made to continuously perform the summoning operation, the fellow character FC is arranged above the player character PC. After that, the terminal device 20D continuously executes the above-mentioned progress processing.

As described above, as one aspect of the fourth embodiment, the terminal device 20D is configured to include the calculation unit 31D, the arrangement unit 32D, the operation control unit 33D, the event generation unit 34D, and the setting unit 35D. Multiple candidate positions where the objects (player character and fellow character) can be placed are automatically generated. Therefore, the workload of the developer can be reduced.

In addition, one candidate position closest to the player character is selected from the candidate positions associated with the management area (point volume) in which the player character is located. Therefore, since the candidate position is selected in the space where the player character is, it is possible to prevent an object of a predetermined size from being placed in an unrelated space in the progress of the game.

In addition, there is a management area (point volume) in which the parent-child relationship is set, and the candidate position to be selected changes according to the situation of the three-dimensional virtual space in the parent management area (parent point volume). In the progress of the game, it is prevented that an object of a predetermined size is placed at an unnatural position.

Furthermore, since the dynamic object has a filter setting, when an object of a predetermined size appears, it is prevented from appearing overlapping with other dynamic objects.

In the example of the above-described embodiment, the candidate position is calculated based on the position of the center of gravity of the polygon such as the navigation mesh, but the candidate position can be calculated based on any position as long as it is within the movable range. Good. For example, the candidate position may be calculated using the polygon vertices of the navigation mesh.

In the example of the above-described embodiment, when the game space is narrow in the execution of summoning, an object of a predetermined size is arranged in an area with one candidate position as a reference position, but the present invention is not particularly limited to this. For example, the example of the embodiment of the present invention may be applied when the enemy character EC in the game space warps, or when a new dynamic object appears in the game space.

In the example of the above-described embodiment, the fellow characters appear after the player character warps, but these characters may appear at the same time. For example, when the summoning operation by the player character is completed, the player character may be warped and a fellow character may appear. Further, the player character may not be moved, and only the fellow characters may appear in another space. The number of fellow characters that can be summoned is not limited to one.

In the example of the above-described embodiment, as execution conditions for calculating a plurality of candidate positions, a situation in which the game is not executed and a predetermined period has elapsed (for example, midnight) are exemplified, but periodically. Any execution condition may be adopted as long as it is a configuration to be executed. For example, the execution condition may be that the shape of the game space has been changed. Part of the game space may change due to the version upgrade of the game program.

In the example of the above-described embodiment, the filter is set to the dynamic object in advance, but the terminal device may set the filter. For example, the terminal device may determine whether or not the dynamic object has a predetermined size or more, and set a filter for the dynamic object having a predetermined size or more.

In the above-described embodiment, the navigation mesh is used as the terrain data, but the present invention is not particularly limited to this. Any data may be adopted as long as the data can specify the movable range of the player object in the game space.

In the above-described embodiment, the candidate position is associated with the management area (point volume), but the management area may not be provided. Further, it is not necessary to calculate the candidate position by referring to the trigger area (trigger volume).

[Additional Notes]
The description of the above-described embodiment describes at least the following invention so that a person having ordinary knowledge in the field to which the invention belongs can carry out the invention.

[1]
It is a game program for realizing a function in a computer to control the progress of a game in which a player object operates based on a user's operation in a three-dimensional virtual space.
A calculation function that calculates multiple candidate positions where objects of a predetermined size can be placed in the 3D virtual space by referring to the terrain data that can specify the movable range of the player object in the 3D virtual space.
An arrangement function for arranging an object of a predetermined size in an area using one candidate position selected from the plurality of candidate positions as a reference position.
Realized,
In the calculation function, a function of determining a collision between objects within the movable range and determining a position where an object of a predetermined size does not collide with another object as the candidate position.
A game program that realizes.

[2]
In the arrangement function, the function of setting one candidate position closest to the player object as the reference position from the plurality of candidate positions.
The game program according to [1].

[3]
The movable range includes a plurality of preset management areas.
In the calculation function, a function of associating the plurality of candidate positions with a management area to which the candidate positions belong and storing them in a storage unit.
In the arrangement function, among the candidate positions associated with the management area in which the player object is located, one candidate position closest to the player object is set as the reference position.
The game program described in [2].

[4]
The plurality of management areas include a parent management area and a child management area in which a parent-child relationship is set.
The parent management area includes the child management area, and candidate positions other than the candidate position associated with the child management area are associated with the parent management area.
On the computer,
A setting function that sets the parent-child relationship to either the first state or the second state according to the situation of the three-dimensional virtual space in the parent management area.
Realized,
In the arrangement function,
When the player object is located in the parent management area and the child management area, if the parent-child relationship is in the first state, the candidate positions associated with the parent management area and the child management area are said to be the same. A function in which one candidate position closest to the player object is used as the reference position.
When the player object is located in the parent management area and the child management area, in the case of the parent-child relationship in the second state, among the candidate positions associated with the child management area, the player object is closest to the player object. A function that uses the candidate position of 1 as the reference position,
The game program described in [3].

[5]
In the arrangement function,
When the player object is located in the parent management area and is not located in the child management area, and if the parent-child relationship is in the first state, the candidate associated with the parent management area and the child management area. A function in which one candidate position closest to the player object is used as the reference position among the positions.
When the player object is located in the parent management area and is not located in the child management area, in the case of the parent-child relationship in the second state, among the candidate positions associated with the parent management area, the said A function in which one candidate position closest to the player object is used as the reference position.
The game program described in [4].

[6]
In the arrangement function, among the plurality of candidate positions, the candidate positions that are dynamic objects operating in the three-dimensional virtual space excluding the player object and that overlap with the filtered dynamic objects have the predetermined size. Ability to exclude the placement of objects in
The game program according to any one of [2] to [5].

[7]
On the computer,
An operation control function that controls the operation of the player object according to the user's operation,
Realized,
In the placement function, when the player object executes a summoning operation to make an object of the predetermined size appear, if there is no space around the position of the player object to place the object of the predetermined size, the reference position is selected. , A function of arranging the player object and the object of a predetermined size in the area to be the reference position,
The game program according to any one of [2] to [6].

[8]
In the calculation function, for collision determination, a function of performing collision determination using a simple-shaped object of a size including the object of a predetermined size,
The game program according to any one of [1] to [7].

[9]
In the calculation function, each time a predetermined execution condition is satisfied, the plurality of candidate positions are calculated and stored in the storage unit.
The game program according to any one of [1] to [8].

[10]
In the calculation function, a function of calculating the candidate position by further performing a collision determination while shifting a predetermined position in the movable range upward to a predetermined height.
The game program according to any one of [1] to [9].

[11]
On the computer,
An event generation function that generates an in-game event associated with the trigger area when the player object moves to the trigger area, which is a part of the three-dimensional virtual space.
Realized,
In the calculation function, in addition to the movable range, a function of performing a collision determination in the trigger area and calculating the candidate position,
The game program according to any one of [1] to [10].

[12]
A server device characterized in that the game program described in any one of [1] to [11] is installed.

[13]
It is a terminal program for realizing a function of displaying a game image on the display screen of the display unit and executing a video game on the terminal device.
To the terminal device
A connection function for connecting to the server device according to [12] via a communication network.
A program for terminals to realize.

[14]
A game program for controlling the progress of a game by a server device connected by a communication network to a terminal device that executes a game in which a player object operates based on a user's operation in a three-dimensional virtual space.
To the server device
A calculation function that calculates multiple candidate positions where objects of a predetermined size can be placed in the 3D virtual space by referring to the terrain data that can specify the movable range of the player object in the 3D virtual space.
An arrangement function for arranging an object of a predetermined size in an area using one candidate position selected from the plurality of candidate positions as a reference position.
Realized,
In the calculation function, a function of determining a collision between objects within the movable range and determining a position where an object of a predetermined size does not collide with another object as the candidate position.
A game program that realizes.

[15]
In the arrangement function, the function of setting one candidate position closest to the player object as the reference position from the plurality of candidate positions.
The game program according to [14].

[16]
The movable range includes a plurality of preset management areas.
In the calculation function, a function of associating the plurality of candidate positions with a management area to which the candidate positions belong and storing them in a storage unit.
In the arrangement function, among the candidate positions associated with the management area in which the player object is located, one candidate position closest to the player object is set as the reference position.
The game program according to [15].

[17]
The plurality of management areas include a parent management area and a child management area in which a parent-child relationship is set.
The parent management area includes the child management area, and candidate positions other than the candidate position associated with the child management area are associated with the parent management area.
On the computer,
A setting function that sets the parent-child relationship to either the first state or the second state according to the situation of the three-dimensional virtual space in the parent management area.
Realized,
In the arrangement function,
When the player object is located in the parent management area and the child management area, if the parent-child relationship is in the first state, the candidate positions associated with the parent management area and the child management area are said to be the same. A function in which one candidate position closest to the player object is used as the reference position.
When the player object is located in the parent management area and the child management area, in the case of the parent-child relationship in the second state, among the candidate positions associated with the child management area, the player object is closest to the player object. A function that uses the candidate position of 1 as the reference position,
The game program according to [16].

[18]
In the arrangement function,
When the player object is located in the parent management area and is not located in the child management area, and if the parent-child relationship is in the first state, the candidate associated with the parent management area and the child management area. A function in which one candidate position closest to the player object is used as the reference position among the positions.
When the player object is located in the parent management area and is not located in the child management area, in the case of the parent-child relationship in the second state, among the candidate positions associated with the parent management area, the said A function in which one candidate position closest to the player object is used as the reference position.
The game program according to [17].

[19]
In the arrangement function, among the plurality of candidate positions, the candidate positions that are dynamic objects operating in the three-dimensional virtual space excluding the player object and that overlap with the filtered dynamic objects have the predetermined size. Ability to exclude the placement of objects in
The game program according to any one of [15] to [18].

[20]
On the computer,
An operation control function that controls the operation of the player object according to the user's operation,
Realized,
In the placement function, when the player object executes a summoning operation to make an object of the predetermined size appear, if there is no space around the position of the player object to place the object of the predetermined size, the reference position is selected. , A function of arranging the player object and the object of a predetermined size in the area to be the reference position,
The game program according to any one of [15] to [19].

[21]
In the calculation function, for collision determination, a function of performing collision determination using a simple-shaped object of a size including the object of a predetermined size,
The game program according to any one of [14] to [20].

[22]
In the calculation function, each time a predetermined execution condition is satisfied, the plurality of candidate positions are calculated and stored in the storage unit.
The game program according to any one of [14] to [21].

[23]
In the calculation function, a function of calculating the candidate position by further performing a collision determination while shifting a predetermined position in the movable range upward to a predetermined height.
The game program according to any one of [14] to [22].

[24]
On the computer,
An event generation function that generates an in-game event associated with the trigger area when the player object moves to the trigger area, which is a part of the three-dimensional virtual space.
Realized,
In the calculation function, in addition to the movable range, a function of performing a collision determination in the trigger area and calculating the candidate position,
The game program according to any one of [14] to [23].

[25]
A game system including a terminal device that executes a game in which a player object operates based on a user's operation in a three-dimensional virtual space, and a server device that is connected to the terminal device by a communication network.
A calculation means for calculating a plurality of candidate positions capable of arranging objects of a predetermined size in a three-dimensional virtual space by referring to terrain data capable of specifying a movable range of a player object in the three-dimensional virtual space.
An arrangement means for arranging an object of a predetermined size in an area using one candidate position selected from the plurality of candidate positions as a reference position.
Including
The calculation means determines a collision between objects within the movable range, and determines a position where an object of a predetermined size does not collide with another object as the candidate position.
Game system.

[26]
A terminal device that controls the progress of a game in which a player object operates based on a user's operation in a three-dimensional virtual space.
A calculation means for calculating a plurality of candidate positions capable of arranging objects of a predetermined size in a three-dimensional virtual space by referring to terrain data capable of specifying a movable range of a player object in the three-dimensional virtual space.
An arrangement means for arranging an object of a predetermined size in an area using one candidate position selected from the plurality of candidate positions as a reference position.
Including
The calculation means determines a collision between objects within the movable range, and determines a position where an object of a predetermined size does not collide with another object as the candidate position.
Terminal equipment.

[27]
A game progress control method in which a computer controls the progress of a game in which a user operates a player object for which attributes are set.
A game progress control method in which a computer controls the progress of a game in which a player object operates based on a user's operation in a three-dimensional virtual space.
Calculation processing that calculates multiple candidate positions where objects of a predetermined size can be placed in the 3D virtual space by referring to the terrain data that can specify the movable range of the player object in the 3D virtual space.
Arrangement processing for arranging an object of a predetermined size in an area using one candidate position selected from the plurality of candidate positions as a reference position.
Including
In the calculation process, a process of determining a collision between objects within the movable range and determining a position where an object of a predetermined size does not collide with another object as the candidate position.
Game progress control methods including.

According to one of the embodiments of the present invention, in a game in a three-dimensional virtual space in which a player object exists, a plurality of candidate positions in which an object having a very large size and a predetermined size can be placed are automatically generated, and the candidate positions are automatically generated. Useful for placing objects in optimal positions.

20 Terminal device 31 Calculation unit 32 Arrangement unit 33 Motion control unit 34 Event generation unit 35 Setting unit 50 Game space MA Navigation mesh (terrain data)
CP candidate position TV trigger volume (trigger area)
PV point volume (management area)

Claims (5)

It is a game program for realizing a function in a computer to control the progress of a game in which a player object operates based on a user's operation in a three-dimensional virtual space.
A calculation function that calculates multiple candidate positions where objects of a predetermined size can be placed in the 3D virtual space by referring to the terrain data that can specify the movable range of the player object in the 3D virtual space.
An arrangement function for arranging an object of a predetermined size in an area using one candidate position selected from the plurality of candidate positions as a reference position.
Realized,
The movable range includes a plurality of preset management areas.
In the calculation function,
A function of determining a collision between objects within the movable range and determining a position where an object of a predetermined size does not collide with another object as the candidate position.
A function of associating the plurality of candidate positions with the management area to which they belong and storing them in the storage unit.
Realized,
The plurality of management areas include a parent management area and a child management area in which a parent-child relationship is set.
The parent management area includes the child management area, and candidate positions other than the candidate position associated with the child management area are associated with the parent management area.
On the computer,
A setting function that sets the parent-child relationship to either the first state or the second state according to the situation of the three-dimensional virtual space in the parent management area.
Realized,
In the arrangement function,
A function in which one candidate position closest to the player object among the candidate positions associated with the management area in which the player object is located is set as the reference position.
When the player object is located in the parent management area and the child management area, if the parent-child relationship is in the first state, the candidate positions associated with the parent management area and the child management area are said to be the same. A function in which one candidate position closest to the player object is used as the reference position.
When the player object is located in the parent management area and the child management area, in the case of the parent-child relationship in the second state, among the candidate positions associated with the child management area, the player object is closest to the player object. A function that uses the candidate position of 1 as the reference position,
A game program that realizes. In the arrangement function,
When the player object is located in the parent management area and is not located in the child management area, and if the parent-child relationship is in the first state, the candidate associated with the parent management area and the child management area. A function in which one candidate position closest to the player object is used as the reference position among the positions.
When the player object is located in the parent management area and is not located in the child management area, in the case of the parent-child relationship in the second state, among the candidate positions associated with the parent management area, the said A function in which one candidate position closest to the player object is used as the reference position.
The game program according to claim 1. In the arrangement function, among the plurality of candidate positions, the candidate positions that are dynamic objects operating in the three-dimensional virtual space excluding the player object and that overlap with the filtered dynamic objects have the predetermined size. Ability to exclude the placement of objects in
The game program according to claim 1 or 2. A game program for controlling the progress of a game by a server device connected by a communication network to a terminal device that executes a game in which a player object operates based on a user's operation in a three-dimensional virtual space.
To the server device
A calculation function that calculates multiple candidate positions where objects of a predetermined size can be placed in the 3D virtual space by referring to the terrain data that can specify the movable range of the player object in the 3D virtual space.
An arrangement function for arranging an object of a predetermined size in an area using one candidate position selected from the plurality of candidate positions as a reference position.
Realized,
The movable range includes a plurality of preset management areas.
In the calculation function,
A function of determining a collision between objects within the movable range and determining a position where an object of a predetermined size does not collide with another object as the candidate position.
A function of associating the plurality of candidate positions with the management area to which they belong and storing them in the storage unit.
The plurality of management areas include a parent management area and a child management area in which a parent-child relationship is set.
The parent management area includes the child management area, and candidate positions other than the candidate position associated with the child management area are associated with the parent management area.
In addition to the server device
A setting function that sets the parent-child relationship to either the first state or the second state according to the situation of the three-dimensional virtual space in the parent management area.
Realized,
In the arrangement function,
A function in which one candidate position closest to the player object among the candidate positions associated with the management area in which the player object is located is set as the reference position.
When the player object is located in the parent management area and the child management area, if the parent-child relationship is in the first state, the candidate positions associated with the parent management area and the child management area are said to be the same. A function in which one candidate position closest to the player object is used as the reference position.
When the player object is located in the parent management area and the child management area, in the case of the parent-child relationship in the second state, among the candidate positions associated with the child management area, the player object is closest to the player object. A function that uses the candidate position of 1 as the reference position,
A game program that realizes. A game system including a terminal device that executes a game in which a player object operates based on a user's operation in a three-dimensional virtual space, and a server device that is connected to the terminal device by a communication network.
A calculation means for calculating a plurality of candidate positions capable of arranging objects of a predetermined size in the three-dimensional virtual space by referring to the terrain data capable of specifying the movable range of the player object in the three-dimensional virtual space.
An arrangement means for arranging an object of a predetermined size in an area using one candidate position selected from the plurality of candidate positions as a reference position.
Including
The movable range includes a plurality of preset management areas.
The calculation means is
Collision determination between objects is performed within the movable range, and a position where the object of the predetermined size does not collide with another object is determined as the candidate position.
The plurality of candidate positions are stored in the storage unit in association with the management area to which the candidate positions belong.
The plurality of management areas include a parent management area and a child management area in which a parent-child relationship is set.
The parent management area includes the child management area, and candidate positions other than the candidate position associated with the child management area are associated with the parent management area.
Further including a setting means for setting the parent-child relationship in either the first state or the second state according to the situation of the three-dimensional virtual space in the parent management area.
The arrangement means
Among the candidate positions associated with the management area where the player object is located, the one candidate position closest to the player object is set as the reference position.
When the player object is located in the parent management area and the child management area, if the parent-child relationship is in the first state, the candidate positions associated with the parent management area and the child management area are said to be the same. The 1 candidate position closest to the player object is set as the reference position.
When the player object is located in the parent management area and the child management area, in the case of the parent-child relationship in the second state, among the candidate positions associated with the child management area, the player object is closest to the player object. The candidate position of 1 is set as the reference position.
Game system.

Images