JP4804222B2 - Method for determining difficulty level of shooting game, 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 own aircraft for a predetermined time (hereinafter referred to as an action unit time T) by W types of actions a predetermined number of times (hereinafter referred to as D.) Shooting game difficulty determination method, apparatus, program, and recording thereof for quantitatively determining the strength of enemy characters in a shooting game that fights against enemy aircraft that attack the enemy aircraft. It relates to the medium.

  In one-on-one games such as shogi and go, computer games of a type in which a computer program and a person battle each other are widespread. As an index for quantitatively evaluating the strength of the computer program, for example, in the case of shogi, an index is used to indicate how many levels of human pros or amateurs can win the computer program. . In the case of a computer program that solves a stuffed shogi, the strength of the computer program can be evaluated by the number of hands necessary to solve the stuffed shogi. For example, if you can take 200 hand-packed shogi, you can think of the strength of the computer program as 200, and if you can take 1500 hand-packed shogi, you can think of that computer program as 1500.

Also, the difficulty level is adjusted so that even if you are a beginner, you can enjoy shooting games by making it difficult for your aircraft to come into contact with the attacking means by reducing the movement speed as the attacking means gets closer to you. There was a technique to do (for example, refer patent document 1).
Japanese Patent No. 3496149 Jonathan Schaeffer, H. Jaap van den Herik, “Games, computers, and artificial intelligence”, Artificial Intelligence, 2002, Vol. 134, p1-7

In recent years, games using computers have become widespread. Under such circumstances, a shooting game in which a game player operates an own aircraft that simulates a fighter and fights an enemy aircraft that attacks the own aircraft is one of the most popular computer games. It is.
However, unlike one-on-one games such as shogi and go, the enemy aircraft is not limited to one, and in shooting games where the situation changes from moment to moment, such as the enemy aircraft firing an attack bullet There was no method to express the difficulty of shooting games objectively and quantitatively.

  This is because, in a shooting game, how far away the enemy aircraft's algorithm of the shooting game can predict the action of the own device is not directly linked to the difficulty of the shooting game. In a shooting game, the number and speed of enemy aircraft and attack bullets are more directly related to the difficulty level. For this reason, unlike the case of one-on-one games such as shogi and go, the depth of reading of the enemy algorithm cannot be used as an index of the difficulty level of the game.

  Also, even if you measure the difficulty of a game based on the strength of a human player, there is no strict strength class that is officially defined as shogi in a shooting game, so which player There is a problem that it is difficult to obtain reproducible data on whether or not it is strong.

For this reason, there is no quantitative index when adjusting the difficulty balance of a game in the development of a shooting game, and it relies solely on how to make the subject play the game under development and hear the impression regarding the difficulty level. This is the current situation.
Moreover, the technique described in the said patent 3396149 specification is a technique which adjusts a difficulty level, and is not a technique for calculating a difficulty level quantitatively.

  According to the present invention, the operation of displaying the own aircraft and the enemy aircraft on the screen and moving the own aircraft for a predetermined time (hereinafter referred to as behavior unit time T) by W types of actions is performed a predetermined number of times ( In order to show the difficulty level of the shooting game that fights against enemy aircraft that attacks the aircraft, the initialization means starts the action of the aircraft and the enemy aircraft on the screen. Put in position. The own machine movement pattern generation means generates a candidate for each movement destination of the own machine that selects D actions. The enemy aircraft action determining means generates candidates for each destination of the enemy aircraft. The collision determination means determines whether or not the own aircraft collides with an enemy aircraft moving to each destination candidate of the enemy aircraft while moving to each destination candidate of the own aircraft. The collision counting means measures the number of times the collision has occurred and determines the difficulty level of the shooting game.

  It is possible to quantitatively determine the strength of enemy aircraft or the like in the shooting game, and the difficulty level setting of the game becomes easy. In addition, when shooting games are used as a tool for psychophysical experiments when investigating the effects of the game on the human brain, it is possible to give an objective index of game difficulty that is not subject to human psychological bias. It becomes possible.

[Theoretical background]
The own aircraft and the enemy aircraft are placed at a predetermined initial position such as the origin. There may be a plurality of enemy aircraft, and there may be attack bullets fired by the enemy aircraft in the past. The user operates his / her own aircraft at the initial position to fight the enemy aircraft at the initial position. The own device can move only for the action unit time T at W speeds (direction and speed) in one operation. The user can operate the user device an arbitrary number of times (D times). The operation algorithm of the enemy aircraft here is, for example, that the operation of the own aircraft is observed and the result is reflected in the enemy aircraft operation determination. Further, for example, each of the attack bullets fired by the enemy aircraft has a moving speed set when it is fired from the enemy aircraft, and thereafter maintains the constant speed. If your aircraft collides with an enemy aircraft or an attacking bullet fired by the enemy aircraft, your aircraft is destroyed and the game is over there. If the player survives after D operations, the user has won the game.

  In such a game, if the route on which the aircraft has acted by D operations is taken as the behavior pattern, the difficulty level can be calculated quantitatively by the number of death behavior patterns in all the behavior patterns that the aircraft can take. it can. This is because when the number of death behavior patterns is large, the player needs to select a smaller number of safety behavior patterns. Here, the death action pattern is an action pattern in a case where the own aircraft comes into contact with an enemy aircraft or an attack bullet and dies. In addition, the safe action pattern is the pattern of the own aircraft operation that does not approach the fixed distance of the enemy aircraft or attack bullets, that is, the own aircraft does not contact the enemy aircraft or attack bullets It is a behavior pattern in case. Between the number of all behavior patterns, the number of death behavior patterns, and the number of safety behavior patterns, the relationship of the number of all behavior patterns = the number of death behavior patterns + the number of safety behavior patterns is established.

  The safe behavior pattern and the death behavior pattern are described by a behavior decision tree, and the number of decision tree branches corresponds to the number of behaviors in which the aircraft survives or dies. Therefore, it is considered that the number of death action patterns should be obtained from the total number of action selections in which the own aircraft collides with enemy aircraft or attack bullets. However, what should be noted here is the depth of action selection in which a collision occurs in the action decision tree. Collisions at shallow depths impose an urgent decision on your own choice of action. For this reason, even in the same collision, a collision at a shallow depth should be evaluated larger than a collision at a deep depth.

Here, as described above, the number of types of actions that the own machine can select in one action is W, the upper limit of the number of action selections of the own machine is D, and the own machine where the collision has occurred The depth of the selected action, that is, the number of times that the aircraft has already selected an action when a collision occurs is d, the number of cases where the aircraft has collided with an enemy aircraft or an attack bullet is W ^{( D-d)} can be counted. By calculating W ^(D−d) , it is possible to count the number of collisions occurring at a certain depth d, assuming that collisions have occurred in all the branches in the subsequent action decision tree. . For this reason, it is possible to appropriately grasp the strength of the enemy aircraft by counting the number of collisions with W ^(D−d) .

By calculating W ^(D−d) for all collisions and adding all these W ^(D−d) , the number of death behavior patterns can be calculated. For example, the difficulty level of the shooting game is obtained by dividing the number of death behavior patterns by all the behavior patterns.

For example, it is assumed that W = 3 and D = 3, and it is assumed that a collision occurs at * 1, * 2, * 3 as shown in FIG. In this case, the number of death patterns can be calculated as follows. In FIG. 3, a solid line represents a trajectory drawn by the own device when an action with movement speed number 0 is selected at each depth d. A broken line represents a trajectory drawn by the own device when an action of movement speed number 1 is selected at each depth d. The alternate long and short dash line represents a trajectory drawn by the own device when the action of movement speed number 2 is selected at each depth d. * Since the collision at 1 is a collision at d = 2, it can be counted by W ^(D−d) = 3 ^(3-2) = 3. * Since the collision at 2 is a collision at d = 3, it can be counted as W ^(D−d) = 3 ^(3-3) = 1. * Since the collision at 3 is a collision at d = 1, it can be counted as W ^(D−d) = 3 ^(3-1) = 9. The sum of all of these W ^(D−d) is 3 + 1 + 9 = 13, which is the number of death patterns. This number of death patterns coincides with the number of death patterns when it is assumed that a collision has occurred in all branches in the action decision tree after the collision has occurred. In this example, since the number of all action patterns is W ^D = 3 ³ = 27, the difficulty level of the shooting game is, for example, (number of death action patterns) / (number of all action patterns) = 13/27 ≈0.48148...

  The death behavior pattern can be obtained by performing search calculation in the technical field of artificial intelligence. In the embodiment described below, 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 for child nodes with priority. 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 and a collision occurs, the route 10 is searched.

[Embodiment]
With reference to FIGS. 1 and 2, a shooting game difficulty level determination apparatus 1000 for carrying out the shooting game difficulty level determination method according to the present invention will be described. FIG. 1 is a diagram illustrating a functional configuration example of a shooting game difficulty level determination device 1000. FIG. 2 is a diagram illustrating a processing example of the shooting game difficulty level determination device 1000.

The shooting game difficulty level determination device 1000 includes, for example, an own machine movement pattern generation unit 10, an enemy aircraft action determination unit 20, a collision determination unit 30, a difficulty level calculation unit 40, a difficulty level data storage unit 50, and an own machine movement pattern buffer 51. The enemy attack state buffer 52 is configured.
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 enemy aircraft action determination unit 20 includes, for example, an enemy aircraft movement speed determination unit 201, a storage unit 202, an enemy aircraft attack bullet firing speed determination unit 203, and a control unit 204.
The difficulty level calculation unit 40 includes, for example, a power calculation unit 401, a collision count unit 402, and a normalization unit 403.

It is assumed that the movement speed allowed for the own aircraft, that is, the combination of direction and speed, is W, and each movement speed is assigned a number j (1 ≦ j ≦ W). The moving speed number at the depth d is J (d). Further, it is assumed that movement is performed for each action speed for the action unit time T, and that one action unit is one branch of the decision tree. The own aircraft selects the action D times. That is, the maximum value of the maximum depth d is D. W and D may be arbitrary values. For example, W = 9 and D = 10 can be set. It is assumed that the preset values of W and D are stored in the storage unit 105 of the own movement pattern generation unit 10. Also, it is assumed that the own device acts on the orthogonal x, y coordinate plane. Each of the W types of movement speeds (Vx (j), Vy (j)) is also set in advance and is stored in the storage unit 105 of the own movement pattern generation unit 10. When W = 9, for example,
(Vx (0), Vy (0)) = (0, 1),
(Vx (1), Vy (1)) = (1,1),
(Vx (2), Vy (2)) = (1, 0),
(Vx (3), Vy (3)) = (1, −1),
(Vx (4), Vy (4)) = (0, −1),
(Vx (5), Vy (5)) = (-1, -1),
(Vx (6), Vy (6)) = (-1, 0),
(Vx (7), Vy (7)) = (-1, 1),
(Vx (8), Vy (8)) = (0, 0),
It can be.

  As for the length of the action unit expressing the action of the own machine, if the size of the own machine is not 0, an area that cannot be covered by the area that the own machine sweeps by moving 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 degree of difficulty more accurately, 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 may be set as the action unit time T. It is assumed that the action unit time T set in advance in this way is also stored in the storage unit 105 of the own device movement pattern generation unit 10.

  In addition, the elapsed time from the start of the action of the aircraft by t and the position of the enemy aircraft i at the time t (Xi (t), Yi (t)). This is a case where an attack bullet is taken into consideration. The position of the k-th attack bullet launched by the enemy aircraft i at time t is (Xbik (t), Ybik (t)), and the position of the own aircraft at time t is (Xs (T), Ys (t)), and the moving speed of the own machine of moving speed number j is (Vx (j), Vy (j)).

<Step S1>
The initialization unit 101 of the own device movement pattern generation unit 10 stores t = 0 and d = 1 in the buffer 103. In addition, the initialization unit 101 sets the position (Xs (0), Ys (0)) of the own device at time t, for example, to the origin (0, 0). Setting the initial position (Xs (0), Ys (0)) to the origin (0, 0) is an example, and may be set to an arbitrary position. The initialization unit 101 also determines the position of the enemy aircraft i (Xi (t), Yi (t)) and the position of the attack bullet (Xbik (t)) when the enemy aircraft has fired an attack bullet in the past. , Ybik (t)) is set to an arbitrary position.

<Step S2>
The control unit 102 of the own device movement pattern generation unit 10 sets J (d) = 0.

<Step S3>
The control unit 102 of the own device movement pattern generation unit 10 stores the values of J (d) and (Xs (t), Ys (t)) in the own device movement pattern buffer 51, respectively. That is, when d = 1, J (1) = 0 is stored in the own movement pattern buffer 51. When (Xs (0), Ys (0)) = (0, 0), (Xs (0), Ys (0)) = (0, 0) is stored in the own movement pattern buffer 51. Will be.
In addition, the control unit 102 of the own aircraft movement pattern generation unit 10 determines the position of the enemy aircraft (Xi (t), Yi (t)) and the position of the attacking bullet (Xbik (t), Ybik (t)) at time t. And stored in the enemy aircraft attack 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. 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 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 104 of the own machine movement pattern generation unit 10 moves after the movement speed (Vx (J (d)), Vy (J (d)) of the own machine for an increment width of t. Specifically, the position updating unit 104 calculates (τ × Vx (J (d)), τ × Vy (J (d))), where t is an increment width of τ. 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 aircraft, that is, the updated position (Xs (t), Ys (t)) of the own aircraft is output to the enemy aircraft action determination unit 20.

<Step S5>
The enemy aircraft movement speed determination unit 201 of the enemy aircraft action determination unit 20 uses the positions of the enemy aircraft (Xi (t), Yi (t) based on the position of the own aircraft (Xs (t), Ys (t)). )) And the position of the attacking bullet (Xbik (t), Ybik (t)). That is, the position of the enemy aircraft (Xi (t), Yi (t)) and τ after moving for τ time according to the algorithm of the enemy aircraft's action considering the position of the own aircraft (Xs (t), Ys (t)) The attack bullet position (Xbik (t), Ybik (t)) after the elapse of time is calculated.

  A well-known algorithm can be used as the algorithm of the action of the enemy aircraft in consideration of the position of the own aircraft. For example, an algorithm in which an enemy aircraft moves so as to approach the position of the own aircraft, or an algorithm in which the enemy aircraft moves so as to always keep the position with the own aircraft at a certain distance and direction can be used. It is also possible to use algorithms that do not take into account the position of the aircraft, for example, algorithms that keep the enemy aircraft descending regardless of the location of the aircraft, or algorithms that keep the enemy aircraft stationary regardless of the location of the aircraft. it can.

  For example, the enemy aircraft movement speed determination unit 201 determines the speed (Vix (t), Viy (t)) of the enemy aircraft according to any one of the above-described enemy aircraft action algorithms. Then, the enemy aircraft moving speed determination unit 201 calculates (τ × Vix (t), τ × Viy (t)) to obtain the displacement amount of the enemy aircraft position. The position (Xi (t−τ), Yi (t−τ)) of the enemy aircraft before update stored in the storage unit 202 of the enemy aircraft action determination unit 20 is read, and the calculated displacement amount of the enemy aircraft ( By adding (τ × Vix (t), τ × Viy (t)), the position (Xi (t), Yi (t)) of the updated enemy aircraft is obtained.

Further, the enemy aircraft moving speed determining unit 201 reads the attacking bullet speed (Vbikx (t), Vbiky (t)) stored in the storage unit 202, and also reads the result obtained by multiplying this by τ from the storage unit 202. Further, the post-update attack bullet position (Xbik (t), Ybik (t)) is obtained by adding to the pre-update attack bullet position (Xbik (t-τ), Ybik (t-τ)).
Also, the enemy aircraft attack bullet firing speed determination unit 203 fires a new attack bullet using a known algorithm according to the updated position (Xs (t), Ys (t)) of the own aircraft. Anyway.

The updated enemy aircraft positions (Xi (t), Yi (t)) and the updated attack bullet positions (Xbik (t), Ybik (t)) are stored in the storage unit 202. Also, the updated enemy aircraft position (Xi (t), Yi (t)) and the updated attack bullet position (Xbik (t), Ybik (t)) are the updated own aircraft position (Xs (T) and Ys (t)) are output to the collision determination unit 30.
The updated enemy aircraft positions (Xi (t), Yi (t)) and the updated attack bullet positions (Xbik (t), Ybik (t)) are output to the own aircraft movement pattern generation unit 10. Is done.

<Step S6>
The collision determination unit 30 determines whether the own aircraft and the enemy aircraft, or the own aircraft and the attack bullet have collided. Whether or not a collision has occurred is set in advance, and is output from the enemy aircraft action determination unit 20 and the shape of the own aircraft, the shape of the enemy aircraft, the shape of the attacking bullet stored in the storage unit in the collision determination unit 30 (not shown) Updated enemy aircraft position (Xi (t), Yi (t)), updated attack bullet position (Xbik (t), Ybik (t)), updated position (Xs ( t), Ys (t)). For example, when the shape of the own aircraft placed at the updated position and the shape of the enemy aircraft placed at the updated position overlap, it can be determined that the own aircraft and the enemy aircraft have collided. When the shape of the own aircraft placed at the updated position and the shape of the enemy aircraft 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 10. Then, the process of step S7 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 10 and the difficulty level calculation unit 40. 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 determines whether or not the action unit time T has elapsed since 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 next process returns to step S4. That is, steps S4 to S7 are repeated until the action unit time T elapses from when t is step S3. If t ≧ dT, the next process proceeds to step S8.

<Step S8>
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 S9>
The control unit 102 of the own device movement pattern generation unit 10 determines whether d read from the buffer 103 is larger than D stored and set in the storage unit 105 in advance. That is, it is determined whether D <d. In addition, D can be set to 5-10, for example.
If it is determined that D ≧ d, the control unit 102 returns to step S2 to perform processing.
When it is determined that D <d, the control unit 102 performs the process of step S10.

<Step S10>
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 S11>
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, J (d) stored in own device movement pattern buffer 51 is read and incremented by one. The incremented J (d) is stored in the own movement pattern buffer 51.

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

<Step S13>
The control unit 102 of the own aircraft movement pattern generation unit 10 reads the position of the enemy aircraft at the time t (Xi (t), Yi (t)), the updated attack bullet position (Xbik ( t), Ybik (t)). Thereafter, the process returns to step S3.

<Step S14>
If it is determined in step S6 that there is a collision, the power calculation unit 401 of the difficulty level calculation unit 40 reads the d read from the buffer 103 of the own device movement pattern generation unit 10 and the own device movement pattern generation unit 10. The number of collisions W ^(D−d) is calculated using W and D read from the storage unit 105 read from the buffer 103. The calculated number of collisions W ^(D−d) is output to the collision counting unit 402.
The collision count unit 402 continues to add the number of collisions W ^(D−d) calculated every time there is a collision until the processing flow of the shooting game difficulty level determination method according to the present embodiment is completed in step S15.

<Step S15>
If it is determined in step S12 that W <J (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 returns to step S10.
When it is determined that d = 1, the control unit 102 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 difficulty level calculation unit 40. The collision count unit 402 of the difficulty level calculation unit 40 that has received the signal indicating that the processing flow has been completed outputs the number of collisions added up to now to the normalization unit 403. Normalization unit 403, the W and D read from the storage unit 105 of its own movement pattern generating unit 10, calculates the number W ^D of all behavioral patterns. Normalization unit 403, the number of collisions yelling added to the now divided by the number W ^D of all behavior patterns, determine the degree of difficulty of shooting game. The division result is output to the difficulty level data storage unit 50.
The above is the outline of the functional configuration and processing example of the difficulty determination device for a shooting game according to the present embodiment.

[Modifications, etc.]
In the above embodiment, the number of death behavior patterns, i.e., the number of collisions, is counted as the difficulty level of the shooting game. However, the number of safety behavior patterns, i.e., the number of collisions, is counted to determine the difficulty level of the shooting game. It is also good. In this case, the shooting game difficulty level determination device 1000 performs the process shown in FIG. In the processing shown in FIG. 5, the processing in step S6 ′, step S9 ′, and step S14 ′ 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 S6 '>
When it is determined by the collision determination unit 30 that there is no collision by the same collision determination method as described in the description of step S6, a signal indicating that there is no collision is output to the own movement pattern generation unit 10. Is done. 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 S11 is performed.

<Step S9 '>
The control unit 102 of the own device movement pattern generation unit 10 determines whether d read from the buffer 103 is larger than D stored and set in the storage unit 105 in advance. That is, it is determined whether D <d. In addition, D can be set to 5-10, for example.
If it is determined that D ≧ d, the control unit 102 returns to step S2 to perform processing.
If it is determined that D <d, the control unit 102 performs the process of step S14 ′.

<Step S14 '>
When it is determined in step S9 ′ that D <d, the control unit 102 of the own device movement pattern generation unit 10 sends a signal indicating that the own device has survived to the survival calculation of the difficulty level calculation unit 40. The data is sent to the pattern count unit 404. The surviving movement pattern counting unit 404 counts the number of times the signal indicating that the own device has survived is received.
When a signal indicating that the processing flow has been completed is received from the own device movement pattern generation unit 10, the surviving movement pattern counting unit 404 has received a signal indicating that the own device has survived, which has been counted so far. Is sent to the normalization unit 403.
In this way, the number of safe behavior patterns, that is, the number of non-collisions, can be counted to obtain the difficulty level of the shooting game.

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 degree of difficulty of the shooting game may be obtained by the collision count means 402 or the surviving movement pattern counting unit 404 counting the number of collisions or the number of collisions that the unit 30 checks.

  Further, the following step S6 ″ is performed between step S6 and step S7 in the flowchart illustrated in FIG. 2 and between step S6 ′ and step S7 in the flowchart illustrated in FIG. Also good.

<Step S6 ''>
Receiving the signal that there was no collision, the control unit 102 of the own-movement pattern generation unit 10 indicates that the updated enemy aircraft position (Xi (t), Yi (t)) Determine if it is on the line. For example, when the aircraft fires an attack bullet in the Y-axis direction (upward on the screen), the updated enemy aircraft's X-axis position Xi (t) and the updated aircraft's Y-axis direction An absolute value d (Xi (t), Xs (t)) of a difference from the position Xs (t) is calculated, and it is determined whether or not the calculation result is smaller than a predetermined value 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 (Xi (t), Xs (t)) <a, it can be considered that the enemy aircraft was destroyed by the attack bullet of its own aircraft. A signal indicating the destruction is sent to the enemy aircraft action determination unit 20 and the collision determination unit 30, and then the process of step S7 is performed. Upon receiving the signal, the enemy aircraft action determination unit 20 stops updating the position of the enemy aircraft considered to be destroyed in the subsequent processing. Further, in the subsequent processing, the control unit 102 does not perform processing such as reading / writing to the buffer at the position of the enemy aircraft considered to be destroyed. Further, the collision determination unit 30 that has received the signal does not determine the collision between the own aircraft and the enemy aircraft considered to have been destroyed in the subsequent processing.
When d (Xi (t), Xs (t)) ≧ a, the control unit 102 performs the process of step S7.

  Further, in the above embodiment, the normalization unit 403 normalizes the number of collisions added by the collision counting unit 402 and the number of times that the survival movement pattern counting unit 404 has received a signal indicating that the own device has survived, The normalized value was output to the difficulty data storage unit 50. However, the number of collisions added by the collision counting unit 402 and the number of times that the signal indicating that the own device has survived counted by the surviving movement pattern counting unit 404 may be output to the difficulty level data storage unit 50 as they are. . Even if the normalization unit 403 does not normalize, the number of collisions added by the collision counting unit 402 and the number of times that the surviving movement pattern counting unit 404 has received the signal indicating that the aircraft has survived are also in a broad sense of difficulty. It is because it can be understood as.

  The processing function of the shooting game difficulty level determination device 1000 can be realized by a computer. In this case, the content of the processing function of the shooting game difficulty level device is described by a program. Then, by executing this program on the computer, the processing functions of the shooting game difficulty level determination device 1000 are realized on the computer as shown in FIG.

  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 method for determining the difficulty level of a shooting game according to the present invention, the apparatus thereof, and the like 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 functional structure of the shooting game difficulty level determination apparatus. The figure which illustrated the process of the shooting game difficulty determination apparatus. The figure for demonstrating the counting method of the frequency | count of a collision. The figure for demonstrating the method of a vertical search. The figure which illustrated the process of the shooting game difficulty determination apparatus. The figure which illustrated functional composition when a shooting game difficulty level judging device is performed with a computer. The figure which showed the modification of the process of the shooting game difficulty determination apparatus illustrated in FIG. The figure which showed the modification of the process of the shooting game difficulty determination apparatus illustrated in FIG.

Explanation of symbols

1 Own aircraft 2 Enemy aircraft 3 CPU
4 RAM
DESCRIPTION OF SYMBOLS 5 Output part 6 Auxiliary memory | storage part 7 Input part 8 Bus 10 Own machine movement pattern production | generation part 20 Enemy machine action determination part 30 Collision judgment part 40 Difficulty degree calculation part 50 Difficulty degree data storage part 51 Own machine movement pattern buffer 52 Enemy machine attack State buffer 101 Initialization unit 102 Control unit 103 Buffer 104 Position update unit 105 Storage unit 201 Enemy aircraft movement speed determination unit 202 Storage unit 203 Enemy aircraft attack bullet firing speed determination unit 204 Control unit 401 Multiplication calculation unit 402 Collision calculation unit 403 Regular Conversion unit 404 Survival movement pattern count unit 1000 Shooting game difficulty determination device

Claims (12)

A computer having initialization means, own-machine movement pattern generation means, enemy aircraft action determination means, collision determination means, and count means displays the own aircraft and enemy aircraft on the screen, and An operation that moves a predetermined number of times (hereinafter referred to as “D”) by moving a predetermined time (hereinafter referred to as “action unit time T”) depending on the type of action and A method of presenting the difficulty level of a fighting shooting game,
An initialization process in which the initialization means places the own aircraft and enemy aircraft at the action start position on the screen,
The own machine movement pattern generation means generates a candidate for each movement destination of the own machine that selects D times of action,
The enemy aircraft action determination means generates enemy aircraft destination candidates, and the enemy aircraft action determination process,
A collision determination process in which the collision determination means determines whether or not the own aircraft collides with an enemy aircraft moving to each destination candidate of the enemy aircraft while moving to each destination candidate of the own aircraft. When,
A counting process in which the counting means measures the number of times the collision has occurred and determines the difficulty level of the shooting game;
A method for determining a difficulty level of a shooting game, comprising: A method for determining a difficulty level of a shooting game according to claim 1,
The power calculation means further includes a power calculation process for calculating W (D−d), where d is the number of actions performed by the aircraft when the collision occurs when there is a collision,
The counting process is a process of counting the value obtained in the power calculation process as the number of collisions,
The aircraft movement pattern generation process is a process in which, when the collision occurs, a candidate for the movement destination of the aircraft after the location where the collision has occurred is not generated.
A method for determining the difficulty level of a shooting game. A method for determining a difficulty level of a shooting game according to claim 1,
The counting process is a process of determining the difficulty level of the shooting game by measuring the number of times the collision has not occurred instead of the number of times the collision has occurred .
A method for determining the difficulty level of a shooting game. A method for determining a difficulty level of a shooting game according to any one of claims 1 to 3 ,
Is normalized unit, a result of the counting process is measured, divided by the WD is the number of destination candidates of its own which selects the actions of the D times, and difficulty of the shooter the calculation result Normalization process,
A method for determining a difficulty level of a shooting game, further comprising : A method for determining a difficulty level of a shooting game according to claim 1,
The enemy aircraft action determining process is a process of generating enemy aircraft destination candidates based on the respective destination candidates of the own aircraft.
A method for determining the difficulty level of a shooting game. A method for determining a difficulty level of a shooting game according to any one of claims 1 to 5,
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 determining the difficulty level of a shooting game. A method for determining a difficulty level of a shooting game according to any one of claims 1 to 6,
There are multiple enemy aircraft,
A method for determining the difficulty level of a shooting game. A method for determining a difficulty level of a shooting game according to any one of claims 1 to 7,
The above initialization process is a process of placing an attack bullet fired by an enemy aircraft in the past at the action start position on the screen,
The enemy aircraft action determination process is a process of generating candidates for the destinations of the attack bullets,
The collision determination process is a process of further determining whether or not the own aircraft collides with an attack bullet that moves to each of the attack bullet candidates.
A method for determining the difficulty level of a shooting game. A method for determining a difficulty level of a shooting game according to any one of claims 1 to 8,
The ray determining means further includes a ray determining process for determining whether the enemy aircraft is on the ray of the own aircraft,
The enemy aircraft action determination process is a process that does not generate a candidate for each destination of the enemy aircraft that is determined to be on the ray in the ray determination process.
The collision determination process is a process in which it is not determined whether or not the enemy aircraft determined to be on the ray in the ray determination process collides with the own aircraft.
A method for determining the difficulty level of a shooting game. An operation of displaying the own aircraft and the enemy aircraft on the screen and moving the own aircraft for a predetermined time (hereinafter referred to as an action unit time T) by W types of actions is assumed to be a predetermined number of times (hereinafter referred to as D). ) Is a device that presents the difficulty level of a shooting game that fights against enemy aircraft that attack your aircraft.
An initialization means for placing the aircraft and enemy aircraft at the action start position on the screen;
Own machine movement pattern generation means for generating candidates for each movement destination of the own machine that selects D actions;
Enemy aircraft action determining means for generating candidates for each destination of the enemy aircraft,
Collision determination means for determining whether or not the own aircraft collides with an enemy aircraft moving to each destination candidate of the enemy aircraft while moving to each destination candidate of the own aircraft;
Counting means for measuring the number of times the collision has occurred and determining the difficulty level of the shooting game;
A shooting game difficulty level determination device characterized by comprising: An operation of displaying the own aircraft and the enemy aircraft on the screen and moving the own aircraft for a predetermined time (hereinafter referred to as an action unit time T) by W types of actions is assumed to be a predetermined number of times (hereinafter referred to as D). ) Is a program that presents the difficulty level of a shooting game that fights against enemy aircraft that attack your aircraft.
An initialization process in which the aircraft and enemy aircraft are placed at the action start position on the screen,
A self-movement pattern generation process for generating candidates for each movement destination of the self-machine that selects D actions,
Enemy aircraft action determination process that generates candidates for each destination of the enemy aircraft,
A collision determination process for determining whether or not the own aircraft collides with an enemy aircraft moving to each destination candidate of the enemy aircraft in the middle of moving to each destination candidate of the own aircraft;
A counting process for measuring the number of times the collision has occurred and determining the difficulty level of the shooting game;
Shooting game difficulty level determination program for causing a computer to execute the.   The computer-readable recording medium which recorded the shooting game difficulty determination program of Claim 11.

Images