JP6524172B2 - Control program, control method, and computer - Google Patents

Description

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

  In recent years, games in which a game program is installed and played from a server to a portable terminal via a communication network have become widespread. Among such games, there are games in which a plurality of players can participate (so-called "social games"), and games in which players can communicate not only with each other but with each other are also known.

  For example, as a game in which a player plays against another player or a computer, it is not a conventional game of Turn-Based Strategy in which the player and the opponent act in a fixed order, but within the time progressing in real time. The game of the real-time strategy (Real-time Strategy) which a player acts while making a plan has spread in recent years (for example, refer to patent documents 1 and non-patent documents 1). In particular, the game of Non-Patent Document 1 is a game in which an object is arranged in the game space by the operation of the player, and the object progresses by autonomously operating.

JP, 2006-034708, A

"Clash of Clans", [online], September 23, 2013, [Search on 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 by the specifications of the terminal serving as the game machine. Therefore, when the player tries to place a large number of objects in the game space, for example, the movement of the characters in the game space is delayed, the progress of the game is hindered, and the player may feel uncomfortable. The game of Non-Patent Document 1 is a game in which players play a one-on-one match, but since there is the above-mentioned problem caused by the specifications of the terminal, a game of real-time strategy that progresses while arranging many objects It is even more difficult to make them playable by multiple people simultaneously.

  Therefore, the present invention provides a computer that realizes a game in which a plurality of players can play simultaneously and a player can be attracted even under the limitation of the number of drawings by the specifications of the terminal, its control method, and its control program. With the goal.

  A control method of a computer according to the present invention includes a storage unit that stores an object arranged in the game space and a weight set according to the type of the object in association with each other, and the game space according to an instruction from the player. A computer control method for advancing a game by placing an object inside, comprising: a threshold setting step of setting a threshold to a total value of weights of the objects in the game space; A calculation step of calculating a total value of weights, and a permission step of permitting arrangement of objects when the total value is equal to or less than a threshold when an instruction to newly arrange an object in the game space is received.

  In the computer control method according to the present invention, preferably, the threshold 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, the threshold value is preferably applied commonly 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 who is an opponent of the group. Is preferred.

  In the computer control method according to the present invention, preferably, 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 on the number of players who can play the game in the common game space.

  In the computer control method according to the present invention, preferably, the storage unit stores the object and the weight set to different values according to the type of the object in association with each other.

  In the computer control method according to the present invention, preferably, the threshold setting step sets, as the threshold, a different upper limit 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 closeness between players, and the threshold setting step differs as a threshold according to closeness between players participating in the game. It is preferable to set the upper limit value.

  In the computer control method according to the present invention, the storage unit further stores a parameter indicating the closeness between the players, and is set to each of the objects according to the closeness between the players participating in the game. It is preferable to further include an intimacy correspondence changing step of changing the weight.

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

  In the computer control method according to the present invention, the storage unit further stores a parameter indicating the level between the players, and changes the weight set for each of the objects according to the level of the player participating in the game. It is preferable to further include a level correspondence changing step.

  In the computer control method according to the present invention, it is preferable that the calculating step calculate the total value by removing the weight of the annihilated objects when the objects disposed in the game space are annihilated.

  Further, a control program of a computer according to the present invention includes a storage unit that stores an object placed in the game space and a weight set according to the type of the object in association with each other, and responds to an instruction from the player. A computer control program for advancing a game by placing an object in the game space, the function of setting a threshold value to the total value of the weights of the objects in the game space, and an object currently placed in the game space A function of calculating the sum of weights and a function of permitting placement of objects when the sum is less than or equal to a threshold when an instruction to newly dispose an object in the game space is received are realized.

  Further, a computer according to the present invention is a computer for advancing a game by arranging an object in response to an instruction from a player in the game space, which corresponds to the object and the kind of the object arranged in the game space. A storage unit that associates and stores the set weights, a threshold setting unit that sets a threshold value to the total value of object weights in the game space, and a total value of weights of objects currently arranged in the game space It has a total value calculation unit to be calculated, and an arrangement availability determination unit that permits the arrangement of objects if the total value is equal to or less than a threshold when an instruction to newly arrange an object in the game space is received.

  According to the computer, the control method thereof and the control program thereof according to the present invention, it is possible to realize a game in which a plurality of players can play simultaneously and which attracts players even under the limitation of the number of drawings by the specifications of the terminal. it can.

FIG. 1 is a diagram showing an example of a schematic configuration of a game system 1; FIG. 2 is a diagram showing an example of a schematic configuration of a mobile terminal 2; It is a figure which shows an example of the data structure of the various tables memorize | stored in the terminal storage part 22. FIG. FIG. 6 is a view showing an example of a display screen of the mobile terminal 2; FIG. 6 is a view showing an example of a display screen of the mobile terminal 2; FIG. 2 is a diagram showing an example of a schematic configuration of a server 3; FIG. 6 is a view showing an example of the data structure of various tables stored in the server storage unit 32. It is a figure which shows an example of the operation | movement flow of the terminal process part 25. FIG. FIG. 7 is a diagram showing an example of an operation flow of the server processing unit 33.

  Hereinafter, a computer according to the present invention, a control method therefor, and a control program therefor 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 invention described in the claims and the equivalents thereof.

  This computer provides a game of a real-time strategy that progresses by placing objects in a common game space among a plurality of players. The computer sets a weight to each object, and sets a threshold (for example, an upper limit value) within the range of the drawing restriction by the terminal spec to the total value of the weight 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. Do. That is, the threshold value of the weight of the object and the total value are shared among a plurality of players who play simultaneously. In this way, this computer allows a plurality of players to play the game simultaneously within the range of the drawing restriction due to the terminal specs, and allows each player to think about which objects should be arranged within the restriction range. Thus, it is intended to convert the drawing restriction into the fun of the game (game characteristics).

  The computer may be, for example, a portable terminal, a stationary terminal, a server, etc. as long as the above procedure can be executed.

  In the following, as an example of the above-described computer-implemented game, each player places an object such as a large number of soldiers on a field map, which is a game space common to a plurality of players, to capture enemy positions. Explain the game to be played. However, the game of the present invention is not limited to a specific one as long as the game progresses by arranging an object in the game space. An object is digital content placed (drawn) in the game space, and is not limited to soldiers, but other characters in the game, facilities placed in the game space, cards, figures, avatars, etc. It may be an item or the like.

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

  The portable terminal 2 receives an operation by the player. In addition, the server 3 controls the progress of a game played by a plurality of players on their portable terminals 2. The mobile terminal 2 and the server 3 are mutually connected via a communication network such as, for example, a base station 4, a mobile communication network 5, a gateway 6, and the Internet 7. The program executed by the mobile terminal 2 (for example, a game program) and the program executed by the server 3 (for example, a game management program) are UDP (User Datagram Protocol), Hypertext Transfer Protocol (HTTP), and HTTP Communication is performed using a communication protocol such as TCP (Transport Control Protocol). In particular, while the game is in progress, the portable terminal 2 and the server 3 constantly communicate via the communication network.

  Although a multi-function mobile phone (so-called "smart phone") is assumed as the mobile terminal 2, the present invention is not limited to this. The portable terminal 2 may be applicable to the present invention, for example, a portable telephone (so-called "feature phone"), a portable information terminal (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 portable 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 portable terminal 2 to a wireless communication network. The terminal communication unit 21 establishes a communication signal line according to LTE (Long Term Evolution), CDMA (Code Division Multiple Access), etc. with the base station 4 via the channel allocated 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 an operating system program, a driver program, an application program, 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 for controlling the operation unit 23, an output device driver program for controlling the display unit 24, and the like. In addition, the terminal storage unit 22 stores a game program or the like that causes a game to progress and displays the result as an application program. In addition, the terminal storage unit 22 stores, as data, a player identification number (ID), a map table (FIG. 3A) that manages a field map (hereinafter simply referred to as a “map”) as a game space, The enemy character table (Figure 3 (b)) which manages the enemy characters and the like, the soldier table (Figure 3 (c)) which manages the soldiers and the like used by the player, objects such as enemy characters and soldiers and the like The image data, the video data, etc. are stored. Furthermore, the terminal storage unit 22 may store temporary data related to a predetermined process.

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

  FIG. 3A shows an example of a map table for managing maps. The map table includes a map ID for identifying the map, a file name of the corresponding image data, a level indicating the degree of difficulty of the map, and a cost upper limit indicating the upper limit of the weight of the object that can be placed on the map. In addition, enemy character IDs corresponding to each enemy character arranged on the map, their arrangement positions and the like are stored. Hereinafter, the weight set to the object is also referred to as “arrangement cost”.

  Note that in this game, the map is configured in a grid, and each object is placed on any grid, and its position is represented by grid coordinates whose origin is a predetermined grid (for example, the upper left of the map) Shall be However, the configuration of the game space (map) may be any as long as the present invention is applicable.

  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 enemy character IDs for identifying enemy characters, types of enemy characters, file names of corresponding image data, levels indicating strength of enemy characters, 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 on the enemy position.

  FIG. 3C shows an example of a soldier table that manages soldiers and the like used by the player. The soldier table stores a soldier ID for identifying a soldier, a file name of corresponding image data, a level indicating the strength of the soldier, a placement cost which is a weight of an object set per one soldier, and the like. Ru.

  The operation unit 23 may be any device as long as the mobile terminal 2 can be operated, and is, for example, a touch panel, a key button, or the like. The player can use the operation unit 23 to input characters, numbers, symbols, and the like. When 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 an instruction of the player.

  The display unit 24 may also be any device as long as it can display an image, an image or 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 according to the image data supplied from the terminal processing unit 25, a video according to the video data, and the like.

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

  FIG. 4A, FIG. 4B and FIG. 5A to FIG. 5D are diagrams showing an example of a display screen of the portable 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, a number of maps on which the competition game is developed are presented, and the player can select one of them. For example, in FIG. 4A, three maps 201, 202, and 203 are presented, and the player can select any of the maps by operating the corresponding selection buttons 211, 212, and 213. it can. Depending on the map, the level of the enemy character that appears and the size of the map are different, and the difficulty of the capture is also different. Depending on the level of the player, the types of map that can be selected (degree of difficulty) may be changed.

  FIG. 4B shows the game progress screen 300 when one map is selected and the game is started. On this screen, a map 301 on which a competitive game is developed is shown. This map is an enemy position, on which various enemy soldiers or facilities 302 to 306 are arranged as enemy characters according to the map. The purpose of this game is that a plurality of players participating in the game cooperate with each other to arrange an object such as a friendly soldier on the map 301, and capture an enemy's central base (for example, the 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 in which the maps are used as a battle field is started. For the number of players who can play the game on the same map at the same time, an upper limit of, for example, four is set. Then, in this game, for example, an enemy soldier or the like is operated by the computer (server 3), and the computer plays a game with up to four players. Alternatively, the game provided by the game system 1 may be a game in which groups composed of a plurality of players play a match.

  In the game provided by the game system 1, it is possible to establish friend relationships between the players. A player who is in a friend relationship, as will be described later, can, for example, play against the enemy character under advantageous conditions when playing jointly. One player can make friends with a plurality of players. However, an upper limit may be provided to the number of other players who can make a friend relationship with one player.

  FIG. 5A is a schematic view of the game progress screen 300 for explaining the progress of the game. In FIG. 5A to FIG. 5D, the map 311 simplified in a lattice shape is shown for the sake of explanation. On the map 311, for example, four enemy soldiers 312 indicated by "●", facilities 313 such as walls indicated by "▲", and a center base 314 of enemy positions indicated by "■" Is arranged. At the start of the game, the player can, for example, place an allied soldier on the periphery 315 of the map 311, and can also arrange a soldier near the enemy's center base 314 as the capture progresses. Each player arranges a soldier in real time on the map 311 while looking at the same game progress screen 300 displayed on his / her portable terminal 2.

  FIG. 5B is a schematic view of a soldier selection screen 400 when an ally soldier is arranged on the map 311 by the operation of the player. For example, when a player selects the position of arrow A shown in FIG. 5B (if the operation unit 23 is a touch panel, the location of arrow A is touched), the game progress screen of the portable terminal 2 of that player A soldier selection screen 400 is displayed superimposed on 300. On this soldier selection screen 400, the player can select an image 401 of any soldier and perform an operation of arranging the soldier at the position of the arrow A on the map 311. The types of soldiers that each player can arrange may vary depending on the score in the game, such as the level of the player, for example.

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

  FIG.5 (c) is a schematic diagram of the game progress screen 300 when the soldier of the arrangement | positioning cost 30 is selected by a certain player from the state of FIG.5 (b). In the state of FIG. 5 (b), since the total value of the arrangement cost of the soldiers arranged on the map 311 is 0, even if the arrangement cost increases by 30, the upper limit is 100 or less, and the soldiers with the arrangement cost 30 are newly added. Can be placed. For this reason, as shown by the thick frame in FIG. 5C, when a player with a placement cost of 30 is selected by the player, all players who select the same map and play the game in the common game space (map) The soldier is newly disposed at the position of arrow A in FIG. 5B on the game progress screen 300 of the portable terminal 2 of FIG. In FIG. 5 (c), the fact that a friendly soldier has been deployed is indicated by “o” of reference numeral 316.

  Then, as indicated by reference numeral 404, the total value of the current placement costs is 30, as a result of this operation. That is, 30 out of the upper limit 100 is consumed by the fact that one player places one soldier with a placement cost of 30. For this reason, there is a limitation that thereafter all players who select the same map and play the game in the common game space (map) must place soldiers within the range of 100-30 = 70 placement costs. Imposed. However, if an ally's soldier defeats the enemy character and falls down, that soldier's spending on placement cost is eliminated, and an extra soldier can be placed.

  FIG. 5D is a schematic diagram of the game progress screen 300 when the total value of the arrangement cost exceeds the upper limit value when it is intended to newly arrange a soldier. For example, when a plurality of allied soldiers are placed in the area 315, and the total value of the current placement costs reaches 90 as indicated by reference numeral 405, a further placement cost of 30 soldiers is placed at the position of arrow B. Operation is performed by a certain player. In this case, when the soldier is arranged, the total value of the arrangement cost becomes 90 + 30 = 120 and exceeds the upper limit of 100, and thus the soldier is not permitted to be arranged. When attempting to place a soldier beyond the upper limit value of the placement cost, an error message 406, for example, is displayed on the game progress screen 300 of the portable terminal 2 of the player who performed the operation. Alternatively, instead of the error message 406, for example, when the placement is newly made, the image 401 is grayed out for a soldier whose total value of the placement cost exceeds the upper limit, and each player is informed that the soldier can not be placed. May be

  As described above, in the game provided by the game system 1, a total value and an upper limit value of arrangement costs (weights of objects) of soldiers and the like arranged on the map are a plurality of games simultaneously playing the game on the same map. Shared among players. That is, the same threshold value (upper limit value) for the weight of an object is commonly applied to a plurality of players. The 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 affect the drawing processing of the object. A new game can be provided by having a plurality of players think of a strategy on how to place soldiers using the placement cost for which the upper limit is determined.

  Note that the players whose total value and upper limit value are shared may be, for example, all players who have selected the same map. Alternatively, in the case of a game in which a group composed of a plurality of players competes, the player whose total value and upper limit are shared may be the player who selects the same map and belongs to one of the groups, or It may be both a player belonging to a group and a player belonging to another group serving as an opponent.

  In this way, if a plurality of players place enemy allies on the map and capture the enemy position, for example, if the enemy's central base can be captured within the prescribed time limit (within 3 minutes etc.), the player wins. . Conversely, if the enemy's central base can not be captured within the prescribed time limit, the player loses. Alternatively, if the enemy position can be destroyed by a predetermined percentage (for example, 50%) or more within a prescribed time limit (within 3 minutes, etc.), the player may win as if the enemy position could be captured.

  In order to realize the above functions, the terminal processing unit 25 includes a game progression unit 251, an object designation unit 252, and an object placement 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, these units may be mounted on the mobile terminal 2 as firmware.

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

  Specifically, when a map is selected by the player via the operation unit 23, the game progress unit 251 causes the terminal communication unit 21 to make a game start request including the player ID of the player and the map ID of the map. Send to server 3 Then, for example, when the same map is selected by a plurality of players and the 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. Also, the game progress unit 251 extracts enemy character IDs corresponding to each enemy character arranged on the corresponding map and their arrangement positions from the map table. Furthermore, the game progress 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, from the terminal storage unit 22, a map corresponding to the extracted image file name and image data of the enemy character. 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 in accordance with the extracted arrangement position, and outputs it to the display unit 24.

  In addition, when the player instructs to arrange a soldier via the operation unit 23, the game progression unit 251 instructs the object designation unit 252 to execute the process.

  In addition, when receiving an object arrangement instruction from the server 3, the game progression unit 251 instructs the object arrangement unit 253 to execute a process.

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

  The object designating unit 252 receives the soldier table stored in the terminal storage unit 22 using the soldier ID of the soldier selected by the player as a key when the player instructs to arrange the soldier through the operation unit 23. 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.

  In response to the object placement request, when the object placement prohibition notice is received as a response from the server 3 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 soldier informs the player that it can not be placed on the map 311.

  The object placement unit 253 receives an object placement instruction including the soldier ID of the target soldier and the placement position from the server 3 by the terminal communication unit 21 in response to the object placement request, the soldier file table corresponding to the soldier ID 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.

  Also, when the object arrangement unit 253 receives an object arrangement instruction from the server 3 by the terminal communication unit 21 in response to an object arrangement request from the portable terminal 2 of another player, the soldier ID included in the object arrangement instruction The image file name corresponding to is extracted from the soldier table. Then, the object placement unit 253 constructs a new game progress screen 300 in which the image data of the soldier is placed at the placement position on the map (that is, the screen is updated) and outputs it to the display unit 24 as described above. .

  In addition, the object placement unit 253 responds when, for example, the terminal communication unit 21 receives an instruction to delete an object from the server 3 in response to a soldier being defeated by a battle between a friendly soldier and an enemy character. To be eliminated 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 portable terminal 2 and 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, or 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, as an application program, a game management program that performs placement control and operation control of objects. In addition, the server storage unit 32 stores, as data, a map table for managing a map (FIG. 7A), an enemy character table for managing enemy characters and the like arranged on the map (FIG. 7B), and the player A soldier table (FIG. 7 (c) for managing soldiers, etc. to be used), a player table for managing players (FIG. 7 (d)), and an intimacy table for managing parameters of intimacy between players (FIG. e) to store image data, video data, etc. relating to objects such as enemy characters and friendly soldiers. Furthermore, the server storage unit 32 may store temporary data related to a predetermined process.

  FIGS. 7A to 7E are diagrams showing an example of the data structure of various tables stored in the server storage unit 32. FIG.

  FIG. 7A shows an example of a map table for managing maps. Similar to the one in FIG. 3A, the map table corresponds to the map ID, the image file name, the level of the map, the upper cost limit for the map, and each enemy character placed on the map. The enemy character IDs and their arrangement positions are stored.

  FIG. 7B shows an example of an enemy character table for managing enemy characters and the like arranged on the map. As in the case of FIG. 3B, the enemy character table stores enemy character IDs, types of enemy characters, image file names, enemy character levels, and the like.

  FIG. 7C shows an example of a soldier table that manages soldiers and the like used by the player. As in the case of FIG. 3C, the soldier table stores a soldier ID, an image file name, a level of the soldier, an arrangement cost for the soldier, and the like.

  FIG. 7D shows an example of a player table for managing players. The player table stores, for each player registered in the game system 1, a player ID of the player, a name, an image file name, a level, a soldier ID of the soldier possessed by the player, the number of persons, and the like.

  FIG. 7E shows an example of an intimacy table that manages parameters of intimacy between players. The closeness is a parameter set for each pair of players, and is set to a higher value, for example, as the set of players who are in a friend relationship with each other and play the game together more often or many times. In the example of FIG. 7E, the pair of the player P01 and the player P02 is not in a friend relationship and has a closeness of 0. The pair of the player P01 and the player P03 is in a friend relationship and has a closeness of five. The pair of the player P02 and the player P03 has a friend relationship, and the time or number of times the game was played together is greater than the pair of the player P02 and the player P03, and the closeness is 10 higher. Thus, in the closeness degree table, parameters of the closeness degree set for each pair of players are stored.

  In the game system 1, as shown in FIGS. 3A to 3C and FIGS. 7A to 7C, the terminal storage unit 22 and the server storage unit 32 have the same map table and enemy. The character table and the soldier table are stored. However, if the terminal processing unit 25 performs control such that the server 3 is inquired of information of these tables as needed, only the server storage unit 32 may store these tables.

  The server processing unit 33 includes one or more processors and their peripheral circuits. The server processing unit 33 is, for example, a CPU, and centrally controls the overall operation of the server 3. 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 a program or the like stored in the server storage unit 32. The server processing unit 33 executes processing based on a program (an operating system program, a driver program, an application program, etc.) stored in the server storage unit 32. In addition, 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 setting unit 332, a total value calculation unit 333, an arrangement availability determination unit 334, and an object control unit 335. Each of these units is a functional module realized by a program executed by a processor included in the server processing unit 33. Alternatively, these units may be implemented on the server 3 as firmware.

  The server control unit 331 controls the operation of the server 3 and appropriately instructs the threshold 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 processing.

  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 sets the server communication unit 31 as 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 setting unit 332 to execute the process using the map ID included in the received game start request as a parameter.

  When an object placement request is received from a certain mobile terminal 2 via the server communication unit 31, the server control unit 331 uses the placement cost included in the received object placement request as a parameter to calculate the total value calculation unit 333, the placement value. It instructs the permission determination unit 334 and the object control unit 335 to execute processing.

  In addition, when placement of the new object is not permitted by the placement possibility determination unit 334, the server control unit 331 notifies the portable terminal 2 of the transmission source of the object placement request of the object placement prohibition via the server communication unit 31. Send In addition, when an object arrangement instruction is given from the object control unit 335, the server control unit 331 selects the same map and makes the portable terminals 2 of all players who play the game in the common game space (map), The object arrangement instruction is transmitted via the server communication unit 31.

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

  When the game is started, the threshold setting unit 332 sets a threshold (for example, an upper limit value) to the total value of the weights of the objects on the map that 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 from the server control unit 331 as a key, and the cost of the corresponding map Extract the upper limit. Then, the threshold setting unit 332 sets the extracted cost upper limit value as the upper limit value of the weight of the object on the target map.

  In the map table, different cost caps are stored according to the level of the map. The value of the cost upper limit is linked to the level of the map (the difficulty of capture). For example, the higher the level of the map, the more the number of enemy characters arranged in the map or the higher the level of the enemy character, and more soldiers are needed to capture. Therefore, in the map table, as the level of the map is higher, a higher value is stored in advance as the upper limit of the cost. Accordingly, the threshold setting unit 332 sets the upper limit value of the weight of the object to be higher as the level of the map becomes higher.

  Alternatively, conversely, the higher the level of the map, the lower the upper limit cost may be stored in the map table. As a result, the higher the map level is, the lower the threshold value setting unit 332 sets the upper limit value of the object weight, and the game may be more difficult.

  In addition, the threshold setting unit 332 may change the upper limit value of the weight of the object in accordance with the closeness between 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 from the server control unit 331 as keys. The parameters of the intimacy set in the corresponding player set are extracted. 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 value of the extracted closeness parameter is higher. For example, the threshold setting unit 332 may change the upper limit value by multiplying the upper limit value by 20% when the total value of the closeness parameter values is doubled, or by multiplying the coefficient according to the closeness parameter. As a result, when the players in a friend relationship play, the game may be advanced under more advantageous conditions, and the player may be prompted 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 closeness parameter is higher, and the player having a friend relationship The game may be more difficult when playing with each other.

  In addition, the threshold setting unit 332 may change the upper limit value of the weight of the object in accordance with the level of the player participating in the game. In this case, for example, the threshold setting unit 332 refers to the player table stored in the server storage unit 32 using the player IDs of all the participants included in the game start request given from the server control unit 331 as keys. Extract the level of each player. Then, for example, the threshold setting unit 332 changes the upper limit value of the object weight 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 20% when the total value of the levels of the players participating in the game is twice as high, or by multiplying the coefficient according to the player level. May be Thus, the game may be advanced under more advantageous conditions as the player with the higher level.

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

  The total value calculation unit 333 calculates a total value of weights of objects currently arranged on a map, which is a game space, when an instruction to arrange a soldier is given by the player. For this purpose, the sum calculation unit 333 sets, for example, an initial value to 0 at the start of the game. 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 arrangement request given from the server control unit 331 as a key, and is set to the corresponding soldier. Extract placement costs. Then, the total value calculation unit 333 adds the value of the extracted placement cost to the previously calculated total value. Also, for example, when a soldier already placed on the map is defeated by the enemy character, the total value calculation unit 333 subtracts the value of the arrangement cost set for the corresponding soldier from the previously calculated total value. Do. That is, when the objects arranged in the game space disappear, the total value calculation unit 333 calculates the total value excluding the weight of the deleted objects. Thus, the sum calculation unit 333 calculates the sum of the weights of the objects currently arranged on the map.

  The arrangement cost may be set in advance also for the enemy characters arranged on the map. Then, the total value calculation unit 333 counts not only the placement cost of allied soldiers arranged by the player, but also the placement cost set for each enemy character on the map as the total value of the object weights, A sum of weights of all objects currently arranged may be calculated.

  Also, the total value calculation unit 333 may change the arrangement cost of the soldiers arranged by the players according to the closeness between the players participating in the game, and calculate the total value of the weights of the objects. In this case, for example, the sum calculation unit 333 changes the arrangement cost set for the target soldier to a lower value as the value of the parameter of the intimacy degree extracted by the threshold setting unit 332 is higher. For example, the total value calculation unit 333 changes the arrangement cost by multiplying the coefficient according to the intimacy parameter, such as lowering the arrangement cost of each soldier by 10% when the total value of the intimacy parameter is twice as high. May be As a result, when the players in a friend relationship play, the game may be advanced under more advantageous conditions, and the player may be prompted to participate in the game or interact with other players.

  Alternatively, conversely, the total value calculation unit 333 changes the arrangement cost of each soldier to a higher value as the value of the parameter of the intimacy extracted by the threshold setting unit 332 is higher, and the players having a friend relationship are The game may be more difficult when playing.

  Also, the total value calculation unit 333 may change the arrangement cost of the soldiers arranged by the player according to the level of the player participating in the game, and calculate the total value of the weights of the objects. In this case, for example, as the level of each player extracted by the threshold setting unit 332 is higher, the total value calculation unit 333 changes the arrangement cost set for the target soldier to a lower value. For example, the total value calculation unit 333 is arranged by multiplying the coefficient according to the player's level, such as lowering the arrangement cost of each soldier by 10% when the total value of the levels of the players participating in the game is doubled. The cost may be changed. Thus, the game may be advanced under more advantageous conditions as the player with the higher level.

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

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

  On the other hand, if the calculated total value of the weights of the objects is larger than the upper limit value, the arrangement possibility determination unit 334 does not permit the arrangement of new objects. At this time, the arrangement availability determination unit 334 gives the server control unit 331 an object arrangement prohibition notification whose destination is the portable terminal 2 that is the transmission source of the object arrangement request.

  An object control unit 335 controls the operation of an object currently arranged on the map. For this purpose, the object control unit 335 sets the soldier ID included in the object arrangement request given from the server control unit 331 and the arrangement position on the map when the arrangement availability determination unit 334 permits the arrangement of the new object. get. Then, the object control unit 335 calculates the movement destination (new arrangement position) according to the passage of time with respect to all the objects currently arranged on the map at constant time intervals. Then, the object control unit 335 selects the same map and makes the soldier ID of each soldier whose destination is the portable terminal 2 of all players who play the game in the common game space (map), and the enemy character of each enemy character An object placement instruction including the ID and their new placement position is provided to the server control unit 331.

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

  FIG. 8A and FIG. 8B are diagrams showing an example of the operation flow of the terminal processing unit 25. As shown in FIG. The operation flow described below is executed mainly by the terminal processing unit 25 in cooperation with each element of the portable terminal 2 based on a program stored in advance in the terminal storage unit 22.

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

  When the player instructs the terminal processing unit 25 to start the game via the operation unit 23, the terminal processing unit 25 starts processing 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 one 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 an instruction to arrange a soldier is given by the player via the operation unit 23 (Yes in Step S108), the game progression unit 251 instructs the object designation unit 252 to execute a process (Step S110). When the process of step S110 is finished, the operation flow returns to step S106. On the other hand, when an instruction to place a soldier is not issued (No in step S108), the operation flow proceeds to step S112.

  Also, the game progress unit 251 receives an object arrangement instruction from the server 3 via the terminal communication unit 21 (step S112). This object arrangement instruction is received at regular intervals. When the object arrangement instruction is received, the game progress unit 251 instructs the object arrangement 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 process is repeated.

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

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

  On the other hand, when receiving an object placement disable notification from the server 3 via the terminal communication unit 21 (Yes in step S124), the object specification unit 252 outputs, for example, an error message to the display unit 24, and the player selects The soldier informs the player that it can not be placed on the map (step S126). On the other hand, when the object placement disabling notification has not been received from the server 3 (No in step S124), the object placement unit 253 causes the game progress screen 300 to be updated to a new soldier placement on the map (step S128). Then, the object designation unit 252 ends the process.

  FIG. 9 is a diagram illustrating an example of an 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 a program stored in advance in the server storage unit 32.

  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 determines the server communication unit as the source of the game start request. A game start instruction is transmitted via 31 (step S202).

  Further, at this time, the server control unit 331 instructs the threshold setting unit 332 to execute the process using the map ID included in the received game start request as a parameter (step S204). In response to this, the threshold setting unit 332 sets a threshold (for example, an upper limit) to 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 The unit 333 is instructed to execute the process (step S208). In response to this, the total value calculation unit 333 calculates the total value of the weights of the objects currently arranged on the map. When the object arrangement 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 availability determination unit 334 to execute the processing, and the placement availability determination unit 334 determines that the total value of the object weights calculated in step S208 is equal to or less than the upper limit value set in step S204. It is determined whether or not (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 arrangement impossible notification to the portable terminal 2 of the transmission source of the object arrangement request via the server communication unit 31. (Step S212). On the other hand, if the total value of the object weights is equal to or less than the upper limit (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 processing, and the object control unit 335 determines the movement destination (new arrangement position) with time for all objects currently arranged on the map. It calculates (step S214). Accordingly, the server control unit 331 selects the same map and sends the soldier ID of each soldier to the portable terminals 2 of all players who play the game in the common game space (map), via the server communication unit 31, An object arrangement instruction including the enemy character ID of each enemy character and the new arrangement position calculated in step S214 is transmitted (step S216). Thereafter, 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 disposed on the map, which is the game space, are shared among a plurality of players who play simultaneously. As a result, a plurality of players can simultaneously play the game within the range of the drawing restriction by the terminal specification, and the drawing restriction is made by making each player think how to arrange the object within the restriction range. It becomes possible to switch to the fun (game nature) of the game.

  A computer program for causing a computer to realize the functions of the terminal processing unit 25 and the server processing unit 33 is recorded in a computer readable recording medium such as a semiconductor recording medium, a magnetic recording medium, or an optical recording medium. It may be provided in the form and installed in the terminal storage unit 22 and the server storage unit 32 from the recording medium using a known setup program or the like.

  It is to be understood that one of ordinary skill in the art can add various changes, substitutions, and alterations thereto without departing from the spirit and scope of the present invention.

DESCRIPTION OF SYMBOLS 1 game system 2 portable 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 arrangement availability determination unit 335 object control unit 4 base station 5 mobile communication network 6 Gateway 7 Internet

Claims (6)

A storage unit for storing a value corresponding to a plurality of common game space to the player are arranged in accordance with an instruction from the player Luo objects and those 該O object, one of the plurality of players A control program of a computer used by a player, the computer comprising:
Setting a predetermined numerical value based on the information on the game space;
A game progress screen showing the game space, displaying a game progress screen common to a terminal device used by another player different from the one player among the plurality of players,
Sum of values corresponding to the designated object by any of said plurality of players, if the the predetermined numerical below, the state in which the object that is specified by any of the plurality of players are arranged Update the game progress screen,
A control program characterized in that it performs.   The computer is further caused to display information of the predetermined numerical value and information of a total value of values corresponding to objects currently arranged in the game space on the game progress screen. The control program according to Item 1. The control program according to claim 1, further causing the computer to execute changing the predetermined numerical value based on a parameter set to the plurality of player sets . The control program according to any one of claims 1 to 3, further causing the computer to execute changing a predetermined numerical value based on a parameter set for each of the plurality of players . A storage unit for storing a value corresponding to a plurality of common game space to the player are arranged in accordance with an instruction from the player Luo objects and those 該O object, one of the plurality of players Control the computer used by the player,
Setting a predetermined numerical value based on the information on the game space;
A game progress screen showing the game space, and displaying a game progress screen common to a terminal device used by another player different from the one player among the plurality of players;
Sum of values corresponding to the designated object by any of said plurality of players, if the the predetermined numerical below, the state in which the object that is specified by any of the plurality of players are arranged Update the game progress screen,
A method characterized in that it makes things happen. A storage unit for storing a value corresponding to a plurality of common game space to the player are arranged in accordance with an instruction from the player Luo objects and those 該O object, one of the plurality of players A computer used by the player ,
A setting unit that sets a predetermined numerical value based on the information on the previous SL game space,
A display unit that displays a game progress screen that is a game progress screen indicating the game space and that is common to a terminal device used by another player different from the one player among the plurality of players;
Sum of values corresponding to the designated object by any of said plurality of players, if the the predetermined numerical below, the state in which the object that is specified by any of the plurality of players are arranged A processing unit that updates the game progress screen;
A computer characterized by having.

Images