JP2017093920A - Program and recording medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To allow one player to change another player playing a common game with the one player during a prescribed period executing the common game.SOLUTION: A program causes a computer to function as: selection means for selecting another player who plays a common game with one player; game progress means for progressing the common game; and reception means that, during a prescribed period of executing the common game and after the one player and the other player play the common game, receives a change request of the other player from the one player. When the reception means receives the change request of the other player from the one player, another player for playing the common game with the one player is selected again.SELECTED DRAWING: Figure 8

Description

  The present invention relates to a program and a recording medium.

  For example, a system is known in which a plurality of users can enjoy a competitive game online via a network. In such a system, battle result information is generated on the basis of game result information played by a plurality of users who are battle opponents within a predetermined battle period, and is notified to the terminals of the respective users. Therefore, each user can increase the willingness to repeatedly play the game until a game result that is surely better than the opponent is obtained during the battle period in order to win the battle (see, for example, Patent Document 1).

Japanese Patent No. 5754664

  In a conventional system in which a plurality of users can enjoy a battle game online via a network, a plurality of users who are opponents for battle are combined by so-called matching processing. Therefore, in the conventional system, there is a problem that a user who is combined with a strong user who has never won by the matching process before the battle period cannot enjoy the battle.

  The present invention has been made in view of the above-described problems, and an object of the present invention is to enable one player to change another player who plays a common game with one player during a predetermined period of playing a common game. .

  In order to solve the above-described problem, the program according to claim 1 of the present application includes a computer for selecting a player for selecting another player who plays a game common to one player, a game progressing unit for proceeding with the common game, It functions as a receiving means for receiving a change request for the other player from the one player after the one player and the other player play the common game during a predetermined period of playing the common game. The selecting means, when the accepting means accepts a change request for the other player from the one player, reselects the other player playing a game in common with the one player. Yes.

  According to the present invention, one player can change another player who plays a common game with one player during a predetermined period of playing a common game.

It is a lineblock diagram of an example of an information processing system concerning this embodiment. It is a hardware block diagram of an example of the computer which concerns on this embodiment. It is a processing block diagram of an example of an information processing system concerning this embodiment. It is an image figure of an example of a main menu screen. It is a flowchart of an example of the process after a play start button is pressed. It is a block diagram of an example of the matching information memorize | stored in the matching information storage part. It is a flowchart of an example of the process after pressing a daily battle screen display button. It is an image figure of an example of a daily battle screen. It is a flowchart of an example of the process which reselects an opponent. It is an image figure of an example of a reset confirmation screen.

Next, embodiments of the present invention will be described in detail. In the present embodiment, an example will be described in which each matched player competes (competes) with the score of a game played during a predetermined period, but is not limited to this content. The present invention can be widely applied to games played in common by one matched player and another player.
[First Embodiment]
<System configuration>
FIG. 1 is a configuration diagram of an example of an information processing system according to the present embodiment. In the information processing system 1 of FIG. 1, one or more client terminals 2 and a game server device 3 are connected via a network 4 such as the Internet.

  The client terminal 2 is a terminal device such as a PC, a smartphone, or a tablet operated by a player, or a terminal device such as a home or business game dedicated device. The game server device 3 performs game management and control performed by the player at the client terminal 2, billing processing within the game, and the like. The information processing system 1 in FIG. 1 is an example, and it is needless to say that there are various system configuration examples depending on applications and purposes. For example, the game server device 3 of FIG. 1 may be configured to be distributed among a plurality of computers.

<Hardware configuration>
<< Client terminal and game server apparatus >>
The client terminal 2 and the game server device 3 in FIG. 1 are realized by, for example, a computer having a hardware configuration shown in FIG. FIG. 2 is a hardware configuration diagram of an example of a computer according to the present embodiment.

  The computer in FIG. 2 includes an input device 501, a display device 502, an external I / F 503, a RAM 504, a ROM 505, a CPU 506, a communication I / F 507, an HDD 508, and the like. Note that the input device 501 and the display device 502 may be connected and used when necessary.

  The input device 501 is a touch panel, operation keys and buttons, a keyboard, a mouse, and the like used by the player to input various signals. The display device 502 is a display such as a liquid crystal or an organic EL that displays a screen. A communication I / F 507 is an interface for connecting a computer to the network 4. Accordingly, the computer can perform data communication via the communication I / F 507.

  The HDD 508 is an example of a non-volatile storage device that stores programs and data. The stored programs and data include an OS that is basic software for controlling the entire computer, and applications that provide various functions on the OS.

  Note that the computer may use a drive device (for example, a solid state drive: SSD) that uses a flash memory as a storage medium instead of the HDD 508.

  The external I / F 503 is an interface with an external device. The external device includes a recording medium 503a. Accordingly, the computer can read and / or write the recording medium 503a via the external I / F 503. Examples of the recording medium 503a include a flexible disk, a CD, a DVD, an SD memory card, and a USB memory.

  The ROM 505 is an example of a nonvolatile semiconductor memory (storage device) that can retain programs and data even when the power is turned off. The ROM 505 stores programs and data such as BIOS, OS settings, and network settings that are executed when the computer is started. The RAM 504 is an example of a volatile semiconductor memory (storage device) that temporarily stores programs and data.

  The CPU 506 is an arithmetic unit that realizes control and functions of the entire computer by reading a program and data from a storage device such as the ROM 505 and the HDD 508 onto the RAM 504 and executing processing.

  The client terminal 2 and the game server device 3 according to the present embodiment can implement various processes as described later by executing a program in a computer having the above-described hardware configuration.

<Software configuration>
A software configuration of the information processing system 1 according to the present embodiment will be described. The information processing system 1 in FIG. 1 is realized by, for example, the processing blocks shown in FIG. FIG. 3 is a processing block diagram of an example of the information processing system according to the present embodiment.

  The game server device 3 of the information processing system 1 implements the communication unit 10, the control unit 12, and the storage unit 14 by executing a program. The control unit 12 includes a game progression unit 20, a matching unit 22, and a reset reception unit 24. The storage unit 14 includes a matching information storage unit 30, a player information storage unit 32, and a game result storage unit 34.

  Further, the client terminal 2 of the information processing system 1 implements an operation receiving unit 50, a control unit 52, a storage unit 54, a communication unit 56, and a screen display unit 58 by executing a program. The control unit 52 includes a play processing unit 60, an operation content transmission unit 62, and a display control unit 64.

  The communication unit 10 of the game server device 3 communicates with the client terminal 2. The control part 12 performs the process regarding a game, and advances a game. The memory | storage part 14 memorize | stores the information regarding a game.

  The game progression unit 20 of the control unit 12 advances the game based on an operation received by the client terminal 2 from the player. The matching unit 22 performs a matching process for combining the player with the opponent player so that the player can play. The reset reception unit 24 receives a request to reset the opponent player from the player after the start of the battle. The matching unit 22 reselects the opponent player based on the request for resetting the opponent player received from the player by the reset receiving unit 24.

  The matching information storage unit 30 of the storage unit 14 stores matching information that associates the opponent player selected by the matching process of the matching unit 22 with the player who plays the game on the client terminal 2. The player information storage unit 32 stores player information related to the player. The game result storage unit 34 stores the game result played by the player on the client terminal 2 in association with the player.

  The operation receiving unit 50 of the client terminal 2 receives an operation from a player who operates the client terminal 2. In addition, the control unit 52 performs processing related to the game in the client terminal 2. The play processing unit 60 of the control unit 52 controls a game played by the player. The play processing unit 60 transmits the game result of the game played by the player to the game server device 3.

  The operation content transmitting unit 62 transmits the operation content received by the operation receiving unit 50 from the player to the game server device 3. The display control unit 64 controls the screen display of the screen display unit 58 according to the progress of the game by the game progress unit 20 of the game server device 3. The storage unit 54 stores information necessary for the client terminal 2. The communication unit 56 communicates with the game server device 3. The screen display unit 58 displays the screen of the client terminal 2 in accordance with control from the control unit 52.

  In the present embodiment, each of the players operating the client terminal 2 has a game result such as a score of a game played during a predetermined period (hereinafter referred to as a battle period) in which the player can play against the opponent player. Play against the player. For example, each player who operates the client terminal 2 repeatedly plays the game during the battle period, and transmits the game result played to the game server device 3. The game progression unit 20 of the game server device 3 stores the game result received from the client terminal 2 in the game result storage unit 34 in association with the identification information (player ID, etc.) of each player.

  When the battle period ends, the game progression unit 20 compares the game result of the player who operates the client terminal 2 with the game result of the opponent player, and determines whether the player who operates the client terminal 2 wins or loses. For example, the game progression unit 20 can determine whether or not the game has been won or lost based on information that can evaluate the game content by the player, such as score, time, and achievement level. The game progression unit 20 notifies the display control unit 64 of the client terminal 2 of the victory or defeat of the player who operates the client terminal 2. The display control unit 64 can notify the player of the victory or defeat of the battle by displaying the win or loss of the player operating the client terminal 2 on the screen display unit 58.

  The control unit 52 of the client terminal 2 receives a page data described in HTML (Hyper Text Markup Language) or a script included in the page data from the game server device 3 and performs a process related to the game. There is. In addition, the control unit 52 of the client terminal 2 has an application type that performs processing related to a game based on an installed application.

<Processing>
In the information processing system 1 in this embodiment, after the game is started, for example, a main menu screen 1000 shown in FIG. 4 is displayed on the client terminal 2. FIG. 4 is an image diagram of an example of the main menu screen. The main menu screen 1000 in FIG. 4 includes a play start button 1002 and a daily battle screen display button 1004. In the following, an example of a battle in which the battle period is one day (hereinafter referred to as a daily battle) will be described.

  A player who operates the client terminal 2 can play by displaying the play screen by pressing the play start button 1002. The client terminal 2 transmits the game result by the player to the game server device 3. In addition, the player operating the client terminal 2 can display a daily battle screen described later by pressing a daily battle screen display button 1004 to check the progress of the daily battle and reset an opponent.

  The daily battle may be, for example, competing for a game result (daily high score) of a common game with a matched opponent player. The start and end of the daily battle may be controlled by the game server device 3, and during the daily battle holding period, the player whose game results are saved and the opponent is selected can check the progress of the daily battle, The opponent can be reset arbitrarily. It should be noted that the opponent may be competing as a play partner of a common game, or may be competing for superiority or inferiority of the play result (score) with each other play partner as another player.

<Processing after pressing the play start button>
FIG. 5 is a flowchart of an example of processing after the play start button is pressed. When the client terminal 2 receives an operation of pressing the play start button 1002 from the player, the process proceeds to step S11, and a play screen on which the player plays the game is displayed. The play screen differs depending on the content of the game played by the player.

  In step S12, the play processing unit 60 of the client terminal 2 causes the player to play. When the play execution by the player ends, the process proceeds to step S13, and the client terminal 2 transmits the game result played by the player to the game server device 3, and stores the game result in the game result storage unit 34.

  In step S14, the game server device 3 determines whether the opponent of the player who has transmitted the game result has been matched based on matching information as shown in FIG. 6, for example. FIG. 6 is a configuration diagram of an example of matching information stored in the matching information storage unit. The matching information in FIG. 6 associates the player who played the game on the client terminal 2 with the opponent player selected by the matching process of the matching unit 22 after the start of the daily battle. Therefore, the game server device 3 can determine whether the opponent of the player who has transmitted the game result has been matched by checking the matching information in FIG.

  If it has been matched, the game server apparatus 3 skips the process of step S15 and proceeds to step S16, displays the main menu screen 1000 of FIG. 4 on the client terminal 2, and ends the process of the flowchart of FIG.

  On the other hand, if not matched, the matching unit 22 of the game server device 3 proceeds to step S15 and selects an opponent of the player who has transmitted the game result. The matching unit 22 associates the player who has transmitted the game result with the selected opponent player and adds it to the matching information in FIG. 6, and then performs the process of step S16.

  In the matching information in FIG. 6, the same player A is associated with the opponents of the players B and C. Thus, in the matching information of FIG. 6, a plurality of players can use the same player as an opponent. In the case where a reward is awarded when the player wins the battle, when both the player B and the player C win the player A, a reward may be given to each of the player B and the player C. By giving a reward to each of the player B and the player C, an unfair state in which a reward is given only to one winner player can be prevented. The matching information in FIG. 6 corresponds to a one-way battle in which the opponents of the players listed in the right column are not limited to the players listed in the left column. In a one-way battle, it is not always necessary to notify the player selected as the opponent that the player has been selected as the opponent of the other player.

  Further, in the process of step S15 for selecting the opponent of the player who has transmitted the game result, for example, the opponent can be selected from the players described in the left column of the matching information in FIG. For example, the matching unit 22 can select a player having a close game result such as a score as an opponent from the players described in the left column of the matching information in FIG. In addition, when selecting an opponent from the players described in the left column of the matching information in FIG. 6, after the start of the daily battle, it is not possible to select the opponent of the player who first transmitted the game result. What is necessary is just to select an opponent by the timing etc. which transmitted the game result.

<Processing after pressing the Daily Battle Screen Display Button>
FIG. 7 is a flowchart of an example of processing after the daily battle screen display button is pressed. When the client terminal 2 receives an operation of pressing the daily battle screen display button 1004 from the player, the client terminal 2 proceeds to step S21 and displays a daily battle screen 1100 as shown in FIG.

  FIG. 8 is an image diagram of an example of the daily battle screen. In the daily battle screen 1100 of FIG. 8, the game result 1102 of the player and the game result 1104 of the opponent are displayed. The game result 1102 of the player and the game result 1104 of the opponent display the progress of the daily battle. The game result 1102 of the player and the game result 1104 of the opponent are stored in the game result storage unit 34. Accordingly, the progress of the daily battle can be generated by the control unit 12 of the game server device 3 based on the game result 1102 of the player stored in the game result storage unit 34 and the game result 1104 of the opponent. The progress of the daily battle may be generated by the control unit 52 of the client terminal 2 when the client terminal 2 receives the opponent game result 1104 from the game server device 3, for example.

  The daily battle screen 1100 is provided with a reset button 1106 for resetting an opponent and a return button 1108 for returning to the main menu screen 1000.

  The game result 1102 of the player includes information such as the player name, the last game time, and the daily high score. The opponent's game result 1104 includes information such as the opponent's player name, final game time, and daily high score. The daily high score represents the best game result among the game results played by the player or the opponent during the battle period of the daily battle. Therefore, the player can check the progress of the daily battle on the daily battle screen 1100. The daily battle screen 1100 includes the final game time in the game result 1102 of the player and the game result 1104 of the opponent. Therefore, the player can confirm that the opponent is playing by updating the last game time included in the game result 1104 of the opponent.

  For example, when the last game time is updated without updating the daily high score included in the game result 1104 of the opponent, the player can determine that the opponent cannot update the daily high score.

  Moreover, in this embodiment, an opponent can be reset by payment of consideration. You need to pay for resetting (changing) your opponent, which improves your strategy. Two types of reset buttons 1106 are provided on the daily battle screen 1100 of FIG. The reset button 1106A on the left is a button for the player to request resetting of the opponent player with a price of “Δ × 5”. Further, the reset button 1106B on the right side is a button for the player to request resetting of the opponent player at a price of “Δ × 10”. For example, “Δ” is the in-game currency, and “Δ × 10” of the reset button 1106B indicates that 10 in-game currencies are necessary. Accordingly, the reset button 1106B requires more consideration than the reset button 1106A that requires five “Δ”. The in-game currency may be given according to the play result of the game, or may be in a form that can be purchased by the player with a charge.

  For example, the matching unit 22 makes the opponent that is reselected by pressing the reset button 1106B more advantageous than the opponent that is reselected by pressing the reset button 1106A in FIG. You can select an opponent according to the price, such as selecting a weak opponent.

  When the pressing of the reset button 1106A or 1106B in FIG. 8 is accepted from the player in step S22, the matching unit 22 of the game server device 3 performs a process of reselecting the opponent in step S23, for example, as shown in FIG. If it is not accepted from the player in step S22 that the reset button 1106A or 1106B in FIG. 8 is pressed, the process in step S23 is skipped.

  FIG. 9 is a flowchart of an example of processing for reselecting an opponent. When the reset button 1106A or 1106B in FIG. 8 is pressed by the player, the process proceeds to step S31, where the client terminal 2 displays a reset confirmation screen 1200 as shown in FIG. 10, and accepts a final reset instruction from the player.

  The player gives a final instruction to reset the opponent by pressing the “Yes” button 1202 on the reset confirmation screen 1200. Note that the player does not give a final instruction to reset the opponent by pressing the “No” button 1204 on the reset confirmation screen 1200. When the player gives a final instruction to reset the opponent, the matching unit 22 resets the current opponent in step S33 and selects another opponent. The matching unit 22 updates the matching information in the matching information storage unit 30 with the reselected opponent.

  In step S34, the client terminal 2 displays a daily battle screen 1100 on which the opponent game result 1104 selected in step S33 is displayed. If there is no final instruction to reset the opponent from the player, the matching unit 22 skips the process of step S33 and displays the original daily battle screen 1100. In this way, the player can cancel the opponent reset itself, or reselect a reset button 1106 having a different required value.

  Returning to FIG. 7, when the player presses down the return button 1108 in FIG. 8 in step S24, the client terminal 2 returns to the display of the main menu screen 1000 shown in FIG.

  Thus, according to the information processing system 1 according to the present embodiment, the player can request the opponent to be reset during the battle period of the daily battle. For example, the player can confirm the progress of the daily battle, and can change the opponent by consideration such as billing when the situation is unfavorable. In particular, in the case of a daily battle in which the reward obtained by the number of consecutive wins of the daily battle is improved, the player can select to increase the number of consecutive wins by changing to an opponent who is likely to win at a price.

  Since the above embodiment is a one-way battle, even if the opponent is reset, it does not affect the opponent player who has played until then. Therefore, each player can freely reset the opponent. For example, in FIG. 6, since player A is playing against player D and player D is playing against player B, changing player A's opponent to a player other than player D will not affect player D. One-way battle includes a form in which the opponent does not notify the battle execution itself. Therefore, this also applies to the case where the two players are in a state of fighting each other. Specifically, the player A and the player D are in a state of fighting with each other, the player A knows which player the player D is fighting against, and the player D knows which player the player A is fighting against. The state is not recognized. From this state, even if the opponent of player A changes from player D to player B due to the reset of the opponent, player D can continue to compete with player A for the daily high score. The player D can be rewarded based on the result of the battle with the player A regardless of the change of the opponent of the player A.

  Note that the information processing system 1 according to the present embodiment can also handle matching information corresponding to a two-way battle as matching information stored in the matching information storage unit 30. In the matching information corresponding to the two-way battle, the player described as the opponent in the right column also recognizes the player described in the left column as the opponent. Therefore, it is conceivable that a player who is in an unfavorable situation in a two-way battle will lose the opponent's player by resetting the opponent. Therefore, in a two-way match, the player who has been reset by the opponent's player is treated as a non-win, the reward is given, or the opponent who is weaker than the reset player is matched. Do not.

  Further, in the information processing system 1 according to the present embodiment, the strength of the opponent selected in the matching process varies depending on the degree of consideration for the player such as billing. For example, the matching unit 22 selects a weaker player as the opponent as the consideration such as billing for the player increases. Therefore, the player needs to determine whether or not to reset the opponent even if paying the price, considering the balance between the price for resetting the opponent and the reward obtained by winning the opponent in a daily battle. This will improve the game performance.

  Furthermore, in the case of a daily battle in which the stronger the opponent is, the better the reward obtained by winning is, the player may desire a strong player from the opponent even if paying the price. The information processing system 1 according to the present embodiment is not limited to the one that selects a weak player as an opponent according to the price paid by the player, and may be any one that selects an opponent desired by the player, such as a strong opponent. .

  According to the information processing system 1 of the present embodiment, after the start of the battle period, the matched opponent can be reset by a request from the player. Note that, when a matched opponent is reset by a request from the player, it is desirable that the player who has requested resetting pays a fee such as billing, but it is not necessary to pay the fee.

  Furthermore, the information processing system 1 of the present embodiment described above can be applied to a game in which matched players perform some work in cooperation during a predetermined period. For example, the player can confirm the progress of some work during a predetermined period, and can change the cooperation partner when the work of the cooperation partner player is not progressing as expected. The cooperation state between players can be applied to both one-way and two-way forms.

(Other embodiments)
The information processing system 1 according to the present embodiment described above is a game in which matched players play against each other with a score of a game played during the battle period. The information processing system 1 according to the present embodiment can match a common character such as an event character and each player with a score of a game performed during the battle period.

  In such a case, since a common character such as an event character is controlled by a predetermined processing routine, the game result tends to be uniform, and there is a possibility that the battle will be boring. Therefore, the information processing system 1 according to the present embodiment treats the game result of the player selected by the above-described matching process as the game result of a common character such as an event character.

  By treating the game result of the player selected by the above-described matching process as the game result of a common character such as an event character, the update width and update timing of the daily high score are patterned in the information processing system 1 of this embodiment. The game result of the common character is not uniform. Since a common character name such as an event character is displayed as an opponent on the daily battle screen 1100, it can be expected that the player thinks that the game result of the event character is controlled by an advanced processing routine. In addition, since a common character name such as an event character is displayed on the daily battle screen 1100 as an opponent, in the information processing system 1 of this embodiment, it is estimated which player the game result of the opponent is. I can't do it. By doing in this way, the information processing system 1 of this embodiment can prevent the player who used the game result as the game result of the event character from being disgusted by other players who have played against the event character.

  The game may be performed by arbitrarily selecting a player character from among a plurality of characters that can be selected by the player. The event character may be a character that the player cannot select as a player character, or may be a character that can be selected as a player character. When the character can be selected as the player character, the display form may be changed to hide the player character and indicate the event character. For example, when the character is not an event character, a player name or a player image may be displayed. In the case of an event character, the character name may be displayed without displaying the player name, or the character image may be displayed without displaying the player image.

  Matching with an event character may be realized with a predetermined probability during a daily battle period, for example. Not limited to this, it is realized when a specific condition is satisfied, such as when the player has obtained a daily score of a predetermined value or more, when the number of plays reaches the specified number of times, or when the play date and the last two digits of the player ID match. May be.

  The present invention is not limited to the specifically disclosed embodiments, and various modifications and changes can be made without departing from the scope of the claims.

DESCRIPTION OF SYMBOLS 1 Information processing system 2 Client terminal 3 Game server apparatus 4 Network 10, 56 Communication part 12, 52 Control part 14, 54 Storage part 20 Game progress part 22 Matching part 24 Reset reception part 30 Matching information storage part 32 Player information storage part 34 Game result storage unit 50 Operation reception unit 58 Screen display unit 60 Play processing unit 62 Operation content transmission unit 64 Display control unit 501 Input device 502 Display device 503 External I / F
503a Recording medium 504 RAM
505 ROM
506 CPU
507 Communication I / F
508 HDD
1000 Main Menu Screen 1100 Daily Battle Screen 1102 Player Game Result 1104 Opponent Game Result 1106 Reset Button 1200 Reset Confirmation Screen B Bus

In order to solve the above-described problem, the program according to claim 1 of the present application calculates a result of a game played by one player during a predetermined period and a result of a game played by another player during the predetermined period. compared after a period, the computer to evaluate the game result of the one player, selection means for selecting the other player to compete the game result and the one player, thereby pre proceed Kige over arm game progress means, between before Kisho periodically, a change request of the other players to compete with the one player, accepting means for accepting from said one player, to function as the selection unit, the receiving unit is the one When the player receives a change request of the other player, as characterized by reselecting the other player to compete the game result and the one player That.

In order to solve the above-described problem, the program according to claim 1 of the present application calculates a result of a game played by one player during a predetermined period and a result of a game played by another player during the predetermined period. compared after a period, the computer to evaluate the game result of the one player, selection means for the one player selects the other player to compete the game result in one-way, to advance the game A game advancing means that functions as accepting means for accepting, from the one player, a change request for the other player that the one player competes in one direction during the predetermined period; and from one player accepts a change request of the other player, select the other player the one player compete for the game results in a one-way It is characterized in that again.

Claims (8)

Computer
Selection means for selecting another player who plays a game in common with one player;
A game progression means for advancing the common game;
Receiving means for receiving a change request of the other player from the one player after the one player and the other player have played the common game during a predetermined period of playing the common game;
Function as
The selection means, when the accepting means accepts a change request for the other player from the one player, reselects the other player playing a game in common with the one player. program. The selection means presents the game result of the selected other player as the game result of the common character to the one player when a plurality of the one players play the common game with the common character. The program according to claim 1, wherein: Said computer further
Game result storage means for storing a game result of the one player and a game result of the other player in the common game during the predetermined period;
Generating means for generating progress information of the game results of the one player and the other player based on the game result of the one player and the game result of the other player of the common game during the predetermined period;
3. The program according to claim 1, wherein the program is made to function as: The program according to any one of claims 1 to 3, wherein the game progressing unit advances a game in which the one player and the other player battle each other. The game progress means evaluates the game result of the one player based on a comparison between a game result of the one player of the common game and a game result of the other player during the predetermined period. The program according to any one of claims 1 to 4, characterized in that: The program according to any one of claims 1 to 5, wherein the accepting unit accepts the change request based on payment of a consideration by the one player. The program according to claim 6, wherein the selection unit selects the other player according to a degree of payment of the consideration by the one player received by the reception unit.   A computer-readable recording medium on which the program according to any one of claims 1 to 7 is recorded.

Images