JP4996267B2 - Enemy aircraft action control method, apparatus, program, and recording medium thereof - Google Patents

Description

  The present invention relates to a method, an apparatus, a program, and a recording medium for controlling an action of an enemy aircraft in a shooting game.

Shooting game processing methods, particularly methods for controlling the operation of enemy aircraft, include algorithms that do not take into account the position of the aircraft, such as algorithms that keep the enemy aircraft descending in a certain direction regardless of the location of the aircraft, There was a method that adopted an algorithm that kept the enemy aircraft stationary regardless of the position of the aircraft. In addition, as an algorithm that considers the position of the own aircraft, for example, an algorithm that moves the enemy aircraft to approach the position of the own aircraft, or an algorithm that moves the enemy aircraft to always keep the position of the own aircraft at a certain distance and direction was there.
Further, although not a technique for controlling the movement of an enemy aircraft, there is a technique described in Non-Patent Document 1 as a conventional technique related to an attack bullet launch algorithm of an enemy aircraft.
Hiroshi Kawano, “Study on Algorithms for Shooting Enemy Attack Bullet for Shooting Games”, Information Processing Society of Japan Research Report [Game Informatics], June 30, 2006, vol. 2006, no. 70, p. 61-68

  Conventional behavior control algorithms for enemy aircraft are limited to simple ones. As a result, the player's own maneuvering technology necessary for avoiding enemy attacks is common in many shooting games, and the shooting game using the enemy aircraft action control algorithm according to the prior art is easily bored by the user. There was a problem.

  It is assumed that the enemy aircraft moves according to A (A is an arbitrary natural number) type of action a (a = 1,..., A), and the time t at which the enemy aircraft starts moving by the selected action is t = 0. And The mixed value calculation means makes the enemy aircraft act for all combinations of the action a of the enemy aircraft and the time t = nT (T is an action unit time, n = 1,..., N, N are arbitrary natural numbers). When moving according to a, an index indicating the possibility that the enemy aircraft at time t destroys the own aircraft and an index indicating the possibility that the own aircraft destroys the enemy aircraft are used using predetermined enemy aircraft behavior parameters. Calculate the blended value, which is the blended value. The adding means obtains a value obtained by adding the above mixed values at all or some of the times t when the enemy aircraft moves according to the action a for each action a of the enemy aircraft. The enemy aircraft movement speed determination means sets the action a of the enemy aircraft that maximizes the added value as the action of the enemy aircraft.

  The action pattern of enemy aircraft becomes various, and game nature improves. Further, the difficulty level of the shooting game can be adjusted in a multifaceted manner by changing the value of the enemy aircraft action parameter.

[Explanation of shooting game]
FIG. 5 illustrates a shooting game that is a target of processing of the present invention. On the screen, the attack bullet 3 ′ of the own aircraft 1 ′ and the own aircraft 1 ′, and the attack bullet 4 ′ of the enemy aircraft 2 ′ and the enemy aircraft 2 ′ are displayed. There may be a plurality of attack bullets 3 ′, enemy aircraft 2 ′, and attack bullets 4 ′. When there are a plurality of enemy aircraft 2 ′, it is assumed that each enemy aircraft is assigned a different number i (i = 1... I). Similarly, when there are a plurality of enemy aircraft's attack bullets 4 ', the enemy aircraft's attack bullets 4' are each assigned a different number j (j = 1... J). . The own aircraft 1 ', enemy aircraft 2', attack bullet 3 ', and attack bullet 4' are assumed to be located on a two-dimensional plane composed of the X axis and the Y axis.

  The player operates its own aircraft 1 'to fight the enemy aircraft 2'. The player can move his / her own machine for the action unit time T at W movement speeds (direction and speed) in one operation. W types of movement speeds (Vxs (w), Vys (w)) that can be taken by the own aircraft 1 'are determined in advance, and different movement speeds (Vxs (w), Vys (w)) have different movements. It is assumed that a speed number w (w = 1,..., W) is assigned. Hereinafter, the action of selecting the movement speed number w is referred to as action w. In addition, the player can perform an operation of firing an attack bullet 3 ′ for attacking the enemy aircraft 2 ′ at the same time as moving at the W speeds. The attack bullet 3 'moves according to a predetermined trajectory. The trajectory drawn by the attack bullet 3 'is called the own ray.

For example, when W = 9,
(Vxs (1), Vys (1)) = (V, 0)
(Vxs (2), Vys (2)) = (V, V)
(Vxs (3), Vys (3)) = (0, V)
(Vxs (4), Vys (4)) = (− V, V)
(Vxs (5), Vys (5)) = (− V, 0)
(Vxs (6), Vys (6)) = (− V, −V)
(Vxs (7), Vys (7)) = (0, −V)
(Vxs (8), Vys (8)) = (V, −V)
(Vxs (9), Vys (9)) = (0, 0)
It can be.

  The enemy aircraft 2 'can move at the moving speed (Vxe (a), Vye (a)). A type of movement speeds (Vxe (a), Vye (a)) that the enemy aircraft 2 'can take are determined in advance, and different movement speeds (Vxe (a), Vye (a)) have different movements. Assume that a speed number a (a = 1,..., A) is assigned. The enemy aircraft 2 'can fire the attack bullet 4' at an arbitrary speed (direction and speed) in order to attack the own aircraft. The fired attack bullet 4 'moves at a predetermined moving speed (Vxbj, Vybj).

  When the own aircraft 1 ′ collides with the enemy aircraft 2 ′ and the attack bullet 4 ′ fired by the enemy aircraft 2 ′, the own aircraft 1 ′ is destroyed and the game is over there. On the contrary, when the attack bullet 3 'of the own aircraft 1' collides with the enemy aircraft 2 ', the enemy aircraft 2' is destroyed. When all the enemy aircraft 2 'are destroyed by the attack bullet 3' of the own device 1 ', the user wins the game.

  The game screen is divided into grids, and the unit of the grid is called a grid. For example, the coordinate of the lower left cell of the screen is (0, 0), and the coordinates of the cell of (0, 0) that are X right and Y above are ( X, Y). Here, X and Y are integers of 0 or more.

  In addition, the game is performed so that the length S of one side of the grid is a value obtained by multiplying the speed V of the player's own machine moving in the direction parallel to the side by the action unit time T, that is, S = VT. Divide the screen into grids. By setting the length of one side of the cell in this way, no matter what moving speed (Vxs (w), Vys (w)) the aircraft that exists in a certain cell s moves, after the action unit time T Will always exist in a certain cell s with a probability of 100%. For this reason, a calculation burden can be reduced.

In addition, if the length of one side of the mesh is large, the processing of the present invention becomes rough, and it may not be possible to properly control the own device. Therefore, the length S of one side of the square is less than one third of the length of half the sum of the diameter of the circle inscribed in the shape of the own aircraft and the diameter of the circle inscribed in the shape of the attacking bullet of the enemy aircraft. The action unit time T and the speed V of the own machine may be determined so as to be values.
The coordinates (X, Y) expressed in capital letters are the coordinates of the cells. On the other hand, coordinates (x, y) expressed in small letters represent coordinate positions in real number expression on the game screen. Arbitrary coordinates (x, y) can be converted into coordinates (X, Y) of a grid including the coordinates (x, y).

[First embodiment]
Each time t = nT (T is an action unit time, and n = 1,..., N, N are obtained) when an enemy aircraft moves according to action a among A (A is an arbitrary integer) types of actions. The probability that the enemy aircraft is in the grid s at each time t as the enemy aircraft's own destruction probability, which is the probability that the enemy aircraft will destroy itself in the range of 10 to 20 depending on accuracy and hardware performance) A case where the own device existence probability Ps (t, s) is used will be described as an example. The enemy existence probability Ps (t, s) can be used as the enemy aircraft's own destruction probability. By definition, when the enemy aircraft contacts the own aircraft, the own aircraft is destroyed, The closer the enemy aircraft is to the enemy aircraft, the higher the possibility that the enemy aircraft will come into contact with the enemy aircraft, and the enemy aircraft will be destroyed by attack bullets fired from the enemy aircraft. This is because the possibility increases. Hereinafter, the own aircraft existence probability Ps (t, s) may be referred to as an enemy aircraft destruction probability Ps (t, s).

  Also, the enemy aircraft moved according to the above action a as the enemy aircraft destruction probability that is the probability that the own aircraft will destroy the enemy aircraft at each time t when the enemy aircraft moves according to the action a among the A types of actions. The case where the probability Psx (t, s) at each time t when the enemy aircraft is on the line of the own aircraft is used will be described as an example. The existence probability Psx (t, s) on the ray can be used as the enemy aircraft destruction probability. The enemy aircraft may be destroyed when the enemy aircraft is on the own ray. This is because it is expensive. Hereinafter, the on-ray existence probability Psx (t, s) may be referred to as an enemy aircraft destruction probability Psx (t, s).

  Furthermore, in this embodiment, the action of the enemy aircraft corresponds to a movement speed number that can be taken by the enemy aircraft, and the enemy aircraft takes an action as the movement speed of A (A is an arbitrary natural number). When a certain moving speed number aεA is selected from the numbers, the enemy aircraft follows a predetermined moving speed vector (Vxe (a), Vye (a)) corresponding to the moving speed number a. It is assumed that the movement of the behavior unit time T is performed at all times t = nT (n = 1,..., N, N are arbitrary natural numbers).

In the following, the time t at which the own device starts moving at the selected moving speed is set to t = 0.
[Device configuration]
FIG. 1 illustrates a functional configuration of an enemy aircraft behavior control apparatus 1000 according to the present invention.
The enemy aircraft behavior control apparatus 1000 includes, for example, a storage unit 1, a mixed value calculation unit 2, an addition unit 3, an enemy aircraft movement speed determination unit 4 (or enemy aircraft behavior determination unit 4), and an enemy aircraft behavior parameter determination unit 5. Have.
The storage unit 1 includes, for example, an enemy aircraft destruction probability storage unit 11, an enemy aircraft destruction probability storage unit 12, and an enemy aircraft position storage unit 13. The mixed value calculation unit 2 includes, for example, a storage unit 21 and a control unit 22. The adding unit 3 includes, for example, an adding unit 31,..., An adding unit 3a,. The enemy aircraft moving speed determination unit 4 includes a maximum value detection unit 41. As shown in FIG. 8, the enemy aircraft behavior parameter determination unit 5 includes, for example, a distance calculation unit 52, a determination unit 53, a storage unit 54, and a coordinate comparison unit 55.

With reference to FIG. 3, the process of the enemy aircraft behavior control apparatus 1000 will be described. FIG. 3 is a diagram illustrating a processing flow of the enemy aircraft behavior control apparatus 1000.
<Step S0>
In the enemy aircraft destruction probability storage unit 11 of the storage unit 1 (see FIG. 1), the probability Ps (t, s) that the aircraft exists in each cell s at each time t is calculated and stored in advance. . A method for calculating Ps (t, s) will be described later.
In addition, the enemy aircraft destruction probability storage unit 12 of the storage unit 1 stores the probability Psx (at each time t when the enemy aircraft is on the line of the own device when the enemy aircraft selects the movement speed number a as the action P ( t, s) is calculated and stored in advance. A method for calculating Psx (t, s) will be described later.

Further, in the enemy aircraft position storage unit 13 of the storage unit 1, a cell sei (t, a) where an enemy aircraft exists at each time t when the enemy aircraft selects the movement speed number a as an action is calculated in advance. Stored. A method for calculating sei (t, a) will be described later.
Furthermore, α and β that are enemy aircraft action parameters are stored in the storage unit 21 of the mixed value calculation unit 2. α and β are arbitrary real numbers.

<Step S1>
The mixed value calculation unit 2 is a probability that an enemy aircraft destroys its own aircraft when the enemy aircraft selects a movement speed number a as an action from A (A is an arbitrary integer) type of movement speed. Ps (t, sei (t, a)), Psx (t, sei (t, a)) that is the probability that the aircraft destroys the enemy aircraft, and predetermined enemy aircraft action parameters α, β. The mixed value F (t, sei (t, a)) determined by the following equation is calculated and output to the adding unit 3.
F (t, sei (t, a)) = αPs (t, sei (t, a)) + βPsx (t, sei (t, a)) (1)
The mixed value F (t, s) defined by F (t, s) = αPs (t, s) + βPsx (t, s) is such that the enemy aircraft located at the cell s at time t is destroyed by itself. It is an index that indicates the possibility of destroying the aircraft without it.

  The mixed value calculation unit 2 calculates the mixed value F (t, sei (t, a)) for all combinations of the moving speed number a and time t. With reference to FIG. 4, the calculation method of the mixed value F (t, sei (t, a)) will be described. FIG. 4 is a diagram illustrating a flow of processing in step S1.

First, the control unit 22 of the mixed value calculation unit 2 initializes the values a and t stored in the storage unit 21 as a = 1 and t = T, respectively (step S11).
The mixed value calculation unit 2 stores the enemy aircraft position sei (t, a) in which the enemy aircraft exists at the time t when the enemy aircraft selects the movement speed number a as the action at the time t = 0. Read from the unit 13 (step S12).

The mixed value calculation unit 2 determines the enemy aircraft's own destruction probability Ps (t, sei (t, a)) corresponding to the read cell sei (t, a) and the enemy aircraft destruction probability. Psx (t, sei (t, a)) is read from the enemy aircraft destruction probability storage unit 11 and the enemy aircraft destruction probability storage unit 12 of the storage unit 1 (step S13).
For example, the mixed value calculation unit 2 calculates the enemy aircraft destruction probability Ps (t, sei (t, a)) and the enemy aircraft destruction probability Psx (t, sei (t, a)) is calculated by adding the weighted addition using the enemy aircraft behavior parameters α and β read from the storage unit 21 to calculate the mixed value F (t, sei (t, a)), and adding It outputs to the part 3 (step S14).

The control unit 22 compares t read from the storage unit 21 with N × T (step S15). If t ≧ N × T is not satisfied, t is incremented by the action unit time T (step S12), and the process returns to step S12 to perform processing. If t ≧ N × T, a is compared with the type A of the moving speed number of the enemy aircraft (step S17). If a ≧ A is not satisfied, a is incremented by 1, and the process returns to step S12 to perform processing (step S18). If a ≧ A, the process of step S1 ends.
In this way, the mixed value calculation unit 2 calculates the mixed value F (t, sei (t, a)) for each combination of the moving speed number a and the time t, and the calculation result is sent to the adding unit 3. Output.

<Step S2>
The adding unit 3 calculates the mixed values F (t, s) at all times t = nT (n = 1,..., N) when the enemy aircraft selects the movement speed number a as an action at the time t = 0. The added value is obtained for each moving speed number a (that is, for each action) and output to the enemy aircraft moving speed determining unit 4. That is, the adder 3 calculates Σ _{t = 1} ^{t = NT} F (t, sei (t, a)), and the mixed value F (t, sei (t, a)) for each moving speed number a. Find the added value of.

In the addition unit 3 of the enemy aircraft behavior control apparatus 1000 illustrated in FIG. 1, the addition unit 31 calculates Σ _{t = 1} ^{t = NT} F (t, sei (t, 1)), and the addition unit 32 performs Σ _{t = 1} ^{t = NT} F (t, sei (t, 2)),..., The adder 3a calculates Σ _{t = 1} ^{t = NT} F (t, sei (t, a)),. adding section 3A Σ _t ⁼ 1 _t ⁼ NT F by calculating (t, sei (t, 1 )), and outputs the calculation result to the enemy movement speed determining unit 4, respectively.

<Step S3>
The enemy aircraft moving speed determination unit 4 compares the added value Σ _{t = 1} ^{t = NT} F (t, sei (t, a)) of the mixed value for each moving speed number a, and maximizes the added value. The moving speed number a to be selected is selected and output. Specifically, the maximum value detection unit 41 of the enemy aircraft movement speed determination unit 4 adds the mixed value for each movement speed number a Σ _{t = 1} ^{t = NT} F (t, sei (t, a)) Is detected, and a moving speed number a corresponding to the maximum value is output. An enemy aircraft operation processing unit (not shown) moves the enemy aircraft for the action unit time T based on the selected moving speed number a.

  If there are multiple enemy aircraft, the above process is repeated for each enemy aircraft. At that time, the enemy aircraft destruction probability Ps (t, s), the own aircraft destruction probability Psx (t, s), and the enemy aircraft position sei (t, s) are calculated again for each different enemy aircraft. Instead, the enemy aircraft's own destruction probability Ps (t, s) calculated once for an enemy aircraft, its own destruction probability Psx (t, s), and the enemy aircraft's position sei (t, s) ) Is reused for processing on other enemy aircraft, the calculation efficiency is good.

** Enemy aircraft behavior parameters **
By changing the value of the enemy aircraft behavior parameter, it is possible to continuously adjust whether the behavior pattern of the enemy aircraft is more aggressive or more defensive. Furthermore, in the above embodiment, by changing the values of the enemy aircraft behavior parameters α and β stored in the storage unit 21, the behavior pattern of the enemy aircraft can be changed as follows, for example.

(1) If α = 0 and β> 0, the enemy aircraft approaches to be drawn into its own line of sight (suicide dog death pattern).
(2) When α> 0 and β = 0, the enemy aircraft gives the highest priority to moving closer to the own aircraft, but does not consider that the enemy aircraft is destroyed by the own aircraft (kamikaze pattern). At first glance it is tough as the enemy aircraft attacks without considering its own safety, but destroying the enemy aircraft will lead to its own safety action and also maximize the score .
(3) If α = 0 and β <0, the enemy aircraft will only focus on escaping from its own line of sight, and will not consider attacks on itself (safety-oriented timid pattern). In spite of being unable to shoot down enemy aircraft, there is less pressure from enemy aircraft.
(4) If α> 0 and β <0, the enemy aircraft moves close to its own aircraft, but does not enter the line of its own (risk consideration pattern). Even if you take a safe action, there is a high possibility that there is no enemy aircraft on the subject line at that time, and if your aircraft does not move to a position where there is a high possibility of contact with the attacking bullet, Cannot be effectively destroyed. Therefore, when the enemy aircraft action parameters are determined in this way, a high risk and high return situation can be created in the shooting game.

  Further, the value of the enemy aircraft action parameter may be changed according to the position of the enemy aircraft. Thereby, it is possible to cause the enemy aircraft to perform a complicated operation and a strategic operation, and there is an advantage that the game performance is increased. An example in which the value of the enemy aircraft action parameter is changed according to the positional relationship between the enemy aircraft and the own aircraft will be described below with reference to FIGS. FIG. 6 and FIG. 7 are diagrams showing examples of changing the value of the enemy aircraft action parameter in accordance with the positional relationship between the enemy aircraft and the own aircraft. The circle indicated by the dotted line is separated from the own aircraft by a predetermined distance r. Means the position.

  As shown in FIG. 6, when the enemy aircraft is in front of the aircraft and the enemy aircraft is more than a predetermined distance R (R is an arbitrary real number), the enemy aircraft is There is a possibility of being destroyed by the fired ammunition. In this case, α is arbitrary (preferably α> 0) and β <0, and the processing shown in the above embodiment is performed. Thereby, it is possible to cause the enemy aircraft to take an action that is not easily destroyed by the own aircraft. Here, the enemy aircraft being in front of the aircraft means that the enemy aircraft is on the side where the enemy's ray is located with respect to a straight line that passes through the aircraft and is perpendicular to the aircraft's ray. .

  Specifically, for example, the coordinate comparison unit 55 (see FIG. 8) of the enemy aircraft action parameter determination unit 5 compares the y coordinate of the enemy aircraft with the y coordinate of the own aircraft. The distance calculation unit 52 calculates the distance r between the own aircraft and the enemy aircraft, and compares the distance r obtained by the determination unit 53 with the predetermined distance R read from the storage unit 54. If the coordinate comparison unit 55 determines that the y coordinate of the enemy aircraft> the y coordinate of the own aircraft, and the determination unit 53 determines that distance r ≧ distance R, then the enemy aircraft action parameter determination unit 5 sets α to The enemy aircraft action parameters α and β satisfying the condition of arbitrary (preferably α> 0) and β <0 are set in the storage unit 21 of the mixed value calculation unit 2. The enemy aircraft behavior parameter determination unit 5 performs this determination processing at regular time intervals. The enemy aircraft behavior control apparatus 1000 performs the above-described processing based on the enemy aircraft behavior parameters α and β and controls the operation of the enemy aircraft.

  As shown in FIG. 7, when the enemy aircraft is behind the aircraft, the attack bullet of the aircraft does not hit the enemy aircraft. In this case, it is preferable to take an action pattern that causes the enemy aircraft to attack itself. That is, the processing shown in the above embodiment is performed with α> 0 and β being arbitrary (preferably β = 0).

Specifically, for example, the coordinate comparison unit 55 of the enemy aircraft action parameter determination unit 5 compares the y coordinate of the enemy aircraft with the y coordinate of the own aircraft. When the coordinate comparison unit 55 determines that the y coordinate of the enemy aircraft <the y coordinate of the own aircraft, the enemy aircraft action parameter determination unit 5 sets α> 0 and β arbitrarily (preferably β = 0). The enemy aircraft behavior parameters α and β that satisfy the condition are set in the storage unit 21 of the mixed value calculation unit 2. The enemy aircraft behavior parameter determination unit 5 performs this determination processing at regular time intervals. The enemy aircraft behavior control apparatus 1000 performs the above-described processing based on the enemy aircraft behavior parameters α and β and controls the operation of the enemy aircraft.
Thus, by setting the enemy aircraft behavior parameters to various values, the behavior of the enemy aircraft can be freely controlled.

[Second Embodiment]
The above embodiment is an embodiment when it is assumed that an enemy aircraft that has moved according to a certain action exists at a certain position (a grid) at each time t = nT with a probability of 100%. That is, in the above embodiment, the cell at each time when the enemy aircraft moved according to a certain movement speed number a is located is uniquely determined as sei (t, a). However, the present invention can be applied even when the enemy aircraft that has moved according to a certain action is stochastically expressed as to whether or not it exists at a certain position. That is, the present invention can be applied even when the probability that an enemy aircraft that has moved according to a certain action a is present in the cell s at time t is stochastically represented as Pei (t, s, a).

FIG. 2 is a diagram illustrating a functional configuration of the enemy aircraft behavior control device 1001 according to the second embodiment. As shown in FIG. 2, the enemy aircraft behavior control device 1001 according to the second embodiment has a mixed value calculation unit 2 ′ instead of the mixed value calculation unit 2, and the storage unit 1 stores the enemy aircraft position. It differs from the enemy aircraft action control apparatus 1000 according to the first embodiment in that it has an enemy aircraft existence probability storage unit 14 instead of the unit 13. Since other functional configurations and processes are the same, description thereof is omitted.
It is assumed that the enemy aircraft existence probability storage unit 14 stores the probability Pei (t, s, a) that the enemy aircraft moved according to each action a exists in each cell s at each time t. A method for obtaining the enemy aircraft existence probability Pei (t, s, a) will be described later.

The mixed value calculation unit 2 ′ calculates the mixed value F (t, a) based on the following formula for all combinations of the moving speed number a and the time t = nT.
F (t, a) = Σ _s Pei (t, s, a) (αPs (t, s) + βPsx (t, s)) (2)
In the adder 3, the mixed value F (t, a) is summed with respect to time, and the moving speed number a that maximizes this sum is selected and output by the enemy aircraft moving speed determiner 4.
When the grids for dividing the screen are coarse, the enemy aircraft action control device 1001 according to the second embodiment that performs the present invention based on Pei (t, s, a) which is the probability distribution of the enemy aircraft position, The action of enemy aircraft can be controlled more accurately.

[How to determine the existence probability Ps (t, s)]
In the above embodiment, how to determine the existence probability Ps (t, s) of the own aircraft used as an example of the probability that the enemy aircraft moving according to the action a destroys the own aircraft at each time t = nT will be described. Ps (t, s) is a probability that an enemy aircraft exists at the cell (position) s at time t.
The own device existence probability calculation unit 6 illustrated in FIG. 9 performs the time t after the elapse of the action unit time T from the time t based on the probability Ps (t, s ′) that the own device exists in the cell s ′ at the time t. The probability Ps (t + T, s) that the own device exists in the cell s at t + T is obtained. By repeating this process, the own device existence probability calculation unit 6 finally calculates the probability that the own device exists in each cell s at each time t = nT (n = 1... N). Ask. The calculated probability Ps (t, s) is stored in the storage unit 61.

Assuming that the cell in which the own device is located at time t = 0 is s0, the probability Ps (0, s0) = 1 that the own device exists in the cell s0 at time t = 0. It is assumed that Ps (0, s0) = 1 is stored in the storage unit 61.
First, the own aircraft existence probability calculation unit 6 calculates the following equation, and based on the probability Ps (t, s ′) that the own aircraft exists in the cell s ′ at the time t, the own aircraft at t + T has the cell s The probability Ps (t + T, s) existing in is obtained.
Ps (t + T, s) = (1−max (Pbj (t + T, s))) Σ _w {Psel (w, t) · Σ _{s ′} {Ptrs (s ′, s, w)) · Ps (t, s ')}} ... (3)
Here, Psel (w, t) is the probability that the own device will select the moving speed number w at time t. For example, assuming that the mobile device selects the moving speed number w with equal probability, Psel (w, t) = 1 / W can be set. In addition, the user can arbitrarily select the value of Psel (w, t). It is assumed that the value of Psel (w, t) is preset and stored in the storage unit 61.

Ptrs (s ′, s, w) moves at the time t at the action unit time T according to the moving speed (Vxs (w), Vys (w)) of the moving speed number w. Thus, the probability of being in the cell s at time t + T. A method of calculating Ptrs (s ′, s, w) will be described later.
The movement probability calculation unit 62 moves the own machine existing in the cell s ′ for the action unit time T at the movement speed (Vxs (w), Vys (w)) corresponding to the movement speed number w of the own machine. As a result, the probability Ptrs (s ′, s, w) existing in the cell s is calculated.

The integrating unit 63 calculates the product Ptrs (Ptrs (s ′, s, w) calculated above and the probability Ps (t, s ′) that the own device read from the storage unit 61 exists in the cell s ′. s ′, s, w) · Ps (t, s ′) is obtained.
In this way, the movement probability calculating unit 62 and the integrating unit 63 calculate the above Ptrs (s ′, s, w) · Ps (t, s ′) for all the cells s ′.
The adding unit 64 adds Ptrs (s ′, s, w) · Ps (t, s ′) calculated for each cell s ′. That is, Σ _{s ′} {Ptrs (s ′, s, w) · Ps (t, s ′)} is calculated.

The accumulating unit 65 calculates the above calculated Σ _{s ′} {Ptrs (s ′, s, w) · Ps (t, s ′)} and the own device at the time t read from the storage unit 10 is the moving speed number w. The product Psel (w, t) · Σ _{s ′} {Ptrs (s ′, s, w) · Ps (t, s ′)} with the probability Psel (w, t) of selecting is obtained.
In this way, the movement probability calculation unit 62, the integration unit 63, the addition unit 64, and the integration unit 65 perform the above Psel (w, t) · Σ _{s ′} {Ptrs ( s ′, s, w) · Ps (t, s ′)} is calculated.

The adding unit 66 adds Psel (w, t) · Σ _{s ′} {Ptrs (s ′, s, w) · Ps (t, s ′)} obtained for each moving speed number w. That is, Σ _w Psel (w, t) · Σ _{s ′} {Ptrs (s ′, s, w) · Ps (t, s ′)} is calculated.
The maximum value extraction unit 69 calculates max (Pbj (t + T, s)). That is, the probability Pbj (t + T, s) (j = 1,..., J) that the enemy bullet is present in the cell s at the time t + T read from the enemy attack bullet presence probability storage unit 610 is compared. Output the largest value. That is, Pbj (t + T, s) for all j = 1,..., J is compared and the largest value is output.

The subtracting unit 60 calculates a value obtained by subtracting the calculated max (Pbj (t + T, s)) from 1.
The accumulator 67 calculates Σ _w Psel (w, t) · Σ _{s ′} {Ptrs (s ′, s, w) · Ps (t, s ′)} calculated by the adder 66 and the subtractor 60 calculates. The product with 1-max (Pbj (t + T, s)) is obtained.
In this way, by multiplying by 1-max (Pbj (t + T, s)), it is assumed that the enemy aircraft is destroyed when the enemy's attack bullet is present in the square s at time t + T. The existence probability Ps (t, s) of the own device can be calculated.

In this way, the own device existence probability calculation unit 6 uses the probability Ps (t, T) that the own device exists in the cell s based on the probability Ps (t, s) that the own device exists in the cell s at the time t. t + T, s).
The above processing is performed for all t (t = T,..., (N−1) T) in ascending order, and the probability that the own device exists in the cell s is obtained at each time. At t = nT, the probability that the own device exists in the cell s is obtained.

Assuming that the aircraft continues to take actions taken at time t = 0 by a predetermined time length T ₂ or a predetermined time step n ₂ from time t = 0, The probability Ps (t, s) may be obtained. This is because the player of the shooting game often keeps pushing the direction indicator lever in a certain direction for a long time exceeding the action unit time T, that is, continues to move the player in a certain direction at each successive time. This is because there are many cases. There is an advantage that the amount of the search calculation described above can be reduced.

Next, how to determine the respective probabilities Pbj (t, s) of the enemy aircraft's attack bullet j existing in the cell s at time t stored in advance in the enemy aircraft attack bullet presence probability storage unit 610 will be described.
The enemy aircraft attack bullet existence probability calculation unit 7 shown in FIG. 10 uses the enemy aircraft attack bullet at time t + T based on the probability Pbj (t, s ′) that the enemy aircraft's attack bullet at time t exists in the mesh s ′. The probability Pbj (t, s) that exists in the cell s is obtained. Then, the enemy aircraft attack bullet existence probability calculation unit 7 repeats this process, and finally, at each time t = nT (n = 1... N), there is an enemy aircraft attack bullet in the grid s. Find the probability of being. The calculated probability Pbj (t, s) is stored in the enemy aircraft attack bullet existence probability storage unit 610.

Specifically, for example, the enemy aircraft attack bullet existence probability calculation unit 7 shown in FIG. 10 calculates the following equation to calculate the probability Pbj (t, Based on s ′), a probability Pbj (t, s) that an attacking bullet of an enemy aircraft at time t + T is present in the cell s is obtained.
Pbj (t + T, s) = Σ _{s ′} {Ptrbj (s ′, s) · Pbj (t, s ′)} (4)
Here, Ptrbj (s ′, s) is obtained at time t + T by the attacking bullet of the enemy aircraft existing at the cell s ′ at time t moving by the action unit time T according to a predetermined moving speed (Vxbj, Vybj). Is the probability of being in the cell s. A method of calculating Ptrbj (s ′, s) will be described later.

  The existence probability Pbj (0, s) of the enemy bullet at time t = 0 is, for example, the probability of enemy attack bullet existence for the cell s # including the coordinates (xbj, ybj) of the attack bullet at time t = 0. Pbj (0, s #) = 1, and the enemy aircraft attack bullet existence probability for other cells is Pbj (0, s #) = 0. In addition, the area of a portion that overlaps the cell sbj centered at (xbj, ybj) and each cell s constituting the grid dividing the game screen is calculated. The attack bullets of the enemy aircraft may exist at each cell s with a probability Pbj (0, s) proportional to the area of the overlapped portion. In this case, for example, the value of half the sum of the diameter of the circle inscribed in the shape of the attack bullet of the enemy aircraft and the diameter of the circle inscribed in the shape of the own aircraft is centered on the position (xbj, ybj) of the enemy aircraft. The length of one side of the square sbj can be made.

  The above processing is performed for all t (t = T,..., (N−1) T) in ascending order, and the probability that an enemy's attack bullet is present in the square s is obtained at each time. In addition, at time t = nT, the probability that an attacking bullet of an enemy aircraft exists in the cell s is obtained. These calculated probabilities are stored in the enemy aircraft attack bullet presence probability storage unit 610.

[How to obtain the existence probability Psx (t, s) on the ray]
Next, how to determine the on-line existence probability Psx (t, s) used as the probability that the own aircraft can destroy the enemy aircraft located in the cell s in the above embodiment will be described. Psx (t, s) is a probability that an enemy aircraft existing in the cell s is located on the ray of its own aircraft. When the enemy aircraft is located in the grid xs, Psx (t, xs) is defined as follows.
Psx (t, xs) = ( _{Σsεxs *} Ps (t, s)) / num (xs *)
Here, the set xs * of cells is a set composed of all cells s that satisfy the condition that there is a cell xs on the ray of the own aircraft located at the cells sεxs *. That is, xs * is a set of all cells s where the own aircraft having a ray passing through the cell xs is located. num (xs *) is the number of cells constituting the cell set xs *.

For example, when the attack bullet of its own aircraft is fired toward the top of the screen (in the positive direction of the y-axis), the cell set xs * is the cell having the same X coordinate as the cell xs and is below the cell xs. Num (xs *) is the number of cells below the cell xs (in the negative direction of the Y axis).
In order to reduce the calculation amount, the cell set xs * is defined as a set composed of cells that pass through the cell xs and are located on a straight line having the same inclination as the ray of the aircraft. t, xs) may be calculated.

[How to find the enemy aircraft position sei (t, a) and enemy aircraft existence probability Pei (t, s, a)]
An enemy aircraft selects a movement speed number a as an action at time t = 0, and an enemy aircraft that moves according to the movement speed number a exists at each time t = nT sei (t, a), The probability Pei (t, s) that an enemy aircraft selects a movement speed number a as an action at time t = 0, and an enemy aircraft that moves according to the movement speed number a exists at each cell (position) at each time t = nT. , A) will be described.

  First, how to obtain the enemy aircraft position sei (t, a) will be described. The coordinate where the enemy aircraft is present at time t = 0 is assumed to be (xei, yei). When the movement speed number a in which the enemy aircraft is an action is selected, in the above embodiment, the enemy aircraft repeats the movement of the action unit time T according to the movement speed number a at each time t = nT. The machine coordinates can be calculated as (xei + Vxe (a) * t, yei + Vye (a) * t). Here, (Vxe (a), Vye (a)) are moving speed vectors corresponding to the moving speed number a. At this time, the enemy aircraft position sei (t, a) is a square including coordinates (xei + Vxe (a) × t, yei + Vye (a) × t).

  Next, how to obtain the enemy aircraft existence probability Pei (t, s, a) used in the second embodiment will be described. The enemy aircraft existence probability calculation unit 8 shown in FIG. 11 has an enemy aircraft at time t + T in the cell s based on the probability Pei (t, s ′, a) that the enemy aircraft at time t exists in the cell s ′. Probability Pei (t, s, a) is obtained. Then, the enemy aircraft existence probability calculation unit 8 repeats this process to finally obtain the probability that an enemy aircraft exists in the cell s at each time t = nT (n = 1... N). . The calculated probability Pei (t, s, a) is stored in the enemy aircraft existence probability storage unit 14.

Specifically, for example, the enemy aircraft existence probability calculation unit 8 shown in FIG. 11 calculates the following equation to obtain the probability Pei (t, s ′, a) that the enemy aircraft exists at the time t at the cell s ′. Based on the above, the probability Pei (t, s, a) that the enemy aircraft at time t + T exists in the cell s is obtained.
Pei (t + T, s, a) = Σ _{s ′} {Ptrei (s ′, s, a) · Pei (t, s ′, a)} (5)
Here, in Ptrei (s ′, s, a), an enemy aircraft existing in the cell s ′ at time t moves for the action unit time T according to a predetermined moving speed (Vxe (a), Vye (a)). Thus, the probability of being in the cell s at time t + T. A method of calculating Ptrii (s ′, s, a) will be described later.

  The enemy aircraft existence probability Pei (0, s, a) at time t = 0 is, for example, an enemy aircraft existence probability Pei (0, s #, a) = 1 for the cell s # including (xei, yei). The enemy aircraft existence probability for other cells is set to Pei (0, s #, a) = 0. Also, the area of the overlapping area of the cell sei centered at (xei, yei) and each cell s constituting the grid dividing the game screen is calculated, and the enemy aircraft has a probability proportional to the area of the overlapping area. Thus, it may be present in each cell s. For example, the half of the sum of the diameter of the circle inscribed in the shape of the enemy aircraft and the diameter of the circle inscribed in the shape of the own aircraft is the one side of the cell sei centered on the position (xei, yei) of the enemy aircraft Can be of length.

  The above processing is performed for all t (t = T,..., (N−1) T) in ascending order, and the probability that an enemy aircraft exists in the cell s is determined at each time. At t = nT, the probability that an enemy aircraft exists in the cell s is obtained. These calculated probabilities are stored in the enemy aircraft existence probability storage unit 14.

[Regarding Calculation Method of Movement Probability Ptrs (s ′, s, w), Ptrbj (s ′, s), Ptrei (s ′, s, a)]
Hereinafter, the probability Ptrs (s ′, s ′,) that the own aircraft existing in the cell s ′ moves to the cell s by moving for the action unit time T according to the movement speed (Vxs (w), Vys (w)) of the movement speed number w. s, w), the probability Ptrbj (s ′, s) that the attacking bullet of the enemy aircraft existing in the cell s ′ moves to the cell s by moving by the action unit time T according to a predetermined moving speed (Vxej, Vyei), Probability Ptri (s ′ that the enemy aircraft existing in the cell s ′ moves to the cell s by moving by the action unit time T according to the movement speed (Vxe (a), Vye (a)) of the movement speed number a of the enemy aircraft , S, a) will be described.

First, how to obtain Ptrs (s ′, s, w) will be described. The displacement amount (dxs, dys) of the x coordinate and the y coordinate when the own machine selects the movement speed number w and moves by the action unit time T is as follows:
dxs = Vxs (w) × T
dys = Vys (w) × T
It is. A cell s ′ where the own device is present is defined as a cell sds which has been translated by the displacement (dxs, dys). The ratio of the area where the cell sds overlaps the cell s to the area of the entire cell s is defined as Ptrs (s ′, s, w).

  For example, as shown in FIG. 12, it is assumed that the cell sds overlaps the cells s1 to s9. Here, the numerical values from 0 to 1 written in each cell represent the ratio of the area where the cell sds overlaps the cell to the area of the cell. At this time, Ptrs (s ', s1, w) = 0.2, Ptrs (s', s2, w) = 0.33, Ptrs (s ', s3, w) = 0.09, Ptrs (s', s4, w) = 0.6, Ptrs (s ′, s5, w) = 1, Ptrs (s ′, s6, w) = 0.24, Ptrs (s ′, s7, w) = 0.25, Ptrs (S ′, s8, w) = 0.38 and Ptrs (s ′, s9, w) = 0.1.

Next, how to obtain Ptrbj (s ′, s) will be described. The displacement (dxbj, dybj) of the x-coordinate and y-coordinate when the attacking bullet of the enemy aircraft moves by the action unit time T according to the predetermined moving speed (Vxbj, Vybj) is
dxbj = Vxbj × T
dybj = Vybj × T
It is. The size of one side is the size of the enemy's attack bullet (the diameter of the circle inscribed in the shape of the enemy's attack bullet) and the size of your aircraft ( A new cell which is half the sum of the diameter of the circle inscribed in the shape of the own machine is newly created, and this cell is defined as a cell sdbj which has been translated by the displacement (dxbj, dybj). Let Ptrbj (s ′, s) be the ratio of the area where the cell sdbj and the cell s overlap to the total area of the cell s.

Finally, how to obtain Ptrii (s ′, s, a) will be described. The displacement (dxei, dyei) of the x coordinate and y coordinate when the enemy aircraft selects the movement speed number a and moves for the action unit time T is as follows:
dxei = Vxei (a) × T
dyei = Vyei (a) × T
It is. The size of one side is the size of the enemy aircraft (the diameter of the circle inscribed in the shape of the enemy aircraft) and the size of the own aircraft (the diameter of the circle inscribed in the own aircraft) at the center of the square s' where the enemy aircraft exists A new cell which is half the sum of the two is newly created, and this cell is defined as a cell sdei which has been translated by the displacement (dxei, dyei). Let Ptrei (s ′, s, a) be the ratio of the area where the cell sdei and the cell s overlap to the area of the entire cell s.

  Thus, the length of one side of the cell where the enemy aircraft is located and the length of one side of the cell sdei obtained by moving this cell by the amount of displacement (dxei, dyei) of the enemy aircraft are the size of the enemy aircraft. If the value is half of the sum of the diameter (the diameter of the circle inscribed in the shape of the enemy aircraft) and the size of the own aircraft (the diameter of the circle inscribed in the shape of the own aircraft), the enemy aircraft may destroy itself. The range that can be covered is substantially the same as the range covered by the mesh, and the contact between the enemy aircraft and the own aircraft can be more appropriately determined. It should be noted that the length of one side of the square sdbj obtained by moving the square where the enemy's attack bullet is located by the displacement (dxbj, dybj) of the enemy's attack bullet is the size of the enemy attack bullet (enemy The reason why the value of the sum of the diameter of the circle inscribed in the shape of the attack bullet) and the size of the own aircraft (diameter of the circle inscribed in the shape of the own aircraft) is the same.

[Modifications, etc.]
In the above embodiment, the behavior of the enemy aircraft is controlled by using the probability that the enemy aircraft destroys the enemy aircraft and the probability that the enemy aircraft destroys the enemy aircraft at each time t when the enemy aircraft moves according to the behavior a. However, instead of the probability, the index indicating the possibility that the enemy aircraft will destroy the enemy aircraft and the possibility that the own aircraft will destroy the enemy aircraft at each time t when the enemy aircraft moves according to a certain action a. Each of the indicators can be used. Even if an arbitrary index is used, the processing method of the action control of the enemy aircraft is the same as that in the above embodiment, except that this index is arbitrarily used instead of the probability.
The probability that an enemy aircraft destroys its own aircraft and the probability that its own aircraft destroys an enemy aircraft are an indication of the possibility that the enemy aircraft will destroy its own aircraft and the possibility that it will destroy the enemy aircraft Are normalized with respect to each index. Ps (t, s) used as the enemy aircraft's own aircraft destruction probability and Psx (t, s) used as the enemy aircraft's enemy destruction probability are an index representing the possibility that the enemy aircraft will destroy itself It is just an example of an indicator that represents the likelihood that a plane will destroy an enemy plane.

  For example, let f (r) be a function f that outputs a larger value as r increases. When the enemy aircraft moves according to each action a, the coordinates of the own aircraft and the coordinates of the enemy aircraft at each time t are calculated, and the distance r between the own aircraft and the enemy aircraft is obtained from these coordinates. Obtain the output of the function f (r). The smaller the distance between the own aircraft and the enemy aircraft, the higher the possibility that the own aircraft will be destroyed by contact. Therefore, the output value of the function f (r) is an index indicating the possibility that the enemy aircraft will destroy the own aircraft. It has become. The output value of this function f (r) may be used in place of the probability that the enemy aircraft will destroy itself at a certain time t when the enemy aircraft moves according to a certain action a.

  Further, when the enemy aircraft is located on its own line, the larger the distance r between itself and the enemy aircraft, the larger the value is output, and when the enemy aircraft is not located on its own line, the enemy aircraft Let g be a function that outputs a larger value as the distance from its own ray is smaller. The output value of the function g is an index indicating the possibility that the own aircraft will destroy the enemy aircraft at each time t when the enemy aircraft moves according to a certain action a. Obtain whether the enemy aircraft at each time t when moving according to each action a is located on its own line, the distance between itself and the enemy aircraft, and the distance of the enemy aircraft from its own line, The output value of the function g is calculated from these obtained values. The output value of the function g may be used instead of the probability that the enemy aircraft will destroy itself at a certain time t when the enemy aircraft moves according to a certain action a.

  In the above embodiment, the mixed value is F (t, s) = αPs (t, s) + βPsx (t, s) or F (t, a) = ΣsPei (t, s, a) (αPs (t, s) + βPsx (t, s)). However, the method of calculating the mixed value F by mixing the enemy aircraft destruction probability of the enemy aircraft and the enemy aircraft destruction probability of the enemy aircraft by the enemy aircraft mixture parameter according to the enemy aircraft mixture parameter is not limited to the above. For example, by using 1-α instead of the enemy aircraft behavior parameter β, it becomes possible to control the behavior of the enemy aircraft with one enemy aircraft behavior parameter α.

Further, the functions f ₁ , f ₂ , f ₃ , and f ₄ are assumed to be monotonically increasing functions in the range [0, ∞], and mixed values F ′ (t, s), F ″ (t , S), F ′ (t, a), F ″ (t, a) may be used to implement the present invention.
F ′ (t, s) = αf ₁ (Ps (t, s)) + βf ₂ (Psx (t, s))
F ″ (t, s) = f ₃ (Ps (t, s)) ^α f ₄ (Psx (t, s)) ^β
F ′ (t, a) = Σ _s Pei (t, s, a) (αf ₁ (Ps (t, s)) + βf ₂ (Psx (t, s)))
F ″ (t, a) = Σ _s Pei (t, s, a) (f ₃ (Ps (t, s)) ^α f ₄ (Psx (t, s)) ^β )

That is, for example, the enemy aircraft destruction probability (Ps (t, s)) input to the first monotonically increasing function f ₁ that outputs a non-negative value and the enemy aircraft destruction probability (Psx ( t, s)) is a mixed value F ′ (t, s) by calculating a value obtained by weighting and adding the value input to the second monotonically increasing function f ₂ that outputs a non-negative value with the enemy aircraft action parameter. May be calculated. Further, for example, a value obtained by raising the value input to the first monotonically increasing function f ₁ that outputs a non-negative value of the enemy aircraft destruction probability (Ps (t, s)) by the enemy aircraft action parameter α, A value obtained by multiplying the value input to the second monotonically increasing function f ₂ that outputs a non-negative value by the enemy aircraft action parameter β is multiplied by the enemy aircraft destruction probability (Psx (t, s)). The mixed value F ″ (t, s) may be obtained by calculation. As described above, a method for obtaining the mixed value by mixing the enemy aircraft destruction probability of the enemy aircraft and the enemy aircraft destruction probability using the enemy aircraft action parameters is arbitrary.

  As shown by broken lines in FIGS. 1 and 2, enemy aircraft behavior parameter input means 51 may be provided so that a person who implements the present invention can input enemy aircraft behavior parameters. The enemy aircraft behavior parameters input by the enemy aircraft behavior parameter input means 51 are stored in the storage unit 21 of the mixed value calculator 2, and the enemy aircraft behavior control according to the present invention is performed based on the enemy aircraft behavior parameters. As the enemy aircraft behavior parameter input means 51, a pointing device such as a mouse or keypad, or a keyboard can be used. By allowing the enemy aircraft behavior parameters to be freely set, there is an advantageous effect that the convenience of the present invention is increased.

  In the embodiment described above, Ps (t, s), which is an example of the enemy aircraft's own existence probability, and the enemy aircraft's existence probability, before performing the process for determining the behavior of the enemy aircraft in step S1 and subsequent steps. It is assumed that Psx (t, s) as an example and enemy aircraft position sei (t, a) are calculated in advance and stored in predetermined storage means (step S0). However, it is not always necessary to calculate all of these probabilities and positions before the processing. That is, the calculation of these probabilities and the processing after step S1 may be performed in parallel.

  In the above embodiment, in the processing of the adding unit 3, the sum of all the times t = nT (n = 1,..., N) is taken for the mixed values F (t, s) and F (t, a). . However, a sum may be taken for a part of time t = nT. The calculation burden can be reduced by taking the sum of only some times and selecting the action (movement speed number) that maximizes the sum.

In the above embodiment, it is assumed that when a movement speed number a is selected as an action of an enemy aircraft, the movement according to the movement speed number a is repeated at each time t = nT. However, an action of moving according to a different moving speed number a at each time t may be defined as each action. For example, the moving speed number that the enemy aircraft can take at each time t is three from 1 to 3, and the number of search steps is N = 3. At this time, as shown in FIG. 13, there are 3 ³ = 27 actions. In FIG. 13, action 1 means moving according to moving speed number 1 at time t = T, moving according to moving speed number 1 at time t = 2T, and moving according to moving speed number 1 at time t = 3T. . Action 2 means moving according to moving speed number 1 at time t = T, moving according to moving speed number 2 at time t = 2T, and moving according to moving speed number 2 at time t = 3T. The same applies to other actions, and the action of the enemy aircraft is to move at the time t = nT (n = 1,..., 3) at the respective times t = nT (n = 1,..., 3). Means. Even in the case where 27 actions are defined in this way, in the same manner as in the above-described embodiment, the above-described mixed value when the enemy aircraft takes each action is calculated, and the sum of the mixed values with respect to time is calculated. Select the action that you want to maximize, and control the enemy aircraft based on that action.

Further, instead of the movement speed number, an action may be defined using an acceleration number. That is, the enemy aircraft can select one acceleration number a ₁ ∈A ₁ from A ₁ types of acceleration numbers at each time, and when the enemy aircraft selects an action a ₁ , The enemy aircraft moves at all times t = nT (1,..., N) according to accelerations (Ax (a ₁ ), Ay (a ₁ )) determined in advance corresponding to the acceleration number a _1. An action may be defined. Further, in the same manner as described above with reference to FIG. 13, at each time t = nT, may be defined as actions each operation of moving according to different acceleration numbers a _1. Even in the case of using an acceleration number, in the same manner as in the above-described embodiment, the above-described mixed value when the enemy aircraft takes each action is calculated, and the action that maximizes the mixed value is selected, Control enemy aircraft based on their actions. Note that the concept of acceleration includes angular acceleration. Further, the concept of the speed includes an angular speed. That is, the same processing may be performed using the angular velocity number instead of the moving velocity number.

The present invention can be applied not only to a two-dimensional shooting game but also to a three-dimensional shooting game.
The above modifications can be combined as appropriate.
In addition, the enemy machine operation control apparatus and method for the shooting game can be realized by a computer. In this case, the content of the enemy aircraft motion control device and method of the shooting game is described by a program. Then, by executing this program on a computer as shown in FIG. 14, the functions of the respective units of the enemy machine operation control device of the 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 provided 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 enemy machine operation control apparatus and method of the shooting game are 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.
In addition to the above embodiments, the enemy aircraft operation control method, method, program, and recording medium thereof for the shooting game according to the present invention are not limited to the above-described embodiments, and do not depart from the spirit of the present invention. Changes can be made as appropriate.

The figure which illustrated the functional composition of enemy machine action control device 1000 by a first embodiment of the present invention. The figure which illustrated the functional composition of enemy machine action control device 1001 by a second embodiment of the present invention. The figure which illustrated the flow of processing of enemy machine action control device 1000 by a first embodiment of the present invention. The figure which illustrated the specific process of step S1. A schematic diagram of a shooting game. The figure showing the example which changes the value of an enemy aircraft action parameter according to the positional relationship of an enemy aircraft and an own machine. The figure showing the example which changes the value of an enemy aircraft action parameter according to the positional relationship of an enemy aircraft and an own machine. The figure which illustrated the functional composition of enemy machine action parameter deciding part 5. The figure which illustrated the functional composition of self-machine existence probability calculation part 6. The figure which illustrated the functional structure of the enemy machine attack bullet presence probability calculation part. The figure which illustrated the functional composition of enemy machine existence probability calculation part 8. The figure which assists the description about calculation of existence probability. The figure showing the example of the action which takes a different movement speed number for every time t. The figure which illustrated the functional structure in the case of performing the enemy aircraft action control apparatus by this invention by a computer.

Claims (12)

A computer including a mixed value calculating means, an adding means, an enemy aircraft action determining means, and a storage unit is an enemy aircraft action control method for controlling the action of an enemy aircraft,
It is assumed that the enemy aircraft moves according to A (A is an arbitrary natural number) type of action a (a = 1,..., A), and the time t at which the enemy aircraft starts moving by the selected action is t = 0. When the enemy aircraft moves according to the action a, the index indicating the possibility that the enemy aircraft at time t = nT destroys the own aircraft is the position where the enemy aircraft moving according to the action a exists at time t = nT. The probability that the own aircraft at time t = nT exists and the enemy aircraft moves according to action a is an indicator that indicates the possibility that the own aircraft at time t = nT destroys the enemy aircraft. Is the probability that the enemy aircraft is located on the ray of the own aircraft at time t = nT, and an index indicating the possibility that the enemy aircraft at time t = nT destroys the own aircraft and the own aircraft are enemy aircraft The index indicating the possibility of destroying is stored in the storage unit Cage,
The above-mentioned mixed value calculation means determines that the enemy aircraft has all the combinations of the action a of the enemy aircraft and the time t = nT (T is the action unit time, n = 1,..., N, N are arbitrary natural numbers). When moving according to the action a, an index indicating the possibility that the enemy aircraft at time t read from the storage unit will destroy the own aircraft and an index indicating the possibility that the own aircraft will destroy the enemy aircraft are determined in advance. A mixed value calculation step for calculating a mixed value that is a mixed value using the enemy aircraft behavior parameters;
An adding step in which the adding means obtains a value obtained by adding the mixed values at all or some of the times t when the enemy aircraft moves according to the action a for each action a of the enemy aircraft;
The enemy action determining means, the action a of the enemy machine that maximizes the value obtained by the adding, the enemy action determining step of an action of the enemy machine,
An enemy aircraft behavior control method. The enemy aircraft behavior control method according to claim 1,
The enemy aircraft behavior parameters consist of two parameters, α and β (α and β are arbitrary real numbers, respectively)
The above-mentioned mixed value is a value obtained by adding a value obtained by multiplying an index indicating the possibility that an enemy aircraft will destroy its own aircraft and a value obtained by multiplying an index indicating the possibility that the own aircraft will destroy the enemy aircraft by β. Is,
An enemy aircraft behavior control method characterized by that. The enemy aircraft behavior control method according to claim 1,
The enemy aircraft behavior parameters consist of two parameters, α and β (α and β are arbitrary real numbers, respectively)
The above mixed value is obtained by multiplying the output value when α is input to the first monotonically increasing function that outputs a non-negative value as an index indicating the possibility that the enemy aircraft will destroy itself, It is a value obtained by adding an output value obtained by multiplying the output value when β is input to the second monotonically increasing function that outputs a non-negative value, an index indicating the possibility of destroying the machine,
An enemy aircraft behavior control method characterized by that. The enemy aircraft behavior control method according to claim 1,
The enemy aircraft behavior parameters consist of two parameters, α and β (α and β are arbitrary real numbers, respectively)
The above mixed value is obtained by multiplying the first monotonically increasing function that outputs a non-negative value by an index indicating the possibility that an enemy aircraft may destroy itself, Is a value obtained by multiplying the output value when the index representing the possibility of destroying the second monotonically increasing function that outputs a non-negative value is multiplied by the β power,
An enemy aircraft behavior control method characterized by that. The enemy aircraft behavior control method according to any one of claims 1 to 4,
The computer further comprises input means,
The input means further includes an input step of receiving input of enemy aircraft behavior parameters;
The mixed value calculation step is a step of calculating the mixed value using an enemy aircraft behavior parameter input from the input means instead of the predetermined enemy aircraft behavior parameter.
An enemy aircraft behavior control method characterized by that. It is assumed that the enemy aircraft moves according to A (A is an arbitrary natural number) type of action a (a = 1,..., A), and the time t at which the enemy aircraft starts moving by the selected action is t = 0. When the enemy aircraft moves according to the action a, the index indicating the possibility that the enemy aircraft at time t = nT destroys the own aircraft is the position where the enemy aircraft moving according to the action a exists at time t = nT. The probability that the own aircraft at time t = nT exists and the enemy aircraft moves according to action a is an indicator that indicates the possibility that the own aircraft at time t = nT destroys the enemy aircraft. Is the probability that the enemy aircraft is located on the ray of the own aircraft at time t = nT, and an index indicating the possibility that the enemy aircraft at time t = nT destroys the own aircraft and the own aircraft are enemy aircraft The index indicating the possibility of destroying ,
When the enemy aircraft moves according to the action a for all combinations of the action a of the enemy aircraft and the time t = nT (T is the action unit time, n = 1,..., N, N are arbitrary natural numbers). , An index indicating the possibility that the enemy aircraft at time t read from the storage unit will destroy the enemy aircraft and an index indicating the possibility that the enemy aircraft will destroy the enemy aircraft using the predetermined enemy aircraft behavior parameters A mixed value calculation means for calculating a mixed value that is a mixed value;
An adding means for obtaining, for each action a of the enemy aircraft, a value obtained by adding the above mixed values at all or some of the times t when the enemy aircraft moves according to the action a;
Enemy aircraft action determination means for setting the action a of the enemy aircraft that maximizes the added value as the action of the enemy aircraft;
Enemy aircraft behavior control device. It is assumed that the enemy aircraft moves according to A (A is an arbitrary natural number) type of action a (a = 1,..., A), and the time t at which the enemy aircraft starts moving by the selected action is t = 0. When the enemy aircraft moves according to the action a, the index indicating the possibility that the enemy aircraft at time t = nT destroys the own aircraft is the position where the enemy aircraft moving according to the action a exists at time t = nT. The probability that the own aircraft at time t = nT exists and the enemy aircraft moves according to action a is an indicator that indicates the possibility that the own aircraft at time t = nT destroys the enemy aircraft. Is the probability that the enemy aircraft is located on the ray of the own aircraft at time t = nT, and an index indicating the possibility that the enemy aircraft at time t = nT destroys the own aircraft and the own aircraft are enemy aircraft The index indicating the possibility of destroying ,
When the enemy aircraft moves according to the action a for all combinations of the action a of the enemy aircraft and the time t = nT (T is the action unit time, n = 1,..., N, N are arbitrary natural numbers). , An index indicating the possibility that the enemy aircraft at time t read from the storage unit will destroy the enemy aircraft and an index indicating the possibility that the enemy aircraft will destroy the enemy aircraft using the predetermined enemy aircraft behavior parameters A mixed value calculation step for calculating a mixed value which is a mixed value;
An addition step for obtaining, for each action a of the enemy aircraft, a value obtained by adding the above mixed values at all or some of the times t when the enemy aircraft moves according to the action a;
An enemy aircraft action determination step in which the action a of the enemy aircraft that maximizes the added value is the action of the enemy aircraft;
Enemy aircraft action control program to make the computer execute.   In the enemy aircraft behavior control program according to claim 7,
  The enemy aircraft behavior parameters consist of two parameters, α and β (α and β are arbitrary real numbers, respectively)
  The above-mentioned mixed value is a value obtained by adding a value obtained by multiplying an index indicating the possibility that an enemy aircraft will destroy its own aircraft and a value obtained by multiplying an index indicating the possibility that the own aircraft will destroy the enemy aircraft by β. Is,
  Enemy aircraft behavior control program characterized by that.   In the enemy aircraft behavior control program according to claim 7,
  The enemy aircraft behavior parameters consist of two parameters, α and β (α and β are arbitrary real numbers, respectively)
  The above mixed value is obtained by multiplying the output value when α is input to the first monotonically increasing function that outputs a non-negative value as an index indicating the possibility that the enemy aircraft will destroy itself, It is a value obtained by adding an output value obtained by multiplying the output value when β is input to the second monotonically increasing function that outputs a non-negative value, an index indicating the possibility of destroying the machine,
  Enemy aircraft behavior control program characterized by that.   In the enemy aircraft behavior control program according to claim 7,
  The enemy aircraft behavior parameters consist of two parameters, α and β (α and β are arbitrary real numbers, respectively)
The above mixed value is obtained by multiplying the first monotonically increasing function that outputs a non-negative value by an index indicating the possibility that an enemy aircraft may destroy itself, Is a value obtained by multiplying the output value when the index representing the possibility of destroying the second monotonically increasing function that outputs a non-negative value is multiplied by the β power,
  Enemy aircraft behavior control program characterized by that.   The enemy aircraft behavior control program according to any one of claims 7 to 10,
  An enemy aircraft behavior control program for causing the computer to further execute an input step for accepting input of enemy aircraft behavior parameters,
  The mixed value calculation step is a step of calculating the mixed value using the enemy aircraft behavior parameter input in the input step instead of the predetermined enemy aircraft behavior parameter.
  Enemy aircraft action control program. An enemy aircraft behavior control program recording medium in which the enemy aircraft behavior control program according to claim 7 is recorded so as to be readable by a computer.

Images