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

Description

The present invention relates to control programs, control methods and computers.

In recent years, servers that provide games to mobile terminals via communication networks have become widespread. As a game provided by such a server, a game in which a plurality of players can participate (so-called "social game") is known. Games provided as social games include competitive games in which players play against each other.

Patent Document 1 discloses a game control device that executes a battle game including a battle element between players. In this battle game, the ability value of the player character is updated automatically based on the battle result or in response to the operation of the player on the communication terminal.

Japanese Unexamined Patent Publication No. 2014-133151

In the battle game as described above, since the ability value of the player character is updated based on the battle result, the player can be attracted to the battle game. However, in such a competitive game, the method of determining the updated ability value becomes monotonous, which may discourage the player from continuing to play the game.

The present invention has been made to solve such a problem, and is a control method, a computer, and a control method that enables players to maintain and improve their motivation to play a game in a competitive game in which players play against each other. The purpose is to provide a control program.

The control program according to the present invention is a control program of a computer having a storage unit and executing a battle game, and the storage unit stores battle results and counters for each combination of at least two players who have played against each other. , A match between at least two players, and if the winning player of at least two players in the match is defeated by the defeated player in the previous match, then at least two players in the match The counter related to the combination of the above is increased, points are determined based on the counters, and the computer is made to execute to store the determined points in the storage unit in association with the winning player.
The computer may be a mobile terminal, a stationary terminal, a server, or the like as long as the above procedure can be executed.

Further, in the control program according to the present invention, the computer further has an output unit, and before the execution of the battle, each player displays the player who has been defeated in the previous battle so as to be able to play, and each player can play. It is preferable to output the display data for displaying the game screen on the terminal of each player, which does not display the winning player in the previous battle in a battleable manner, to the output unit.

Further, in the control program according to the present invention, it is preferable to calculate the parameters related to the battle of each player based on the points given to each player in the execution of the battle.

Further, in the control program according to the present invention, the second point is stored in the storage unit in association with either one of the winning or defeated players among at least two players who have played against each other, and in executing the battle, It is preferable to correct the parameters related to the battle of each player based on the second point associated with each player.

Further, in the control program according to the present invention, the parameters related to the battle of each player are calculated based on the parameters of the game medium used by each player in the battle, and the usable conditions are set in the game medium. When a predetermined condition is satisfied, it is preferable to set different usable conditions of the game medium.

Further, in the control program according to the present invention, it is preferable to provide each player with a means for reducing the parameters when the parameters related to the battle of each player become equal to or more than a predetermined value.

Further, in the control program according to the present invention, the storage unit further stores the related players related to each player, and in the increase of the counter, the related player related to the winning player among at least two players who have played against each other. When the player is defeated by the defeated player in the previous match, it is preferable to increase the counter related to the combination of the related player and the defeated player.

Further, in the control program according to the present invention, in determining points, the winning player is the winning player whose time has elapsed since he was defeated by the defeated player in the previous match, or whose counter is equal to or higher than a predetermined value. It is preferable to correct the points based on the number of such combinations.

Further, in the control program according to the present invention, it is preferable to initialize the counter related to the combination of at least two players who have played against each other when a predetermined time has elapsed from the battle immediately before the at least two players who played against each other. ..

The control method according to the present invention is a control method in a computer having a storage unit and executing a battle game, and the storage unit stores battle results and counters for each combination of at least two players who have played against each other. , A match between at least two players, and if the winning player of at least two players in the match is defeated by the defeated player in the previous match, then at least two players in the match This includes increasing the counter related to the combination of the above, determining points based on the counter, and giving the determined points by storing them in the storage unit in association with the winning player.

The computer according to the present invention is a computer that executes a battle game, and for each combination of at least two players who have played a battle, a storage unit that stores a battle result and a counter and a battle between at least two players can be played. If the winning player out of at least two players who have executed and played is defeated by the defeated player in the previous match, the match execution increases the counter related to the combination of at least two players involved in the match. It is provided with a unit and an association unit that determines points based on a counter and stores the determined points in a storage unit in association with the winning player.

The control method, computer, and control program according to the present invention change the points given to a winning player in a battle game in which players play against each other according to the number of times each player wins after being defeated by the opponent player. This makes it possible to improve the strategy for obtaining points in the competitive game and maintain / improve the motivation of the player to play the game.

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 schematic diagram for explaining a battle game. (A) to (d) are diagrams showing an example of the display screen of the mobile terminal 2. (A) to (d) are diagrams showing an example of the display screen of the mobile terminal 2. (A) to (d) are diagrams showing an example of the display screen of the mobile terminal 2. It is a figure which shows an example of the schematic structure of a server 3. (A) is a diagram showing an example of a player table, (b) is a diagram showing an example of a battle information table, and (c) is a diagram showing an example of a group table. It is a figure which shows an example of the operation sequence of the game system 1. It is a figure which shows an example of the operation flow of a battle process.

Hereinafter, various embodiments of the present invention 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.

1. 1. Outline of the present embodiment In the game system of the present embodiment, the player plays a game provided by the server using a mobile terminal. The server equips each character possessed by each player with a weapon and executes a battle game in which each character plays against each other.

The character and the weapon equipped by the character are an example of the game medium used by each player in the battle. The game medium is electronic data used in a game, and includes, for example, cards, items, characters, avatars, and the like. Further, the game medium is electronic data that can be acquired, owned, used, managed, exchanged, synthesized, strengthened, sold, discarded, and / or gifted by the player in the game according to the progress of the game. The usage mode of the game medium is not limited to that specified in the present specification.

Each weapon equipped by the character has parameters used in the battle. The parameters used in the battle are, for example, attack power, defense power, physical strength (or HP (hit points)), attributes (for example, fire, water, thunder, etc.), rarity (for example, normal, rare, S (super). ) Rare, SS (Double Super) Rare, SSS (Triple Super) Rare, Legend, etc.), Skill (Special Effects) Activation Rate, Attack Speed (Number of Attacks in One Turn, Number of Turns to Attack, etc.), Pair Battle The number of defenses in.

In this battle game, victory or defeat is determined based on a predetermined battle logic. For example, in this battle game, victory or defeat is determined based on the parameters related to the battle of each character. The parameters related to the battle of each character are one or more parameters that each character has, one or more weapons that each character has, or each parameter that each character has and a weapon that each character has. It is calculated from the combination of each parameter of. The parameter possessed by each character or each weapon (item) means the parameter associated with each character or each weapon. In the following, a battle game in which the parameters related to the battle of each player are calculated based on the parameters of the weapons equipped by each character and the victory or defeat is determined based on the calculated parameters will be described as an example.

In addition, a specific point is given to the winning player. The parameters of each weapon are enhanced by the points granted. That is, the player can strengthen the weapon by defeating the other player, and the more the player defeats the other player, the stronger the weapon becomes. Further, in this battle game, the points given to the winning player are determined by the number of times each player wins after being defeated by the opponent player. In order to increase the points awarded, each player needs to play against other players alternately and with different wins and losses. Each player will work hard with each other so as to win the defeated player, and the battle game will be activated. As a result, in the competitive game, the strategic nature for obtaining points is improved, and the motivation of the player to play the game is maintained and improved.

2. 2. Configuration of Game System 1 FIG. 1 is a diagram showing an example of a schematic configuration of game system 1.

The game system 1 includes at least one mobile terminal 2 and a server 3. The mobile terminal 2 and the server 3 are connected to each other via 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 browsing program) and the program executed on the server 3 (for example, a game program) use a communication protocol such as Hypertext Transfer Protocol (HTTP). Communicate.

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 terminal, a tablet. It may be a PC, a notebook PC, or the like.

2.1. Configuration of Mobile Terminal 2 FIG. 2 is a diagram showing an example of a schematic configuration of 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 mobile terminal 2 requests the server 3 to proceed with the game in response to the operation of the operation unit 23 (button or the like) by the player. Further, the mobile terminal 2 receives and displays display data related to the progress of the game from the server 3.

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 wireless signal line with the base station 4 by a CDMA (Code Division Multiple Access) method or the like via a channel assigned by the base station 4, and communicates with the base station 4. Do. 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 communication unit 21 may perform wireless communication with a Wifi (Wireless Fidelity) access point (not shown) by the wireless communication method of the IEEE802.11 standard.

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 program for acquiring and displaying display data related to the progress of the game. The computer program is a terminal storage unit using a known setup program or the like from a computer-readable portable recording medium such as a CD-ROM (compact disk read only memory) or a DVD-ROM (digital versatile disk read only memory). It may be installed on 22. Further, the terminal storage unit 22 stores, as data, a player ID which is identification information of the player of the mobile terminal 2, display data related to the progress of the game, video data, image data, and the like. Further, the terminal storage unit 22 may temporarily store temporary data related to a predetermined process.

The operation unit 23 may be any device as long as the mobile terminal 2 can be operated, and may be, for example, a touch panel, key buttons, or the like. The player can input characters, numbers, symbols, etc. using the operation unit 23. 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 a player's instruction.

The display unit 24 may be any device as long as it can display an image, an image, or the like, and is, for example, a liquid crystal display or an organic EL (Electro-Luminescence) 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 image 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.

2.1.1. Function of Terminal Processing Unit 25 FIG. 3 is a schematic diagram for explaining a battle game provided by the game system 1.

In this battle game, a battle event is held at predetermined intervals, and weapons are given to each player at the start of the battle event. Each player equips each character he owns with a weapon to play against a character owned by another player. In this battle game, a battle between players is executed when one player attacks the other player. The battle is not limited to when one player attacks the other player, but may be executed when either or both players select the action "competition execution". If the match is executed when both players select the action "competition execution", both players may attack each other in the match. The battle result is determined based on the attack power and defense power of the weapon equipped on each player's character. Points are given to the player who wins the battle, and the attack power and defense power of each weapon are strengthened by the points given when each player wins. In the following, the points given to the player who wins the match may be referred to as the given points.

In this battle game, the points given to each player change depending on the number of times one of the two players in the battle wins after being defeated by the other player. In the following, it is called revenge that one of the two players who played against each other executes an attack for the purpose of winning after being defeated by the other player, and the number of times each player who played against each other succeeds in revenge. Sometimes referred to as the number of chains. The number of chains is an example of a counter. Further, in this battle game, at the end of the battle event, each player is given a weapon with enhanced attack power and defense power.

In this battle game, the number of chains increases (for example, +1) when the performer of the battle is different from the performer of the previous battle and the victory or defeat of the previous battle is different from the victory or defeat of the previous battle. For example, it is assumed that the number of chains increases when one player attacks the other player and wins after being attacked by the other player and defeated. Also, the number of chains may be increased when one player attacks the other player and is defeated, and then one player is attacked by the other player and wins.

Even if the executor of the battle is the same as the executor of the previous battle, the number of chains may be increased if the victory or defeat of the previous battle is different from the victory or defeat of the previous battle. In that case, if one player attacks the other player and is defeated, then one player attacks the other player and wins, or after one player is attacked and defeated by the other player, The number of chains also increases when one player is further attacked by the other player and wins.

FIG. 3 shows an example in which player A and player B play against each other. The initial value of the number of chains is [0], and when the player A first attacks the player B and wins, the winning player A is given points [100] (1). Next, when player B attacks player A and wins, the number of chains becomes [1], and the winning player B is given points [110] larger than the points given to player A first. (2). In this state, if player B further attacks player A and wins, the number of chains remains [1], and the winning player B receives the same grant points as the grant points given to player B immediately before [1]. 110] is given (3).

Further, in this state, if the player A attacks the player B and is defeated, the number of chains remains [1], and the defeated player A is not given points (4). On the other hand, when the player A attacks the player B and wins, the number of chains becomes [2], and the winning player A is given points [120] larger than the points given to the player B immediately before. (5).

As described above, in this battle game, the points given to each player change depending on the number of chains between the own player and the opponent player. In order to increase the number of chains, each player has a strategy to fight with a player who has the same strength as himself, a player who frequently plays against himself, etc., and actively other players himself. It will attack the player. Therefore, in a competitive game, it is possible to improve the strategy for the player to obtain the points to be given, and to maintain and improve the motivation of the player to play the game.

FIG. 4A is a diagram showing an example of a home screen displayed on the display unit 24.

The home screen 400 shown in FIG. 4A is displayed at the start of a game or the like. Each screen described below is displayed based on the display data received from the server 3. In the following, the player of the mobile terminal 2 on which each screen is displayed is referred to as an execution player.

On the home screen 400, an attack button 401, a status button 402, a grade button 403, a history button 404, and the like are displayed.

When the attack button 401 is pressed, an attack selection screen for selecting the type of attack is displayed. When the status button 402 is pressed, a status screen for displaying the status of the executing player is displayed. When the grade button 403 is pressed, a grade screen for displaying a list of grades of each player participating in the game is displayed. When the history button 404 is pressed, a history screen for displaying the battle history of the executing player is displayed.

FIG. 4B is a diagram showing an example of an attack selection screen displayed on the display unit 24.

The attack selection screen 410 shown in FIG. 4B is displayed when the attack button 401 is pressed on the home screen 400. On the attack selection screen 410, the first attack button 411, the revenge button 412, the substitute revenge button 413, and the like are displayed. In the following, an attack by an executing player on a player who has not yet won may be referred to as an initial attack. The initial attack includes attacking a player who has not been attacked or attacked by the executing player, or attacking a player who has not been attacked and defeated by the executing player. May be good. In the following, the player targeted for the first attack may be referred to as the player targeted for the first attack. That is, the player targeted for the first attack is a player whose initial value (0) is the number of chains with the executing player.

Further, in this game, each player is classified into a group, and can revenge the defeated player instead of the player belonging to the same group. In the following, performing revenge on a defeated player on behalf of a player belonging to the same group is referred to as a substitute revenge, and a player who has executed a substitute revenge is referred to as a substitute player, and the substitute revenge is executed. A player who belongs to the same group as the substitute player may be referred to as a substitute player. The surrogate player belonging to the group to which the player belongs is an example of a related player related to the player. The surrogate player is not limited to the player belonging to the group to which the player belongs, but other players who have a friendship with the player, the player who rescued the player in the past battle, the player who played in the past, and / or the player who played in the past. It may be a player who belongs to the group.

When the first attack button 411 is pressed, the first attack selection screen for selecting the first attack target player is displayed. When the revenge button 412 is pressed, a revenge selection screen for selecting a player to be revenge is displayed. When the proxy revenge button 413 is pressed, the proxy revenge selection screen for selecting the player to be the target of the proxy revenge is displayed.

FIG. 4C is a diagram showing an example of the initial attack selection screen displayed on the display unit 24.

The first attack selection screen 420 shown in FIG. 4C is displayed when the first attack button 411 is pressed on the attack selection screen 410. On the first attack selection screen 420, the avatar image 421 of each player, the name (player name) 422, the total points 423, the attack button 424, and the like are displayed for each player targeted for the first attack. The first attack selection screen 420 may further display items such as weapons used by each player, parameters thereof, and the like for each player targeted for the first attack.

The total point 423 indicates the total number of points granted to each player so far, and is displayed in a distinctive manner depending on whether the total points are larger or smaller than the total points of the executing player (for example, if the total points are larger than the total points of the executing player, they are underlined. Displayed, bold, red). The attack button 424 is displayed so that the player to be the target of the first attack can be selected. When the attack button 424 is pressed, an attack is executed against the player corresponding to the pressed attack button 424, and a result screen for displaying the result is displayed.

The player targeted for the first attack is automatically selected by the server 3 from the players targeted for the first attack described above. The server 3 selects, as the first attack target player, a player whose grade or level is close to the grade or level of the executing player. For example, the server 3 selects as the first attack target player in order from the player whose total points are close to the total points of the executing player. Alternatively, the server 3 may select as the first attack target player in order from the player whose weapon parameter (attack power or defense power) is close to the parameter of the weapon used by the executing player.

Further, the server 3 may select all the players who satisfy the conditions to be the target of the first attack as the first attack target players, and display the selected players in order of the results or levels close to the results or levels of the executing players. Good.

FIG. 4D is a diagram showing an example of a revenge selection screen displayed on the display unit 24.

The revenge selection screen 430 shown in FIG. 4D is displayed when the revenge button 412 is pressed on the attack selection screen 410. Similar to the initial attack selection screen 420, the revenge selection screen 430 displays each player's avatar image 421, player name 422, grant points 423, attack button 424, etc. for each player to be revenged, and is further defeated. The time 431, the number of chains 432, and the like are displayed.

The defeat time 431 indicates the time when the executing player is attacked by each player and is defeated (relative time from the current time). The number of chains 432 indicates the number of chains between the executing player and each player. When the attack button 424 is pressed, an attack is executed against the player corresponding to the pressed attack button 424, and a result screen for displaying the result is displayed.

As the player to be revenge, the server 3 selects a player who has been attacked and defeated by the executing player and has not yet attacked and won.

FIG. 5A is a diagram showing an example of a proxy revenge selection screen displayed on the display unit 24.

The proxy revenge selection screen 500 shown in FIG. 5A is displayed when the proxy revenge button 413 is pressed on the attack selection screen 410. Similar to the revenge selection screen 430, the proxy revenge selection screen 500 has an avatar image 421, a player name 422, a grant point 423, an attack button 424, a defeat time 431, and a chain for each player who is the target of the proxy revenge. The number 432 and the like are displayed.

The defeat time 431 indicates the time when the surrogate player is attacked by each player and is defeated (relative time from the current time). The number of chains 432 indicates the number of chains between the substitute player and each player. When the attack button 424 is pressed, an attack is executed against the player corresponding to the pressed attack button 424, and a result screen for displaying the result is displayed.

As the player to be the target of the substitute revenge, the server 3 selects a player who is attacked and defeated by the substitute player, and then the execution player or a player related to the execution player has not yet attacked and won.

The revenge selection screen 430 shown in FIG. 4D and the proxy revenge selection screen 500 shown in FIG. 5A are displayed so that the executing player can select the opponent player to play before the execution of the battle. On the revenge selection screen 430 and the substitute revenge selection screen 500, the player who has lost in the previous battle is displayed so that each player can play, and the player who has won in the previous battle can play. Do not show. That is, since only the players who are the targets of the revenge or the substitute revenge are displayed in a list on the revenge selection screen 430 and the substitute revenge selection screen 500, the executing player is only the player who can increase the number of chains by winning. Can be easily selected, and the convenience of the player can be improved.

FIG. 5B is a diagram showing another example of the proxy revenge selection screen displayed on the display unit 24.

The substitute revenge selection screen 510 shown in FIG. 5B is displayed when the executing player does not belong to the group. On the proxy revenge selection screen 510, the merit 511 obtained when belonging to the group, the button 512 for joining the group, and the like are displayed. When the button 512 is pressed, a group selection screen (not shown) for selecting a group in which the player participates is displayed, and the player can join a specific group.

FIG. 5C is a diagram showing an example of a result screen displayed on the display unit 24.

The result screen 520 shown in FIG. 5C is displayed when the attack button 424 is pressed on the initial attack selection screen 420, the revenge selection screen 430, or the substitute revenge selection screen 500 to execute the attack, and the executing player wins. To. On the result screen 520, the battle result 521, the points granted 522, the number of chains 523, the information 524 regarding the executing player, the information 525 regarding the opponent player who played the battle, and the like are displayed.

On the result screen 520, it is displayed that the match has been won as the match result 521. The award point 522 indicates the award point given by the battle. The number of chains 523 indicates the number of chains after the battle between the executing player and the opponent player. The information 524 about the executing player includes the player name, the item attack power, the correction value and the total attack power, and the information 524 about the opponent player includes the player name, the item defense power, the correction value and the total defense power.

The item attack power indicates the attack power of the item (weapon) used by the attacking player, the correction value indicates the correction value for correcting the item attack power, and the total attack power indicates the item attack power. The value corrected by the correction value is shown. On the other hand, the item defense power indicates the defense power of the item used by the attacked player, the correction value indicates the correction value for correcting the item defense power, and the total defense power indicates the item defense power. The value corrected by the correction value is shown. In this battle game, the battle is executed based on the total attack power of the attacking player and the total defense power of the attacked player. If the total attack power of the attacking player is greater than or equal to the total defense power of the attacking player, the attacking player wins, and the total attack power of the attacking player is the attacked player. If it is less than the total defense power of, the attacked player wins.

FIG. 5D is a diagram showing an example of a result screen displayed on the display unit 24.

The result screen 530 shown in FIG. 5D is displayed when the attack button 424 is pressed on the initial attack selection screen 420, the revenge selection screen 430, or the substitute revenge selection screen 500 to execute the attack, and the executing player is defeated. To. Similar to the result screen 520, the result screen 530 displays the battle result 531, the points granted 532, the number of chains 533, the information 534 regarding the executing player, the information 535 regarding the player who played the battle, and the like.

On the result screen 530, the fact that the match has been defeated is displayed as the match result 531 and the correction value of the executing player in the next match is displayed instead of the number of chains. The other information is the same as the information displayed on the result screen 520.

FIG. 6A is a diagram showing an example of a state screen displayed on the display unit 24.

The state screen 600 shown in FIG. 6A is displayed when the state button 402 is pressed on the home screen 400. The status screen 600 displays the status 601 of the executing player and the like.

The total points, ranking, number of wins, number of defeats, number of revenge, number of surrogate revenge, number of chains, item attack power, item defense power, remaining time, etc. are displayed in the state 601. The ranking is the ranking of the executing player among all the players, which is determined by the size of the total points. The number of wins and the number of defeats are the number of times the executing player wins and loses to another player, respectively. The number of revenge and the number of surrogate revenge are the number of times that the executing player succeeds in revenge and surrogate revenge to another player, respectively. The item attack power and item defense power are the current attack power and defense power of the item used by the executing player. The remaining time is the remaining time of the battle event.

FIG. 6B is a diagram showing an example of a grade screen displayed on the display unit 24.

The grade screen 610 shown in FIG. 6B is displayed when the grade button 403 is pressed on the home screen 400. On the result screen 610, the results of each player participating in the battle event are displayed in a list. On the result screen 610, the rank 611, the player name 612, the total points 613, the avatar image 614, and the like are displayed in the order of the size of the total points of each player.

FIG. 6C is a diagram showing an example of a history screen displayed on the display unit 24.

The history screen 620 shown in FIG. 6C is displayed when the history button 404 is pressed on the home screen 400. On the history screen 620, the battle history 621 and the like of the executing player are displayed. The battle history 621 includes information such as the time of the battle (relative time to the current time), the opponent player, and the battle result. The match result includes information indicating whether the player has won or lost, the opponent player, the first attack, the revenge, or the surrogate revenge.

FIG. 6D is a diagram showing an example of an update information screen displayed on the display unit 24.

The update information screen 630 shown in FIG. 6D is displayed when the executing player logs in to the battle game and starts the battle game. Further, the update information screen 630 may be automatically displayed when the execution player is attacked by another player and the information about the execution player is updated. On the update information screen 630, grant points 631 and update information 632 and the like are displayed.

The grant points 631 is the total number of grant points that have not yet been notified to the executing player. If the defeated and deprived deprived points are larger than the defeated and deprived award points when attacked by another player, the total of the displayed award points will be a negative value. The update information 632 is a battle result that has not yet been notified to the executing player. The update information 632 indicates the time of the battle (relative time to the current time), the opponent player, whether the player has won or lost, whether it is the first attack, the revenge, or the substitute revenge, and the points granted for each battle. Contains information.

The server 3 is a player that determines whether or not each player displayed on the history screen 620 or the update information screen 630 is a player that is the target of revenge or proxy revenge, and is the target of revenge or proxy revenge. In that case, an attack button for executing revenge or proxy revenge may be displayed for the player. As described above, each player needs to repeat victory and defeat in a match against the same player in order to increase the points awarded. Therefore, each player preferentially attacks the most recently defeated player to win. Therefore, for example, on the history screen 620 or the update information screen 630 immediately after the execution player logs in, there is a high possibility that a player who wins immediately before the execution player logs out and loses during the logout is displayed. Therefore, by displaying the attack button on the history screen 620 or the update information screen 630, the executing player can easily identify the player who won immediately before logging out and lost during logging out, and immediately responds to the identified player. Can attack.

In addition, since each player preferentially tries to play against the most recently defeated player in order to win the most recently defeated player, the history screen 620 or the update information screen 630 shows victory and defeat so far. There is a high possibility that the player who has repeated many times is displayed. Therefore, the executing player can also identify the player who has repeatedly won and lost many times by the history screen 620 or the update information screen 630. Therefore, by displaying the attack button on the history screen 620 or the update information screen 630, the executing player can easily select a player who is given a larger number of points to win, which is convenient for the player. Can be improved.

2.1.2. Configuration of Terminal Processing Unit 25 The terminal processing unit 25 includes at least a browsing execution unit 251. The browsing execution unit 251 is a functional module realized by a program executed by a processor included in the terminal processing unit 25. Alternatively, the browsing execution unit 251 may be mounted on the mobile terminal 2 as firmware.

The browsing execution unit 251 acquires and displays display data related to the progress of the game. That is, the browsing execution unit 251 transmits a display data acquisition request related to the progress of the game to the server 3 via the terminal communication unit 21 in response to an instruction from the player. Further, the browsing execution unit 251 receives the corresponding display data from the server 3 via the terminal communication unit 21. The browsing execution unit 251 creates drawing data based on the received display data. That is, the browsing execution unit 251 analyzes the received display data, specifies the control data and the content data, lays out the similarly specified content data based on the specified control data, and creates drawing data. Then, the browsing execution unit 251 outputs the created drawing data to the display unit 24. Further, the browsing execution unit 251 stores each information included in the display data in the terminal storage unit 22 while the communication connection with the server 3 is established.

2.2. Configuration of Server 3 FIG. 7 is a diagram showing an example of a schematic configuration of server 3. 8 (a) to 8 (c) are diagrams showing an example of the data structure of various tables stored in the server storage unit 32.

The server 3 includes a server communication unit 31, a server storage unit 32, and a server processing unit 33. The server 3 advances the game in response to a request from the mobile terminal 2. Further, the server 3 creates display data related to the progress of the game and transmits it to the mobile terminal 2.

The server communication unit 31 is an example of an output unit, 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, 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, as an application program, a game program or the like that advances the game and creates display data related to the result. The computer program may be installed in the terminal storage unit 22 from a computer-readable portable recording medium such as a CD-ROM or a DVD-ROM using a known setup program or the like.

Further, the server storage unit 32 stores as data the player table shown in FIG. 8A, the battle information table shown in FIG. 8B, the group table shown in FIG. 8C, and the like. Further, the server storage unit 32 may temporarily store temporary data related to a predetermined process.

FIG. 8A shows a player table that manages players. For each player, information such as the player's identification number (player ID), password, name, avatar image file name, owned item ID, used item information, total points, and group ID is stored in the player table in association with each other. To.

The owned item ID is identification information of each item owned by the player. The item information used is the item ID, item attack power, and item defense power of the item (weapon) used by the player in the battle. The group ID is identification information of the group to which the player belongs. Item attack power and item defense power are examples of item parameters.

FIG. 8B shows a battle information table that manages information on battles between players. In the battle information table, information such as the player ID of each player, the battle result, the number of chains, the correction value of each player, etc. is displayed for each combination of the two players who have played against each other among the plurality of players participating in the battle event. Is associated and stored.

The battle result indicates the date and time of the battle, the player ID of the attacking player, whether the attacking player has won or lost, and the like for each battle between the two players. The number of chains is the number of chains between two players. The correction value of each player is given, for example, when each player fails to revenge (consecutive defeat) with respect to the opponent player, and when the next battle is performed between the two players, the attack power of each player and / Or it is used to correct the defense power.

FIG. 8C shows a group table in which each player manages each group classified. For each group, the group ID of the group, the player ID of the player belonging to the group, and the like are stored in association with each other in the group table. In this way, the player table and the group table store the players belonging to the group to which each player belongs, that is, the related players related to each player.

2.2.1. Configuration of Server Processing Unit 33 The server processing unit 33 includes a progress control unit 331, a display data creation unit 332, a battle execution unit 333, an association unit 334, and the like. 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 progress control unit 331 controls the start and progress of the game, and appropriately instructs the display data creation unit 332, the battle execution unit 333, and the association unit 334 to execute the process. The progress control unit 331 exchanges necessary data with the mobile terminal 2 via the server communication unit 31.

When the request for each screen described with reference to FIGS. 4 (a) to 6 (d) is received from the mobile terminal 2, the progress control unit 331 has a button for receiving an instruction from the player and character information to be notified to the player. , Create display data for displaying images and the like in a layout corresponding to the screen, or instruct each part, and transmit the data to the mobile terminal 2. Then, when any button is pressed on the screen displayed on the mobile terminal 2 and a request for the next screen corresponding to the button is received from the mobile terminal 2, the progress control unit 331 similarly displays the next screen. The data is created or instructed to each part, and the data is transmitted to the mobile terminal 2.

In particular, when the player performs an operation of starting a game using the mobile terminal 2 or an operation of transitioning to the home screen and a home screen request corresponding to the operation is received from the mobile terminal 2, the progress control unit 331 displays the display. Instruct the data creation unit 332 to create display data for displaying the home screen 400. When the information about the player is updated by an attack or the like from another player after the battle is executed, the display data creation unit 332 updates instead of the display data for displaying the home screen 400. Display data for displaying the information screen 630 may be created. Then, the progress control unit 331 transmits the display data created by the display data creation unit 332 to the mobile terminal 2.

Further, when the attack button 401, the status button 402, the result button 403, or the history button 404 is pressed on the home screen 400 displayed on the mobile terminal 2, the progress control unit 331 displays the attack selection screen on the display data creation unit 332, respectively. Instructs the creation of display data for displaying the 410, the status screen 600, the grade screen 610, or the history screen 620. Then, the progress control unit 331 transmits the display data created by the display data creation unit 332 to the mobile terminal 2.

Similarly, when the first attack button 411 is pressed on the attack selection screen 410 and the corresponding first attack selection screen request is received, the progress control unit 331 displays the first attack selection screen 420 on the display data creation unit 332. Instruct to create display data for. Further, when the revenge button 412 is pressed on the attack selection screen 410 and the corresponding revenge selection screen request is received, the progress control unit 331 displays the display data for displaying the revenge selection screen 430 on the display data creation unit 332. Instruct to create. Further, when the substitute revenge button 413 is pressed on the attack selection screen 410 and the corresponding substitute revenge selection screen request is received, the progress control unit 331 displays the substitute revenge selection screen 500 or 510 on the display data creation unit 332. Instruct to create display data for. Then, the progress control unit 331 transmits the display data created by the display data creation unit 332 to the mobile terminal 2.

Further, when the attack button 424 is pressed on the initial attack selection screen 420, the revenge selection screen 430, or the proxy revenge selection screen 500 displayed on the mobile terminal 2, and the corresponding battle request is received from the mobile terminal 2, the progress control unit 331 instructs the battle execution unit 333 to execute the battle. Then, the progress control unit 331 transmits the display data for displaying the result screen 520 or 530 created by the association unit 334 to the mobile terminal 2. The battle request includes information indicating whether the battle is the first attack, the revenge, or the substitute revenge, and the player IDs of the executing player and the opponent player.

When the progress control unit 331 instructs the display data creation unit 332 to create display data for displaying each screen, the display data creation unit 332 creates display data for displaying the instructed screen and advances the created display data. It is passed to the control unit 331.

In particular, the display data creation unit 332 specifies the player ID of the execution player included in the initial attack selection screen request when the progress control unit 331 instructs the creation of display data for displaying the initial attack selection screen 420. , The total points corresponding to the player ID of the executing player are extracted from the player table. Further, the display data creation unit 332 stores the combination of the player ID of the player whose combination with the player ID of the executing player is not stored and the player ID of the executing player in the battle information table, but in the combination. Identify the player ID of the player that the attacking player has not yet won. The display data creation unit 332 specifies a predetermined number of player IDs in order from the player table in order from the player ID whose total points correspond to the extracted total points among the specified player IDs. The display data creation unit 332 extracts each information such as the player name, image data, and total points corresponding to the specified player ID from the player table, and creates the display data of the initial attack selection screen based on the extracted information. Then, the created display data is passed to the progress control unit 331.

Further, when the progress control unit 331 instructs the display data creation unit 332 to create display data for displaying the revenge selection screen 430, the display data creation unit 332 specifies the player ID of the execution player included in the revenge selection screen request. The display data creation unit 332 specifies the group ID corresponding to the player ID of the executing player from the player table, and extracts the player ID of each related player corresponding to the specified group ID from the group table. The display data creation unit 332 extracts a combination including the player ID of the execution player from the battle information table, and among the extracted combinations, the execution player is attacked and defeated, and then the execution player or any related player The player ID of the opponent player included in the combination that has not won by attacking is specified. Then, the display data creation unit 332 extracts each information such as the player name, image data, and total points corresponding to the player ID of the specified opponent player from the player table, and based on each extracted information, the revenge selection screen is displayed. Display data is created, and the created display data is passed to the progress control unit 331.

Further, the display data creation unit 332 specifies the player ID of the execution player included in the proxy revenge selection screen request when the progress control unit 331 instructs the creation of display data for displaying the proxy revenge selection screen 500. .. The display data creation unit 332 specifies the group ID corresponding to the player ID of the executing player from the player table, and extracts the player ID of each related player corresponding to the specified group ID from the group table. The display data creation unit 332 extracts a combination including the player ID of each of the extracted related players from the battle information table, and among the extracted combinations, each related player is attacked and defeated, and then the execution player or any of them. The player ID of the opponent player included in the combination in which the related player has not attacked and won is specified. The display data creation unit 332 extracts each information such as the player name, image data, and total points corresponding to the player ID of the specified opponent player from the player table, and displays the proxy revenge selection screen based on the extracted information. Data is created, and the created display data is passed to the progress control unit 331.

When the battle execution unit 333 is instructed to execute the battle by the progress control unit 331, the battle execution unit 333 identifies the player IDs of the execution player and the opponent player included in the battle request, and the item information corresponding to the specified player ID in the player table. Extract (item attack power and item defense power). Further, the battle execution unit 333 specifies the number of chains associated with the combination of the execution player and the opponent player and the correction value of each player in the battle information table. The battle execution unit 333 calculates the parameters related to the battle of each player based on the extracted item attack power and item defense power, and corrects the calculated parameters based on the correction value of each specified player. The battle execution unit 333 executes a battle between two players based on the calculated parameters.

The battle execution unit 333 calculates the total attack power by adding the value obtained by multiplying the item attack power of the execution player by the correction value of the execution player to the item attack power as a parameter related to the battle of the execution player. In addition, the battle execution unit 333 calculates the total defense power obtained by adding the value obtained by multiplying the defense power of the opponent player by the correction value of the opponent player to the item defense power as a parameter related to the battle of the opponent player. The correction value of each player is, for example, a unique correction value predetermined for each player's item. The correction value specific to an item is a predetermined value greater than 0 if the item is a special item provided for a battle event, and 0 if it is another item.

Further, if the executing player on the attacking side attacks the opponent player in the past and is defeated, and then attacks and does not win, a second predetermined value larger than 0 may be added to the correction value of the executing player. .. The second predetermined value is added each time the executing player attacks the opponent player and is defeated, and is reset when the executing player attacks the opponent player and wins. The second predetermined value is an example of the second point. In this way, the battle execution unit 333 assigns the second predetermined value to the defeated player by storing it in association with the defeated player, and corrects the parameters related to the battle of that player based on the second predetermined value. To do. As a result, the possibility that the attacking player is continuously defeated is reduced, the revenge is more likely to succeed, and the battle game can be activated.

The second predetermined value may be given to any one of the players who participated in the battle. For example, if the executing player on the attacking side attacks the opponent player in the past and is defeated, and then attacks and does not win, a second predetermined value smaller than 0 may be added to the correction value of the opponent player. In that case, the battle execution unit 333 stores the second predetermined value in association with the winning player, and corrects the parameters related to the battle of that player based on the second predetermined value. In that case, the possibility that the attacked player wins in succession is reduced, the revenge is more likely to succeed, and the battle game can be activated.

Further, a randomly calculated random value may be added or subtracted from the correction value of the executing player on the attacking side and / or the opponent player on the defending side. As a result, it is possible to reduce the possibility that one player will continue to be defeated and not continue the battle game, and to activate the battle game.

The battle execution unit 333 executes a battle between the execution player and the opponent player based on the calculated total attack power of the execution player and the total defense power of the opponent player. The battle execution unit 333 determines that the execution player wins when the total attack power of the execution player is equal to or greater than the total defense power of the opponent player, and when the total attack power of the execution player is less than the total defense power of the opponent player, It is determined that the executing player is defeated.

In addition, the battle execution unit 333 determines whether or not the revenge or the substitute revenge is successful. When the match is revenge, the match execution unit 333 states that the execution player has won, the execution player has been attacked and defeated by the opponent player in the past, and the opponent player has not been attacked and won after that. , Judge that the revenge was successful. On the other hand, the battle execution unit 333 indicates that the execution player is defeated, the execution player is attacked by the opponent player in the past and is not defeated, or even if the opponent player is attacked and defeated in the past, the opponent is subsequently defeated. If the player is attacked and won, it is determined that the revenge was not successful.

It should be noted that the battle execution unit 333 may determine whether or not the revenge has been successful, regardless of whether each of the winning or losing players is an attacking player or an attacked player. Good. In that case, the battle execution unit 333 determines that the revenge was successful if the player who won the battle has been defeated by the defeated player in the past and has not won the defeated player thereafter. On the other hand, the battle execution unit 333 wins the defeated player when the player who won the battle has not been defeated by the defeated player in the past, or even if the defeated player has been defeated in the past. If so, it is determined that the revenge was not successful.

On the other hand, when the battle is a substitute revenge, the battle execution unit 333 is such that the execution player wins, the substitute player has been attacked by the opponent player in the past and is defeated, and then the execution player or any of them. If the related player in the above attacks the opponent player and does not win, it is determined that the substitute revenge is successful. On the other hand, the battle execution unit 333 is defeated when the executing player is defeated, when the substitute player is attacked by the opponent player in the past and is not defeated, or when the substitute player is attacked by the opponent player in the past and is defeated. However, if the executing player or any of the related players subsequently attacks the opponent player and wins, it is determined that the substitute revenge has not succeeded.

When the revenge is successful, the battle execution unit 333 increases (for example, increments (+1)) the number of chains related to the combination of the execution player and the opponent player. On the other hand, when the substitute revenge is successful, the battle execution unit 333 increases the number of chains related to the combination of the substitute player and the opponent player. That is, when the related player related to the player who won the battle is defeated by the defeated player in the previous battle, the battle execution unit 333 determines the number of chains related to the combination of the related player and the defeated player. Increase.

The battle execution unit 333 may change the number of chains related to the combination of the two players who have played against each other when a predetermined time has elapsed from the battle immediately before the two players who played against each other. For example, the battle execution unit 333 initializes the number of chains to 0 when a predetermined time has elapsed from the previous battle. Alternatively, when the predetermined time has elapsed from the previous match, the match execution unit 333 may reduce the number of chains related to the combination of the two players who have played against each other according to the time elapsed from the previous match. As will be described later, the points awarded to the player who wins the match are determined based on the number of chains. Therefore, when the number of chains is initialized or reduced, the points awarded become smaller. Therefore, each player tries to execute the revenge in a shorter period of time so that the number of chains is not initialized or reduced, so that the battle event can be activated.

Further, the battle execution unit 333 may change the predetermined time until the number of chains is changed, or the interval (rate of change with respect to time) for changing the number of chains, depending on the current number of chains. For example, the battle execution unit 333 shortens the predetermined time or the interval for changing the number of chains as the current number of chains increases. As a result, while encouraging each player to participate in the battle game more actively, a beginner player with a small number of chains reduces the willingness to participate in the battle game by reducing the number of chains. Can be suppressed. The beginner player is a player who has just participated in the battle event, for example, a player whose elapsed time from participating in the battle event is within a predetermined time, or a result or level in the battle event such as the number of chains is equal to or less than a predetermined value. Player.

In that case, the display data creation unit 332 is approaching the time when the predetermined time elapses from the immediately preceding match on the revenge selection screen 430 shown in FIG. 4 (d) and the substitute revenge selection screen 500 shown in FIG. 5 (a). The opponent player involved in the battle may be displayed preferentially. For example, the display data creation unit 332 displays each opponent player side by side on the revenge selection screen 430 and the substitute revenge selection screen 500 in the order in which the predetermined time elapses from the immediately preceding match. As a result, each player can preferentially select the opponent player involved in the battle in which the number of chains is likely to be initialized, so that the convenience of the player can be improved.

Further, an upper limit value may be set for the number of chains. As a result, it is possible to prevent players who have multiple accounts from alternately playing against each other for characters corresponding to their own accounts and extremely increasing the number of chains, thereby ensuring fairness among players. it can. When an upper limit value is set for the number of chains, the battle execution unit 333 may change the upper limit value according to the elapsed time from the start of the battle event. For example, the battle execution unit 333 changes the upper limit value so that it becomes larger as the elapsed time from the start of the battle event becomes longer. As a result, each player comes to consider when to execute the revenge, and can improve the strategicity for increasing the number of chains.

The association unit 334 determines the points to be granted based on the number of chains, and grants the determined grant points to the winning player. The association unit 334 stores and grants the granted points in association with the winning player by adding the granted points to the total points associated with the winning player in the player table. The association unit 334 may determine the deprivation points based on the battle result and deprive the defeated player of the determined deprivation points.

When the match is the first attack, the association unit 334 determines a predetermined value as the grant point. The association unit 334 may give points when the executing player who made the first attack wins larger than the points given when the opponent player wins. As a result, each player will actively attack other players, and it will be possible to activate the battle game. Further, the association unit 334 may correct the granted points based on the total points already granted to each player who played against the player. For example, the association unit 334 corrects the granted points so that the higher the total points of the defeated players, the higher the points, and the higher the total points of the winning players, the lower the points. By increasing the points awarded when a strong player is defeated, each player tries to attack a stronger opponent, so that the attacking player is suppressed from unilaterally winning, and the victory or defeat It is possible to maintain the balance.

Further, when the defeated player is deprived of the deprived points, the association unit 334 determines a predetermined value as the deprived points in the same manner as the given points. For example, the association unit 334 determines the deprivation point to a value smaller than the grant point. By setting the deprivation points to be deprived when the player loses the match to a small value, it is possible to suppress a decrease in the motivation of the player for the match. The association unit 334 may correct the deprivation points in the same manner as the grant points. Further, the association unit 334 may not deprive the execution player of the deprivation points when the execution player is defeated, and may deprive the opponent player of the deprivation points only when the opponent player is defeated. As a result, each player will actively attack the other player without fear of being defeated by the other player, and it is possible to activate the battle game.

On the other hand, when the match is a revenge, the association unit 334 determines the grant points and / or the deprivation points in the same manner as when the match is the first attack. However, the association unit 334 determines a value obtained by multiplying a predetermined value by the number of chains related to the combination of the executing player and the opponent player as the grant point and / or the deprivation point. The association unit 334 deprives the grant points and / or deprivation points so that the award points and / or deprivation points when the match is a revenge are smaller than the award points and / or deprivation points when the match is the first attack. You may decide the points. Alternatively, the association unit 334 grants points and / or deprivations so that the award points and / or deprivation points when the match is a revenge are larger than the award points and / or deprivation points when the match is the first attack. You may decide the points.

In addition, the association unit 334 participates in the battle game to determine whether the points granted and / or the deprivation points when the battle is revenge are larger or smaller than the points given and / or the deprivation points when the battle is the first attack. It may be changed according to the number of players playing. For example, when the number of players participating in the battle game is equal to or greater than a predetermined number, the association unit 334 assigns points given when the battle is revenge and / or deprivation points when the battle is the first attack. / Or make it larger than the deprivation point. On the other hand, when the number of players participating in the battle game is less than a predetermined number, the association unit 334 gives points and / or deprivation points when the battle is revenge, and points given when the battle is the first attack. / Or make it smaller than the deprivation point.

Alternatively, when the number of players participating in the battle game is equal to or greater than a predetermined number, the association unit 334 assigns points given when the battle is revenge and / or deprivation points when the battle is the first attack. / Or make it smaller than the deprivation point. On the other hand, when the number of players participating in the battle game is less than a predetermined number, the association unit 334 gives points and / or deprivation points when the battle is revenge, and points given when the battle is the first attack. / Or make it larger than the deprivation point. As a result, the association unit 334 can adjust whether to give priority to each player to execute the first attack or the revenge according to the number of players participating in the battle game, and appropriately balance the game. It becomes possible to set.

In addition, the association unit 334 holds a battle event to determine whether the points granted and / or deprivation points when the battle is revenge are larger or smaller than the points given and / or deprivation points when the battle is the first attack. It may be changed according to the elapsed time since it was made. For example, when the elapsed time from the battle event is less than a predetermined time, the association unit 334 gives points when the battle is revenge and / or points given when the battle is the first attack. And / or make it smaller than the deprivation point. On the other hand, the association unit 334 gives points when the match is a revenge and / or points given when the match is the first attack when the elapsed time from the match event is held is longer than a predetermined time. And / or greater than the deprivation point. As a result, the association unit 334 has a wide and shallow exchange (communication) between the players due to frequent initial attacks in the early stage of the battle event, and frequent revenge in the latter stage of the battle event. It is possible to control so that the interaction between specific players to be revenged is deepened. Further, since the type of interaction between players changes with the passage of time, it is possible to activate communication between players.

Further, when the match is a substitute revenge, the association unit 334 determines the grant points and / or the deprivation points in the same manner as when the match is a revenge. However, the association unit 334 determines a value obtained by multiplying a predetermined value by the number of chains related to the combination of the substitute player and the opponent player as the grant point and / or the deprivation point. Further, the association unit 334 deprives the grant points and / or deprivation points so that the grant points and / or deprivation points when the match is a proxy revenge are smaller than the grant points and / or deprivation points when the match is a revenge. You may decide the points. Alternatively, the association unit 334 grants and / or deprives the points granted and / or deprived points when the match is a surrogate revenge to be greater than the points granted and / or deprived points when the match is a revenge. You may decide the points.

Further, the association unit 334 may determine a value obtained by multiplying another predetermined value by the number of chains as the second grant point, and grant the determined second grant point to the substitute player. For example, the association unit 334 sets the second grant point given to the substitute player to the same value as the grant point given when the substitute player succeeds in revenge, and sets the grant point given to the substitute player to the second. Set a value different from the granted points (for example, a value smaller than the second granted point). By adjusting the grant points given to the substitute player and the second grant points given to the substitute player to different values, it is possible to suppress that only one of the revenge or the substitute revenge is frequently performed, and the game balance. Can be adjusted appropriately. Further, by setting the given points given to the substitute player to a value smaller than the second given points given to the substitute player, the substitute player becomes more thankful to the substitute player, and the activity of communication between the players becomes active. It becomes possible to achieve the conversion.

If the match is a substitute revenge and the defeated opponent player is also the target player of the execution player's revenge, the match execution unit 333 may determine that both the revenge and the substitute revenge have succeeded at the same time. Good. In that case, the battle execution unit 333 increases the number of chains related to the combination of the executing player and the opponent player and the number of chains related to the combination of the substitute player and the opponent player. The association unit 334 assigns grant points to the executing player and the substitute player, respectively. As a result, the executing player can achieve both revenge and surrogate revenge at the same time, and can improve the game quality.

In that case, the association unit 334 may make the ratio of the points given to the executing player and the points given to the substitute player different. For example, the association unit 334 sets the given points given to the executing player to a value larger than the given points given to the substitute player. As a result, the executing player will select a player who can simultaneously achieve the substitute revenge as the opponent player when performing the revenge, and it is possible to activate the substitute revenge. Further, the association unit 334 may determine the ratio of the points to be given to the executing player and the points to be given to the substitute player according to the request from the execution player. As a result, the executing player can decide whether to increase the points given to him / her when the revenge is successful or to increase the points given to the surrogate player, and the strategy in the competitive game can be improved. It is possible to improve.

Further, when parameters such as physical strength are stored for each player and a predetermined cost value is consumed from the physical strength of each player each time each player plays a match, the association unit 334 consumes the match when the match is a proxy revenge. The cost value may be higher than the cost value consumed when the match is the first attack or revenge. As a result, the substitute player becomes more thankful to the substitute player, and it becomes possible to activate communication between the players.

In addition, the association unit 334 may correct the points granted based on the time elapsed from the time when the winning player lost to the defeated player in the previous match. For example, the association unit 334 corrects the given points so that the shorter the elapsed time, the larger the value, and the longer the elapsed time, the smaller the value. As a result, each player tries to execute revenge in a shorter period of time when defeated by another player, so that the battle event can be activated.

Further, the association unit 334 may correct the points to be given based on the number of combinations related to the winning player whose number of chains is equal to or greater than a predetermined value. The association unit 334 corrects the grant points so that the number of combinations related to the winning player increases as the number of combinations having a chain number of a predetermined value or more increases, and decreases as the number of combinations decreases. As a result, each player tries to revenge as many players as possible, so that the battle event can be activated.

In addition, the association unit 334 strengthens the items used by each player in the battle according to the points given to each player. The association unit 334 determines the item attack power and item defense power of the item used by the player so that the higher the total points, the higher the attack power and defense power, according to the total points of the player who has given the grant points. To do. The association unit 334 strengthens each item by updating the item attack power and item defense power associated with each player to the determined item attack power and item defense power in the player table. In this way, the parameters related to the battle of each player are calculated based on the points given to each player.

If the items used by each player in the battle become too strong and they cannot be defeated by other players, they will not be able to revenge from other players, and as a result, they will not be able to revenge to other players. there is a possibility. Therefore, the association unit 334 provides a means for reducing the item attack power and / or the item defense power when the item attack power and / or the item defense power of the item used by each player in the battle exceeds a predetermined value. It may be provided to each player. For example, the association unit 334 stores the item as the possessed item ID in the player table by associating the item ID of the item for reducing the item attack power and / or the item defense power with each player. To provide. The means for reducing the item attack power and / or the item defense power is not limited to the item, and may be, for example, execution of a predetermined event, battle with a predetermined opponent, or the like.

Further, when the predetermined condition is satisfied, the association unit 334 gives each player the item used in the battle so that each player can use it in another event. For example, the server 3 executes the battle event only for a predetermined period, and the association unit 334 grants an item to each player on condition that the execution period of the battle event has elapsed. The association unit 334 assigns an item to each player by generating an item ID of the item corresponding to the used item information associated with each player in the player table and storing it as the owned item ID. In the player table, usable conditions (for example, usable event, usable period, usable area) of each item may be set in association with each item ID. In that case, the association unit 334 sets the usable conditions of each item differently on the condition that the execution period of the battle event has elapsed. Since each player can use the items given as a privilege of the battle event for other events, he / she will be more actively participating in the battle event in order to strengthen the item, and it is possible to activate the battle event. It becomes.

The association unit 334 creates display data for displaying the result screen 520 or 530 according to the battle result, and passes the created display data to the progress control unit 331.

When the execution player wins, the association unit 334 displays display data for displaying the result screen 520 that indicates that the battle has been won, the points granted by the battle, the number of chains, information about the execution player and the opponent player, and the like. To create. On the other hand, when the executing player is defeated, the association unit 334 displays a result screen 530 in which the fact that the execution player has been defeated, the deprivation points deprived by the battle, the correction value in the next battle, the information on the execution player and the opponent player, etc. are arranged. Create display data for display. By displaying the correction value in the next match on the result screen 530, the executing player recognizes that the possibility of winning the opponent player in the next match has improved, and tries to rematch with the opponent player. It is possible to activate the battle event.

FIG. 9 is a diagram showing an example of an operation sequence related to the game processing of the game system 1. This operation sequence collaborates with each element of the mobile terminal 2 and the server 3 mainly by the terminal processing unit 25 and the server processing unit 33 based on the programs stored in the terminal storage unit 22 and the server storage unit 32 in advance. Is executed.

First, when the player presses the first attack button 411, the revenge button 412, or the substitute revenge button 413 using the operation unit 23 while the attack selection screen 410 is displayed on the display unit 24 of the mobile terminal 2, the mobile terminal 2 The browsing execution unit 251 transmits the corresponding selection screen request to the server 3 via the terminal communication unit 21 (step S101). When the progress control unit 331 of the server 3 receives the selection screen request from the mobile terminal 2, the display data creation unit 332 creates the display data of the corresponding selection screen 420, 430 or 500 (step S102). Next, the progress control unit 331 transmits the created display data to the mobile terminal 2 (step S103). When the display data is received from the server 3 via the terminal communication unit 21, the browsing execution unit 251 of the mobile terminal 2 creates drawing data based on the received display data, and the selection screen 420 corresponding to the display unit 24, Display 430 or 500 (step S104).

Next, when the player presses the attack button 424 using the operation unit 23 while the selection screen 420, 430 or 500 is displayed on the display unit 24 of the mobile terminal 2, the viewing execution unit 251 of the mobile terminal 2 displays. The corresponding battle request is transmitted to the server 3 via the terminal communication unit 21 (step S105). When the progress control unit 331 of the server 3 receives the battle request from the mobile terminal 2, the battle execution unit 333 and the association unit 334 execute the battle process (step S106). The details of the battle process will be described later. Next, the association unit 334 creates display data for displaying the result screen 520 or 530 according to the battle result (step S107). Next, the battle execution unit 333 transmits the created display data to the mobile terminal 2 (step S108). When the display data is received from the server 3 via the terminal communication unit 21, the browsing execution unit 251 of the mobile terminal 2 creates drawing data based on the received display data, and displays the result screen 520 or 530 on the display unit 24. Display (step S109). This completes the operation sequence related to the game processing.

FIG. 10 shows an operation flow of the battle processing by the battle execution unit 333 and the association unit 334. The battle process shown in FIG. 10 is executed in step S106 of FIG.

The battle execution unit 333 first identifies the player IDs of the execution player and the opponent player included in the battle request, and extracts each information corresponding to the specified player ID in the player table. Further, the battle execution unit 333 specifies the number of chains associated with the combination of the execution player and the opponent player and the correction value of each player in the battle information table (step S201).

Next, the battle execution unit 333 calculates the parameters related to the battle of each player based on the extracted information, and corrects the calculated parameters based on the correction value of each player (step S202).

Next, the battle execution unit 333 executes a battle between the two players based on the calculated parameters (step S203).

Next, the battle execution unit 333 determines whether or not the revenge or the surrogate revenge is successful (step S204).

If the revenge or proxy revenge is not successful, the battle execution unit 333 shifts the process to step S206. On the other hand, when the revenge or the surrogate revenge is successful, the number of chains related to the combination of the two corresponding players is increased (step S205).

Next, the association unit 334 determines the grant points based on the number of chains (step S206).

Next, the association unit 334 grants the determined grant points to the winning player (step S207).

Next, the association unit 334 strengthens the items used in the battle by each player according to the points given to each player (step S208), and ends a series of steps.

As described above, the server 3 changes the points given to the winning player according to the number of chains in the battle game in which the players play against each other. This makes it possible to improve the strategy for obtaining points in the competitive game and maintain / improve the motivation of the player to play the game.

The present invention is not limited to the present embodiment. For example, each function of the server processing unit 33 described above may be executed by the terminal processing unit 25 of the mobile terminal 2. In this case, if the player table, the battle information table, and the group table are stored in the terminal storage unit 22, it is not necessary to communicate with the server 3 each time the processing is performed, and the above function can be realized only by the mobile terminal 2. It is possible. Further, for example, the game executed on the mobile terminal 2 may be a hybrid game in which the server 3 and the mobile terminal 2 each play a part of the processing. In that case, for example, each screen related to the progress of the game is a web display displayed on the mobile terminal 2 based on the display data generated by the server 3, and the screen used for the battle is a native installed on the mobile terminal 2. Use the native display displayed by the app.

Further, the battle executed by the server 3 may be executed between at least two players, and may be performed between three or more players. In that case, the battle result and the number of chains are stored in the battle information table for each combination of three or more players. The battle execution unit 333 executes a battle between three or more players, and determines whether each player wins or loses. If the winning player is defeated by the defeated player in the previous battle, the battle execution unit 333 determines that the revenge was successful, and increases the number of chains related to the combination of the players who played the battle. The association unit 334 determines the grant points based on the number of chains, and grants the determined grant points to each winning player.

The battle execution unit 333 may determine that the revenge has succeeded and increase the number of chains when all the players win by turns. For example, when three players A, B, and C are participating in the battle game, the battle execution unit 333 indicates that player A wins, then player B wins, and then player C wins. As a condition, it is determined that the revenge is successful, and the number of chains related to the combination of the three players A, B, and C is increased. Alternatively, the battle execution unit 333 may determine that the revenge has succeeded and increase the number of chains on the condition that a specific player and a player other than that player win by turns. For example, when three players A, B, and C are participating in a battle game, it is determined that the revenge is successful on the condition that the player A wins and then the player B or C wins, and the player determines that the revenge is successful. Increase the number of chains related to the combination of A, B, and C.

Further, the server 3 may manage a combination of two people and a combination of three or more people at the same time. For example, when three players A, B, and C are participating in the battle game, the server 3 is a combination of two players A and B, players B and C, and players C and A, and player A. , B and C are managed at the same time. In that case, when the revenge from player A to player B is successful, the battle execution unit 333 determines the number of chains related to the combination of two players A and B and the combination of three players A, B, and C. Increase both the number of such chains. These also make it possible to improve the strategic nature for obtaining points in the competitive game and maintain / improve the motivation of the player to play the game.

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 3 Server 31 Server communication unit 32 Server storage unit 33 Server processing unit 331 Progress control unit 332 Display data creation unit 333 Battle execution unit 334 Association unit

Claims (9)

A computer control program that runs a competitive game between at least two players .
The result of the competition game between at least two players, the combination constituted by at least two players, and the counter associated with the combination, the player points associated with flop Layer storage unit Remember in
When the battle game is over ,
When the battle game immediately before the finished battle game is a battle game between at least two players, and the player who wins the finished battle game is different from the player who won the last battle game. , Increase the counter,
The points are determined based on the counter, and the player points associated with the players who participated in the completed battle game are changed based on the determined points.
A control program characterized by causing the computer to execute the above. The control program according to claim 1, wherein when the player points are changed, the player points associated with the winning player among the players participating in the completed battle game are increased. The control program according to claim 1 or 2, wherein when the player points are changed, the player points associated with the defeated player among the players participating in the completed battle game are reduced. The control program according to any one of claims 1 to 3, wherein the computer is executed to calculate the parameters used by each player in the battle game based on the player points associated with each player. The storage unit stores related players related to each player, and stores the related players.
The related player associated with the player who was defeated in the battle game that was the end, said the participation of at least two players, said the competition game immediately after the end of the competition game, to participate on behalf of the player who was the defeat,
The player who won the competing game that the ends, when the associated player has won the competition game immediately above, increasing the counter, is execution to the computer, to any one of claims 1 to 4 The described control program. Player in the change of the player points, the player who wins at the end of the competition game, the player who was defeated at the end of the competitive game, based on the time elapsed from the time of the defeat in the just before the competition game, and the change The control program according to any one of claims 1 to 5, which corrects points. If at least two players participating in the competition game was the completion of a predetermined time has elapsed since the competition game of the immediately before joined to execute it, to initialize the counter to the computer, according to claim 1 to 6 The control program according to any one of the items. A control method in a computer that executes a competitive game between at least two players .
The result of the competition game between at least two players, the combination constituted by at least two players, and the counter associated with the combination, the player points associated with flop Layer storage unit Remember in
When the battle game is over ,
When the battle game immediately before the finished battle game is a battle game between at least two players, and the player who wins the finished battle game is different from the player who won the last battle game. , Increase the counter,
The points are determined based on the counter, and the player points associated with the players who participated in the completed battle game are changed based on the determined points.
A control method characterized by including. A computer that runs a competitive game between at least two players
Storing results of the competition game between the at least two players, the combination constituted by at least two players, and the counter associated with the combination, the player points associated with flop Layer Memory and
When the battle game is over ,
When the battle game immediately before the finished battle game is a battle game between at least two players, and the player who wins the finished battle game is different from the player who won the last battle game. , Increase the counter,
A processing unit that determines points based on the counter and changes the player points associated with the player who participated in the completed battle game based on the determined points.
A computer characterized by being equipped with.

Images