JP4804224B2 - Shooting game processing method, apparatus thereof, program thereof, and recording medium thereof - Google Patents

Description

  The present invention displays an own aircraft and an enemy aircraft on a screen, and performs an operation of moving the aircraft for a predetermined time (hereinafter referred to as behavior unit time T) by W types of actions to attack the aircraft. The present invention relates to a processing method, a device, a program, and a recording medium of a shooting game for fighting an enemy aircraft.

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.
In addition, in a non-action thinking game such as chess, othello, and shogi, research on algorithms incorporating artificial intelligence technology has been conducted (for example, see Non-Patent Document 1).
Jonathan Schaeffer, H. Jaap van den Herik, “Games, computers, and artificial intelligence”, Artificial Intelligence, 2002, Vol. 134, p1-7

However, the behavior control algorithm of the enemy aircraft according to the prior art is limited to a simple one. 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.
Also, since it was not possible to automatically update the enemy attack bullet firing algorithm taking into account the traps of each player's own operation, once the user became proficient in the game, the user immediately entered the game. There was a problem of getting bored.

In order to solve such problems, it is considered effective to introduce artificial intelligence technology, but currently research on games in artificial intelligence is centered on non-action thinking games such as chess, othello and shogi. There was no attempt to apply artificial intelligence technology to action games like shooting games.
Also, research on artificial intelligence technology for solving thinking games such as chess, othello, and shogi has concentrated on the development of methods for efficiently performing deep search calculations (see, for example, Non-Patent Document 1). Of course, even in shooting games, search technology is important to develop intelligent enemy aircraft operation algorithms. However, in the shooting game, the demand for the depth of search is low. Rather, how to achieve the level of real time required in the action game is important. However, there was no technology that could meet such requirements.

  Furthermore, it is premised that there are a plurality of enemy aircraft in the shooting game, and there is a demand for a function that allows a plurality of enemy aircraft to drive their own aircraft in cooperation. However, the algorithm for controlling such cooperation is not sufficient for the central control that monitors the movement of all enemy aircraft. 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 takes all these situations into consideration.

According to the present invention, the own aircraft and the enemy aircraft are displayed on the screen, and the own aircraft is moved for a predetermined time (hereinafter referred to as behavior unit time T) by the W types of behavior w. In a shooting game that fights enemy aircraft that attack the machine, the machine's own safe action pattern calculation means moves to the position (Xw, Yw) after the action unit time T has elapsed by selecting the action w. The probability Pm (Xw, Yw) is obtained. The position (Xw, Yw) after the elapse of the action unit time T when the own machine selects the action w and the elapse of the action unit time T when the enemy machine selects the action k. For each combination with the subsequent position (Xk, Yk), the own machine shooting probability P (Xw, Yw, Xk, Yk) is calculated. For each action w of the own machine, the accumulating means determines the position (after the elapse of the action unit time T by the own machine shooting probability P (Xw, Yw, Xk, Yk) and the own machine selecting each action w ( The product P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) with the probability Pm (Xw, Yw) of moving to Xw, Yw) is obtained. The addition means adds the P (Xw, Yw, Xk, Yk) and Pm (Xw, Yw) obtained in the integration process for all the actions w of the own aircraft, so that the enemy aircraft selects the action k. The sum Σ _w P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) of the own machine shooting probability is determined. The maximum value judging means obtains the action k of the enemy aircraft that maximizes the above-mentioned Σ _w P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) obtained in the addition process. k is determined.

  According to the present invention, the enemy aircraft advances and moves to a position where there are few attack bullets from the enemy aircraft, and as a result, the enemy aircraft is easily surrounded by enemy aircraft attacks. In addition, the attack of enemy aircraft in the shooting game becomes more intelligent based on the cooperation between enemy aircraft, and the formation pattern when attacking bullets are diversified. As a result, it is possible to realize a shooting game with improved game characteristics.

[Theoretical background]
FIG. 5 illustrates a shooting game. FIG. 5 is a schematic diagram showing a shooting game screen. On the screen, the own machine 1 and the attack bullet 3 of the own machine 1, and the enemy machine 2 and the attack bullet 4 of the enemy machine 2 are displayed. The position on the screen is represented by orthogonal X coordinates / Y coordinates. There may be a plurality of attack bullets 3, enemy aircraft 2, and attack bullets 4. The user operates the own aircraft 1 to fight the enemy aircraft 2. The user can move only by the action unit time T at W speeds (direction and speed) in one operation. Each action based on the W types of speed is represented by w (w = {0,..., W−1}). In addition, at the same time as moving at the W speeds, an operation of firing an attack bullet 3 for attacking the enemy aircraft 2 can be performed.

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 aircrafts 2 are destroyed by the attack bullet 3 of the own device 1, the user wins the game.
In such a shooting game, in order to drive the own aircraft 1 efficiently, the destination (future position) of the own aircraft is predicted, and the enemy aircraft 2 is placed at a position where it is easy to shoot down the own aircraft that has moved to the destination. It is good to move. Here, it is assumed that the enemy aircraft can act at K types of speeds (direction and speed), and each of the K types of behaviors is k (k = 0,..., K−1). In the following, it will be described how an enemy aircraft predicts its destination (future position) and selects an action k that moves to a position where it can easily shoot down its own aircraft. . First, how to determine the movement probability Pm of the own aircraft will be described, and then how to determine the own aircraft shooting probability and the method of selecting the action k will be described.

<How to determine the movement probability of your aircraft>
It is considered that the user moves his / her own device to a position where the possibility that the own device is destroyed is the smallest in each operation. For this reason, in the present invention, for example, the future position of the own aircraft is obtained probabilistically as follows.
With respect to all the action patterns that the machine can take by performing the movement operation at the W speeds a predetermined number of times (D times), that is, at each depth d (d = {1,..., D}) For all the action patterns that the aircraft can take by performing the movement operation at the speed of, check whether the aircraft is destroyed by the attacking bullets of the enemy aircraft. Among all action patterns, an action pattern in which the aircraft is not destroyed by an attack bullet is defined as a safe action pattern. Conversely, a behavior pattern in which the aircraft is destroyed by an attack bullet is defined as a death behavior pattern. Between all behavior patterns, safety behavior patterns, and death behavior patterns, there is a relationship that the total number of behavior patterns = the total number of safety behavior patterns + the total number of death behavior patterns.

Here, w (w = {0,..., W−1}) is one of the W types of operations, and S (w) is the number of safe action patterns when action w is taken at d = 1. The total number of safety behavior patterns is ΣS (w). At the depth d = 1, the number of safety action patterns S (w) when each operation w is performed is counted, and the number of safety action patterns S (w) obtained for each operation w is calculated as the total number of safety action patterns ΣS ( The value divided by w) can be considered as the probability that the own device performs the operation w.
For example, consider the case where W = 3 and D = 3, and as shown in FIG. 6, a collision occurs at * 1, * 2, * 3. In FIG. 6, a solid line represents a trajectory drawn by the own device when an action of w = 0 is selected at each depth d. A broken line represents a trajectory drawn by the own device when an action of w = 1 is selected at each depth d. A one-dot chain line represents a trajectory drawn by the own device when an action of w = 2 is selected at each depth d. A pattern with a circle at the end of a branch is a safe behavior pattern, and a pattern with a cross at the end of a branch is a death behavior pattern.

Here, the total number of behavior patterns is W ^D = 3 ³ = 27. The total number of safety behavior patterns ΣS (w) is 14, and the total number of death behavior patterns is 13. The safety action pattern number S (0) is 6 when the action of w = 0 is selected at d = 1. The safety action pattern number S (1) is 8 when the action of w = 1 is selected at d = 1. The safety action pattern number S (2) is 0 when the action of w = 2 is selected at d = 1. Therefore, the probability of selecting the action of w = 0 at d = 1 can be obtained as (S (0) / ΣS (w)) = (6/14) = 0.428. Similarly, the probability of selecting the action of w = 1 at d = 1 can be obtained as (S (1) / ΣS (w)) = (8/14) = 0.571. Similarly, the probability of selecting an action with w = 2 at d = 1 can be obtained as (S (2) / ΣS (w)) = (0/14) = 0.

Here, when d = 1 and the probability that the own device is located at (Xw, Yw) after the behavior unit time T has elapsed as a result of selecting the behavior w by the own device is Pm (Xw, Yw), in the above example, The probability Pm (X1, Y1) that the own device moves to (X1, Y1) is 0.428 ..., the probability Pm (X2, Y2) that the own device moves to (X2, Y2) is 0.571, ... The probability Pm (X3, Y3) of moving to (X3, Y3) can be obtained as 0.
In the present invention, for example, the future position of the own device is predicted probabilistically in this way.
In the embodiment described below, the number of safe behavior patterns or the number of death behavior patterns is calculated by so-called vertical search. This is because the memory can be efficiently used by the vertical search. The vertical search is a procedure for searching with priority on child nodes. For example, when D = 3 and W = 3, as shown in FIG. This is a method of searching for a route. In the embodiment described below, when a collision occurs, the route after the location where the collision occurs is not searched. For example, when a collision occurs in * 1 (route 6), the routes 7-9 are not searched. In this case, after the route 6 is searched for and a collision occurs, the route 10 is searched (the explanation of <How to determine the movement probability of the own aircraft> ends).

<How to determine your own shooting probability and how to select action k>
When the distance between the enemy aircraft and the enemy aircraft is r, the potential probability P that the enemy aircraft shoots down the aircraft with an attack bullet is
P = Aexp (−ar) (1)
It is thought that it is given by. Here, A and a are positive constants. For example, the sum of the enemy bullet size is S, the screen length is L, U is 0.1 to 0.5, A is 1.0 to 0.8, a is
a = U × (L / S) ^−1.5
Then, from experience, it is possible to obtain a highly accurate self-shooting probability P. More specifically, for example, the game screen is 600 pixels long and 400 pixels wide, the shape of the aircraft is 32 × 32 pixels, and the size of the enemy's attack bullet is 4 pixels. At this time, it is preferable that A = 1.0 to 0.8 and a = 0.001 to 0.01.

According to the above equation (1), the potential probability P that an enemy aircraft shoots down its own aircraft with an attacking bullet is exponential as the distance r between the enemy aircraft and its own aircraft becomes smaller, as shown in FIG. To rise. Conversely, the potential probability P that an enemy aircraft shoots down its own aircraft with an attacking bullet decreases exponentially as the distance r between the enemy aircraft and its own aircraft increases.
After the action unit time T has elapsed, an enemy aircraft located in the result (Xk, Yk) of selecting the action k can potentially shoot down its own aircraft located in the result (Xw, Yw) of selecting the action w. The probability P (Xw, Yw, Xk, Yk) is the probability that the own device will select the action of w, that is, the probability Pm (Xw, Yw) that the own device is located at (Xw, Yw) after the action unit time T has elapsed. )
P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) (2)
Given in. P (Xw, Yw, Xk, Yk) can be obtained by calculating the above equation (1). Further, Pm (Xw, Yw) can be obtained by using the method described in <How to obtain the movement probability of own device>.

When the above equation (2) is summed for all the actions w = 0,..., W−1 of the own aircraft, the own shooting probability Σ _w P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) can be obtained.
If the enemy aircraft selects an action k that maximizes the above-mentioned shooting down probability Σ _w P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw), the enemy aircraft As a result, the player's own aircraft is likely to be surrounded by enemy attacks, and the game is more tense (<How to determine the probability of shooting yourself and how to select action k>). ).

[Embodiment]
A shooting game processing apparatus 1000 for implementing a shooting game apparatus according to the present invention will be described with reference to FIGS. FIG. 1 is a diagram illustrating a functional configuration example of the shooting game processing apparatus 1000. FIG. 3 is a diagram illustrating processing of the shooting game processing apparatus 1000.
The shooting game processing apparatus 1000 includes, for example, an enemy aircraft action control unit 200 and a display unit 300.

The enemy aircraft action control unit 200 includes, for example, an own machine safe action pattern calculation unit 10, an own machine shooting probability calculation unit 20, and an action determination unit 30.
For example, as shown in FIG. 2, the own machine safety action pattern calculation unit 10 includes an own machine movement pattern generation unit 11, an attack bullet position estimation unit 12, a collision determination unit 13, an own machine action probability calculation unit 14, and own machine movement. It comprises a pattern buffer 15 and an enemy aircraft attack bullet state buffer 16. The own device movement pattern generation unit 11 includes, for example, an initialization unit 111, a control unit 112, a buffer 113, a position update unit 114, a storage unit 115, and a position acquisition unit 116. The attack bullet position estimation unit 12 includes, for example, a storage unit 121 and a position acquisition unit 122. The own-machine action probability calculation unit 14 includes a survival movement pattern count unit 141 and a probability calculation unit 142.
The own shooting down probability calculation unit 20 includes a position calculation unit 21, a distance calculation unit 22, a storage unit 23, and a probability calculation unit 24.
The action determination unit 30 includes an integration unit 31, an addition unit 32, a maximum value determination unit 33, and a position calculation unit 34.

<Preparation>
Number of actions of own machine (depth of search) D, number W of kinds of actions w that can be taken by own machine, speed (Vxw, Vyw) of own machine when taking each action w, and unit time T of action It is assumed that it is set in advance and stored in the storage unit 115 of the own device movement pattern generation unit.

For example, D = 5 and W = 9 can be set. Further, as the speed (Vxw, Vyw) of the own device when taking each action w, for example, when W = 9, (Vx0, Vy0) = (0, 1), (Vx1, Vy1) = (1 , 1), (Vx2, Vy2) = (1, 0), (Vx3, Vy3) = (1, −1), (Vx4, Vy4) = (0, −1), (Vx5, Vy5) = (− 1, -1), (Vx6, Vy6) = (-1, 0), (Vx7, Vy7) = (-1, 1), (Vx8, Vy8) = (0, 0).
In addition, when the size of the action unit expressing the action of the own machine is assumed that the size of the own machine is not 0, an area that cannot be covered by the area where the own machine sweeps by movement does not occur in each depth of movement. It is important to accurately determine the strength of enemy aircraft. When quantifying the difficulty level, if there is an area that cannot be covered by the area where the aircraft sweeps due to movement, the difficulty level obtained does not take into account a part of the area where the aircraft can actually move This is because it cannot be said that it accurately represents the strength of the enemy. For this reason, when calculating the difficulty level more accurately, for example, a value obtained by dividing the diameter of a circle inscribed in the shape of the own machine by the speed of the own machine can be set as the action unit time T.

The number K of types of action k that the enemy aircraft can take, and the speed (Vxk, Vyk) of the enemy aircraft when the enemy aircraft takes action k are preset and stored in the storage unit 23 of the own shooting probability calculation unit 20. It is assumed that If the enemy aircraft can move in all directions of 360 degrees, for example, K = 360 can be set.
In the following, t is the elapsed time from the start of the action of the aircraft, the position of the k-th attack bullet fired by the enemy aircraft i is (Xbik (t), Ybik (t)), and the time t Let (Xs (t), Ys (t)) be the position of the own device. It is assumed that t is a discrete time for each processing unit time τ.

<Step S1>
The own machine safe action pattern calculation unit 10 moves to the position (Xw, Yw) after elapse of the action unit time T by the own machine selecting each action w, in other words, the own machine selecting each action w. The probability Pm (Xw, Yw) of calculating is calculated. The calculated Pm (Xw, Yw) is output to the action determining unit 30.
Details of step S1 will be described later.

<Step S2>
The own aircraft shooting probability calculation unit 20 determines that the enemy aircraft located at the position (Xk, Yk) after the enemy aircraft has acted for the behavior unit time T based on the behavior k for all combinations of w and k. Calculates a potential probability P (Xw, Yw, Xk, Yk) that can shoot down the aircraft located at the position (Xw, Yw) after acting for the action unit time T based on the action w.
Specifically, first, the position calculation unit 21 of the own machine shooting down probability calculation unit 20 obtains a position (Xk, Yk) after the enemy aircraft has acted for the action unit time T based on each action k. The movement speed (Vxk, Vyk) of the enemy aircraft when the action k is selected is read from the storage unit 23, and this is multiplied by T, and the displacement amount of the enemy aircraft when the enemy aircraft selects the action k (T × Vxk, T × Vyk). The position calculation unit 21 adds the displacement (T × Vxk, T × Vyk) to the current position (Xi, Yi) of the enemy aircraft, and the enemy aircraft position (Xk) when the enemy aircraft selects action k. , Yk). The position (Xk, Yk) of the enemy aircraft when the action k is selected is output to the distance calculation unit 22.

The distance calculation unit 22 determines the distance d between the position (Xk, Yk) of the enemy aircraft and the position (Xw, Yw) of the own aircraft when the own device read from the own device movement pattern buffer 15 selects the action w. (Xw, Yw, Xk, Yk) is calculated to obtain r in equation (1). Each of the calculated r = d (Xw, Yw, Xk, Yk) is output to the probability calculation unit 24.
The probability calculation unit 24 calculates Aexp (−ar) using A and a read from the storage unit 23 and r calculated by the distance calculation unit 22, so that the enemy aircraft can change the action unit based on the action k. An enemy aircraft located at a position (Xk, Yk) after acting only for time T shoots down the own aircraft located at a position (Xw, Yw) after acting for the action unit time T based on the action w. Calculate the potential probability P (Xw, Yw, Xk, Yk) that can be done. The calculated P (Xw, Yw, Xk, Yk) is output to the integrating unit 31 of the behavior determining unit 30.

<Step S3>
The accumulating unit 31 of the behavior determining unit 30 calculates the probability Pm (Xw, Yw) that the own device moves to the position (Xw, Yw) by selecting the behavior w calculated by the own device safe behavior pattern calculating unit 10; The product P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) of P (Xw, Yw, Xk, Yk) calculated by the probability calculation unit 24 of the own machine shooting down probability calculation unit 20 is calculated. That is, P (X1, Y1, Xk, Yk) · Pm (X1, Y1),..., P (XW, YW, Xk, Yk) · Pm (XW, YW) are calculated for all k. The calculation result is output to the adding unit 32.

<Step S4>
The adder 32 adds the values of P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) in all actions w of the own device. That is, by _{calculating ΣwεWP} (Xw, Yw, Xk, Yk) · Pm (Xw, Yw), the probability of shooting down the enemy when taking an action k is obtained. The calculation result is output to the maximum value determination unit 33.

<Step S5>
The maximum value determination unit 33 determines which action k gives the maximum value among _ΣwεWP (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) obtained for each action k. . K that gives the determined maximum value is output to the position calculator 34. The position calculation unit 34 updates the position of the enemy aircraft that acts for the action unit time T based on k giving the maximum value. The updated position of the enemy aircraft is output to the display unit 300.
By repeating the processes of steps S1 to S5 described above, a shooting game with improved game characteristics can be configured.

[Details of Step S1]
The process of step S1 includes the processes of step S1a to step S1o. Below, each process of step S1a-step S1o which comprises step S1 is demonstrated using FIG. 2 and FIG. FIG. 2 is a diagram illustrating a functional configuration of the own-machine safety behavior pattern calculation unit 10 that performs the process of step S1. FIG. 4 is a diagram illustrating the flow of each process S1a to step S1o in step S1.

<Step S1a>
The initialization unit 111 of the own device movement pattern generation unit 11 sets t = 0 and d = 1 and stores them in the buffer 113. The initialization unit 111 sets the current position of the own device acquired by the position acquisition unit 116 to the position (Xs (t), Ys (t)) of the own device at time t.
<Step S1b>
The control unit 112 of the own device movement pattern generation unit 11 sets W (d) = 0. W (d) is the number of the action k of the own device at the depth d = 1.

<Step S1c>
The control unit 112 of the own device movement pattern generation unit 11 stores the values of W (d) and (Xs (t), Ys (t)) in the own device movement pattern buffer 15 respectively.
In addition, the control unit 112 of the own aircraft movement pattern generation unit 11 stores the enemy aircraft attack bullet position (Xbik (t), Ybik (t)) at the time t in the enemy aircraft attack bullet state buffer 16.

<Step S1d>
The control unit 112 of the own device movement pattern generation unit 11 reads t from the buffer 113 and increments t. The incremented t is stored in the buffer 113. The increment width of t may be any value as long as it is a value smaller than the action unit time T, preferably a value that equally divides T. For example, when T is 0.3 seconds to 1 second, 0.03 seconds to 0.1 seconds, which is a time interval for equally dividing T, can be set to t.
In addition, the position update unit 114 of the own machine movement pattern generation unit 11 moves after the movement speed (Vx (W (d)), Vy (W (d)) of the own machine for the increment width of t. Specifically, the position updating unit 114 calculates (τ × Vx (W (d)), τ × Vy (W (d))), where t is the increment width. Then, the displacement of the position is obtained, and (Xs (t−τ), Ys (t−τ)) is added to this to update the position of the own device. The position of the machine, that is, the updated position of the own machine (Xs (t), Ys (t)) is output to the collision determination unit 13.

<Step S1e>
The attack bullet position estimation unit 12 updates the position of the attack bullet (Xbik (t), Ybik (t)). That is, the attack bullet position (Xbik (t), Ybik (t)) after the elapse of τ time is calculated.
Specifically, the velocity of the attack bullets (Vbikx (t), Vbiky (t)) stored in the storage unit 121 is read out and multiplied by τ to obtain the attack bullet before update acquired by the position acquisition unit 122. Is added to the position (Xbik (t−τ), Ybik (t−τ)) to obtain the updated position (Xbik (t), Ybik (t)) of the attacking bullet.
The updated attack bullet positions (Xbik (t), Ybik (t)) are stored in the storage unit 121. The updated attack bullet positions (Xbik (t), Ybik (t)) are output to the collision determination unit 13.
The updated attack bullet positions (Xbik (t), Ybik (t)) are output to the own movement pattern generation unit 11.

<Step S1f>
The collision determination unit 13 determines whether or not the own aircraft and the attack bullet have collided. Whether or not there is a collision is set in advance, the shape of the own aircraft, the shape of the attack bullets stored in the storage unit in the collision determination unit 13 (not shown), and the updated update output from the attack bullet position estimation unit 12 It is determined from the position of the attacking bullet (Xbik (t), Ybik (t)) and the updated position of the own aircraft (Xs (t), Ys (t)) output from the own aircraft movement pattern generation unit 11 . For example, when the shape of the own aircraft placed at the updated position and the shape of the attack bullet placed at the updated position overlap, it can be determined that the own aircraft and the attack bullet have collided.
When it is determined that there is no collision, a signal indicating that there is no collision is output to the own movement pattern generation unit 11. Then, the process of step S1g is performed.
If it is determined that there has been a collision, a signal indicating that there has been a collision is output to the own movement pattern generation unit 11. Then, the process of step S1l is performed.

<Step S1g>
The control unit 112 of the own movement pattern generation unit 11 that has received the signal that there is no collision determines whether or not the action unit time T has elapsed since step S3. That is, it is determined whether t read from the buffer 113 is larger than dT, that is, whether t ≧ dT.
If t <dT, the process returns to step S1d for processing. That is, the process of steps S1d to S1f is repeated until the action unit time T elapses from when t is step S1c. If t ≧ dT, the process of step S1h is performed next.

<Step S1h>
The control unit 112 of the own device movement pattern generation unit 11 increments d read from the buffer 113 by one. The incremented d is stored in the buffer 113.

<Step S1i>
The control unit 112 of the own device movement pattern generation unit 11 determines whether or not d read from the buffer 113 is greater than D stored and set in the storage unit 115 in advance. That is, it is determined whether D <d. In addition, D can be set to 5-10, for example.
When it is determined that D ≧ d, the control unit 112 returns to step S1b to perform processing.
If it is determined that D <d, a signal indicating that the action pattern is a safe action pattern is output to the own apparatus action probability calculation unit 14 and the process of step S1j is performed.

<Step S1j>
Upon receiving a signal indicating that the action pattern is a safe action pattern, the own machine action probability calculation unit 14 reads W (1) from the own machine movement pattern buffer 15, and which action w is selected at the depth d = 1. The number S (w) of receiving the above signal is counted for each action w at d = 1.
In step S1o, S (w) for each action w at d = 1 is continuously added until the processing flow of the shooting game difficulty level determination method according to the present embodiment is completed.

<Step S1k>
The control unit 112 of the own device movement pattern generation unit 11 decrements d read from the buffer 113 by one. The decremented d is stored in the buffer 113.

<Step S1l>
The control unit 112 of the own device movement pattern generation unit 11 sets t read from the buffer 113 to (d−1) T. (D-1) t set in T is stored in the buffer 113. Also, W (d) stored in own device movement pattern buffer 15 is read and incremented by one. The incremented W (d) is stored in the own movement pattern buffer 15.

<Step S1m>
The control unit 112 of the own device movement pattern generation unit 11 determines the magnitude relationship between W read from the storage unit 115 and W (d) read from the own device movement pattern buffer 15.
If W <W (d), the control unit 112 of the own movement pattern generation unit 11 performs the process of step S1o. If W ≧ W (d), the control unit 112 of the own device movement pattern generation unit 11 performs the process of step S1n.

<Step S1n>
The control unit 112 of the own aircraft movement pattern generation unit 11 reads the updated attack bullet positions (Xbik (t), Ybik (t)) from the enemy aircraft attack bullet state buffer 16. Then, the process of step S1c is performed.

<Step S1o>
If it is determined in step S1m that W <W (d), the control unit 112 of the own movement pattern generation unit 11 determines whether d = 1.
If it is determined that d ≠ 1, the process returns to step S1k.
When it is determined that d = 1, the control unit 112 outputs a signal indicating that the processing flow of the shooting game difficulty level determination method according to the present embodiment is completed to the own device action probability calculation unit 14. The surviving movement pattern count unit 141 of the own device action probability calculation unit 14 that has received the signal indicating that the processing flow has ended is the number of safe action patterns S (w) for each action w at the depth d = 1 added up to now. ) Is output to the probability calculation unit 142.

The probability calculation unit 142 calculates the probability Pm (Xw, Yw) that the own device selects the action w at the depth d = 1 from the number S (w) of safe action patterns for each action w at the depth d = 1. . Specifically, the probability calculation unit 142 calculates Pm (Xw, Yw) by calculating S (w) / ΣS (w). The calculated Pm (Xw, Yw) is output to the integrating unit 31 of the behavior determining unit 30.
The above is the detailed description of step S1.

[Modifications, etc.]
Modification 1
In the above embodiment, in step S1, the number of safe behavior patterns S (w) is calculated and the probability Pm (Xw, Yw) that the own device selects the behavior w is calculated. The probability Pm (Xw, Yw) that the own device selects the action w may be calculated by counting the number of the selected numbers.

  In this case, the own machine safe behavior pattern calculation unit 10 performs the process shown in FIG. In the processing shown in FIG. 9, the processing in step S1f ″, step S1j ′, and step S1i ′ is different from the processing shown in FIG. 4, and the processing in other steps is the same. Steps having the same processing are given the same step number and description thereof is omitted.

<Step S1f ''>
If the collision determination unit 13 determines that there is no collision, a signal indicating that there is no collision is output to the own movement pattern generation unit 11. Then, the process of step S1g is performed.
If it is determined that a collision has occurred, a signal indicating that there has been a collision is output to the own movement pattern generation unit 11 and the own action probability calculation unit 14. Thereafter, the process of step S1j ′ is performed.

<Step S1i '>
When the control unit 112 of the own device movement pattern generation unit 11 determines that D ≧ d, the control unit 112 returns to step S1b to perform processing.
When it is determined that D <d, the control unit 112 performs the process of step S1k.

<Step S14>
If it is determined in step S1f ″ that there has been a collision, the power calculation unit 143 of the own behavior probability calculation unit 14 reads d from the buffer 113 of the own device movement pattern generation unit 11 and the own device movement. The number of collisions W ^(D−d) is calculated using W and D read from the storage unit 115 read from the buffer 113 of the pattern generation unit 11. The calculated number of collisions W ^(D−d) is output to the collision counting unit 144.
The collision counting unit 144 continues to add the number of collisions W ^(D−d) calculated every time there is a collision until the process of step S1 ends. The collision counting unit 144 calculates the number of safe behavior patterns S (w) for each behavior w by subtracting the added number of collisions from the total number of behavior patterns WD ^-1 when the behavior w is taken. This is output to the probability calculation unit 142.

Modification 2
In addition, the W ^D number of all of the behavior patterns that are required to power the type W of behavior in the number D of action, respectively, player's aircraft and the opponent's aircraft, and, collision determine whether its own device and the attack bomb collide The safety action pattern number S (w) may be obtained by the collision counting unit 144 or the surviving movement pattern counting unit 141 counting the number of collisions or the number of times the collision is not performed by the unit 13.

Modification 3
Further, the processing according to the above embodiment may be performed assuming that the own device continues the current speed for a certain time Tc in the future. This is because the search calculation performed in step S1 can be performed substantially deeper. That is, when it is assumed that the current speed has continued for a certain time Tc in the future, the search for D = 5 in step S1 is substantially the same as the search for D = 6. Search can be performed. Also, it usually takes a time longer than the action unit time T to determine the action of the own machine after inputting the action, enemy enemy and attack bullets displayed on the screen. It is. Therefore, there is no problem even if the processing in step S1 is performed assuming that the current device continues the current speed for a certain time Tc in the future. Also, if the action selection timing of the own aircraft and the enemy aircraft is not the same, that is, even if the enemy aircraft is moving when the enemy aircraft selects an action, the own aircraft will keep the current speed constant in the future The enemy aircraft can select an action by performing the processing in the above embodiment assuming that the time Tc is continued.

In step S1a, the initialization unit 111 sets t = Tc in order to perform the processing in the above embodiment, assuming that the own device continues the current speed for a certain time Tc in the future. Also. The position acquired by the position acquisition unit 116 is added to the position obtained by multiplying the current speed of the own apparatus by a certain time Tc, and this is added to the position of the own apparatus at the time t = Tc (Xs (Tc), Ys (Tc) ).
In step S2, the own aircraft shooting probability calculation unit 20 determines that the enemy aircraft after the action unit time T is not the probability of shooting down the own machine after the action unit time T, but the enemy aircraft is T + Tc time based on the action k. The enemy aircraft located at the position (Xk, Yk) after moving only for a certain time Tc and then moving to the position (Xw, Yw) after moving for T time based on the action w A potential probability P (Xw, Yw, Xk, Yk) that can shoot down the aircraft is calculated. That is, the probability of shooting down the own aircraft is calculated on the basis of the positions of the enemy aircraft and the own aircraft that have moved extra for a certain time Tc.
Other processes are the same as those in the above embodiment.

Modification 4
The ray determining unit 25 of the probability calculating unit 24 of the own aircraft shooting probability calculating unit 20 determines whether or not the enemy aircraft is on the ray of the own aircraft, and if it is on the ray, P (Xw, Yw, Xk, Yk) can be set low. As a result, the enemy aircraft can behave so as to avoid its own line of sight, and the game performance is further increased.
For this purpose, first, the ray determination unit 25 of the probability calculation unit 24 of the own machine shooting probability calculation unit 20 selects the action w as the position (Xk, Yk) of the movement destination of the enemy aircraft that has selected the action k. It is determined whether or not it is on the ray of the aircraft located at (Xw, Yw). For example, when the aircraft fires an attack bullet in the Y-axis direction (upward on the screen), the absolute value d (Xk, Xw) of the difference between Xk and Xw is calculated, and the calculation result is a predetermined value. It is determined whether or not the value is smaller than a. As the predetermined value a, for example, a value obtained by adding a value that is half the width in the X-axis direction of the shape of the attack bullet that the aircraft fires to a value that is half the width in the X-axis direction of the enemy aircraft shape. Can be set.

In the case of d (Xk, Xw) <a, it can be considered that the enemy aircraft is destroyed by the attack bullet of its own aircraft, so the ray determination unit 25 performs the P ( Xw, Yw, Xk, Yk) are set low. The value of P (Xw, Yw, Xk, Yk) can be freely set according to the difficulty level required by the user. For example, in order to increase the difficulty level, the value of P (Xw, Yw, Xk, Yk) may be set lower. This is because if the value of P (Xw, Yw, Xk, Yk) is set lower, the enemy aircraft will act so as to avoid its own line of sight.
When d (Xk, Xw) ≧ a, the ray determining unit 25 does not change the value of P (Xw, Yw, Xk, Yk).

In addition, the processing function of the shooting game processing apparatus 1000 can be realized by a computer. In this case, the contents of the processing functions of the shooting game processing apparatus 1000 are described by a program. Then, by executing this program on a computer as shown in FIG. 10, the processing functions of the shooting game processing apparatus 1000 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 user terminal is configured by executing a predetermined program on the computer. However, at least a part of the processing contents may be realized by hardware.
In addition to the above-described embodiments, the shooting game processing method, the apparatus, the program, and the recording medium according to the present invention are not limited to the above-described embodiments, and may be changed as appropriate without departing from the spirit of the present invention. Is possible.

The figure which illustrated the function structure of the shooting game processing apparatus 1000. The figure which illustrated the functional structure of the own machine safe action pattern calculation part. The figure which illustrated processing of shooting game processing device 1000. The figure which illustrated the process of the own machine safe action pattern calculation part. A schematic diagram of a shooting game. The figure for demonstrating a safe action pattern and its counting method. The figure for demonstrating the method of a vertical search. The figure which illustrated the relationship between the distance r of the own machine and enemy machine, and the own machine shooting probability P. The figure which illustrated the process of the modification of the own machine safe action pattern calculation part. The figure which illustrated the functional composition when performing a shooting game processing device with a computer.

Explanation of symbols

1 Own aircraft 2 Enemy aircraft 3 Attack bullet 4 Attack bullet 5 CPU
6 RAM
DESCRIPTION OF SYMBOLS 7 Output part 8 Auxiliary memory part 9 Input part 9 'Bus 10 Own machine safe action pattern calculation part 11 Own machine movement pattern generation part 12 Attack bullet position estimation part 13 Collision judgment part 14 Own machine action probability calculation part 15 Own machine movement pattern Buffer 16 Enemy aircraft attack bullet state buffer 20 Own aircraft shooting probability calculation unit 21 Position calculation unit 22 Distance calculation unit 23 Storage unit 24 Probability calculation unit 25 Ray determination unit 30 Action determination unit 31 Integration unit 32 Addition unit 33 Maximum value determination unit 34 Position calculation unit 111 Initialization unit 112 Control unit 113 Buffer 114 Position update unit 115 Storage unit 116 Position acquisition unit 121 Storage unit 122 Position acquisition unit 141 Movement pattern count unit 142 Probability calculation unit 143 Power calculation unit 144 Collision count unit 200 Enemy aircraft Action control unit 300 Display unit 1000 Shooting game processing device

Claims (9)

A computer equipped with own machine safe behavior pattern calculating means, own machine shooting probability calculating means, integrating means, adding means, and maximum value judging means displays the own machine and enemy aircraft on the screen, and In a method of processing a shooting game for fighting an enemy aircraft that attacks an own aircraft by performing an operation of moving the vehicle by a predetermined time (hereinafter referred to as behavior unit time T) by W types of actions w,
The own machine safety action pattern calculation means obtains the probability Pm (Xw, Yw) of moving to the position (Xw, Yw) after the action unit time T elapses when the own machine selects each action w. Calculation process,
The position (Xw, Yw) after the elapse of the action unit time T when the own machine selects the action w and the elapse of the action unit time T when the enemy machine selects the action k. A self-shooting probability calculation process for calculating a self-shooting probability P (Xw, Yw, Xk, Yk) for each combination with a later position (Xk, Yk);
For each action w of the own machine, the accumulating means determines the position (after the elapse of the action unit time T by the own machine shooting probability P (Xw, Yw, Xk, Yk) and the own machine selecting each action w ( An integration process for obtaining a product P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) with a probability Pm (Xw, Yw) of moving to Xw, Yw);
The addition means adds the P (Xw, Yw, Xk, Yk) and Pm (Xw, Yw) obtained in the integration process for all the actions w of the own aircraft, so that the enemy aircraft selects the action k. The summation process for obtaining the sum Σ _w P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) of the self-shooting probability when
The maximum value judging means obtains the action k of the enemy aircraft that maximizes the above-mentioned Σ _w P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) obtained in the addition process. a maximum value determination process for determining k;
A shooting game processing method characterized by comprising: The shooting game processing method according to claim 1,
The above-mentioned own-machine safety action pattern calculation process assumes that an action pattern that is not destroyed by an enemy aircraft's attack bullets is a safety action pattern. Is a process of obtaining Pm (Xw, Yw) by dividing by the total number of
A method for processing a shooting game. In the shooting game processing method according to claim 1 or 2,
The self-shooting probability calculation process includes the movement destination position (Xw, Yw) when the own aircraft selects the action w, and the movement destination position (Xk, Yk) when the enemy aircraft selects the action k. If the distance of r is r, the self-shooting probability P (Xw, Yw, Xk, Yk) is calculated so that the self-shooting probability P (Xw, Yw, Xk, Yk) increases as r decreases. Including the process,
A method for processing a shooting game. In the shooting game processing method according to any one of claims 1 to 3,
The value obtained by dividing the diameter of a circle inscribed in the shape of the aircraft by the speed of the aircraft is the action unit time T.
A method for processing a shooting game. The shooting game processing method according to any one of claims 1 to 4,
The above-mentioned own-machine safety action pattern calculation process includes the probability Pm (Xw, Xw, Yw),
In the self-shooting probability calculation process, the position (Xw, Yw) after the action unit time T of the own machine that has selected the action w after the own machine continues the current speed of the own position for a certain time Tc in the future. ) And the position (Xk, Yk) after the elapse of the unit time T + the predetermined time Tc when the enemy aircraft selects the action k, the own shooting probability P (Xw, Yw, Xk, Yk) Is the process of calculating
A method for processing a shooting game. In the shooting game processing method according to any one of claims 1 to 5,
The position (Xk, Yk) after the action unit time T when the enemy aircraft selects the action k is the position (Xw, Yw) after the action unit time T when the own machine selects the action w. And a ray determination process for determining whether or not it is on the ray of the own aircraft located at
In the self-shooting probability calculation process, when it is determined by the ray determination process that it is on the ray, the self-shooting probability is reduced so that the self- shooting probability P (Xw, Yw, Xk, Yk) is reduced. Including calculating the probability P (Xw, Yw, Xk, Yk) ,
A method for processing a shooting game. Display your own aircraft and enemy aircraft on the screen, perform an operation to move your aircraft for a predetermined time (hereinafter referred to as behavioral unit time T) by W types of actions w, and attack your own aircraft In a shooting game that fights incoming enemy aircraft,
Own machine safe action pattern calculating means for obtaining a probability Pm (Xw, Yw) of moving to the position (Xw, Yw) after the action unit time T has elapsed by selecting each action w;
Position (Xw, Yw) after the elapse of the action unit time T when the own aircraft has selected the action w, and position (Xk, Yk) after the elapse of the action unit time T when the enemy aircraft has selected the action k A self-shooting probability calculation means for calculating a self-shooting probability P (Xw, Yw, Xk, Yk) for each combination with
For each action w of the own machine, the position (Xw, Yw) after elapse of the action unit time T by the own machine shooting probability P (Xw, Yw, Xk, Yk) and the own machine selecting each action w Integration means for obtaining a product P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) with a probability Pm (Xw, Yw) of moving to
By adding the P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) obtained by the integrating means for all the actions w of the own aircraft, the enemy aircraft selects the action k. An adding means for obtaining a sum 機_w P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) of the machine shooting probability;
The maximum value for determining the action k of the enemy aircraft by obtaining the action k of the enemy aircraft that maximizes the above-described Σ _w P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) obtained by the adding means. A determination means;
A shooting game processing apparatus comprising: Display your own aircraft and enemy aircraft on the screen, perform an operation to move your aircraft for a predetermined time (hereinafter referred to as behavioral unit time T) by W types of actions w, and attack your own aircraft In a program that processes a shooting game that fights incoming enemy aircraft,
The own machine safe action pattern calculation process for obtaining the probability Pm (Xw, Yw) of moving to the position (Xw, Yw) after the action unit time T has elapsed by selecting each action w;
Position (Xw, Yw) after the elapse of the action unit time T when the own aircraft has selected the action w, and position (Xk, Yk) after the elapse of the action unit time T when the enemy aircraft has selected the action k A self-shooting probability calculation process for calculating a self-shooting probability P (Xw, Yw, Xk, Yk) for each combination with
For each action w of the own machine, the position (Xw, Yw) after elapse of the action unit time T by the own machine shooting probability P (Xw, Yw, Xk, Yk) and the own machine selecting each action w An integration process for obtaining a product P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) with a probability Pm (Xw, Yw) to move to
By adding the above-mentioned P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) obtained in the above integration process for all the actions w of the own aircraft, An addition process for obtaining the sum of the shoot-off probability Σ _w P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw);
The maximum value for determining the action k of the enemy aircraft by obtaining the action k of the enemy aircraft that maximizes the above-mentioned Σ _w P (Xw, Yw, Xk, Yk) · Pm (Xw, Yw) obtained in the addition process. Judgment process,
Shooting game processing program to be executed by the door to the computer. Claim 8 shooter processing descriptor computer-readable recording medium programs.

Images