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

Description

  The present invention is a shooting game in which a player and an enemy aircraft are displayed on a screen, and the player moves the enemy aircraft for a predetermined time by W types of actions to fight an enemy aircraft that attacks the enemy aircraft. The present invention relates to a processing method, an apparatus thereof, a program thereof, and a recording medium thereof.

Shooting game processing methods, especially methods for controlling the attacking action of enemy aircraft, include, for example, an algorithm in which an enemy aircraft launches an attacking bullet in a certain direction regardless of the position of the enemy aircraft, or an attack in a random direction. There was an algorithm to fire bullets. Further, as an algorithm that considers the position of the own aircraft, for example, there is an algorithm that fires an attack bullet toward the own aircraft position at the time of launching the attack bullet.
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, there is a problem that the attacking bullet firing algorithm of the enemy aircraft according to the prior art is simple and is easily bored by the player.
Also, since the enemy's attack bullet firing algorithm was not automatically updated in consideration of the trap of each player's own operation, once the user became familiar with the game, the user immediately 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.

According to the present invention, a shooting game processing method for fighting an enemy aircraft that attacks the own aircraft by displaying the own aircraft and the enemy aircraft on the screen and moving the own aircraft by an operation of selecting W types of actions. Then, the own device movement pattern generation means generates a candidate for each movement destination of the own device that performs an action that moves for a predetermined time (hereinafter referred to as an action unit time T) D times. The collision determination means determines whether or not the enemy aircraft collides with an attack bullet that has already been fired at each position in the middle of moving to the destination candidate of the own aircraft. When the arrival time difference calculating means determines that the collision does not occur in the collision determination process, the position where the own apparatus is moving to each destination candidate of the own apparatus determined not to collide in the collision determination process The absolute value of the difference between the time required to move to and the time required to move to the position where it is determined that the attacking bullet newly fired by the enemy aircraft does not collide is calculated. The attack target position determining means determines whether or not the absolute value of the difference is smaller than a predetermined value. If the absolute value of the difference is smaller than the predetermined value, the position determined not to collide is determined. The attack target position. The attack bullet launching means causes the enemy aircraft to launch a new attack bullet toward the attack target position.

  By applying search calculation in the field of artificial intelligence, it is possible to make the attack bullet launch algorithm of enemy aircraft more intelligent. Thereby, it is possible to create a shooting game that is hard to get bored by the player.

[Theoretical background]
FIG. 3 exemplifies a shooting game that is a target of processing of the present invention. 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. There may be a plurality of attack bullets 3, enemy aircraft 2, and attack bullets 4. 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 user operates the own aircraft 1 to fight the enemy aircraft 2. The user can move his / her own device for the behavior unit time T at W movement speeds (direction and speed) in one operation. W types of movement speeds (Vsx (w), Vsy (w)) that the own device 1 can take are determined in advance, and each movement speed (Vsx (w), Vsy (w)) has a movement speed number. It is assumed that w (w = 1,..., W) is attached. Hereinafter, the action of selecting the moving speed number w is referred to as action (w). In addition, the user can perform an operation of firing an attack bullet 3 for attacking the enemy aircraft 2 at the same time as movement at W speeds.

  The enemy aircraft 2 can act at K types of moving speeds (direction and speed) for each behavior unit time T. K types of moving speeds (Vex (k), Vey (k)) that can be taken by the enemy aircraft 2 are determined in advance, and each moving speed (Vex (k), Vey (k)) has a moving speed number. It is assumed that k (k = 1,..., K) is attached. Further, the enemy aircraft 2 can fire the attack bullet 4 simultaneously with the movement. Assume that attack bullets fired by enemy aircraft move at a constant speed (Vbikx (t), Vbiky (t)).

  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, an enemy aircraft with ideal strength is an enemy aircraft that launches an attack bullet so that the number of “safe behavior patterns” that the aircraft can take is small. If the enemy aircraft can reduce the number of “safe behavior patterns” that can be taken by the own aircraft at the time of firing the attack bullets, it can be said that the enemy aircraft is effectively pursuing the own aircraft is there.

  Here, the “safe behavior pattern” is defined as follows. It is assumed that the own device can move a predetermined number of times (D times) at W speeds. At this time, with respect to all the action patterns that the aircraft can take, it is checked whether or not the aircraft is destroyed by the attacking bullets of the enemy aircraft. That is, for all the action patterns that the aircraft can take by moving at the speed of W types at each action depth d (d = {1,..., D}), the aircraft is destroyed by the attacking bullet of the enemy aircraft. Find out if you are. 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.

  For example, FIG. 4 shows an example of all behavior patterns when W = 3 and D = 3. In FIG. 4, it is assumed that a collision occurs at * 1, * 2, and * 3. In FIG. 4, a solid line represents a trajectory drawn by the own device when an action of w = 1 is selected at each depth d. A broken line represents a trajectory drawn by the own device when an action of w = 2 is selected at each depth d. An alternate long and short dash line represents a trajectory drawn by the own device when an action of w = 3 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.

  In the following, when the absolute value of the difference between the time taken for the own aircraft to move to a certain position and the time taken for the attack bullets fired by the enemy aircraft to move to that position is smaller than the predetermined value C Is called the target position of the attack bullet (hereinafter referred to as the attack target position). The predetermined value C can be, for example, S / Ve, where S is half of the sum of the size of the own aircraft and the size of the enemy attacking bullet, and Ve is the velocity of the attacking bullet of the enemy aircraft. Also, as the size of the own aircraft, for example, the diameter of a circle inscribed in the shape of the own aircraft, and as the size of the enemy aircraft attack bullet, the diameter of a circle inscribed in the shape of the enemy aircraft attack bullet can be taken .

  If the absolute value of the difference between the time it takes for the aircraft to move to a certain position and the time it takes for the attacking bullet fired by the enemy aircraft to move to that position is smaller than S / Ve, When an attack bullet is fired at that position, the aircraft that selected the action to move to that position collides with the attack bullet at that position.

  Here, it can be said that the closer the attack target position is to the current position of the own aircraft, the greater the number of safe action patterns of the own aircraft that can be reduced by the attack bullets fired by the enemy aircraft. This is because if a node near the root of the search tree of the movement pattern of the own device (at a shallow depth) is set as the attack target position, all of the safety action patterns branched from the node can be eliminated.

  In order to find such an attack target position that is close to the current position of the aircraft, a vertical search is used in the first embodiment described below. In the second embodiment, horizontal search is used. These embodiments are merely examples, and the present invention can be implemented using other search methods. That is, the search method is not limited to the vertical search and the horizontal search described later.

  A vertical search is a search that gives priority to child nodes. For example, in the case of D = 3 and W = 3, as shown in FIG. 5, each route is searched in the order of the numbers given to the movement routes for each action unit. In the first 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 and a collision occurs, the route 10 is searched. If even one suitable attack target position is found, no search is performed for a position farther from the current position of the aircraft than the attack target position. For example, as shown in FIG. 5, when a suitable attack target position is found in a circle (15 routes) in a search with a depth d = 2, the own aircraft is attacked with a circle from the current position. It is examined whether or not an appropriate attack target position can be obtained only for a position where the arrival time of the own aircraft is shorter than the time required to reach the target position.

  In addition, horizontal search is a search method in which a search is started from a certain node, all nodes connected to the node are examined, and then the child nodes connected to the examined node are examined in order. is there. For example, in the case of D = 3 and W = 3, as shown in FIG. 6, this is a method of searching each route in the order of the numbers given to the movement route for each action unit. In the second 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 5), the routes 16 to 18 are not searched. In this case, after searching for 15 routes, 19 routes are searched. If even one suitable attack target position is found, no search is performed for a position farther from the current position of the aircraft than the attack target position. For example, as shown in FIG. 6, when a suitable attack target position is found in ○ (route 7) in a search with a depth d = 2, the own aircraft will attack from the current position indicated by ○. It is examined whether or not an appropriate attack target position can be obtained only for a position where the arrival time of the own aircraft is shorter than the time required to reach the target position.

[Embodiment]
First embodiment (vertical search)
A shooting game processing apparatus 1000 for carrying out the shooting game processing method according to the first embodiment of 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. 2 is a diagram illustrating a processing example of the shooting game processing apparatus 1000.
The shooting game processing apparatus 1000 includes, for example, the own device movement pattern generation unit 10, the attack bullet position estimation unit 20, the collision determination unit 30, the attack target position determination unit 40, the attack target position buffer 50, the own device movement pattern buffer 51, the enemy It comprises a machine attack bullet state buffer 52 and an attack bullet launcher 60.
The own device movement pattern generation unit 10 includes, for example, an initialization unit 101, a control unit 102, a buffer 103, a position update unit 104, and a storage unit 105.
The attack bullet position estimation unit 20 includes a storage unit 201 and a position acquisition unit 202, for example.
The attack target position determination unit 40 includes, for example, an arrival time difference calculation unit 401.

<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 105 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 each action w is taken, for example, when W = 9, (Vx1, Vy1) = (0, 1), (Vx2, Vy2) = (1 , 1), (Vx3, Vy3) = (1, 0), (Vx4, Vy4) = (1, −1), (Vx5, Vy5) = (0, −1), (Vx6, Vy6) = (− 1, -1), (Vx7, Vy7) = (-1, 0), (Vx8, Vy8) = (-1, 1), (Vx9, Vy9) = (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 find an appropriate attack target position. If there is an area that cannot be covered by the area where the attack bullets are swept by movement, the determined attack target position does not take into account some of the areas where the aircraft can actually move. is there. For this reason, in order to find a more appropriate attack target position, for example, a value obtained by dividing the diameter of a circle inscribed in the shape of the own device by the speed of the own device is set as the action unit time T.

Assume that the velocity (Vbikx (t), Vbiky (t)) of the attacking bullet of the enemy aircraft is set in advance and stored in the storage unit 201 of the attacking bullet position estimation unit 20.
In the following, t is the elapsed time from the start of the action of the ship, the position of the ship at time t is (Xs (t), Ys (t)), and the kth attack bullet launched by the enemy aircraft i. (Xbik (t), Ybik (t)) at time t. Here, t takes a discrete time for each processing unit time τ.

<Step S1>
The initialization unit 101 of the own device movement pattern generation unit 10 stores t = 0, d = 1, Db = D, tb = D × T in the buffer 103. Further, the initialization unit 101 sets the position (Xs (t), Ys (t)) of the own apparatus at time t to the current position of the own apparatus, and stores this in the own movement pattern buffer 51.

<Step S2>
The control unit 102 of the own device movement pattern generation unit 10 sets w (d) = 1. Here, w (d) is the moving speed number w of the own device at the depth d.

<Step S3>
The control unit 102 of the own device movement pattern generation unit 10 stores the values of w (d) and (Xs (t), Ys (t)) in the own device movement pattern buffer 51, respectively. Further, the control unit 102 of the own aircraft movement pattern generation unit 10 stores the attack bullet position (Xbik (t), Ybik (t)) at the time t in the enemy aircraft attack bullet state buffer 52.

<Step S4>
The control unit 102 of the own movement pattern generation unit 10 reads t from the buffer 103 and increments t by the increment width τ. The incremented t is stored in the buffer 103. 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 set to 0.3 seconds to 1 second, 0.03 seconds to 0.1 seconds, which is a time interval for dividing T into 10 parts, can be set as τ.

  Further, the position update unit 104 of the own device movement pattern generation unit 10 moves the own device after moving by the increment width τ of t at the moving speed (Vx (w (d)), Vy (w (d)) of the own device. Specifically, the position updating unit 104 calculates (τ × Vx (w (d)), τ × Vy (w (d))) to obtain a displacement amount of the position, By adding (Xs (t−τ), Ys (t−τ)) to this, the position of the own apparatus is updated, that is, the position of the own apparatus after being incremented by the increment width τ, that is, the updated position. The machine position (Xs (t), Ys (t)) is output to the collision determination unit 30.

<Step S5>
The attack bullet position estimation unit 20 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 (Vbikx (t), Vbiky (t)) of the attack bullet stored in the storage unit 201 is read, and the attack bullet before update acquired by the position acquisition unit 202 is multiplied by τ. 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 201. The updated attack bullet positions (Xbik (t), Ybik (t)) are output to the collision determination unit 30 and the own movement pattern generation unit 10.

<Step S6>
The collision determination unit 30 determines whether or not the own aircraft and the attack bullet have collided. Whether or not the vehicle has collided is set in advance and is stored in a storage unit (not shown) in the storage unit 30, the shape of the own aircraft, the shape of the attack bullet, and the updated output output from the own device movement pattern generation unit 10 Is determined from the position (Xs (t), Ys (t)) of the own aircraft and the position (Xbik (t), Ybik (t)) of the updated attack bullet output from the attack bullet position estimation unit 20 .
For example, if the shape of the own aircraft placed at the updated position and the shape of the attack bullet of the enemy aircraft placed at the updated position overlap, it can be determined that the own aircraft and the attack bullet have collided it can.
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 10. Then, the process of step S7 is performed.
If it is determined that there is a collision, a signal indicating that there is a collision is output to the own-movement pattern generation unit 10. Then, the process of step S14 is performed.

<Step S7>
The control unit 102 of the own movement pattern generation unit 10 that has received the signal that there is no collision compares the magnitude relationship between t and tb read from the buffer 103.
If t <tb, the process of step S8 is performed. If t ≧ tb, the process of step S10 is performed.

<Step S8>
The arrival time difference calculation unit 41 of the attack target position determination unit 40 causes the enemy aircraft located at the current position (X, Y) of the enemy aircraft to launch an attack bullet with (Xs (t), Ys (t)) as the target position. The required arrival time Tn is calculated. Then, the absolute value of the difference between t and Tn is calculated.
The attack target position determination unit 40 determines whether the absolute value of the difference between the required arrival times Tn and t is smaller than a predetermined value C read from the storage unit 105. The predetermined value C can be, for example, S / Ve, where S is half of the sum of the size of the own aircraft and the size of the enemy attacking bullet, and Ve is the velocity of the attacking bullet of the enemy aircraft. Also, as the size of the own aircraft, for example, the diameter of a circle inscribed in the shape of the own aircraft, and as the size of the enemy aircraft attack bullet, the diameter of a circle inscribed in the shape of the enemy aircraft attack bullet can be taken .

If S / Ve> | t−Tn |, (Xs (t), Ys (t)) can be set as the attack target position. This is because if the enemy aircraft fires an attack bullet with (Xs (t), Ys (t)) as the target position, it may be possible to destroy the aircraft. In this case, the process of step S9 is performed.
If S / Ve <| t−Tn |, (Xs (t), Ys (t)) cannot be set as the attack target position. In this case, the process of step S10 is performed.

<Step S9>
If S / Ve> | t−Tn |, since (Xs (t), Ys (t)) can be set as the attack target position, the attack target position determination unit 40 determines (Xs (t), Ys). (T)) is stored in the attack target position buffer 50 as the attack target position (Xdes, Ydes). Further, Db is newly set as Db = d, and this is stored in the buffer 103. Further, tb is newly set as tb = t, and this is stored in the buffer 103.

<Step S10>
The control unit 102 of the own device movement pattern generation unit 10 determines whether or not the behavior unit time T has elapsed since step S3. That is, it is determined whether t read from the buffer is larger than dT, that is, whether t ≧ dT.
If t <dT, the process of step S4 is performed. That is, steps S4 to S10 are repeated until the action unit time T elapses from when t is step S3.
If t ≧ dT, the process of step S11 is performed.

<Step S11>
The control unit 102 of the own device movement pattern generation unit 10 increments d read from the buffer 103 by one. The incremented d is stored in the buffer 103.

<Step S12>
The control unit 102 of the own device movement pattern generation unit 10 determines whether d read from the buffer 103 is larger than Db read from the buffer 103. That is, it is determined whether Db <d.
When it is determined that Db ≧ d, the control unit 102 performs the process of step S2.
When it is determined that Db <d, the control unit 102 performs the process of step S13.

<Step S13>
The control unit 102 of the own device movement pattern generation unit 10 decrements d read from the buffer 103 by one. The decremented d is stored in the buffer 103.

<Step S14>
The control unit 102 of the own device movement pattern generation unit 10 sets t read from the buffer 103 to (d−1) T. (D-1) t set in T is stored in the buffer 103. Also, w (d) stored in own device movement pattern buffer 51 is read and incremented by one. The incremented w (d) is stored in the own movement pattern buffer 51.

<Step S15>
The control unit 102 of the own device movement pattern generation unit 10 compares the magnitude relationship between W read from the storage unit 105 and w (d) read from the own device movement pattern buffer 51.
If W <w (d), the control unit 102 of the own device movement pattern generation unit 10 performs the process of step S17. If W ≧ w (d), the control unit 102 of the own device movement pattern generation unit 10 performs the process of step S16.

<Step S16>
The control unit 102 of the own-device movement pattern generation unit 10 reads the position of the attack bullet (Xbik (t), Ybik (t)) at time t from the enemy aircraft attack bullet state buffer 52. Thereafter, the process of step S3 is performed.

<Step S17>
When it is determined in step S15 that W <w (d), the control unit 102 of the own movement pattern generation unit 10 determines whether d = 1.
If it is determined that d ≠ 1, the process of step S14 is performed.
If it is determined that d = 1, the process of step S18 is performed.

<Step S18>
If it is determined in step S17 that d = 1, the search for the target position of the attack bullet is terminated. Then, the attack bullet launcher 60 causes the enemy aircraft to launch an attack bullet toward the attack target position (Xdes, Ydes) read from the attack target position buffer 50.

In the search for the attack target position according to the present embodiment, once the attack target position is found, only the position that is shallower than the position (Db <d, step S12) and closer to the own aircraft than the position (t <Tb, step S7), searching whether it can be the target position of the attack bullet. When a new target position of the attack bullet is found (step S8), the attack target position buffer 50 is updated with the new target position of the attack bullet (step S9). For this reason, when it is determined that d = 1 in step S17 and the search for the target position of the attack bullet is finished, the attack target position (Xdes, Ydes) stored in the attack target position buffer 50 is the current position of the aircraft. This is the closest attack target position from the position.
The above is the outline of the shooting game processing method and apparatus according to the first embodiment.

Second embodiment (horizontal search)
A shooting game processing apparatus 1001 for carrying out a shooting game processing method according to the second embodiment of the present invention will be described with reference to FIGS. FIG. 7 is a diagram illustrating a functional configuration example of the shooting game processing apparatus 1001. FIG. 8 is a diagram illustrating a processing example of the shooting game processing apparatus 1001.

  The shooting game processing device 1001 is different from the shooting game processing device 1000 in that the own device movement pattern generation unit 11 includes a permutation creation unit 106 and a permutation acquisition unit 107, and the operation of the control unit 112 of the own device movement pattern generation unit 11 It differs from the shooting game processing apparatus 1000 shown in FIG. 1 in that it differs from the operation of the control unit 102 of the machine movement pattern generation unit 10 and has a permutation data buffer 53. Other functional configurations of the shooting game processing device 1001 are the same as the functional configurations of the shooting game processing device 1000.

<Preparation>
Similar to the first embodiment, the number of actions (depth of search) D of the own machine, the number W of the types of actions w that the own machine can take, and the speed (Vxw, Vyw), the action unit time T is set in advance and is stored in the storage unit 105 of the own device movement pattern generation unit.
Further, it is assumed that the velocity (Vbikx (t), Vbiky (t)) of the attacking bullet of the enemy aircraft is preset and stored in the storage unit 201 of the attacking bullet position estimation unit 20.

  In the following, t is the elapsed time from the start of the action of the ship, the position of the ship at time t is (Xs (t), Ys (t)), and the kth attack bullet launched by the enemy aircraft i. Is the position at time t (Xbik (t), Ybik (t)), d is the total number of elements of the own apparatus action permutation currently evaluated, j is the own apparatus action permutation number currently evaluated, de , W (d, 1, j), ..., w (d, de, j), ..., w (d, d, j), jth self It is assumed that the machine action permutation is set, and each w (d, de, j) has its own moving speed number. Also, tb is the time when the attack target position is found, and Db is the search depth when the attack target position is found. Here, t takes a discrete time for each processing unit time τ.

<Step S1>
The initialization unit 101 of the own device movement pattern generation unit 11 stores d = 1, k = 1, Db = D, and tb = D × T in the buffer 103. Further, the initialization unit 101 sets the position (Xs (t), Ys (t)) of the own apparatus at time t to the current position of the own apparatus, and stores this in the own movement pattern buffer 51.

<Step S2>
The permutation creation unit 106 of the own device movement pattern generation unit 11 performs the own device action permutation w (d, 1, j),..., W (d, de, j),. d, d, j) are created and stored in the permutation data buffer 53. Further, j = 1 is stored in the buffer 103. The self-device action permutation is a permutation of movement speed numbers that the self-device can take.

For example, in the case of d = 1, the permutation creation unit 106, for all j and de, has the following 9 (= 9 to the 1st power) number of own action permutations w (d, 1, j),. w (d, de, j),..., w (d, d, j) can be created.
j = 1: {w (1, 1, 1) = 1}
j = 2: {w (1, 1, 2) = 2}
...
j = 8: {w (1, 1, 2) = 8}
j = 9: {w (1,1,9) = 9}

Further, for example, when d = 2, for all j and de, 81 (= 9 to the second power) permutation w (d, 1, j),..., W (d, de, j),..., w (d, d, j) can be created.
j = 1: {w (2, 1, 1) = 1, w (2, 2, 1) = 1}
j = 2: {w (2, 1, 2) = 1, w (2, 2, 2) = 2}
...
j = 80: {w (2,1,80) = 9, w (2,2,80) = 8}
j = 81: {w (2,1,81) = 9, w (2,2,81) = 9}

Further, for example, in the case of d = 3, for all d, de, and j, 729 (= 9 to the third power) self-action permutations w (d, 1, j),. d, de, j), ..., w (d, d, j) can be created.
j = 1: {w (3, 1, 1) = 1, w (3, 2, 1) = 1, w (3, 3, 1) = 1}
j = 2: {w (3, 1, 2) = 1, w (3, 2, 2) = 1, w (3, 3, 2) = 2}
...
j = 728: {w (3,1,728) = 9, w (3,2,728) = 9, w (3,3,728) = 8}
j = 729: {w (3,1,729) = 9, w (3,2,729) = 9, w (3,3,729) = 9}

<Step S3>
The control unit 112 of the own device movement pattern generation unit 11 stores de = 1 and t = 0 in the buffer 103. The moving speed number to be selected by the own device is assumed to be w (d, de, j).

<Step S4>
The control unit 112 of the own device movement pattern generation unit 11 determines whether d read from the buffer 103 is d = 1. If d = 1, the process of step S5 is performed. If d = 1 is not satisfied, the process of step S18 is performed.

<Step S5>
The control unit 112 of the own device movement pattern generation unit 11 reads t from the buffer 103 and increments t by the increment width τ. The incremented t is stored in the buffer 103. 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 set to 0.3 seconds to 1 second, 0.03 seconds to 0.1 seconds, which is a time interval for dividing T into 10 parts, can be set as τ.

  In addition, the position update unit 104 of the own device movement pattern generation unit 11 uses the moving speed (Vx (w (d, de, j)), Vy (w (d, de, j)) of the own device and the increment width of t. Specifically, the position update unit 104 calculates (τ × Vx (w (d, de, j)), τ × Vy (w (d, de, j))) is calculated to determine the displacement amount of the position, and (Xs (t−τ), Ys (t−τ)) is added to this to update the position of the own device. The position of the own machine after being incremented in step 1, that is, the updated position of the own machine (Xs (t), Ys (t)) is output to the collision determination unit 30.

<Step S6>
The attack bullet position estimation unit 20 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 (Vbikx (t), Vbiky (t)) of the attack bullet stored in the storage unit 201 is read, and the attack bullet before update acquired by the position acquisition unit 202 is multiplied by τ. 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 201. The updated attack bullet positions (Xbik (t), Ybik (t)) are output to the collision determination unit 30 and the own movement pattern generation unit 11.

<Step S7>
The collision determination unit 30 determines whether or not the own aircraft and the attack bullet have collided. Whether or not the vehicle has collided is set in advance and is stored in a storage unit (not shown) in the storage unit 30, the shape of the own aircraft, the shape of the attack bullet, and the updated output output from the own device movement pattern generation unit 11 Is determined from the position (Xs (t), Ys (t)) of the own aircraft and the position (Xbik (t), Ybik (t)) of the updated attack bullet output from the attack bullet position estimation unit 20 .
For example, if the shape of the own aircraft placed at the updated position and the shape of the attack bullet of the enemy aircraft placed at the updated position overlap, it can be determined that the own aircraft and the attack bullet have collided it can.

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 S8 shown in FIG. 9 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 S17 is performed.

<Step S8>
The control unit 112 of the own movement pattern generation unit 11 that has received the signal that there is no collision compares the magnitude relationship between t and tb read from the buffer 103.
If t <tb, the process of step S9 is performed. If t ≧ tb, the process of step S11 is performed.

<Step S9>
The arrival time difference calculation unit 401 of the attack target position determination unit 40 causes the enemy aircraft located at the current position (X, Y) of the enemy aircraft to fire an attack bullet with (Xs (t), Ys (t)) as the target position. The required arrival time Tn is calculated. Then, the absolute value of the difference between t and Tn is calculated.
The attack target position determination unit 40 determines whether the absolute value of the difference between the required arrival times Tn and t is smaller than a predetermined value C read from the storage unit 105. The predetermined value C can be, for example, S / Ve, where S is half of the sum of the size of the own aircraft and the size of the enemy attacking bullet, and Ve is the velocity of the attacking bullet of the enemy aircraft.

If S / Ve> | t−Tn |, (Xs (t), Ys (t)) can be set as the attack target position. This is because if the enemy aircraft fires an attack bullet with (Xs (t), Ys (t)) as the target position, there is a possibility that the own aircraft can be destroyed. In this case, the process of S10 is performed.
If S / Ve <| t−Tn |, (Xs (t), Ys (t)) cannot be set as the attack target position. In this case, the process of step S11 in FIG. 8 is performed.

<Step S10>
If S / Ve> | t−Tn |, since (Xs (t), Ys (t)) can be set as the attack target position, the attack target position determination unit 40 determines (Xs (t), Ys). (T)) is stored in the attack target position buffer 50. Further, Db is newly set as Db = d, and this is stored in the buffer 103. Further, tb is newly set as tb = t, and this is stored in the buffer 103.

<Step S11>
The control unit 112 of the own device movement pattern generation unit 11 determines whether or not the behavior unit time T has elapsed since step S3. That is, it is determined whether t read from the buffer is larger than de × T, that is, whether t ≧ de × T.
If t <dT, the process of step S5 is performed. That is, the process of steps S5 to S10 is repeated until t has elapsed the behavior unit time T from the time of step S3.
If t ≧ dT, the process of step S12 is performed.

<Step S12>
The control unit 112 of the own device movement pattern generation unit 11 uses the data of the own device position (Xs (d, de, j), Ys (d, de, j)) at the current d, j, and de values as the own device. Store in the movement pattern buffer 51. Further, the control unit 102 of the own-device movement pattern generation unit 11 uses the current d, j, de values of the enemy aircraft attack bullets (Xbik (d, de, j), Ybik (d, de, j)). Is stored in the enemy aircraft attack bullet state buffer 52, and the process of step S13 shown in FIG. 10 is performed.

<Step S13>
The control unit 112 of the own device movement pattern generation unit 11 increments the own device action permutation number j read from the buffer 103 by one. The incremented own device action permutation number j is stored in the buffer 103.

<Step S14>
The control unit 112 of the own device movement pattern generation unit 11 determines whether or not the own device action permutation number j read from the buffer 103 is j = w to the d power.
If j ≠ w to the power d, the process of step S3 is performed. That is, the process of steps S3 to S12 is repeated for all the own machine action permutation numbers j.
If j = w to the d power, the process of step S15 is performed.

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

<Step S16>
The control unit 112 of the own device movement pattern generation unit 11 determines whether d read from the buffer 103 is larger than Db read from the buffer 103. That is, it is determined whether Db <d.
When it is determined that Db ≧ d, the control unit 112 performs the process of step S2 shown in FIG.
If it is determined that Db <d, the horizontal search according to the present embodiment ends, and the control unit 112 performs the process of step S21.

<Step S17> (FIG. 8)
If it is determined in the process of step S7 that the attack bullets of the own aircraft and the enemy aircraft collide, the control unit 112 of the own aircraft movement pattern generation unit 11 sets the current d to dc (k), Is stored in the own movement pattern buffer 51 as jc (k). Then, k read from the buffer 103 is incremented by 1 and stored in the buffer 103 again.
After the process of step S17 is completed, the process of step S13 shown in FIG. 10 is performed.

<Step S18>
The permutation acquisition unit 107 searches the permutation data buffer 53 and acquires the depth ds of the permutation action permutation having the same elements as the elements of the pertinent behavior permutation currently evaluated and the permutation number js.
For example, as shown in FIG. 11, the permutation sequence of d = 2, j = 1 is {w (2,1,1) = 1, w (2,2,1) = 1}, and d = 1, j = 1, when the own permutation is {w (1,1,1) = 1}, w (2,1,1) = 1 and w (1,1,1) = 1 Since the elements of the own machine action permutation coincide with each other, it can be said that the part with de = 1 has the same element. Therefore, ds is 1 and js is 1 for the own device permutation {w (2,1,1) = 1, w (2,2,1) = 1} with d = 2 and j = 1. That is, (ds, js) = (1, 1).

  Also, for example, the own machine action permutation of d = 3, j = 1 is {w (3,1,1) = 1, w (3,2,1) = 1, w (3,3,1) = 1. }, And the own action permutation of d = 2, j = 1 is {w (2,1,1) = 1, w (2,2,1) = 1}, and d = 1, j = 1. If the own action sequence of {w (1, 1, 1) = 1}, the own action sequence of d = 3, j = 1 and the own action sequence of d = 2, j = 1. Of these, {w (3,1,1) = 1, w (3,2,1) = 1} and {w (2,1,1) = 1, w (2,2,1) = 1} In the part, the elements of the self-behavior permutation match. In addition, among the own device action permutation of d = 3, j = 1 and the own device action permutation of d = 1, j = 1, w (2,1,1) = 1 and w (1,1,1) = In the part 1, the elements of the own machine action permutation match. Therefore, d = 3, j = 1 per-machine action permutation {w (3,1,1) = 1, w (3,2,1) = 1, w (3,3,1) = 1} ds and js are (ds, js) = {(1, 1), (2, 1)}.

<Step S19>
The control unit 112 of the own device movement pattern generation unit 11 searches the own device movement pattern buffer 51 for k that satisfies dc (k) = ds, jc (k) = js. If there are a plurality of pairs of (ds, js), it is searched whether or not k satisfying dc (k) = ds, jc (k) = js exists for each (ds, js) pair.
When k satisfying dc (k) = ds and jc (k) = js exists, the process of step S13 shown in FIG. 10 is performed.
If k that satisfies dc (k) = ds and jc (k) = js does not exist, the process of step S20 is performed.

<Step S20>
When there is no k that satisfies dc (k) = ds, jc (k) = js, the control unit 112 of the own-device movement pattern generation unit 11 is the group of (ds, js) obtained in step S18. (ds, js) having the maximum value of ds is obtained. Then, the own position (Xs (ds, ds, js), Ys (ds, ds, js)) and the attack bullet position (Xbik) as a result of movement according to the maximum value of ds (ds, js). (Ds, ds, js), Ybik (ds, ds, js)) is read from the own movement pattern buffer 51. Further, t = de × d and t = de are stored in the buffer 103, respectively.

<Step S21> (FIG. 10)
If it is determined in step S16 that Db <d, the search for the target position of the attack bullet is terminated. Then, the attack bullet launcher 60 causes the enemy aircraft to launch an attack bullet toward the attack target position (Xdes, Ydes) read from the attack target position buffer 50.
The above is the outline of the shooting game processing method and apparatus according to the second embodiment.

[Modifications, etc.]
Modification 1
There are the following methods for setting the behavior unit time T.
For example, it is assumed that the operation history recording unit 108 of the own device movement pattern generation unit 10 and the own device movement pattern generation unit 11 takes data on the operation history of the player. The action unit time setting unit 109 calculates the average value of the time interval when the own device changes the moving direction from the operation history data recorded in the operation history recording unit 108 and sets the calculation result as the action unit time T. can do.
This makes it possible to fire attack bullets that take into account the player's trap.

Modification 2
In the search for the attack target position, the action unit time T can be changed for each action of the own machine. For example, the length of the action unit time T can be increased exponentially as the number of actions of the own machine increases, in other words, as the search depth d increases. By increasing the action unit time T as the search depth d becomes deeper, even in a limited depth search, it is possible to perform a search that considers even a future state. For this purpose, for example, the behavior unit time setting unit 109 calculates Aexp (d) after incrementing d in the process of step S11 in the first embodiment or in the process of step S15 in the second embodiment. Then, this calculation result is set as the action unit time T. Here, A is an arbitrary real number larger than 1.

Modification 3
Alternatively, the search for the target position of the attack may be performed after the own device continues the current speed for a certain time Tc in the future. This is because the search calculation can be performed substantially deeper. That is, when it is assumed that the current speed has continued for a certain period of time Tc in the future, when searching for D = 5, the same search as that performed for D = 6 should be performed. Can do.

  It is common for a user to take action unit time T or more to determine his own action after inputting his / her own enemy, enemy aircraft and attack bullets displayed on the screen and to input the action. . Therefore, there is no problem even if the search for the target position of the attack 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 simultaneous, that is, if the enemy aircraft selects an action, even if the own aircraft is moving, the own aircraft will keep the current speed constant in the future The enemy aircraft can select an action by performing a search assuming that the time Tc has continued.

In the first embodiment, in order to perform a search after the own device continues the current speed for a certain time Tc in the future, in the process in step S1 of the first embodiment or step S1 of the second embodiment, the initialization unit 101 sets the position (Xs (t), Ys (t)) of the own apparatus at time t = 0 to a position where the own apparatus has moved the current speed by a fixed time Tc. Moreover, in the process of step S5 of the first embodiment or step S6 of the second embodiment, the attack bullet position estimation unit 20 calculates the attack bullet from the current position of the enemy bullet already fired by the enemy aircraft acquired by the position acquisition unit 202. The position (Xbik (t−τ), Ybik (t−τ)) of the attacking bullet before update is obtained by calculating the position where the attacking bullet has moved for a certain time Tc. In the process of step S8 of the first embodiment or step S9 of the second embodiment, the attack target position determination unit 40 does not determine whether S / Ve> | t−Tn |, but S / Ve> | t + Tc−. It is determined whether Tn |.
Other processes are the same as those in the above embodiments. For example, as the fixed time Tc, it is possible to set an average value of time intervals when the own device described in the first modification changes the moving direction.

Modification 4
In step S18 of the first embodiment or step 21 of the second embodiment, if the attack target position is not stored in the attack target position buffer 50, the attack bullet launching section 60 It is possible to fire an attack bullet at the current position of the aircraft.

Modification 5
Further, in step S18 of the first embodiment or step 21 of the second embodiment, the attack bullet launching unit 60 determines that the attack bullet launching unit 60 does not store the attack target position in the attack target position buffer 50. It is possible to fire an attack bullet at the enemy aircraft toward a position where a certain random displacement is given to the current position of the own aircraft.

  For example, the random number generator 61 of the attack bullet launcher 60 generates a random value for each of the displacement amount in the X-axis direction and the displacement amount in the Y-axis direction. The attack bullet firing unit 60 causes the enemy aircraft to launch an attack bullet toward a position obtained by adding the generated displacement amount in the X-axis direction and the displacement amount in the Y-axis direction to the current position of the own aircraft.

  Specifically, if the diameter of a circle inscribed in the shape of the machine is M, the width of the displacement amount in the X-axis direction and the displacement amount in the Y-axis direction is preferably about −3M to 3M. For example, when the size of its own shape is 30 dots, the displacement amount in the X-axis direction and the displacement amount in the Y-axis direction can each take a value of −50 to 50 at random. Good.

Modification 6
In step S <b> 18 of the first embodiment, when the attack target position buffer 50 does not store the attack target position, the attack bullet launching unit 60 outputs a signal indicating that the attack bullet target position has not been found. You may make it output to the production | generation part 10. FIG.

  Receiving the signal, the own-device movement pattern generation unit 10 assumes that the own device maintains the current speed, and generates the destination of the own device when the own device continues to take action to maintain the current speed. The attack target position determination unit 40 determines whether or not each position up to the movement destination can be an appropriate attack bullet target position. In other words, for each position up to the destination, the absolute value of the difference between the time for the aircraft to move to that position and the time for the attack bullets fired by the enemy aircraft to move to that position is greater than the predetermined value C. Determine if it is small. When it is smaller than the predetermined value C, the position can be set as the attack target position. The attack bullet launcher 60 launches an attack bullet toward the attack target position.

Modification 7
Further, as described in the modified example 6, in step S18 of the first embodiment, the attack bullet launching unit 60 sets the attack bullet target position when the attack target position is not stored in the attack target position buffer 50. A signal indicating that it has not been found is output to its own movement pattern generation unit 10.
Receiving the signal, the control unit 102 of the own movement pattern generation unit 10 reads the predetermined value C stored in the storage unit 105, resets the predetermined value C to a larger value, and stores it in the storage unit 105. To do. And you may make it perform each process of the said step S1-18 again.

Modification 8
Further, as described in the modified example 6, in step S18 of the first embodiment, the attack bullet launching unit 60 sets the attack bullet target position when the attack target position is not stored in the attack target position buffer 50. A signal indicating that it has not been found is output to its own movement pattern generation unit 10.
Receiving the signal that the attack target position has not been found, the control unit 102 of the own movement pattern generation unit 10 reads the search depth D stored in the storage unit 105 and newly adds a value of D + 1 incremented by one. Stored as D in the storage unit 105. And you may make it perform each process of the said step S1-18 again.
When the incremented D + 1 reaches a certain value Dc, the control unit 102 ends the search. That is, when the incremented D + 1 becomes a constant value Dc, the execution of each process of steps S1 to S18 is stopped.

Modification 9
In the above embodiment, the attack bullet is fired only for the attack target position that the aircraft can reach in the shortest time. However, every time the attack target position is found, the attack bullet launching unit 60 is directed to the attack target position. The attacking bullets may be fired at the enemy aircraft.

In addition, the said modifications 6-9 can be performed similarly about 2nd Embodiment. Moreover, you may carry out combining the said modification.
The processing function of the shooting game processing device can be realized by a computer. In this case, the content of the processing function of the shooting game processing device is described by a program. Then, by executing this program on a computer as shown in FIG. 12, the processing functions of the shooting game processing device 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, this computer reads the program stored in its own recording medium and executes the process according to the read program. As another execution form of the program, the computer may directly read the program from a portable recording medium and execute processing according to the program, and the program is transferred from the server computer to the computer. Each time, the processing according to the received program may be executed sequentially. Also, the program is not transferred from the server computer to the computer, and the above-described processing is executed by a so-called ASP (Application Service Provider) type service that realizes the processing function only by the execution instruction and result acquisition. It is good. Note that the program in this embodiment includes information that is 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 embodiments, the shooting game processing method, the apparatus thereof, and the like according to the present invention are not limited to the above-described embodiments, and can be appropriately changed without departing from the spirit of the present invention.

The figure which illustrated the function structure of the shooting game processing apparatus 1000. The figure which illustrated processing of shooting game processing device 1000. A schematic diagram of a shooting game. The figure for demonstrating a safe action pattern. The figure which shows the search order of a vertical type search. The figure which shows the search order of a horizontal type search. The figure which illustrated the function structure of the shooting game processing apparatus 1001. The figure (1) which illustrated processing of shooting game processing device 1001. The figure (2) which illustrated processing of shooting game processing device 1001. The figure (3) which illustrated processing of shooting game processing device 1001 The figure for demonstrating the example of a coincidence of the element of a self-machine action permutation. The figure which illustrated functional composition when a shooting game difficulty level judging device is performed 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 movement pattern production | generation part 11 Own machine movement pattern production part 20 Attack bullet position estimation part 21 Step 30 Collision judgment part 40 Attack target position judgment part 41 Arrival time difference calculation part 50 Attack target position buffer 51 Own machine movement pattern buffer 52 Enemy aircraft attack bullet state buffer 53 Permutation data buffer 60 Attack bullet firing unit 61 Random number generation unit 101 Initialization unit 102 Control unit 103 Buffer 104 Position update unit 105 Storage unit 106 Permutation creation Unit 107 permutation acquisition unit 108 operation history recording unit 109 action unit time setting unit 112 control unit 201 storage unit 202 position acquisition unit 401 arrival time difference calculation unit 1000 shooting game processing device 1001 shooting game processing device

Claims (14)

A computer equipped with its own movement pattern generation means, collision determination means, arrival time difference calculation means, attack target position determination means, and attack bullet launching means displays its own aircraft and enemy aircraft on the screen, and W A method of processing a shooting game in which an own aircraft is moved by an operation of selecting a kind of action to fight an enemy aircraft that attacks the own aircraft,
A self-movement pattern generation process in which a self-movement pattern generation unit generates candidates for each movement destination of the self-machine that performs an action that moves for a predetermined time (hereinafter referred to as a behavior unit time T);
A collision determination process in which the collision determination means determines whether the enemy aircraft collides with an attack bullet that has already been fired at each position in the middle of the movement of the aircraft to each destination candidate of the aircraft;
When the arrival time difference calculating means determines that the collision does not occur in the collision determination process, the position where the own apparatus is moving to each destination candidate of the own apparatus determined not to collide in the collision determination process An arrival time difference calculation process for calculating the absolute value of the difference between the time required to move to and the time required for the enemy aircraft to newly move to the position determined to not collide ,
The attack target position determining means determines whether or not the absolute value of the difference is smaller than a predetermined value. If the absolute value of the difference is smaller than the predetermined value, the position determined not to collide is determined. Attack target position determination process as an attack target position,
An attack bullet launching process in which an attack bullet launching means launches a new attack bullet to the enemy aircraft toward the attack target position,
A shooting game processing method characterized by comprising: A shooting game processing method according to claim 1,
The own machine movement pattern generation process is a process of constructing a search tree with an action pattern having a route determined by each speed that can be taken by the own machine for each action unit as a branch, based on the current position of the own machine.
In order from each branch path close to the root, search for an attack target position by the collision determination process, the arrival time difference calculation process, and the attack target position determination process.
A method for processing a shooting game. A shooting game processing method according to claim 1,
The own machine movement pattern generation process is a process of constructing a search tree with an action pattern having a route determined by each speed that can be taken by the own machine for each action unit as a branch, based on the current position of the own machine.
Search for the attack target position by the collision determination process, the arrival time difference calculation process, and the attack target position determination process in each route in the action pattern in a predetermined order from the root to the limit depth. A shooting game processing method characterized by the above. In the shooting game processing method in any one of Claims 1-3,
The attack target position determining process further includes a process of determining an attack target position that the aircraft can reach in the shortest time when there are a plurality of attack target positions.
The attack bullet firing process is a process in which the enemy aircraft launches a new attack bullet toward the target position where the aircraft can reach in the shortest time.
A method for processing a shooting game. In the shooting game processing method in any one of Claims 1-4,
Repeat the collision determination process, the arrival time difference calculation process, and the attack target position determination process,
In the arrival time difference calculation process, when an attack target position is found in the already performed attack target position determination process, it is determined that there is no collision other than the attack target position, rather than the time for the aircraft to move to the attack target position. Only when the time it takes for the aircraft to move to the selected position is shorter, the time required for the aircraft to move to the position where it is determined that it will not collide, and the attack bullets that the enemy aircraft newly fires will not collide. Calculating the absolute value of the above difference from the time required to move to the determined position,
The arrival time difference calculation process further includes a process in which only the last attack target position found is the attack target position.
A method for processing a shooting game. In the shooting game processing method in any one of Claims 1-5,
The predetermined value is a value obtained by dividing half the sum of the size of the own aircraft and the size of the attack bullet newly fired by the enemy aircraft by the speed of the attack bullet.
A method for processing a shooting game. In the shooting game processing method according to any one of claims 1 to 6,
The average value of the movement direction change time interval of the player in the player operation history of the game player is the action unit time T.
A method for processing a shooting game. In the shooting game processing method according to any one of claims 1 to 6,
The action unit time setting means has an action unit time setting process for increasing the action unit time T as the number of actions of the own device increases.
A method for processing a shooting game. In the shooting game processing method in any one of Claims 1-8,
The own-machine movement pattern generation process generates candidates for each destination of the own-machine that performs an action that moves only for the action unit time T after the current speed of the own-machine position continues for a certain time Tc in the future. Is the process of
A method for processing a shooting game. In the shooting game processing method in any one of Claims 1-9,
Even if searching by the collision determination process, the arrival time difference calculation process, and the attack target position determination process and no target position is found for any of the destination candidates of the aircraft,
The above-mentioned attack bullet launching process is a process of launching a new attack bullet to the enemy aircraft toward its current position,
A method for processing a shooting game. In the shooting game processing method in any one of Claims 1-9,
Even if searching by the collision determination process, the arrival time difference calculation process, and the attack target position determination process and no target position is found for any of the destination candidates of the aircraft,
The above-mentioned attack bullet firing process is a process in which the enemy aircraft launches a new attack bullet toward the position where the random displacement at the current position of the own aircraft is given.
A method for processing a shooting game. A shooting game processing device that displays its own aircraft and enemy aircraft on the screen, moves itself by an operation of selecting W types of actions, and fights enemy aircraft that attack itself.
Own-device movement pattern generation means for generating candidates for each destination of the own device that performs an action that moves only for a predetermined time (hereinafter referred to as action unit time T);
A collision determination means for determining whether or not the enemy aircraft collides with an attack bullet that has already been fired at each position in the middle of moving to the respective destination candidates of the own aircraft;
Necessary for moving to a position in the middle of moving to each destination candidate of the own aircraft determined to not collide in the collision judging process when the collision judging means judges that no collision occurs Arrival time difference calculating means for calculating the absolute value of the difference between the time required to move to the position where the attacking bullet newly fired by the enemy aircraft is determined not to collide, and
It is determined whether or not the absolute value of the difference is smaller than a predetermined value, and when the absolute value of the difference is smaller than the predetermined value, the attack target position having the position determined not to collide as the attack target position Position determination means;
Attack bullet launching means for launching a new attack bullet to the enemy aircraft toward the attack target position,
A shooting game processing apparatus comprising: It is a shooting game processing program that displays an own aircraft and enemy aircraft on the screen, moves the aircraft by an operation of selecting W types of actions, and fights enemy aircraft that attack the aircraft.
A self-movement pattern generation process for generating candidates for each movement destination of a self-machine that performs an action that moves only for a predetermined time (hereinafter referred to as action unit time T);
A collision determination process for determining whether or not the enemy aircraft collides with an already-launched attack bullet at each position in the middle of moving to each of the destination candidates of the aircraft,
Necessary to move to a position in the middle of moving to each destination candidate of the aircraft that is determined not to collide in the collision determination process when it is determined that there is no collision in the collision determination process Time difference calculation process for calculating the absolute value of the difference between the time required to move to the position where it is determined that the attacking bullet newly launched by the enemy aircraft does not collide, and
It is determined whether or not the absolute value of the difference is smaller than a predetermined value, and when the absolute value of the difference is smaller than the predetermined value, the attack target position having the position determined not to collide as the attack target position Position determination process;
An attack bullet launching process in which a new attack bullet is fired at the enemy aircraft toward the attack target position,
A shooting game processing program for causing a computer to execute.   A computer-readable recording medium on which the shooting game processing program according to claim 13 is recorded.

Images