JP6792023B2 - Control programs, control methods, and computers - Google Patents

Description

The present invention relates to a computer, a control method thereof, and a control program thereof.

In recent years, games in which a game program is installed and played on a mobile terminal from a server via a communication network have become widespread. Some of such games allow a plurality of players to participate (so-called "social games"), and it is known that players can communicate with each other as well as play against each other and cooperate with each other.

For example, as a game in which a player plays against another player or a computer, instead of a conventional turn-based strategy game in which the player and the opponent act in a fixed order, in a time that progresses in real time. Real-time Strategy games in which players act while making plans have become widespread in recent years (see, for example, Patent Document 1 and Non-Patent Document 1). In particular, the game of Non-Patent Document 1 is a game in which an object is arranged in a game space by a player's operation and the object advances autonomously.

Japanese Unexamined Patent Publication No. 2006-034708

"Clash of Clans", [online], September 23, 2013, [Search September 24, 2013], Internet <URL: http://en.wikipedia.org/wiki/Clash_of_Clans>

However, in such a game, the number of objects that can be simultaneously arranged (drawn) in the game space is limited due to the specifications of the terminal serving as the game machine. Therefore, when the player tries to arrange a large number of objects in the game space, for example, the movement of the character in the game space is slowed down, the progress of the game is hindered, and the player feels uncomfortable. The game of Non-Patent Document 1 is a one-on-one battle between players, but due to the above-mentioned problems caused by the specifications of the terminal, a real-time strategy game in which a large number of objects are arranged and progressed. It is even more difficult to make it possible for multiple players to play at the same time.

Therefore, the present invention provides a computer, a control method thereof, and a control program thereof that realize a game in which a plurality of players can play at the same time and the players are attracted even under the limitation of the number of drawings due to the specifications of the terminal. With the goal.

The computer control method according to the present invention includes a storage unit that stores objects arranged in the game space in association with weights set according to the type of the objects, and the game space according to an instruction from the player. A method of controlling a computer that advances a game by arranging objects inside, a threshold setting step that sets a threshold for the total value of the weights of objects in the game space, and a method of setting an object currently placed in the game space. It has a calculation step for calculating the total value of the weights and a permission step for permitting the placement of the objects if the total value is equal to or less than the threshold value when an instruction for arranging a new object in the game space is received.

In the computer control method according to the present invention, it is preferable that the threshold value is commonly applied to a plurality of players who play a game with the game space as a common game space.

In the computer control method according to the present invention, it is preferable that the threshold value is applied to a plurality of players who select the same field map in the game space and belong to the same group.

In the computer control method according to the present invention, the threshold value is commonly applied to a player who selects the same field map in the game space and belongs to the same group and a player who belongs to another group which is an opponent of the group. Is preferable.

In the computer control method according to the present invention, it is preferable that a plurality of players who play a game in a common game space are players who select the same field map and play using a common game progress screen.

In the computer control method according to the present invention, it is preferable that an upper limit is set for the number of players who can play a game in a common game space.

In the computer control method according to the present invention, it is preferable that the storage unit stores objects in association with weights set to different values according to the type of objects.

In the computer control method according to the present invention, it is preferable that the threshold value setting step sets a different upper limit value as a threshold value according to the field map in the game space in which the game is developed.

In the computer control method according to the present invention, the storage unit further stores a parameter indicating the intimacy of the players, and the threshold setting step differs depending on the intimacy of the players participating in the game as a threshold. It is preferable to set an upper limit value.

In the computer control method according to the present invention, the storage unit further stores parameters indicating the intimacy of the players, and is set for each of the objects according to the intimacy of the players participating in the game. It is preferable to further have an intimacy correspondence change step of changing the weight.

In the computer control method according to the present invention, the storage unit further stores a parameter indicating the player's level, and the threshold value setting step sets a different upper limit value as a threshold value according to the level of the player participating in the game. It is preferable to do so.

In the computer control method according to the present invention, the storage unit further stores parameters indicating the levels of the players, and changes the weights set for each of the objects according to the levels of the players participating in the game. It is preferable to have an additional level-corresponding change step.

In the computer control method according to the present invention, when the objects arranged in the game space disappear, the calculation step preferably calculates the total value by removing the weights of the disappeared objects.

Further, the computer control program according to the present invention includes a storage unit that stores objects arranged in the game space in association with weights set according to the types of objects, and responds to instructions from the player. A computer control program that advances a game by placing objects in the game space, with the ability to set a threshold for the total weight of objects in the game space, and for objects currently placed in the game space. The function of calculating the total value of the weights and the function of permitting the placement of the objects if the total value is equal to or less than the threshold value when the instruction to newly place the objects in the game space is received are realized.

Further, the computer according to the present invention is a computer that advances a game by arranging objects in the game space according to an instruction from a player, and depending on the objects arranged in the game space and the types of objects. A storage unit that stores the set weights in association with each other, a threshold setting unit that sets a threshold value for the total value of the object weights in the game space, and a total value of the weights of the objects currently arranged in the game space. It has a total value calculation unit to be calculated, and an arrangement propriety determination unit that permits the arrangement of objects if the total value is equal to or less than the threshold value when receiving an instruction to newly arrange an object in the game space.

According to the computer according to the present invention, its control method, and its control program, it is possible to realize a game in which a plurality of players can play at the same time and the players are attracted even under the limitation of the number of drawings due to the specifications of the terminal. it can.

It is a figure which shows an example of the schematic structure of the game system 1. It is a figure which shows an example of the schematic structure of the mobile terminal 2. It is a figure which shows an example of the data structure of various tables stored in a terminal storage part 22. It is a figure which shows an example of the display screen of a mobile terminal 2. It is a figure which shows an example of the display screen of a mobile terminal 2. It is a figure which shows an example of the schematic structure of the server 3. It is a figure which shows an example of the data structure of various tables stored in a server storage part 32. It is a figure which shows an example of the operation flow of the terminal processing part 25. It is a figure which shows an example of the operation flow of the server processing unit 33.

Hereinafter, a computer according to the present invention, a control method thereof, and a control program thereof will be described with reference to the drawings. However, it should be noted that the technical scope of the present invention is not limited to those embodiments, but extends to the inventions described in the claims and their equivalents.

This computer provides a real-time strategy game that progresses by arranging objects in a game space common to a plurality of players. This computer sets weights for each object, and sets a threshold value (for example, an upper limit value) within the range of drawing restrictions according to the terminal specifications for the total value of the weights of the objects arranged in the game space. Then, when an instruction to place a new object is given by the operation of a certain player, the placement of the object is permitted only when the total value of the weights of the objects currently placed in the game space is equal to or less than the threshold value. To do. That is, the threshold value and the total value of the weights of the objects are shared among a plurality of players who play at the same time. As a result, this computer allows a plurality of players to play the game at the same time within the drawing limit set by the terminal specifications, and makes each player think about which object is arranged and how within the limit range. By doing so, we aim to convert the drawing restrictions into the fun of the game (game quality).

The computer may be a mobile terminal, a stationary terminal, a server, or the like, as long as the above procedure can be executed.

In the following, as an example of a game realized by the above computer, each player places a large number of objects such as soldiers on a field map, which is a game space common to multiple players, to capture the enemy's position. Explain the game to go. However, the game of the present invention is not limited to a specific game as long as it is a game that progresses by arranging objects in the game space. Objects are digital contents that are placed (drawn) in the game space, and are not limited to soldiers, but other characters in the game, facilities placed in the game space, cards, figurines, avatars, etc. It may be an item or the like.

FIG. 1 is a diagram showing an example of a schematic configuration of a game system 1. The game system 1 includes at least one mobile terminal 2 and a server 3.

The mobile terminal 2 accepts operations by the player. Further, the server 3 controls the progress of the game played by the plurality of players on their own mobile terminals 2. The mobile terminal 2 and the server 3 are connected to each other via, for example, a communication network such as a base station 4, a mobile communication network 5, a gateway 6, and the Internet 7. The program executed on the mobile terminal 2 (for example, a game program) and the program executed on the server 3 (for example, a game management program) are UDP (User Datagram Protocol) and Hypertext Transfer Protocol (HTTP). ), TCP (Transport Control Protocol) and other communication protocols are used for communication. In particular, while the game is in progress, the mobile terminal 2 and the server 3 constantly communicate with each other via the communication network.

The mobile terminal 2 is assumed to be a multifunctional mobile phone (so-called "smartphone"), but the present invention is not limited to this. The mobile terminal 2 may be any application as long as the present invention can be applied, for example, a mobile phone (so-called "feature phone"), a personal digital assistant (PDA), a portable game machine, a portable music player, a tablet PC, a notebook. It may be a PC, a wearable computer, a desktop PC, or the like.

FIG. 2 is a diagram showing an example of a schematic configuration of the mobile terminal 2. The mobile terminal 2 includes a terminal communication unit 21, a terminal storage unit 22, an operation unit 23, a display unit 24, and a terminal processing unit 25.

The terminal communication unit 21 includes a communication interface circuit including an antenna having a predetermined frequency band as a sensitive band, and connects the mobile terminal 2 to a wireless communication network. The terminal communication unit 21 establishes a communication signal line with the base station 4 by the LTE (Long Term Evolution), CDMA (Code Division Multiple Access) method, etc. via the channel assigned by the base station 4, and the base station. Communicate with 4. Then, the terminal communication unit 21 transmits the data supplied from the terminal processing unit 25 to the server 3 or the like. Further, the terminal communication unit 21 supplies the data received from the server 3 or the like to the terminal processing unit 25.

The terminal storage unit 22 includes, for example, a semiconductor memory device. The terminal storage unit 22 stores operating system programs, driver programs, application programs, data, and the like used for processing in the terminal processing unit 25. For example, the terminal storage unit 22 stores, as a driver program, an input device driver program that controls the operation unit 23, an output device driver program that controls the display unit 24, and the like. Further, the terminal storage unit 22 stores, as an application program, a game program or the like that advances the game and displays the result. Further, the terminal storage unit 22 is arranged on a map table (FIG. 3 (a)) that manages a player's identification number (ID) as data, a field map as a game space (hereinafter, simply referred to as “map”), and a map. For objects such as an enemy character table (Fig. 3 (b)) that manages enemy characters, a soldier table (Fig. 3 (c)) that manages friendly soldiers used by the player, and enemy characters and friendly soldiers. The relevant image data, video data, etc. are stored. Further, the terminal storage unit 22 may store temporary data related to a predetermined process.

3A to 3C are diagrams showing an example of the data structure of various tables stored in the terminal storage unit 22.

FIG. 3A shows an example of a map table that manages a map. In the map table, the map ID for identifying the map, the file name of the corresponding image data, the level indicating the difficulty of the map, the cost upper limit indicating the upper limit of the weight of the objects that can be placed on the map, In addition, the enemy character IDs corresponding to each enemy character placed on the map and their placement positions are stored. In the following, the weight set on the object is also referred to as "placement cost".

In this game, the map is configured in a grid pattern, each object is placed in one of the grids, and the position is expressed by the coordinates of the grid whose origin is a predetermined grid (for example, the upper left of the map). It shall be. However, the configuration of the game space (map) may be any as long as the present invention can be applied.

FIG. 3B shows an example of an enemy character table that manages enemy characters and the like arranged on the map. The enemy character table stores the enemy character ID for identifying the enemy character, the type of the enemy character, the file name of the corresponding image data, the level indicating the strength of the enemy character, and the like. The enemy character is not limited to an enemy soldier or the like, but may be a facility such as a wall provided in an enemy's position.

FIG. 3C shows an example of a soldier table that manages friendly soldiers and the like used by the player. In the soldier table, the soldier ID for identifying the soldier, the file name of the corresponding image data, the level indicating the strength of the soldier, the placement cost which is the weight of the object set for each soldier, etc. are stored. To.

The operation unit 23 may be any device as long as the mobile terminal 2 can be operated, such as a touch panel and key buttons. The player can input characters, numbers, symbols, etc. using the operation unit 23. When the operation unit 23 is operated by the player, the operation unit 23 generates a signal corresponding to the operation. Then, the generated signal is supplied to the terminal processing unit 25 as a player's instruction.

The display unit 24 may be any device as long as it can display images, images, and the like, and is, for example, a liquid crystal display, an organic EL (Electro-Luminescence) display, or the like. The display unit 24 may be integrated with the operation unit 23 by, for example, a liquid crystal touch panel display. The display unit 24 displays an image corresponding to the image data supplied from the terminal processing unit 25, an image corresponding to the video data, and the like.

The terminal processing unit 25 includes one or a plurality of processors and peripheral circuits thereof. The terminal processing unit 25 is, for example, a CPU (Central Processing Unit), and controls the overall operation of the mobile terminal 2 in an integrated manner. The terminal processing unit 25 has a terminal communication unit 21 and a display unit so that various processes of the mobile terminal 2 are executed in an appropriate procedure based on a program stored in the terminal storage unit 22, an operation of the operation unit 23, and the like. Control the operation of 24 etc. The terminal processing unit 25 executes processing based on a program (operating system program, driver program, application program, etc.) stored in the terminal storage unit 22. Further, the terminal processing unit 25 can execute a plurality of programs (application programs and the like) in parallel.

4 (a), 4 (b), and 5 (a) to 5 (d) are diagrams showing an example of the display screen of the mobile terminal 2. Here, the outline of the game provided by the game system 1 will be described with reference to FIGS. 4 (a) to 5 (d).

FIG. 4A shows a map selection screen 200 displayed at the start of the game. In this game, several maps on which the battle game is developed are presented, and the player can select one of them. For example, in FIG. 4A, three maps 201, 202, 203 are presented, and the player can select one of the maps by operating the corresponding selection buttons 211, 212, 213. it can. Depending on the map, the level of the enemy characters that appear and the size of the map are different, and the difficulty of capture is also different. The type (difficulty) of the map that can be selected may be changed depending on the level of the player.

FIG. 4B shows a game progress screen 300 when one map is selected and the game is started. On this screen, a map 301 in which the battle game is developed is shown. This map is an enemy's position, and various enemy soldiers or facilities, etc. 302 to 306 are arranged on it as enemy characters, depending on the map. The purpose of this game is for a plurality of players participating in the game to cooperate with each other to place objects such as friendly soldiers on the map 301 and capture the enemy's central base (for example, facility 303).

For example, when the same map is selected by a plurality of players, a combination of players participating in the game is determined, and a battle game using the map as a battlefield is started. An upper limit is set for the number of players who can play the game on the same map at the same time, for example, up to four players. Then, in this game, for example, an enemy soldier or the like is operated by a computer (server 3), and a maximum of four players and a computer play against each other. Alternatively, the game provided by the game system 1 may be a game in which groups composed of a plurality of players compete against each other.

In the game provided by the game system 1, a friend relationship can be established between the players. As will be described later, players in a friendship relationship can play against an enemy character under favorable conditions, for example, when playing together. One player can make friends with multiple players. However, an upper limit may be set for the number of other players with which one player can form a friendship.

FIG. 5A is a schematic view of a game progress screen 300 for explaining the progress of the game. 5 (a) to 5 (d) show a simplified map 311 in a grid pattern for the sake of explanation. On the map 311 for example, there are four enemy soldiers 312 indicated by "●", facilities 313 such as walls indicated by "▲", and the central base 314 of the enemy base indicated by "■". Is placed. At the beginning of the game, the player can place friendly soldiers, for example, on the peripheral edge 315 of the map 311. As the capture progresses, the player can also place soldiers near the enemy's central base 314. Each player places soldiers on the map 311 in real time while looking at the same game progress screen 300 displayed on their mobile terminal 2.

FIG. 5B is a schematic view of the soldier selection screen 400 when a friendly soldier is placed on the map 311 by the operation of the player. For example, when a player selects the position of the arrow A shown in FIG. 5 (b) (if the operation unit 23 is a touch panel, the position of the arrow A is touched), the game progress screen of the player's mobile terminal 2 The soldier selection screen 400 is displayed on top of the 300. On the soldier selection screen 400, the player can select an image 401 of any of the soldiers and place the soldier at the position of the arrow A on the map 311. The types of soldiers that each player can place may vary depending on the in-game score, such as the player's level.

However, in this game, the number of friendly soldiers that the player can place on the map at the same time is limited. Specifically, a placement cost of 402 is set for each soldier 401. In the example of FIG. 5B, the placement costs 402 of the soldier 401 displayed on the left side, the center, and the right side of the screen are 30, 10 and 20, respectively. The placement cost 402 corresponds to, for example, the level (strength) of the soldier, and the higher the level of the soldier, the higher the placement cost is set. Then, the upper limit of the total value of the placement cost 402 is set in the map 311. In the example of FIG. 5B, “100” of “0/100” indicated by reference numeral 403 is the upper limit value. Further, "0" is the total value of the placement cost 402 of the soldiers currently placed on the map 311. In the example of FIG. 5B, no friendly soldiers have been deployed yet, and the total value of the current deployment cost 402 is 0.

FIG. 5C is a schematic view of the game progress screen 300 when a soldier with a placement cost of 30 is selected by a certain player from the state of FIG. 5B. In the state of FIG. 5B, the total value of the placement costs of the soldiers placed on the map 311 is 0, so even if the placement cost increases by 30, the upper limit is 100 or less, and the soldiers with the placement cost of 30 are newly added. Can be placed in. Therefore, when a soldier with a placement cost of 30 is selected by the player as shown by a thick frame in FIG. 5C, all the players who select the same map and play the game in a common game space (map). On the game progress screen 300 of the mobile terminal 2 of the above, the soldier is newly arranged at the position of the arrow A in FIG. 5 (b). In FIG. 5C, the fact that a friendly soldier has been placed is indicated by “◯” of reference numeral 316.

Then, by this operation, as indicated by reference numeral 404, the total value of the current placement costs becomes 30. That is, when a player places one soldier with a placement cost of 30, 30 of the upper limit values of 100 are consumed. For this reason, there is a restriction that all players who select the same map and play the game in a common game space (map) must deploy soldiers within the deployment cost range of 100-30 = 70. Imposed. However, if a friendly soldier falls against an enemy character, that soldier will no longer consume the placement cost, and you will be able to place an extra soldier.

FIG. 5D is a schematic view of the game progress screen 300 when the total value of the placement cost exceeds the upper limit value when a new soldier is to be placed. For example, when a plurality of friendly soldiers are placed in the area 315 and the total value of the current placement costs reaches 90 as shown by reference numeral 405, another soldier with a placement cost of 30 is placed at the position of arrow B. It is assumed that the operation to be performed is performed by a certain player. In this case, if the soldier is placed, the total placement cost becomes 90 + 30 = 120, which exceeds the upper limit of 100, so that the soldier is not allowed to be placed. If an attempt is made to place a soldier in excess of the upper limit of the placement cost, an error message 406, for example, is displayed on the game progress screen 300 of the mobile terminal 2 of the player who performed the operation. Alternatively, instead of the error message 406, for example, for a soldier whose total placement cost exceeds the upper limit when newly placed, the image 401 is grayed out to notify each player that the soldier cannot be placed. You may.

In this way, in the game provided by the game system 1, the total value and the upper limit of the placement cost (weight of the object) of the soldiers and the like placed on the map are a plurality of games playing on the same map at the same time. Shared between players. That is, the same threshold value (upper limit value) for the weight of the object is commonly applied to a plurality of players. This upper limit value is appropriately set according to the specifications of the mobile terminal 2 and the server 3 within a range that does not interfere with the drawing process of the object. By letting multiple players think about the strategy of arranging soldiers using the placement cost with a fixed upper limit, a new game can be given.

The player who shares the total value and the upper limit value may be, for example, all players who have selected the same map. Alternatively, in the case of a game in which groups composed of a plurality of players play against each other, the players sharing the total value and the upper limit value may be players who select the same map and belong to one group, or one of them. It may be both a player belonging to a group and a player belonging to another group to be an opponent.

In this way, if multiple players can capture the enemy's position while arranging friendly soldiers on the map, for example, if they can capture the enemy's central base within the specified time limit (within 3 minutes, etc.), the player wins. .. On the contrary, if the enemy's central base cannot be captured within the specified time limit, the player loses. Alternatively, if the enemy's base can be destroyed by a predetermined ratio (for example, 50%) or more within the specified time limit (within 3 minutes, etc.), the player may win, assuming that the enemy's base can be captured.

In order to realize the above functions, the terminal processing unit 25 includes a game progress unit 251, an object designation unit 252, and an object arrangement unit 253. Each of these units is a functional module realized by a program executed by a processor included in the terminal processing unit 25. Alternatively, each of these parts may be mounted on the mobile terminal 2 as firmware.

The game progress unit 251 controls the start and progress of the game, and appropriately instructs the object designation unit 252, the object arrangement unit 253, and the like to execute the process.

Specifically, when a map is selected by the player via the operation unit 23, the game progress unit 251 makes a game start request including the player ID of the player and the map ID of the map by the terminal communication unit 21. Send to server 3. Then, for example, when the same map is selected by a plurality of players and a game start instruction is received from the server 3 via the terminal communication unit 21, the game progress unit 251 displays the game progress screen 300.

At this time, the game progress unit 251 refers to the map table stored in the terminal storage unit 22 using the map ID of the map selected by the player as a key, and extracts the image file name of the corresponding map. In addition, the game progress unit 251 extracts from the map table the enemy character IDs corresponding to each enemy character arranged on the corresponding map and their arrangement positions. Further, the game progressing unit 251 refers to the enemy character table stored in the terminal storage unit 22 using the extracted enemy character ID as a key, and extracts the image file name of the corresponding enemy character. Then, the game progress unit 251 acquires the map corresponding to the extracted image file name and the image data of the enemy character from the terminal storage unit 22. Then, the game progress unit 251 configures the game progress screen 300 in which the image data of the enemy character is arranged on the image data of the map according to the extracted arrangement position, and outputs the game progress unit 251 to the display unit 24.

Further, when the player gives an instruction to arrange a soldier via the operation unit 23, the game progress unit 251 instructs the object designation unit 252 to execute the process.

Further, when the object arrangement instruction is received from the server 3, the game progress unit 251 instructs the object arrangement unit 253 to execute the process.

Further, when another process is instructed by the player via the operation unit 23, the game progress unit 251 executes the process.

When the player gives an instruction to arrange a soldier via the operation unit 23, the object designation unit 252 uses the soldier ID of the soldier selected by the player as a key to display the soldier table stored in the terminal storage unit 22. Refer to and extract the placement cost of the corresponding soldier. Then, the object designation unit 252 transmits an object placement request including the soldier ID of the selected soldier, the placement position designated by the player, and the placement cost of the target soldier to the server 3 by the terminal communication unit 21.

When the object placement failure notification is received from the server 3 as a response to the object placement request via the terminal communication unit 21, the object designation unit 252 outputs, for example, an error message 406 to the display unit 24, and the player selects the object. The soldier informs the player that it cannot be placed on the map 311.

When the object placement unit 253 receives an object placement instruction including the soldier ID and placement position of the target soldier from the server 3 by the terminal communication unit 21 in response to the object placement request, the object placement unit 253 selects the image file name corresponding to the soldier ID in the soldier table. Extract from. Then, the object arrangement unit 253 acquires the image data of the soldier corresponding to the extracted image file name from the terminal storage unit 22, and configures the game progress screen 300 in which the image data of the soldier is arranged at the arrangement position on the map 311. And output to the display unit 24.

Further, when the object placement unit 253 receives the object placement instruction from the server 3 by the terminal communication unit 21 in response to the object placement request from the mobile terminal 2 of another player, the soldier ID included in the object placement instruction is also included. Extract the image file name corresponding to from the soldier table. Then, the object arranging unit 253 configures (that is, updates the screen) a new game progress screen 300 in which the image data of the soldier is arranged at the arranging position on the map in the same manner as described above, and outputs the new game progress screen 300 to the display unit 24. ..

Further, the object arranging unit 253 responds when the terminal communication unit 21 receives an instruction to extinguish the object from the server 3 in response to, for example, one of the soldiers being defeated by the battle between the ally soldier and the enemy character. Disappear the soldiers from the game progress screen 300.

FIG. 6 is a diagram showing an example of a schematic configuration of the server 3. The server 3 includes a server communication unit 31, a server storage unit 32, and a server processing unit 33.

The server communication unit 31 includes a communication interface circuit for connecting the server 3 to the Internet 7, and communicates with the Internet 7. Then, the server communication unit 31 supplies the data received from the mobile terminal 2 or the like to the server processing unit 33. Further, the server communication unit 31 transmits the data supplied from the server processing unit 33 to the mobile terminal 2 or the like.

The server storage unit 32 includes, for example, at least one of a magnetic tape device, a magnetic disk device, a flash memory, and an optical disk device. The server storage unit 32 stores an operating system program, a driver program, an application program, data, and the like used for processing in the server processing unit 33. For example, the server storage unit 32 stores a game management program or the like that controls the arrangement and operation of objects as an application program. Further, the server storage unit 32 has a map table (FIG. 7 (a)) for managing the map, an enemy character table (FIG. 7 (b)) for managing the enemy characters and the like arranged on the map, and a player as data. A soldier table that manages friendly soldiers to be used (Fig. 7 (c)), a player table that manages players (Fig. 7 (d)), and an intimacy table that manages parameters of intimacy between players (Fig. 7 (Fig. 7 (c)). e)), store image data, video data, etc. related to objects such as enemy characters and friendly soldiers. Further, the server storage unit 32 may store temporary data related to a predetermined process.

7 (a) to 7 (e) are diagrams showing an example of the data structure of various tables stored in the server storage unit 32.

FIG. 7A shows an example of a map table that manages a map. Similar to that of FIG. 3A, the map table corresponds to the map ID, the image file name, the level of the map, the cost limit for the map, and each enemy character placed on the map. Enemy character IDs and their placement positions are stored.

FIG. 7B shows an example of an enemy character table that manages enemy characters and the like arranged on the map. Similar to that in FIG. 3B, the enemy character table stores the enemy character ID, the type of the enemy character, the image file name, the level of the enemy character, and the like.

FIG. 7C shows an example of a soldier table that manages friendly soldiers and the like used by the player. Similar to the one in FIG. 3C, the soldier ID, the image file name, the level of the soldier, the placement cost for the soldier, and the like are stored in the soldier table.

FIG. 7D shows an example of a player table that manages players. For each player registered in the game system 1, the player ID, name, image file name, level, soldier ID and number of soldiers possessed by the player are stored in the player table.

FIG. 7E shows an example of an intimacy table that manages parameters of intimacy between players. The intimacy is a parameter set for each group of players. For example, the intimacy is set to a higher value for a group of players who are friends with each other and play the game together for a longer period of time or more times. In the example of FIG. 7E, the pair of the player P01 and the player P02 has 0 intimacy regardless of the friendship. The pair of player P01 and player P03 has a friendship and has an intimacy of 5. The pair of player P02 and player P03 is in a friendship relationship, and the time or number of times the game is played together is larger than that of the pair of player P02 and player P03, and the intimacy is greater than 10. In this way, the intimacy table stores the intimacy parameters set for each set of players.

In the game system 1, as shown in FIGS. 3 (a) to 3 (c) and 7 (a) to 7 (c), the terminal storage unit 22 and the server storage unit 32 have the same map table and enemy. It remembers the character table and the soldier table. However, if the terminal processing unit 25 is controlled to inquire the information of these tables to the server 3 as needed, only the server storage unit 32 may store these tables.

The server processing unit 33 includes one or more processors and peripheral circuits thereof. The server processing unit 33 is, for example, a CPU, and controls the overall operation of the server 3 in an integrated manner. The server processing unit 33 controls the operation of the server communication unit 31 and the like so that various processes of the server 3 are executed in an appropriate procedure based on the program and the like stored in the server storage unit 32. The server processing unit 33 executes processing based on a program (operating system program, driver program, application program, etc.) stored in the server storage unit 32. Further, the server processing unit 33 can execute a plurality of programs (application programs and the like) in parallel.

The server processing unit 33 includes a server control unit 331, a threshold value setting unit 332, a total value calculation unit 333, an arrangement possibility determination unit 334, and an object control unit 335. Each of these units is a functional module realized by a program executed by the processor included in the server processing unit 33. Alternatively, each of these parts may be mounted on the server 3 as firmware.

The server control unit 331 controls the operation of the server 3, and appropriately instructs the threshold value setting unit 332, the total value calculation unit 333, the arrangement availability determination unit 334, the object control unit 335, and the like to execute the process.

Specifically, when a game start request for the same map is received from the mobile terminals 2 of a plurality of players via the server communication unit 31, the server control unit 331 sends the server communication unit 31 to the source of the game start request. Send a game start instruction via. Further, at this time, the server control unit 331 instructs the threshold value setting unit 332 to execute the process using the map ID included in the received game start request as a parameter.

Further, when an object arrangement request is received from a certain mobile terminal 2 via the server communication unit 31, the server control unit 331 arranges the total value calculation unit 333 with the arrangement cost included in the received object arrangement request as a parameter. The possibility determination unit 334 and the object control unit 335 are instructed to execute the process.

Further, when the placement / disapproval determination unit 334 does not allow the placement of a new object, the server control unit 331 notifies the mobile terminal 2 of the source of the object placement request via the server communication unit 31 that the object cannot be placed. To send. Further, when an object arrangement instruction is given from the object control unit 335, the server control unit 331 selects the same map and sends the mobile terminals 2 of all the players who play the game in the common game space (map) to the mobile terminals 2. The object placement instruction is transmitted via the server communication unit 31.

Further, when another request is received from the mobile terminal 2 via the server communication unit 31, the server control unit 331 executes other corresponding processes to control the progress of the game.

When the game is started, the threshold value setting unit 332 sets a threshold value (for example, an upper limit value) for the total value of the weights of the objects on the map which is the game space. For this purpose, the threshold setting unit 332 refers to the map table stored in the server storage unit 32 using the map ID included in the game start request given by the server control unit 331 as a key, and the cost of the corresponding map. Extract the upper limit. Then, the threshold value setting unit 332 sets the extracted cost upper limit value as the upper limit value for the weight of the object on the target map.

The map table stores different cost caps depending on the level of the map. The value of this cost limit is linked to the map level (difficulty of capture). For example, the higher the level of the map, the greater the number of enemy characters placed on the map, or the higher the level of the enemy characters, and the more soldiers are needed to capture. Therefore, the higher the map level, the higher the cost upper limit is stored in the map table in advance. As a result, the threshold setting unit 332 sets the upper limit value for the weight of the object higher as the level of the map becomes higher.

Alternatively, conversely, the higher the map level, the lower the cost upper limit may be stored in the map table in advance. As a result, the higher the level of the map, the lower the threshold setting unit 332 may set the upper limit value for the weight of the object, which may make the game more difficult.

Further, the threshold value setting unit 332 may change the upper limit value of the weight of the object according to the intimacy of the players participating in the game. In this case, for example, the threshold setting unit 332 refers to the intimacy table stored in the server storage unit 32 using the player IDs of all the participants included in the game start request given by the server control unit 331 as a key. , Extract the intimacy parameters set for the corresponding player set. Then, for example, the threshold value setting unit 332 changes the upper limit value of the weight of the object on the target map to a higher value as the value of the extracted intimacy parameter is higher. For example, the threshold value setting unit 332 may change the upper limit value by multiplying the upper limit value by a coefficient according to the intimacy parameter, such as raising the upper limit value by 20% when the total value of the intimacy parameters becomes twice as high. As a result, when players in a friendship relationship play with each other, the game may be advanced under more favorable conditions, and the player may be encouraged to participate in the game or interact with other players.

Alternatively, conversely, the threshold setting unit 332 changes the upper limit value of the weight of the object on the target map to a lower value as the value of the extracted intimacy parameter is higher, and the player in a friend relationship. The game may be more difficult when playing with each other.

Further, the threshold value setting unit 332 may change the upper limit value of the weight of the object according to the level of the player participating in the game. In this case, for example, the threshold value setting unit 332 refers to the player table stored in the server storage unit 32 by using the player IDs of all the participants included in the game start request given by the server control unit 331 as a key. Extract the level of each player. Then, for example, the threshold setting unit 332 changes the upper limit value of the weight of the object on the target map to a higher value as the extracted level is higher. For example, the threshold setting unit 332 changes the upper limit value by multiplying the upper limit value by a coefficient according to the player's level, such as raising the upper limit value by 20% when the total value of the levels of the players participating in the game is doubled. You may. As a result, the player with a higher level may be able to proceed with the game under more favorable conditions.

Alternatively, conversely, the threshold setting unit 332 changes the upper limit of the weight of the object on the target map to a lower value as the extracted level is higher, and makes the game more difficult for the higher level player. You may.

The total value calculation unit 333 calculates the total value of the weights of the objects currently arranged on the map, which is the game space, when the player gives an instruction to arrange the soldiers. For this purpose, the total value calculation unit 333 sets the initial value to 0 at the start of the game, for example. Then, the total value calculation unit 333 refers to the soldier table stored in the server storage unit 32 with the soldier ID included in the object placement request given by the server control unit 331 as a key, and is set to the corresponding soldier. Extract the placement cost. Then, the total value calculation unit 333 adds the extracted arrangement cost value to the previously calculated total value. Further, for example, when a soldier already placed on the map is defeated by an enemy character, the total value calculation unit 333 subtracts the value of the placement cost set for the corresponding soldier from the total value calculated last time. To do. That is, when the object arranged in the game space disappears, the total value calculation unit 333 calculates the total value by removing the weight of the disappeared object. In this way, the total value calculation unit 333 calculates the total value of the weights of the objects currently arranged on the map.

The placement cost may be set in advance for each enemy character placed on the map. Then, the total value calculation unit 333 counts not only the placement cost of the friendly soldiers placed by the player but also the placement cost set for each enemy character on the map as the total value of the weights of the objects, and puts it on the map. You may calculate the sum of the weights of all currently placed objects.

Further, the total value calculation unit 333 may change the placement cost of the soldiers placed by the players according to the intimacy of the players participating in the game, and calculate the total value of the weights of the objects. In this case, for example, the total value calculation unit 333 changes the placement cost set for the target soldier to a lower value as the value of the intimacy parameter extracted by the threshold value setting unit 332 is higher. For example, the total value calculation unit 333 changes the placement cost by multiplying by a coefficient according to the intimacy parameter, such as reducing the placement cost of each soldier by 10% when the total value of the intimacy parameters is doubled. You may. As a result, when players in a friendship relationship play with each other, the game may be advanced under more favorable conditions, and the player may be encouraged to participate in the game or interact with other players.

Alternatively, conversely, the total value calculation unit 333 changes the placement cost of each soldier to a higher value as the value of the intimacy parameter extracted by the threshold value setting unit 332 is higher, and the players in a friend relationship with each other. May make the game more difficult when you play.

Further, the total value calculation unit 333 may change the placement cost of the soldiers placed by the player according to the level of the players participating in the game, and calculate the total value of the weights of the objects. In this case, for example, the total value calculation unit 333 changes the placement cost set for the target soldier to a lower value as the level of each player extracted by the threshold value setting unit 332 is higher. For example, the total value calculation unit 333 is arranged by multiplying by a coefficient according to the player's level, such as reducing the placement cost of each soldier by 10% when the total value of the levels of the players participating in the game is doubled. You may change the cost. As a result, the player with a higher level may be able to proceed with the game under more favorable conditions.

Alternatively, conversely, the total value calculation unit 333 changes the placement cost of each soldier to a higher value as the level of each player extracted by the threshold value setting unit 332 is higher, and the higher the level of the player, the more the game is played. It can be difficult.

When the player receives an instruction (object placement request) to newly place an object on the map, which is the game space, the placement possibility determination unit 334 determines the total value of the object weights calculated by the total value calculation unit 333. It is determined whether or not it is equal to or less than the upper limit value set by the threshold value setting unit 332. Then, if the total value of the calculated weights of the objects is equal to or less than the upper limit value, the arrangement possibility determination unit 334 permits the arrangement of new objects.

On the other hand, the placement possibility determination unit 334 does not allow the placement of a new object if the total value of the calculated weights of the objects is larger than the upper limit value. At this time, the placement availability determination unit 334 gives the server control unit 331 an object placement failure notification addressed to the mobile terminal 2 that is the transmission source of the object placement request.

The object control unit 335 controls the operation of the objects currently arranged on the map. For this reason, the object control unit 335 determines the soldier ID included in the object placement request given by the server control unit 331 and the placement position on the map when the placement possibility determination unit 334 permits the placement of a new object. get. Then, the object control unit 335 calculates the movement destination (new arrangement position) with the passage of time for all the objects currently arranged on the map at regular time intervals. Then, the object control unit 335 sets the soldier ID of each soldier and the enemy character of each enemy character to the mobile terminals 2 of all the players who select the same map and play the game in the common game space (map). An object placement instruction including IDs and their new placement positions is given to the server control unit 331.

In addition, the object control unit 335 determines whether or not any of the soldiers has been defeated by the battle between the friendly soldier and the enemy character. Then, when any of the soldiers is defeated, an instruction to extinguish the soldier from the game progress screen 300 is included in the above-mentioned object arrangement instruction, and the server control unit 331 is given an instruction.

8 (a) and 8 (b) are diagrams showing an example of the operation flow of the terminal processing unit 25. The operation flow described below is executed mainly by the terminal processing unit 25 in cooperation with each element of the mobile terminal 2 based on the program stored in the terminal storage unit 22 in advance.

FIG. 8A is a diagram showing an example of the operation flow of the game progress unit 251.

When the player instructs the terminal processing unit 25 to start the game via the operation unit 23, the terminal processing unit 25 starts the process based on the game program. First, the game progress unit 251 realized by the game program displays the map selection screen 200 on the display unit 24 (step S100). When any of the displayed maps is selected by the player via the operation unit 23, the game progress unit 251 transmits a game start request to the server 3 via the terminal communication unit 21 (step S102).

On the other hand, when the game start instruction is received from the server 3 via the terminal communication unit 21 (step S104), the game progress unit 251 displays the game progress screen 300 on the display unit 24 (step S106).

Here, when the player gives an instruction to arrange the soldiers via the operation unit 23 (Yes in step S108), the game progress unit 251 instructs the object designation unit 252 to execute the process (step S110). When the process of step S110 is completed, the operation flow returns to step S106. On the other hand, when the instruction to arrange the soldier is not given (No in step S108), the operation flow proceeds to step S112.

Further, the game progress unit 251 receives an object placement instruction from the server 3 via the terminal communication unit 21 (step S112). This object placement instruction is received at regular intervals. Upon receiving the object placement instruction, the game progress unit 251 instructs the object placement unit 253 to execute the process and updates the game progress screen 300 (step S114). Then, the operation flow returns to step S106. In the operation flow of the game progress unit 251, the above processing is repeated.

FIG. 8B is a diagram showing an example of the operation flow of the object designation unit 252.

When the player gives an instruction to arrange a soldier via the operation unit 23 (Yes in step S108), the object designation unit 252 displays the soldier selection screen 400 on the display unit 24 (step S120). Then, the object designation unit 252 transmits an object placement request based on the operation on the soldier selection screen 400 of the player to the server 3 by the terminal communication unit 21 (step S122).

On the other hand, when the object placement impossible notification is received from the server 3 via the terminal communication unit 21 (Yes in step S124), the object designation unit 252 outputs, for example, an error message to the display unit 24, and the player selects it. The soldier notifies the player that it cannot be placed on the map (step S126). On the other hand, when the object placement impossible notification is not received from the server 3 (No in step S124), the object placement unit 253 updates the game progress screen 300 to the one in which soldiers are newly placed on the map (step). S128). Then, the object designation unit 252 ends the process.

FIG. 9 is a diagram showing an example of the operation flow of the server processing unit 33. The operation flow described below is executed mainly by the server processing unit 33 in cooperation with each element of the server 3 based on the program stored in the server storage unit 32 in advance.

First, when a game start request for the same map is received from the mobile terminals 2 of a plurality of players via the server communication unit 31 (step S200), the server control unit 331 sends the server communication unit to the source of the game start request. A game start instruction is transmitted via 31 (step S202).

At this time, the server control unit 331 instructs the threshold value setting unit 332 to execute the process using the map ID included in the received game start request as a parameter (step S204). Accordingly, the threshold setting unit 332 sets a threshold (for example, an upper limit value) for the total value of the weights of the objects on the selected map.

Then, when an object placement request is received from a certain mobile terminal 2 via the server communication unit 31 (Yes in step S206), the server control unit 331 calculates the total value using the placement cost included in the received object placement request as a parameter. Instruct unit 333 to execute the process (step S208). Correspondingly, the total value calculation unit 333 calculates the total value of the weights of the objects currently arranged on the map. If the object placement request has not been received (No in step S206), the operation flow proceeds to step S214.

Next, the server control unit 331 instructs the placement / disapproval determination unit 334 to execute the process, and the placement / disapproval determination unit 334 indicates that the total value of the object weights calculated in step S208 is equal to or less than the upper limit set in step S204. It is determined whether or not it is (step S210).

If the total value of the object weights is larger than the upper limit value (No in step S210), the server control unit 331 transmits an object placement impossible notification to the mobile terminal 2 that is the source of the object placement request via the server communication unit 31. (Step S212). On the other hand, if the total value of the weights of the objects is equal to or less than the upper limit value (Yes in step S210), the operation flow proceeds to step S214 without executing step S212.

Then, the server control unit 331 instructs the object control unit 335 to execute the process, and the object control unit 335 sets the movement destination (new arrangement position) over time for all the objects currently arranged on the map. Calculate (step S214). Correspondingly, the server control unit 331 attaches the soldier ID of each soldier to the mobile terminal 2 of all the players who select the same map and play the game in the common game space (map) via the server communication unit 31. An object placement instruction including the enemy character ID of each enemy character and the new placement position calculated in step S214 is transmitted (step S216). After that, the operation flow returns to step S206. In the operation flow of the server processing unit 33, the above processing is repeated.

As described above, in the game system 1, the upper limit value and the total value of the weights of the objects arranged on the map, which is the game space, are shared among a plurality of players who play at the same time. This allows multiple players to play the game at the same time within the drawing restrictions set by the terminal specifications, and allows each player to think about how to arrange the objects within the limiting range, thereby limiting the drawing. It is possible to convert to the fun of the game (game quality).

The computer program for realizing each function of the terminal processing unit 25 and the server processing unit 33 on the computer was recorded on a computer-readable recording medium such as a semiconductor recording medium, a magnetic recording medium, or an optical recording medium. It is provided in the form, and may be installed in the terminal storage unit 22 and the server storage unit 32 by using a known setup program or the like from the recording medium.

It will be appreciated by those skilled in the art that various changes, substitutions, and modifications can be made to this without departing from the spirit and scope of the invention.

1 Game system 2 Mobile terminal 3 Server 31 Server communication unit 32 Server storage unit 33 Server processing unit 331 Server control unit 332 Threshold setting unit 333 Total value calculation unit 334 Placement availability judgment unit 335 Object control unit 4 Base station 5 Mobile communication network 6 gateway 7 internet

Claims (6)

A computer having a storage unit and displaying a game progress screen of a game in which a plurality of groups composed of a plurality of players compete against each other, and is a computer control program used by one of the plurality of players. To the computer
An object that can be arranged according to an instruction from each player in a game space common to the plurality of players and a value corresponding to the object are stored in the storage unit.
Based on the information about the game space, a predetermined numerical value common to each player forming the same group as the one player is set.
Display the game progress screen showing the game space,
If the object by either player constituting the same group are specified, the value corresponding to the value corresponding to the disposed object specified previously by the player constituting the same group and present the specified object When the total value of is equal to or less than the predetermined value, the game progress screen is updated to the state in which the object specified this time is arranged.
A control program characterized by doing things. Claims to further execute the computer to display the information of the predetermined numerical value and the information of the total value of the values corresponding to the objects currently arranged in the game space in the game progress screen. Item 1. The control program according to item 1. The control program according to claim 1 or 2, further causing the computer to change the predetermined numerical value based on the parameters set in the set of the plurality of players. The control program according to any one of claims 1 to 3, further causing the computer to change a predetermined numerical value based on a parameter set for each of the plurality of players. A storage unit, a method of controlling a plurality of computers in which a plurality of groups formed by the player one player among the displayed and the plurality of players to the game progress screen of the game to play against the use,
The computer
An object that can be arranged according to an instruction from each player in a game space common to the plurality of players and a value corresponding to the object are stored in the storage unit.
Based on the information about the game space, a predetermined numerical value common to each player forming the same group as the one player is set.
Display the game progress screen showing the game space,
If the object by either player constituting the same group are specified, the value corresponding to the value corresponding to the disposed object specified previously by the player constituting the same group and present the specified object When the total value of is equal to or less than the predetermined value, the game progress screen is updated to the state in which the object specified this time is arranged.
Control wherein that you do the. A computer used by one of the plurality of players, which displays a game progress screen of a game in which a plurality of groups composed of a plurality of players compete against each other.
An object that can be arranged according to an instruction from each player in a game space common to the plurality of players, a storage unit that stores a value corresponding to the object, and a storage unit.
A setting unit that sets a predetermined value common to each player forming the same group as the one player based on the information about the game space.
A display unit that displays a game progress screen showing the game space, and
If the object by either player constituting the same group are specified, the value corresponding to the value corresponding to the disposed object specified previously by the player constituting the same group and present the specified object When the total value of is less than or equal to the predetermined value, the processing unit that updates the game progress screen to the state in which the object specified this time is arranged, and
A computer characterized by having.

Images