JP7286740B2 - Game program and recording medium - Google Patents

Description

Article 30, Paragraph 2 of the Patent Act applies January 23-24, 2016 Released the game "Yokai Sangokushi" at the Next Generation World Hobby Fair '16 Winter

Application of Article 30, Paragraph 2 of the Patent Law March 28, 2016 Announced the game "Yokai Sangokushi" at a completion presentation held in Tokyo

Application of Article 30, Paragraph 2 of the Patent Act February 15, 2016 Released the game "Yokai Sangokushi" on the official website (http://www.youkai-watch.jp/sangokushi/)

Article 30, paragraph 2 of the Patent Act applies March 25, 2016 Video distribution site (https://www.youtube.com/watch?v=wMlSACtP7pU&index=9&list=PLMt_VfjRBaIPt22PIQPBOP5qzY162Ab_4) Sangokushi! This is the new Yokai World!"

Application of Article 30, Paragraph 2 of the Patent Act March 31, 2016 Video distribution site Unveiled in Japan for the first time!

Article 30, Paragraph 2 of the Patent Act applies February 20, 2016 Nintendo DREAM April 2016 issue, page 91, published the game "Yokai Sangokushi"

February 20, 2016 Dengeki Nintendo (Nintendo) April 2016 issue, pp. 42-45 published the game "Yokai Sangokushi"

Application of Patent Law Article 30, Paragraph 2 February 21, 2016 Monthly CoroCoro Ichiban! Published the game "Yokai Sangokushi" in the April 2016 issue, pages 14-17

Application of Patent Act Article 30, Paragraph 2 March 15, 2016 Monthly CoroCoro Comic April 2016 No. 456 Released the game "Yokai Sangokushi" on Furoku (Yokai Sangoku Times)

Application of Article 30, Paragraph 2 of the Patent Law March 17, 2016 Weekly Famitsu 2016/3/31 No. 1424, page 192-193 released the game "Yokai Sangokushi"

Application of Article 30, Paragraph 2 of the Patent Law March 31, 2016 Weekly Famitsu 2016/4/14 No. Game "Yokai Sangokushi" released on page 1426, 3

Article 30, Paragraph 2 of the Patent Act applied April 2, 2016 Game “Yokai Sangokushi” sold

The present invention relates to a game program and a recording medium on which this game program is recorded.

2. Description of the Related Art Conventionally, a strategy simulation game is known in which enemy and ally camps move their units to compete against each other on a map. In this type of strategy simulation game, for example, the capture of the enemy's base or the annihilation of the enemy units are set as victory conditions. (See Patent Document 1, for example).

JP 2007-75430 A

In a strategy simulation game, where you move allied units on the map greatly affects the battle situation. For this reason, the player needs to proceed with the game while considering the positional relationship and strength of the allied units and the enemy units, and devising a strategy. However, when the player is a child or a beginner who is unfamiliar with strategy simulation, there is a problem that the strategy simulation game requiring complicated strategies cannot proceed smoothly and the game cannot be enjoyed. rice field.

SUMMARY OF THE INVENTION The present invention has been made in view of such problems. An object of the present invention is to provide a recording medium that

In order to achieve the above object, a game program according to the present invention is a game program for performing game processing in which units placed in a game field are moved in units of divisions set in the game field, the game program comprising: an information processing apparatus; a section evaluation processing unit that evaluates each of the plurality of sections existing within a movable range of the unit operated by the player based on a predetermined evaluation standard; and based on the evaluation result of the section evaluation processing section. a section determination processing unit for determining the section recommended as a destination of the unit, a selection request processing unit for requesting selection of whether to move the unit to the section determined by the section determination processing unit; It functions as a unit movement processing section that moves the unit to the section determined by the section determination processing section when movement is selected in response to a request by the selection request processing section.

According to the game program of the present invention, evaluation is performed based on predetermined evaluation criteria for each of the plurality of sections existing within the movable range of the unit operated by the player, and based on the evaluation result, predetermined (i.e. the one with the highest rating) is recommended as the destination for the unit. Then, the player is requested to select whether or not to move the unit to the recommended zone, and if he/she chooses to move the unit, the unit is moved to the recommended zone.

As a result, the player can move the unit to, for example, a strategically superior zone simply by performing a simple operation of selecting to move to the recommended zone. Therefore, even if the player is a child or a beginner who is unfamiliar with strategy simulation, the game can be easily progressed and the game can be enjoyed.

Also, the player can easily and efficiently learn how to play the game by referring to the recommended sections. This eliminates the need for strategy guides, strategy data, and the like, and has the effect of hastening the progress of the player.

Further, in the game program of the present invention, preferably, when the unit movement processing section selects not to move in response to a request by the selection request processing section, the unit moves to the section determined by the player's input. Move the unit.

If the player improves as he progresses through the game, or if he is accustomed to the strategy simulation game, he may want to select the destination of the unit himself. Also, depending on the battle situation, the player's strategy, etc., the division determined by the division determination processing unit may not necessarily be advantageous to the battle situation.

Therefore, in the present invention, when the player selects not to move in response to the request from the selection request processing section, the player can move the unit to any zone according to his/her own instruction. This makes it possible to meet the needs of the player who wants to move the unit by himself. In addition, for example, it is possible to play the game by following the movement recommended by the game program in normal situations, while selecting the movement destination by oneself in important situations such as boss battles, thereby achieving both convenience and strategy.

In the game program of the present invention, preferably, the section evaluation processing section performs the evaluation for each of the plurality of sections based on actions that the unit can perform after moving to the section.

According to the present invention, since the behavior after the movement of the unit (attack, activation of special skill or magic, use of items, etc.) is also evaluated, it is possible to recommend a section more strategically. In addition, by evaluating the action at the destination when evaluating the destination, the amount of calculation can be reduced compared to, for example, the case of evaluating the action that can be executed in the section after moving to the section. Therefore, the burden on the information processing device can be reduced.

Further, preferably, the game program of the present invention causes the information processing device to perform the section evaluation process when the unit is moved to the section determined by the section determination processing section by the unit movement processing section. It further functions as a recommended action presentation processing section that presents a recommended action from among a plurality of actions executable by the unit based on the evaluation result of the unit.

As a result, it is possible to present the player with suitable actions according to the scene of the game, the battle situation, or the like. Therefore, even if the player is a child or a beginner who is unfamiliar with strategy simulation, the game can be easily progressed and the game can be enjoyed.

Further, in the game program of the present invention, preferably, the same operation unit as the operation unit operated when the information processing device is selected to move in response to a request by the selection request processing unit is operated. a recommended action determination processing unit for determining execution of the action presented by the recommended action presentation processing unit, an action execution processing unit for causing the unit to execute the action determined by the recommended action determination processing unit, function further as

Thereby, the player can move to the recommended section and perform the recommended action by operating the same operation unit. As a result, the game can be progressed only by operating the same operating unit, so that convenience for the player can be greatly improved. Also, since the game can be simplified, it is particularly effective when the player is a child.

Further, the game program of the present invention preferably causes the information processing device to set a predetermined priority action (achievement of a victory condition, achievement of a defeat condition) as an action executable by the unit within the movable range. blocking, etc.) is further functioned as a priority action determination processing unit that determines whether or not the priority action determination processing unit determines that the priority action is included. does not evaluate the partition, and evaluates each of the plurality of partitions when it is determined that the action to be prioritized is not included, and the partition determination processing unit performs the priority action determination processing If the section determines that the action to be prioritized is included, it determines that the action to be prioritized is executable in the section.

During the player's turn in the strategy simulation game, there are cases where, for example, a victory condition can be achieved or a defeat condition can be prevented depending on the action of the unit operated by the player. In such a case, it is preferable from the point of view of game strategy to unconditionally execute the above actions.

In the present invention, when the unit operated by the player can execute such a priority action, the section determination processing section can execute the priority action without evaluating the section by the section evaluation processing section. decide on a partition. As a result, the player can unconditionally cause the unit to execute the above action, and the game can be advanced strategically.

In addition, the game program of the present invention provides a game program in which an information processing device is placed at a plurality of locations on a game map, and the information processing device is installed at each of a plurality of bases, each of which is set with a placement frame that is the number of units that can be placed at each base. It functions as a rearrangement processing section that rearranges the arranged units according to a predetermined rule.

In a strategy simulation game, for example, ally units and enemy units compete with each other for bases to expand their positions.

According to the present invention, the player can relocate a friendly unit to, for example, a strategically superior base simply by performing a very simple operation such as one-button operation. Therefore, the player's convenience can be improved, and even if the player is a child or a beginner unfamiliar with strategy simulation, the game can be easily progressed and the game can be enjoyed.

In the game program of the present invention, preferably, the game program is a game program for processing a game in which allied forces and enemy forces take over the bases from each other and expand their territory, and the rearrangement processing unit rearranges the plurality of units so that the units placed at the base adjacent to the enemy's position do not move.

Since it is conceivable that the player arranges his own units according to his own strategy, preference, etc., at bases adjacent to the enemy's camp, it is not desirable to change the arrangement.

Therefore, in the present invention, by rearranging the units placed at the bases so that they do not move, convenience can be improved without interfering with the player's strategy or preferences.

Further, in the game program of the present invention, preferably, the rearrangement processing unit extracts the units arranged at the bases not adjacent to the enemy's camp, , the extracted units are arranged in descending order of strength.

As a result, units placed at bases with low strategic priority can be automatically moved to bases with high strategic priority in descending order of strength. Therefore, it is possible to increase the strength of the base adjacent to the enemy's position.

To achieve the above object, a recording medium of the present invention is a recording medium that records the above game program and is readable by an information processing device.

According to the game program and recording medium of the present invention, even if the player is a child or a person unfamiliar with strategy simulation games, the game can be easily progressed.

1 is an explanatory diagram illustrating an example of an external configuration of an information processing apparatus according to an embodiment; FIG. FIG. 4 is an explanatory diagram showing an example of a game map screen provided by executing a game program by an information processing device; FIG. 4 is an explanatory diagram showing an example of a battle screen of a game provided by executing a game program by an information processing device; 2 is a block diagram showing an example of a functional configuration related to recommended movement of an information processing device; FIG. It is an explanatory view showing an example of a game screen. It is an explanatory view showing an example of a game screen. It is an explanatory view showing an example of a game screen. 6 is a flowchart showing an example of a processing procedure related to recommended movement and the like executed by a CPU of an information processing device; FIG. 4 is a block diagram showing an example of a functional configuration related to a lottery for activation effects of an information processing device; It is an explanatory view showing an example of a game screen. FIG. 10 is an explanatory diagram showing an example of winning probability for each rank; It is an explanatory view showing an example of a game screen. It is an explanatory view showing an example of a game screen. It is an explanatory view showing an example of a game screen. FIG. 10 is a flowchart showing an example of a processing procedure related to a lottery for activation effects executed by a CPU of an information processing device; FIG. 2 is a block diagram showing an example of a functional configuration related to automatic unit rearrangement, etc. of an information processing apparatus; FIG. 4 is a flowchart showing an example of a processing procedure related to automatic unit rearrangement, etc., executed by the CPU of the information processing apparatus; FIG. 10 is an explanatory diagram for explaining a specific example of a processing procedure related to automatic unit rearrangement; FIG. 10 is an explanatory diagram for explaining a specific example of a processing procedure related to automatic unit rearrangement; FIG. 10 is an explanatory diagram for explaining a specific example of a processing procedure related to automatic unit rearrangement; FIG. 10 is an explanatory diagram for explaining a specific example of a processing procedure related to automatic unit rearrangement; It is a block diagram showing an example of the hardware constitutions of an information processing apparatus. FIG. 4 is an explanatory diagram showing an example of an external configuration when the information processing device is a portable game machine having two display units; 1 is an explanatory diagram showing an example of the overall configuration when the information processing device is a stationary game machine; FIG.

An embodiment of the present invention will be described below with reference to the drawings.

<1. Appearance Configuration of Information Processing Device>
First, an example of the external configuration of an information processing apparatus 1 according to this embodiment will be described with reference to FIG. As shown in FIG. 1, the information processing apparatus 1 is a portable game machine that can be carried by a player to play a game. The information processing device 1 has an operation unit 3 and a display unit 5 .

The player uses the operation unit 3 to perform various input operations. In the example shown in FIG. 1, the operation unit 3 includes the cross key 7, buttons 9 and 11, etc., but may include other buttons, a joystick, a touch panel, and the like. The button 9 is a determination button (hereinafter also referred to as the "A button") for determining the destination, command, etc. selected by the cross key 7, and the button 11 is for canceling items determined by the A button 9. This is a cancel button (hereinafter also referred to as a "B button" as appropriate) for canceling.

The display unit 5 is composed of, for example, a liquid crystal display or an organic EL display, and performs various displays such as game screens. Although not shown, the information processing apparatus 1 is also provided with speakers for outputting various sounds related to the game.

The information processing device 1 is not limited to a portable game machine, and may be a stationary game machine. In addition to game machines, for example, server computers, desktop computers, notebook computers, tablet computers, etc., which are manufactured and sold as computers, as well as mobile phones, smartphones, phablets, etc. It also includes those manufactured and sold as telephones.

<2. Overview of the game>
Next, with reference to FIGS. 2 and 3, an example of the outline contents of the game according to the present embodiment, that is, the game provided by executing the game program of the present invention by the information processing apparatus 1 will be described.

The game according to the present embodiment is a so-called strategy simulation game, in which friendly forces controlled by a player and enemy forces controlled by a game program compete with each other for bases to expand their positions. FIG. 2 shows an example of the game map screen. In the example shown in FIG. 2, a plurality of positions a to g are arranged on the game map, and facilities A to G serving as bases for allied or enemy forces are arranged in each position.

A predetermined number of units can be arranged in each of the facilities A to G. For example, when an allied army acquires a facility, it becomes possible to place allied units that make up the allied army in that facility, and the position where the facility is placed becomes an allied position. The same is true for enemy forces. In the example shown in FIG. 2, friendly units are placed in facilities A to D, and positions a to d where these facilities A to D are placed are friendly positions (positions indicated by grid hatching). On the other hand, enemy units constituting the enemy army are arranged in facilities E to G, and positions e to g where these facilities E to G are arranged are enemy positions (positions indicated by diagonal hatching).

Between adjacent facilities, a route r connecting them is displayed. A friendly unit can move between facilities of the friendly army through this route r. Enemy units can similarly move between enemy installations along path r. In places where allied and enemy facilities are adjacent to each other, they can attack each other. In the example shown in FIG. 2, facilities A and B of the friendly forces are adjacent to facilities E and F of the enemy forces, so the player uses friendly units of facility A or facility B to attack facility E or facility F. be able to. The same goes for enemy forces.

FIG. 3 shows an example of the battle screen at this time. In the example shown in FIG. 3, a plurality (three in this example) of friendly units 13 and a plurality of (three in this example) of enemy units 15 are arranged on the game field GF. The friendly unit 13 is operated by the player, and the enemy unit 15 is operated by the game program. Note that the number of friendly units 13 and the number of enemy units 15 are not limited to the above three.

A plurality of partitions 17 arranged in a grid pattern are set on the game field GF. The ally unit 13 and the enemy unit 15 move on the game field GF in units of the division 17 . The movable range of each unit is set by the number of partitions 17, and each unit can move freely within that range. In this example, the partitions 17 have a square shape (substantially rectangular shape), but may have other shapes (for example, circles, polygons other than squares, etc.). Also, the section 17 does not have to be displayed all the time, and may be displayed only within the movable range of the unit that has become ready to act due to the change of the turn, for example.

In this embodiment, turns are set for each unit, and each unit can move and perform predetermined actions (attacks, special skills, magic, use of items, etc.) when it switches to its own turn. In addition, victory conditions and defeat conditions are set in advance in the game, and if the conditions are met, the game is won or lost. For example, the friendly unit 13 defeats the leader of the enemy unit 15, acquires the flag of the enemy army (not shown), acquires all of the multiple items (for example, keys, not shown) placed on the game field GF, If the conditions are met, the allied army wins and the facility can be acquired. Conversely, when the enemy unit 15 defeats the leader of the allied unit 13, takes away the flag of the allied army (not shown), or takes away all of the items placed on the game field GF, The allied army is defeated and the facility is taken by the enemy army.

The outline of the game according to the present embodiment has been described above, and the contents of the characteristic portion thereof will be described in detail below.

<3. Functional Configuration Related to Recommended Movement etc. of Information Processing Device>
Next, an example of a functional configuration mainly related to recommended movement etc. among the functional configurations of the information processing apparatus 1 will be described with reference to FIGS. 4 and 5 to 7. FIG. The arrows shown in FIG. 4 indicate an example of signal flow, and do not limit the direction of signal flow.

As shown in FIG. 4, the information processing apparatus 1 includes, in addition to the operation unit 3 and the display unit 5 described above, the functional configuration of the information processing apparatus 1 includes a priority action determination processing unit 19, a section evaluation processing unit 21, a section determination processing unit 23, a selection It has a request processing section 25 , a unit movement processing section 27 , a recommended action presentation processing section 29 , a recommended action determination processing section 31 and an action execution processing section 33 .

The priority action determination processing unit 19 determines whether or not actions that can be executed by the friendly unit 13 within the movable range include a predetermined priority action. Actions to be given priority are, for example, if the friendly unit 13 can achieve the above-described victory conditions in that turn, if the above-described defeat conditions can be prevented, and other friendly units that can fulfill the victory conditions or prevent the defeat conditions. 13, and so on, it is an action to carry out them.

Since such a priority action is directly linked to the victory or defeat of the allied forces, it is preferable for the allied unit 13 to execute it unconditionally. For this reason, the section evaluation processing unit 21, which will be described later, does not evaluate the section 17 when the priority action determination processing unit 19 determines that the priority action is included. Only if so is the evaluation performed for each of the plurality of compartments 17 . In addition, when the priority action determination processing unit 19 determines that a priority action is included, the section determination processing unit 23, which will be described later, selects the section 17 in which the priority action can be executed. Decide on a recommended destination.

The section evaluation processing unit 21 evaluates each of the plurality of sections 17 existing within the movable range of the ally unit 13 operated by the player, based on predetermined evaluation criteria.

FIG. 5 shows an example of the movable range of the ally unit 13. As shown in FIG. In the example shown in FIG. 5, the central ally unit 13 of the three ally units 13 can act. The movable range 35 of the ally unit 13 is set to 5 sections, and the range is displayed around the ally unit 13 . The section evaluation processing unit 21 calculates an evaluation score for each section 17 existing within the movable range 35, taking into consideration various game situations.

Specifically, the section evaluation processing unit 21 calculates a higher evaluation point for a section 17 that satisfies the following conditions. For example, the coordinates of the target (coordinates of the final target set for each victory condition, such as the coordinates of the flag of the enemy army, the coordinates of the key, etc.), the area closer to the enemy unit 15, the larger the enemy unit 15 by attack, magic, and special ability Sections that can deal damage, and sections that can activate a mechanism (not shown) that can deal damage placed at a predetermined location on the game field GF and can deal greater damage to the enemy unit 15. , which will receive less damage from the enemy unit 15 in the next enemy turn, and so on. In addition, the above is an example, and evaluation criteria other than the above may be set.

As described above, the section evaluation processing unit 21 evaluates each of the plurality of sections 17 in consideration of actions that can be executed after the ally unit 13 moves to the section 17 in question. Therefore, the section evaluation processing section 21 sets the calculated evaluation points for each section 17, and also recommends actions to be executed after the friendly unit 13 moves to the section 17 (which command is given to which unit). , etc.) are also set.

Returning to FIG. 4 , the section determination processing section 23 determines the section 17 recommended as the destination of the ally unit 13 based on the evaluation result of the section evaluation processing section 21 . Specifically, the section 17 with the highest evaluation score calculated by the section evaluation processing unit 21 as described above is determined as the recommended destination.

Note that when the priority action determination processing unit 19 determines that the priority action is included as described above, the section determination processing unit 23 recommends the section 17 in which the priority action can be executed. Decide where to go. In this case, the evaluation points are not calculated by the section evaluation processing unit 21 .

The selection request processing section 25 requests the player to select whether or not to move the ally unit 13 to the section 17 determined by the section determination processing section 23 .

FIG. 5 shows an example of screen display at this time. In the example shown in FIG. 5, a selection request display 37 is displayed at the position of the section 17 (indicated by diagonal hatching) determined by the section determination processing section 23 . Depending on the content of this selection request display 37, the player can select "move" to the recommended section 17 by pressing the A button 9, and press the B button 11 to "move" to the recommended section 17. You can choose not to move. Note that in the example shown in FIG. 5, the movement route of the ally unit 13 to the recommended section 17 is displayed by an arrow 39 .

Returning to FIG. 4 , when the player selects to “move” in response to a request from the selection request processing section 25 , the unit movement processing section 27 determines that the ally unit 13 has been determined by the zone determination processing section 23 . Move to section 17. As a result, the player can move the ally unit 13 to the recommended section 17 simply by pressing the A button 9 .

On the other hand, when the player selects "do not move" in response to the request from the selection request processing section 25, the unit movement processing section 27 moves the friendly unit 13 to the zone 17 determined by the player's input. . As a result, the player can select the destination of the friendly unit 13 by himself/herself.

FIG. 6 shows an example of screen display at this time. In the example shown in FIG. 6, the section 17 (indicated by diagonal hatching) on the left front of the ally unit 13 is selected as the destination by the player's input operation. Specifically, the player selects an arbitrary section 17 within the movable range 35 using the cross key 7, and presses the A button 9 in the selected state to determine the section 17 as the destination. As shown in FIG. 6, while the section 17 is being selected by the cross key 7, the movement path of the teammate unit 13 to the selected section 17 is indicated by an arrow 41 in a color different from the arrow 39. As shown in FIG. By differentiating the display modes of the arrow 39 and the arrow 41, it is possible to easily distinguish between the movement recommended by the game program and the movement by the player.

Returning to FIG. 4, when the friendly unit 13 is moved by the unit movement processing section 27 to the section 17 determined by the section determination processing section 23, the recommended action presentation processing section 29 Based on this, recommended actions are presented from among a plurality of actions that the ally unit 13 can perform. Specifically, as described above, the section evaluation processing unit 21 sets the evaluation points and recommended actions for each section 17 together. A recommended action is determined and presented by referring to the action set in the section 17 determined by .

FIG. 7 shows an example of screen display at this time. In the example shown in FIG. 7, the option display processing unit 45 (see FIG. 9), which will be described later, selects "attack", " Skill", "Magic", "Item", and "Flip" are displayed.

Action options are not limited to the above, and other options may be displayed in addition to or instead of the above. For example, when the ally unit 13 moves to a zone 17 where a predetermined item (for example, a flag, a key, etc.) can be obtained, "take" or the like may be displayed instead of "turn over".

For example, when the player selects "attack", the ally unit 13 uses a weapon or the like to attack the enemy unit 15 targeted for attack. Also, when "special skill" is selected, the ally unit 13 activates a predetermined special skill against the target enemy unit 15 or ally unit 13 . Also, when "magic" is selected, the friendly unit 13 activates magic that has a predetermined effect on the targeted enemy unit 15 or friendly unit 13 . Also, when "item" is selected, the ally unit 13 uses an item having a predetermined effect. Also, when "turn over" is selected, a lottery for the effect that the ally unit 13 can obtain is performed (details will be described later).

In the example shown in FIG. 7, the recommended action presentation processing unit 29 displays a recommendation display 43 for the option of "attack", and "attack" is recommended among the action options.

Returning to FIG. 4, the recommended action determination processing unit 31 uses the same operation unit 3 (A button 9) that is operated when “move” is selected in response to a request from the selection request processing unit 25. When the (A button 9) is operated, execution of the action presented by the recommended action presentation processing unit 29 is determined. As a result, the player can both move to the recommended section 17 and perform the recommended action only by pressing the A button 9 .

For example, in the example shown in FIG. 7, the player can select the option of "attack" by pressing the A button 9. In the example shown in FIG. If the player wishes to select an option other than "attack", the player can use the cross key 7 to select any option, and press the A button 9 in the selected state to confirm the option. can be done.

The action execution processing section 33 causes the friendly unit 13 to execute the action determined by the recommended action determination processing section 31 . Also, the action execution processing section 33 causes the ally unit 13 to execute an action determined by the player's input operation.

In addition, the processing and the like in each processing unit described above are not limited to these examples of sharing the processing, for example, processing may be performed by a smaller number of processing units (for example, one processing unit), Moreover, it may be processed by a further subdivided processing unit. The functions of the processing units described above are implemented by a game program executed by the CPU 101 (see FIG. 22), which will be described later. It may be implemented by actual devices such as circuits.

<4. Processing Procedure Related to Recommended Movement of Information Processing Device>
Next, with reference to FIG. 8, an example of a processing procedure related to recommended movement and the like executed by the CPU 101 of the information processing apparatus 1 will be described.

In step S5, the information processing device 1 uses the priority action determination processing section 19 to determine whether or not the action that the ally unit 13 can perform within the movable range 35 includes a predetermined priority action. do. If an action to be prioritized is included (step S5: YES), the process proceeds to step S25, which will be described later. On the other hand, if the action to be prioritized is not included (step S5: NO), the process proceeds to the next step S10.

In step S10, the information processing device 1 determines whether or not a target (for example, the coordinates of the final target set for each victory condition or the final target enemy unit 15) is set. If a target has been set (step S10: YES), the process proceeds to step S20, which will be described later. On the other hand, when the target is not set (step S10: NO), the process proceeds to the next step S15.

In step S15, the information processing apparatus 1 sets the target.

In step S<b>20 , the information processing device 1 uses the section evaluation processing section 21 to calculate an evaluation score for each section 17 existing within the movable range 35 of the teammate unit 13 based on a predetermined evaluation standard. At this time, the section evaluation processing unit 21 evaluates each of the plurality of sections 17 in consideration of actions that can be executed after the ally unit 13 moves to the section 17 in question.

In step S<b>25 , the information processing apparatus 1 uses the section determination processing unit 23 to determine the section 17 with the highest score calculated in step S<b>20 as the section 17 recommended as the destination of the ally unit 13 .

In step S30, the information processing apparatus 1 causes the selection request processing section 25 to display a selection request display 37 requesting the player to select whether or not to move the teammate unit 13 to the section 17 determined in step S25. Displayed in section 5 (see FIG. 5).

In step S35, the information processing device 1 causes the recommended action determination processing section 31 to determine whether or not to move the ally unit 13 to the section 17 determined in step S25. When the player presses the A button 9 and decides to move the ally unit 13 to the recommended zone (step S35: YES), the process proceeds to the next step S40.

In step S40, the information processing apparatus 1 causes the unit movement processing section 27 to move the ally unit 13 to the section 17 determined in step S25.

On the other hand, if it is determined in step S35 that the player presses the B button 11 not to move the ally unit 13 to the recommended zone (step S35: NO), the process proceeds to the next step S60.

In step S60, the information processing apparatus 1 causes the unit movement processing section 27 to move the ally unit 13 to the section 17 determined by the player's input operation (see FIG. 6). After that, the process moves to step S65, which will be described later.

In step S45, the information processing apparatus 1 uses the recommended action presentation processing unit 29 to present a recommended action from among a plurality of actions that the ally unit 13 can perform after moving, based on the evaluation result in step S20. At this time, the recommended action presentation processing unit 29 presents the recommended action by displaying a recommended display 43 on the display unit 5 (see FIG. 7).

In step S50, the information processing apparatus 1 causes the recommended action determination processing unit 31 to determine whether or not to decide on the recommended action presented in step S45. When the player presses the A button 9 and decides to execute the recommended action (step S50: YES), the process proceeds to the next step S55.

In step S55, the information processing apparatus 1 causes the action execution processing section 33 to cause the ally unit 13 to execute the recommended action determined in step S50.

On the other hand, if the player does not decide to execute the recommended action by operating the cross key 7 or the like in step S50 (step S50: NO), the process proceeds to next step S65.

In step S<b>65 , the information processing apparatus 1 causes the ally unit 13 to execute the action determined by the player's input operation by the action execution processing section 33 . With the above, the present flow ends.

Note that the processing procedure described above is an example, and at least a part of the above procedure may be deleted or changed, or a procedure other than the above may be added. Also, the order of at least part of the above procedures may be changed.

For example, in the above description, if the player operates the friendly unit 13 by himself without moving to the recommended zone (step S60), the recommended action is not presented, and the player decides the action by himself/herself. (Step S65), but it is not limited to this. For example, the recommended action may be presented even when the player moves the ally unit 13 by operating it without moving to the recommended zone.

<5. Functional Configuration Related to Lottery for Activation Effect of Information Processing Device>
Next, of the functional configurations of the information processing device 1, an example of a functional configuration mainly related to a lottery for activation effects will be described with reference to FIGS. 9 and 10 to 14. FIG. The arrows shown in FIG. 9 indicate an example of signal flow, and do not limit the direction of signal flow.

As shown in FIG. 4, the information processing apparatus 1 includes, in addition to the operation unit 3 and the display unit 5, the above-described unit movement processing unit 27, option display processing unit 45, option determination processing unit 47, lottery execution It has a processing unit 49 , an effect display processing unit 51 , and an effect activation processing unit 53 .

The unit movement processing section 27 moves the ally unit 13 on the game field GF based on the player's operation input. As described above, the friendly unit 13 may move to the recommended section 17 or may move to the section 17 selected by the player.

The option display processing unit 45 performs a lottery for an effect obtained by the ally unit 13 as an action option that can be executed by the ally unit 13 moved by the unit movement processing unit 27 after the movement. ).

FIG. 10 shows an example of screen display at this time. As in FIG. 7 described above, "attack", "special skill", "magic", "item", and "flip" are displayed as options for actions that the friendly unit 13 can perform after moving.

In the example shown in FIG. 10, the recommendation display 43 is displayed for the option of "turn over" by the recommended action presentation processing unit 29 described above. The reason why "turning over" is recommended is that, for example, the friendly unit 13 and the enemy unit 15 are far apart, and even if the friendly unit 13 is moved, the enemy unit 15 cannot be attacked, magic, or activated. It is a case where there is no device that can be used and no items that can be acquired. By displaying "turn over" as an option, it is possible to avoid a waiting state in which the friendly unit 13 has no action to be executed after moving.

Returning to FIG. 9 , the option determination processing unit 47 determines an option selected based on the player's operation input from the options displayed by the option display processing unit 45 . For example, in the example shown in FIG. 10, when the player presses the A button 9, the option determination processing unit 47 determines the option of "turn over". When the player selects an option other than "turn over" using the cross key 7 and presses the A button 9 in the selected state, the option determination processing unit 47 determines the option.

The lottery execution processing unit 49 executes a lottery for the effect that the ally unit 13 can obtain when the option determination processing unit 47 determines the option of “turn over”. Effects that can be obtained include, for example, increasing attack power, increasing damage power from magic and special skills, increasing experience points, recovering physical strength (hit points), etc. In addition to increasing and recovering various statuses of allied units 13, There are various effects that are advantageous in the progress of the game, such as increasing the amount of money acquired and acquiring items. These effects are classified in advance into a plurality of ranks (types) according to the magnitude of the effect, and the lottery execution processing unit 49 selects the plurality of effects classified into the plurality of ranks for each rank. Effects are drawn by lottery based on set winning probabilities.

FIG. 11 shows an example of winning probability for each rank. In the example shown in FIG. 11, there are seven ranks of effects to be obtained, namely Legend, S, A, B, C, D, and E, in descending order of effect. It is set so that the higher the rank, the smaller it is. For example, the rank of Legend includes effects such as fully recovering the health of all allied units. In this way, the effects obtained by lottery include not only a single ally unit but also multiple or all ally units.

Note that the lottery execution processing unit 49 executes a lottery including a “lost” result in which the ally unit 13 does not obtain any effect. That is, when "turn over" is selected, some effect is not necessarily obtained, and no effect may be obtained. In the example shown in FIG. 11, the winning probability of "losing" is set to be the highest.

It should be noted that the number and types of ranks, the magnitude relationship of winning probability, and the like are not limited to those described above. For example, the winning probability of "losing" may be set to be smaller, or "losing" itself may be eliminated, and some effect may always be obtained when "turning over" is selected.

Returning to FIG. 9, during the execution of the lottery by the lottery execution processing unit 49, the effect display processing unit 51 turns over the panel set at the position (section 17) of the teammate unit 13 on the game field GF. A performance display is performed so that the lottery result is displayed on the back side of the .

12 to 14 show examples of screen displays at this time. As shown in FIG. 12, for example, when the center ally unit 13 of the 3 ally units 13 executes "turning over" after moving, a panel 55 having a shape corresponding to the section 17 where the ally unit 13 is located is displayed. Is displayed. Then, as shown in FIG. 13, the panel 55 is flipped over (or rotated), and the result of the lottery is displayed on the back surface of the panel 55 . In the example shown in FIG. 13, the lottery result is "ATK UP". Further, in the example shown in FIG. 14, the lottery result is "lost".

In addition, on the back surface of the panel 55, the lottery results may be displayed together with patterns such as characters related (or not related) to the lottery results.

Returning to FIG. 9 , the effect activation processing unit 53 activates the selected effect based on the lottery result of the lottery execution processing unit 49 . It should be noted that the effect activation processing unit 53 does not activate the effect when the lottery result is a loss.

In addition, the processing and the like in each processing unit described above are not limited to these examples of sharing the processing, for example, processing may be performed by a smaller number of processing units (for example, one processing unit), Moreover, it may be processed by a further subdivided processing unit. The functions of the processing units described above are implemented by a game program executed by the CPU 101 (see FIG. 22), which will be described later. It may be implemented by actual devices such as circuits.

<6. Processing Procedure Related to Lottery for Activation Effect of Information Processing Device>
Next, with reference to FIG. 15, an example of a processing procedure related to the lottery for the activation effect executed by the CPU 101 of the information processing device 1 will be described.

In step S110, the information processing apparatus 1 causes the unit movement processing section 27 to move the teammate unit 13 on the game field GF based on the player's operation input.

In step S120, the information processing apparatus 1 causes the option display processing unit 45 to display options of actions that can be executed by the ally unit 13 moved in step S110 after the movement. This option includes "turn over", which performs a lottery for the effect that the ally unit 13 can obtain (see FIG. 10).

In step S130, the information processing apparatus 1 causes the option determination processing unit 47 to determine whether or not "turn over" is selected from the options displayed in step S120. When an option other than "turn over" is selected by the player's operation input (step S130: NO), the process proceeds to the next step S140.

In step S140, the information processing device 1 causes the ally unit 13 to execute the action selected by the player by the action execution processing section 33 described above.

On the other hand, in step S130, if the player selects "turn over" (step S130: YES), the process proceeds to next step S150.

In step S<b>150 , the information processing apparatus 1 uses the lottery execution processing unit 49 to execute a lottery for the effect that the teammate unit 13 can obtain.

In step S160, the information processing apparatus 1 determines whether or not the result of the lottery executed in step S150 is a win. When the lottery result is "losing" (step S160: NO), the process proceeds to the next step S170.

In step S170, the information processing apparatus 1 causes the effect display processing unit 51 to turn over the panel 55 set in the section 17 of the teammate unit 13 on the game field GF, and displays "Loss" on the back surface of the panel 55. Perform the effect display so that it will be done.

On the other hand, in step S160, if the lottery result is a hit, that is, if the lottery result is an effect classified into one of the seven ranks described above, Legend, S, A, B, C, D, and E, (Step S160: YES), the process proceeds to the next step S180.

In step S180, the information processing apparatus 1 causes the effect display processing section 51 to turn over the panel 55 set in the section 17 of the teammate unit 13 on the game field GF, and the lottery effect is displayed on the back side of the panel 55. Effect display is performed so that the contents are displayed.

In step S190, the information processing apparatus 1 causes the effect activation processing unit 53 to activate the selected effect based on the result of the lottery performed in step S150. With the above, the present flow ends.

Note that the processing procedure described above is an example, and at least a part of the above procedure may be deleted or changed, or a procedure other than the above may be added. Also, the order of at least part of the above procedures may be changed.

<7. Functional Configuration Related to Automatic Unit Rearrangement, etc. of Information Processing Apparatus>
Next, with reference to FIG. 16, an example of a functional configuration mainly related to automatic rearrangement of ally units among the functional configurations of the information processing apparatus 1 will be described. Note that the arrows shown in FIG. 16 indicate an example of signal flow, and do not limit the direction of signal flow.

As shown in FIG. 16, the information processing apparatus 1 has a rearrangement processing section 57 as a functional configuration in addition to the operation section 3 and the display section 5 . The rearrangement processing unit 57 arranges the ally units 13 according to a predetermined rule to a plurality of facilities (an example of bases), each of which is arranged at a plurality of locations on the game map and in which a predetermined number of ally units 13 can be arranged. Rearrange.

Predetermined rules include, for example, the following rules. In other words, the rearrangement processing section 57 does not move the friendly unit 13 placed in the facility adjacent to the enemy's position. In addition, the rearrangement processing unit 57 extracts allied units 13 placed in facilities that are not adjacent to the enemy's territory, and if the number of facilities adjacent to the enemy's territory does not reach a predetermined number, the extracted allied units 13 are placed in order of strength. The specific content of this rule will be described later.

<8. Processing Procedure Related to Automatic Unit Rearrangement, etc. of Information Processing Device>
17, 18 to 21 and FIG. 2 described above, an example of a processing procedure relating to automatic rearrangement of teammate units executed by the CPU 101 of the information processing apparatus 1 will be described.

In step S<b>210 , the information processing apparatus 1 uses the rearrangement processing section 57 to determine whether or not the player has performed an operation to instruct the rearrangement of the teammate unit 13 . Specifically, for example, it is determined whether or not a "unit rearrangement" button (not shown) displayed on the display section 5 has been pressed. This step is repeated until the rearrangement operation is performed, and when the rearrangement operation is performed (step S210: YES), the process proceeds to the next step S220.

In step S220, the information processing device 1 uses the rearrangement processing section 57 to extract the ally units 13 placed in facilities that are not adjacent to the enemy's camp.

In step S230, the information processing device 1 causes the rearrangement processing section 57 to rearrange the friendly units 13 extracted in step S220 in descending order of strength.

18 and 19 show specific examples of the processing contents of steps S220 and S230. The contents shown in FIGS. 18 and 19 correspond to FIG. 2 described above. In the examples shown in FIGS. 2 and 18, facility A and facility B are friendly facilities that are adjacent to the enemy's camp, and facility C and D are friendly facilities that are not adjacent to the enemy camp. In the example shown in FIG. 18, the number of allied units 13 that can be placed in each of the facilities A to D (placement slots) is 5 units. has three units (units B1 to B3), facility C has three units (units C1 to C3), and facility D has two units (units D1 to D2).

As shown in FIG. 19, five units (units C1 to C3 and units D1 to D2) placed in facilities that are not adjacent to enemy positions, ie, facilities C and D, are extracted. Each unit is then sorted in descending order of strength. In the example shown in FIG. 19, the order is units C2, D2, D1, C3, and C1. It should be noted that the "strength" here is one of the statuses of the friendly unit 13, and represents the amount of damage that can be given to the enemy unit 15 by actions such as "attack", "special ability", and "magic". (So-called combat power).

Returning to FIG. 17, in step S240, the information processing apparatus 1 uses the rearrangement processing unit 57 to determine whether or not there is a vacant facility layout frame adjacent to the enemy's position. If there is no space (step S240: NO), the process proceeds to step S270, which will be described later. On the other hand, if there is space (step S240: YES), the process proceeds to the next step S250.

In step S250, the information processing apparatus 1 causes the rearrangement processing unit 57 to move the ally units 13 rearranged in step S230 to the facility placement frame determined to be empty in step S240. Arrange units in order of strength until they are filled.

FIG. 20 shows a specific example of the processing contents of steps S240 and S250. Note that the contents shown in FIG. 20 correspond to FIGS. 18 and 19 described above. In the example shown in FIG. 18 above, there are empty placement slots in both facility A and facility B, which are adjacent to the enemy's position. Therefore, among the extracted friendly units 13, the units with the highest strength are arranged in the facilities A and B. FIG. In the example shown in FIG. 20, the unit C2 with the highest strength is arranged in the facility A, and the two units D2 and D1 with the second highest strength are arranged in the facility B. As a result, the placement slots for facility A and facility B are filled.

Note that the rearrangement mode of the units is not limited to the above. For example, the unit C2 with the highest strength may be placed in the facility B, the unit D2 with the next highest strength in the facility A, and the unit D1 with the next highest strength in the facility B.

Returning to FIG. 17, at step S260, the information processing apparatus 1 causes the rearrangement processing section 57 to determine whether or not the teammate unit 13 rearranged at step S230 remains after the rearrangement at step S250. judge. If there are no allied units 13 left (step S260: NO), this flow ends. On the other hand, if allied units 13 remain (step S260: YES), the process proceeds to the next step S270.

In step S270, the information processing apparatus 1 causes the rearrangement processing section 57 to arrange the remaining ally units 13 in each facility that is not adjacent to the enemy's position. As described above, when it is determined in step S240 that there is no vacancy in the placement frame of the facility adjacent to the enemy's position (step S240: NO), the process proceeds directly to step S270, and the process proceeds directly to step S230. The same process is performed for the ally units 13 rearranged in . With the above, the present flow ends.

FIG. 21 shows a specific example of the processing contents of steps S260 and S270. Note that the contents shown in FIG. 21 correspond to FIG. 20 described above. In the example shown in FIG. 20, units C3 and C1 remain in the extraction list. Therefore, as shown in FIG. 21, one remaining unit C3, C1 is placed in each of the facilities C and D, which are not adjacent to the enemy's position. By placing one unit in each facility, the number of units (strength) in each facility can be equalized.

Note that the rearrangement mode is not limited to the above. For example, unit C3 may be placed in facility D and unit C1 may be placed in facility C, contrary to the above. Also, when the remaining number of units is 3 or more, it is preferable that the units are alternately arranged in the facility C and the facility D in descending order of strength.

Note that the processing procedure described above is an example, and at least a part of the above procedure may be deleted or changed, or a procedure other than the above may be added. Also, the order of at least part of the above procedures may be changed.

<9. Hardware Configuration of Information Processing Device>
Next, with reference to FIG. 22, an example of the hardware configuration of the information processing apparatus 1 realizing each processing unit implemented by the program executed by the CPU 101 described above will be described.

As shown in FIG. 22, the information processing apparatus 1 includes, for example, a CPU 101, a ROM 103, a RAM 105, a dedicated integrated circuit 107 constructed for a specific application such as an ASIC or FPGA, an input device 113, and an output device. It has a device 115, a recording device 117, a drive 119, a connection port 121, a communication device 123, and the like. These components are connected via a bus 109, an input/output interface 111, etc. so as to be able to transmit signals to each other.

A game program can be recorded in, for example, the ROM 103, the RAM 105, the recording device 117, or the like.

In addition, the game program is temporarily or permanently (non-temporarily) recorded on a removable recording medium 125 such as a magnetic disk such as a flexible disk, an optical disk such as various CDs, MO disks, and DVDs, and a semiconductor memory. You can also keep it. Such a recording medium 125 can also be provided as so-called package software. In this case, the game programs recorded on these recording media 125 may be read by the drive 119 and recorded on the recording device 117 via the input/output interface 111, the bus 109, or the like.

Also, the game program can be recorded in, for example, a download site, another computer, another recording device, or the like (not shown). In this case, the game program is transferred via a network NW such as LAN or Internet, and the communication device 123 receives this program. The program received by the communication device 123 may be recorded in the recording device 117 via the input/output interface 111, the bus 109, or the like.

Also, the game program can be recorded in an appropriate externally connected device 127, for example. In this case, the game program may be transferred via an appropriate connection port 121 and recorded in the recording device 117 via the input/output interface 111, bus 109, or the like.

Then, the CPU 101 executes various processes according to the programs recorded in the recording device 117, thereby realizing the processes by the partition evaluation processing section 21, the option display processing section 45, the rearrangement processing section 57, and the like. . At this time, the CPU 101 may, for example, directly read out the program from the recording device 117 and execute it, or may execute it after temporarily loading it into the RAM 105 . Further, when the CPU 101 receives a program via the communication device 123 , the drive 119 or the connection port 121 , for example, the received program may be directly executed without being recorded in the recording device 117 .

In addition, the CPU 101 performs various processes as necessary based on signals and information input from the operation unit 3 and input devices 113 such as a mouse, keyboard, microphone, and game controller (not shown). may

Then, the CPU 101 may output the result of executing the above processing from an output device 115 including a display device such as the display unit 5 and an audio output device. The processing result may be transmitted via the communication device 123 or the connection port 121, or may be recorded in the recording device 117 or recording medium 125 described above.

<10. Effect of Embodiment>
As described above, the game program of the present embodiment is a game program that performs game processing in which the units 13 and 15 arranged in the game field GF are moved in units of the divisions 17 set in the game field GF, The information processing device 1 is provided with a section evaluation processing unit 21 that evaluates each of the plurality of sections 17 existing within the movable range 35 of the teammate unit 13 operated by the player based on a predetermined evaluation standard. A zone determination processing unit 23 that determines a zone 17 recommended as a destination for the ally unit 13 based on the evaluation result of the processing part 21, and whether or not to move the ally unit 13 to the zone 17 determined by the zone determination processing unit 23. A selection request processing section 25 requesting one selection, and when a movement is selected in response to a request by the selection request processing section 25, the ally unit 13 is moved to the section 17 determined by the section determination processing section 23. It functions as the unit movement processing section 27 .

As a result, the player can move the ally unit 13 to, for example, a strategically superior zone simply by performing a simple operation of selecting to move to the recommended zone 17 . Therefore, even if the player is a child or a beginner who is unfamiliar with strategy simulation, the game can be easily progressed and the game can be enjoyed. Also, the player can easily and efficiently learn how to play the game by referring to the recommended section 17 . This eliminates the need for strategy guides, strategy data, and the like, and has the effect of hastening the progress of the player.

Further, particularly in this embodiment, the unit movement processing section 27 moves the ally unit 13 to the section 17 determined by the player's input when it is selected not to move in response to the request by the selection request processing section 25. Let This provides the following effects.

That is, if the player has improved as the game progressed, or if the player is accustomed to the strategy simulation game, the player may want to select the destination of the friendly unit 13 by himself/herself. Also, depending on the battle situation, the player's strategy, etc., the division determined by the division determination processing unit 23 may not necessarily be advantageous to the battle situation.

Therefore, in this embodiment, when the player selects not to move in response to the request from the selection request processing section 25, the player can move the ally unit 13 to any section 17 according to his/her own instruction. This makes it possible to meet the needs of the player who wants to move the ally unit 13 by himself. In addition, for example, it is possible to play the game by following the movement recommended by the game program in normal situations, while selecting the movement destination by oneself in important situations such as boss battles, thereby achieving both convenience and strategy.

In addition, particularly in this embodiment, the section evaluation processing unit 21 evaluates each of the plurality of sections 17 based on actions that can be executed after the ally unit 13 moves to the section 17 in question.

According to the present embodiment, since the behavior of the ally unit 13 after movement (attack, activating a special skill or magic, using an item, etc.) is also evaluated, it is possible to recommend the section 17 more strategically. can. In addition, by evaluating the action at the destination when evaluating the destination, the amount of calculation can be reduced as compared with the case of evaluating the action that can be executed in the section 17 after moving to the section 17, for example. Therefore, the load on the information processing apparatus 1 (CPU 101) can be reduced.

In addition, the game program of the present embodiment causes the information processing apparatus 1 to be moved by the unit movement processing section 27 to the section 17 determined by the section determination processing section 23, the section evaluation processing section 21 Based on the evaluation result of , it further functions as a recommended action presentation processing unit 29 that presents a recommended action from among a plurality of actions executable by the ally unit 13 .

As a result, it is possible to present the player with suitable actions according to the scene of the game, the battle situation, or the like. Therefore, even if the player is a child or a beginner who is unfamiliar with strategy simulation, the game can be easily progressed and the game can be enjoyed.

Further, in the game program of the present embodiment, the same operation unit 3 as the operation unit 3 operated when the information processing apparatus 1 is selected to move in response to a request from the selection request processing unit 25 is operated. recommended action determination processing unit 31 that determines the execution of the action presented by the recommended action presentation processing unit 29, an action execution processing unit 33 that causes the friendly unit 13 to execute the action determined by the recommended action determination processing unit 31, function further as

As a result, the player can move to the recommended section 17 and perform the recommended action by operating the same operation unit 3 . As a result, the game can be progressed only by operating the same operating unit 3, so that the player's convenience can be greatly improved. Also, since the game can be simplified, it is particularly effective when the player is a child.

In addition, the game program of the present embodiment causes the information processing device 1 to determine whether or not a predetermined priority action is included in the actions that the ally unit 13 can perform within the movable range 35 . The section evaluation processing section 21 does not evaluate the section 17 when it is determined by the priority action determination processing section 19 that the priority action is included. When it is determined that the action is not included, each of the plurality of sections 17 is evaluated, and when the priority action determination processing section 19 determines that the priority action is included Then, the partition 17 that can execute the action to be prioritized is determined. This provides the following effects.

That is, in the player's turn of the strategy simulation game, there are cases where, for example, the victory condition can be achieved or the defeat condition can be prevented by the action of the friendly unit 13 operated by the player. In such a case, it is preferable from the point of view of game strategy to unconditionally execute the above actions.

Therefore, in this embodiment, when the ally unit 13 can execute such a priority action, the section determination processing section 23 does not evaluate the section 17 by the section evaluation processing section 21, and the section determination processing section 23 performs the priority action. are determined to be executable partitions 17 . As a result, the player can unconditionally cause the ally unit 13 to execute the above action, and the game can be advanced strategically.

In addition, the game program of the present embodiment places the information processing device 1 in a plurality of facilities A to D which are arranged at a plurality of locations on the game map, each of which can accommodate a predetermined number of teammate units 13. are further functioned as a rearrangement processing unit 57 that rearranges according to a predetermined rule. This provides the following effects.

That is, in the strategy simulation game, the ally unit 13 and the enemy unit 15 compete with each other for facilities to expand their position.

According to this embodiment, the player can relocate the ally unit 13 to, for example, a strategically superior base simply by performing a very simple operation such as one-button operation. Therefore, the player's convenience can be improved, and even if the player is a child or a beginner unfamiliar with strategy simulation, the game can be easily progressed and the game can be enjoyed.

In this embodiment, the rearrangement processing unit 57 rearranges a plurality of ally units 13 so that the ally units 13 placed in the facilities A and B adjacent to the enemy's position do not move. This provides the following effects.

In other words, it is conceivable that the player places unique friendly units 13 (for example, a unit that becomes an ace) in the facilities A and B adjacent to the enemy's position according to his/her own strategy or preference. is not preferred to be changed. Therefore, in this embodiment, the friend units 13 placed in the facilities A and B are rearranged so that they do not move, thereby improving convenience without interfering with the player's strategy or preference.

In this embodiment, the rearrangement processing unit 57 extracts friendly units 13 placed in facilities C and D that are not adjacent to the enemy's camp, and extracts a predetermined number of facilities A and B that are adjacent to the enemy's camp. If not, the extracted friendly units 13 are arranged in descending order of strength.

As a result, the friendly units 13 placed at the facilities C and D with low strategic priority can be automatically moved to the facilities A and B with high strategic priority in descending order of strength. . Therefore, the strength of facilities A and B adjacent to the enemy's position can be increased.

<11. Variation>
It should be noted that the present invention is not limited to the above-described embodiments, and various modifications are possible without departing from the gist and technical idea of the present invention. Such modifications will be described below. In addition, in the following modification, the same code|symbol is attached|subjected about the structure similar to the said embodiment, and description is abbreviate|omitted.

For example, as shown in FIG. 23, the game program of the present invention may be applied to an information processing device 59 integrally provided with two or more display units. The information processing device 59 of this modified example further includes a display unit 61 in addition to the display unit 5 described above. Note that the number of display units is not limited to two, and may be three or more. During execution of the game, for example, one of the display units 5 and 61 displays a game progress screen, and the other displays a map screen, a menu screen, and the like.

Further, for example, the game program of the present invention may be applied to a stationary information processing device 63 as shown in FIG. An input device 65 such as a game controller and a display device 67 such as a television are communicably connected to the information processing device 63 . Although FIG. 24 shows a case of wired connection, wireless connection may be used. Also in this case, the same effects as in the above embodiment are obtained.

In addition to the methods already described above, the methods according to the above-described embodiments and modifications may be appropriately combined and used. In addition, although not exemplified one by one, the above-described embodiment and each modified example can be implemented with various modifications within the scope not departing from the spirit thereof.

1 information processing device 3 operation unit 13 ally unit (an example of a unit)
15 enemy unit 17 section 19 priority action determination processing section 21 section evaluation processing section 23 section determination processing section 25 selection request processing section 27 unit movement processing section 29 recommended action presentation processing section 31 recommended action determination processing section 33 action execution processing section 35 movement Possible range 45 Option display processing unit 49 Lottery execution processing unit 51 Effect display processing unit 53 Effect activation processing unit 55 Panel 57 Rearrangement processing unit 59 Information processing device 63 Information processing device 125 Recording medium A to D Facility (an example of base)
GF game field

Claims (4)

The game program for processing a game in which a friendly army operated by a player and an enemy army operated by a game program take over a plurality of bases arranged at a plurality of locations on a game map to mutually expand their territory. and
information processing equipment,
arranging the allied units that make up the allied army at the allied army's base acquired by the allied army within the range of a placement frame, which is the number of allied units set at the allied army's base that can be arranged; a rearrangement processing unit that moves the friendly units between adjacent bases of the friendly forces and rearranges the friendly units placed at the bases of the friendly forces according to predetermined rules;
function as
The rearrangement processing unit
The friendly units that are placed at the base of the allied army adjacent to the base of the enemy army acquired by the enemy army and are capable of attacking the base of the enemy army are not moved, and
Extracting the friendly units placed at the friendly base that is not adjacent to the enemy base, and extracting the friendly units if there is an empty space in the placement frame of the friendly base that is adjacent to the enemy base. arranging the above-mentioned friendly units in descending order of strength at a base of the friendly army adjacent to the base of the enemy army;
A game program characterized by: The rearrangement processing unit
As a result of arranging the extracted friendly units at the base of the friendly army adjacent to the base of the enemy army until the placement frame is filled, if the extracted friendly units remain, the remaining friendly units are replaced. Placing it at a base of the friendly army that is not adjacent to the base of the enemy army,
The game program according to claim 1, characterized by: The rearrangement processing unit
when there is no space in the placement frame of the allied base adjacent to the enemy base, the extracted allied units are placed at the allied base not adjacent to the enemy base;
The game program according to claim 1 , characterized by: A recording medium readable by an information processing device, recording the game program according to any one of claims 1 to 3.

Images