JP2017056000A - Game device and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a game device and a program which can suppress optimal computation processing execution of a computer in accordance with game situations and can maintain interest in a game.SOLUTION: A terminal device has a configuration which controls whether or not to execute optimal arrangement computation processing of computing an optimal square position to be a square position to perform maximal effects on one or more match units to be arranged on a field in accordance with game situations on the basis of arrangements of respective player units and arrangements of the respective match units, and movement properties of the respective match unit, as arrangement computation processing.SELECTED DRAWING: Figure 3

Description

  The present invention relates to a game device, a program, and the like.

  In recent years, as information communication terminal devices such as tablet-type information communication terminal devices or smartphones (hereinafter referred to as “communication terminal devices”) have become multifunctional, improved, and popularized, games are also executed on these portable terminal devices. Opportunities are increasing.

  On the other hand, a simulation game that reproduces battles such as wars is known, in which units, characters, battleships, etc. participating in battle are regarded as units called units, and actions such as movement and attack are performed in units of cells constituting a map. (For example, Patent Document 1 or 2).

JP 2002-65937 A JP 2009-247474 A

  However, in the simulation game, the strategy for performing optimal movement and attack is important. However, in the devices described in Patent Documents 1 and 2, when performing single play against a computer, the player The computer's computation processing is not controlled in accordance with the game situation such as the level of the game, so if the computer as the opponent always performs the optimum computation, the game will be one-sided and will significantly reduce the fun of the game Probability is high.

  The present invention has been made in order to solve the above-described problems, and its object is to suppress the execution of the optimal arithmetic processing of the computer in accordance with the game situation and maintain the interest for the game. To provide an apparatus and a program.

(1) In order to solve the above problems, the program of the present invention
A program for advancing a battle game by arranging a plurality of units on a field composed of a plurality of cells,
Based on the operation of the player, the player unit, which is a player unit, is moved within the movable range on the field defined according to the movement characteristics of each player unit, and is arranged in a desired mass. A control process and a second movement control process for moving in a movable range on the field defined according to a movement characteristic of a battle unit that is a battle unit that battles with the player, and placing it in a predetermined square. Movement control means to execute, and
An arithmetic means for executing an arrangement calculation process for calculating a position of the predetermined mass when the first movement control process or the second movement control process is executed to arrange the battle unit on the predetermined mass;
Function as a computer
The computing means is
As the placement calculation processing, (1) placement of each player unit on the field,
(2) Arrangement of each battle unit, and
(3) any one of the units performing the attack or a combination thereof;
Based on at least one of the above, the optimal placement calculation processing for calculating the optimal mass position in the unit performing the attack on the field so as to exert the optimal attack effect on the attack target unit It has a configuration for controlling whether or not it can be executed according to the game situation.

  For example, in a battle game, particularly in a highly thoughtful battle game including a puzzle element or a strategy element, when calculating the position of a cell in a unit that performs an attack such as one or more battle units, for example, In the opponent's entire play unit group, the battle unit group that fights against the player always aims for the shortest victory, such as the position of the square where the parameter that disappears by the attack of each battle unit in the battle unit group becomes the maximum. When the unit placement calculation is executed, the probability of the player losing is increased, and in the worst case, the player always loses the game. Therefore, the interest of the battle game is reduced.

  Therefore, according to the present invention, the arrangement of the unit that performs the attack is always the best by making a gap in the strategy on the side of performing the attack by appropriately stopping the execution of the optimal arrangement calculation process with the above-described configuration. As a result, it is possible to prevent the attacked side from always becoming inferior, so that the battle game can be advanced while keeping a balance of the ability of the player and the battle side moderate.

  Therefore, the present invention can provide an attractive competitive game by maintaining the interest of the game when the game progresses.

  The battle game includes enemies and units (characters, cards and frames) such as battle games and board games, or parameters (virtual currency or coins in the game, experience points, hit points, life energy, attack parameters, love games, etc. Games that compete for emotional parameters).

  In particular, the “competition side” includes other players in addition to the computer (CPU) that is the opponent by executing the program calculation, but even in the case of the other players, it is not based on the operation of the other players. This includes the case where optimal placement calculation processing is executed by game calculation.

  The “optimum arrangement calculation process” refers to a process for determining the arrangement of units for maximizing the effect for winning the battle game.

For example, in the optimal placement calculation process,
(1) When an opponent unit (for example, a player unit) is surrounded while moving on the field by a plurality of units (for example, battle units) and an attack is performed on each unit, the respective units are comprehensively A process for determining the arrangement of the fighting units that are capable of efficiently maximally damaging all of the opponent units, and
(2) When erasing an enemy unit by moving one or more units such as a puzzle, a process for determining the arrangement of the player unit to efficiently erase the maximum number of opponent units, or a shogi or othello In the case of a battle game in which one unit position is determined for each turn, such as the shortest number of moves (number of turns) and the position of one unit to win in time (ie, one hand) Processing,
including.

In addition, the “game situation”
(1) Levels that increase with the progress of the player's battle game (that is, not the individual levels of the player unit but the level as a player (hereinafter referred to as “game level”)) and experience values (2) a predetermined value Player unit parameters such as when a player unit having a character level is included in the player unit group,
(3) Evolution in which various abilities of the player unit have been improved (for example, changes in attributes, abilities and characteristics, and increase of the upper limit value in the variation range of each parameter based thereon),
(4) Items owned by the player or items set to be executable for the turn,
(5) The type and level of the ongoing game stage,
(6) Competence differences between the player unit group and the battle unit group, such as the overall character level and experience level, or the player with the highest or lowest ability or the battle unit with the highest or lowest ability Capacity difference, and
(7) Lottery result by gacha (gacha for deciding whether to execute optimal placement calculation processing or avoiding it) or billing status (selection of avoidance of execution of optimal placement calculation processing by billing) and billing amount (previous billing amount is Execution of optimal placement calculation processing can be avoided if the amount exceeds a certain amount),
Is included.

(2) Further, according to the present invention, the calculation means comprises:
As the placement calculation processing, a predetermined unit in which the one or more attacks are performed is predetermined based on the arrangement of the attack target units on the field and the movement characteristics of the units that perform the one or more attacks. Execute normal placement calculation processing to calculate the position of the square to achieve the effect,
According to the game situation, any one of the optimum arrangement calculation process and the normal arrangement calculation process is selectively executed.

  With this configuration, according to the present invention, according to the game situation, the optimal placement calculation processing for calculating the optimal mass position in the unit that performs the attack that achieves the maximum effect, or the unit that performs the attack in advance Since either one of the normal placement calculation processing that calculates the position of the mass that achieves the defined effect can be selectively executed, it is excluded that the placement of the unit that performs the attack is always the best, It is possible to prevent the attacked side from always becoming inferior.

  In the “normal arrangement calculation processing”, for example, the position for attacking the attack target unit such as the player unit closest to the unit performing the attack such as the battle unit, and the most easily finished The position to attack the attack target unit, the position to attack the attack target unit in conjunction with the unit that performs other attacks such as combo attack, and the maximum attack to the attack target unit Possible positions are included.

(3) Further, according to the present invention, the calculation means includes:
When the game situation is composed of a capability difference between the player unit and the battle unit, or a player unit group including one or more player units and a battle unit group including one or more battle units. The execution probability of the optimal placement calculation process is changed according to the difference in ability.

With this configuration, the present invention reduces the execution probability of the optimal placement calculation process when the player level is low and the capability of the fighting unit is high relative to the capability of each player unit. When the ability of the opponent unit is lower than the ability of the player unit, the execution probability of the optimal placement calculation process can be changed according to the game situation, such as increasing the execution probability of the optimal placement calculation process. The battle game can be progressed according to the difference, and the battle game can be progressed while maintaining a proper balance of ability between the player and the opponent such as a computer.

(4) The present invention also provides:
The computing means is
According to the game level of the player, the execution probability of the optimal placement calculation process is changed.

  With this configuration, the present invention reduces the execution probability of the optimal placement calculation process when the player level is low and the capability of the fighting unit is high relative to the capability of each player unit. When the ability of the opponent unit is lower than the ability of the player unit, the execution probability of the optimum placement calculation processing can be increased, so that the opponent game such as the player and the computer is advanced by proceeding with the opponent game according to the ability difference. The battle game can be advanced while maintaining an appropriate balance of ability.

(5) The present invention also provides:
Based on the positions of the squares of the units arranged, a player unit group including one or more player units and a battle unit group including one or more battle units are mutually connected based on the arrangement of the squares. Further causing the computer to function as attack control means for executing attack control processing to attack
The computing means is
A configuration for executing the optimum arrangement calculation processing for calculating an optimum mass position in a unit that performs the attack or a unit group including the unit that performs the attack is maximized in the unit that performs the attack. have.

  With this configuration, the present invention can be applied to a battle game between single units or a battle game in which a game can be played by a team for each of a plurality of units.

(6) In the present invention, the attack control means
Based on the attack capability set for each unit, the player unit group and the battle unit group execute attack control processing for attacking each other based on the arrangement of the respective cells and the attack capability. Have.

  With this configuration, the present invention can be applied to a battle game in which a player and a battle side attack each other, such as a battle game or a simulation game based on battle.

(7) The present invention also provides:
When the position of the cell where the unit that performs the attack is arranged is calculated based on the optimum arrangement calculation process, the computer is further functioned as a notification control means for notifying the player of the calculation. have.

  With this configuration, the present invention allows the player to recognize that the optimal placement calculation processing is being executed, so that it can be used as a reference in considering subsequent strategies, and the game performance can be improved.

(8) The present invention also provides:
When the arrangement position of the player unit that performs the attack is automatically calculated by the calculation means, the computer further functions as a notification control means for notifying the player that the attack is automatically calculated. Have a configuration.

  With this configuration, the present invention allows the player to recognize that the arrangement position of the player unit has been automatically calculated, so that the player can accurately recognize the game situation.

(9) The present invention also provides:
The control of whether or not to execute the optimal placement calculation process includes control of at least one of the execution probability, the number of executions, the execution time, and the execution timing of the optimal placement calculation process executed during the battle game. It has a configuration.

  With this configuration, the present invention can control the execution probability, the number of executions, the execution time, or the execution timing of the optimal arrangement calculation process according to the game situation such as the difference in ability between the player unit and the battle unit.

  For example, as control of the execution probability (invocation probability) of the optimum arrangement calculation processing, control to make the activation probability high or low (including 0%) is executed according to the game situation, and the optimum arrangement is executed. As the control of the number of executions of the arithmetic processing, control for increasing or decreasing the number of executions in each section such as the whole game or the game stage can be executed according to the game situation.

  Further, for example, as the control of the execution time of the optimum arrangement calculation process, the time for executing the optimum arrangement calculation process in each section such as the whole game or the game stage according to the game situation (the arrangement calculation executed up to that point) The control for extending or shortening the time during which the optimal placement calculation process is executed with respect to the total execution time of the process is executed.

  Furthermore, for example, when controlling the execution timing of the optimal placement calculation process, the battle unit may have a match-up, such as when the life energy of the battle unit is below a certain level or when the number of battle units is below a certain number. It is controlled at which timing of the game whether or not the optimal placement calculation processing is executed.

  Therefore, according to the present invention, it is possible to change whether or not to calculate the optimal square according to the game situation without always calculating the optimal square position.

(10) The game device of the present invention
A game device that advances a battle game by arranging a plurality of units on a field composed of a plurality of cells,
Based on the operation of the player, the player unit, which is a player unit, is moved within the movable range on the field defined according to the movement characteristics of each player unit, and is arranged in a desired mass. A control process and a second movement control process for moving in a movable range on the field defined according to a movement characteristic of a battle unit that is a battle unit that battles with the player, and placing it in a predetermined square. Movement control means to execute, and
An arithmetic means for executing an arrangement calculation process for calculating a position of the predetermined mass when the first movement control process or the second movement control process is executed to arrange the battle unit on the predetermined mass;
With
The computing means is
As the placement calculation processing, (1) placement of each player unit on the field,
(2) Arrangement of each battle unit, and
(3) any one of the units performing the attack or a combination thereof;
Based on at least one of the above, the optimal placement calculation processing for calculating the optimal mass position in the unit performing the attack on the field so as to exert the optimal attack effect on the attack target unit It has a configuration for controlling whether or not it can be executed according to the game situation.

  With this configuration, the present invention ensures that the arrangement of units that perform an attack is always the best by making a gap in the strategy on the side performing the attack by appropriately stopping the execution of the optimal arrangement calculation process, and As a result, it is possible to prevent the attacked side from always becoming inferior, and thus it is possible to advance the battle game while maintaining an appropriate balance of ability between the player and the battle side.

  Therefore, the present invention can provide an attractive competitive game by maintaining the interest of the game when the game progresses.

It is a figure which shows an example of the system configuration | structure which shows the structure of the game system of one Embodiment. It is an example of the functional block diagram which shows the structure of the server apparatus in one Embodiment. It is an example of the functional block diagram which shows the structure of the terminal device in one Embodiment. It is an example of the figure which shows the external appearance structure of the terminal device in one Embodiment. It is a figure which shows an example of the game image of the simulation game in one Embodiment. It is a figure for demonstrating the concept of the interlocking movement control process of one Embodiment. It is a figure for demonstrating the character characteristic and movement characteristic which are included in the unit characteristic of one Embodiment. It is a figure for demonstrating the attack characteristic contained in the unit characteristic of one Embodiment. It is FIG. (1) for demonstrating the interlocking movement control process in the player unit of one Embodiment. It is FIG. (2) for demonstrating the interlocking movement control process in the player unit of one Embodiment. It is FIG. (3) for demonstrating the interlocking movement control process in the player unit of one Embodiment. It is FIG. (4) for demonstrating the interlocking movement control process in the player unit of one Embodiment. It is FIG. (5) for demonstrating the interlocking movement control process in the player unit of one Embodiment. It is FIG. (6) for demonstrating the interlocking movement control process in the player unit of one Embodiment. It is FIG. (1) for demonstrating the arrangement | positioning calculation process (normal arrangement | positioning calculation process) with respect to the battle | competition unit of one Embodiment. It is FIG. (2) for demonstrating the arrangement | positioning calculation process (normal arrangement | positioning calculation process) with respect to the battle | competition unit of one Embodiment. It is a figure for demonstrating the arrangement | positioning calculation process (optimum arrangement | positioning calculation process) with respect to the battle | competition unit of one Embodiment. It is a flowchart which shows the operation | movement of the movement control process and attack control process in the player unit group performed by the terminal device of one Embodiment. It is a flowchart which shows the operation | movement of the movement control process and the attack control process in the battle | competition unit group performed by the terminal device of one Embodiment. It is a flowchart which shows the operation | movement of the arrangement | positioning calculation process in the battle | competition unit group performed by the terminal device of one Embodiment.

  Hereinafter, this embodiment will be described. In addition, this embodiment demonstrated below does not unduly limit the content of this invention described in the claim. In addition, all the configurations described in the present embodiment are not necessarily essential configuration requirements of the present invention.

[1] Game System First, the outline and outline configuration of the game system 1 of the present embodiment will be described with reference to FIG. FIG. 1 is a diagram showing an example of a system configuration showing the configuration of the game system 1 of the present embodiment.

  As shown in FIG. 1, the game system 1 of the present embodiment includes a server device 10 that provides a game service and a terminal device 20 (for example, terminal devices 20A, 20B, and 20C) on the Internet (an example of a network). It is configured to be connectable.

  By accessing the server device 10 from the terminal device 20, the user can obtain a game from the server device 10 via the Internet and play the game. Furthermore, the user can play the game while trying to communicate with other users by accessing the server device 10 from the terminal device 20.

  In particular, the server device 10 is an information processing device capable of providing a service that allows a user to play a game using the terminal device 20 that is communicatively connected via the Internet. The server device 10 can also function as an SNS server that provides a communication-type service. An SNS server refers to an information processing apparatus that provides a service that can provide communication among a plurality of users, for example.

  In addition, when the server device 10 functions as an SNS server, for example, a social game (Social Game) that is executed using an operating environment (API (application programming interface), platform, etc.) of the provided SNS is taken. A game called can be provided.

  Specifically, the server device 10 is a game provided on the Web browser of the terminal device 20, for example, various languages such as HTML, FLASH, CGI, PHP, shockwave, Java (registered trademark) applet, Java Script (registered trademark). It is possible to provide a browser game (a game that is activated by simply opening an installation site with a Web browser).

  Note that, unlike existing online games, social games include games that do not require dedicated client software and can be used only with a Web browser and an SNS account. In addition, the server device 10 can connect to other users' terminals (smartphones, personal computers, game machines, etc.) via a network, and can provide an online game that can simultaneously share the same game progress online. It has a configuration.

  On the other hand, the server apparatus 10 may be configured by one (apparatus, processor) or may be configured by a plurality (apparatus, processor).

Then, information such as billing information and game information stored in a storage area (storage unit 140 described later) of the server device 10 is stored in a database (storage device, memory in a broad sense) connected via a network (intranet or Internet). In the case of functioning as an SNS server, information such as user information 146 stored in the storage area is stored in a database (in a broad sense) connected via a network (intranet or Internet). May be stored in a storage device or a memory.

  Specifically, the server device 10 according to the present embodiment receives input information based on an operation of a user of the terminal device 20 (that is, a player who executes a game), and performs game processing based on the received input information. It has become.

  Then, the server device 10 transmits the game processing result to the terminal device 20. The terminal device 20 has a configuration for performing various processes for providing the user with the game processing result received from the server device 10 so that the user can view the game processing result.

  The terminal device 20 is an information processing device such as an image generation device such as a smartphone, a mobile phone, a PHS, a computer, a game device, a PDA, or a portable game machine, and a server device via a network such as the Internet (WAN) or a LAN. 10 can be connected to the device. The communication line between the terminal device 20 and the server device 10 may be wired or wireless.

  Further, the terminal device 20 includes a web browser capable of browsing web pages (HTML format data). That is, the terminal device 20 performs display control using a communication control function for performing communication with the server device 10 and data received from the server device 10 (Web data, data created in HTML format, etc.). A web browser function for transmitting user operation data to the server device 10 is provided, and various processes for providing the game screen to the user are executed, and the game is executed by the user. However, the terminal device 20 may acquire the game control information provided from the server device 10, execute a predetermined game process, and execute a game based on the game process.

  Specifically, when the terminal device 20 requests the server device 10 to play a predetermined game, the terminal device 20 is connected to the game site of the server device 10 and the game is started. In particular, the terminal device 20 uses the API as necessary to cause the server device 10 functioning as an SNS server to perform predetermined processing, or user information 146 managed by the server device 10 functioning as an SNS server. It has the structure which makes it acquire and runs a game.

[2] Server Device Next, the server device 10 of this embodiment will be described with reference to FIG. FIG. 2 is a diagram illustrating functional blocks of the server device 10 according to the present embodiment. Moreover, the server apparatus 10 of this embodiment is good also as a structure which abbreviate | omitted a part of component (each part) of FIG.

  The server device 10 includes an input unit 120 for use by an administrator and other inputs, a display unit 130 that performs predetermined display, an information storage medium 180 that stores predetermined information, communication that communicates with the terminal device 20 and others. A unit 196, a processing unit 100 that mainly executes processing relating to the game to be provided, and a storage unit 140 that stores various data mainly used for the game.

  The input unit 120 is used by a system administrator or the like for game settings, other necessary settings, and data input. For example, the input unit 120 of this embodiment is configured with a mouse, a keyboard, and the like.

  The display unit 130 displays an operation screen for the system administrator. For example, the display unit 130 of the present embodiment is configured by a liquid crystal display or the like.

  The information storage medium 180 (computer-readable medium) stores programs, data, and the like, and functions as an optical disk (CD, DVD), magneto-optical disk (MO), magnetic disk, hard disk, and magnetic tape. Or a memory (ROM) or the like.

  The communication unit 196 performs various controls for communicating with the outside (for example, a terminal, another server, or another network system), and functions as hardware such as various processors or a communication ASIC. Or a program.

  The storage unit 140 serves as a work area for the processing unit 100, the communication unit 196, and the like, and its function is configured by a RAM (VRAM) or the like. Note that information stored in the storage unit 140 may be managed in a database.

  Further, in the present embodiment, the storage unit 140 stores game information 144 indicating information related to the game to be provided, user information 146 indicating information regarding the user to be provided as a player regarding the provided game, and various other types necessary for game calculation. Is stored.

  The processing unit 100 performs various processes using the main storage unit 142 in the storage unit 140 as a work area. The functions of the processing unit 100 can be realized by hardware such as various processors (CPU, DSP, etc.), ASIC (gate array, etc.), and programs.

  The processing unit 100 performs various processes of the present embodiment based on a program (data) stored in the information storage medium 180. That is, the information storage medium 180 stores a program for causing a computer to function as each unit of the present embodiment (a program for causing a computer to execute processing of each unit).

  For example, the processing unit 100 (processor) controls the entire server device 10 based on a program stored in the information storage medium, and performs various processes such as control of data exchange between the units. Furthermore, the process which provides the various services according to the request | requirement from the terminal device 20 is performed.

  Specifically, the processing unit 100 of this embodiment includes at least a communication control unit 101, a Web processing unit 102, and a game management unit 104.

  The communication control unit 101 performs processing for transmitting and receiving data to and from the terminal device 20 via the network. That is, the server device 10 performs various processes based on information received from the terminal device 20 or the like by the communication control unit 101.

  In particular, the communication control unit 101 according to the present embodiment performs a process of transmitting a game screen to the user terminal device 20 based on a request from the user terminal device 20.

  The web processing unit 102 functions as a web server. For example, the Web processing unit 102 transmits data in response to a request from a Web browser installed in the terminal device 20 through a communication protocol such as HTTP (Hypertext Transfer Protocol), and the Web browser of the terminal device 20 Performs processing to receive data to be transmitted.

In the present embodiment, the case where the server device 10 also has a function as an SNS server will be described as an example. However, the server device 10 is formed separately from a game server and an SNS server. Also good. Moreover, the server apparatus 10 may perform a part or all of the game processing of the present embodiment, or the terminal apparatus 20 may perform a part thereof.

  The game management unit 104 is linked with the terminal device 20 and executes game processing related to a role playing game (RPG) and a battle game in each player based on the operation of the player input via the terminal device 20. The user information 146 including characters (units to be described later) and various items used by each user, such as the game progress status and item management of each user, is managed.

  In addition, as described later, the game management unit 104 automatically executes a game based on various data set by the user including the operation when a predetermined operation such as arrangement of each player unit is performed. Automatic calculation processing is performed, data to be played back by the terminal device 20 is generated, and the generated data is provided to the terminal device 20.

[3] Terminal Device Next, the terminal device 20 of the present embodiment will be described with reference to FIGS. 3 and 4. FIG. 3 is an example of a functional block diagram illustrating the configuration of the terminal device 20 in the present embodiment, and FIG. 4 is an example of a diagram illustrating an external configuration of the terminal device 20 in the present embodiment. Further, the terminal device 20 of the present embodiment may have a configuration in which some of the components (each unit) in FIG. 3 are omitted.

  The input unit 260 is for a player to input operation data, and the function can be realized by a touch panel or a touch panel type display, predetermined operation keys such as a cross key and a numeric keypad, or a controller.

  For example, when the input unit 260 is configured by a touch panel or a touch panel type display, a detection unit 262 that can detect a two-dimensional designated position coordinate (x, y) on a screen on which an image is displayed is provided. . For example, the input unit 260 includes a detection unit 262 that can detect a two-dimensional contact position coordinate (x, y) in the contact detection region (touch panel).

  In the present embodiment, the contact position is position information obtained from the contact detection area by a player's contact operation (including direct contact and indirect contact with a pointing device).

  Note that the contact operation of the player of the present embodiment includes a direct touch operation or slide operation on the touch panel 12 by a user's finger, and an indirect touch panel 12 executed via a device such as a pointing device. In addition to the touch operation or slide operation on the touch panel, a pseudo touch operation or slide operation on the touch panel 12 without directly or indirectly touching or sliding the touch panel 12 is also included.

For example, pseudo touch operation or slide operation is
(1) Irradiate a light beam such as infrared rays at a position close to the touch panel surface in parallel with the touch panel surface, and a plurality of irradiation units formed at one end of the touch panel 12 at regular intervals in the vertical and horizontal directions; And a pair of sensors that are provided at the other end of the touch panel facing each of the irradiation units, and that receive the irradiated light beams, respectively. Touch operation or slide operation that detects the blocked vertical and horizontal coordinates and recognizes based on the detected coordinates, and
(2) A touch operation or a slide operation in which a camera that captures an image of the display surface of the touch panel 12 is detected, a position coordinate at which the user touches or approaches the touch panel 12 by the camera, and is recognized based on the detected position coordinate;
Touch operation or slide operation that is recognized by actually touching the touch panel 12 or by detecting it in proximity.

  When a plurality of contact positions are detected simultaneously in the contact detection area, any one contact position (contact position detected earlier) may be used, or a plurality of contact positions are processed simultaneously. May be.

  When there are a plurality of determination areas in the contact detection area, one contact position (contact position detected earlier) may be used in each determination area. Further, the determination area is a range on the contact detection area that specifies in advance the contact position to be processed by the processing unit 200 such as movement control among the acquired contact positions.

  In particular, in the present embodiment, the display screen (display) 12 shown in FIGS. 4A and 4B is formed by laminating a liquid crystal display and a touch panel for detecting a contact position of a player (operator, user). It is a touch panel type display. That is, in the present embodiment, the display screen 12 functions as the input unit 260 and also functions as the display unit 290.

  The touch operation on the display screen (hereinafter referred to as “touch panel” unless otherwise specified) 12 may be performed using a fingertip, or may be performed using an input device such as a touch pen. Good.

  In addition, the input unit 260 may include a button or lever that can input operation information (operation signal) other than the designated position, a keyboard, a steering, a microphone, an acceleration sensor, and the like.

  The storage unit 270 serves as a work area for the processing unit 200, the communication unit 296, and the like, and its function can be realized by a RAM (VRAM) or the like. The storage unit 270 according to the present embodiment shows information related to a main storage unit 271 used as a work area, an image buffer 272 in which a final display image and the like are stored, and a user as a player regarding a game to be provided. It includes user information 273 and a game data storage unit 274 that stores various data necessary for executing a game such as table data. In addition, it is good also as a structure which abbreviate | omits these, and the memory | storage part 140 of the server apparatus 10 may comprise that part.

In particular, the game data storage unit 274 includes:
(1) Player units (hereinafter referred to as “player units”) such as characters and pieces (games of chess and chess) used in the game (hereinafter referred to as “player units”) and units (computer (CPU) and other players) of the battle game ( (Hereinafter referred to as “competition unit”) data relating to units used (2) items to be set in the player unit or the competition unit, commands to be executed (hereinafter also collectively referred to as “commands”) and data relating thereto, and ,
(3) Data relating to each field such as a plurality of fields in which the battle game is executed and terrain attribute information indicating terrain attributes of each square of each field;
Is memorized.

  Note that the data related to each unit includes, for example, characteristics related to units indicating characteristics and abilities relating to attacks and defenses such as attack power, attack characteristics, defense power, and defense characteristics of each unit (hereinafter also referred to as “unit characteristics”). , Attributes set according to the role of the game such as “fire” and “water”, and data on movement characteristics indicating the movable range of a field (map) composed of a plurality of squares.

Also, as attack power and defense power, for example, parameters of 10 steps or 5 steps, or parameters such as a 3-digit number are defined, and calculation of hit points when attacking or defending according to the value of the parameter. Used for.

  Furthermore, as attack characteristics or defense characteristics, for example, attack range or defense range based on a square as a moving unit that can attack in two directions within 2 squares from the target unit, or an attack such as magic, item or combo attack Types and defense types are defined.

On the other hand, the user information 273 includes
(1) Player unit during game execution and data related thereto,
(2) A battle unit in a battle game with a player and data related thereto, and
(3) Data relating to players necessary for the progress of games other than the above,
Is memorized.

  For example, the data relating to the player unit is data of a deck (hereinafter referred to as a player unit group) in which a plurality of player units used in the game are set as a player unit group among a plurality of player units possessed by the player in order for the player to advance the game. , Also referred to as “deck data”).

  Similarly, the data related to the battle unit includes deck data in which a plurality of battle units used in the game are set as a battle unit group among a plurality of battle units that play against the player.

  The information storage medium 280 (computer-readable medium) stores programs, data, and the like, and functions as an optical disk (CD, DVD), magneto-optical disk (MO), magnetic disk, hard disk, and magnetic tape. Alternatively, it can be realized by a memory (ROM).

  In addition, the information storage medium 280 can store a program for causing a computer to function as each unit of the present embodiment (a program for causing a computer to execute processing of each unit). Note that the processing unit 200 performs various processes of the present embodiment based on a program (data) stored in the information storage medium 280, as will be described later.

  The display unit 290 outputs an image generated according to the present embodiment, and its function can be realized by a CRT, LCD, touch panel display, HMD (head mounted display), or the like.

  In particular, in the present embodiment, the display unit 290 also functions as an input unit 260 that allows a player to perform a game operation by using a touch panel display. Here, as the touch panel, for example, a resistive film type (4-wire type, 5-wire type), capacitive type, electromagnetic induction type, ultrasonic surface acoustic wave type, infrared scanning type, or the like can be used.

  The sound output unit 292 outputs the sound generated by the present embodiment, and its function can be realized by a speaker, headphones, or the like.

  The communication unit 296 performs various controls for communicating with the outside (for example, a host device or another terminal device), and functions thereof are hardware such as various processors or communication ASICs, and a program. It can be realized by.

The terminal device 20 receives and receives the program and data for causing the computer to function as each unit of the present embodiment stored in the information storage medium and the storage unit 270 of the server device 10 via the network. Programs and data may be stored in the information storage medium 280 or the storage unit 270. The case where the terminal device 20 is made to function by receiving the program or data as described above can also be included in the scope of the present invention.

  The processing unit 200 (processor) performs processing such as game processing, image generation processing, or sound generation processing in conjunction with the server device 10 based on input data, a program, and the like from the input unit 260.

  In particular, in this embodiment, the game process includes a process for starting a game when a game start condition is satisfied, a process for advancing the game, a process for placing objects such as player objects and enemy objects, and an object display. A process for calculating the game result, a process for ending the game when a game end condition is satisfied, and the like.

  The processing unit 200 performs various processes using the storage unit 270 as a work area. The function of the processing unit 200 can be realized by hardware such as various processors (CPU, DSP, etc.), ASIC (gate array, etc.), and programs.

  In particular, the processing unit 200 of the present embodiment includes an object space setting unit 210, an operation detection processing unit 211, a display control unit 212, a movement processing unit 214, a game calculation unit 215, a virtual camera control unit 216, A game management unit 217, a drawing unit 220, and a sound processing unit 230 are included. A part of these may be omitted.

  For example, the operation detection processing unit 211 of the present embodiment constitutes an operation unit of the present invention, and the display control unit 212 constitutes a display control unit of the present invention. Further, for example, the movement processing unit 214 of the present embodiment constitutes the movement control means of the present invention, and the game calculation unit 215 constitutes the calculation means of the present invention.

  The object space setting unit 210 displays various objects (sprites, billboards, polygons, objects, such as objects (player objects, moving objects, enemy objects), moving paths, buildings, trees, pillars, walls, maps (terrain), and the like. A process of placing and setting an object composed of primitive surfaces such as a free-form surface or a subdivision surface in an object space (hereinafter also referred to as “game space”) is performed.

  Specifically, the object space setting unit 210 determines the position and rotation angle (synonymous with orientation and direction) of the object (model object), and rotates the object to that position (X, Y) or (X, Y, Z). The object is arranged at an angle (rotational angle around the X, Y axis) or (rotational angle around the X, Y, Z axis).

  The object space includes both a so-called virtual two-dimensional space and a virtual three-dimensional space. The two-dimensional space is a space in which an object is arranged at, for example, two-dimensional coordinates (X, Y), and the three-dimensional space is a space in which an object is arranged at, for example, three-dimensional coordinates (X, Y, Z). is there.

  When the object space is a two-dimensional space, the objects are arranged based on the priority order set for each of the plurality of objects. For example, processing can be performed in which objects are arranged in order from the object (sprite) that the user wants to appear on the back side, and the objects that the user wants to appear on the near side are superimposed.

If an object with a large drawing size is placed below the image and an object with a small drawing size is placed above the image, the object space corresponding to the top of the screen can appear to be on the back side. It can be seen that the corresponding object space is on the near side.

  On the other hand, when the object space is a three-dimensional space, the object is arranged in the world coordinate system.

  The operation detection processing unit 211 performs recognition processing of input information input from the input unit 260 by the player. Specifically, when detecting a touch operation input, the operation detection processing unit 211 of the present embodiment acquires an instruction position input by the input unit 260.

  For example, when detecting the touch operation input, the operation detection processing unit 211 detects the contact position (two-dimensional contact position coordinates) in the contact detection area (touch panel) for detecting the player's contact operation (ie, touch operation). Obtained as the indicated position.

  That is, the operation detection processing unit 211 touches the touch panel 12 with a finger (hereinafter referred to as “touch operation input”), moves the touch position while maintaining the touched state, and finally from the touch panel 12. A contact position (instructed position) during a contact operation period (during a slide operation period) corresponding to a period during which a release operation (that is, a slide operation) is performed is acquired.

In particular, the operation detection processing unit 211
(1) A first change (hereinafter, referred to as “contact state”) from a state where the touch operation is not input to the screen (hereinafter, referred to as “non-contact state”) to a state (hereinafter referred to as “contact state”). A first detection process for detecting a detection position (hereinafter also referred to as a “reference position”) at which the state change is executed,
(2) Touch operation input is continued after the first change is detected and the first change is detected (that is, when the state is changed from the non-contact state to the contact state) (that is, the contact state) When the input by the slide operation (hereinafter referred to as “slide operation input”) is executed, the change of the slide operation input (that is, the indicated position and the change of the indicated position) is changed to the second A second detection process to detect as a change,
(3) During the slide operation input, a third detection process for detecting a state where the touch operation input to the screen is not performed (that is, when the slide operation input ends and becomes a non-contact state) is executed.

  In addition, the operation detection processing unit 211 acquires the designated position input every predetermined cycle. Specifically, the predetermined period can be set for each frame, for example, about 1/60 second to 1/120 second.

  In the present embodiment, the “reference position” and the “instructed position” are not only the position on the touch panel 12 detected by the touch operation input or the slide operation input as described above, but a predetermined distance from the detection position. Or a predetermined position related to a specific position on the touch panel 12 such as an area formed in a predetermined area such as a corner of the touch panel 12.

  The display control unit 212 displays content related to a game to be executed on the touch panel 12 based on an instruction from the player. In particular, the display control unit 212 scrolls the display area portion of the content displayed on the touch panel 12 according to the progress of the game or according to the player's operation input (for example, touch operation input or slide operation input). To control the scroll display process to be moved.

  Note that the “content” in this embodiment is a game (specifically, an object space built on the game during the game) or a screen on a touch panel such as a menu for performing a given setting related to the game. Content that can be displayed on the screen, a portion that is displayed on the screen, and a portion that is not displayed outside the screen.

  The movement processing unit 214 performs a movement calculation of an object (particularly, a player unit, a battle unit, or other moving body object) in the object space. That is, the movement processing unit 214 includes input data (including motion data) input by the player through the input unit 260, a selected player unit and a unit command received with respect to the selected player unit, and a program for moving the battle unit ( Based on the movement algorithm), the object is moved in the object space, or a process for controlling the motion (motion, animation) of the object is performed.

  In particular, the movement processing unit 214 of the present embodiment uses object movement information (movement direction, movement amount, movement speed, position, rotation angle, or acceleration) and operation information (position or rotation angle of each part object), A simulation process is sequentially performed for each frame. Here, the frame is a unit of time for performing object movement processing, motion processing (simulation processing), and image generation processing. In the present embodiment, the frame rate may be fixed or variable depending on the processing load.

  Note that the movement processing unit 214 may perform processing for moving an object based on an input direction in a three-dimensional object space. For example, the movement direction is associated with each input direction in advance, and the object is moved in the movement direction corresponding to the input direction.

  On the other hand, the movement processing unit 214 performs movement control processing within the map of the player units and the battle units set in the deck, and movement control processing of other player units and battle units accompanying it, based on the operation of the player.

  Specifically, regarding the movement of the player unit during the battle game, the movement processing unit 214 uses the turn assigned to the player unit group based on the player's operation with each square in the field as the movement unit of each unit ( Movement control processing (hereinafter referred to as “unit movement control processing”) in which each player unit is moved within the movable range on the field and placed in a desired square within the period of the turn for the player to act (behavior phase). (Player unit) "or" first movement control process ").

  Then, the movement processing unit 214 performs a movement path and mass characteristics of a player unit that is a movement target (hereinafter referred to as “movement target player unit”) during the unit movement control process (player unit). Based on the above, a movement control process (hereinafter referred to as “linked movement control process (player unit)”) for moving the corresponding player unit and the corresponding battle unit among other player units different from the movement target player unit is executed. To do.

  The movement processing unit 214 is assigned to the battle unit group with respect to the movement of the battle unit during the battle game, based on the calculation result in the game calculation unit 215, with each square in the field as the movement unit of each unit. Movement control processing (hereinafter referred to as “unit movement control processing (competition unit)”) in which each battle unit is moved within the movable range on the field and placed in a desired square during the turn (opposition side action phase). Or “second movement control process”).

Then, the movement processing unit 214 performs the battle unit movement control process, based on the movement path and mass characteristics of the battle unit (hereinafter referred to as “movement target battle unit”) that has been moved. Then, a movement control process for moving the corresponding battle unit and the corresponding player unit among other battle units different from the movement target battle unit (hereinafter referred to as “interlocked movement control process (battle unit)”) is executed.

  The game calculation unit 215 performs various game calculation processes. For example, when a plurality of player units used for the game are set in the deck based on the player's instruction, the game calculation unit 215 uses each player unit set in the deck to advance each game. Execute the process.

  Specifically, the game calculation unit 215 forms an object space based on a map composed of a plurality of cells, and in the case of RPG, the game progress based on a scenario set in advance according to the user's operation, the player Arithmetic processing necessary for executing a game such as a battle between a unit and a battle unit and parameter management at the time of the battle is performed.

  In particular, the game calculation unit 215 performs calculation for executing unit movement control processing (player unit or battle unit) within a turn period assigned to a unit group that performs an attack such as a player unit group or a battle unit group. Processing, that is, placement calculation processing is performed for each unit in the unit group that performs the attack, which calculates the placement position on the square of the field in which the unit that performs the attack is placed.

Specifically, the game calculation unit 215
(1) Arrangement of each player unit on the field and arrangement of each fighting unit, movement characteristic of each player or movement characteristic of a unit that performs an attack on the movement characteristic of the fighting unit, or movement characteristics of both units; Based on the optimal arrangement calculation processing for calculating the optimal mass position in the unit that performs the one or more attacks to be arranged on the field, which is the arrangement of the mass that achieves the maximum effect, or
(2) Based on the arrangement of each player unit and each battle unit on the field and the movement characteristics of the unit that performs the attack, the position of the mass that realizes a predetermined effect in the unit that performs the attack is determined. One of the normal arrangement calculation processes to be calculated is executed as the arrangement calculation process.

  In the present embodiment, unless there is a specific description, the optimum placement calculation process and the normal placement calculation process will be described as being executed for each battle unit. However, the optimum arrangement calculation process and the normal arrangement calculation process may be executed for the player unit. In this case, the player unit becomes an attack unit, and the attack target unit becomes a battle unit.

  On the other hand, when the movement of the player unit and the battle unit is completed, the game calculation unit 215 performs a game calculation to automatically advance the battle game for each attack turn, defense turn, or attack and defense turn.

  Specifically, the game calculation unit 215 determines the positions of the cells arranged on the field in each player unit and each battle unit, the characteristics, attributes and various parameters of the characters of each unit, and the field as necessary. Based on the characteristics set in the square, a battle game including attacks and defenses between the player unit group and the battle unit group, such as an attack control process between the player unit group and the battle unit group, is automatically calculated and the calculation is performed. Advance the game based on the results.

Note that the game calculation unit 215 may execute a game calculation based on an operation input from the player input in real time to advance the game.

  Further, the game calculation unit 215 is executed in conjunction with the server device 10, but part or all of the game calculation unit 215 may be formed in the server device 10.

  The virtual camera control unit 216 generates an image that is visible from a given viewpoint and appears to have depth. In this case, the virtual camera control unit 216 performs a virtual camera (viewpoint) control process for generating an image that can be seen from a given (arbitrary) viewpoint in the object space. Specifically, a process for controlling the position (X, Y, Z) or the rotation angle (rotation angle about the X, Y, Z axes) of the virtual camera (process for controlling the viewpoint position and the line-of-sight direction) is performed.

  For example, when shooting an object (for example, a player unit, a battle unit, a ball or a car) from behind using a virtual camera, the position or rotation of the virtual camera so that the virtual camera follows changes in the position or rotation of the object. Controls the angle (orientation of the virtual camera).

  In this case, the virtual camera can be controlled based on information such as the position, rotation angle, or speed of the object obtained by the movement processing unit 214. Alternatively, the virtual camera may be controlled to rotate at a predetermined rotation angle or to move along a predetermined movement path. In this case, the virtual camera is controlled based on virtual camera data for specifying the position (movement path) or rotation angle of the virtual camera.

  When there are a plurality of virtual cameras (viewpoints), the above control process is performed for each virtual camera.

  The game management unit 217 sets a player unit and various items used for a game such as a battle game in each player based on the operation of the player input via the input unit 260, and registers them in the user information 273.

  In particular, when executing a game using a deck, the game management unit 217 registers the set player unit and various items in the user information 273 as deck data.

  The drawing unit 220 performs drawing processing based on the results of various processing (game processing) performed by the processing unit 200, thereby generating an image and outputting the image to the display unit (display) 290. The image generated by the drawing unit 220 may be a so-called two-dimensional image or a so-called three-dimensional image. In particular, the drawing unit 220 generates an image that is visible from a virtual camera in the object space and that is displayed on the screen.

  Here, when generating a two-dimensional image, the drawing unit 220 draws objects in order from the set low priority object, and when the objects overlap, draws by overwriting the high priority object. .

  When generating a three-dimensional image, the drawing unit 220 of the present embodiment firstly uses vertex data (vertex position coordinates, texture coordinates, color data, normal vector, or α value) of each vertex of the object (model). Etc.) is input, and vertex processing is performed based on the vertex data included in the input object data. When performing the vertex processing, vertex generation processing (tessellation, curved surface division, polygon division) for re-dividing the polygon may be performed as necessary.

  In the vertex processing, geometric processing such as vertex movement processing, coordinate transformation (world coordinate transformation, camera coordinate transformation), clipping processing, perspective transformation, or light source processing is performed. The given vertex data is changed (updated or adjusted) for the vertex group to be configured. Then, rasterization (scan conversion) is performed based on the vertex data after the vertex processing, and the surface of the polygon (primitive) is associated with the pixel. Subsequent to rasterization, pixel processing (fragment processing) for drawing pixels constituting an image (fragments constituting a display screen) is performed.

  In pixel processing, various processes such as texture reading (texture mapping), color data setting / changing, translucent composition, anti-aliasing, etc. are performed to determine the final drawing color of the pixels that make up the image, and perspective transformation is performed. The drawing color of the object is output (drawn) to the image buffer 272 (frame buffer, buffer that can store image information in units of pixels; VRAM, rendering target). That is, in pixel processing, per-pixel processing for setting or changing image information (color, normal, luminance, α value, etc.) in units of pixels is performed.

  Thereby, an image that can be seen from the virtual camera (given viewpoint) set in the object space is generated. Note that when there are a plurality of virtual cameras (viewpoints), an image can be generated so that an image seen from each virtual camera can be displayed as a divided image on one screen.

  Note that the vertex processing and pixel processing performed by the drawing unit 220 are performed by hardware that enables polygon (primitive) drawing processing to be programmed by a shader program described in a shading language, so-called programmable shaders (vertex shaders and pixel shaders). It may be realized. Programmable shaders can be programmed with vertex-level processing and pixel-level processing, so that the degree of freedom of rendering processing is high, and the expressive power can be greatly improved compared to fixed rendering processing by hardware. .

  The drawing unit 220 performs geometry processing, texture mapping, hidden surface removal processing, α blending, and the like when drawing an object.

  In the geometry processing, processing such as coordinate conversion, clipping processing, perspective projection conversion, or light source calculation is performed on the object. Then, the object data (positional coordinates of object vertices, texture coordinates, color data (luminance data), normal vector, α value, etc.) after geometry processing (after perspective projection conversion) is stored in the storage unit 270.

  In the texture mapping, the texture (texel value) stored in the texture storage unit of the storage unit 270 is mapped to the object. Specifically, the texture (surface properties such as color (RGB) and α value) is read from the texture storage unit of the storage unit 270 using the texture coordinates set (given) to the vertex of the object, etc. Map textures that are to objects. In this case, processing for associating pixels with texels, bilinear interpolation or the like is performed as texel interpolation.

  In the present embodiment, when an object is drawn, a process for mapping a given texture may be performed. In this case, the color distribution (texel pattern) of the texture to be mapped can be dynamically changed.

  In this case, textures having different color distributions (pixel patterns) may be dynamically generated, or a plurality of textures having different color distributions are prepared in advance, and the texture to be used is dynamically switched. May be. The texture color distribution may be changed in units of objects.

  In the hidden surface removal processing, hidden surface removal processing is performed by a Z buffer method (depth comparison method, Z test) using a Z buffer (depth buffer) in which the Z value (depth information) of the drawing pixel is stored. That is, when drawing the drawing pixel corresponding to the primitive of the object, the Z value stored in the Z buffer is referred to, and the Z value of the referenced Z buffer and the Z value at the drawing pixel of the primitive are obtained. In comparison, if the Z value at the drawing pixel is a Z value (for example, a small Z value) that is on the near side when viewed from the virtual camera, the drawing pixel is drawn and the Z value in the Z buffer is updated. Update to the correct Z value.

  In α blending (α synthesis), the rendering unit 220 performs a translucent synthesis process (usually α blending, addition α blending, subtraction α blending, or the like) based on an α value (A value). The α value is information that can be stored in association with each pixel (texel, dot), for example, plus alpha information other than color information. The α value can be used as mask information, translucency (equivalent to transparency and opacity), bump information, and the like.

  In particular, the drawing unit 220 in the present embodiment may generate an image to be displayed in a display area corresponding to the contact detection area. The image displayed in the display area may be an image including an object, for example.

  The sound processing unit 230 performs sound processing based on the results of various processes performed by the processing unit 200, generates game sounds such as BGM, sound effects, or sounds, and outputs the game sounds to the sound output unit 292.

  Note that the terminal device 20 of the present embodiment may be a system dedicated to the single player mode in which one player plays against the computer, or a plurality of players form a player unit group, or are divided into enemies and allies. The system may also be equipped with a multiplayer mode for competing.

  Further, when a plurality of players play, game images and game sounds to be provided to the plurality of players may be generated using one terminal device 20, a network (transmission line, communication line), etc. It may be generated by distributed processing using a plurality of terminal devices 20 or server devices 10 connected by.

[4] Technique [4.1] Outline of the Present Embodiment Next, an outline of the technique of the present embodiment will be described with reference to FIGS. 5 and 6. FIG. 5 is a diagram illustrating an example of a game image of the simulation game in the present embodiment, and FIG. 6 is a diagram for explaining the concept of the interlocking movement control process of the present embodiment.

  The terminal device 20 according to the present embodiment includes a player unit group composed of a plurality of player units and a battle unit group composed of a plurality of battle units using a field (that is, a map) composed of a plurality of cells. It has a configuration for executing a simulation game to be played.

  When the terminal device 20 starts the game, the turn of the player unit group that causes each player unit of the player unit group to act and the turn of the battle unit group that causes each unit of the battle unit group to act are one turn. It has a configuration in which the battle game is advanced by the system.

That is, the terminal device 20 moves and attacks on the square (attacked side) at each turn when performing a battle including an attack and a defense previously given to the player unit group and the battle unit group, such as an attack turn. Has a configuration to execute (defense).

  For example, when the battle game is started, the terminal device 20 according to the present embodiment displays a player character and enemy character in a predetermined square 301 of the field 300 as shown in FIG. 5 according to a calculation result based on the player's operation or automatic calculation. And each unit of each unit group such as a moving body are arranged and moved, and each player unit (character A310, character B320, character C330, character D340 in the example of FIG. 5) is played against the arranged units. The battle game is advanced by repeating the turn of the player unit and the turn of the battle unit until the game end condition is satisfied for the battle unit of the unit group (in the example of FIG. 5, character 410, character 420, character 430). It has a configuration.

  In the simulation game of this embodiment, as shown in FIG. 5, a square field (map) 300 composed of a plurality of square cells 301 is used, and this cell 301 is the action unit of each unit. The game is going to progress. However, in addition to the square map, for example, a hex map composed of a plurality of regular hexagonal squares or a provence map composed of a plurality of freely shaped squares may be adopted.

  Further, each square has a terrain attribute (for example, a flat land 510, a meadow 520, a forest 530, and a river 540 as shown in FIG. 5), and the terrain attribute is used for unit movement control and interlocking movement control of each unit. Has come to affect. In particular, the terrain attribute information of each square is stored in the game data storage unit 274 for each field.

  Furthermore, the “game end condition” includes, for example, annihilating each battle unit in the battle unit group, defeating a specific unit (a boss character unit) in the battle unit group, or a time limit being passed. It is.

  In the simulation game of this embodiment, the player unit to be operated is moved on the field based on the player's operation for each turn, and the other player units are moved along with the movement, so that the battle is performed as efficiently as possible. This is a battle game type simulation game having a puzzle-like element in which each player unit is arranged at a position where an attack can be performed on the unit.

  The terminal device 20 according to the present embodiment determines the behavior (movement control and attack control) of each player unit in the player unit group based on the player's operation when the player performs single play. Similar to the player unit group, while moving each battle unit, move the other battle unit along with the movement and place each battle unit at a position where it can attack the player unit as efficiently as possible. It has a configuration in which actions (movement control and attack control) for placing and attacking are determined based on a predetermined algorithm (that is, automatic calculation), and the simulation game is advanced.

Specifically, the terminal device 20 is a simulation game executed as such a battle game.
(1) Based on the player's operation, the player unit, which is a player unit, is moved within the movable range on the field defined according to the movement characteristics of each player unit, and is arranged in a desired square. Unit movement control processing (player unit);
(2) Unit movement control processing (fighting unit) that moves in a movable range on the field defined according to the movement characteristics of the fighting unit that is the fighting unit that fights the player, and places it in a predetermined square When,
(3) Arrangement calculation processing for calculating the position of the predetermined square when the unit movement control process (fighting unit) is executed and the battle unit is arranged on the predetermined square;
The configuration is executed.

  In addition, the terminal device 20 performs, as an arrangement calculation process, a cell that realizes the maximum effect based on the arrangement of each player unit and the arrangement of each battle unit on the field and the movement characteristics of each battle unit. It is configured to control whether or not to execute an optimal arrangement calculation process for calculating an optimal mass position in one or more competitive units that are positions and should be arranged on the field according to the game situation.

  In particular, the terminal device 20 of the present embodiment is predetermined as the placement calculation process based on the placement of each player unit on the field and the movement characteristics of the one or more battle units. The normal arrangement calculation process for calculating the position of the square that realizes the effect is executed, and either the optimal arrangement calculation process or the normal arrangement calculation process is selectively executed according to the game situation. .

On the other hand, the terminal device 20
(1) Within a predetermined time from the start timing of a predetermined event such as the start of an attack (that is, within a limited time, for example, within 30 seconds), or a predetermined number of cells (that is, within a limited moving distance) For example, a unit movement control process (player) in which each player unit is moved and arranged in a desired square within the player's turn period such as within the range of the number of squares to move 5 squares. Unit)
(2) During the turn period of the battle side (that is, the computer side), each battle unit is moved based on the calculation result obtained by the optimal layout calculation process or the normal layout calculation process as described above, and the desired unit is moved. Execute the unit movement control process (matching unit) placed on the square,
(3) Attacks between the player unit group and the battle unit group based on the positions of the squares of the player units and the battle units arranged and the unit characteristics including the character characteristics and attributes of the units and various parameters. Execute an attack control process for automatically calculating a battle game including an attack and defense between a player unit group and a battle unit group such as a control process,
The game is going to progress.

  In the unit movement control process (player unit), the terminal device 20 arranges each player unit from the first position on the given field to the desired second position based on the operation of the player. If there is another player unit or a battle unit in the path target cell indicating the cell on the movement path from the first position to the second position, the corresponding unit is set as the movement target unit. An interlocking movement control process for moving from the target cell to another cell is executed.

  Further, the terminal device 20 arranges each target unit from the first position on the given field to the desired second position based on the automatic calculation result of the game during the unit movement control process (matching unit). If there is a player unit or another battle unit in the path target cell indicating the cell on the moving path from the first position to the second position, the corresponding unit is set as the movement target unit. An interlocking movement control process for moving from the route target square to another square is executed.

For example, as shown in FIG. 6, the terminal device 20 is a case where the character A 310 of each player unit is arranged from the first position 302 to the second position 303 on a given field based on the player's operation. If a character C330, which is another player unit, exists on the path target cell 305 indicating the cell on the moving path 304 from the first position 302 to the second position 303, the character 330 is moved. An interlocking movement control process for moving the route target square 305 to another square 306 as a target unit is executed.

  By having such a configuration, the terminal device 20 of the present embodiment does not always calculate the optimal mass position when calculating the mass position in one or more battle units in the battle unit group. Since it is possible to change whether or not to calculate the optimum square according to the game situation, it is possible to prevent the placement of the fighting unit always the best and, as a result, to prevent the player from always becoming inferior. It can be done.

  Therefore, since the terminal device 20 of the present embodiment can advance the battle game while maintaining an appropriate balance of the ability with the player, it is possible to maintain the interest of the game and keep the game interesting. A game can be offered.

  The terminal device 20 of the present embodiment includes an enemy and character such as a battle game and a board game, a unit such as a card and a piece, or virtual currency or coins in the game, experience values, hit points, life energy, attack parameters, and a love game. A game for competing for parameters such as emotion parameters may be executed as a battle game. However, in the following description, description will be made using a battle game of a player unit group and a battle unit group.

[4.2] Unit and Unit Characteristics Next, the unit and unit characteristics in the present embodiment will be described with reference to FIGS. 7 is a diagram for explaining the character characteristics and the movement characteristics included in the unit characteristics of the present embodiment, and FIG. 8 is a diagram for explaining the attack characteristics included in the unit characteristics of the present embodiment. It is.

  The movement processing unit 214 is arranged on the path of the movement target unit when the unit movement control process for moving the player unit and the battle unit is executed and when the unit movement control process is being executed. When the linked movement control process for moving another unit different from the movement mode unit to another cell is executed, the character characteristics and movement characteristics defined in advance are used.

  In particular, when the game calculation unit 215 executes an arrangement calculation process (including an optimum arrangement calculation process and a normal arrangement calculation process) for determining a cell to be arranged on the field in each battle unit of the battle unit group. Predefined character characteristics and movement characteristics are used.

  Further, the game calculation unit 215 uses a character characteristic defined in advance and an attack characteristic against one or more attacks when executing an attack control process for performing a battle between the player unit group and the battle unit group.

Specifically, in the present embodiment, as character characteristics,
(A1) For example, character characteristics such as “fire”, “water” or “spear”, “warrior”, “demon”, etc. Stipulated attributes,
(A2) A parameter indicating the rank of the character (that is, the character level) and an experience value indicating a parameter necessary for level-up (A3) a hit point indicating the vitality of the player unit or the battle unit,
(A4) A parameter that affects the amount of damage to the opposing enemy when attacking a player unit or a battle unit, and an attack power that increases in value (parameter) when the character level is increased.
(A5) A parameter that affects the magnitude of damage received when an attack is received from a player unit or a battle unit. The defense level increases as the character level increases. (A6) At attack Or items such as special abilities (for example, magic and luck) or weapons that predominate during battles such as defense,
Is used.

  For example, FIG. 7A shows the attribute “warrior”, character level “1”, experience value “5”, hit point “1”, attack power “2”, defense power “1”, magic power “0”. It is shown that the character characteristics of the character A indicating luck “1” are defined. In FIG. 7B, the attribute “beast”, character level “2”, experience value “7” hit points are “2”, attack power “1”, defense power “4”, magic power “4” and It is shown that the character characteristics of character B indicating luck “1” are defined.

Moreover, as a movement characteristic,
(B1) Movement force indicating the maximum number of cells that can be moved in one turn when one cell in the field is used as a movement unit,
(B2) For example, a movement type that defines a movement method when moving a field such as “ground” or “floating”, and
(B3) For example, when a movement control process such as “clockwise”, “counterclockwise” or “no restriction” is being executed,
Is used.

  For example, FIG. 7A shows a movement characteristic “3”, that is, the movement characteristic of the character A indicating that it can move up to three squares in one turn, the movement type “ground”, and the interlocking movement characteristic “clockwise”. It is shown that it is prescribed. FIG. 7B shows that the movement characteristic of the character B indicating the movement force “1”, the movement type “ground”, and the interlocking movement characteristic “no restriction” is defined.

  In the present embodiment, as the actual moving force (the maximum number of movable cells) of each unit, the value of the terrain characteristic of the character characteristic and the value of the terrain attribute information set for each cell are added. Use the value.

Furthermore, the attack characteristics are registered for each type of attack defined in advance for each character. For example, in the attack characteristics of the present embodiment,
(1) Attack type such as batting system, magic system or combo and attack type indicating whether special attack is possible, (2) Attack ability indicating the level of attack power,
(3) Attack range indicating the range of attackable cells when one cell of the field is used as a unit of attack range,
(4) an attack target indicating an attack target of an attack on an enemy unit having a high hit point, an attack on the nearest enemy unit, or an attack on an enemy boss; and
(5) Trigger conditions when activating the attack,
Is included.

  For example, FIG. 8 (A) shows an attack on the character A indicating the attack type “batting system”, the attack power “1”, the attack range “one front”, the attack target “nearest enemy”, and the activation condition “none”. It is shown that the attack characteristics of A are defined. FIG. 8B shows an attack type “magic system”, an attack power “5”, an attack range “front 2 cells and left and right 1 cell”, an attack target “enemy with the highest hit point”, and an activation condition “ It is shown that the attack characteristic of the attack B of the character A indicating “moving three times by the interlocking movement control” is defined.

  In the present embodiment, as the actual attack ability of each unit, a value obtained by adding the attack power value of the character characteristics to the attack ability defined as described above is used.

  On the other hand, in the simulation game of the present embodiment, units having the above characteristics are set as decks as automatic enemies by player operations or based on computer calculations, and player unit groups and battle units Movement and attack are executed for each turn by the group, and the battle game proceeds.

  In the present embodiment, the movement is executed according to a predetermined turn period (for example, the number of movable masses, the movement time, or the point system as described above) such as each game level or each stage. The attack is executed based on the movement, but depending on the unit characteristics of the operation target player unit or the combination of player units set in the deck (that is, the number, type, or combination of specific unit characteristics) A turn period (specifically, a period during which the movement control process is executed or a period during which the attack control process is executed) may be determined.

  For example, when the turn period is determined by the combination of player units set in the deck, if the field in which the battle game is executed is “Lake”, the turn period may vary depending on the number of units having the “water” attribute. If the field is “volcano”, the duration of the turn becomes longer as the total value of the movement power of the units having the “fire” attribute (that is, the maximum number of movable masses) is larger. You may do it.

  Further, in this embodiment, movement control and attack control in each unit are executed according to the terrain attribute information set for each square of the field, but the terrain attribute is set according to the combination of units set in the deck. The movement control and the attack control in the unit may be executed by changing.

  For example, if the field is “Lake” and the number of units having the “Water” attribute is more than a certain number, the effect on the movement control or attack control on the minus side based on the topographic attribute regarding the water of each trout If the field is “volcano” and the total moving force of units with the “fire” attribute (ie, the maximum number of movable cells) is greater than or equal to a certain value, The effect on the movement control or attack control on the minus side based on the terrain attribute may be canceled.

[4.3] Unit Movement Control Processing Next, unit movement control processing in the player unit and the battle unit of the present embodiment will be described.

  The movement processing unit 214 sets each player unit in accordance with the movement characteristics of each player unit based on the player's operation on each player unit detected by the operation detection processing unit 211 for each turn. Move within the upper movable range.

(Basic player unit movement)
The movement processing unit 214 is arranged on a given field such as the position of a currently arranged square (hereinafter also referred to as “current arrangement”) or an instruction position (slide operation input start position) designated by the player. From the first position, the position of the square designated by the player as the desired second position (the end position of the slide operation input) while moving along each square serving as the movement path specified according to the slide operation input. ) Is executed.

  Specifically, when the operation detection processing unit 211 detects a touch operation input to a predetermined player unit, the movement processing unit 214 selects the detected player unit as an operation target player unit.

  In this state, when the movement processing unit 214 detects the slide operation input on the touch panel 12 while maintaining the touch state of the touch operation input when the operation target player unit is selected by the operation detection processing unit 211, The target player unit is moved in accordance with the slide operation input while dragging.

  Then, when the slide operation input on the touch panel 12 is completed and the touch processing input is canceled (when the touch operation input is released), the movement processing unit 214 performs the non-contact operation. The position on the touch panel 12 in the state is recognized as the movement end position, and the movement control of the player unit based on the touch operation input and the slide operation input is completed.

  At this time, the movement processing unit 214 operates in conjunction with the display control unit 212 to execute a display for identifying a player unit for which movement control has been completed from other player units for which movement has not yet been completed.

  When the time limit has elapsed during the slide operation input, the movement processing unit 214 recognizes the position on the touch panel 12 when the time limit has elapsed as the movement end position, and the touch operation input. The movement control of the player unit based on the slide operation input may be completed.

  In addition, when the limit movement distance is reached during such a slide operation input, the movement processing unit 214 recognizes the position on the touch panel 12 when the limit movement distance is reached as the movement end position, and touches it. The movement control of the player unit based on the operation input and the slide operation input may be completed.

  Furthermore, the time limit and the travel distance described above are, for example, parameters relating to the game such as predetermined item possession, use based on the item, action using the item, increase of the game level of the player, hit points, experience values, etc. Is changed, the time limit is extended or the limit moving distance is extended.

  In addition to the above, the movement control of the player unit does not necessarily have to be an operation on the touch panel 12; an instruction marker such as a cursor displayed on the display unit 290 is designated by an operation member such as a cross key; and Based on the operation designation, the player unit movement control as described above may be executed.

  For example, as shown in FIG. 6 described above, when a slide operation input is executed from the currently arranged square 302 of the player unit to be moved to the desired second position 303 along the arrow, the movement processing unit 214 Then, the operation target player unit (character A) 302 is moved in accordance with the movement path 304 formed along the arrow, and the movement control process of arranging at the second position 303 is executed.

  In the present embodiment, the movement of each unit may be set to be executable at least once in one turn, the points necessary for executing the movement are set for each turn, and 1 A point that can be used by each player unit in each turn may be set, and one or more movements in each player unit may be set to be executable within a range of points that can be used by each player unit.

  Further, it is not always necessary to move all the player units in the player unit group, and the movement of a specific player unit may be passed.

  Further, during the turn period, the movement processing unit 214 may execute the slide operation input again even after the operation target player unit is arranged at the end position of the slide operation input. It is possible to control the movement, but after the end of the turn period, it is fixed at the position at that time and moved again as an object of the linked movement control by the fixed position, or the position is attack controlled. Set to the processing start position.

(Movement based on movement characteristics)
In the turn of the battle unit group, the movement processing unit 214 determines that each battle unit is within a predetermined turn period based on the calculation result calculated by the optimal placement calculation process or the normal placement calculation process in the game calculation unit 215. A movement control process for moving within a movable range on the field defined according to the movement characteristics is executed.

  In particular, the movement processing unit 214 acquires each information of the first position, the second position, and the movement route on a given field in each battle unit by the optimal arrangement calculation process or the normal arrangement calculation process, and acquires the information. The movement of each battle unit is controlled according to each piece of information.

  In the present embodiment, as with the player unit, the movement of each unit may be set to be executable at least once in one turn, and the points necessary for executing the movement may be set for each turn. In addition, the points that can be used by each player unit in one turn may be set, and each battle unit may be set to be executable within the range of points that can be used by each battle unit.

  Similarly to the player unit, it is not always necessary to move all the battle units of the battle unit group, and the movement of a specific battle unit may be passed.

[4.4] Interlocked Movement Control Process Next, the interlocked movement control process in the player unit and the battle unit according to the present embodiment will be described with reference to FIGS. 9 to 14 are diagrams for explaining the interlocking movement control process in the player unit of the present embodiment.

(Basic principle of linked movement control processing (player unit))
During the unit movement control process in each player unit, the movement processing unit 214 selects the moving player unit (that is, the operation target player unit) from the first position on the given field (that is, the movement start position). When another player unit or a battle unit exists on the route target cell indicating the cell on the movement route to the second position (movement end position), the other player unit or the battle unit is set as the movement target unit. An interlocking movement control process for moving from the route target square to another square is executed.

  In particular, the movement processing unit 214 performs the operation target player unit at the timing when the operation target player unit passes the position of the path target cell where another player unit or the battle unit exists (hereinafter referred to as “passing timing”), or Move the movement target unit from the route target cell to another cell at a timing related to the passage timing, such as after moving to the second position.

Specifically, the movement processing unit 214 has a movement target unit that exists in the route target cell as an operation target player unit such as a cell that exists immediately before the passage timing or a cell that exists at the start of movement. Move to a square (that is, swap the positions of the square between the operation target player unit and the movement target unit), or move the movement target unit existing in the path target square to the adjacent square in contact with the path target square (That is, the moving target unit is pushed from the path target square to the neighboring square).

  For example, as shown in FIG. 6 described above, the operation target player unit 310 is moved from the movement start position 302 to the movement end position 303 along the slide operation input (movement path). It is assumed that there are two player units 330.

  In this case, when the operation target player unit 310 moves from the mass 306 to the route target mass 305 (that is, the passage timing), the movement processing unit 214 performs the operation as shown in FIGS. The other player unit 330 is specified as the movement target unit, and the movement target unit 330 is moved to the square 306 that exists immediately before the passing timing of the operation target player unit 310.

  That is, in this case, the movement processing unit 214 performs control to switch the position of the operation target player unit 310 and the position (mass) of the movement target unit 330 at the passage timing.

  Further, for example, as described above, when moving along the slide operation input (movement path) 304 from the movement start position 302 to the movement end position 303, there is another player unit 330 in the path target mass 305. Assume a case.

  In this case, when the operation target player unit 310 moves from the square 306 to the path target square 305 (that is, the passage timing), the movement processing unit 214 performs the processing as shown in FIGS. Another player unit 330 may be specified as a movement target unit, and the movement target unit 330 may be moved to a cell at the movement start position 302 of the operation target player unit 310.

  That is, the movement processing unit 214 can change the position of the movement target unit to the movement start position 302 of the operation target player unit 310 as the position of the operation target player unit that existed at a timing earlier than the passage timing. It is.

(Unit-linked movement control processing based on character characteristics, etc. (player unit))
The movement processing unit 214 includes an interlocking movement characteristic included in the movement characteristic of the movement target unit existing in the route target cell, a terrain characteristic included in the character property, and a cell adjacent to the route target cell or the route target cell. (Hereinafter referred to as “route target adjacent square”) based on at least one of the terrain attribute information, a movement mode for the movement target unit is determined, and the movement target unit is moved from the route target square to another square. May be.

  For example, when the movement target unit 330 has a “counterclockwise” characteristic as the interlocking movement characteristic, the movement processing unit 214 turns the movement target unit counterclockwise as shown in FIG. The position of the square of 330 is moved from the route target square 305 to the destination square 306.

  When the movement target unit 330 has a “clockwise” characteristic, as shown in FIG. 11B, the movement target unit 330 is determined to be counterclockwise and the movement target unit 330 is rotated clockwise. The position of the square is moved from the path target square 305 to the destination square 306.

FIG. 11 shows an example in which the position of the cell 306 of the operation target player unit (not shown) and the position of the cell (route target cell) 305 of the movement target unit 330 are switched at the passage timing.

  In addition, for example, the movement processing unit 214 has a case where the wind is flowing as the terrain attribute on the left side of the route target cell (the wind is not flowing on the right side). ”As the movement mode, it is decided to move from the side where the wind is flowing, and as shown in FIG. 12A, the passing timing of the operation target player unit (not shown) The movement target unit 330 is moved counterclockwise to the square 306 that exists immediately before.

  On the other hand, when the field is a slope with a mountain in front of the route target mass and becoming higher in front of the route target mass, the movement target unit 330 has the attribute of “water” as the terrain characteristic Therefore, as shown in FIG. 12 (B), the mass constituting the valley where the altitude is the lowest is determined. Move to 308.

  The movement direction of the movement target unit in FIG. 12B is “counterclockwise”, but the movement direction may be “clockwise”. In FIG. 12B, even if the square 308 that forms the valley with the lowest elevation is on the movement path 304a, the square 308 is not on the movement path 304b. The mass 308 may be moved.

  FIG. 12 shows an example in which the position of the square (route target square) 305 of the movement target unit 330 is changed at the passage timing.

  Further, for example, as shown in FIG. 13A, the movement processing unit 214 has, as the terrain attribute information, a regional attribute that prevents the route target adjacent cell on the right side of the route target cell from moving the tree 531 or the like. If it is, the counterclockwise direction is determined as the movement mode, and the position of the mass of the movement target unit 330 is moved counterclockwise as shown in FIG.

  In FIG. 13, as in FIGS. 11 and 12, the position of the cell 306 of the operation target player unit (not shown) and the position of the cell (route target cell) 305 of the movement target unit 330 are switched at the passage timing. It is an example.

  On the other hand, in the present embodiment, the movement target unit may be moved from the route target square to another square by a composite combination of the interlocking movement characteristic, the terrain characteristic, and the terrain attribute information.

  For example, in this embodiment, when the terrain attribute of the route target cell is “water” and the movement target unit 330 has the attribute “water” as the terrain characteristic, the movement processing unit 214 Assuming that long-distance movement is possible, execution of long-distance movement is determined as the movement mode, and the movement target unit U2 is moved to the cell at the movement start position 302 of the operation target player unit 310 having the longest distance. May be moved.

  Furthermore, in this embodiment, the area subject to the route is determined by whether or not the unit is allowed to move by having a restraining factor that cannot move left and right or any one of the moving routes such as “bridge” and “mountain road”. It may have characteristics.

(Other linked movement control processing (player unit))
In the present embodiment, in addition to the operation target player unit and the movement target unit, the movement mode of the movement target unit may be determined based on the character characteristics of the player unit adjacent to these units.

  Specifically, the movement processing unit 214 moves the moving target unit to a specific cell such as a route target cell that can activate the cooperative attack when the adjacent player unit and the moving target unit are capable of the cooperative attack. Also good.

  For example, when the movement target unit (character C) 330 is arranged on the left side of the operation target player unit (character A) 310, the operation target player unit (character A) 310 and the movement target unit (character C) 330 are 14A, it is assumed that the movement target unit (character C) 330 exists on the movement path 304 of the operation target player unit (character A) 310, as shown in FIG.

  In this case, the movement processing unit 214 may move the movement target unit (character C) 330 to the square (specific square) 309 that is in contact with the left side of the movement end position 303 as shown in FIG. Good.

  In the present embodiment, the movement of the movement target unit may be stopped according to the terrain attribute or the regional attribute. For example, as the terrain attribute information, as shown in FIG. 13A described above, the route target adjacent cell on the right side of the route target cell 305 has a region attribute that obstructs the movement of the tree 531 or the like. When the movement target unit 330 has a “clockwise” characteristic, the movement processing unit 214 stops moving the movement target unit 330 because the movement target unit cannot move clockwise. Thus, the position of the mass of the movement target unit 330 is maintained (that is, the mass remains in the mass 305).

  In the present embodiment, the battle unit may be handled as a non-target of the linked movement control process. That is, the movement processing unit 214 moves the player unit to another cell even if the player unit exists in the path target cell during the unit movement control process of the battle unit, such as to simplify the strategy in the simulation game. Disable the process to be executed.

(Interlocked movement control process in the battle unit)
In the movement processing unit 214 of the present embodiment, as for the linked movement control process in the battle unit, in the same way as the linked movement control process in the player unit, the moving battle unit is given during the unit movement control process in each battle unit. If there is a player unit or other battle unit on the route target mass on the movement path from the first position to the second position on the field, the player unit or other battle unit is set as the movement target unit. An interlocking movement control process for moving from the route target square to another square is executed.

  In addition, the movement processing unit 214, for the linked movement control process in the battle unit, similarly to the linked movement control process in the player unit, based on the character characteristics or the character characteristics of other battle units close to the battle unit The movement mode of the movement target unit may be determined based on the above.

  In the present embodiment, the player unit may be excluded from the interlocking movement control process, similarly to the interlocking movement control process of the player unit. That is, the movement processing unit 214 moves the player unit to another cell even if the player unit exists in the path target cell during the unit movement control process of the battle unit, such as to simplify the strategy in the simulation game. Disable the process to be executed.

[4.5] Effects Based on Unit Movement Control Process and Linked Movement Control Process Next, effects based on the unit movement control process and the linked movement control process of the present embodiment will be described.

  When the movement processing unit 214 activates the linked movement control for the other player units or the battle units by the unit movement control process of the movement target unit, the movement processing unit 214 controls the operation target player unit, the movement target unit, or both, Gives a given effect to be used when executing attack control processing.

  Specifically, each time the linked movement control is executed, the movement processing unit 214 increases the parameters of the player unit that performs an attack by the attack control process, activates a specific ability (special attack) of the player unit, Use of items (special weapons), various gauges used during attack control processing, and selection as a combo attack unit for attacking with other player units are included.

  Specifically, each time the linked movement control is executed, the movement processing unit 214 performs the attack power and hit points of the player unit that is the operation target player unit, the player unit that is the movement target unit, or both player units. Etc., or increase the gauge of the parameter.

  In particular, the movement processing unit 214, when the parameter is increased by a parameter value, is specified by an increase or level of the maximum value (ie, upper limit value) of the parameter currently specified. If so, level up.

  In addition, the movement processing unit 214 increases the parameter in the range not exceeding the maximum parameter range defined at the present time, that is, recovers the parameter decreased during the battle game. I do.

  On the other hand, the movement processing unit 214 has activated the linked movement control in all the current turns, the current turn (hereinafter referred to as “current turn”), and a predetermined number of turns. The number of times or the number of times moved by linked movement control (hereinafter referred to as “number of movements”) is counted, and the player unit that is the operation target player unit, the player unit that is the movement target unit, or the A specific attack of both player units or a combo attack for performing an attack in cooperation with other player units is determined.

  For example, the movement processing unit 214 counts movements based on the linked movement control executed by the unit movement control process in each player unit of the player unit group during the current turn, and the counted number of movements is equal to or greater than a predetermined number. For the movement target unit, a flag for invoking a specific attack of the player unit at the time of the attack control processing or a flag for invoking a combo attack for performing an attack in cooperation with other player units is set.

  For example, when the combo attack is activated, the game calculation unit 215 counts the number of movements for each operation target player unit that has activated the interlock movement control, and the game operation unit 215 A combo attack may be activated, or a combo attack may be activated with a player unit set in advance or another player unit closest to a player unit having a flag for performing a combo attack.

[4.6] Display Control Based on Unit Movement Control Process and Linked Movement Control Process The movement processing unit 214 is linked to the display control unit 212, and the operation target player unit, the moved battle unit, or the movement target unit displays a square. In the case of movement, when there is an attack target unit that is an attack target in the moved unit, or when the attack target unit is changed, the display is made on the touch panel 12.

[4.7] Attack Control Processing Next, attack control processing in the player unit group and the battle unit group of the present embodiment will be described.

  Based on the position of each player unit and each battle unit arranged by the movement control process including the unit movement control process and the linked movement control process, and the flag information set by the movement control process, the game calculation unit 215 An attack process in which each player unit attacks the battle unit and an attack control process in which each battle unit attacks the player unit are executed while giving a given effect to the player unit and the battle unit.

  Specifically, when each player unit attacks a battle unit, the game calculation unit 215 determines the location of the cell where each player unit exists, its flag information (whether a special ability or combo attack is activated), Based on the character characteristics and the attack characteristics, the character characteristics of the battle units existing in the attack range, and the terrain attribute information set in the squares and fields, automatic calculation for attack control processing is executed.

  In particular, the game calculation unit 215 calculates a correction value for the attack power in each unit based on the terrain characteristics included in the character characteristics and the terrain attribute information defined for each square, and calculates the correction value to the calculated correction value. Based on this, automatic calculation for attack control processing is executed.

  In addition, the game calculation unit 215 executes automatic calculation for attack control processing from each player unit to the battle unit based on the distance to the battle unit, a predetermined rule or a deck setting.

  On the other hand, when each battle unit attacks the player unit, the game calculation unit 215 determines the position of the cell where each battle unit exists, flag information (whether special ability or combo attack is activated), character characteristics, and attack characteristics. Based on the character characteristics of the player units existing in the attack range and the terrain attribute information set in the squares and fields, automatic calculation for attack control processing is executed.

  And the game calculating part 215 makes the display control part 212 produce | generate the display data for displaying the game result in a turn based on an automatic calculation result.

[4.8] Arrangement Calculation Processing Next, the arrangement calculation processing according to the present embodiment will be described with reference to FIGS. 15 and 16 are diagrams for explaining the placement calculation processing (normal placement calculation processing) for the battle unit according to the present embodiment, and FIG. 17 illustrates the placement calculation processing (optimum for the battle unit according to the present embodiment). It is a figure for demonstrating arrangement | positioning calculation processing.

(Outline of placement calculation processing)
The game calculation unit 215 executes an arrangement calculation process for calculating the position of the predetermined square when the unit movement control process (fighting unit) is executed and each of the battle units of the battle unit group is arranged on the predetermined square. .

In particular, as placement calculation processing,
(A) Based on the placement of each player unit on the field, the placement of each battle unit, and the movement characteristics of each battle unit, it is the position of the cell that achieves the maximum effect and is placed on the field. An optimal placement calculation process for calculating the optimal mass position in each of the one or more fighting units,
(B) Based on the arrangement of the player units on the field and the movement characteristics of the one or more battle units, the positions of the squares that realize a predetermined effect in the one or more battle units are calculated. Normal placement calculation processing,
including.

  Then, the game calculation unit 215 selectively determines whether to execute the optimum arrangement calculation process according to the game situation by selectively executing either the optimum arrangement calculation process or the normal arrangement calculation process according to the game situation. Control.

  In particular, in the present embodiment, the control of whether or not the optimal placement calculation process can be executed includes probability control (a winning probability including 0%), execution count, execution time, or , Execution timing control is included.

  For example, as control of the execution probability (invocation probability) of the optimum arrangement calculation processing, control to make the activation probability high or low (including 0%) is executed according to the game situation, and the optimum arrangement is executed. As the control of the number of executions of the arithmetic processing, control for increasing or decreasing the number of executions in each section such as the whole game or the game stage can be executed according to the game situation.

  Further, for example, as the control of the execution time of the optimum arrangement calculation process, the time for executing the optimum arrangement calculation process in each section such as the whole game or the game stage according to the game situation (the arrangement calculation executed up to that point) The control for extending or shortening the time during which the optimal placement calculation process is executed with respect to the total execution time of the process is executed.

  Furthermore, for example, when controlling the execution timing of the optimal placement calculation process, the battle unit may have a match-up, such as when the life energy of the battle unit is below a certain level or when the number of battle units is below a certain number. It is controlled at which timing of the game whether or not the optimal placement calculation processing is executed.

(Normal placement calculation processing)
The game calculation unit 215 performs normal placement calculation processing within the movement range based on the arrangement of each player unit of the player unit group on the field and the attack target information included in the movement characteristics of one or more battle units. Then, as the predetermined effect in each of the one or more battle units, the positions of the squares that realize the effect of attacking and defeating the player unit are calculated.

In particular, the game calculation unit 215 is configured so that the game calculation unit 215 has a square position that achieves a predetermined effect.
(1) Position for attacking the player unit closest to the opponent unit,
(2) A position for attacking the player unit that can be most easily finished;
(3) A position for attacking the player unit in conjunction with another combat unit such as a combo attack, or
(4) a position where a maximum attack selected from one or more attack types can be performed on the player unit as an attack target;
Is calculated.

Specifically, the game calculation unit 215 acquires the movement characteristics of each battle unit when executing the unit movement control process for each battle unit,
(A) attacking the player unit closest to the opponent unit;
(B) attacking the player unit that can be most easily terminated;
(C) attacking the player unit in conjunction with other combat units such as a combo attack, and
(D) performing a maximum attack selected from one or more attack types on the player unit as an attack target;
The attack target information such as the attack characteristics of the target combat unit and the selected maximum attack are read out.

  Based on the read attack target information, the character characteristics of each player unit that is the opponent, various parameters, and the position of the cell, the game calculation unit 215 (ie, the position of the corresponding battle unit (ie, The second position from the movement start position to the movement end position in the unit movement control process (target unit) including the movement path is calculated.

  For example, the attack target of the opponent unit 410 that is the target of unit movement control has the characteristic that “the closest player unit is attacked”, the attack range of the attack A of “front 1 square”, and “maximum 5 squares” , And the character A310 is the closest to the battle unit 410 among the character A310, the character B320, and the character C330 as shown in FIG. Suppose.

  In this case, as shown in FIG. 15B, the game calculation unit 215 obtains a square 421 in the attackable range of the character A 310 and a square 421 in the attackable range as shown in FIG. Is calculated.

  On the other hand, in the case where there are a plurality of movement paths including the case where one battle unit differs for each type of attack, the game calculation unit 215 determines whether there is an obstacle or the position of a square of another battle unit, or Randomly, the movement path is selected and the position of the square where the battle unit is arranged is calculated.

  That is, as shown in FIG. 16A, in the case of a movement range of “maximum 5 squares”, the movement path 304A and the movement path 304B are calculated as the attack range of the attack A (front 1 square and backward 1 square). It is assumed that the movement path 304C can be calculated as the attack range of attack B (front 2 squares).

  In this case, the game calculation unit 215 selects the movement route (for example, the movement route 304B) and randomly arranges the battle units based on the presence or absence of obstacles and the positions of the squares of other battle units. Calculate the position of the square to be performed.

  On the other hand, in this case, when the movement range of the battle unit 410 subject to unit movement control is “maximum 1 square”, the battle unit 410 cannot be moved to the attack range of the character A310. Even if it exists, as shown to FIG. 16 (B), the game calculating part 215 calculates the position of the cell | surface which approaches as much as possible.

  In addition, when the movement start position and the movement end position of the battle unit are calculated including the movement route as described above, the movement processing unit 214 also performs the linked movement control process in other units based on the calculation results. Including the movement control of the battle unit.

(Optimal placement calculation processing)
The game calculation unit 215 performs optimal placement calculation processing based on unit characteristics (character characteristics, movement characteristics, and attack characteristics), field attributes of each square, unit characteristics of each player unit, and parameters thereof. A process for determining the arrangement of units for maximizing the effect of winning the battle game is executed.

  In particular, the game calculation unit 215 generates an optimum for each battle unit based on an attack based on each attack control control process for the player unit group in each battle unit in the battle unit group, which occurs with the movement control process for each battle unit. The correct arrangement position is calculated.

  In other words, in the present embodiment, the game calculation unit 215 wins the competitive game at the position of the square of each competitive unit that maximizes the parameters that disappear in the entire play unit group due to the attack of each competitive unit in the competitive unit group. It is calculated as the arrangement of each target unit to show the maximum effect.

  In the attack control process of the present embodiment, the game calculation unit 215 surrounds the opponent unit with a plurality of units such as each battle unit of the battle unit group surrounds each player unit in the attack control process of this embodiment. In the case of attacking with, the placement position of the battle unit that surrounds each player unit in a comprehensive and efficient manner and that can totally damage the player unit group in total is determined. The process to determine is executed.

  Further, in principle, the game calculation unit 215 calculates an arrangement position in each battle unit on the assumption that each battle unit performs an attack that exhibits the maximum attack power in the battle unit. However, even if it is not an attack that exhibits the maximum attack power, an attack of other opponent units such as linked movement control processing or linkage attack may cause the attack to exert the maximum effect of the opponent unit group. For this, an arrangement different from the arrangement for performing an attack that exhibits the maximum attack power is selected.

  Specifically, the game calculation unit 215, in each battle unit, similarly to the normal placement calculation process, includes the placement of each player unit in the player unit group on the field and the attack target including the movement characteristics of one or more battle units. Based on this information, the position of a cell that realizes an effect of attacking and defeating the player unit as a predetermined effect in the one or more battle units is calculated within a predetermined movement range.

  At this time, when the game calculation unit 215 calculates a plurality of movement paths including different movement end positions in each battle unit, the game calculation section 215 holds each movement path.

  Then, the game calculation unit 215, in the battle unit for which a plurality of movement paths are calculated, based on the movement path calculated for each battle unit, from among the plurality of movement paths, for each player in each battle unit. A combination of movement paths that comprehensively and efficiently surrounds the unit and that is capable of maximally damaging the player unit group in total is specified and included in the specified combination. Each movement path is determined as the movement path of the corresponding battle unit.

  In addition, when the game calculation unit 215 specifies one movement path from a plurality of movement paths in the corresponding battle unit, the game calculation unit 215 activates a linked attack based on the number of times of movement by the linked movement control process or executes a special attack. For example, the movement path of each battle unit is determined including an attack caused by a predetermined effect given based on the linked movement control process in each battle unit or each player unit.

For example, it is assumed that the next movement path can be calculated for each battle character as shown in FIG.
(1) The battle unit 410 and the battle unit 420 are identified as attacking the character B 320 and the character D 340, respectively, and the movement range of each battle unit 410 and the battle unit 420 is “maximum 3 squares”. It is possible to calculate the movement path 411 to the movement end position 402 for performing the attack within the attackable range (front one cell), and similarly the movement path 422 to the movement end position 403.
(2) It is possible to calculate the movement path 431 to the movement end position 404 for performing the attack A (attack power: 1 and attack range: one cell forward) against the character A 310 in the battle unit 430 whose movement range is “maximum 3 squares”. .
(3) It is possible to calculate the movement path 432 to the movement end position 405 for performing the attack B (attack power: 5 and attack range: 2 forward cells) against the character C330 in the battle unit 430 whose movement range is “maximum 3 squares”. .
(4) The attack of attack B is invalid for character A310, and a movement route based on the attack cannot be selected.
(5) No movement based on the linked movement control process in each battle unit and each player unit occurs.

  In this case, the game calculation unit 215 specifies the movement path for the battle unit 410 and the battle unit 420 as in (1) and (2), and moves the player unit 430 as a whole player unit. Since the attack B based on the path 432 can give a player unit more damage than the attack A based on the movement path 431, it is selected to move the battle unit 430 along the movement path 432.

  Further, in the optimum arrangement calculation process of the present embodiment, as shown in FIG. 16B, even if a specific battle unit 410 is moved by the unit movement control process of the battle unit 410, the attack range (front and rear) It is also assumed that no player unit exists in one square).

  In this case, as shown in FIG. 17B, in the unit movement control process of the other battle unit 420, the battle unit 410 on the movement path 435 is moved from the position of FIG. Further, it can be moved and arranged so that the character A 310 (specifically, the character A in the front square of the battle unit 410) exists in the attack range.

  Therefore, in such a case, the arrangement of each battle unit is controlled so that the attack unit as a whole can make the maximum attack.

  That is, in this case, in the battle unit 420, it is possible to calculate both the movement path 435 and the movement path 436 that move to the mass that can attack the character B 320. On the other hand, in the case of moving along the movement path 437 than in the case of moving along the movement path 436, the other battle unit 410 is moved to the attackable range with respect to the character A 310, and as a whole battle unit group, the player unit group It is possible to give maximum damage in total.

  Therefore, in this case, the game calculation unit 215 selects the movement path 435 for the battle uni 420 as the optimal placement calculation process.

  In the case of FIG. 17B, the attackable range of the battle unit 410 and the battle unit 420 is “one square forward and backward”, and the battleable unit movement range is “maximum 1 square” and battle. This is a case where the movable range of the unit 420 is “maximum 3 squares”.

  On the other hand, the game calculation unit 215 controls whether to execute the optimum arrangement calculation process by selectively executing either the optimum arrangement calculation process or the normal arrangement calculation process according to the game situation.

Specifically, the game calculation unit 215 has (1) the game level and experience value of the player as the game situation,
(2) Player unit parameters when a player unit having a predetermined character level is included in the player unit group (3) Evolution in which various abilities of the player unit are improved (for example, changes in attributes, abilities and characteristics, and Based on that, the upper limit of the variation range of each parameter is increased),
(4) Items owned by the player or items set to be executable for the turn,
(5) The type and level of the ongoing game stage,
(6) Competence differences between the player unit group and the battle unit group, such as the overall character level and experience level, or the player with the highest or lowest ability or the battle unit with the highest or lowest ability Capacity difference,
(7) Lottery result by gacha (gacha for deciding whether or not to perform optimal placement calculation processing), and
(8) Billing status (selection of avoidance of execution of optimal arrangement calculation process by charging) and charge amount (execution of optimal arrangement calculation process can be avoided if the previous charge amount is a certain amount or more),
Accordingly, whether or not the optimal placement calculation process can be executed is controlled.

  For example, in the case of (1), when the specific player unit or all the player units have specific items, the game calculation unit 215 increases the winning probability of execution of the optimal placement calculation processing or executes Increase the number of times and execution time to execute the arrangement calculation process.

  In addition, in the case of (2), the game calculation unit 215 reduces the winning probability of execution of the optimal placement calculation processing as the parameters such as hit points of the player unit decrease, or reduces the number of executions and execution time. Reduce the placement calculation processing.

  Further, in the case of (3), the game calculation unit 215 wins the execution of the optimal arrangement calculation process as the number of times of evolution in each player unit increases or as the game level or experience value of the player increases. The placement calculation process is executed by increasing the probability or increasing the number of executions or execution time.

  In addition, in the case of (4), the game calculation unit 215, for example, in the case of a bonus stage, lowers the winning probability of execution of the optimal arrangement calculation process, or reduces the number of executions and execution time to reduce the arrangement calculation. Execute the process.

  In the case of (5), for example, the game calculation unit 215 increases the winning probability of execution of the optimal placement calculation processing or increases the number of executions and execution time as the stage level of the game stage increases. Then, the arrangement calculation process may be executed.

  In addition, in the case of (6), the game calculation unit 215 reduces the winning probability of execution of the optimal placement calculation processing when the player unit group has a capability difference lower than a certain level than the battle unit group, or the number of executions Execute placement calculation processing with reduced execution time and increase the winning probability of execution of optimal placement calculation processing as the capacity difference approaches, or execute placement calculation processing with increased number of executions and execution time Let

In addition, in the case of (7), the game calculation unit 215 reduces the winning probability of execution of the optimal placement calculation processing when the winning is determined based on the gacha lottery result performed in advance, The placement calculation process is executed with a reduced execution time.

  In addition, in the case of (8), the game calculation unit 215 determines the optimum arrangement calculation process when the charge amount up to the execution time of the arrangement calculation process is a certain amount or when a predetermined charge is made at that time. The placement calculation process is executed by decreasing the winning probability of execution or reducing the number of executions and the execution time.

  On the other hand, the game calculation unit 215 may use the calculation process described below instead of the above as the optimum arrangement calculation process.

Specifically, the game calculation unit 215
(1) Type of each player unit, attack power, attack range and arrangement position,
(2) Strategy data in the player (strategy for the player unit as a whole, for example, a strategy that focuses on attacks, a strategy that targets a specific combat unit, or a strategy that hardens defense), and
(3) Type of each battle unit, attack power, attack range and placement position,
To get.

  And the game calculating part 215 determines the optimal arrangement | positioning position of each battle | competition unit based on the information of (1)-(3), determines several arrangement | positioning candidates of the next point other than the said optimal arrangement | positioning position, The number of movements when the battle unit corresponding to the optimal arrangement position moves is specified.

  In particular, the game calculation unit 215 may determine the optimal number of movements such as whether the optimal arrangement position can be reached by one movement from the current arrangement position or whether the optimal arrangement position can be reached by two movements. Identify the number of moves that can be reached.

  At this time, if the number of movements is less than or equal to the predetermined number of times (for example, less than or equal to the number of battle units or player units), the game calculation unit 215 sets the placement position in each battle unit to the optimum placement position. Is greater than the predetermined number of times, the number of movements when the corresponding battle unit moves is specified for the next placement candidate as in the case of the optimum placement position.

Then, based on the number of movements, the game calculation unit 215 determines whether to set the position of the next-point placement candidate as the placement position or whether to set the position of another next-point placement candidate as the placement position. Note that the game calculation unit 215 repeatedly executes the above processing until a placement candidate whose number of movements is equal to or less than a predetermined number is detected.
To do.

  The movement processing unit 214 moves each wiring unit to a suitable square on the field based on the result of the arrangement position calculated by each battle unit.

(Display control related to optimal placement calculation processing)
The display control unit 213 performs an attack while each combat unit is moving according to the movement route and the mass position (including the movement route) calculated by the movement processing unit 214 based on the optimum arrangement calculation process. In the meantime, the movement and the attack are executed based on the movement path and the position of the cell calculated by the optimum arrangement edge calculation process (hereinafter referred to as “indicating that the optimum arrangement calculation process is being executed”). ) To the player.

Specifically, the display control unit 213 causes the touch panel 12 to display an image indicating that the optimal placement calculation process is being executed. However, in the present embodiment, instead of displaying an image indicating that the optimum placement calculation process is being executed as an image, the sound output unit 292 (speaker) may notify the fact by sound.

(Optimal placement calculation processing in other competitive games)
In the present embodiment, the battle game is described as a simulation game, but it can also be executed in other battle games. For example, when used in a game in which one or a plurality of player units such as a puzzle is moved to erase an enemy unit, the game calculation unit 215 efficiently maximizes the player unit as an optimal arrangement calculation process, for example. You may perform the process which determines arrangement | positioning in order to erase a limited battle | competition unit.

  Also, in the case of a battle game in which one unit is determined for each turn, such as shogi or othello, the game calculation unit 215 may use, for example, the shortest number of turns (number of turns) as the optimal placement calculation process. A process of determining the position (ie, first hand) of any unit to win in time may be performed.

[5] Operations in the present embodiment Next, operations of the movement control process and the attack control process in the player unit group executed by the terminal device 20 of the present embodiment will be described with reference to FIGS. FIG. 18 is a flowchart showing the movement control process and the attack control process in the player unit group executed by the terminal device 20 of the present embodiment. FIG. 19 is executed by the terminal device 20 of the present embodiment. It is a flowchart which shows the operation | movement of the movement control process and attack control process in a battle | competition unit group. Moreover, FIG. 20 is a flowchart which shows the operation | movement of the arrangement | positioning calculation process in the battle | competition unit group performed by the terminal device 20 of this embodiment.

  This operation is a process executed in the terminal device 20 in principle. However, some processes can be executed in conjunction with the server device 10.

  Further, in this operation, the player unit group or the battle unit group deck set in advance by the player or the computer and the player unit group movement and attack are preceded.

  Furthermore, in this operation, it is assumed that all player units and battle units are to be operated, and movement control processing is executed for each player unit and each battle unit. However, the turn period is set for each player unit group, and within the turn period, there is no need to move each player unit once, and there may be player units that do not move, or multiple times. There may be a player unit.

(Movement control process in player unit)
First, when the movement processing unit 214 detects the start of a turn of the player unit group (step S101), the movement processing unit 214 specifies an operation target player unit based on the operation of the player or according to a predetermined order (step S102).

  Next, the movement processing unit 214 performs a first position (movement start position) and a second position (movement end position) in the operation target player unit by a slide operation input to the operation target player unit by the operation detection processing unit 211. And a movement route is detected (step S103).

Next, the movement processing unit 214 moves the specified operation target player unit from the first position to the second position according to the detected first position, second position, and movement path, and for each square. The movement control process is started (step S104). For example, the movement processing unit 214 performs predetermined processing such as highlighting the specified operation target player unit or displaying a movement route.

  Next, the movement processing unit 214 advances the route target square by one from the first position or the previous position (step S105), and does another unit (other player unit or battle unit) exist in the route target mass? It is determined whether or not (step S106).

  At this time, if it is determined that there is no other unit in the route target cell, the movement processing unit 214 determines whether it is a movement end cell (step S110), and determines that it is not the movement end cell. In this case, the process returns to step S105, and when it is determined that the movement end cell is present, this operation is ended.

  On the other hand, when the movement processing unit 214 determines that another unit exists in the route target cell, the movement processing unit 214 executes the above-described interlocking movement control process based on the other unit (step S107) and step S110. Move on to processing.

  Next, the movement processing unit 214 determines whether or not there is a player unit that has not yet executed the movement control process as the operation target player unit (step S111), and the player unit that has not yet executed the movement control process. If there is, the process proceeds to step S102.

  On the other hand, when it is determined that there is no player unit that has not yet executed the movement control process (that is, when it is determined that the movement control process has been executed for all player units), the game calculation unit 215 Based on the second position of the player unit, the character characteristics and attack characteristics of the player unit, and the arrangement and character characteristics of other units, an attack control process for each player unit constituting the player unit group is executed. (Step S112).

  Next, the game calculation unit 215 determines whether or not the battle unit has been annihilated (step S113). If it is determined that the battle unit has been annihilated, a game end process is executed (step S114) and this operation is performed. Terminate.

  If the game calculation unit 215 determines that the battle unit is not completely destroyed, the game calculation unit 215 starts the movement control process in step S201 in the battle unit (step S115), and ends the operation.

(Movement control processing in the battle unit)
First, when the movement processing unit 214 detects the start of the turn of the battle unit group (step S200), the game calculation unit 215 performs the first calculation based on the first position (movement start position) in each target unit by the arrangement calculation process. 2 position (movement end position) and movement path are calculated (step S201). Details of the arrangement calculation processing will be described later with reference to FIG.

  Next, the movement processing unit 214 identifies the target unit calculated by automatic calculation in the game calculation unit 215 or the target unit in accordance with a predetermined order (step S202).

  Next, the movement processing unit 214 performs the second position (movement end position) and movement based on the first position (movement start position) in the identified battle unit based on the calculation result automatically calculated by the game calculation unit 215. A route is determined (step S203).

  Next, the movement processing unit 214 performs unit movement control to move the identified battle unit from the first position to the second position according to the detected first position, second position, and movement path, and for each cell. Processing is started (step S204). For example, the movement processing unit 214 performs predetermined processing such as highlighting the specified operation target player unit or displaying a movement route.

  Next, the movement processing unit 214 advances the route target square by one from the first position or the previous position (step S205), and whether another unit (player unit or other battle unit) exists in the route target mass. It is determined whether or not (step S206).

  At this time, if the movement processing unit 214 determines that there is no other unit on the route target cell, it determines whether or not it is a movement end cell (step S210), and determines that it is not the movement end cell. In this case, the process returns to the process of step S205, and when it is determined that the movement end cell is present, this operation is ended.

  On the other hand, if the movement processing unit 214 determines that another unit exists in the route target cell, the movement processing unit 214 executes the above-described interlocking movement control process based on the other unit (step S207). Move on to processing.

  Next, the movement processing unit 214 determines whether or not there is a battle unit that has not yet executed the movement control process (step S211). The process proceeds to S202.

  On the other hand, when it is determined that there is no battle unit that has not yet executed the movement control process (that is, when it is determined that the movement control process has been executed for all the battle units), the game calculation unit 215 Based on the second position of the battle unit, the character characteristics and attack characteristics of the battle unit, and the arrangement and character characteristics of other units, the attack control process for each battle unit constituting the battle unit group is executed. (Step S212).

  Next, the game calculation unit 215 determines whether or not the player unit has been annihilated (step S213). If it is determined that the player unit has been annihilated, a game end process is executed (step S214). Terminate.

  If the game calculation unit 215 determines that the player unit is not completely destroyed, the game control unit 215 starts the movement control process in step S101 in the player unit (step S215), and ends this operation.

(Arrangement calculation processing in the battle unit)
First, when the game calculation unit 215 detects the start of execution of the arrangement calculation process (step S301), the game calculation unit 215 executes the optimum arrangement calculation process according to the game situation such as the game level and experience value of the player, It is determined whether normal calculation processing is to be executed (step S302).

  For example, the game calculation unit 215 sets the probability of executing the optimal arrangement calculation process according to the game situation, executes the lottery according to the set probability, and wins the execution of the optimal arrangement calculation process. Determine if you have lost.

At this time, if the game calculation unit 215 determines to execute the optimal arrangement calculation process such as winning the execution of the optimal arrangement calculation process, the game calculation unit 215 executes the optimal arrangement calculation process (step S).
303), the process proceeds to step S305.

  The game calculation unit 215 is based on the unit characteristics (character characteristics, movement characteristics, and attack characteristics) of each battle unit, the field attribute of each square, the unit characteristics of each player unit, and its parameters. One of the above-described optimal arrangement calculation processes is executed, such as calculating the arrangement (movement path and movement end position) of each battle unit for maximizing the effect of winning the battle game.

  On the other hand, if the game calculation unit 215 determines that the normal calculation process is executed, such as having been elected to perform the optimal placement calculation process, the unit characteristics (character characteristics, movement characteristics, and attack characteristics) of the corresponding battle unit for each battle unit. The field is determined by calculating the placement (movement path and movement end position) of each battle unit based on the regional attributes of each square, the unit characteristics of each player unit and its parameters (step S304), The process proceeds to step S305.

  Next, the game calculation unit 215 stores the calculated movement path and movement end position in each battle unit in the main storage unit 271 (step S305), ends this operation, and shifts to the process of step S202 in FIG.

[6] Others The present invention is not limited to that described in the above embodiment, and various modifications can be made. For example, terms cited as broad or synonymous terms in the description in the specification or drawings can be replaced with broad or synonymous terms in other descriptions in the specification or drawings.

  Although this embodiment has been described as an operation input of an RPG game, it can also be used in other games such as a battle game or a simulation game.

  Further, in the present embodiment, each game may be provided to the terminal device 20 by one server device 10, or a server system is constructed by linking a plurality of server devices 10, and each game is provided to the terminal device 20. May be.

  In the present embodiment, the game provided by the server device 10 is executed by the terminal device 20, but each function and game program of the processing unit 200 of the terminal device 20 described above except for the operation detection processing unit 211. May be executed by the server device 10, and the terminal device 20 may realize the above-described game by executing an operation input and an image display by streaming.

  In the present embodiment, the terminal device of the present invention is applied to a game device. However, the present invention is not limited to the game device, and operation is performed using a touch panel such as a smartphone, a tablet information terminal device, a personal computer, a monitor, or a television. Any terminal device that can execute input can provide the terminal device of the present invention.

  Further, in the present embodiment, it is realized by using an operation means capable of performing a direction operation such as a game controller having a cross key, a keyboard having a trackball, or a joystick instead of the touch panel. Can do.

The present invention includes configurations that are substantially the same as the configurations described in the embodiments (for example, configurations that have the same functions, methods, and results, or configurations that have the same objects and effects). In addition, the invention includes a configuration in which a non-essential part of the configuration described in the embodiment is replaced. In addition, the present invention includes a configuration that exhibits the same operational effects as the configuration described in the embodiment or a configuration that can achieve the same object. In addition, the invention includes a configuration in which a known technique is added to the configuration described in the embodiment.

  As described above, the embodiments of the present invention have been described in detail. However, it will be easily understood by those skilled in the art that many modifications can be made without departing from the novel matters and effects of the present invention. . Accordingly, all such modifications are intended to be included in the scope of the present invention.

DESCRIPTION OF SYMBOLS 10 ... Server apparatus 20 ... Terminal apparatus 200 ... Processing part 101 ... Communication control part 102 ... Web processing part 103 ... Game operation execution part 104 ... Game management part 120 ... Input part 130 ... Display part 140 ... Storage part 142 ... Main memory part 144 ... Game information 146 ... User information
180 ... Information storage medium 196 ... Communication section 200 ... Processing section 210 ... Object space setting section 211 ... Operation detection processing section 212 ... Display control section 214 ... Movement processing section 215 ... Game calculation section 216 ... Virtual camera control section 217 ... Game management Section 220 ... Drawing section 230 ... Sound processing section 270 ... Storage section 271 ... Main storage section 272 ... Image buffer 273 ... Game data storage section 274 ... User information 260 ... Input section 262 ... Detection section 280 ... Information storage medium 290 ... Display section 291 ... Sound output section

Claims (10)

A program for advancing a battle game by arranging a plurality of units on a field composed of a plurality of cells,
Based on the operation of the player, the player unit, which is a player unit, is moved within the movable range on the field defined according to the movement characteristics of each player unit, and is arranged in a desired mass. A control process and a second movement control process for moving in a movable range on the field defined according to a movement characteristic of a battle unit that is a battle unit that battles with the player, and placing it in a predetermined square. Movement control means to execute, and
An arithmetic means for executing an arrangement calculation process for calculating a position of the predetermined mass when the first movement control process or the second movement control process is executed to arrange the battle unit on the predetermined mass;
Function as a computer
The computing means is
As the placement calculation processing, (1) placement of each player unit on the field,
(2) Arrangement of each battle unit, and
(3) any one of the units performing the attack or a combination thereof;
Based on at least one of the above, the optimal placement calculation processing for calculating the optimal mass position in the unit performing the attack on the field so as to exert the optimal attack effect on the attack target unit A program that controls whether or not it can be executed according to a game situation. The program according to claim 1,
The computing means is
As the placement calculation processing, a predetermined unit in which the one or more attacks are performed is predetermined based on the arrangement of the attack target units on the field and the movement characteristics of the units that perform the one or more attacks. Execute normal placement calculation processing to calculate the position of the square to achieve the effect,
A program for selectively executing one of the optimum arrangement calculation process and the normal arrangement calculation process according to the game situation. In the program according to claim 1 or 2,
The computing means is
When the game situation is composed of a capability difference between the player unit and the battle unit, or a player unit group including one or more player units and a battle unit group including one or more battle units. A program for changing the execution probability of the optimal placement calculation process according to the difference in ability. In the program according to claim 1 or 2,
The computing means is
A program for changing an execution probability of the optimum arrangement calculation process according to a game level of the player. In the program according to any one of claims 1 to 4,
Based on the positions of the squares of the units arranged, a player unit group including one or more player units and a battle unit group including one or more battle units are mutually connected based on the arrangement of the squares. Further causing the computer to function as attack control means for executing attack control processing to attack
The computing means is
A program for executing the optimum arrangement calculation processing for calculating an optimum mass position in a unit that performs the attack or a unit group including the unit that performs the attack is maximized. . The program according to claim 5,
The attack control means
A program for executing an attack control process in which the player unit group and the battle unit group attack each other based on the arrangement of the respective cells and the attack capability based on the attack capability set for each unit. In the program according to any one of claims 1 to 6,
A program for causing the computer to further function as notification control means for notifying a player of the calculation when the position of a cell where the unit that performs the attack is arranged is calculated based on the optimum arrangement calculation process . In the program according to any one of claims 1 to 6,
When the arrangement position of the player unit that performs the attack is automatically calculated by the calculation means, the computer further functions as a notification control means for notifying the player that the attack is automatically calculated. Let the program. In the program according to any one of claims 1 to 7,
The control of whether or not to execute the optimal placement calculation process includes control of at least one of the execution probability, the number of executions, the execution time, and the execution timing of the optimal placement calculation process executed during the battle game. program. A game device that advances a battle game by arranging a plurality of units on a field composed of a plurality of cells,
Based on the operation of the player, the player unit, which is a player unit, is moved within the movable range on the field defined according to the movement characteristics of each player unit, and is arranged in a desired mass. A control process and a second movement control process for moving in a movable range on the field defined according to a movement characteristic of a battle unit that is a battle unit that battles with the player, and placing it in a predetermined square. Movement control means to execute, and
An arithmetic means for executing an arrangement calculation process for calculating a position of the predetermined mass when the first movement control process or the second movement control process is executed to arrange the battle unit on the predetermined mass;
With
The computing means is
As the placement calculation processing, (1) placement of each player unit on the field,
(2) Arrangement of each battle unit, and
(3) any one of the units performing the attack or a combination thereof;
Based on at least one of the above, the optimal placement calculation processing for calculating the optimal mass position in the unit performing the attack on the field so as to exert the optimal attack effect on the attack target unit A game device that controls whether or not execution is possible according to a game situation.

Images