JP2015083111A - Server, program, and method for providing interactive game - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide interactive games that use characters moving on routes and require more strategies.SOLUTION: A server according to an embodiment is configured to execute an interactive-game program including: a game progress module; a screen display module for displaying a game screen; a first placement module for placing characters selected by individual players on routes before a predetermined starting condition is satisfied; a movement module for moving the characters toward bases of an opponent after the predetermined starting condition is satisfied; a second placement module for placing the characters selected by the players on the routes after the predetermined starting condition is satisfied; a battle process module for performing a predetermined battle process when a distance between the characters falls within a predetermined range; an occupation process module for performing predetermined occupation process; and a determination module for determining a result of the interactive game.

Description

  More particularly, the present invention relates to a server, a program, and a method for providing a battle game between a first player and a second player by executing a predetermined program. About.

  Conventionally, a tower whose goal is to prevent an enemy character from moving to a goal point by placing an object such as a weapon on the route against an enemy character moving on the route from the start point to the goal point A defense game is known (see, for example, Patent Document 1 (paragraph 0088)). There is also known a tower offense game in which a teammate character is moved from a start point to a goal point and a game target is to move to a goal point while defeating an enemy character or the like existing on the route.

JP 2011-036510 A

  However, in such a game, since the player performs only one of defense or offense, the progress of the game tends to be monotonous and it cannot be said that the game requires a sufficient strategy. Therefore, it is desired to provide a game that requires a higher strategy in a battle-type game using characters that move on such a route.

  An object of the embodiment of the present invention is to provide a game that requires more strategy in a battle game using a character that moves on a route. Other objects of the present invention will become apparent by referring to the entire specification.

A server according to an embodiment of the present invention is a server that provides a battle game between a first player and a second player by executing a predetermined program, and one or more of executing the predetermined program And the predetermined program includes a game screen including at least a part of a route area having a plurality of routes in which bases of the players of the first player and the second player are respectively set. A screen display module configured to be displayed on the display device of each player in accordance with the progress of the battle game, and a plurality of characters that can be selected by each player before a predetermined start condition is satisfied. The one or more characters selected by each player from among the plurality of paths are sent by each player. A first placement module configured to be placed on one or a plurality of routes selected in the above and the character placed on the route along the route after the predetermined start condition is satisfied A movement module configured to move the opponent to the base and a plurality of characters that can be selected by each player after the predetermined start condition is satisfied. A second placement module configured to place one or more characters on one or more routes selected by each player from the plurality of routes; and a character of the first player; When the distance on the route with the character of the second player falls within a predetermined range, a predetermined battle process is performed, and the predetermined battle It is configured to continue the movement of the character that has become a logical winner to the base of the opponent and to stop the movement of the character that has become a loser of the predetermined battle process to the base of the opponent A battle processing module; and a determination module configured to determine a result of the battle game based at least on the fact that the character has reached the base of the opponent. Here, the “character” may include various electronic elements, objects, contents, and the like used in the battle game.

  As is clear from this description, the server according to the embodiment of the present invention causes the first player and the second player to execute one or more computer processors by executing these and the modules described below. A game screen including at least a part of a route area having a plurality of routes each of which a player's base is set is displayed on a display device of each player as the battle game progresses. The screen display unit is configured to select one or more characters selected by each player from among the plurality of characters that can be selected by each player before the predetermined start condition is satisfied. A first placement unit configured to be placed on one or more routes selected by each player; A moving unit configured to move the character arranged on the route to the base of the opponent along the route after the start condition is satisfied, after the predetermined start condition is satisfied The one or more characters selected by each player from the plurality of characters that can be selected by each player are placed on one or more routes selected by each player from the plurality of routes. A second arrangement unit configured to be arranged, and a predetermined battle process is performed when a distance on the route between the character of the first player and the character of the second player falls within a predetermined range. And the movement of the character that has become the winner of the predetermined battle process to the opponent's base is continued and the predetermined battle process Configured fight processing unit so as to stop the movement to the opponent of bases of the character that becomes a loser, and can function as a unit for performing the process described herein other than those.

  A program according to an embodiment of the present invention is a program that causes one or a plurality of computers to function as a system that provides a battle game between a first player and a second player, the first player and the A game screen including at least a part of a route area having a plurality of routes each of which a base of each player of the second player is set is displayed on the display device of each player according to the progress of the battle game. The configured screen display module and one or more characters selected by each player from among a plurality of characters that can be selected by each player before a predetermined start condition is established, A first placement module configured to be placed on one or a plurality of routes selected by each player from among the first placement modules And a movement module configured to move the character arranged on the route to the base of the opponent along the route after the predetermined start condition is established, After the start condition is satisfied, one or more characters selected by each player from among a plurality of characters that can be selected by each player are selected by each player from the plurality of paths. Alternatively, the distance between the second placement module configured to be placed on a plurality of routes and the character of the first player and the character of the second player on the route is within a predetermined range. Sometimes when a predetermined battle process is performed and the movement of the character that has become the winner of the predetermined battle process is continued to the base of the opponent A battle processing module configured to stop the movement of the character that has become a loser of the predetermined battle process to the opponent's base, and at least based on the fact that the character has reached the opponent's base And a determination module configured to determine a result of the battle game.

A method according to an embodiment of the present invention is a method for providing a battle game between a first player and a second player by one or a plurality of computers, wherein the first player and the second player are provided. A game screen including at least a part of a route area having a plurality of routes each having a base of each player is displayed on the display device of each player according to the progress of the battle game, and a predetermined start condition is One or more characters selected by each player from among a plurality of characters that can be selected by each player before the establishment, and one or more characters selected by each player from among the plurality of paths After the predetermined start condition is satisfied, the character placed on the route is placed along the route with the opponent. After moving to the base and satisfying the predetermined start condition, one or more characters selected by each player from among a plurality of characters that can be selected by each player are sent along the plurality of routes. When the distance between the first player character and the second player character on the path is within a predetermined range, when the distance between the first player character and the second player character is within a predetermined range. The predetermined opponent process is performed to continue the movement of the character that has become the winner of the predetermined opponent process to the base of the opponent and the opponent of the character who has become the loser of the predetermined opponent process. The movement of the battle game is canceled based on at least that the character has reached the opponent's base. A constant.

  According to various embodiments of the present invention, it is possible to provide a game that requires more strategy in a battle game using a character that moves on a route.

The block diagram which shows the structure of the system containing the server which concerns on one Embodiment of this invention. The block diagram which shows the structure of the program which concerns on one Embodiment of this invention. The figure which shows an example of the data item managed by the character management table in one Embodiment. The figure which shows an example of the data item managed by the base management table in one Embodiment. The flowchart which shows an example of the game process in one Embodiment. The figure which shows an example of the screen 60 for games in one Embodiment. The figure which shows an example of the screen 60 for games in one Embodiment. The figure which shows an example of the screen 60 for games in one Embodiment. The figure which shows an example of the screen 60 for games in one Embodiment. The figure which shows an example of the screen 60 for games in one Embodiment. The figure which shows an example of the screen 60 for games in one Embodiment. The figure which shows an example of the screen 60 for games in one Embodiment.

  FIG. 1 is a block diagram schematically showing a configuration of a system 1 including a server 10 according to an embodiment of the present invention. As shown in FIG. 1, the server 10 in one embodiment is connected to a terminal device 30 configured as a general computer via a communication network 20 such as the Internet so as to be able to operate the terminal device 30. Various games can be provided to the user. Note that a terminal device (not shown) other than the terminal device 30 is connected to the server 10 so as to be communicable. In addition, the server 10 can provide various digital contents other than games to the user who operates the terminal device 30, can provide various Internet services other than the provision of digital contents, and more It is possible to provide a platform service that realizes various communications among a plurality of users who operate the terminal device 30.

As illustrated, the server 10 includes a CPU (computer processor) 11, a main memory 12, a user I / F 13, a communication I / F 14, an external memory 15, and a disk drive 16. Are electrically connected to each other via a bus 17. The CPU 11 loads various programs such as a control program for controlling the progress of the operating system and the online game from the external memory 15 to the main memory 12 and executes instructions included in the loaded program. The main memory 12 is used for storing a program executed by the CPU 11, and is constituted by, for example, a DRAM.

  The user I / F 13 includes, for example, an information input device such as a keyboard and a mouse that accepts an operator input, and an information output device such as a liquid crystal display that outputs a calculation result of the CPU 11. The communication I / F 14 is implemented as hardware, firmware, communication software such as a TCP / IP driver or a PPP driver, or a combination thereof, and is configured to be able to communicate with the terminal device 30 via the communication network 20.

  The external memory 15 is composed of, for example, a magnetic disk drive, and stores various programs such as a control program for controlling the progress of the online game. The external memory 15 can also store various data used in the game. Various data that can be stored in the external memory 15 may be stored in a database server that is physically separate from the server 10 that is communicably connected to the server 10. The disk drive 16 reads data stored in various storage media such as CD-ROM, DVD-ROM, and DVD-R, or writes data to these storage media. For example, data such as game applications and game data stored in the storage medium is read by the disk drive 16 and installed in the external memory 15.

  In one embodiment, the server 10 is a web server that manages a website composed of a plurality of web pages having a hierarchical structure, and can provide a game service to the terminal device 30. The terminal device 30 can acquire HTML data for displaying a web page from the server 10, analyze the acquired HTML data, and present the web page to the user (game player) of the terminal device 30. . A game provided through such a web page may be referred to as a browser game. The external memory 15 also stores HTML data for displaying this web page. The HTML data is composed of an HTML document described in a markup language such as HTML, and various images are associated with the HTML document. A program written in a script language such as ActionScript or Javascript (registered trademark) can be embedded in the HTML document.

The external memory 15 can also store game applications that are executed on the terminal device 30 in an execution environment other than browser software. The game application can include various data such as a game program for executing the game and image data referred to when the game program is executed. The game program is created in an object-oriented programming language such as Objective-C or Java (registered trademark). The created game program is stored in the external memory 15 as application software together with various data. The application software stored in the external memory 15 is distributed to the terminal device 30 in response to the distribution request. The application software distributed from the server 10 is received by the terminal device 30 via the communication I / F 34 under the control of the CPU 31, and the received game program is transmitted and stored in the external memory 35. This application software is activated in response to an operation of the terminal device 30 by the user, and is executed on a platform such as NgCore (trademark) or Android (trademark) installed in the terminal device 30. The server 10 provides various data necessary for the progress of the game to the game application executed on the terminal device 30.
Moreover, the server 10 can manage the progress of the game for each user by storing various data transmitted from the terminal device 30 for each user.

  As described above, the server 10 can progress the game by managing the website that provides the game service and distributing the web pages that constitute the website in response to a request from the terminal device 30. Further, the server 10 can advance the game based on communication with a game application executed on the terminal device 30 in place of or in addition to the browser game. The server 10 can store data necessary for the progress of the game for each piece of identification information for identifying each user, regardless of the manner in which the game is provided. Although detailed description is omitted, the server 10 can also have a function of performing user authentication processing at the start of the game and billing processing that occurs in accordance with the progress of the game. The games provided by the server 10 include arbitrary games such as a simulation game, an action game, a role playing game, a sports battle game, and a card game. The types of games realized by the website of the server 10 or the game application are not limited to those specified in this specification.

  In one embodiment, the terminal device 30 is an arbitrary information processing device that displays a web page of a game website acquired from the server 10 on a web browser and implements an application execution environment for executing a game application. Smartphones, tablet terminals, game-dedicated terminals, and the like may be included.

  As illustrated, the terminal device 30 includes a CPU (computer processor) 31, a main memory 32, a user I / F 33, a communication I / F 34, and an external memory 35, and each of these components is a bus 36. Are electrically connected to each other.

  The CPU 31 loads various programs such as an operating system from the external memory 35 to the main memory 32 and executes instructions included in the loaded program. The main memory 32 is used for storing a program executed by the CPU 31, and is constituted by, for example, a DRAM.

  The user I / F 33 is an information input device that accepts user input and an information output device that outputs the calculation result of the CPU 31, and includes a display device such as a liquid crystal display including a touch panel.

  The communication I / F 34 is implemented as hardware, firmware, communication software such as a TCP / IP driver or a PPP driver, or a combination thereof, and is configured to be able to communicate with the server 10 via the communication network 20.

  The external memory 35 is configured by, for example, a magnetic disk drive, a flash memory, or the like, and stores various programs such as an operating system. Further, when a game application is received from the server 10 via the communication I / F 34, the external memory 35 stores the received game application.

The terminal device 30 having such an architecture includes, for example, browser software for interpreting an HTML format file (HTML data) and displaying it on the screen, and HTML data acquired from the server 10 by the function of the browser software. And a web page corresponding to the received HTML data can be displayed. Further, the terminal device 30 includes plug-in software (for example, Flash Player provided by Adobe Systems) incorporated in browser software, and acquires a SWF format file embedded in HTML data from the server 10. The SWF format file can be executed using browser software and plug-in software.

  When the game is executed on the terminal device 30, for example, an animation or an operation icon specified by the program is displayed on the screen of the terminal device 30. The user can input an instruction for progressing the game using the input interface of the terminal device 30. An instruction input from the user is transmitted to the server 10 through a browser function of the terminal device 30 or a platform function such as NgCore (trademark).

  Next, the battle game program 50 executed by the CPU 11 of the server 10 according to the embodiment will be described. The battle game program 50 is stored in the external memory 15 or the like, and among the various games that can be provided by the server 10, a battle in which the first player and the second player battle each other using a character that moves on the route. It is executed when a game is provided. FIG. 2 is a block diagram showing the configuration of the competitive game program 50 in one embodiment. As shown in the figure, the battle game program 50 is set with a game progress module 51 configured to control the progress of the entire battle game, and a base of each player of the first player and the second player. A screen display module configured to display a game screen including at least a part of a route area having a plurality of routes on a display device (user I / F 33 of the terminal device 30) of each player as the battle game progresses. 52, one or more characters selected by each player from among a plurality of characters that can be selected by each player before the predetermined start condition is satisfied, by each player from the plurality of paths. A first placement module 53 configured to be placed on one or more selected paths and a predetermined start condition. After that, the moving module 54 configured to move the character arranged on the route to the opponent's base along the route, and each player can select after a predetermined start condition is established. A second character configured to arrange one or more characters selected by each player from among a plurality of characters on one or more routes selected by each player from a plurality of routes. When the distance between the placement module 55 of the first player character and the second player character on the path is within a predetermined range, a predetermined battle process is performed, and the winner of the predetermined battle process is determined. The character that has become the opponent's movement to the opponent's base is continued and the character who became the loser of the predetermined battle processing is moved to the opponent's base. A battle processing module 56 configured to stop movement, an occupation processing module 57 configured to perform a predetermined occupation process for occupying the base by the character that has reached the base of the opponent, A determination module 58 configured to determine the result of the battle game based at least on the fact that the character that has reached the base has occupied the base. By causing the battle game program 50 to be executed by the CPU 11, the server 10 according to the embodiment can function as a unit or a unit corresponding to the function of each module included in the battle game program 50.

3 and 4 are diagrams illustrating examples of information managed by the character management table and the base management table respectively configured in the external memory 15 of the server 10. As shown in FIG. 3, the character management table in one embodiment includes a “game field ID” for identifying a game field that is a field (stage) in which a battle game is performed, a “player ID” for identifying a player, and the game. The character's “HP” (hit point), the character's “cost”, and the character's attribute (kind) are shown in association with a combination of “character ID” that identifies the character that can be selected by the player in the field. “Character attribute”, “Attack power” of this character, “Attack range” indicating the range of attack (range of attackable distance) when this character attacks the opponent's character, Information such as “movement force” indicating movement speed) is managed. Here, “HP” is a parameter that is set with a predetermined initial value when starting a battle game, and increases or decreases as the battle game starts. In addition, in one embodiment, “cost” is a parameter for limiting the number of characters that can be arranged on the path in one battle game, and will be described in detail later. The “character attribute” is specifically set to a value indicating, for example, “merchant”, “cavalry”, “archer”, “infant”, “rescue soldier”, etc. At least some of the parameters such as “HP”, “Cost”, “Attack Power”, “Attack Range” and “Mobility” are set according to this “character attribute” (for example, “ “Mobility” of “Cavalry” is set to be superior (movable faster) compared to “Infantry”, and “Attack range” of “Army” is superior to “Merchant” (Value is set (can be attacked from a greater distance)). In one embodiment, the characters that can be selected by each player are set in advance for each game field. Characters that can be selected by the player are not set for each game field, and the characters acquired and held by the player by purchase or lottery (gash) or the like are managed for each player. It may be used as a selectable character.

  As shown in FIG. 4, the base management table according to the embodiment includes a “game field ID” for identifying a game field, a “player ID” for identifying a player, and a “base” for identifying the player's base in the game field. In association with the combination of “ID”, information such as “HP” (hit point) of this base, “defense power” of this base, and the like are managed. Here, “HP” is a parameter that is set with a predetermined initial value when starting a battle game, and increases or decreases as the battle game starts.

  Next, the operation of the server 10 in the embodiment configured as described above will be described. FIG. 5 is a flowchart illustrating an example of the game process executed by the server 10 in one embodiment when starting the above-described battle game using a character moving on a route. Specifically, for example, the battle game accepts participation entries in the battle game from a plurality of players via a web page that provides the battle game, and battles among the plurality of players that have accepted the participation entries. The combination of one player and the second player is specified by a predetermined rule and notified to each player, and is started when the first player and the second player are instructed to start a battle game. Here, a plurality of game fields having different difficulty levels may be set as the game field of the battle game, and the player may designate the difficulty level of the game field at the time of entry to the battle game. In this way, for example, it is possible to realize a battle game between players having a desired difficulty level. In addition, at least one of the first player and the second player who fight each other can be a player operated by the computer (server 10).

Here, the outline | summary of the competitive game provided by the server 10 in one Embodiment is demonstrated. In the battle game according to one embodiment, the bases of the respective players are set at both ends of a plurality of straight paths, and the characters placed on the paths are moved from their bases to the opponent's bases to thereby change the opponent's base. The basic game goal is to occupy the base. Characters placed on the path move along a straight path and cannot be moved to other paths. FIG. 6 is an example of a game screen 60 for providing a battle game to be displayed on the terminal device 30 by the server 10 executing the screen display module 52. The game screen 60 in one embodiment displays a route display unit that displays at least a part of a route region having a plurality of routes 64a to 64e (hereinafter, collectively referred to as routes 64), as shown in the figure. 62, a character display unit 66 that displays a list of characters that can be selected by the player at the left end of the screen, and a progress status display unit 68 that displays the progress status of the game at the lower end of the screen. A game screen 60 shown in FIG. 6 is a screen displayed on the terminal device 30 of one player when starting the battle game, and the player's own base 65 operating the terminal device 30 is displayed on the route display unit 62. A part of the route area is displayed so that only the player's base 65 is not displayed. In this example, the bases 6 are provided at both ends of the linear path 64 extending in the left-right direction.
However, the bases 65 may be set at both ends of the linear path 64 extending in the vertical direction. The character display unit 66 displays a list of icon images and various information (for example, parameters such as “attack power” managed by the character management table) corresponding to the character as information on the character. As shown in the drawing, the progress status display unit 68 displays information such as the occupation status of each player's base 65 (displayed in a circle in FIG. 6) and the remaining time of the battle game as the progress status of the game. .

  Returning to the flowchart of FIG. 5, in the game process, first, as shown in the figure, the character selected by each player is placed on the selected route (step S100). This step is performed by the server 10 executing the first placement module 53. Specifically, the player selects a desired character from a plurality of selectable characters displayed on the character display unit 66 of the game screen 60 illustrated in FIG. When the player selects a desired route 64 from among the plurality of routes 64, the selected character is placed at his / her base 65 in the selected route 64. In one embodiment, a time limit and a minimum number of arrangements are set for the arrangement of characters in step S100. That is, each player is required to place a character having a minimum arrangement number (for example, 3) or more on any path (base 65) within a time limit (for example, 30 seconds). Here, the time limit and / or the minimum arrangement number may be set to different values for each game field. FIG. 7 is an example of the game screen 60 in which characters are arranged at the base 65 according to the selection by the player. In this example, among the plurality of characters that can be selected by the player, the character “Ac1” is disposed at the base “Ab1”, the character “Ac3” is disposed at the base “Ab3”, and the character “Ac6” is illustrated. Is located at the base “Ab5”. Further, as shown in the figure, the character display unit 66 is in a display mode (for example, a display mode in which the arranged character is grayed out) so that the player can recognize the character placed on the route. As described above, when starting the battle game, the player's base 65 is not displayed on the route display unit 62 of the game screen 60, so that each player places the character on the route by the opponent. While predicting, it is necessary to arrange the minimum number of characters to be placed at the base 65 within the time limit. Here, in one embodiment, the server 10 automatically causes the minimum arrangement number of characters to be arranged when characters exceeding the minimum arrangement number are not arranged when the above-described time limit has elapsed. The selected character (with the predetermined rule) is also automatically placed on the selected path (with the predetermined rule).

When a predetermined start condition is satisfied (step S102), next, the movement of the character placed on the path (step S104), the further placement of the character (step S106), and the battle process between characters (step S108) ) And the occupation process of the base by the character (step S110) is repeatedly executed until a predetermined end condition is satisfied (step S112). Here, in the flowchart of FIG. 5, for the sake of convenience, the steps from Step S104 to Step S110 are illustrated in succession, but these steps are executed substantially in parallel. The predetermined start condition includes, in one embodiment, the elapse of the time limit for arranging the characters described above, and the determination of the arrangement of characters equal to or greater than the minimum arrangement number by each player. That is, when the time limit for arranging characters has elapsed, or when the arrangement of characters equal to or larger than the minimum arrangement number is determined by each player, steps S104 to S110 are repeatedly executed. Here, as described above, when starting the battle game, the route display unit 62 of the game screen 60 does not display the opponent's base 65, but after the predetermined start condition is satisfied (ie, step A portion including the opponent's base 65 in the route area in response to a request from the player (for example, in response to a flick operation on the game screen 60) while each step of S104 to S110 is repeatedly executed. Is displayed on the route display unit 62. FIG. 8 is an example of the game screen 60 in which a portion including the opponent base 65 in the route area is displayed on the route display unit 62. As shown in the drawing, by displaying a portion including the opponent's base 65, the player can confirm the arrangement of characters by the opponent. Here, when a predetermined start condition is satisfied, regardless of whether there is a request from the player, the route display unit 62 of the game screen 60 displays a portion including the opponent base 65 in the route region, The player may be prompted to confirm the arrangement of characters by the opponent.

  The movement of the character arranged on the route (step S104) is performed by the server 10 executing the movement module 54. Specifically, the character is moved to the opponent's base 65 at a moving speed according to the “moving force” of the character.

  Character placement (step S106) is performed by the server 10 executing the second placement module 55. Specifically, the player selects a desired character from a plurality of selectable characters displayed on the character display unit 66 of the game screen 60 in the same manner as the character arrangement in step S100 described above. When the player selects a desired route 64 from among the plurality of routes 64 displayed on the route display unit 62, the selected character is placed at his / her base 65 in the selected route 64.

  Here, in one embodiment, as described above, the number of characters that can be placed on the path in one battle game is limited based on the “cost” set for the character. Specifically, the total “cost” of the characters placed on the route in one battle game is limited by a predetermined upper limit value, and if this upper limit value is exceeded (the predetermined stop condition is satisfied) In some cases) no further placement of the character is allowed. For example, a character that can be placed if only a character with high ability is placed by setting a large value for “cost” of a character with high ability (for example, “attack power”, “range attack range” or “movement power”). Therefore, the player needs to arrange characters in consideration of the “cost” set for the character, and the strategy of the battle game can be further improved. Here, the upper limit value may be set to a different value for each game field. For example, when a different number of routes and “HP” of the base 65 are set for each game field, the game field has a large number of routes (ie, a large number of bases) or a large “HP” of the base 65. As the number of characters tends to be increased, the upper limit of the total “cost” is preferably set larger.

The battle process between characters (step S108) is performed by the server 10 executing the battle process module 56 when the distance on the path between characters is within a predetermined range. Specifically, as a result of the movement of the characters arranged on the path, when the distance between the characters on the path reaches the “attack range” of at least one character, the battle process between these characters is performed. (For example, the character “Ac6” and the character “Bc4” in the path 64e in FIG. 9). The battle process can be performed by applying various rules for determining winners and losers. For example, a rule based on parameters set for each character can be applied. More specifically, for example, the damage to the opponent's character is calculated based on the “attack power” set for each character (for example, the damage tends to increase as the character ’s “attack power” increases). The process of subtracting the calculated damage from the “HP” of the opponent character is repeated alternately between the characters, and when the “HP” of one character becomes zero, this “HP” It is possible to apply a rule that determines a character with a zero as a loser and determines the other character as a winner. A rule that considers the combination of “character attributes” between characters can also be applied. For example, when the “character attribute” is a combination of “merchant” and “cavalry”, the above-described damage is calculated so that “merchant” is more advantageous (for example, “merchant” is “ For example, the damage when attacking a cavalry may be doubled as usual). In this way, the player can advantageously advance the battle game by placing characters having “character attributes” advantageous to the opponent's character on the same route, and the strategy of the battle game can be improved. It can be improved further. Here, in one embodiment, when the distance on the path between characters is the “attack range” of one character but not the “attack range” of the other character, the “attack range” is Only an attack by a character is performed in advance, and thereafter (for example, after a predetermined time has elapsed or after a predetermined number of attacks have been performed), an attack is performed alternately between characters.

  Here, in one embodiment, the character that is the winner of such battle processing continues to move to the opponent's base 65, and the loser character moves (returns) to its own base 65. (For example, the character “Ac6” in the path 64e in FIG. 10). The movement of the lost character to his / her base 65 is performed by the server 10 executing the movement module 54. In one embodiment, when a character who has lost the battle process reaches his base 65, the character can be selected by the player and placed again on the route. Here, after “HP” recovers after a lapse of a predetermined time after the loser's character reaches his base 65, the character may be placed on the path again.

  In the base occupation process (step S110) by the character, the server 10 executes the occupation process module 57 when the character reaches the opponent base 65 (for example, the character “Bc4” in the path 64e in FIG. 11). Is done by. The occupation process can be performed by applying various rules for determining the occupation of the base 65 by the character. For example, a rule based on parameters set for each character and each base 65 can be applied. More specifically, for example, the damage to the base 65 is calculated based on the “attack power” set for each character and the “defense power” set for each base 65 (for example, the “attack power of the character ”And the smaller the“ defense power ”of the base 65 is, the more damage is calculated), and the process of subtracting the calculated damage from the“ HP ”of the base 65 is repeatedly performed. A rule for determining that the base 65 has been occupied can be applied when the “HP” of the system becomes zero. Here, in one embodiment, the character determined to have occupied the base 65 by the occupation process stays at the base 65 (parked) and cannot be placed on the route again. Instead, a character other than the character that occupied the base 65 may be stationed according to the player's selection. Further, even when the own base 65 is occupied by the opponent character, it is possible to cause a battle process with the character to be stationed by newly arranging the character at the base 65. .

Thus, the movement of the character arranged on the route (step S104), the further character arrangement (step S106), the battle process between characters (step S108), and the base occupation process by the character (step S110) ) Is repeatedly executed, the battle game proceeds. In the period in which the battle game progresses, each player checks the opponent's character placed on the route, and the opponent's character's “character attribute”, “attack power”, “range attack range” and Considering “moving force” and the like, the player places his character on the path. For example, in consideration of a combination of “character attributes” between characters, each player has placed a character that is advantageous for battle processing on the same route, or has a relatively high-capacity opponent character. The occupation of the route base 65 is abandoned, and the player's own character is concentrated on the route on which the opponent character with relatively low ability is placed. FIG. 12 shows an example of the game screen 60 when the battle game progresses and several bases 65 are occupied by characters. As shown in the figure, the progress status display unit 68 of the game screen 60 displays the occupied number of the bases of the player and the opponent because the base 65 is occupied by the character (in this example, the occupied base 65 is displayed). (Shown as a circle filled with black).

  When a predetermined end condition is satisfied (step S112), the game result is determined (step S114), and the game process is ended. As the predetermined end condition, for example, a predetermined game time (for example, 15 minutes) elapses and / or a predetermined number (for example, a majority) of the opponent's bases 65 by one player. Can occupy the base 65 of the site. The determination of the game result is performed by the server 10 executing the determination module 58, and can be performed by applying various rules for determining the winner and loser of the battle game. For example, the player who previously occupied a predetermined number of the bases 65 of the opponent is the winner, the player who has a large number of occupied bases 65 at the end of the game is the winner, A rule or the like in which a player having a large total of “HP” at the base 65 of the base 65 is a winner can be applied. Here, you may make it give the right to play a battle | competition game in the game field with a higher difficulty level with respect to the player who became the winner.

  In the battle game provided by the server 10 in the above-described embodiment, the character moving to the opponent's base 65 is moved (withdrawn) to the own base 65 in response to a request from the player. You can also. By doing so, it becomes necessary to determine the withdrawal of the character in accordance with the placement of the character by the opponent on the same route and the occupation situation of the base 65, so that the strategy of the battle game can be further improved. Moreover, you may make it activate the special skill for advancing a competitive game advantageously by using various items and a special character. As a special skill, the skill etc. which recover "HP" of a character or the base 65 can be illustrated, for example. Further, the number of times the skill is activated may be limited. By doing so, it is necessary to consider the timing of activating skills, etc., so that the strategy of the battle game can be further improved. In addition, the number of characters that one player can simultaneously arrange on the same route may be limited to one, or a plurality of characters may be arranged without limitation.

  In the server 10 according to the embodiment described above, the character is arranged on the route according to the selection by each player before the predetermined start condition is satisfied, and is arranged on the route after the predetermined start condition is satisfied. The character is moved to the opponent's base, and the character is placed on the route according to the selection by each player, and the battle process is performed when the distance between the characters on the route is within a predetermined range. The character that has won the battle process continues to move to the opponent's base, and the character that has become the loser stops moving to the opponent's base so that the character has reached the opponent's base. The result of the battle game is determined based on at least. Therefore, it is possible to provide a battle game that includes both an offense game element that allows the player's character to reach the opponent's base and a defense game element that prevents the opponent's character from reaching the base. it can. In addition, since the character can be placed on the path before and after the predetermined start condition is established, the placement of the character before the character starts moving and the battle game after the character starts moving The player needs to consider both the arrangement of characters according to the progress (the situation of the battle process and the situation of the occupation process), and as a result, more strategy is required in the battle game using the character moving on the path. Can be provided games.

  Further, in the competitive game provided by the server 10 in one embodiment, the time limit and the minimum number of arrangements are set for the character arrangement before the predetermined start condition is satisfied, so that the player can minimize the time within the time limit. It is necessary to arrange more characters than the number of arranged characters, and characters placed on the path cannot be moved to other paths, so that the player can feel a thrilling game.

  The processes and procedures described in this specification are implemented by software, hardware, or any combination thereof other than those explicitly described in the embodiments. More specifically, the processes and procedures described in this specification are performed by mounting logic corresponding to the processes on a medium such as an integrated circuit, a volatile memory, a nonvolatile memory, a magnetic disk, or an optical storage. Realized. Further, the processes and procedures described in this specification can be implemented as a computer program and executed by various computers.

  Even if the processes and procedures described herein are described as being performed by a single device, software, component, or module, such processes or procedures may be performed by multiple devices, multiple software, multiple Component and / or multiple modules. In addition, even though the data, tables, or databases described herein are described as being stored in a single memory, such data, tables, or databases are provided on a single device. Alternatively, the data can be distributed and stored in a plurality of memories or a plurality of memories arranged in a plurality of devices. Further, the software and hardware elements described herein may be implemented by integrating them into fewer components or by decomposing them into more components.

  In the present specification, when the constituent elements of the invention are described as one or a plurality, or when they are described without being limited to one or a plurality of cases, they should be understood separately in context. The component may be either singular or plural.

DESCRIPTION OF SYMBOLS 1 System 10 Server 20 Communication network 30 Terminal device 50 Game for battle game 51 Game progress module 52 Screen display module 53 First arrangement module 54 Movement module 55 Second arrangement module 56 Battle processing module 57 Occupation processing module 58 Judgment module 60 Game screen 64 routes

Claims (13)

A server that provides a battle game between a first player and a second player by executing a predetermined program,
Comprising one or more computer processors for executing the predetermined program;
The predetermined program is
A game screen including at least a part of a route area having a plurality of routes in which the bases of the first player and the second player are respectively set is displayed according to the progress of the battle game. A screen display module configured to be displayed on a display device;
Before a predetermined start condition is satisfied, one or more characters selected by each player from among a plurality of characters that can be selected by each player are selected by each player from the plurality of paths. A first placement module configured to be placed on one or more of the configured paths;
A movement module configured to move the character arranged on the route to the base of the opponent along the route after the predetermined start condition is satisfied;
After the predetermined start condition is satisfied, one or more characters selected by each player from among a plurality of characters that can be selected by each player are selected by each player from the plurality of paths. A second placement module configured to be placed on one or more of the configured paths;
A predetermined battle process was performed when the distance between the first player character and the second player character on the route was within a predetermined range, and the winner of the predetermined battle process was obtained. A battle processing module configured to continue the movement of the character to the opponent's base and stop the movement of the character that has become a loser of the predetermined battle process to the opponent's base;
A determination module configured to determine a result of the battle game based at least on the fact that the character has reached the opponent's base.
server.   The server according to claim 1, wherein the first placement module is configured to place the character on the path within a predetermined time limit.   3. The server according to claim 2, wherein the predetermined start condition includes at least one of the conditions as the predetermined time limit elapses.   The screen display module is configured to display the game screen so that an arrangement of the character by the opponent on the route is not displayed until the predetermined start condition is satisfied. 3. The server according to any one of the above.   5. The server according to claim 4, wherein the screen display module is configured to be able to display the game screen including a portion of the route area in response to a request from each player after the predetermined start condition is satisfied. .   6. The first arrangement module according to claim 1, wherein the first arrangement module is configured to arrange a predetermined number or more of the characters on the path by the players before the predetermined start condition is satisfied. Server.   The first placement module and / or the second placement module cancels the placement of the character on the path when a predetermined stop condition based on the character placed on the path is satisfied. The server according to claim 1, which is configured as follows.   The server according to any one of claims 1 to 7, wherein the first placement module and / or the second placement module are configured to place the character at the base of the character on the route.   The said movement module is comprised so that the said character which became the loser of the said predetermined | prescribed battle | competition process and stopped the movement to the base of the opponent may be moved to the said base. The listed server.   The server according to claim 9, wherein the second arrangement module is configured to be able to arrange a character that has reached the base of the second arrangement module on the route. A server according to any one of claims 1 to 10,
The predetermined program includes an occupation processing module configured to perform a predetermined occupation process for occupying the base by the character that has reached the base of the opponent.
The determination module is configured to determine a result of the battle game based at least on the fact that the character has occupied the opponent's base.
server. A program that causes one or more computers to function as a system for providing a battle game between a first player and a second player,
A game screen including at least a part of a route area having a plurality of routes in which the bases of the first player and the second player are respectively set is displayed according to the progress of the battle game. A screen display module configured to be displayed on a display device;
Before a predetermined start condition is satisfied, one or more characters selected by each player from among a plurality of characters that can be selected by each player are selected by each player from the plurality of paths. A first placement module configured to be placed on one or more of the configured paths;
A movement module configured to move the character arranged on the route to the base of the opponent along the route after the predetermined start condition is satisfied;
After the predetermined start condition is satisfied, one or more characters selected by each player from among a plurality of characters that can be selected by each player are selected by each player from the plurality of paths. A second placement module configured to be placed on one or more of the configured paths;
A predetermined battle process was performed when the distance between the first player character and the second player character on the route was within a predetermined range, and the winner of the predetermined battle process was obtained. A battle processing module configured to continue the movement of the character to the opponent's base and stop the movement of the character that has become a loser of the predetermined battle process to the opponent's base;
A determination module configured to determine a result of the battle game based at least on the fact that the character has reached the base of the opponent;
A program comprising A method for providing a battle game between a first player and a second player by one or more computers,
A game screen including at least a part of a route area having a plurality of routes in which the bases of the first player and the second player are respectively set is displayed according to the progress of the battle game. Display on the display device,
Before a predetermined start condition is satisfied, one or more characters selected by each player from among a plurality of characters that can be selected by each player are selected by each player from the plurality of paths. Placed on one or more routes,
After the predetermined start condition is established, the character arranged on the route is moved along the route to the opponent's base,
After the predetermined start condition is satisfied, one or more characters selected by each player from among a plurality of characters that can be selected by each player are selected by each player from the plurality of paths. Placed on one or more routes,
A predetermined battle process was performed when the distance between the first player character and the second player character on the route was within a predetermined range, and the winner of the predetermined battle process was obtained. The movement of the character to the opponent's base is continued and the movement of the character that has become a loser of the predetermined battle process to the opponent's base is stopped.
Determining the result of the battle game based at least on the fact that the character has reached the opponent's base;
Method.

Images