JP4804240B2 - Enemy aircraft attack control method of shooting game, apparatus thereof, program thereof, and recording medium thereof - 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 attack control processing of enemy aircraft.

In a general shooting game, one player and one or more enemy aircraft are displayed on the screen.
When the player operates an appropriate input means (for example, a key on a keyboard, a switch that can be pressed in multiple directions, a control stick, etc.), the operation is converted into a W-type action of the player's own device on the screen. Act according to the operation. In addition, when the user operates an appropriate input means (for example, a keyboard key, a switch that can be pressed in multiple directions, a button provided on the control stick, etc.), the operation is converted into an attack action of the aircraft on the screen. Then, it can fire its attack bullets and damage 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 operating the own device, such as a network battle type shooting game, or a computer operation type operated by a computer. . Here, the “computer” is not limited to a general-purpose machine such as a so-called personal computer, but widely refers to a game-dedicated machine or the like (hereinafter the same). In addition, “computer operation” means that computer hardware resources and software installed on the computer cooperate to realize information processing, and the action of enemy aircraft and the launch of attack bullets against the own aircraft Displayed on the screen.
In the case of the computer operation type, the action control of the enemy aircraft and the firing control of the enemy bullets against the enemy 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.

  Since the above facts in shooting games are well known, it is not necessary to show prior art documents.

  In the conventional shooting game, in the case of a computer-operated type, the attack bullet firing control for the enemy aircraft's own aircraft, that is, the attack bullet movement speed determination algorithm at the time of the enemy's attack bullet firing, They were limited to simple things such as aiming to determine the speed of attack bullets or firing attack bullets in random directions. Here, “velocity” is a vector amount having both “speed” and “direction” of an object displayed on the screen.

  Because of this simple algorithm, even with different shooting brands in conventional shooting games, the enemy aircraft attack is monotonous, and the player's own machine necessary for avoiding enemy aircraft attacks, etc. The operation techniques tend to be common, and the shooting game itself is easily bored.

In order to solve such problems, it is considered effective to introduce artificial intelligence technology into shooting games. Currently, research on games in artificial intelligence is based on non-action systems such as chess, othello, and shogi. It has been conducted mainly in so-called thinking games (see, for example, references), and there has been no attempt to apply artificial intelligence to action games such as shooting games.
(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 at all meaningful to simply introduce such an artificial intelligence technology into a shooting game. This is because the real thrill of shooting games is to visually recognize the rapid development of virtual battles in a moderate tension in virtual battles between the enemy aircraft and enemy aircraft, and immediately take appropriate actions and attacks on the aircraft. Judgment is immediately reflected in the accurate operation of the input means, and it is connected with the feeling of achievement by destroying enemy aircraft etc., but artificial intelligence technology used in thinking games is simply This is because, if introduced into a shooting game, no matter how efficient the search calculation is, the virtual battle will be remarkably slow and the joy of the shooting game (hereinafter referred to as “playing”) will be lost.

  In view of the above problems, an object of the present invention is to provide an enemy aircraft attack control method, an apparatus thereof, a program thereof, and a recording medium thereof for a shooting game in which an enemy aircraft does not attack monotonously.

In order to solve the above-mentioned problem, in the present invention, an enemy of a shooting game in which the enemy aircraft and one or more enemy aircraft are displayed on the screen and the enemy aircraft fires an attacking bullet against the own aircraft operated by the player. Aircraft attack control is configured as follows. That is, first, at the time when the enemy aircraft fires an attack bullet (current time), the existing attack bullets that the enemy aircraft fired at a time earlier than the current time, or the existing attack bullets that other enemy aircraft fired at a time earlier than the current time Based on the position and speed of the aircraft, and the current position of the aircraft, at each time after the current time, in each grid where the screen is divided into a grid, The probability that the machine can exist in a cell without approaching a distance within a certain distance (own device existence probability) is obtained for each cell at each time point. Next, for two or more candidates for the speed at which the enemy aircraft fires attack bullets, the sum of the probability of own aircraft in each square where the attack bullets fired at the respective candidate speeds pass at each time point A probability sum) is obtained for each speed candidate, and the speed of a candidate whose own-machine existence probability condition satisfies a predetermined condition is determined as the attack bullet firing speed.
In this way, the position and speed of the existing attack bullets fired by enemy aircraft at a past time from the current time or the speed of existing attack bullets fired by other enemy aircraft at a past time from the current time and their speeds are considered. The future position of the aircraft (a grid) is predicted, and the speed of the attack bullets that are highly likely to collide with the aircraft at the predicted position is determined from the speed candidates, and the attack bullets are fired. In other words, when the attack bullets of the enemy aircraft are fired, the speed at which the attack bullets are likely to collide with the own aircraft in the future is determined, and the attack bullets are fired at this speed.

  According to the present invention, when the attack bullet of the enemy aircraft is fired, the speed at which the attack bullet is likely to collide with the own aircraft is determined in the future, and the attack bullet is fired at this speed. It will not be monotonous.

  In addition, since the attack of the enemy aircraft does not become monotonous, from the player's standpoint, it becomes difficult to obtain the own aircraft operation technique necessary for avoiding the attack of the enemy aircraft. For this reason, it contributes to the realization of a shooting game that is hard to be bored by players.

《Technical overview》
The gist of the feature of the present invention is that the screen is divided into a grid, and first, the probability of the presence of the own aircraft in each grid at each time after the current time is obtained, and then the speed of the attack bullets of the enemy aircraft is determined. In addition, the total probability of each square is obtained on the flight path at each time point, and the enemy aircraft fires an attack bullet by selecting a speed with a high total probability. The enemy ammunition is fired at a speed determined for each individual enemy aircraft. The speed of the attack bullet is a vector quantity of “speed” and “direction”, and one or both of them can be determined.

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 after the current time point is t ₀ + ΔT. _{, t 0 + 2ΔT, t 0} + 3ΔT, the .... "Current time" refers to the point in time when the enemy aircraft should fire an attacking bullet. 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, there is only one action of the own device that can be performed in one processing unit time ΔT, including the action of stillness.

  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 Further, it is assumed that the following conditions are imposed on the action of each attack bullet. That is, each attack bullet maintains the speed determined when fired from the enemy aircraft after launch.

  The own aircraft / enemy aircraft / attack bullets are generally displayed on the screen as an image of a certain object (for example, a fighter or a bullet). In the shooting game, the collision determination process of the own aircraft or enemy aircraft and the attack bullet is performed. For this determination, the collision of the own aircraft / enemy aircraft / attack bullet is separated from the outline of the simulated object. Generally, each shape for determination is 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 is used. It is preferable to uniquely define the shape instead of making it 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 own aircraft / enemy aircraft / attack bullet used to identify the position of the own aircraft / enemy aircraft / attack bullet (in particular, in the present invention, it is necessary to identify which cell the own aircraft is in). Set a reference point. 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 limited to the squares surrounding contact with the squares s ₀ The

  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 action, that is, 8 cm around and 9 types of stationary, and in FIG.

The probability that the aircraft is present in each square of the lattice at each time point after the current time is obtained as follows. The total number C (s, t) of paths from a cell s ₀ where the own aircraft exists at the current time t ₀ (= 0) to a certain cell s at a certain time t after the current time is obtained. C (s, t) can be obtained by, for example, a decision tree search. If there is a restriction on the behavior of the own device as described above, one processing unit time among the cells around the cell s. And the sum of C (s ′, t−1) of the cell s ′ that can be moved by itself (the sum of s ′) and C (s, t−1) of the cell s one processing unit time before It is obtained by the sum of
The probability that the aircraft exists in a certain cell s at a certain time t is expressed as C (s, t) divided by Σ _s C (s, t), which is the sum of all cells. .
Incidentally, ship moving speed at the present time t ₀ is set to continue until τ some time later than the present time, the own its own apparatus square and when the moved ship has passed by the time τ at the moving speed τ It is also possible to set the own aircraft existence probability in the cell where the aircraft is predicted to be 1 and set the own aircraft existence probability in other cells to 0.

The following points are taken into consideration for obtaining the probability of existence of the aircraft in each square of the lattice at each time point after the current time point.
In determining the speed of an attack bullet in a certain enemy aircraft, there may be an attack bullet (existing attack bullet) fired from the enemy aircraft or another enemy aircraft already on the screen at that time. Therefore, at each time point after the current time, the existence probability of the own aircraft in the cell including the position where the existing attack bullet is predicted to exist and the cell located within a predetermined distance from the position is reset to 0 at that time. It is. This is equivalent to C (s, t) = 0. This is based on a general tendency that the player of the player operates the input device so that the player takes action to avoid the attack bullets from the enemy aircraft.
Here, the “predetermined distance from the position where an existing attack bullet is predicted to exist” is a distance used for collision determination between the attack bullet and the own aircraft. Within such a distance, that is, in an area closer to the center of the attacking bullet, it is determined that the aircraft has collided with the attacking bullet. In other words, an area extending “a predetermined distance from a position where an existing attack bullet is predicted to exist”, that is, a collision determination shape is defined, and the collision determination between the own aircraft and the attack bullet can be performed using this collision determination shape.

The collision determination shape can be defined as appropriate.
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 a and a length b, and the own shape is a rectangle with a width c and a height d. 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, C (s, t) including a cell including a position where an existing attack bullet is predicted to exist and a cell located within a predetermined distance from the position is set to 0. Although it is set, such a cell (hereinafter also referred to as “desired cell”) is an all or part of the cell included in the collision determination shape. For example, in the case of a collision judgment circle, a grid in which all or part of the collision judgment circle is included from the position coordinates of the attack bullet can be specified by a finite step algorithm by a computer. Consider real-time, that is, simple identification so as not to lose sex.
The present invention solves this problem as follows.
That is, the position coordinates of the attack bullet are regarded as either the corners or the center of the four corners where the position coordinates exist, and the viewed position coordinates (hereinafter referred to as “viewing position”). C (s, t) of a mesh whose part or all is included in the collision determination shape centered on “coordinates”) is set to zero. In other words, C (s, t) of the mesh located within a predetermined distance from any one of the corners of the four corners including the position where the existing attack bullet is predicted to exist or its center is set to 0. To do. 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, 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 viewing 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. 14, the ■ marks indicate the viewing position coordinates, and the broken lines indicate a grid. FIG. 14 shows a case where the collision determination shape is a collision determination circle or a collision determination rectangle. FIG. 14A 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. 14C 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. 14B 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. 14D shows a case where the grid is a vertically long rectangle, and the position coordinates of the attack bullets are considered at the center of the grid 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 relating to the uniquely defined cell group is stored in the storage means as a template (shaded portion in FIG. 14), for example, 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.

<Embodiment>
Embodiments of the present invention will be described with reference to the drawings.
<Enemy aircraft attack control device for shooting games>
The enemy aircraft attack control device (1) of the shooting game according to the embodiment of the present invention generally exists as an entity constituting a computer rather than as a single entity (of course, as a single independent entity). It is not intended to exclude the existence as an entity.) Furthermore, the enemy attack control device (1) of the shooting game is not an entity that constitutes the computer so that it can be easily separated from the computer, but is one-sided evaluation that focuses on a certain function of the computer itself. It is common. In short, the enemy aircraft attack control device (1) of the shooting game is generally a computer itself 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 enemy aircraft attack control device (1) of the shooting game is simply referred to as an enemy aircraft attack control device (1).

  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 aircraft as an example of a computer, an example of the hardware configuration of the enemy aircraft attack control device (1) is as follows (see FIG. 2).
The enemy aircraft attack 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, and a CPU (Central Processing Unit; 14) [cache memory and the like. Also good. 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 enemy attack control device (1) may be provided with a device (drive) that can read and write a storage medium such as a video card or a CD-ROM.

The external storage device (17) of the enemy aircraft attack control device (1) stores and stores a program for controlling the enemy aircraft attack and data necessary for processing the program. 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 enemy attack 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, the description is omitted because it is not related to the gist of the present invention. 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, in the external storage device (17), the position and speed of the existing attack bullets fired at the past time by the enemy aircraft or other enemy aircraft at the time of the launch of the attack bullet by the enemy aircraft (current time). In addition, based on the positional relationship of the aircraft, the probability that the aircraft can exist in the grid without approaching a certain distance from the position where the existing attack bullets are expected to exist at each time after the current time. A program for obtaining each square at each time point (own aircraft existence probability calculation program), and two or more candidates of the speed at which the enemy aircraft fires an attack bullet, each attack bullet fired at the speed of each candidate A program for calculating the sum of the probability of existence of the aircraft in each square passing through each time point for each speed candidate and determining the candidate speed satisfying a predetermined condition as the attack bullet firing speed (attack bullet firing speed Constant program) is stored stored.
In this embodiment, the own machine existence probability calculation program calculates the total number C of paths from a cell s ₀ where the own machine exists at the current time t ₀ (= 0) to a certain cell s at a certain time t after the current time. Total number of paths in each grid obtained by processing of (s, t) in consideration of the presence of existing attack bullets (number calculation program for the presence of own aircraft) and the number calculation program for own aircraft presence A program (probability calculation program) for determining the existence probability of the own device using C (s, t) is included.

  In the enemy aircraft attack control device (1), each program stored in the external storage device (17) and data necessary for processing each program are read into the storage unit (20) as necessary, and the CPU (14 ) Is interpreted and executed. As a result, the CPU (14) realizes a predetermined function (own device existence probability calculation unit [number of own device existence number calculation unit, probability calculation unit], attack bullet firing speed determination unit) to determine the attack bullet firing speed. 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 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.

<Enemy aircraft attack control processing for shooting games>
Next, with reference to FIG. 3 and FIG. 4, the flow of the enemy aircraft attack control process (determination of the attack bullet firing speed) in the enemy aircraft attack control device (1) will be described narratively.
There are three methods for determining the attack bullet firing speed. The first is a method in which the “speed” of the attack bullet is fixed and the “direction” is determined. Second, the “direction” of the attack bullet is fixed and the “speed” is determined. The third is a method for determining both “speed” and “direction” of the attack bullet.
Whichever method is selected, the gist of the present invention is not affected and the design can be changed as appropriate. Therefore, in this embodiment, the first method, that is, the “speed” of the attack bullet is fixed. This will be described as a method for determining the “direction”. Further, two or more candidates (five candidates in this embodiment) are determined in advance for the “direction”, and the “direction” is determined from these candidates.

In this embodiment, it is assumed that the position coordinates of the own aircraft (30), enemy aircraft (40), and existing attack bullets on the screen are stored in the storage unit (20).
The behavior of the aircraft is as shown in FIG.

First, the control unit (190) determines whether or not to fire an attacking bullet of the enemy aircraft (40) during the execution process of the shooting game. This determination is made in the same manner as in a conventional shooting game.
In this embodiment, when the control unit (190) determines to launch an enemy bullet attack bullet, the enemy aircraft attack control process (determination of the attack bullet firing speed) according to the present invention is executed. Yes.

  The own aircraft existence probability calculation unit (141) is composed of an own aircraft existence number calculation unit (142) and a probability calculation unit (143). Upon receiving the attack bullet launch decision of the enemy aircraft by the control unit (190). The processing described below is performed.

  The own machine existence number calculation unit (142) acquires the position coordinates of the own machine (30) from the storage unit (20), and the cell in which the own machine (30) exists in the grid (50) obtained by dividing the game screen. Specify (step S1). FIG. 5 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 positions of the cells are expressed by numbers (see FIG. 5) assigned outside the grid (50). In FIG. 5, the square where the own aircraft (30) exists is (4, 4), and the square where the enemy aircraft (40) exists is (1, 3). The centers of the own aircraft (30) and enemy aircraft (40) are as described above.

  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. 5).

  Next, the number calculation unit (142) of the case where the own device is present calculates C (s, t) of each cell at each time t after the current time (step S2). Here, the processing unit time ΔT is set to 1 in order to make the description concrete. An arbitrary cell is represented by s.

FIG. 6 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 grid s ₀ = (4, 4) where the own aircraft (30) exists at the current time t ₀ (= 0). ing.

FIG. 7 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 aircraft (30) exists at t ₀ (= 0).

  As described above, the number calculation unit (142) for the presence of the own device calculates C (s, t) of each cell at each time point t after the current time. One search calculation method can be used. However, for example, in an ordinary decision tree search method, the time after the current time increases, and at the same time, the depth of search calculation increases, and the necessary 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 C (s, t) of routes up to s is the sum of C (s ', t-1) of the cell s' that can be moved in one processing unit time among the cells around the cell s. (The sum of s ′) and C (s, t−1) of the cell s before one processing unit time. That is, C (s, t) is obtained by the equation (1).

This will be described with an example in the case of time point 1 and time point 2 [see FIG. 8].
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 the machine can move 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) of (4,4) is 1 [see FIG. 8 (a)]. Therefore, when these are substituted into the expression (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. 8B. ].

According to this method, the calculation time and computer storage capacity required for calculating C (s, t) only increase in proportion to the time point and the number of cells. As a result of the experiment conducted by the inventor, from the viewpoint of entertainment, the normal decision tree search was limited to calculations from 2 to 3 time points ahead, but in the above method, from 10 to 20 time points ahead. Calculation was possible. Therefore, it is possible to predict with higher accuracy in the own device position prediction (because the own device can move to the end of the screen).
As described above, C (s, t) of each cell at each time point t after the current time is obtained. In general, it is desirable to predict from the point of view of the position of the aircraft to a previous time point. From the viewpoint of not sacrificing the playability, it is not preferable to predict until the previous time point. This also depends on the processing capability of the arithmetic processing unit. Therefore, it is only necessary to determine in advance how far ahead the position of the aircraft will be predicted in consideration of the accuracy of the aircraft's position prediction, amusement, the processing capability of the arithmetic processing unit, etc. In the drawing, only time 2 is shown for ease of understanding.)

In addition, the number calculation unit (142) for the presence of the own aircraft obtains the position coordinates of the existing attack bullets at the present time from the storage unit (20), and the cells that may collide with the existing attack bullets at each time point after the current time. The value of C (s, t) is set to 0.
The influence of an existing attack bullet that has been fired in the past by another enemy aircraft or an enemy aircraft (40) that is about to launch an attack bullet is reflected in the value of C (s, t). When an existing attack bullet is present in a certain cell at a certain time after the current time, at that point, the cell including the attack bullet position coordinates and the cell located within a predetermined distance from the attack bullet position coordinates There is a possibility that the machine (30) will come into contact with the attacking bullet. For this reason, as a general tendency of the player, it is considered that the player does not move to such a grid. Therefore, the value of C (s, t) of such a cell is set to zero. That is, the existence probability of the own aircraft (30) at that time is 0.

This will be described with reference to FIG.
In FIG. 9, 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. 9, the radius of the collision determination circle is assumed to be exactly equal to one side of the square cell.
It is assumed that at time point 1, it is predicted that there is a position coordinate (or a position coordinate) of an existing attack bullet in the upper right corner of the grid (50) [see FIG. 9 (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, there is no need to reset. In addition, “a grid located in the collision determination circle” is a grid that is 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 time point 2, it is predicted 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. 9 (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. At this time, the value of C (s, t) of the cells (2, 5), (2, 6), (3, 5), (3, 6) located in the collision determination circle is set to zero.

  As described above, the number calculation unit (142) for the presence of the own device obtains C (s, t) of each cell at each time t after the current time. C (s, t) of each cell at each time point is stored in the storage unit (20). After the process of step S2, the process of step S3 is performed.

The probability calculation unit (143) acquires C (s, t) of each cell at each time point from the storage unit (20), and the probability P (s) that the own device (30) exists in each cell at each time point. , T) is obtained (step S3).
The own aircraft existence probability P (s, t) at the time t at the cell _{s is} the sum Σ _s C (s, t) of all the cells at the time t, and the number C (s, t) at the cell s. It is obtained by the formula (2) using t) as a molecule. The own device existence probability P (s, t) at each cell at each time point is stored in the storage unit (20).

  At this time, as the time advances, generally, there is no route for the aircraft (30) to reach (the route is 0 as the initial value). The probability P (s, t) that 30) exists in a certain cell s decreases as the time advances. In general, the value of the own aircraft existence probability P (s, t) at the grid away from the own aircraft position at the time of launching the attack bullet (current time) is low.

Subsequently, the attacking bullet firing speed determination unit (144) acquires the position coordinates of the enemy aircraft (40) from the storage unit (20), and also at each time point obtained by the process of step S3, Using the machine existence probability P (s, t) as an input, the firing speed of the attack bullet (new attack bullet) is determined (step S4).
In this embodiment, the firing speed of a new attack bullet is determined by selecting from five “direction” candidates. Predicted position Se (t) _i [i is a parameter representing five candidates at each time point after the current time of the new attack bullet fired from the enemy aircraft (40). ] For each candidate is shown in FIG. 10 as a position vector starting from the position coordinates of the enemy aircraft (40) (the five “directions” in FIG. 10 are merely examples). In order for the new attack bullet to increase the threat to the own aircraft (30), it is necessary to increase the possibility that the new attack bullet will collide with the own aircraft (30). That is, at each time point when the new attack bullet moves, it is necessary that the new attack bullet exists in the square having a high own existence probability P (s, t). Under such an idea, the own aircraft presence probability sum Σ _t P (Se (t) _i, which is the sum of the own aircraft existence probabilities at all points where the predicted positions of the new attack bullets at each time point exist. , T) is calculated for each candidate, and the “direction” in which the own aircraft existence probability Σ _t P (Se (t) _i , t) becomes the maximum is determined as the “direction” of the new attack bullet [Fig. 11 (a)]. Incidentally, Se _{(t) i} of its own existence probability sum _{Σ t P (Se (t)} i, t) is the position coordinate of the end point of the position vector _{Se (t) i, P (} Se (t) i, t) represents the own existence probability of the cell including the position coordinates of the end point of the position vector Se (t) _i .

Here, as single-shot attack bullet firing, the “direction” that maximizes Σ _t P (Se (t) _i , t) is determined as one “direction” of the new attack bullet. The form is not limited. When a plurality of new attack bullets are fired at once, a number of candidates equal to the number of attack bullets to be fired can be selected from the top of the value of Σ _t P (Se (t) _i , t). That is, for example, when three new attack bullets are fired at a time, the top three “directions” of the values of Σ _t P (Se (t) _i , t) are determined as the “directions” of the new attack bullets. (FIG. 11 (b)). Also, for example, when two new attack bullets are fired at once, the “direction” that maximizes Σ _t P (Se (t) _i , t) is the center of the angle between the two new attack bullets. It is also possible to determine the “directions” of the two new attack bullets so as to be in the direction [FIG. 11 (c)].

  The firing speed of the new attack bullets determined as described above is temporarily stored in the storage unit (20), and the new attack bullets fly on the screen at the determined firing speed under the control of the control unit (190). To be drawn. Since the main body and processing method of this process are the same as those in the prior art, description thereof is omitted.

In the above embodiment, the “speed” of the attack bullet is fixed and the “direction” is determined. On the other hand, in the method in which the “direction” of the attack bullet is fixed and the “speed” is determined, the position vector Se (t) _i is fixed in the process of step S4, the “direction” is fixed and the “speed” is set. In the method of determining both “speed” and “direction” of the attack bullet, the position vector Se (t) _i is set to “speed” in the process of step S4. And the combination of both “direction” may be changed to a plurality of candidates.

  Instead of determining the speed of the new attack bullet each time a new attack bullet is fired, the speed of the new attack bullet is set by the method of the present invention every predetermined number of times, for example, once every third shot. It may be determined. Alternatively, the elapsed time from the previous attack bullet firing may be measured, and the speed of the new attack bullet may be determined by the method of the present invention in the first attack bullet firing after a predetermined time has elapsed. .

<Modification>
In calculating the own aircraft existence probability P (s, t), if the moving speed has been continued to some extent in the past in consideration of the own moving speed at the time of launching the attacking bullet, The value of the own aircraft existence probability P (s, t) at 1 is set to 1 [the own existence probability of other cells is 0. ]. This is based on the prospect that the speed of movement from the past to the present time will be maintained to some extent in the future. The upper limit of the time when the value of the own aircraft existence probability P (s, t) is set to 1, for example, is to store the player's operation history, find the average value of the time interval of the operation in which the player changes the movement direction, Use that value. As a specific example, as shown in FIG. 12, the own device existence number calculation unit (142) acquires the operation time interval average from the storage unit (20), and if the operation time interval average is 3 processing unit times, Suppose that the current movement speed is maintained 3 time units from the current time, that is, the current movement speed is maintained up to time 3, and there is a cell that passes by the movement speed until that time 3 The value of the probability P (s, t) may be 1 in all cases. Alternatively, the time point at which the current movement speed is started is stored in the storage unit (20), the residual between the operation time interval average and the start time is obtained, and the current time until the time corresponding to the residual is obtained. Assuming that the movement speed is maintained, the value of the own aircraft existence probability P (s, t) of the cell passing at the own vehicle movement speed up to that time and the cell where the own device exists at that time may be set to 1.

  A specific example is shown in FIG. Here, the average operation time interval is one processing unit time. At time 1, as shown in FIG. 13A, the own aircraft moves to the cell (4, 5) with probability 1, and the own device existence probability at other cells is 0 [Note that FIG. 13 (a) The number of each square of C is C (s, t) and is not its own existence probability. Here, it is shown that the total number of paths at time 0 shown in FIG. ]. At time 2, the route may be calculated by the method described above, and the total number of routes in each cell is the same as at time 1 in FIG. 6, centering on the grid (4, 5) including the position of the aircraft at time 1. [See FIG. 13B].

  In this way, in the case where the position of the own device is predicted to a further earlier time point, it is possible to suppress an increase in the number of cells having the non-zero value of the own device existence probability P (s, t). In addition, the prediction of the position of the aircraft at a time earlier than the current time becomes accurate, and the threat that an attack bullet can give to the aircraft increases.

There is a premise that there are a plurality of enemy aircraft in the shooting game, and there is a demand for a function in which a plurality of enemy aircraft cooperate to drive their own aircraft. However, the conventional algorithm for controlling the cooperation is not sufficient in the central control of the method of monitoring the movements of all enemy aircraft as in the conventional case. This is because the situation of enemy aircraft appearing on the game screen changes from moment to moment, and it is virtually impossible to develop a central control algorithm that considers all of these situations.
In this regard, as described in the above embodiment, according to the enemy aircraft attack control method of the present invention, the following effects are also enjoyed. How many enemy aircraft will be executed asynchronously in each control algorithm, but how bad the enemy's attacking bullets will be to the enemy when each enemy aircraft fires It can be evaluated that it is the same value as that of judging, and as a result, cooperation of a plurality of enemy aircraft as a whole is produced. In other words, so-called emergent collaboration of multiple enemy aircraft occurs.

  In addition to the above embodiments, the enemy aircraft attack control device / method of the 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. . In addition, the processing described in the enemy aircraft attack control device / method of the 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 executing the processing or as necessary. It may be executed individually.

  Further, when the processing function in the enemy aircraft attack control device of the shooting game is realized by a computer, the processing content of the function that the enemy aircraft attack control device of the shooting game should have is described by a program. Then, by executing this program on the computer, the processing function in the enemy aircraft attack control device of the shooting game is 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, this computer reads the program stored in its own recording medium and executes the 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).

  Further, in this embodiment, the enemy aircraft attack control device of the shooting game is configured by executing a predetermined program on the computer, but at least a part of these processing contents is realized in hardware. It is good.

  INDUSTRIAL APPLICABILITY The present invention is useful for a computer shooting game in which an own aircraft and one or more enemy aircraft are displayed on a screen, and the enemy aircraft launches an attack bullet against the own aircraft.

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 which shows the hardware structural example of the enemy machine attack control apparatus (1) of a shooting game. The figure which shows the function structural example of the enemy machine attack control apparatus (1) of a shooting game. The processing flow which determines the attack bullet speed of the enemy aircraft in the enemy aircraft attack control device (1) of the shooting game. The figure which shows the total number C (s, t) of the path | route of each square at the time 0. FIG. The figure which shows the total number C (s, t) of the path | route of each square at the time 1. The figure which shows the total number C (s, t) of the path | route of each square at the time 2. The figure explaining the method of calculating | requiring the total number C (s, t) of the path | route of the mesh of the shaded part of (b) from each grid of the shaded part shown to (a). (A) The figure explaining resetting the total number C (s, t) of the path | route of the grid located in an attack determination circle | round | yen at the time 1 to 0. (B) The figure explaining resetting the total number C (s, t) of the path | route of the grid located in an attack determination circle | round | yen at time 2 to 0. The figure which shows the position vector of a speed candidate in the time 1 and the time 2. (A) The figure which illustrated the case where one speed candidate is determined. (B) The figure which illustrated the case where three speed candidates are determined. (C) The figure which illustrated the case where one speed candidate is determined and an attack bullet is fired at two speeds on both sides of the determined speed. The figure which shows the function structural example of the enemy machine attack control apparatus (1) of the shooting game in a modification. (A) The figure which shows the total number C (s, t) of the path | route of each square at the time 1 in the case of a modification. (B) The figure which shows the total number C (s, t) of the path | route of each square at the time 2 in the case of a modification. 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.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Enemy aircraft attack control device 141 for shooting game Own aircraft existence probability calculation unit 142 Own aircraft existence number calculation unit 143 Probability calculation unit 144 Attack bullet firing speed determination unit 20 Storage unit

Claims (10)

A computer equipped with its own aircraft existence probability calculation means and attack bullet firing speed determination means displays its own aircraft and one or more enemy aircraft on the screen, and the enemy aircraft attacks the own aircraft operated by the player. An enemy aircraft attack control method for controlling an enemy aircraft attack in a shooting game
The aircraft existence probability calculation means is
The position and speed of the existing attack bullets fired by the enemy aircraft at a past time from the current time or the speed of existing attack bullets fired by other enemy aircraft at the past time from the current time when the enemy aircraft fires the attack bullets (current time) In addition, based on the current positional relationship of the aircraft, at each time after the current time, the aircraft is at the position where the existing attack bullets are predicted to exist in each grid of the grid divided into a grid. The own aircraft existence probability calculation step for obtaining the probability of being present in the cell without approaching the distance within a certain distance (own device existence probability) for each cell at each time point;
The attacking bullet firing speed determining means is
For two or more candidates for the speed at which enemy aircraft fires attack bullets, the sum of the probability of own aircraft in each square where the attack bullets fired at each candidate speed pass at each time point ) For each of the speed candidates, and an attack bullet firing speed determining step for determining the speed of a candidate whose ship's presence probability sum satisfies a predetermined condition as an attack bullet firing speed. Enemy aircraft attack control method. The cells that can move in one processing unit time from the cell S where the machine is present are all or part of the cells that are in contact with the cell S,
The aircraft existence probability calculation step is as follows:
The total number C (s, t) of paths from a cell s ₀ where the own machine exists at the current time t ₀ to a certain cell s at a certain time t after the current time is one processing unit time among the cells surrounding the cell s. The total number C (s', t-1) of the total number of paths C (s', t-1) at the time point t-1 of the cell s' where the aircraft can move at the time point t-1 of the cell s. The sum of the total number C (s, t-1) of the path, and further, the grid including the position where the existing attack bullet is predicted to exist at the time t and the path of the grid located within a predetermined distance from the position The number calculation step of the own device to set the total number C (s, t) of
The probability of existence of the aircraft in the cell s ₁ at the time t is defined as C (s ₁ , t), and Σ _s C (s) which is the sum of the total number C (s, t) of routes for all cells. , T) and a probability calculation step obtained as a result of dividing by t, the enemy aircraft attack control method for a shooting game according to claim 1. The cells that can move in one processing unit time from the cell S where the machine is present are all or part of the cells that are in contact with the cell S,
Ship moving speed at the present time t ₀ is set to continue until τ some point later than the present time, the ship moving speed moved ship has passed by the time τ square and time ship at τ is The own aircraft existence probability in a cell that is predicted to exist is 1, and the own aircraft existence probability in other cells is 0.
The aircraft existence probability calculation step is as follows:
The total number C (s, t) of paths from a cell s _τ at which the own machine exists to a certain cell s at a certain time t after the time τ is one processing unit time among the cells surrounding the cell s. The total number C (s', t-1) of the total number of paths C (s', t-1) at the time point t-1 of the cell s' where the aircraft can move at the time point t-1 of the cell s. The sum of the total number C (s, t-1) of the path, and further, the grid including the position where the existing attack bullet is predicted to exist at the time t and the path of the grid located within a predetermined distance from the position The number calculation step of the own device to set the total number C (s, t) of
The probability that the aircraft is present in the cell s ₁ at the time t is defined as C (s ₁ , t), and Σ _s C (s, t) which is the sum of the total number C (s, t) of routes for all cells. 2. The enemy game attack control method for a shooting game according to claim 1, further comprising: a probability calculation step obtained as a result of dividing by. The above time tau, the average value of the time interval of operation the player to change the moving direction of its own and (operation time interval average), alternatively, the operation and the time t _s which began ship moving speed at the present time t ₀ 4. The enemy aircraft attack control method of a shooting game according to claim 3, wherein a residual with a time interval average is used. The total number C (s, t) of the path is set to 0 in the above-described case number calculation step, and a grid including a position where an existing attack bullet is predicted to exist and a grid located within a predetermined distance from the position The
5. The cell according to claim 2, wherein the cell is located within a predetermined distance from any one of the four corners of the cell including the position where the existing attack bullet is predicted to exist or the center thereof. An enemy aircraft attack control method for a shooting game according to any one of the above. When the position of any one of the four corners of the square including the position where the existing attack bullet is predicted to be present is selected, the closest angle from the reference point representing the position of the existing attack bullet is selected. The enemy machine attack control method of the shooting game according to claim 5. The candidate speed satisfying the predetermined condition in the attack bullet firing speed determination step is:
The speed of the candidate that maximizes the above-mentioned own existence probability sum,
Or
When launching multiple attack bullets at a time, the speed of the candidate that gave the sum of the existence probability of each of the above-mentioned weapons from the largest sum of the existence probability of the own aircraft to the number of ranks equal to the number of attack bullets to be fired in descending order The enemy aircraft attack control method for a shooting game according to any one of claims 1 to 6, wherein: An enemy aircraft attack control device for a shooting game in which an own aircraft and one or a plurality of enemy aircraft are displayed on a screen, and the enemy aircraft fires an attack bullet against the own aircraft operated by the player,
The position and speed of the existing attack bullets fired by the enemy aircraft at a past time from the current time or the speed of existing attack bullets fired by other enemy aircraft at the past time from the current time when the enemy aircraft fires the attack bullets (current time) In addition, based on the current positional relationship of the aircraft, at each time after the current time, the aircraft is at the position where the existing attack bullets are predicted to exist in each grid of the grid divided into a grid. Own machine existence probability calculating means for obtaining the probability of existence of each cell without approaching a distance within a certain distance (own machine existence probability) for each cell at each time point;
For two or more candidates for the speed at which enemy aircraft fires attack bullets, the sum of the probability of own aircraft in each square where the attack bullets fired at each candidate speed pass at each time point ) For each speed candidate, and an attack bullet firing speed determining means for determining the speed of a candidate whose ship's presence probability sum satisfies a predetermined condition as an attack bullet firing speed. Enemy aircraft attack control device. Own device and one or more of the opponent's aircraft is displayed on the screen, enemy attack control to perform the enemy attack control shooter enemy to launch an attack bullets against ship operated by the player to the computer A program,
The position and speed of the existing attack bullets fired by the enemy aircraft at a past time from the current time or the speed of existing attack bullets fired by other enemy aircraft at the past time from the current time when the enemy aircraft fires the attack bullets (current time) In addition, based on the current positional relationship of the aircraft, at each time after the current time, the aircraft is at the position where the existing attack bullets are predicted to exist in each grid of the grid divided into a grid. The own aircraft existence probability calculation process for obtaining the probability of being in a cell without approaching a distance within a certain distance (own device existence probability) for each cell at each time point,
For two or more candidates for the speed at which enemy aircraft fires attack bullets, the sum of the probability of own aircraft in each square where the attack bullets fired at each candidate speed pass at each time point ) For each speed candidate, and the attack bullet firing speed determination process for determining the speed of the candidate whose ship's existence probability sum satisfies the predetermined condition as the attack bullet firing speed;
An enemy aircraft attack control program for a shooting game, characterized by causing a computer to perform . A computer-readable recording medium on which the program according to claim 9 is recorded.

Images