JP2007215721A - Server device for game and its program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a server device for a game and its program wherein games is permitted to proceed without requiring players to participate in all matches of a match game and the players are allowed to freely participate in each match. <P>SOLUTION: The server device 51 for the game is provided with a rank calculation part 73 for calculating a total score till the termination time of each match for each player, a group division part 74 for dividing the players into a plurality of groups based on the total score, and a match combination part 75 for performing match combination between players in each group. The players in the group having the same total score at the termination time of each match are made to match. Also, match combination within the group having the lowest score is made by adding a new player who newly participates from the middle of the matches. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a game server device for a game in which players play against each other via a communication line, and a program thereof.

Conventionally, there has been a battle game in which game terminals are connected to each other via a communication line and players play against each other. Some battle games have a tournament in which a battle of several thousand players is held a plurality of times within a predetermined period, and the server device (For example, Patent Document 1).
However, since the competition of such a competition game was played by players who had applied in advance, there was a problem that even if there was a person who knew the existence of the competition after the end of the first round and wanted to participate in the competition, he could not participate in the middle there were.
In addition, even if the game from the first round to the first round is digested, it happens that it is inconvenient and the player who could not participate in the middle round loses the qualification for the next round.
JP 2004-171523 A

  An object of the present invention is to provide a game server device and a program therefor, in which the tournament can proceed even if the player does not participate in all rounds of the battle game, and the player can freely participate in each round.

The present invention solves the above problems by the following means. In addition, in order to make an understanding easy, although the code | symbol corresponding to the Example of this invention is attached | subjected and demonstrated, it is not limited to this.
The invention of claim 1 is communicably connected to each of the game terminals (1A to 1E) in response to an operation of each of the game terminals (1A to 1E) of a plurality of players within a predetermined game period (H1a), In a game server device that performs a combination of battle games between the players over a plurality of rounds, rank calculation is performed for each player to calculate rank information until the end of each round according to the battle results of each round. Unit (73) and a grouping unit that divides the players into a plurality of groups (G0 to G16, etc.) in the next round of each round based on the rank information calculated by the rank calculation unit (73) ( 74) and a battle combination unit (75) for performing a battle combination between the players of each group (G0 to G16, etc.) divided by the group division unit (74). It is a game for the server device to obtain.

According to a second aspect of the present invention, in the game server device according to the first aspect, the rank calculation unit (73) provides predetermined rank information to a new player who wishes to newly participate in the game within the game period (H1a). The grouping unit (74) incorporates the new player into the group (G0) of the predetermined ranking information, and the battle combination unit (75) is included in the predetermined group (G0). A game server device characterized in that a battle combination is performed between the players including the new player.
According to a third aspect of the present invention, in the game server device according to the first or second aspect, the rank calculating unit (73) is connected to the game server device within the game period (H1a). The game server device is characterized in that rank information is calculated for the player whose combination is not established.
According to a fourth aspect of the present invention, in the game server device according to any one of the first to third aspects, the grouping unit (74) is configured such that the number of players is less than a predetermined number. G1 etc.) are merged into another group (G0 etc.) having the similar ranking information.
According to a fifth aspect of the present invention, in the game server device according to any one of the first to fourth aspects, the rank calculating unit (73) is configured to determine the rank information of the player based on the victory or defeat of the player. This is a game server device characterized by calculating.
According to a sixth aspect of the present invention, in the game server device according to any one of the first to fourth aspects, the rank calculating unit (73) determines the rank of the player based on the score of the player. A game server device characterized by calculating information.

According to a seventh aspect of the present invention, in the game server device according to any one of the first to sixth aspects, the rank calculating unit (73) includes the player (A in the same group (G0 to G16, etc.)). , B) is ranked on the basis of the player's win or loss.
According to an eighth aspect of the present invention, in the game server device according to any one of the first to seventh aspects, the rank calculating unit (73) selects the players in the same group (G0 to G16, etc.). The game server device is characterized in that, when there is a direct confrontation between the players (B, C), ranking is based on winning or losing of the direct confrontation.
According to a ninth aspect of the present invention, in the game server device according to any one of the first to eighth aspects, the rank calculating unit (73) includes the players in the same group (G0 to G16, etc.). D, E) are ranked based on the results of the players that the player has played against.
According to a tenth aspect of the present invention, in the game server device according to any one of the first to ninth aspects, the rank calculating unit (73) selects the players in the same group (G0 to G16, etc.). A game server device characterized in that ranking is performed based on the points scored by the player.
The invention according to claim 11 is the game server device according to any one of claims 1 to 10, wherein the player who has not established the combination is within the game period (H1a). A game server device comprising reconnection request means for requesting connection to the game server device again.

  The invention of claim 12 is communicably connected to each of the game terminals (1A to 1E) in response to an operation of each of the game terminals (1A to 1E) of a plurality of players within a predetermined game period (H1a). A rank calculation unit that calculates a ranking information until the end of each round of battle for each player, based on a battle result of each round of battle, with a game server device that performs a combination of battle games performed between players over a plurality of rounds. (73) and a grouping unit (74) that divides the players into a plurality of groups (G0 to G16, etc.) in the next round of each round based on the ranking information calculated by the ranking calculation unit (73). ) And a battle combination unit (75) for performing a battle combination between the players of each group (G0 to G16, etc.) divided by the group division unit (74). That is a program of the game server device.

According to the present invention, the following effects can be obtained.
(1) In the present invention, players are divided into groups based on the ranking information at the end of each round, so even players who have not participated in the middle round can participate in subsequent rounds.

(2) In the present invention, a new player who wishes to participate in the game is newly incorporated into a group of predetermined ranking information, and a battle combination in this group is performed among the players including the new player. , You can participate in the middle round.

(3) Since the present invention calculates rank information even for a player whose combination has not been established, and incorporates this player into a group to play next time based on the rank information, even if the combination is not established, The game motivation can be maintained. In addition, by increasing the game period, the player's motivation for the game can be maintained as described above even when the probability that the combination is not established is high, so that it is possible to provide a battle game that matches the player's lifestyle. .

(4) Since the present invention merges a group with a smaller number of players than a predetermined number with another group having similar ranking information, even when the number of players in the group is small, the probability that a combination will be established can be maintained. In addition, the player can play against a player having the same skill in the game.

(5) According to the present invention, the player ranking information is calculated based on the winning / losing of the player, so that the players can be grouped for each player having the same skill according to the winning / losing of the player.

(6) According to the present invention, since the player ranking information is calculated based on the player's points, the players can be grouped for each player having the same skill according to the player's points.

(7) In the present invention, players in the same group are ranked based on the competition results (number of wins / losses, winning / losing of direct confrontation, results of players that each player has played against, and scoring points). The same player can be ranked.

(8) Since the present invention requests the player who has not been combined to reconnect to the game server device, the player who has once failed to combine is prompted to participate again. Can do.

  It is an object of the present invention to provide a game server device and a program for the same that can allow a player to participate in each round without having to participate in all the rounds of the battle game, and to provide a program for the game server device. A ranking calculation unit that calculates a total score up to the time for each player, a grouping unit that divides the player into a plurality of groups based on the total score, and a battle combination unit that performs a battle combination between players of each group, This was realized by playing together players in a group with the same overall score at the end of each round and adding a new player who joined the battle from the middle round in the middle of the round.

Hereinafter, the game server according to the present invention will be described in more detail with reference to the drawings.
First, control blocks of the game terminals 1A to 1E and the game server device 51 according to the present embodiment will be described.
FIG. 1 is a block diagram of the game terminals 1A to 1E and the game server device 51 of the present embodiment.
As shown in FIG. 1, the game terminals 1A to 1E are connected to a game server device 51 via a communication network 50 (for example, a communication line such as the Internet). Each player who operates the game terminals 1 </ b> A to 1 </ b> E is combined with a battle game by the game server device 51, and battles through the communication network 50. The type of the battle game may be any game where players win each other and win or lose is determined, such as a soccer game, a baseball game, a fighting game, a dart game, chess, shogi, and go.
In this embodiment, a case will be described as an example where about 1000 players play a soccer game of all 10 rounds using their own game terminals.

The game terminal 1A is a communication terminal such as a personal computer or a mobile phone. In this embodiment, a personal computer will be described as an example. Although FIG. 1 shows only the game terminal 1A in detail, the other game terminals 1B to 1E have the same configuration.
The game terminal 1 </ b> A includes a terminal storage unit 10, an operation unit 20, a terminal control unit 30, a terminal communication circuit 41, a display unit drive circuit 42, and a monitor 43.

The terminal storage unit 10 is a storage device for storing a program and the like necessary for the progress of the game, and is a hard disk or the like, for example. The terminal storage unit 10 includes a browser program unit 11 and a terminal-side game program unit 12.
The browser program unit 11 is a storage unit for storing a browser program. The browser program operates the terminal control unit 30 and transmits information to and from the game server via the communication network 50.
The terminal side game program unit 12 is a storage unit for storing the terminal side game program. The terminal-side game program is for operating the terminal control unit 30 to advance the game on the game terminal 1 </ b> A, and is distributed from the game server device 51 via the communication network 50, for example.
The operation unit 20 is for the player to operate the game terminal 1A, and is, for example, a keyboard, a mouse, or the like. The operation unit 20 is operated by the player, and a signal is output to the terminal control unit 30.

The terminal control unit 30 is a control unit for comprehensively controlling the game terminal 1A. The terminal control unit 30 includes a terminal communication control unit 31, a game progress control unit 32, and a display unit control unit 33.
The terminal communication control unit 31 is a control unit that is operated by a browser program and drives the terminal communication circuit 41 to transmit information to and from the game server device 51.
The game progress control unit 32 is operated by the terminal-side game program, and is a control unit for comprehensively controlling the progress of the game on the game terminal 1A.
The display unit control unit 33 is a control unit for driving the display unit drive circuit 42 to display a game screen or the like on the monitor 43.

The terminal communication circuit 41 is an electric circuit for transmitting information related to the game between the game server device 51 and the other game terminals 1 </ b> A via the communication network 50.
The display unit drive circuit 42 is an electric circuit for driving the monitor 43.
The monitor 43 is a display device for displaying the progress of the game or the like, and is, for example, an LCD (liquid crystal display device).

Next, the game server device 51 will be described.
The game server device 51 is a computer that transmits necessary information to and from the game terminal 1A via the communication network 50, and performs a combination of battle games performed between players over a plurality of rounds. The game server device 51 includes a server storage unit 60, a server control unit 70, and a server communication circuit 81.

The server storage unit 60 is a storage device for storing programs and the like necessary for the progress of the soccer game, and is, for example, a hard disk. The server storage unit 60 includes a server-side game program unit 61 and a player information storage unit 62.
The server side game program unit 61 is a storage unit for storing a server side game program. The server-side game program is for operating the server control unit 70 to advance the game.
The player information storage unit 62 is a storage unit for storing information of players participating in the battle game, and stores, for example, the player's name, user ID, password, battle results, and the like.

The server control unit 70 is a control unit for comprehensively controlling the game server device 51. The server control unit 70 is operated by a server-side game program, and functions as a server communication control unit 71, a participation reception unit 72, a rank calculation unit 73, a grouping unit 74, and a battle combination unit 75.
The server communication control unit 71 is a control unit for driving the server communication circuit 81 to transmit information to and from each game terminal.
The participation reception unit 72 is a control unit for performing reception processing of a player who wishes to participate in the game by connecting to the game server via the communication network during the period (game period) of each round. The participation reception unit 72 includes a reconnection request unit, and requests a player whose combination has not been established to reconnect to the game server device 51, as will be described later.
The rank calculation unit 73 is a control unit for assigning a score (score information) to the player according to the battle result of each round and calculating a total score (rank information) until the end of each round for each player. As will be described later, the rank calculation unit 73 performs a battle-free process on the players whose combinations are not established, and ranks all the players at the end of the 10th round.

The grouping unit 74 is a control unit for dividing the players into a plurality of groups based on the total score calculated by the rank calculation unit 73. Thereby, each player can play against a player who is close to ability.
In addition, as will be described later, the grouping unit 74 transfers a new player who wishes to participate in the game newly within the period of each round to a group with a total score of 0 (a group with predetermined rank information).
The battle combination unit 75 is a control for performing a battle combination between players of each group divided by the group division unit 74.
The server communication circuit 81 is an electric circuit for transmitting information related to the game between the game terminals via the communication network 50.

Next, a procedure for a player to participate in a soccer game will be described.
FIG. 2A is a diagram showing a screen of the homepage H1 that calls for recruitment to the soccer game of the present embodiment, and FIG. 2B is a diagram showing a reception screen H2 of the player.
These screens are transmitted from the game server device 51 to the game terminal and displayed on the monitor 43 of the game terminal 1A.
The home page H1 is displayed on the monitor 43 when an address is described in an advertisement such as a magazine or a newspaper, or a link is pasted to another home page and the player accesses it. On the homepage H1, a holding period H1a of a soccer game consisting of all 10 rounds and an address H1b of the reception screen H2 are displayed.
The player accesses the reception screen H2 indicated by the address H1b within the period of each round, inputs the name H2a, the nickname H2b, and the mail address H2c, clicks the transmission H2d, and sends information to the game server device 51. Send. Accordingly, the user ID and password are transmitted from the game server device 51, and the player can participate in the soccer game.

Next, operations of the game terminal 1A and the game server device 51 will be described.
First, the operation of the game terminal 1A will be described.
FIG. 3 is a flowchart showing the operation of the game terminal 1A of the present embodiment, FIG. 4 is a diagram showing a battle acceptance screen H3, and FIG. 5 is a diagram showing a screen H4 that prompts the player to participate again. .
First, in step S1, a series of processes starts when the player operates the game terminal 1A to connect to the game server.
In steps S <b> 2 and S <b> 3, information on the reception screen H <b> 3 (see FIG. 4) is transmitted from the game server device 51 and displayed on the monitor 43. And if user IDH3a and password H3b are input by the player and transmission H3c is clicked, the game progress control part 32 will transmit such information to the server device 51 for games.
When the user ID is authenticated by the game server device 51 in step S4 (step S4: YES), information on whether or not a game tournament is held is transmitted from the game server device 51 in step S5. The If a game tournament is open (step S5: YES), in step S6, the game progress control unit 32 notifies the game server device 51 that the player has participated in the game tournament.

  In step S7, the game progress control part 32 progresses to step S8, when it is judged by the game server apparatus 51 that a battle | competition is possible (step S7: YES). On the other hand, if it is determined that the match is impossible due to reasons such as having already digested the game (step S8: NO), the process is terminated (step S12).

  In step S8, when a notification is received from the game server that an opponent has been found (step S8: YES), in step S9, the game progress control unit 32 communicates with the opponent's game terminal to play the battle. Do. When the battle is over (step S10: YES), in step S11, the game progress control unit 32 transmits information regarding the battle result to the game server device 51. In the case of the present embodiment, this information includes the user ID of the player, the winning / losing (including the draw), the opponent, the score, and the like. In step S12, the game progress control unit 32 ends the series of processes.

  On the other hand, if no opponent is found in step S8 (step S8: NO), the process proceeds to step S81. If the waiting time (for example, about 5 minutes) has not been exceeded (step S81: NO), the process returns to step S8, and a series of operations are repeated until the opponent is found. When the standby time has been exceeded (step S81: YES), the process proceeds to step S82, and the game progress control unit 32 notifies the game server device 51 that the standby time has been exceeded. Accordingly, the game server device 51 performs a battle-free process for this player, transmits information on the screen H4 (see FIG. 5) prompting the player to participate again to the game terminal 1A, and displays it on the monitor 43 (game). The processing of the server device 51 will be described later.) In step S12, the game progress control unit 32 ends the process.

Next, the operation of the game server device 51 will be described. The game server device 51 performs player battle processing, player grouping, and ranking.
First, the battle process of the game server device 51 will be described.
FIG. 6 is a flowchart showing the player's battle process in each round of the game server device 51 of the present embodiment.

First, in step S101, the server control unit 70 of the game server device 51 starts a battle process with the start of the period of each round (see H1a shown in FIG. 2).
In step S102, when the participation acceptance unit 72 accepts a player (step S102: YES), the user ID and password transmitted from the game terminal 1A in step S103 (see steps S2 and S3 shown in FIG. 3). And the information in the player information storage unit 62 are collated to authenticate the player. If the player correctly authenticates the player (step S104: YES), the participation reception unit 72 proceeds to step S105 and confirms whether the player has already participated in the game tournament.

In step S105, the participation reception unit 72 determines that the player has already participated in the game tournament (step S105: YES). Subsequently, in step S106, the player has not yet completed the battle of this round. Check if it exists. If the match has not been completed (step S106: YES), the process proceeds to step S107 (described later). On the other hand, if the match has been completed (step S106: NO), the process proceeds to step S1061 to indicate that the match has been completed. Contact 1A.
On the other hand, if it is determined in step S105 that the player has entered the first battle, that is, if it is determined that the player has not participated before this round (step S105: NO), step S1051. Proceed to In step S1051, the rank calculating unit 73 performs midway entry processing for this new player who is in the first participation. The midway entry process means that the total score of the new player is 0. Then, the process proceeds to step S107.

In step S107, the battle combination unit 75 adds the player to the matching list of the same group. This group is a collection of players with the same score based on the total score of the previous round (the details of grouping will be described later), and the matching list is stored in the game server device 51 at the same time. And a list of players in the same group who want to play.
In step S108, the battle combination unit 75 checks the matching list of the same group, and when there is a player (opposition partner) other than the player of the game terminal 1A and determines that a battle is possible (step S108: YES), the process goes to step S109. Proceed to inform each player's game terminal that they can play. Thereby, players play a battle through the communication network 50 using each game terminal. (In the case of the first round, since there is no match result until the previous match of each player, the match combination unit 75 matches the players accessing the game server device 51 in an irregular combination).
In step S110, the game server device 51 starts a process of accepting a battle result (player's user ID, win / loss, opponent, score, etc.) from each game terminal of the player (see step S11).

In step S111, when the battle result is received from the game terminal of each player (step S111: YES), in step S112, the rank calculation unit 73 confirms the consistency of the battle result of each game terminal. Score points for the player. In the soccer game of this embodiment, 2 points are added to the winning player, 1 point is added to each of the drawn players, and no points are added to the losing player (that is, 0 points). Then, the rank calculation unit 73 records each player's match result and score in the player information storage unit 62.
And it progresses to step S114, and when the holding period has not ended (step S114: NO), the processing from step S102 is repeated.
In step S111, if the battle result is not transmitted due to a malfunction of the game terminal or the like (step S111: NO), the player of this game terminal is treated as a defeat player as a penalty for a transmission error. In this case, when the other player has transmitted the battle result, the other player is treated as the winning player.

  In step S108, when the battle combination unit 75 determines that there is no other player in the matching list of the same group and cannot battle (step S108: NO), the battle combination unit 75 proceeds to step S1081. In step S1081, the battle combination unit 75 repeats the processing from step S108 and confirms the opponent in the match list when there is no notification that the waiting time has been exceeded from the game terminal 1A (step S1081: NO). On the other hand, in step S1081, when there is a notification from the game terminal 1A that the waiting time has been exceeded (step S1081: NO), the process proceeds to step S1082, and the participation reception unit 72 informs the game terminal 1A of the participation in the war again. (See FIG. 5). In this way, the participation reception unit 72 has a reconnection request unit, and requests the player who has not been combined to reconnect (access) the game server device 51. You can encourage them to enter again. Subsequently, in step S1083, the rank calculation unit 73 performs a battleless process for this player. The non-war processing in this embodiment is to evaluate the intention to participate in the game and to give the same score as the draw. Then, the process proceeds to step S114.

  In step S114, when the server control unit 70 determines that the holding period has ended (step S114: YES), the process proceeds to step S115, and the rank calculation unit 73 calculates a total score until the end of the main round for each player. The rank calculating unit 73 adds the score of the final round to the total score up to the previous round to calculate the total score at the end of the round. For example, if the player has a total score of 3 points up to the previous round and 2 points in the final round, the total score at the end of the round is 5 points. One point is added to the player who has been unfighted. It should be noted that after a battle-free process, a player who has re-entered and played a battle is given a score corresponding to the victory or defeat of the battle (that is, 1 point by the battle-free process is not added). The rank calculation unit 73 causes the player information storage unit 62 to store information such as the player's total score and opponent. When the processing of all players by the rank calculation unit 73 ends, the game server device 51 ends a series of processing in step S116.

Next, the grouping process of players of the game server device 51 will be described.
FIG. 7 is a flowchart showing grouping processing of players of the game server device 51 of the present embodiment, and FIG. 8 is a diagram for explaining an example of grouping.
When the first round is over, the grouping unit 74 of the game server device 51 starts the player grouping process in step S201.
In step S202, the grouping unit 74 confirms the information in the player information storage unit 62, and groups the two players with the highest overall score into a two-point group G2. In the case of the present embodiment, as shown in FIG. 8, 450 players are grouped into a two-point group G2. In step S203, the grouping unit 74 compares the minimum number of groups (50 in this embodiment) with the number of members of the two-point group G2. The minimum number of groups means the minimum number of people constituting one group (details will be described later). Since the one-point group G1 has 450 people (step S203: NO), the grouping unit 74 proceeds to step S205 and determines whether the processing of all the groups has been completed. When the process of the two-point group G2 is completed, the process of the other group remains (step S205: NO), and the process proceeds to step S206.

  In step S206, the grouping unit 74 starts the process for the one-point group G1 having the next highest score. In steps S203 to S205, the same processing as that of the two-point group G2 is performed to group 100 players into the one-point group G1. Finally, in order to process the 0-point group G0, the process from step S203 is further repeated, and when the grouping of all groups is completed (step S205: YES), the grouping process at the end of the first round is completed ( Step S207).

  In the second round, as shown in FIG. 8, there are 40 midway entries (new players), and the grouping unit 74 transfers the new players to the 0-point group G0. In the second round, the battle combination unit 75 performs a battle combination in the 0-point group G0 among players including the new player. Thereby, the new player can participate in the soccer game even from the middle of the 10th round.

When the second round is completed, the grouping unit 74 performs the above-described processing of steps S201 to S207 based on the total score at the end of the second round, and performs 200 for the 4-point group G4 and 70 for the 3-point group G3. The grouping of the two-point group G2 to 500 people is sequentially performed.
In the subsequent grouping of the one-point group G1, the number of members is 30, which is less than the minimum group number of 50 (step S205: YES). G1 is integrated into the 0-point group G0, and a new 0-1 point group G01 is created. Finally, 270 people are grouped into the newly created 0-1 point group G01, and a series of processing ends.

  As described above, the reason why the group of 50 or less is integrated into another group is to prevent a decrease in the number of established combinations with a decrease in the number of players in the group. That is, as the number of players decreases, the number of players who wish to play in the same time period also decreases, making it difficult to establish a combination. The grouping unit 74 of the present embodiment can concentrate access to the game server device 51 by merging the groups, and can prevent a decrease in the number of combinations established. Further, by merging the 1-point group G1 with the 0-point group G0 having a close overall score, players having equivalent skills can be made to play against each other.

  Thereafter, the grouping unit 74 performs the same processing at the end of each round from the 3rd round to the 10th round. (FIG. 8 shows the state where the third round is over and the fourth round is grouped.)

  As described above, since the grouping unit 74 performs grouping of players based on the total score at the end of each round, even players who have not participated in the middle round can participate in the next round. . That is, for example, a player with a total score of 2 at the end of the second round is grouped into a two-point group G2 at the end of the third round, even if he does not participate in the third round (no score for the third round). You can enter again.

Next, the player ranking process of the game server device 51 will be described.
FIG. 9 is a flowchart showing the player ranking process by the game server device 51 of the present embodiment, and FIG. 10 is a diagram showing the battle results at the end of the 10th round.
As shown in FIG. 9, the grouping unit 74 of the game server device 51 performs the above-described grouping process in steps S301 to S303 at the end of each round (see steps S201 to S207 shown in FIG. 7).
In step S304, the rank calculation unit 73 of the game server device 51 proceeds to step S304 and ranks the players when all the tenth rounds of the soccer game have been completed (step S304: YES).
In step S305, the rank calculation unit 73 ranks the players in the group in order from the group with the highest total score. However, the players in the group have the same overall score, and thus cannot be ranked based on the overall score. Therefore, the rank calculation unit 73 ranks the players as follows.

Here, as shown in FIG. 10, description will be made by taking as an example the ranking of the players A to E in the 16-point group G16 having the highest total score.
(1) The rank calculation unit 73 ranks players with the same overall score based on the number of wins and losses. For example, when the wins and losses of the players A and B are the player A “8 wins 2 losses” and the player B “7 wins 1 loss 2 draws”, the player A has more wins than the player B. The calculation unit 73 sets the player A as a higher rank.
(2) Next, the ranking calculation unit 73 ranks players having the same overall score based on the winning or losing of the direct confrontation when there is a direct confrontation between the players. For example, when both of the players B and C are 7 wins, 1 loss and 2 draws, and the player B wins the player C in the direct confrontation between the players B and C, the rank calculation unit 73 ranks the player B higher And
(3) Next, the ranking calculation unit 73 ranks the players having the same overall score based on the results of the players (opponents) that each player has played against. For example, when the player D has won 6 players with a total score of 15 points, and the player E has won 5 players, the ranking unit determines whether the player D has won a stronger opponent. Is the higher rank.
As a result of the above processing, the rank calculating unit 73 sequentially ranks the players A to E so that the player A is the highest and the player E is the lowest.
The rank calculation unit 73 ranks the 50 players of the 16-point group G16 by performing the processes (1) to (3). Players that cannot be ranked by the above processing are also given the same ranking. (Note that the player's ranking may be determined by, for example, the score of the match in the process from (1) to (3)).

The rank calculation unit 73 subsequently ranks the 15 point group G15 in order, and after the 0 point group G0 is processed, the process proceeds to step S306.
In step S306, the rank calculation unit 73 obtains the overall rank of all players based on the rank of each group.
For example, as shown in FIG. 10, when there are 50 players in the 16-point group G16 and 60 players in the 15-point group, the players in the 16-point group are ranked from 1st to 50th, Players in the point group G15 are ranked from the 51st place to the 110th place. Similarly, all players up to the 0 point group G0 are ranked.
The total ranking of the players calculated in this way is announced on the homepage or the like together with the nickname.
Note that all players may be ranked not only after the end of every 10th round but also after each round.

As described above, in the game server device 51 according to the present embodiment, the grouping unit 74 groups players based on the total score (rank information). But you can take part in the next round.
In addition, the grouping unit 74 causes a new player who wishes to participate in the game to be included in the 0-point group G0 (group of predetermined ranking information) during the opening period (game period) of each round, so that the new player , You can participate in the middle round.

  Further, the rank calculation unit 73 is connected to the game server device 51 within the holding period, but gives a score of one point (predetermined score information) to the player whose combination is not established. The game motivation can be maintained. Further, even if the holding period is lengthened and the probability that the combination is not established becomes high, the game motivation of the player can be maintained, so that the game server device 51 provides a battle game that matches the life style of the player. Can do.

  Furthermore, since the grouping unit 74 merges a group having less than 50 players (predetermined number) into a group having similar rank information, the number of combinations established can be maintained, and players having the same skill level can be maintained. Can be played.

(Modification)
The present invention is not limited to the embodiments described above, and various modifications and changes are possible, and these are also within the equivalent scope of the present invention.
(1) In the present embodiment, the ranking calculation unit has shown an example in which the ranking information is calculated by adding a score based on the winning / losing of the player. However, the present invention is not limited to this. For example, the ranking information may be calculated based on the points scored in the soccer game of the player. Also by this, the grouping unit can perform grouping for each player having the same skill based on the ranking information.

It is a block diagram of the game terminal and game server apparatus of the Example by this invention. It is a figure which shows the player recruitment screen and player reception screen of a present Example. It is a flowchart which shows operation | movement of the game terminal of a present Example. It is a figure which shows the battle | competition reception screen of a present Example. It is a figure which shows the screen which encourages the player of a present Example to participate in a war again. It is a flowchart which shows the battle | competition process of a present Example. It is a flowchart which shows the grouping process of a present Example. It is a figure explaining the example of grouping of a present Example. It is a flowchart which shows the process of player ranking of a present Example. It is a figure which shows the battle result at the time of the 10th game end of a present Example.

Explanation of symbols

1A to 1E Game terminal 10 Terminal storage unit 30 Terminal control unit 41 Terminal communication circuit 42 Display unit drive circuit 50 Communication network 51 Game server device 60 Server storage unit 61 Server-side game program unit 62 Player information storage unit 70 Server control unit 72 Participation reception part 73 Rank calculation part 74 Group division part 75 Competitive combination part 81 Server communication circuit

Claims (12)

A game server device that is communicably connected to each game terminal in response to an operation of each game terminal of a plurality of players within a predetermined game period, and performs a combination of battle games performed between the players over a plurality of rounds. In
A rank calculating unit for calculating rank information until the end of each round, for each player according to the battle result of each round;
A grouping unit that divides the players into a plurality of groups in the next round of each round based on the rank information calculated by the rank calculation unit;
A battle combination unit for performing a battle combination between the players of each group divided by the grouping unit;
A game server device comprising: The game server device according to claim 1,
The rank calculation unit gives predetermined rank information to a new player who wishes to newly participate in the game within the game period,
The grouping unit incorporates the new player into the group of the predetermined ranking information,
The battle combination unit performs a battle combination in the predetermined group between the players including the new player;
A game server device. In the game server device according to claim 1 or 2,
The rank calculating unit calculates rank information for the player who has connected to the game server device within the game period but has not been combined.
A game server device. In the game server device according to any one of claims 1 to 3,
The grouping unit merging the group having a smaller number of players than a predetermined number with another group having the ranking information close;
A game server device. In the game server device according to any one of claims 1 to 4,
The rank calculating unit calculates rank information of the player based on the victory or defeat of the player;
A game server device. In the game server device according to any one of claims 1 to 4,
The rank calculating unit calculates rank information of the player based on the points of the player;
A game server device. In the game server device according to any one of claims 1 to 6,
A rank calculating unit ranks the players in the same group based on the victory or defeat of the players;
A game server device. In the game server device according to any one of claims 1 to 7,
The ranking calculation unit ranks the players in the same group based on the winning or losing of the direct confrontation when there is a direct confrontation between the players;
A game server device. In the game server device according to any one of claims 1 to 8,
The ranking calculation unit ranks the players in the same group based on the results of the players with whom the player has played;
A game server device. The game server device according to any one of claims 1 to 9,
The ranking calculation unit ranks the players in the same group based on the points of the players;
A game server device. In the game server device according to any one of claims 1 to 10,
Reconnection request means for requesting the player whose combination has not been established to reconnect to the game server device within the game period;
A game server device. A game server device that is communicably connected to each game terminal in accordance with an operation of each game terminal of a plurality of players within a predetermined game period and performs a combination of battle games performed between players over a plurality of rounds. ,
A rank calculating unit for calculating rank information until the end of each round, for each player according to the battle result of each round;
A grouping unit that divides the players into a plurality of groups in the next round of each round based on the rank information calculated by the rank calculation unit;
A battle combination unit for performing a battle combination between the players of each group divided by the grouping unit;
A game server device program to be operated.

Images