JP4976771B2 - Self-action control method for demonstration of shooting game, its device, its program, and its recording medium - Google Patents

Description

  The present invention relates to a processing technique for a shooting game in which an own aircraft and an enemy aircraft displayed on a screen fight each other. More specifically, it relates to the behavior control of the own machine in a demonstration of a shooting game.

Currently, shooting games using computers are widely used.
In a general shooting game, one player and one or more enemy aircraft are displayed on the screen. Here, the screen is a screen on which a shooting game is displayed. If it is a so-called full screen display format, it corresponds to the entire display unit of a display device such as a display, or independent of a part of the display unit. In the case of a so-called window format in which a display area is prepared and a function for displaying an image or text in the display area is provided, this window-type display area corresponds to the screen.
The player can use appropriate input means [for example, a keyboard key, a switch that can be pressed in multiple directions, or a control stick. ] Is converted into several types of actions on the screen, and the own action behaves according to the operation. In addition, the player may use appropriate input means such as a keyboard key, a switch that can be pressed in multiple directions, and a button provided on the control stick. ] Is converted into an attack action of the own aircraft on the screen, and the own aircraft can fire an attack bullet and damage the enemy aircraft and various items.

On the other hand, the enemy aircraft is operated by a human operation type operated by a player different from the player who operates the own device, such as a network battle type shooting game, or a computer operation type operated by a computer. . The “computer” is not limited to a general-purpose machine such as a so-called personal computer, and widely refers to a game-dedicated machine or the like [the same applies hereinafter. ]. In addition, “computer operation” refers to the action of enemy aircraft, the launch of attack bullets, etc. by the cooperation of computer hardware resources and software installed on the computer to realize information processing. Is displayed on the computer screen.
In the case of the computer operation type, the action control of the enemy aircraft and the firing control of the enemy aircraft against the own aircraft are processed according to the computer control program.

  The “action” of the own aircraft / enemy aircraft includes not only the “movement” action but also the “stationary” action. In addition, when the own or enemy aircraft fires an attack bullet, not only the “fire” of the attack bullet is displayed on the screen, but also the flight of the fired attack bullet is displayed.

  In such a shooting game, a demonstration of the shooting game is often displayed on the screen when the player is not playing the game and is in a so-called “waiting state”. In the demonstration, for the purpose of introducing the game contents of the shooting game or for the purpose of the player's own player temporarily interrupting the player's operation, etc., the player's own action is performed by the computer operation and the shooting game is played It is common to display the situation. In this specification, the demonstration means that the machine is operated by a computer regardless of the purpose.

Although the above fact in the shooting game is well known, Non-Patent Document 1 is shown as an example.
Kenichiro Matsuura, “Shooting Game Algorithm Maniacs” first edition, Softbank Publishing Co., Ltd., June 2004

  The algorithm that determines the behavior of the aircraft in the conventional demonstration is, for example, moving the aircraft toward the enemy aircraft and the attacking bullet fired from the enemy aircraft, or does not move the aircraft even if the attacking bullet approaches It was so simple that it controlled the behavior of the aircraft that was unreasonable from the human eye. For this reason, in many cases, since the enemy aircraft is immediately destroyed by the attack of the enemy aircraft, it was difficult to perform a demonstration for such a long time as to allow the player to understand the game content, for example.

In order to solve such problems, it is considered effective to introduce artificial intelligence technology to the demonstration. Currently, research on games in artificial intelligence is the so-called non-action system such as chess, othello and shogi. It is mainly focused on thinking games [see, for example, references. There was no attempt to apply artificial intelligence to a shooting game demonstration.
(Reference) Jonathan Schaeffer, H. Jaap van den Herik, “Games, computers, and artificial intelligence”, Artificial Intelligence, 2002, Vol. 134, p1-7

  Artificial intelligence technology research to solve thinking games such as chess, othello, and shogi is focused on developing methods for efficient deep search computation. It is not meaningful to simply introduce such artificial intelligence technology into a shooting game demonstration. This is because the amusement of a shooting game is in a virtual battle that takes place quickly, and even in demonstrations that convey such amusement, emphasis is placed on not impairing real time rather than deep search calculations.

  Therefore, in view of the above-described problems, the present invention provides a self-action control method for demonstration of a shooting game for controlling the action of the self-approach that is reasonable from the human eyes in the demonstration, its apparatus, its program, and its recording. The purpose is to provide a medium.

In order to solve the above problems, in the present invention, the self-machine and one or more enemy aircraft are displayed on the screen, and the self-machine and the enemy aircraft act in a shooting game demonstration to fire an attack bullet. A self-machine action control method for demonstration of a shooting game that controls the action of the machine is as follows. That is, first, at the current time t ₀ when the own aircraft target setting means should determine the action of the own aircraft, the position and speed of the attack bullets fired by the enemy aircraft at a time earlier than the current time t ₀ , the position of the enemy aircraft and its speed, and on the basis of the location of the terminal of the current, the screen starting from the square s ₀ is present ship a square grid that is divided in a grid pattern at the present time t _0, the time after the present time t ₀ n The total number of routes (total number of forward routes) that can be reached by each aircraft without approaching a distance within a certain distance for each position where at least one of enemy aircraft and attack bullets is expected to exist. calculated forward path total number is set as the target maximum squares s _g. Next, the self-behavior determining means starts from the target cell s _g based on the position and speed of the attacking bullet fired by the enemy aircraft at a time point before the current time t ₀ , the position and speed of the enemy aircraft. At time t ₀ + ΔT prior to time n, the aircraft does not approach a distance within a certain distance with respect to each position where at least one of the enemy aircraft and attacking bullets is predicted to exist at each square of the lattice. to determine the path total [reverse path total number] that may be reached by each square in square, the square opposite path total s ₀ and the square s ₀ around the ship in one processing unit time ΔT of squares is squared s Of the total number of reverse paths of the cell s ₀ ′ movable to ₀ , it is determined to act on the cell having the maximum total number of reverse paths.
In this way, the cell s _g that is the target of the aircraft at the current time t ₀ is determined by the total number of routes that consider the possibility of collision with enemy aircraft and attack bullets in the future, and the enemy s _g in the future with this cell s _g as the starting point. in consideration of the possibility of collision with the aircraft and attack bomb, at time t _{0 +} [Delta] t, 1 processing in the square around the reverse path total and squares s ₀ squares s ₀ the apparatus itself is present at the moment t ₀ The unit calculates the total number of reverse paths of the cell s ₀ ′ that can move to the cell s ₀ in unit time ΔT, and decides to act on the cell having the maximum total number of reverse paths.

In the present invention, it is possible to reflect the consideration that the own aircraft destroys enemy aircraft as much as possible and the consideration that the location of the own aircraft is as close to the center of the screen as possible in the process of obtaining the total number of reverse paths. That is, at each time t for obtaining the total number of reverse paths, if the own aircraft is in the grid s, the total number of reverse paths Cb (s, t) of the grid s when the enemy aircraft is on the attack line of the own aircraft, It may be relatively increased as compared with the total number of reverse paths of the squares, or at each time t for obtaining the total number of reverse paths, the distance r from the center of the screen of the squares s is input to the monotonically decreasing function. Or the result obtained by inputting the distance r from the center of the screen of the cell s into the monotonically decreasing function may be multiplied by the total number of reverse paths Cb (s, t) of the cell s. Good.
These are not mutually exclusive, but at each time t for obtaining the total number of reverse paths, if the own aircraft is in the grid s, the total number of reverse paths in the grid s when the enemy aircraft is on the own attack line Cb (s, t) is relatively increased as compared with the total number of reverse paths of other cells, and further, the center of the screen of cell s is added to the relatively increased total number of reverse routes Cb (s, t). Multiplying the result obtained by inputting the distance r to the monotonically decreasing function or the result obtained by inputting the distance r from the center of the screen of the cell s to the monotonically decreasing function into an integer value Also good.

  According to the present invention, the action of the aircraft is determined based on the total number of paths in consideration of the possibility of collision with enemy aircraft and attack bullets in the future. Unreasonable behavior of the aircraft such as moving the aircraft or not moving the aircraft even if an attack bullet etc. approaches, the behavior control of the aircraft that makes sense from the human eye is made A demonstration of a shooting game will be realized.

《Technical overview》
In the present invention, the screen is divided into a grid pattern, and the total number of paths reaching the grid cell s ₀ at the time point n after the current time from the grid cell s ₀ where the own device exists at the current time t ₀ (= 0). C (s, n) is obtained for each cell, and the cell having the largest C (s, n) is set as a target of the destination of movement. Then, at the current time t ₀ , an optimal action is selected so as to head for this goal.

Here, “time point” refers to each time point taken at the processing unit time interval of the shooting game. If the current time point is t ₀ and the processing unit time is ΔT, each time point t after the current time point is t _{0. + ΔT, t 0 + 2ΔT,} t 0 + 3ΔT, ···, a n. “Current time” refers to the point in time when the behavior of the aircraft should be determined during the demonstration. In a computer game as well as a shooting game, processing using time is performed. Here, the processing unit time is a unit time based on one action of the own device. In other words, the number of actions of the own device that can be performed in one processing unit time ΔT is one including the action of stillness with respect to the grid.

In the present invention, it is assumed that the following conditions are imposed on the behavior of the aircraft. That is, the vertical component (speed) of the moving speed when moving diagonally is the same as the speed when moving only in the vertical direction, and the horizontal component (speed) moves only in the horizontal direction. It is assumed that the speed is the same as the speed when Here, “velocity” is a vector amount having both “speed” and “direction” of an object displayed on the screen.
Further, it is assumed that the following conditions are imposed on the action of an attacking bullet fired from an enemy aircraft. That is, each attack bullet maintains the speed determined when fired from the enemy aircraft after launch.
Furthermore, each enemy aircraft shall maintain the current speed. However, in actual game play and demonstration, the enemy aircraft speed may change with time, and it means that the enemy aircraft speed does not change in the action determination of the own aircraft in the demonstration. The present invention is not applied only to a shooting game with a constant enemy aircraft speed.

  The own aircraft / enemy aircraft / attack bullets are generally displayed on the screen as an image that mimics some object (for example, a fighter or a bullet). In the shooting game, a collision determination process between the own aircraft and the enemy aircraft and a collision determination process between the own aircraft and the attack bullet are performed. For this determination, in addition to the external shape of the simulated object, each shape for determining the collision of the own aircraft, enemy aircraft, and attack bullets is generally defined. In the following, unless otherwise specified, simply speaking “shape” of the own aircraft / enemy aircraft / attack bullet means the shape for collision determination. In the present invention, there is no limitation on the definition method, and any definition method may be used (however, as in the conventional shooting game, each of the own aircraft, enemy aircraft, and attack bullets used for collision determination). It is preferable that the shape is uniquely defined rather than variable for each process. ]. For example, the smallest rectangle that encloses the external shape of the machine itself (in the present specification, it is not limited to a rectangle, but a square such as a square, a rhombus, a parallelogram, and a polygon such as a triangle or a pentagon. The term “rectangular” is used. ] Or a circle may be defined as the shape of the aircraft used for collision determination. The same applies to enemy aircraft and attack bullets.

  Also, the reference point of the own aircraft / enemy aircraft / attack bullet used for specifying the position of the own aircraft / enemy aircraft / attack bullet on the screen is determined. There is no particular limitation on how to set the reference point. For example, if the shape used for collision determination is defined as described above, it is easy to use the center of the smallest rectangle or circle that contains the outline of the aircraft as the reference point. It is. As for the center of the rectangle, for example, if it is a shape such as a rectangle or a square, the intersection of diagonal lines is the center of the rectangle, or the center of the smallest circle that contains the rectangle is the center of the rectangle as appropriate. Can be determined. If the reference point is determined in this way, the position coordinates of the reference point on the screen can be used as the position coordinates on the screen of the own aircraft / enemy aircraft / attack bullet.

In addition, regarding the shape of each grid of the lattice, the vertical length is (the vertical speed of the own machine) × ΔT, and the horizontal length is (the horizontal speed of the own machine) × ΔT. If grid of such squares, from the ship speed conditions, squares movable in one processing unit time from squares s ₀ the apparatus itself is currently surrounds the squares s ₀ in contact with the squares s ₀ It will be a grid.
The processing unit time ΔT is one of the factors that affect the size of the cell, and it can be evaluated that the cell is a discretization of the position of the own machine. Therefore, it is not preferable to increase ΔT unnecessarily. As ΔT is increased, the position of the own device for each processing unit time is roughly discretized. The preferred ΔT depends on the processing capability of the arithmetic processing unit, the language used in the program, and the way the actual program is written. However, the short side of the square is an indicator of the shape of the attack bullet or enemy aircraft. [Length to be described later. ] And a length that will be an index of the shape of the aircraft [described later. ], It is preferable to set ΔT so that it is less than or equal to the reference length, preferably less than half of the reference length, more preferably less than one third of the reference length. In addition, it is preferable to set it to 1 / integer or less of the reference length from the relationship between the grid shape and the position coordinates of the enemy aircraft / attack bullets described later.

  There are several types of actions that can be performed on the movable grid, but for example, it can be the same as the movement of a Japanese shogi “tama general” or “king general”, or it can be a cross-shaped movement. Can do. Here, the movement of the ball general is as shown in FIG. 1 (a), and the movement of the crossed characters is as shown in FIG. 1 (b). In both figures, the black circle mark indicates the current position of the own machine, and the white circle mark indicates the position of the own machine that can move after one processing unit time. In FIG. 1 (a), there are nine types of behaviors: stationary and movement to each of the eight surrounding cells, and FIG.

The total number C (s, n) of paths reaching the cell s at the time point n after the current time from the cell s ₀ where the own device exists at the current time t ₀ (= 0) is obtained by, for example, a decision tree search. be able to. However, if there is a restriction on the behavior of the aircraft as described above, from the cell s ₀ where the device exists at the current time t ₀ (= 0) to a certain cell s at a certain time t after the current time. The total number of paths C (s, t) is the sum of C (s ′, t−ΔT) of the cell s ′ that can be moved to the cell s in one processing unit time among the cells around the cell s [s]. It is the sum total about ′. ] And C (s, t−ΔT) of the cell s one processing unit time before, the C (s, t) of each cell at each time point is obtained sequentially, so that The total number C (s, n) of routes reaching the cell s can be obtained efficiently.

In the process of obtaining the total number C (s, n) of routes reaching a certain cell s at the time point n after the current time from the cell s ₀ where the own device exists at the current time t ₀ (= 0), The following considerations are made.
At the time of deciding the action of the own aircraft in the demonstration, at that time, one or more enemy aircraft [hereinafter also referred to as “existing enemy aircraft”]. ] Or one or more attack bullets fired from enemy aircraft [hereinafter also referred to as “existing attack bullets”. ] May be displayed. Therefore, at each time point t after the current time, a path in the grid including each position where at least one of the existing enemy aircraft and the existing attack bullet is expected to exist and a grid s located within a predetermined distance from each position is shown. The total number is reset to 0 at that time. This is equivalent to C (s, t) = 0. This is a sign of consideration that the demonstration will contribute to making the aircraft longer and immune from destruction by enemy aircraft and attacks from enemy aircraft.
Here, “each position where at least one of existing enemy aircraft and existing attack bullets is predicted to exist” is not a position where both existing enemy aircraft and existing attack bullets are predicted to exist, but existing enemy aircraft. The position where the existing enemy bullet and the existing attack bullet are predicted are included, and in this sense, the position where both the existing enemy aircraft and the existing attack bullet are predicted is included. In addition, “predetermined distance from each position where at least one of existing enemy aircraft and existing attack bullets is predicted to exist” refers to collision determination between enemy aircraft and the own aircraft or collision detection between attack bullets and the own aircraft. The distance used. Within such a distance, that is, in a region closer to the center of each enemy aircraft and attack bullet, it is determined that the aircraft has collided with the enemy aircraft and / or attack bullet. In other words, an area extending from “a predetermined distance from each position where at least one of an existing enemy aircraft and an existing attack bullet is expected to exist”, that is, a collision determination shape is defined, and the collision determination shape is used to Judgment of collision with attack bullets or collision between own aircraft and enemy aircraft can be performed.

The collision determination shape can be defined as appropriate. Here, the case of an attack bullet will be described as an example, but the same understanding can be obtained for an enemy aircraft by replacing “attack bullet” with “enemy aircraft”.
For example, when the collision determination shape is a circle, the collision determination circle has, for example, the center of the collision determination circle as the center of the attack bullet shape, and the radius of the collision determination circle (from the center of the attack bullet shape to the outer periphery of the attack bullet shape) Shortest distance) + (shortest distance from the center of the own machine shape to the outer periphery of the own machine shape). However, the radius may be (the longest distance from the center of the attacking bullet shape to the outer periphery of the attacking bullet shape) + (the shortest distance from the center of the own device shape to the outer periphery of the own device shape). In short, the radius of the collision determination circle is the sum of the length serving as the index of the shape of the attack bullet and the length serving as the index of the shape of the own aircraft. Here, how to take the index can be appropriately determined by defining the shape of the own aircraft or the attack bullet. In a simple example, if the shape of the aircraft or attack bullet is a circle, this radius can be used, and if it is a rectangle, half of its long side can be used as an index. If the collision determination circle is defined as described above, it is possible to determine that the own aircraft has collided with an attack bullet if the position coordinates of the own aircraft exist on or in the collision determination circle.
When the collision determination shape is a rectangle, as an example, the attack bullet shape is a rectangle with a width 2a and a length 2b, and the own shape is a rectangle with a width 2c and a length 2d. The center of the attack bullet shape can be used as the center, and the rectangle can be a horizontal a + c and vertical b + d. If the collision determination rectangle is defined in this way, it can be determined that the own aircraft has collided with the attack bullet if the position coordinates of the own aircraft exist on or within the collision determination rectangle.
The center of the collision determination shape is the same as the setting of the reference point of the own aircraft / enemy aircraft / attack bullet described above. For example, the center of the collision determination circle is the center, and the center of the circumscribed circle is the collision determination rectangle. be able to.

As described above, at each time point after the current time point, a cell including each position where at least one of the existing enemy aircraft and the existing attack bullet is predicted to exist, and a cell located within a predetermined distance from each position. C (s, t) is set to 0. Such a cell [hereinafter also referred to as a “desired cell”. ] Is a grid that includes all or part of it in the collision determination shape. For example, when the collision determination shape is a circle, a grid in which all or part of the collision determination circle is included from the position coordinates of the attack bullet can be identified by a finite step algorithm by a computer. In other words, consider specifying easily.
The present invention solves this problem as follows. Here, the case of an attack bullet will be described as an example. However, in the case of an enemy aircraft, the same understanding can be obtained by replacing “attack bullet” with “enemy aircraft”.
Assume that the position coordinates of the attack bullets are either the corners or the center of the corners of the square where the position coordinates exist, and these viewed position coordinates [hereinafter referred to as “viewed position coordinates”] Also called. ], C (s, t) of a mesh whose part or all is included in the collision determination shape centered on] is set to 0. In other words, C (s, t) of the cell located within a predetermined distance from any one of the corners of the cell including the position where the existing attack bullets are predicted to exist or the center thereof is set to 0. It is. It should be noted that it is not an essential requirement to set C (s, t) of a mesh whose part is included in the collision determination shape centered on the viewing position coordinates to 0. What is necessary is to set C (s, t) of the meshes that are all included in the collision determination shape centered on at least the viewed position coordinates to 0. In the present specification, for convenience of explanation, a case will be described in which C (s, t) of a mesh whose part is included in the collision determination shape centered on the viewed position coordinates is also set to 0.

Although the collision judgment shape can be different for each type of attack bullet, the collision judgment shape is usually the same for the same type of attack bullet, but if the lattice is fixed, the corners of the corners of the square or The cells included in the collision determination shape centered on one of the centers are unique.
This will be described with reference to FIG. In FIG. 2, the ■ marks indicate the viewing position coordinates, and the reference numeral 50 indicates a lattice. FIG. 2 shows a case where the collision determination shape is a collision determination circle or a collision determination rectangle. FIG. 2A shows a case where the square is a square, and the position coordinates of the attack bullet are regarded as one of the four corners of the square where the position coordinates exist. FIG. 2 (c) shows a case where the square is a square and the position coordinates of the attack bullets are considered at the center of the square where the position coordinates exist. FIG. 2B shows a case where the cell is a vertically long rectangle, and the position coordinates of the attack bullet are considered as one of the four corners of the cell where the position coordinates exist. FIG. 2D shows a case where the cell is a vertically long rectangle, and the position coordinates of the attack bullet are considered at the center of the cell where the position coordinates exist. In either case, the squares in which 0 is entered are squares in which a part or all of the collision determination shape is included, and these squares indicate the position coordinates of the attack bullets at the four corners of the square where the position coordinates exist or If the same collision determination shape is used for the same type of attack bullets as the rule of considering one of the centers as a predetermined one, the position coordinates of the considered attack bullets are unique. . Therefore, if information on a set of uniquely defined cells is stored in the storage means as, for example, a template (shaded portion in FIG. 2), the template is simply applied to the position coordinates of the considered attack bullets. The desired cell C (s, t) can be set to zero.
In this way, strictly speaking, from the position coordinates of the attack bullets and the collision determination shape, the template can be set with respect to the position coordinates without taking into account the process of specifying a part of or all of the cells included in the collision determination shape. The desired mesh C (s, t) can be set to 0 simply by applying the process.
Note that information relating to a set of squares that are uniquely determined may be stored in the storage unit as the number of squares surrounding the square where the position coordinates of the attack bullets exist, for example, instead of as a template.

As described above, simply specifying a desired cell is a so-called approximation process, and therefore, it is preferable to reduce the difference from the case where the desired cell is specified as precisely as possible. Therefore, in the case where the viewing position coordinates are any one of the four corners of the square including the position where the attack bullet is predicted to exist, the closest position to the attack bullet position coordinates may be used. Good.
Note that if the processing is simpler, the position coordinates of the attacking bullets may be in any part of the grid, but may be configured to always have a predetermined viewing position coordinate. In other words, for example, regardless of the position coordinates of the attack bullets, the upper left corner of the square may be regarded as the position coordinates and processed uniformly.

As already mentioned, C (s, n) is to move the target of its own maximum square, at the present time t _0, but it is to choose the best actions that towards this goal, the best action Add a description of selection.

The simplest and most suitable action is selected by drawing a straight line from the cell s ₀ where the aircraft is present at the current time t ₀ to the cell having the largest C (s, n), and contacting the cell s ₀ with the cell s ₀ Of the cell s ₀ ′ surrounding ₀ , the user operates the cell against the cell including this straight line. The straight line may be a straight line connecting the center of the cell s _{0 and} the center of the cell having the largest C (s, n).
However, although this action selection is preferable in that it is a simple process, it is not necessarily the same as the cell at the time point t ₀ + ΔT on the path where C (s, n) reaches the maximum cell at the time point n, and C ( The significance of seeking s, n) may not be fully utilized.
Rather, from among the routes that can reach the target cell, that is, the cell that has the largest C (s, n) at time n, the user should act at the most likely cell to exist at time t ₀ + ΔT. It is thought that it should be done. As a way of thinking, similarly to the process of obtaining C (s, n), starting from the cell having the largest C (s, n) at time n, the C (s, t) of each cell is traced back to time t ₀ + ΔT. ) Are sequentially obtained, and finally C (s, t ₀ + ΔT) at time t ₀ + ΔT is obtained, and the mesh s _{0 in contact} with C (s ₀ , t ₀ + ΔT) and cell s ₀ is obtained. s _'C (s 0 of', _{t 0} + ΔT) ₀ surrounding the square _{s 0} it comes to act against square with the maximum value among.

As already explained, since the action of the enemy aircraft is simplified by assuming that the current speed is maintained, and the effect of the attacking bullets fired at a future time is not considered, C (s, t The value of ( ₀ + ΔT) is not accurate. In other words, the value of C (s, t ₀ + ΔT) is accurate on the assumption that the enemy aircraft maintains the current speed and does not take into account the effects of the bullets fired at a future time. There are only.

Assuming that each enemy aircraft does not maintain the speed, C (s, t) is considered in consideration of the effects of attacking bullets fired at a future time point, and further taking into account the appearance of enemy aircraft with high uncertainty. ₀ + ΔT) is the same as the method for obtaining C (s, t) as a sum of C (s ′, t−ΔT) and C (s, t−ΔT) as well as decision tree search. Even if the method is used, real-time processing becomes difficult because the calculation amount can be enormous.

Therefore, it is only necessary to assume that the enemy aircraft that exists at the present time is destroyed as much as possible in the process of calculating the total number of routes. It is possible to reduce the action of enemy aircraft that lowers the accuracy of C (s, t) and the firing of attack bullets at each future time point, and to increase the reliability of C (s, t). It should be noted that one of the matters to be considered in determining the current behavior of the aircraft is not "the aircraft actually destroys the enemy aircraft at some point in the future" It is a hypothetical matter that "the aircraft can destroy enemy aircraft as much as possible at each point in the future".
Further, in the future, it is desirable that the position of the own device be as close to the center of the screen as possible so as not to create a situation where the movement of the own device is restricted as in the case where the own device is located at the edge of the screen.

From these points of view, determined by the optimal behavior, such as going to the target in the following manner at the present time t _0.
First, C (s, t) is sequentially obtained while decreasing the time, starting from the cell having the maximum C (s, n) at time n, and C (s, t ₀ + ΔT) at time t ₀ + ΔT is obtained. Ask. Since the value can be different from the above-described C (s, t), it is expressed here as Cb (s, t) in a sense to distinguish it from the C (s, t). Accordingly, C (s, t) is referred to as the total number of forward paths, and Cb (s, t) is referred to as the total number of reverse paths.
The method for obtaining Cb (s, t) is the same as the method for obtaining C (s, n) described above, except that the time point is sequentially decreased from n to t ₀ + ΔT. In other words, the total number of reverse paths Cb (s, t) from the maximum cell Cb (s, n) at the time point n to the cell s at a certain time point t that is decreased from the time point n is the cell around the cell s. Is the sum of Cb (s ′, t + ΔT) of the cell s ′ that can move to the cell s in one processing unit time [the sum relating to s ′. ] And Cb (s, t + ΔT) of the cell s one processing unit before, so by sequentially obtaining Cb (s, t) at each time point, the cell s at the time point t ₀ + ΔT Cb (s, t ₀ + ΔT) can be obtained efficiently.

  At each time point t at which Cb (s, t) is determined, at a cell including each position where at least one of an existing enemy aircraft and an existing attack bullet is predicted to exist, and a cell s located within a predetermined distance from each position The reverse path total number Cb (s, t) is reset to 0 at that time as in the case of obtaining the forward path total number C (s, t).

In the process of sequentially obtaining Cb (s, t) while decreasing the time point, considering that the own aircraft destroys the enemy aircraft as much as possible, if the own aircraft is in the grid s at the time t, The value of Cb (s, t) of the cell s when it is on the attack line of its own machine is multiplied by As by a certain constant value As. The constant value As is a value greater than 1. That is, correction is performed to increase the total number of reverse paths of the square including the position of the own aircraft that can destroy enemy aircraft.
The purpose of this is to determine Cb (s, t) of the cell s when the enemy aircraft is on the attack line of the own aircraft when the aircraft is in the cell s at time t, and Cb (s, t) of the other cell. ), The value of Cb (s, t) of the mesh s when the enemy aircraft is on the attack line of the aircraft when the aircraft is in the mesh s at the time t. Is not limited to As multiplied by a constant value As greater than 1, and a process of multiplying Cb (s, t) of other cells by a constant value smaller than 1 is also possible. In any case, the design can be changed as appropriate without departing from this spirit. Therefore, in this specification, when the aircraft is in the grid s at the time t, the enemy aircraft is on the attack line of the aircraft. In the following description, it is assumed that the value of Cb (s, t) of a certain cell s is multiplied by As by a constant value As greater than 1.

  An “attack line” is a flight path of an attacking bullet fired by the aircraft. Note that the flight path does not strictly mean a “line”, but the attacking bullet has a certain size, and a collision determination is made. Don't be. In a shooting game, the flight path of attack bullets fired by the aircraft is generally defined in advance. As a simple example, when one attack bullet is fired at a time, the flight path of the attack bullet fired by itself is generally parallel to the vertical direction of the screen. In another example, when, for example, three attack bullets a, b, and c are fired at once, the flight path of one of the three attack bullets a is parallel to the vertical direction of the screen, and the remaining The flight paths of the two attack bullets b and c are such that they are sandwiched equiangularly around the flight path of the attack bullet a. Alternatively, when two attack bullets are fired, the flight paths of the attack bullets b and c may be the same. In any case, it is an appropriate design matter.

  Also, if there is an enemy aircraft on its own attack line, the own aircraft shall fire an attack bullet. However, it is not a requirement that the fired attack bullets be attacked by enemy aircraft. This is because, as described above, the attack on the enemy aircraft is aimed at reducing the action of the enemy aircraft that reduces the accuracy of C (s, t) and the firing of the attack bullets. For the purpose of demonstration effect, that is, an effect that makes the player think that this shooting game is “interesting”, “fun”, etc., an attacking bullet fired from the own aircraft may be forced into the enemy aircraft.

The determination of the cell s when the enemy aircraft is on the attack line of the own aircraft when the aircraft is in the cell s at the time t may be performed as follows. For example, as a simple example, when the flight path of the attacking bullet fired by the aircraft is parallel to the vertical direction of the screen, if the predicted position coordinates of the enemy aircraft at time t are (Xi, Yi), the coordinates The determination is made based on whether or not the value Xi is included in the range of the X coordinate value of the horizontal width of the cell s, which is assumed to be present at time t. That is, if the cell s is, for example, a cell whose coordinates of the four vertices are (100, 50), (110, 50), (100, 60), (110, 60) on the screen, 100 ≦ Xi ≦ 110 It is determined by whether or not. If it is included, the value of Cb (s, t) of the cell s is multiplied by As, and if it is not included, the value of Cb (s, t) of the cell s is not changed.
In addition, in a vertical scrolling shooting game where the background drawing of the screen flows vertically, for example, the background flows from the top of the screen to the bottom of the screen, the enemy aircraft is either side-by-side with the enemy aircraft, or the enemy aircraft When the aircraft is located below the screen, it is common that the aircraft does not hit even if it fires an attack bullet against such an enemy aircraft. In addition to whether or not t is included in the range of the X-coordinate value of the horizontal width of the cell s that is assumed to be present, for example, the vertical axis (Y-axis) value increases from the upper end of the screen toward the lower end of the screen. It may be determined whether or not the coordinate value Yi is smaller than the minimum value in the range of the Y coordinate value of the vertical width of the cell s that is assumed to be present at time t. That is, if the cell s is, for example, a cell whose coordinates of the four vertices are (100, 50), (110, 50), (100, 60), (110, 60) on the screen, 100 ≦ Xi ≦ 110 And Yi <50. This reason can also be applied to a side-scrolling shooting game or a shooting game that fires an attack bullet in the horizontal direction.
In this example, the flight path of attack bullets fired by the aircraft is illustrated as being parallel to the screen, but the flight paths of attack bullets fired by the aircraft are not parallel to the screen. Even in this case, for example, by assuming that the reference point of the aircraft is at the center of the cell, the attack line is uniquely determined (in the cell), and it is determined whether there is an enemy aircraft on the attack line. When the own aircraft is in the cell s at the time t, it is possible to determine the cell s when the enemy aircraft is on the own attack line.
In addition, since the control method itself which an own machine fires an attack bullet is not the gist of the present invention, explanation is omitted.

  The constant value As will be further described. The value of Cb (s, t) generally increases as t decreases (or increases) even though it may be reset to 0 in the presence prediction of an attack bullet or the like. When such a value of Cb (s, t) is multiplied by As, there is a possibility of overflowing digits. That is, Cb (s, t) has a certain variable type [for example, the maximum value that can be handled differs between the integer type and the long integer type. ] Is defined, there is a possibility that the maximum value of the numerical value that can be handled by the variable type may be exceeded by multiplying the value of Cb (s, t) by As. Therefore, the constant value As is preferably set appropriately according to the size of the lattice, the value of n, the variable type of Cb (s, t), and the like. Further, As is not limited to an integer value, but it is not necessary to calculate with a floating point number, for example, so it can be said that an integer value is generally used. If As is assumed to be a non-integer value, the decimal point of Cb (s, t) × As may be rounded up or down to give an integer value.

Further, in the process of sequentially obtaining Cb (s, t) while decreasing the time point, the own device is in the cell s at time t to reflect the consideration that the position of the own device is as close to the center of the screen as possible. In this case, the value of Cb (s, t) is multiplied by Az according to the distance r from the screen center of the cell s. Az is set to a value that is larger as the grid is closer to the center of the screen and smaller as the grid is farther from the center of the screen. The distance r from the center of the screen s to the center of the screen may be a distance between the position coordinates of the center of the screen and the position coordinates of the center of the screen s. The center of the cell s may be the intersection of two diagonal lines. For example, F (r) = exp (-r), F ( r) = exp (−r ² ), F (r) = 1 / (1 + r ² ), F (r) = {a + exp (−r)} / (a + 1), F (r) = {a + exp (−r ²⁾ )} / (A + 1), F (r) = {a + b ^ (− r ² )} / (a + 1), and the like. a and b are positive constants. exp is the power of the base of the natural logarithm. The symbol ^ represents a power. Here, a function that outputs a value that falls within the range of 0 to 1 is illustrated, but a value that falls within the range of 0 to k can be output by multiplying by an appropriate constant coefficient k. Further, the degree of distribution that becomes larger as the grid closer to the center of the screen becomes larger as the grid farther from the center of the screen becomes, for example, F (r) = exp (−r ² / c), where c is a positive constant. Adjustment is possible by appropriately setting the value. In addition, F (r) = {a + b × exp (−r)} / (a + 1), F (r) = {a + c × b ^ (− r ² )} / (a + 1), etc. are far from the center of the screen. Since it is asymptotic to a / (a + 1), by appropriately setting the value of a to a value other than 0, Cb (s, t) away from the center of the screen is virtually not wasted, or the center of the screen Cb (s, t) away from the grid can not be underestimated. In short, F (r) may be a monotonically decreasing function. Here, the monotonically decreasing function means that the function F (r) satisfies F (r ₁ ) ≧ F (r ₂ ) for any r ₁ and r ₂ with r ₁ ≦ r ₂ . Az = F (r) may be used. However, since it is not necessary to calculate with a floating point number, for example, Az is obtained by rounding up or down the decimal point of F (r) to obtain an integer value. It can be said that this is common. If Az is set to a non-integer value, it may be set to an integer value by rounding up or down after the decimal point of Cb (s, t) × Az.
In the above example, Az is calculated by obtaining the distance r, but Az may be given by a simpler process. Az is larger for cells closer to the center of the screen and smaller for cells farther from the center of the screen. Therefore, assuming that the lattice is fixed, Az is larger for cells closer to the center of the screen in advance. A smaller value is assigned to the grid away from the center. In this way, it is possible to save time and labor for obtaining the distance r and Az.

After all, if the constant value As that multiplies the value of Cb (s, t) when the enemy aircraft is in the grid s at time t and the enemy aircraft is not on the attack line of the aircraft is 1, Based on the condition, the value of Cb (s, t) of each cell at each time point is corrected to Cb (s, t) × As × Az.
In addition, since it is possible to consider the consideration of destroying enemy aircraft as much as possible and the consideration that the location of the aircraft is as close to the center of the screen as possible, each aircraft can be an enemy aircraft. When considering only destruction as much as possible, the value of Cb (s, t) of each square at each time point is corrected to Cb (s, t) × As, and the position of the own machine is as close to the center of the screen as possible. In order to take into account only for this reason, the value of Cb (s, t) of each cell at each time point may be corrected to Cb (s, t) × Az.

Then, the present time _t 0 (= 0) at the own apparatus _{Cb (s 0, t 0 +} ΔT) squares _{s 0} are present and squares _{s 0} own device in one processing unit time of the square surrounding of movable grids s ₀ 'each _Cb (s 0 of', _{t 0} + ΔT) of, it decides to act against squares was the maximum value.
In other words, as shown in FIG. 1A, if the action type of the own device is nine types, i.e., stationary and moving to eight surrounding cells, Cb (s ₀ , t ₀ + ΔT) and eight surroundings optimal each _{Cb (s 0 ', t 0} + ΔT) of the, if the maximum value is squares _{s 0,} in order to have the squares _{s 0} at time _{t 0} + _ΔT, the act of "rest" at the present time _{t 0} of To choose as an action. If the maximum value of squares _{s 1 ∈s 0} ', in order to have the squares _{s 1} at time _{t 0} + _ΔT, is selected as the optimal behavior of the action of "moving to the square _{s 1"} at the present time _{t 0.}

As described above, an optimal action toward the target is selected at the current time t ₀ , but this action may be selected every processing unit time ΔT.

<Embodiment>
Embodiments of the present invention will be described with reference to the drawings.
<Self-action control device for shooting game demonstration>
The self-action control device (1) for demonstration of a shooting game which is an embodiment of the present invention is generally present as an entity constituting a computer, rather than being independently present alone. It is not intended to exclude the existence as an independent entity. ]. Furthermore, the self-action control device (1) for demonstration of a shooting game is not an entity that constitutes a computer so that it can be easily separated from the computer, but evaluates the computer itself by focusing on a certain function. It is common to be a thing. In short, the self-action control device (1) for demonstration of a shooting game is generally a computer that executes the shooting game. Here, the computer broadly refers to a general-purpose machine such as a personal computer or a game-dedicated machine as described above.
Hereinafter, the self-action control device (1) for demonstration of a shooting game will be simply referred to as a self-action control device (1) for demonstration.

  The computer can store an arithmetic processing device such as a CPU or an MPU, a storage device (for example, a data to be used for the arithmetic processing, data obtained as a result of the arithmetic processing, a program interpreted and executed by the arithmetic processing device (for example, Volatile memory, nonvolatile memory) and the like. Further, as devices required for a computer capable of executing a shooting game, a display device such as a cathode ray tube display device or a liquid crystal display, and an input device such as a keyboard or a control stick are connected to the computer.

Taking a general-purpose machine as an example of a computer, an example of the hardware configuration of the demonstration self-action control device (1) is as follows (see FIG. 3).
The demonstration self-behavior control device (1) includes an input unit (11) to which an input device can be connected, an output unit (12) to which a display device can be connected, a CPU (Central Processing Unit; 14) [including a cache memory and the like. It may be. RAM (Random Access Memory) (15), ROM (Read Only Memory) (16) and external storage device (17) which is a hard disk, and these input unit (11), output unit (12), A CPU (14), a RAM (15), a ROM (16), a bus (18) connected so as to exchange data between the external storage devices (17), and the like are provided. If necessary, the demonstration self-action control device (1) may be provided with a device (drive) capable of reading and writing a storage medium such as a video card or a CD-ROM.

The external storage device (17) of the demonstration self-machine action control device (1) stores and stores a program for demonstration self-machine action control, data necessary for processing of this program, and the like. Further, data obtained by the processing of these programs is appropriately stored and stored in the RAM (15) or the like. Hereinafter, a device such as a RAM (15) or a register for storing the calculation result, the address of the storage area, and the like is simply referred to as a “storage unit”.
As described above, the demonstration self-action control device (1) is a computer that executes a shooting game, and the external storage device (17) stores and stores various programs necessary for executing the shooting game. However, since it is not related to the gist of the present invention, the explanation is omitted. Further, the details of the mechanism by which the program is interpreted and the shooting game is executed are not related to the gist of the present invention, and the description thereof will be omitted.

Specifically, the external storage device (17) was fired at a past time by the position and speed of the existing enemy aircraft at the time when the action of the aircraft should be determined in the demonstration [current time]. Based on the position and speed of the existing attack bullet, and the position of the aircraft, the forward path from the cell s ₀ where the aircraft exists at the current time t ₀ (= 0) to the cell s at a certain time n after the current time The total number C (s, n) is _calculated in consideration of the existence of existing enemy aircraft and existing attack bullets, and the cell sg having the maximum C (s, n) is set as the target cell to which the aircraft is heading. Starting from the program (own target setting program) and the target cell s _g , while considering the existence of existing enemy aircraft and existing attack bullets, destruction of enemy aircraft, and being near the center of the screen as much as possible, Sequentially the total number of reverse paths Cb s, Cb (s at time _{t 0} + [Delta] T by obtaining _t), t ₀ + ΔT) asking, Cb _(s 0 squares _{s 0} is present ship currently _{t 0 (= 0), t} 0 + ΔT ) and squares _s 'each _Cb (s 0' of movable grids _{s 0} around the ship in one processing unit time of the squares is the square _{s 0} of _{0, t 0} + [Delta] t) of, the largest value A program for deciding to act on the left eye (self-machine action determination program) is stored and stored.

In this embodiment, the own-machine target setting program calculates the total number of forward paths C (from a cell s ₀ where the own device exists at the current time t ₀ (= 0) to a certain cell s at a certain time t after the current time. s, t) each program at the time point n obtained by processing of the program (forward path number calculation program) for sequentially determining the presence of existing enemy aircraft and existing attack bullets and the forward path number calculation program And a program (target determination program) for specifying the largest cell s _g in the total number of forward paths C (s, n).
In addition, the self-behavior determination program in this embodiment calculates the total number of reverse paths Cb (s, t) from a target cell s _g to a cell s at a certain time t before time n to the existing enemy aircraft. A time t ₀ obtained by processing of the program (reverse path number calculation program) and the reverse path number calculation program for sequentially obtaining in consideration of the presence of existing attack bullets, destruction of enemy aircraft and being near the center of the screen as much as possible + [Delta] t in the _{Cb (s, t 0 + ΔT} ) of the present time _t 0 (= 0) in _{Cb (s 0, t 0 +} ΔT) squares _{s 0} the apparatus itself is present and surrounding squares _{s 0} out of square Program for identifying the cell that has the maximum value in each Cb (s ₀ ′, t ₀ + ΔT) of the cell s ₀ ′ that can be moved to the cell s ₀ in one processing unit time (action determination) Program).

  In the demonstration self-behavior control device (1), each program stored in the external storage device (17) and data necessary for the processing of each program are read into the storage unit (20) as necessary, and the CPU Interpretation is executed and processed in (14). As a result, the CPU (14) realizes predetermined functions (own device target setting unit [forward route number calculating unit, target determining unit], own device action determining unit [reverse route number calculating unit, action determining unit]). With this, the decision on the behavior of the aircraft is realized. Further, although not an essential component from the viewpoint of the present invention, a control unit having a function of controlling the execution of the shooting game and the demonstration is mounted, and this control unit is also realized by the CPU (14). . Note that all functions are not limited to being realized by an arithmetic processing device such as a CPU, and a part of the functions may be realized by hardware using, for example, an arithmetic circuit.

<Self-action control method for demonstration of shooting game>
Next, with reference to FIG. 4 and FIG. 5, the flow of the demonstration own machine action control process (determination of own machine action) in the demonstration own machine action control device (1) will be described narratively.

In this embodiment, the position coordinate of the own aircraft (30), the position coordinate and speed of the enemy aircraft (40) on the screen, and the position coordinate and speed of the existing attack bullet are stored in the storage unit (20), respectively. To do. Further, it is assumed that the time point n at which the target is determined is also stored in the storage unit (20).
The behavior of the aircraft is as shown in FIG.

First, the control unit (190) performs control so as to perform processing for determining the action of the own device (30) during execution processing of the demonstration.
In this embodiment, the demonstration self-machine action control process [determination of self-machine action] according to the present invention is executed under the control of the control unit (190).

  The own-machine target setting unit (141) includes a forward route number calculation unit (142) and a target determination unit (143), and performs processing described below under the control of the control unit (190).

  The forward path number calculation unit (142) acquires the position coordinates of the own device (30) from the storage unit (20), and identifies the cell in which the own device (30) exists in the grid (50) obtained by dividing the screen ( Step S1). FIG. 6 shows, as an example, a lattice (50) made up of 49 squares of 7 × 7 squares, and shows a case where the own device is specified to exist in the central cell. For convenience of explanation, the position of the cell is expressed by a number assigned to the outside of the grid (50) (see FIG. 6). That is, each cell is displayed with a matrix component when the lattice (50) is regarded as a matrix. In FIG. 6, the square where the own aircraft (30) exists is (4, 4), and the square where the enemy aircraft (40) exists is (1, 3). The reference points of the own aircraft (30) and the enemy aircraft (40) are as described above. When the position coordinate of the own machine (30) is located on a grid line or intersection, for example, it may be specified that the own machine exists in a predefined grid, for example, on the line, in principle The right side is the square. In case of crossing the intersection, in principle the lower right square. ]. Alternatively, the screen may be divided into grids so that the position coordinates of the own machine (30) are not positioned on grid lines or intersections.

  At this time, the number 0 is assigned to each cell except for the cell identified as having its own device (30), and 1 is allocated to the identified cell as having its own device (30). That is, the initial value C (s, 0) of each cell except for the cell specified that the own device (30) exists is set to 0, and the initial value C (s, 0) specified if the own device (30) exists. 0) is set to 1 (see FIG. 6).

  Next, the forward path number calculation unit (142) sequentially obtains C (s, t) of each cell at each time point t after the current time point, so that the total number of forward routes C ( s, n) is obtained (step S2). Here, the processing unit time ΔT is set to 1 in order to make the description concrete.

FIG. 7 shows C (s, t) at time t = 1. (3,3), (3,4), (3,5), (4,3), (4,4), (4,5), (5,3), (5,4), ( 1 is assigned to 5, 5).
This is because, from the cell s ₀ = (4, 4) where the own device (30) exists at the current time t ₀ (= 0), the cell (30) 's action that the cell that can move in the processing unit time 1 is stationary. (3,3), (3,4), (3,5), (4,3), (4,4), (4,5), (5,3), (5,4) , (5, 5), indicating that there is only one route from the cell s ₀ = (4, 4) where the own aircraft (30) exists at the current time t ₀ (= 0). ing.

FIG. 8 shows C (s, t) at time t = 2. 1 in the grids (2, 2), (2, 6), (6, 2), (6, 6), (2, 3), (2, 5), (3, 2), (3, 6 ), (5,2), (5,6), (6,3), (6,5), 2 is (2,4), (4,2), (4,6), (6, 4) is 3, (3,3), (3,5), (5,3), (5,5) is 4, (3,4), (4,3), (4,5) , (5, 4) is assigned 6, and (4, 4) is assigned 9.
This is because the cell s = (3,3), (3,4), (3,5), (4,3), (4,4), ( 4, 5), (5, 3), (5, 4), (5, 5), the grid that can move in the processing unit time 1 includes the action of its own device (30) that is stationary (2, 2), (2,6), (6,2), (6,6), (2,3), (2,5), (3,2), (3,6), (5,2) , (5,6), (6,3), (6,5), (2,4), (4,2), (4,6), (6,4), (3,3), ( 3,5), (5,3), (5,5), (3,4), (4,3), (4,5), (5,4), (4,4) This indicates that there are as many routes as indicated by the numbers from the cell s ₀ = (4, 4) where the own device (30) exists at t ₀ (= 0).

  As described above, the forward path number calculation unit (142) calculates C (s, t) of each cell at each time point t after the current time, and is obtained by one of artificial intelligence techniques. A search calculation method can be used. However, for example, in an ordinary decision tree search method, the number of times after the current time increases, and at the same time, the depth of search calculation increases, and the required calculation time and the storage capacity of the computer increase exponentially. In the case of this embodiment, since there are nine types of action at each time point of the own machine (30), it should be noted that the necessary computing resources increase 9 times each time the time point increases by one.

In the present invention, since the action of the own device (30) is limited as described above, a certain cell at a certain time t after the current time from the cell s ₀ where the own device exists at the current time t ₀ (= 0). The total number of forward paths C (s, t) up to s is C (s ′, t−1) of the cell s ′ that can move to the cell s in one processing unit time among the cells around the cell s. ) Is the sum of s ′. ] And C (s, t−1) of the cell s one processing unit time before. That is, C (s, t) is obtained by the equation (1).

This will be described with an example in the case of time 1 and time 2 (see FIG. 9).
C (s, 2) of the cell (3, 3) at time 2 is obtained [s = (3, 3)]. At this time, C (s, 1) at time 1 is 1. Among the cells around the cell s = (3, 3), the cell s ′ that can be moved to the cell s in one processing unit time is (2, 2), (2, 3), (2, 4). , (3,2), (3,4), (4,2), (4,3), (4,4). The cell s ′ = (2,2), (2,3), (2,4), (3,2), and C (s ′, 1) of (4,2) are each 0, and the cell s ′ = (3,4), (4,3), C (s', 1) in (4,4) is 1 [see FIG. 9 (a)]. Therefore, when these are substituted into the equation (1), C (s, 2) of the grid s = (3, 3) becomes C (s, 2) = 1 + (1 + 1 + 1 + 0 + 0 + 0 + 0 + 0) = 4 [see FIG. 9B. ].

  As described above, C (s, t) of each cell at each time point t after the present time is obtained, but it is not preferable to predict to a far future time point from the viewpoint of not impairing the real time property. . This also depends on the processing capability of the arithmetic processing unit. Accordingly, how much C (s, n) until the future time point n is determined in advance in consideration of entertainment, processing capability of the arithmetic processing unit, etc. (in the description and drawings here, (Only time 2 is shown for ease of understanding.)

  The forward path number calculation unit (142) obtains the position coordinates / velocity of the existing enemy aircraft and the position coordinates / velocity of the existing attack bullet at the current time from the storage unit (20), and the existing enemy at each time point after the current time. The value of C (s, t) of the mesh that may collide with the aircraft and / or the existing attack bullet is set to zero.

This will be described with reference to FIG. Here, the case of the existing attack bullet will be described, but the same applies to the case of the existing enemy aircraft.
In FIG. 10, the own circle (30), enemy aircraft (40), and existing attack bullets that use the smallest circle containing the outer shapes of the own aircraft (30), enemy aircraft (40), and existing attack bullets for collision determination. The collision judgment circle is defined as the center of the existing attack bullet [the center of the shape of the existing attack bullet. ], And the radius is (radius of the shape of the existing attack bullet) + (radius of the shape of the own aircraft). In FIG. 10, the radius of the collision determination circle is just equal to one side of the square cell.
It is assumed that at the time point 1, it is predicted that the position coordinate (or the position coordinate) of the existing attack bullet is in the upper right corner of the grid (50) [see FIG. 10 (a)]. At this time, the value of C (s, t) of the cell (1, 7) located in the collision determination circle is set to zero. However, in this case, since the value of C (s, t) of the cell (1, 7) is originally 0, it is not necessary to reset. Note that “a grid located in the collision determination circle” is a grid completely included in the collision determination circle and a grid in which a part of the grid is included in the collision determination circle.
At the time point 2, it is assumed that the position coordinates (or viewing position coordinates) of the existing attack bullets are predicted in the upper right corner of the grid (3, 5) [see FIG. 10 (b)]. As described above, each of the attack bullets maintains the velocity determined at the time of launching from the enemy aircraft after the launch, so that the position coordinates at each time point can be predicted. For example, the position of an existing attack bullet at time t ₀ (= 0) is (Xb (0), Yb (0)), the velocity is (Vx (0), Vy (0)), and the time at time t If the position of the existing attack bullet is (Xb (t), Yb (t)), (Xb (t), Yb (t)) = (Xb (0) + Vx (0) × t × ΔT, Yb ( 0) + Vy (0) × t × ΔT). In the example of FIG. 10B, the values of C (s, t) of the cells (2, 5), (2, 6), (3, 5), and (3, 6) located in the collision determination circle are set. Set to zero.

  As described above, the forward path number calculation unit (142) sequentially obtains C (s, t) of each cell at each time t after the current time, and finally C (s) of each cell at time n. , N). C (s, n) of each cell at time n is stored in the storage unit (20). After the process of step S2, the process of step S3 is performed.

Target determining unit (143) is, C (s, n) of each square at the time n from the storage unit (20) acquires, C (s, n) identifies the largest squared _{s g} (step S3). The specified cell s _g is the target cell toward which the aircraft is directed.
If C (s, n) is present squares of the same value may specify one square of them as squares s _g. Alternatively, the cell closest to the center of the screen may be specified as the cell s _g .
Target squares identification information for identifying the identified squares s _g is stored in the storage unit (20). Such target squares identification information, for example, may be a position coordinate at the center of the square s _g. Alternatively, in the present specification, if the grid is identified by a matrix component display in the same manner as expressing the grid position with a combination of numbers assigned to the outside of the grid (50), You may use a component for target cell identification information.

  The own-machine action determining unit (144) includes a reverse path number calculating unit (145) and an action determining unit (146), and performs the process described below following the process of step S3.

Reverse-path number calculation unit (145) obtains the identification information from the storage unit (20), starting from the square s _g of the target, sequentially while reducing the time of each square at each time point Cb (s, t ) Is obtained (step S4). This calculation method is almost the same as the processing in step S1 and step S2.
At this stage, since the square as a starting point is specified in square s _g, as an initial value, the numbers 0 is assigned to each square, except the square s _g, 1 is assigned to squares s _g.
Then, Cb (s, t) of each cell at each time point t prior to the current time is obtained. This method differs from the process of step S2 in that it is obtained by equation (2) instead of equation (1). is there.

  Further, the reverse path number calculation unit (142) acquires the position coordinates / velocity of the existing enemy aircraft and the position coordinates / velocity of the existing attack bullet at the current time from the storage unit (20), Setting the value of Cb (s, t) of the mesh that may collide with the enemy aircraft and / or the existing attack bullet to 0 is the same as the process of step S2.

  Further, in order to reflect the consideration that the aircraft destroys enemy aircraft as much as possible and the consideration that the location of the aircraft is as close to the center of the screen as possible, Cb (s, t) of each cell is changed to Cb (s, t ) X As x Az.

For As, when the aircraft is in the grid s at time t, the constant value As is multiplied by 1 when the enemy aircraft is not on the attack line of the aircraft, and at time t. A constant value As that multiplies the value of Cb (s, t) when the enemy aircraft is on its own attack line when the aircraft is in the cell s is set to a value larger than 1. For example, if it is a general computer in circulation at the time of filing, it depends on the processing capability of the arithmetic processing device, the storage capacity of the storage device, the language used in the program, the way of describing the actual program, etc. Needless to say, if n is about 15, As may be set to 2, for example.
An example of this is shown in FIG. Here, the case where one attack bullet is fired at a time and the flight path of the attack bullet fired by the own aircraft is parallel to the vertical direction of the screen is taken as an example. In FIG. 11A, it is assumed that the predicted position of the enemy aircraft at time t is in the grid of (2, 4). Further, Cb (s, t) of each cell at time t is a numerical value entered in each cell of FIG. At this time, when the aircraft is in the grid s at the time t, the grid s when the enemy aircraft is on the attack line of the aircraft is the grid (3, 4), (4, 4) shown in the shaded portion. ), (5, 4), (6, 4), (7, 4). Here, in addition to whether or not the X-coordinate value Xi of the predicted position of the enemy aircraft is included in the range of the X-coordinate value of the horizontal width of the cell s that the own aircraft is supposed to be at time t, from the upper end of the screen Assuming that the value of the vertical axis (Y-axis) increases toward the lower end of the screen, the coordinate value Yi of the predicted position of the enemy aircraft is the range of the Y coordinate value of the vertical width of the cell s that the own aircraft is at time t It was determined whether or not it was smaller than the minimum value. The grid in which this determination is established is the grid shown in the shaded portion. Therefore, Cb (s, t) of the cells s = (3,4), (4, 4), (5, 4), (6, 4), (7, 4) is multiplied by As. Here, assuming that As = 2, Cb (s, t) of each cell at time t after multiplication by As is shown in FIG.

As for Az, as described above, the distance r from the center of the screen of the cell s is calculated, and for example, F (r) = 0.5 × {1 + exp (−r ² )} is rounded down. It is good. Of course, Az may be a value obtained by rounding off the decimal point of a value obtained by multiplying F (r) = 0.5 × {1 + exp (−r ² )} by an appropriate constant coefficient k. In any case, F (r) is obtained for each cell, and correction is performed by multiplying this value by Cb (s, t) of each cell. An example of this is shown in FIG. Cb (s, t) of each cell at time t is a numerical value entered in each cell in FIG. In FIG. 12A, F (r) is 1 for the mesh (7, 1), 2 for the mesh (5, 1), (6, 1), (7, 2), (7, 3). , It is assumed that the grid (6,2) is 3, the grid (5,2), (6,3) is 4, and the grid (5,3) is 5. Therefore, Cb (s, t) of each cell at time t corrected based on consideration for being as close to the center of the screen as possible is represented by Cb (s, t) of each cell in FIG. It is obtained by multiplying the square F (r), and this result is the numerical value entered in each square in FIG.
Alternatively, masking data in which a value Az that is larger for a cell closer to the center of the screen and larger for a cell farther from the center of the screen is assigned to each cell of the lattice is stored in the storage unit (20), and Cb of each cell of the lattice is stored. It may be applied to (s, t). An example of this is shown in FIG. FIG. 13A shows an example of masking data in which Az is fixed and assigned in advance in a 7 × 7 grid, with Az written in each square of the grid. The symbol x in FIG. 13 indicates that this masking data is applied to Cb (s, t) of each cell at time t shown in FIG. 13B. That is, Cb (s, t) after correction of a certain cell is obtained by the product of Cb (s, t) of the cell before correction and Az of the cell of the masking data. The corrected Cb (s, t) of s = (5, 4) is Cb (s, t) = 4 of the uncorrected cell s = (5, 4) and the masking data cell s = (5, 4). ) Of 20) because it is obtained by the product of Az = 5.

  As described above, the reverse path number calculation unit (145) sequentially obtains C (s, t) of each cell at each time t before time n, and finally C (( s, 1) is obtained. C (s, 1) of each cell at time 1 is stored in the storage unit (20). After step S4, step S5 is performed.

The action determination unit (146) acquires the position coordinate of the own device (30) from the storage unit (20), and the cell s where the own device exists at the current time t ₀ (= 0) based on the position coordinate of the own device (30). identify _0, further from the storage unit (20), the present time _t 0 (= 0) in Cb _(s 0, 1) of the square _{s 0} the apparatus itself is present and one processing unit of the squares surrounding squares _{s 0} time 'each Cb of _(s 0' own apparatus squares _{s 0} squares _{s 0} movable in, 1) acquires, identifies a square _{s a} with these worth maximum value (step S5). If squares of the same value exists, it may specify one square of them as squares s _a. Ship would act against the square s _a. An example of this is shown in FIG. Cb _(s 0, 1) of the square _s 0 = (4, 4) at time 1 in FIG. 14 and 'Cb _(s 0' and 1) the square _{s 0} surrounding indicates reverse path total number of other squares Is abbreviated. Here, since the total number of reverse paths of the cell (5, 4) is 11 and is the maximum, the behavior control of the own device is performed so that the own device is in the cell (5, 4) at the time point 1.
Action squares identification information for identifying the identified squares s _a is stored in the storage unit (20). As such action cell identification information, for example, _a position coordinate may be set at the center of the cell sa. Alternatively, in the present specification, if the grid is identified by a matrix component display in the same manner as expressing the grid position with a combination of numbers assigned to the outside of the grid (50), You may use a component for action cell identification information.

The action cell identification information of the cell s _a determined as described above is temporarily stored in the storage unit (20), and under the control of the control unit (190), the own device displays the cell s _a on the screen. Drawn to act. Since the main body and processing method of this process are the same as those in the prior art, description thereof is omitted.

An optimal action toward the target is selected at the current time t ₀ , but this action may be selected every processing unit time ΔT.

  In addition to the above-described embodiments, the self-action control device / method for demonstrating a shooting game according to the present invention is not limited to the above-described embodiments, and can be appropriately changed without departing from the spirit of the present invention. It is. In addition, the processing described in the above-mentioned self-behavior control device / method for demonstrating a shooting game is not only executed in time series according to the order described, but also in parallel with the processing capability of the device that executes the processing or as necessary. It may be executed separately or individually.

  In addition, when the processing function in the self-action control device for demonstration of the shooting game is realized by a computer, the processing contents of the function that the self-action control device for demonstration of the shooting game should have are described by a program. Then, by executing this program on a computer, the processing functions in the above-described self-action control device for demonstration of a shooting game are realized on the computer.

  The program describing the processing contents can be recorded on a computer-readable recording medium. As the computer-readable recording medium, for example, any recording medium such as a magnetic recording device, an optical disk, a magneto-optical recording medium, and a semiconductor memory may be used. Specifically, for example, as a magnetic recording device, a hard disk device, a flexible disk, a magnetic tape or the like, and as an optical disk, a DVD (Digital Versatile Disc), a DVD-RAM (Random Access Memory), a CD-ROM (Compact Disc Read Only). Memory), CD-R (Recordable) / RW (ReWritable), etc., magneto-optical recording medium, MO (Magneto-Optical disc), etc., semiconductor memory, EEP-ROM (Electronically Erasable and Programmable-Read Only Memory), etc. Can be used.

  The program is distributed by selling, transferring, or lending a portable recording medium such as a DVD or CD-ROM in which the program is recorded. Furthermore, the program may be distributed by storing the program in a storage device of the server computer and transferring the program from the server computer to another computer via a network.

  A computer that executes such a program first stores, for example, a program recorded on a portable recording medium or a program transferred from a server computer in its own storage device. When executing the process, the computer reads a program stored in its own recording medium and executes a process according to the read program. As another execution form of the program, the computer may directly read the program from a portable recording medium and execute processing according to the program, and the program is transferred from the server computer to the computer. Each time, the processing according to the received program may be executed sequentially. Also, the program is not transferred from the server computer to the computer, and the above-described processing is executed by a so-called ASP (Application Service Provider) type service that realizes the processing function only by the execution instruction and result acquisition. It is good. Note that the program in this embodiment includes information that is used for processing by an electronic computer and that conforms to the program (data that is not a direct command to the computer but has a property that defines the processing of the computer).

  In this embodiment, the self-behavior control device for demonstrating the shooting game is configured by executing a predetermined program on the computer. However, at least a part of these processing contents is realized by hardware. It is good to do.

INDUSTRIAL APPLICABILITY The present invention is useful for demonstrating a shooting game by a computer that displays an own aircraft and one or a plurality of enemy aircraft on a screen, and fires an attack bullet while the aircraft and the enemy aircraft act.
In addition, since it will be a demonstration that controls the behavior of the aircraft that makes sense from the human eye, the demonstration effect will last longer, and if the demonstration is displayed at the store, for example, it will demonstrate the effect of attracting customers and demonstrate Will increase the willingness to purchase.

The figure explaining the kind of action of an own machine. (A) When the movement is the same as the movement of a Japanese shogi “tama general” or “king general”. (B) In the case of a crossed character movement. The figure explaining that the grid contained in the collision determination shape centering on either the corner | angular corner of the grid, or its center becomes unique. (A) The case where the square is a square and the position coordinates of the attack bullet are regarded as one of the four corners of the square where the position coordinates exist. (B) The case where the square is a vertically long rectangle, and the position coordinates of the attack bullet are regarded as one of the four corners of the square where the position coordinates exist. (C) The case where the square is a square and the position coordinates of the attack bullet are considered at the center of the square where the position coordinates exist. (D) The case where the cell is a vertically long rectangle and the position coordinates of the attack bullet are viewed at the center of the cell where the position coordinates exist. The figure which shows the hardware structural example of the own-machine action control apparatus (1) for demonstration of a shooting game. The figure which shows the function structural example of the own-machine action control apparatus (1) for demonstration of a shooting game. The processing flow of the self-machine action determination in the self-machine action control apparatus (1) for demonstration of a shooting game. The figure which shows the total number of forward paths C (s, t) of each cell at the time 0. The figure which shows the total number of forward paths C (s, t) of each cell at the time point 1. The figure which shows the forward route total number C (s, t) of each cell in the time 2. The figure explaining the method of calculating | requiring the total number of forward paths C (s, t) of the mesh of the shaded part shown to (b) from each grid of the shaded part shown to (a). (A) The figure explaining resetting the total number of forward paths C (s, t) of the cells located in the attack determination circle at time 1 to zero. (B) The figure explaining resetting the total number of forward paths C (s, t) of the cells located in the attack determination circle at time 2 to zero. The figure explaining correction | amendment of Cb (s, t) of each cell in consideration of destroying enemy aircraft as much as possible. Among the Cb (s, t) of each cell shown in (a), when the own aircraft is in the cell s at the time t, the cell s [shaded portion] when the enemy aircraft is on the attack line of the own aircraft Cb (s, t) is multiplied by As (= 2) and corrected to Cb (s, t) in the shaded portion shown in (b). The figure explaining correct | amending Cb (s, t) of each square according to the distance r from the screen center of each square, considering that the position of an own machine is as close to the center of the screen as possible. Multiply Cb (s, t) of each cell shown in (a) by Az obtained by the function F (r) to correct Cb (s, t) of each cell shown in (b). The figure explaining correct | amending Cb (s, t) of each square according to the distance r from the screen center of each square, considering that the position of an own machine is as close to the center of the screen as possible. The product of the value Az of each cell of the masking data shown in (a) and Cb (s, t) of each cell shown in (b) is performed between the corresponding cells, and Cb of each cell shown in (c). Correction to (s, t). Currently _t 0 (= 0) in the square _{s 0} the apparatus itself is present Cb _(s 0, 1) and square _{s 0} around the ship in one processing unit time of the square is movable in square _{s 0} squares 'Cb of _{(s 0' s 0, 1} ) diagram illustrating a.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Self-machine action control apparatus 141 for shooting game demonstration Self-machine target setting part 142 Forward route number calculation part 143 Target determination part 144 Self-machine action determination part 145 Reverse route number calculation part 146 Action determination part 190 Control part 20 Storage part

Claims (13)

A computer equipped with its own target setting means and its own action determining means displays its own aircraft and one or more enemy aircraft on the screen, and fires an attack bullet while the own aircraft and enemy aircraft act A self-behavior control method for demonstrating a shooting game that controls the action of the player in a game demonstration,
At the present time t _{0 when the} own aircraft target setting means should determine the behavior of the own aircraft, the position and speed of the attacking bullet fired by the enemy aircraft at a time earlier than the current time t ₀ , the position and speed of the enemy aircraft, and based on the location of the terminal of the current, the screen starting from the square s ₀ to own apparatus currently exists t ₀ a square grid that is divided in a grid pattern, at n after the present time t _0, the enemy The total number of routes (hereinafter referred to as “the total number of forward routes”) that can be reached by the aircraft without approaching a distance within a certain distance from each position where at least one of the aircraft and the attack bullet is predicted to exist. obtained for each square, a ship target setting step of forward path total number is set as the target maximum squares s _g,
The ship motion deciding means, the position and speed of the attack bomb enemy machine was fired at an earlier point in time from the present time t _0, based on the position and velocity of the enemy machine, it was targeted in the own apparatus target setting step starting from the square s _g, at time t _{0 +} [Delta] t before the time point n, in each square of the grid, its own device for each position where either an enemy aircraft attack bullet least is predicted that there is a constant path total number may reach the squares without approached within a distance of (hereinafter referred to as "reverse path total".) is obtained for each square, around the reverse path total number and the square s ₀ of the square s ₀ squares Among the total number of reverse paths of the cell s ₀ ′ that can move to the cell s ₀ in one processing unit time ΔT, the own device action determination is determined to act on the cell having the maximum total number of reverse paths. And having a step Self-action control method for demonstration of shooting games. It is assumed that the cells that can move from the cell S in which the machine is present in one processing unit time ΔT are all or part of the cell that touches the cell S and surrounds the cell S,
The target setting step above is
At the time point n after the current time t _{0, the} total number of forward routes in which the aircraft can reach the cell s without approaching a distance within a certain distance for each position where at least one of the enemy aircraft and attacking bullets is expected to exist. C (s, n)
The initial value of the total number of forward routes of the cell s ₀ is set as 1, the initial value of the total number of forward routes of the other cells is set as _0, and a certain time after the current time from the cell s ₀ where the own device exists at the current time t ₀ The total number of forward paths C (s, t) to a certain cell s at t is the time t-ΔT of the cell s ′ in which the own machine can move to the cell s in one processing unit time ΔT among the cells surrounding the cell s. Sum of forward path total number C (s ′, t−ΔT) [however, this is the sum of s ′. ] And the total number of forward paths C (s, t-ΔT) at the time t-ΔT of the grid s, and at the time t, the grid s is predicted to be at least one of an enemy aircraft and an attacking bullet. In this case, the total number of forward paths C (s, t) is set to 0, and each of the cells at each time t The shooting according to claim 1, wherein the total number of forward paths C (s, n) at each time point n is obtained by sequentially obtaining the total number of forward paths C (s, t) of the squares. Self-action control method for game demonstration. The total number of forward routes C (s, t) is set to 0 in the own aircraft target setting step, and includes a grid including each position where at least one of the enemy aircraft and the attacking bomb is expected to exist, and a predetermined distance from each position. A grid located within a distance
A grid located within a predetermined distance from any one of the four corners of the square including the positions where at least one of the enemy aircraft and the attacking bomb is predicted to exist, or the center of the square. Item 3. A self-machine action control method for demonstration of a shooting game according to Item 2. It is assumed that the cells that can move from the cell S in which the machine is present in one processing unit time ΔT are all or part of the cell that touches the cell S and surrounds the cell S,
The self-behavior determination step includes
At time t ₀ + ΔT prior to time n, at each square of the grid, the own aircraft does not approach a distance within a certain distance with respect to each position where at least one of the enemy aircraft and the attacking bullet is expected to exist. The total number of reverse paths Cb (s, t ₀ + ΔT) that can reach the cell s is
Said reset the initial value of the reverse path the total number of squares s _g which is targeted in the same apparatus target setting step 1, the initial value of the reverse path the total number of other squares as 0, and the target in the own apparatus target setting step It has been squares s reverse path total from _g to a certain square s before a certain time t from the time point n Cb (s, t) and the ship in one processing unit time ΔT of the square surrounding the square s squares Sum of reverse path total number Cb (s ′, t + ΔT) at time point t + ΔT of cell s ′ movable to s [however, it is a sum concerning s ′. ) And the total number of reverse paths Cb (s, t + ΔT) at the time t + ΔT of the grid s, and further, at the time t, the grid s represents each position where at least one of the enemy aircraft and the attack bullet is expected to exist. The reverse path total number Cb (s, t) is set to 0 in the case where it corresponds to any of the included squares and the squares located within a predetermined distance from each position, and the reverse path of each square at each time point t is set to 0. 4. The reverse path total number Cb (s, t + ΔT) of each cell at the time point t + ΔT is obtained by sequentially obtaining the total number Cb (s, t). Self-action control method for demonstration of the described shooting game. At each time t, when the own aircraft is in the mesh s, the total number of reverse paths Cb (s, t) of the mesh s when the enemy aircraft is on the attack line of the own aircraft is set as the total number of reverse paths of the other cells. 5. The self-action control method for demonstrating a shooting game according to claim 4, wherein the control is relatively increased. The result obtained by inputting the distance r from the screen center of the cell s to the monotonically decreasing function at each time point t, or the result obtained by inputting the distance r from the screen center of the cell s to the monotonically decreasing function. 5. The self-behavior control method for demonstrating a shooting game according to claim 4, wherein the value obtained by converting the value into an integer value is multiplied by the total number of reverse paths Cb (s, t) of the cell s. At each time t, when the own aircraft is in the mesh s, the total number of reverse paths Cb (s, t) of the mesh s when the enemy aircraft is on the attack line of the own aircraft is set as the total number of reverse paths of the other cells. As a result, the distance r from the center of the screen s to the monotonously decreasing function is input to the relatively increased total number of reverse paths Cb (s, t). Or an integer value obtained by inputting the distance r from the center of the screen of the grid s to the monotonically decreasing function. Mobile behavior control method. The total number of reverse paths Cb (s, t) is set to 0 in the self-behavior action determining step, and a grid including each position where at least one of the enemy aircraft and the attacking bomb is expected to exist and a predetermined distance from each position A grid located within a distance
A grid located within a predetermined distance from any one of the four corners of the square including the positions where at least one of the enemy aircraft and the attacking bomb is predicted to exist, or the center of the square. The self-action control method for demonstration of a shooting game according to any one of claims 4 to 7. The closest angle from the reference point that represents the position of the enemy aircraft or attack bullet when the position is one of the four corners of the square including the position where at least one of the enemy aircraft and the attack bullet is expected to exist The self-action control method for demonstrating a shooting game according to claim 3 or claim 8, wherein: The short side of the square is equal to or less than an integer of a reference length, which is the sum of the length serving as an index of the shape of an attack bullet or enemy aircraft and the length serving as an index of the shape of the own aircraft. The self-action control method for demonstration of a shooting game according to any one of claims 1 to 9. The self-machine and one or more enemy aircraft are displayed on the screen, and the self-control of the shooting game that controls the action of the self-machine in the shooting game demonstration that fires attack bullets while the self-machine and enemy aircraft act A behavior control device,
At the current time t _{0 when} the action of the own aircraft should be determined, the position and speed of the attacking bullet fired by the enemy aircraft at a time earlier than the current time t ₀ , the position and speed of the enemy aircraft, and the current position of the own aircraft based, the screen starting from the square s ₀ is present own apparatus at the moment t ₀ a square grid that is divided in a grid pattern, at n after the present time t _0, at least one of the enemy attack bomb there obtains a forward path total number may reach the squares without approached within a distance of its own device is constant for each position predicted to exist in each square, set forward path total number as the target maximum squares s _g Own machine target setting means,
Position and speed of attack bomb enemy machine was fired at an earlier point in time from the present time t _0, based on the position and velocity of the enemy machine, starting from the square s _g which is targeted by the ship target setting means, when At time t ₀ + ΔT prior to n, at each square of the lattice, the square does not approach the distance within a certain distance from each position where at least one of the enemy aircraft and the attacking bullet is expected to exist. calculated for each square of the inverse path total number may reach the above squares s ₀ of the inverse path the total number and the square s ₀ squares movable ship in one processing unit time ΔT of the squares of surrounding the square s ₀ Self-action behavior for demonstrating a shooting game, comprising self-action determination means for deciding to act on a cell having the maximum total number of reverse paths among the total number of reverse paths of s ₀ ′ control apparatus. A shooter game where a player and one or more enemy aircraft are displayed on the screen, and the computer controls the behavior of the aircraft in a shooting game demonstration where the enemy aircraft and enemy aircraft act while firing. A self-action control program for demonstration,
At the current time t _{0 when} the action of the own aircraft should be determined, the position and speed of the attacking bullet fired by the enemy aircraft at a time earlier than the current time t ₀ , the position and speed of the enemy aircraft, and the current position of the own aircraft based, the screen starting from the square s ₀ is present own apparatus at the moment t ₀ a square grid that is divided in a grid pattern, at n after the present time t _0, at least one of the enemy attack bomb The total number of routes (hereinafter referred to as “the total number of forward routes”) that can be reached by the aircraft without approaching a distance within a certain distance from each position where the vehicle is predicted to exist is obtained for each square, and the total number of forward routes Own machine target setting process for setting the maximum cell s _g as a target,
Enemy machine moment t ₀ from the position and velocity of the firing Attack bullets past time, based on the position and velocity of the enemy machine, starting from the square s _g which is targeted in the own apparatus target setting process, the time At time t ₀ + ΔT prior to n, at each square of the lattice, the square does not approach the distance within a certain distance from each position where at least one of the enemy aircraft and the attacking bullet is expected to exist. path total number may reach (hereinafter, "reverse path total number" hereinafter.) is obtained for each square, the own one processing unit time ΔT of the square around the reverse path total number and the square s ₀ of the square s ₀ machine is among the reverse path total squares s ₀ squares s ₀ movable to _'be made to determine that the action against the square having a reverse path total number of up to and ship behavior determining process in a computer Chutey featuring Self-machine action control program for demonstration of the game.       A computer-readable recording medium on which the program according to claim 12 is recorded.

Images