JP2018089173A - Information processing unit and game program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To cause players having balanced play skills to match each other in a game causing the players to operate a plurality of characters in a game.SOLUTION: A game server is connected to a plurality of game terminals via a communication network. The game server stores player ranks representing a player's level of skill of the game for each player, and stores character ranks representing a level of the skill of a character for each player and each character. When receiving a matching request of designating players and characters that the players use, the game server selects a plurality of players as matching objects on the basis of both of the player ranks and the character ranks of the players and characters designated in the matching request.SELECTED DRAWING: Figure 7

Description

  The present invention relates to a technique for matching players having balanced play skills in a game in which a plurality of players participate simultaneously.

  The use of smartphones as game terminals as well as communication terminals has become common. Network games popular with smartphones are provided by accessing a platform built on a game server from a smartphone. Network games often have content that emphasizes character development, cooperation and battle with other players, and collection of cards and items.

  In network games, a plurality of players often play by sharing the same game world (see Patent Document 1). If a plurality of players can share the same game world, it becomes possible to form a team for cooperating with other players and play against other teams.

JP 2007-229040 A

  In a game in which the player operates only an integrated character, the skill level of the character (hereinafter referred to as “character rank”) and the play skill of the player are substantially the same. For this reason, if the character rank is used as a reference, players with balanced play skills can be matched.

  On the other hand, in a game in which an operation target is selected from a plurality of characters, play skills are not always reflected in the character rank. Since parameters and usable skills that are set for each character are different, when an advanced user uses a character that is not familiar, even if the character rank is low, the play skill is not so low.

  Even if the player is an advanced player, when using an unfamiliar character, his / her skill as a player (hereinafter referred to as “player rank”) may be high, but his / her ability may not be demonstrated. When an advanced player A who uses an unfamiliar character and an advanced player B who uses a familiar character face each other, the advanced player A becomes disadvantageous. As a result, even if a plurality of characters can be selected, it is difficult to select only a specific character.

  The present invention is an invention completed on the basis of the above problem recognition, and its main purpose is a technique for matching players with balanced play skills in a game in which the player operates a plurality of characters in one game, Is to provide.

  An information processing apparatus according to an aspect of the present invention includes a player rank storage unit that stores, for each player, a player rank indicating the skill level of the player's game, and a character that stores a character rank indicating the skill level of the character for each player and character. Matching target based on both a rank storage unit, a matching request receiving unit that receives a matching request specifying a player and a character used by the player, and a player rank and a character rank for the player and character specified in the matching request And a matching processing unit that selects a plurality of players.

  An information processing apparatus according to another aspect of the present invention includes a game control unit that controls the progress of a game, a matching request reception unit that receives matching requests from a plurality of players, and a first game that reflects a game play history. And a plurality of players to be matched based on the second parameter different from the first parameter reflecting the play history of the game by the player.

  According to the present invention, in a game in which a plurality of players participate at the same time, players with balanced play skills can be easily matched.

It is a hardware block diagram of a game system. It is a functional block diagram of a game system. It is a screen figure at the time of a battle | competition. It is a screen figure of a character rank screen. It is a data structure figure of a player rank table. It is a data structure figure of a character rank table. It is a screen figure of a battle determination screen. It is a flowchart which shows a matching process process. It is a flowchart which shows the grouping process process of FIG. It is a flowchart which shows the selection process process of FIG.

  In the present embodiment, a description will be given assuming a game in which a plurality of players participate simultaneously (hereinafter referred to as “game W”). In order to participate in the game W, the player needs to register as a player in the game server.

The game W is a group battle type tower defense game. A plurality of players participate at the same time, are divided into enemy ally, and each captures the opponent's castle. Each player has one or more characters, selects one of the characters, and enters the game W. The victory condition of the game W is to drop the opponent's castle. The minimum number of players participating in the game W at the same time is two to two, and the maximum is four to four. When both troops meet on the siege route, the character's battle begins. The player gives a movement / attack instruction to the character during the battle. The character that wins the battle controls the siege route, and when it reaches the opponent's castle, it becomes a siege battle.
Hereinafter, a mechanism for matching a plurality of players will be mainly described.

FIG. 1 is a hardware configuration diagram of the game system 100.
In the game system 100, a plurality of game terminals 104 a, 104 b, 104 c... 104 n (hereinafter collectively referred to as “game terminal 104” when collectively referred to or not particularly distinguished) with respect to the game server 102. Connected through. The game terminal 104 in the present embodiment is assumed to be a smartphone. The game terminal 104 may be a portable game machine or a general-purpose computer such as a laptop PC. The game terminal 104 and the Internet 106 are wirelessly connected, but may be wired. A unique ID called a player ID is given in advance to the game player. The game server 102 provides a game to each game terminal 104.

FIG. 2 is a functional block diagram of the game system.
As described above, the game system 100 includes the game server 102 and the game terminal 104. Each component of the game terminal 104 and the game server 102 includes an arithmetic unit such as a CPU (Central Processing Unit) and various coprocessors, a storage device such as a memory and a storage, and hardware including a wired or wireless communication line connecting them. This is realized by software that is stored in a storage device and supplies processing instructions to an arithmetic unit. The computer program may be constituted by a device driver, an operating system, various application programs located in an upper layer thereof, and a library that provides a common function to these programs. Each block described below is not a hardware unit configuration but a functional unit block.
The game server 102 may be configured to include a web server, and the game terminal 104 may be configured to include a portable communication terminal and a web browser installed therein.

(Game server 102)
The game server 102 includes a communication unit 108, a data processing unit 110, and a data storage unit 112.
The communication unit 108 is in charge of communication processing with the game terminal 104 via the Internet 106. The data storage unit 112 stores various data. The data processing unit 110 executes various processes based on the data acquired by the communication unit 108 and the data stored in the data storage unit. The data processing unit 110 also functions as an interface between the communication unit 108 and the data storage unit 112. In addition to the game program, the data storage unit 112 stores information indicating the play state of each player.

The data storage unit 112 includes a game data storage unit 114, a player rank storage unit 116, and a character rank storage unit 118.
The game data storage unit 114 stores a game program. The player rank storage unit 116 stores information indicating the progress of the game for each player, such as the player rank, the competition result, and the total play time. The player rank will be described later with reference to FIG. The character rank storage unit 118 stores information indicating the character rank for each player and each character. The character rank will be described later with reference to FIG.

The communication unit 108 includes a matching request receiving unit 120.
The matching request receiving unit 120 receives a “matching request” from the game terminal 104. The matching request includes the player ID of the player requesting the matching and the character ID of the character used by the player.

The data processing unit 110 includes a player registration unit 122, a matching processing unit 124, and a game control unit 126.
The player registration unit 122 receives player registration from the game terminal 104 via the communication unit 108. When player registration is requested, the player registration unit 122 assigns a player ID to the player and newly registers the player in the player rank storage unit 116. When the game module of the game W is installed on the game terminal, player registration is automatically requested.

  When the matching processing unit 124 receives a matching request, the matching processing unit 124 establishes matching of a plurality of players. Matching here means selecting a player who participates in the same competitive game. The matching processing unit 124 organizes a team composed of a plurality of players according to the player rank and the character rank, and also performs a team-team battle setting. Details of the matching process will be described later. When matching is established, the matching processing unit 124 notifies each player of the matching result. The matching processing unit 124 cancels the matching when the battle ends.

  The game control unit 126 manages the progress state of the game for each game and for each player. The game control unit 126 includes a character rank control unit 128. The character rank control unit 128 updates the character rank.

(Game terminal 104)
The game terminal 104 includes a user interface unit 130, a communication unit 132, a data processing unit 134, and a data storage unit 136.
The user interface unit 130 receives operations from the player via the touch panel, and is in charge of processing related to the user interface such as image display and audio output. The communication unit 132 is in charge of communication processing with the game server 102 and other game terminals 104 via the Internet 106. The data storage unit 136 stores various data. The data processing unit 134 also functions as an interface for the user interface unit 130, the communication unit 132, and the data storage unit 136.

  The communication unit 132 includes a matching request transmission unit 138. The matching request transmission unit 138 transmits a matching request to the game server 102.

The data processing unit 134 includes a game execution unit 140.
The game execution unit 140 controls the progress of the game in cooperation with the game server 102. The game execution unit 140 may be formed as a software module that is downloaded from the game server 102 as part of the function of the game control unit. The communication unit 132 acquires various game information from the game server 102, and the data processing unit 134 displays a game screen on the user interface. In addition, the user interface unit 130 detects various inputs by the user, and the data processing unit 134 notifies the game server 102 of input information via the communication unit 132. In response to this input information, the game control unit 126 of the game server 102 controls the progress of the game in cooperation with the game execution unit 140 of the game terminal 104.

  The user interface unit 130 includes an input unit 142 that receives input from the player, and an output unit 144 that outputs various types of information such as images and sounds to the player. The input unit 142 mainly detects a player's touch operation on the screen as an input.

FIG. 3 is a screen view at the time of a battle.
The game field 200 is displayed on each game terminal 104. In the game field 200 of FIG. 3, eight characters P1 to P8 operated by eight players participate. Teams A and B are formed by eight players selected from among a large number of players who wish to enter the game W by a method described later. In FIG. 3, four characters P1 to P4 form team A, and the remaining characters P5 to P8 form team B.

  Team A defends Citadel 146A. Team B defends Citadel 146B. There are three siege routes R1 to R3 between the fortress 146A and the fortress 146B. Each player selects one of the siege routes. In the siege route R1 of FIG. 3, team A arranges characters P1, while team B arranges three characters P5 to P7. For this reason, in the siege route R1, the team B is dominant, and the struggle of the character P1 of the team A is expected. The player gives a movement instruction to the character. When these characters encounter on the siege route R1, the battle begins. When the character P1 of the team A loses the battle, the team B can attack the castle 146A from the siege route R1. For Team A, the character P1 is both an attacker and a defender in the siege route R1.

  In the siege route R3, the team A arranges the character P4, but the team B arranges no character at all. Therefore, the character P4 of the team A can reach the fortress 146B without receiving resistance. Team B must call back a character that has gone to another siege route to protect the siege route R3.

  In order to win the battle, it is necessary to secure a siege route for reaching the enemy citadel 146 while preventing the enemy from reaching his citadel 146. The eight players determine when to place their character on which siege route, and whether to give priority to defending their own fortification 146 or reaching the enemy fortification 146. The skill of this judgment has a great influence on victory or defeat.

  Each character has its own characteristics. For example, some characters are good at long-distance attacks, while others are specialized in melee combat. Some characters can attack a large number of enemy characters, while others can attack only one enemy character at a time. Some characters specialize in recovery of friendly characters rather than attacks, and other characters exhibit power when acting with a specific character. There is also compatibility between characters to confront. The strategy also changes depending on what character each player enters.

FIG. 4 is a screen view of the character rank screen 400.
In the game W, the player has a plurality of characters. A player selects and plays one body from a plurality of possessed characters. The character rank screen 400 shows the character rank of each of the five characters a to e possessed by a certain player X. When the player X instructs the input unit 142 to display the character rank screen 400, the output unit 144 acquires data from the character rank storage unit 118 and displays the character rank screen 400.

  In the game W, there are two parameters, a player rank and a character rank, for each of the player and the character. The character rank is a parameter that increases as the character is used in the game W, and is a parameter associated with the used character. Further, when a predetermined condition is achieved during the game, such as when the character wins the battle or destroys the enemy character during the battle, a predetermined point (for example, a character rank experience value) is given to the player. It may be increased when the number of points reaches a certain amount. In the case of FIG. 4, the character rank of the character e is 13 and is relatively large, and the character rank of the character d is only 1. For this reason, it is considered that this player X is familiar with the use of the character e, but is not very familiar with the use of the character d. As the character rank increases, parameters such as the attack power and defense power of the character may increase. However, in the present embodiment, the character itself is not strengthened by the character rank. The character rank in the present embodiment is an index value indicating how familiar the player is with the use of the character.

  The player rank is the total value of the character ranks of all the possessed characters. A player with a high player rank may be familiar with a specific character or may be used to many characters. The player rank is an index value of the proficiency level of the player for the game W. In FIG. 4, the player rank is 30. The player has selected the character c.

FIG. 5 is a data structure diagram of the player rank table 500.
The player rank table 500 is stored in the player rank storage unit 116. The player rank table 500 associates player IDs with player ranks. In FIG. 5, player A has a player rank of 25, player B has a player rank of 50, and player C has a player rank of 1. It can be seen that the player B is familiar with the game W, but the player C is hardly used to the game W. When a new player registers as a player in the game W, the player registration unit 122 newly registers a player ID in the player rank table 500. The game control unit 126 updates the player rank of the player who owns the corresponding character when the character rank changes. That is, the character rank and the player rank are correlated.

  Note that the player rank update timing need not be limited to when the character rank changes. When a predetermined condition is established during the game such as use of a character, a player rank experience value may be given (added) together with a character rank experience value associated with the character rank. When each experience value reaches a predetermined point amount (threshold value) set for the character rank and the player rank, the character rank and the player rank may be updated independently. Even in such a case, the correlation between the character rank and the player rank is maintained.

FIG. 6 is a data structure diagram of the character rank table 550.
The character rank table 550 is stored in the character rank storage unit 118. In the character rank table 550, the player ID, the character held by the player, the character rank, and the latest play count are associated with each other. The latest number of plays indicates a history of character use during a predetermined limited time. The latest play count in this embodiment is the number of times the character has been used in the past week.

  In FIG. 6, player A has characters a and b. The character rank of the character a is 15, and the character rank of the character b is 10. The latest play count of the player A is not set for the character a. This indicates that the player A has selected the character a and has never entered the game W in the past week. On the other hand, the latest play count of the character b is 8 times. It can be seen that the player A possesses the characters a and b and uses the character a more favorably than the character b, but recently prefers the character b.

FIG. 7 is a screen diagram of the battle determination screen 600.
When a large number of players enter the game W, the matching processing unit 124 first classifies (groups) the players based on the player rank. In FIG. 7, only players with a player rank of 40 or higher are selected. By limiting the player rank to advanced players having a player rank of 40 or more, it is possible to prevent the senior player and the lower-level player from being in the same team or becoming opponents. In FIG. 7, player D with player rank 41 has entered character a with character rank 45. Player E with player rank 48 enters character b with character rank 50, player F with player rank 44 enters character a with character rank 46, and player H with player rank 53 receives character c with character rank 49. Has been entered.

  Player D (character a) and player E (character b) form the first team, and player F (character a) and player H (character c) form the second team. In FIG. 7, it is a 2 to 2 match. The character ranks are all in the vicinity of 45, specifically in the range of 40-50. Based on the player rank, the matching processing unit 124 extracts only players of the same level (player rank 40 or higher in FIG. 7), and the character rank of the character entered by each player is the same level (character rank in FIG. 7). 4 players who will be 40 or more and 50 or less) are finally selected. As described above, the matching processing unit 124 narrows down the players who play the battle game from among a large number of players based on both the player rank and the character rank. Further details will be described later.

FIG. 8 is a flowchart showing the matching process.
When playing the game W, the player selects one character from one or more of the held characters (S10). In the game W, several characters can be used from the beginning. New characters are provided to the game terminal 104 from the game server 102 regularly, for example, at a frequency of about once a month. After selecting the character, the matching request transmission unit 138 transmits a matching request including the player ID and the character ID to the game server 102 (S11).

  The matching processing unit 124 sets a predetermined time limit and recruits a matching request within this time limit. Then, the player rank associated with the player ID specified by the matching request is read from the player rank table 500. The matching processing unit 124 performs grouping processing based on the player rank (S12). The grouping process is a process for classifying the players according to the player rank. Details will be described later with reference to FIG.

  After the grouping process, the matching processor 124 executes a selection process (S14). The selection process is a process of performing team formation and battle combination based on the character rank. Details will be described later with reference to FIG. After completion of the selection process, the matching request receiving unit 120 notifies the game terminal 104 of each player of the team to which the team belongs and the battle team (S16). The output unit 144 of the game terminal 104, the battle determination screen 600 showing the teams and the battle team are displayed on the screen.

FIG. 9 is a flowchart showing the grouping process of FIG.
In the game W, the players who have transmitted and received the matching request are classified into three groups: an elementary group, an intermediate group, and an advanced group. The matching processing unit 124 detects the player rank of the player who made the matching request from the player ID specified in the matching request and the player rank table 500. If the player rank is less than 20 (N in S18), the player is assigned to the beginner group (S26).

  When the player rank is 20 or more (Y in S18) and less than 40 (N in S20), the player is classified into an intermediate group (S22). When the player rank is 40 or more (Y in S20), it becomes an advanced group (S24). Accordingly, FIG. 7 shows a battle determination screen 600 corresponding to the advanced group.

FIG. 10 is a flowchart showing the selection process of FIG.
Here, it is assumed that 50 players are classified in the advanced group. It is assumed that a 2 to 2 battle group is selected from these. Hereinafter, a description will be given with reference to FIG. First, the character rank control unit 128 extracts the player D from the 50 players, and selects one ally player and two enemy players of the player D (S30). Since the character rank of the character a used by the player D is 45 (see FIG. 7), the character rank control unit 128 enters a range of width 10 centered on 45, that is, characters of character ranks 40 to 50. A player is selected from the advanced group.

  It is assumed that four players D, E, F, and H are extracted by the above processing. Next, team formation is decided for four people. There are three combinations of teams: (D, E) vs. (F, H), (D, F) vs. (E, H) and (D, H) vs. (E, F). The matching processing unit 124 calculates the total character rank value for each team (S34). For example, in the case of team (D, E), the character rank of the character a by the player D is 45, and the character rank of the character b by the player E is 50. Therefore, the total value (hereinafter referred to as “team strength value”). ) Is 95. In this way, the team strength values of the six teams are calculated. Next, the matching processing unit 124 corrects the team strength value based on the latest number of plays (S36). The team power value is added to 1 for a team having a latest play count of a predetermined number of times, for example, 5 times or more, and 5 is added to a team having 10 or more characters. In this way, when a character having a large number of latest plays is entered, the team strength value is added. The matching processing unit 124 determines a battle with a combination that minimizes the difference in the team strength values of the battle teams (S36).

The game system 100 has been described above based on the embodiment.
According to the present embodiment, players who have close playing skills can be matched with each other, so that it is easy to set a heated battle game. If an advanced player and a lower-level team are in the same team, the lower-level team will not only help the advanced player's play, but may also become cluttered. By classifying the players based on the player rank like the advanced group, the intermediate group, and the lower group, so to speak, it can be set so that it can play against players of the same level by dividing the “league”.

  When one player has a plurality of characters and sets a character rank for each character as in the present embodiment, there is a possibility that an appropriate battle cannot be performed only by the player rank. For example, when an advanced player A uses an unfamiliar character b, if the player B battles with an advanced player B who uses the character c, he is more advantageous. If there is a disadvantage in selecting an unfamiliar character (character with a low character rank), there is a possibility that the selection is biased toward a specific character even if a large number of characters are possessed. Then, it becomes difficult to realize the original interest of the game W in which a plurality of characters can be selected and played. In particular, even if a new character is introduced at any time in order to enhance the appeal of the game W, it is meaningless unless the player uses the new character.

  In the present embodiment, since matching is performed using two indexes of the player rank and the character rank, even if the player rank is the same, matching in which the character rank is far away is not established. There is a merit that the willingness to use a new character is not impaired because it is difficult to form an unfavorable battle even if a new character that is not familiar is used. On the other hand, even if the character rank is the same, the matching where the player rank is far away is not established.

  In the game W, since a beginner is not suddenly matched with a middle-advanced player with high play skills, a new player can easily enter. On the other hand, the intermediate / advanced player can maintain the willingness to play the game W for a long time by being matched with the opponent who matches his / her play skill. Beginners can also play intermediate and advanced players by raising the player rank.

  In addition, this invention is not limited to the said embodiment and modification, A component can be deform | transformed and embodied in the range which does not deviate from a summary. Various inventions may be formed by appropriately combining a plurality of constituent elements disclosed in the above embodiments and modifications. Moreover, you may delete some components from all the components shown by the said embodiment and modification.

Although it has been described that the game system 100 is configured by a plurality of game terminals 104 and one game server 102, some of the functions of the game terminal 104 may be realized by the game server 102, or the functions of the game server 102 may be A part may be assigned to the game terminal 104. In addition, a third device other than the game server 102 or the game terminal 104 may bear a part of the function.
A set of each function of the game terminal 104 and each function of the game server 102 described in FIG. 2 can be generally grasped as one “information processing apparatus”. How to allocate a plurality of functions necessary for realizing the present invention to one or a plurality of hardware depends on the processing capability of each hardware, the specifications required for the game system 100, and the like. It only has to be decided.

  In the present embodiment, it has been described that the matching criteria are the player rank, the character rank, and the play history at a predetermined limited time. Not limited to the example described above, at least each player may be matched based on two types of parameters reflecting the play history. For example, a player who forms the same team or a player of the battle team may give an evaluation value (praise) to the struggled player after the battle. Specifically, after the battle, the player designates the player to be evaluated on the screen. The game control unit 126 further associates the evaluation value for each player in the player rank table 500. The game control unit 126 adds the evaluation values of the players evaluated by other players. This evaluation value may be used instead of the player rank. Similarly, an evaluation value may be assigned to the character. In this case, the character evaluation value may be used instead of the character rank.

  The number and the rarity of item cards held by the player may be used instead of the player rank. If the character can be equipped with weapons and armor, the strength of the character's equipment may be used instead of the character rank. The accumulated play time and the number of times of play of the game W may be used instead of the player rank, and the accumulated use time and the number of times of use of the character may be used instead of the character rank. By matching not only a single index that reflects the play history (such as player rank) but also an additional index that reflects the play history (such as character rank) Can provide competitive games.

  A plurality of first parameters and one or more second parameters may be set for one player. For example, the first parameter is the strength of the character's equipment and the character rank. Then, the second parameter is set as the player rank. In this case, the game control unit 126 may determine the player rank by a predetermined function using the strength of the equipment and the character rank as parameters. For example, the equipment rank and the average value of the character rank may be used as the player rank.

  In the present embodiment, the grouping process is performed based on the player rank. However, the grouping process may be based on a store or a venue. Players with the same birth month and blood type may be grouped. When a plurality of players gather at the affiliated store at the same time, the matching processing unit 124 may perform matching only for these players.

  Various attributes such as military type and occupation type are set for the character. Character matching may be performed based on this attribute. For example, when a character with a warrior attribute is entered, a character with a warrior attribute may be necessarily included in the team or the battle team, or matching may be performed so that it is not necessarily included.

  In the present embodiment, correction at the time of matching is performed based on the latest number of plays. In this way, the team strength value may be corrected with reference to the play history in the limited period, particularly the latest limited period. In addition to the latest number of plays, players may be matched based on parameters such as the winning rate for the last week and the number of plays for the last 5 days.

  The character rank control unit 128 may be realized as a functional block of the game server 102 or may be realized as a functional block of the game terminal 104.

  In the present embodiment, the character rank increases as the character is used. The total value of the character ranks of the possessed characters is the player rank. Therefore, the player can raise the player rank even when a specific character is used intensively or when many characters are used evenly.

  The character rank control unit 128 may gradually decrease the rate of increase of the character rank. For example, the character rank may increase from 1 to 2 when the cumulative use count of the character changes from 0 to 3, and the character rank may increase from 2 to 3 when the cumulative use count changes from 3 to 8. . In order to increase the character rank from 19 to 20, the cumulative use count may have to be increased from 500 to 700 times. According to such a control method, it is easier for the player to raise the player rank by using a character that is less frequently used (a character that can be stretched) than by continuing to use a specific character. It can be an incentive to use characters that are not familiar to them. On the other hand, when the character rank of a familiar character is increased from 19 to 20, 5 may be added to the player rank instead of 1. In this case, since the character rank is raised by continuing to use a specific character many times, the player rank is raised more than usual by respecting that effort.

  The character rank control unit 128 may change the rate of increase of the character rank according to the player rank. For example, for a character a, when the character rank / player rank is 1/20 or less, the character rank control unit 128 can increase the character rank only by using the character a three times regardless of the character rank. Also good. In the case of FIG. 4, since the character rank of the character d is 1 and the player rank is 30, the character d satisfies this condition. In this case, the player can increase the character rank of the character d only by using the character d three times. According to such a control method, it is easy to encourage the use of a character d that is not familiar to the user.

  For the same reason, for the character having the lowest character rank among the plurality of characters, the character rank control unit 128 may set the character rank so as to increase easily. Alternatively, the rate of increase in the character rank may be changed based on the character rank ratio between the character with the lowest character rank and the character with the highest character rank. For example, this ratio is 1/10. If the character rank of the character a is 5 and the character rank of the character b is 60, the character a satisfies this condition. In this case, if the character a is selected, the character rank of the character a can be raised with a small number of uses.

  In the present embodiment, the game W as a tower defense game has been described as an object, but the present invention is similarly applied to other types of games such as a sports game, a role playing game, and an action game as well as the tower defense game. Is possible.

  Although the present embodiment has been described on the assumption of a network game using a smartphone or the like, the present invention can also be applied to an arcade game in a game center.

  100 game system, 102 game server, 104 game terminal, 106 internet, 108 communication unit, 110 data processing unit, 112 data storage unit, 114 game data storage unit, 116 player rank storage unit, 118 character rank storage unit, 120 matching request Reception unit 122 Player registration unit 124 Matching processing unit 126 Game control unit 128 Character rank control unit 130 User interface unit 132 Communication unit 134 Data processing unit 136 Data storage unit 138 Matching request transmission unit 140 Game execution unit, 142 input unit, 144 output unit, 146 fortification, 146B fortification, 200 game field, 400 character rank screen, 500 player rank table, 550 character Rank table, 600 battle decision screen

Claims (8)

A game control unit for controlling the progress of the game;
A player rank storage unit that stores a player rank indicating the skill level of the player's game for each player;
A character rank storage unit that stores a character rank indicating the skill level of the character for each player and each character;
A matching request receiving unit for receiving a matching request for designating a player and a character used by the player;
An information processing apparatus comprising: a matching processing unit that selects a plurality of players to be matched based on both the player rank and the character rank for the player and character specified in the matching request.   The game control unit increases the character rank experience value of the character to be used by achieving a predetermined condition as the game progresses, and increases the character rank when the character rank experience value reaches a predetermined value 2. The information according to claim 1, wherein the player rank experience value is increased by achieving the predetermined condition, and the player rank is increased by the player rank experience value reaching a predetermined value. Processing equipment.   The information processing apparatus according to claim 2, wherein the game control unit changes the rate of increase of the character rank according to the player rank.   The information processing apparatus according to claim 1, wherein the matching processing unit classifies the players into a plurality of groups based on the player rank, and matches players belonging to the same group.   The information processing apparatus according to claim 1, wherein the matching processing unit further selects a plurality of players to be matched based on a predetermined time limit. A game control unit for controlling the progress of the game;
A matching request receiving unit that receives matching requests from a plurality of players;
A plurality of players to be matched based on both the first parameter reflecting the game play history of the player and the second parameter different from the first parameter reflecting the game play history of the player An information processing apparatus comprising: a matching processing unit that selects   The game control unit sets a plurality of the first parameters for one player, and determines the second parameter based on a first parameter group set for the player. The information processing apparatus according to claim 6. A function of receiving a matching request for designating a player and a character used by the player;
In the matching request, the player rank table that associates the player with the player rank indicating the skill level of the player, and the character rank table that associates the player, the character held by the player, and the character rank that indicates the skill level of the character. A game program that causes a computer to exhibit a function of selecting a plurality of players to be matched based on both a player rank and a character rank for a designated player and character.

Images