JP5215277B2 - GAME SYSTEM AND COMPUTER PROGRAM THEREOF - Google Patents

Description

  The present invention relates to a game system in which a game is executed between a plurality of game machines connected via a center server, and a computer program thereof.

  A game system is known in which a game is executed between a plurality of game machines connected via a center server (see, for example, Patent Document 1). In addition, there are Patent Documents 2 and 3 as prior art documents related to the present invention.

Japanese Patent No. 3730248 JP 2008-168116 A JP 2007-215721 A

  In the game system such as the above-mentioned Patent Document 1, matching of each game machine is executed by the center server, and the opponent of each game machine is notified by the matching list, and then between each game machine and the center server. The connection may be disconnected. In such a case, the game machine is divided into a master machine that manages the progress of the game and a client machine that is connected to the master machine, and information is shared between the game machines. The game progress management may be executed on the side. In this case, the master machine functions as a server between the game machines, and the game machines are connected in a server-client type. By executing the progress management of the game between the respective game machines, the processing required for the progress management of the game can be distributed to the game machine side, so that the load on the server can be reduced. However, since the connection between each game machine and the server is released, depending on the communication state between the game machines, there is a possibility that information cannot be transmitted and received and information cannot be shared between the game machines. In addition, for example, if the master machine cannot continue the game due to game rules or communication line malfunctions, a new game machine serving as the master machine must be determined. In this case, a method is conceivable in which each game machine recognizes a new master machine based on the matching list. However, if there is a difference in the information of each game machine due to the poor communication situation as described above, the connection destination of the new master machine is not the same between the game machines. A game machine that cannot be connected to a master machine may occur. Furthermore, since it is not possible to confirm whether or not a game machine authorized as a new master machine is in a connectable state until it is connected, there are cases where it is necessary to try to connect to a new master machine many times. obtain. Even if all the client machines are connected to the new master machine, there is a case where a difference has already occurred in the information between the game machines at the time of connection. Assuming such a case, it is necessary to prepare a handling process corresponding to each possible case, so reconnection is possible even though the client machine can be reconnected based on the matching list. There are many examples in which the progress process of a game is continued in a stand-alone manner on each client machine.

  Therefore, an object of the present invention is to provide a game system and a computer program thereof that can easily realize the second and subsequent matching of a game in which a plurality of rounds are battled.

  The game system of the present invention includes a center server (3) and a plurality of game machines (2) connectable to the center server via a communication line, and matching of the plurality of game machines from each game machine A certain number of game machines are matched from the plurality of game machines in response to the request, and after the matching is completed, the connection between the matched game machines and the center server is released, and In a game system in which a game in which a plurality of rounds are battled between the certain number of game machines connected so as to be communicable is executed, each of the plurality of game machines has a start each time each round of the plurality of rounds starts. Matching request means (8) for executing the matching request and the matching request means (8) each time each of the plurality of rounds starts. Connection means (8) for connecting the game machines so that they can communicate with each other, and connection release means (8) for releasing the connection between the matched game machines each time the rounds of the plurality of rounds are completed. In the center server, matching means (7) for matching each game machine satisfying a predetermined condition among the plurality of game machines as the predetermined number of game machines in response to a matching request from each game machine. ) And ID providing means (7) for assigning the same session ID (15) to each of the first-matched game machines among the respective game machines to be matched by the matching means. The means uses the session ID as the predetermined condition, and sets each game machine to which the same session ID is assigned to each other. , Each game machine that is not the session ID is imparted to each other, is to match each.

  According to the present invention, the same session ID is assigned to a plurality of matching game machines on the center server side, and matching is executed on the center server side based on the session ID. Thereby, matching can be performed centrally on the center server side. Further, in a game in which a plurality of rounds are fighted, a plurality of matchings are executed. However, since the same session ID is assigned to the second and subsequent matching targets, it is easy to connect each game machine based on the session ID. Matching can be performed. Moreover, since matching and the connection between game machines are refreshed at the start of each round, it is possible to suppress the occurrence of trouble in the progress of the game due to the mismatch of information between the game machines. Further, for example, in a game in which a plurality of rounds are played in the remaining winning format, there is a case where it is desired to execute a loser revival game between the lost gaming machines separately from the remaining gaming machines. Since the loser revival game is executed between the lost game machines, that is, between the losers, it is executed separately from the battle between the remaining game machines, that is, between the winners. However, in the end, the winner of the loser revival game must join the remaining game machines and realize the battle between each game machine including the winner of the loser revival game on each remaining game machine. . Even in such a case, matching between each winning game machine and the winner of the loser revival game can be easily realized based on the session ID assigned to each game machine.

  The game machines may be connected in any way. For example, in one aspect of the game system of the present invention, the center server determines a parent game machine that issues an instruction to another game machine based on an instruction from the center server from among the game machines. And the connection means may connect the game machines so that the parent game machine functions as a server and other game machines function as clients that follow instructions from the parent game machine. In this case, since an instruction from the center server is issued to another game machine via the parent game machine, the load on the center server can be reduced. In addition, since each server has a server-client connection in which the parent game machine functions as a server, it is possible to suppress the time difference between instructions that can occur between the game machines as compared to other connection types. it can. Further, the determination of the parent game machine can be executed centrally by the center server.

  In one aspect of the game system of the present invention, the determining means may determine the parent game machine every time each of the plurality of rounds starts. In this case, even if the parent game machine is dropped due to loss in each round or the like, it is possible to easily realize a server-client connection between the game machines in the next round. Further, since the determination of the parent game machine is executed on the center server side for each round, it is not necessary for each game machine to search for a connectable game machine to be certified as the parent game machine. The communication environment between game machines is greatly influenced by the environment in which each game machine is installed. On the other hand, since the communication environment of the center server is secured to some extent, the safety of communication connection is higher than that of each game machine. For this reason, the malfunction which generate | occur | produces by the malfunction of a communication line, etc. can be suppressed.

  In one aspect of the game system of the present invention, in the same round of the plurality of rounds, a plurality of battles to which each game machine matched under different conditions is executed, and the center server and the plurality of game machines At least one of the above is further provided with a master machine setting means (2) for setting one master machine for managing the progress of the game from each game machine belonging to each of the plurality of battles for each of the plurality of battles. It may be done. In this case, a master machine can be provided for each battle of a plurality of battles matched under different conditions. On the other hand, the same round is connected to a common parent game machine, and information from the center server is transmitted and received through the parent game machine. Therefore, the rounds of each battle can be matched under the parent game machine, while each battle can be independently executed under the master machine for each battle. Thereby, for example, the battle executed under the condition of the winner of the previous round and the battle executed under the condition of the loser of the previous round under conditions different from the battle can be executed independently in the same round. . Further, the load on the parent game machine can be reduced as compared with the case where the parent game machine also manages the progress of each battle game.

  In one aspect of the game system of the present invention, the matching request from each game machine to the center server may include an identification code for identifying the plurality of rounds. In this case, since it is possible to identify which round each matching game machine belongs to, the matching condition can be changed for each round. The identification code may be in any form. For example, in one aspect of the game system of the present invention, the session ID may include a round identification unit (15b) as an identification code for identifying the plurality of rounds.

The computer program of the present invention comprises a center server (3) and a plurality of game machines (2) connectable to the center server via a communication line, and the matching from each game machine of the plurality of game machines A certain number of game machines are matched from the plurality of game machines in response to the request, and after the matching is completed, the connection between the matched game machines and the center server is released, and A computer program applied to a game system in which a game for fighting a plurality of rounds between a certain number of game machines connected in a communicable manner is executed, wherein each of the plurality of game machines is connected to the plurality of rounds. Matching request means for executing the matching request each time each round starts, each round of the plurality of rounds Connection means for connecting the matched game machines so that they can communicate each time the game starts, and connection release for releasing the connection between the matched game machines each time the rounds of the plurality of rounds are completed Each of the plurality of game machines is configured to function as a means , and each of the game machines to which the same session ID matched to the first of a plurality of rounds is assigned by the center server or each other Each game machine to which no ID is assigned is processed so as to be matched with each other. Alternatively, a center server (3) and a plurality of game machines (2) connectable to the center server via a communication line are provided, and in response to a matching request from each game machine of the plurality of game machines A certain number of game machines are matched from among a plurality of game machines, and after the matching is completed, the connection between each of the matched game machines and the center server is released and connected to each other so as to be communicable with each other. A computer program applied to a game system in which a game for fighting a plurality of rounds between the certain number of game machines is executed, and the center server is configured to make each game satisfying a predetermined condition among the plurality of game machines. Matching means for matching according to a matching request from each game machine as the fixed number of game machines, It is configured to function as an ID assigning means for assigning the same session ID (15) to each game machine that is matched for the first time among the game machines that are matched at the start of each round by the matching means. In addition, the matching means uses the session ID as the predetermined condition, and each game machine to which the same session ID is assigned, or each game machine to which the session ID is not assigned to each other Are configured to function as matching means. By executing these computer programs of the present invention, the game system of the present invention can be realized.

  In addition, in the above description, in order to make an understanding of this invention easy, the reference sign of the accompanying drawing was attached in parenthesis, but this invention is not limited to the form of illustration by it.

  As described above, according to the present invention, the second and subsequent matching of a game in which a plurality of rounds are played can be easily realized.

The figure which shows the whole structure of the game system which concerns on one form of this invention. The figure which shows the outline | summary of the intro music hitting game performed with the game system which concerns on one form of this invention. The figure which shows an example of a matching list. The flowchart which shows the process of the control unit of a game machine when the opponent of each game machine is determined, and the process of the control unit of a center server.

  FIG. 1 is a diagram showing a game system 1 according to an embodiment of the present invention. As shown in FIG. 1, in the game system 1, a plurality of game machines 2 and a center server 3 are connected to a network 5 via a router 7. The center server 3 is not limited to an example configured with a single physical device, and a single logical center server 3 may be configured with a server group as a plurality of physical devices. The network 5 is the Internet. The network 5 may be any network that uses a communication line, and is not limited to the Internet.

  Each game machine 2 is configured as an arcade game machine, and is installed in an appropriate number in a commercial facility such as a store 6. The router 4 is installed in association with each store 6 and the center server 3, and the game machines 2 in the same store are connected to the network 5 via the common router 4. A local server may be installed between the game machine 2 and the router 4 of the store 6, and the game machine 2 may be communicably connected to the center server 3 via the local server.

  The game machine 2 includes a microprocessor, a ROM in which a program such as an operating system to be executed by the microprocessor is recorded, and an internal storage device (not shown) such as a RAM that provides a work area for the microprocessor. A control unit 8 configured as a computer provided is provided. The game machine 2 is connected to an external storage device (not shown). The external storage device stores various game programs to be executed by the control unit 8 and various data referred to by the programs.

  The center server 3 includes a microprocessor, a ROM in which a program such as an operating system to be executed by the microprocessor is recorded, and an internal storage device (not shown) such as a RAM that provides a work area for the microprocessor. There is provided a control unit 7 configured as a computer equipped with. The center server 3 is connected to an external storage device (not shown). The external storage device stores various server programs to be executed by the control unit 7 and various data referred to by the programs.

  Next, an outline of an intro music hitting game will be described as an example of a game executed in the game system 1. FIG. 2 is a diagram showing an overview of an intro music hitting game executed in the game system 1. As shown in FIG. 2, the intro song-matching game is a winning game format in which a total of eight game machines 2 participate and fight three rounds, and the game machine 2 that has won each round can advance to the next round. belongs to. In the first round, the four game machines 2 become one group and are divided into two groups, and each group battles. In the second round and the third round, the game machines 2 that have won the first round face each other. As long as the player of each game machine 2 wins, the player can play up to the third round corresponding to the collection of one play fee.

  First, each game machine 2 displays an intention to participate in the game on the center server 3 via the network 5. As this intention display, a matching request is made from each game machine 2 to the center server 3. When eight game machines 2 participating in the first round are determined, the center server 3 matches each game machine 2 as an opponent or a friend of the first round, and uses the information as a matching list 10 for each game machine 2. Send. Further, the center server 3 designates one parent game machine that functions as a server in the first round among the eight game machines 2 that participated in the game. After transmitting these pieces of information, the connection between the center server 3 and each game machine 2 matched is released. After the connection is released, a server-client type connection is realized between the game machines 2 so that the parent game machine functions as a server and the other game machines function as clients. Thereby, instructions from the center server 3 are issued to game machines other than the parent game machine via the parent game machine. In the example of FIG. 2, the game machine 2a is designated as the parent game machine. Thus, the eight game machines 2 are connected so as to function as the game machine 2a as a server and the other game machines 2b to 2h as clients connected to the game machine 2a. The first round game proceeds. Note that there are various connection forms such as a star connection and a ring connection as connection forms between the eight game machines 2, but in order to suppress a communication time difference occurring between the game machines 2, as described above. A server-client type connection is preferable.

  In the first round group match, out of the two groups, four game machines 2 belonging to the group with the highest score obtained in the first round will advance to the semi-final of the second round as a winner and become the group with the lower score. The four game machines 2 to which it belongs become losers. Of the game machines 2 belonging to the loser group, the two game machines 2 with the highest scores in the group can proceed to the second round of the loser revival game, and the remaining two game machines 2 are the games. It becomes over. In the example shown in FIG. 2, since the score of the group G2 is higher than the group G1 among the two groups G1 and G2, the game machines 2e to 2h belonging to the group G2 proceed to the semi-final of the second round. On the other hand, since the two game machines 2c and 2d among the game machines 2a to 2d belonging to the group G1 which is a losing group have scored higher than the other game machines 2a and 2b, these game machines 2c 2d proceeds to the second round loser resurrection game, and the remaining two game machines 2a and 2b are over. Further, when the two game machines 2a and 2b losing in the first round are determined, the connection between all the game machines 2 is temporarily disconnected.

  In the second round, a loser resurrection game and a semi-final game are executed. The one-on-one battle between the two game machines 2c and 2d that belonged to the loser group G1 in the second round loser revival game, and the four game machines 2e to 2h that belonged to the winner group G2 in the semi-final game A one-to-one to one-to-one battle between the two is executed. At the start of the second round, the game machines 2c to 2h and the center server 3 are reconnected so that they can communicate with each other, and the game machines 2c to 2h proceeding to the second round determine the opponent for the center server 3. Make a matching request. The center server 3 is configured so that the game machine 2c and the game machine 2d of the loser group G1 are each other's opponents as a loser revival game, and the game machines 2e to 2h of the winner group G2 are each other as a semi-final A matching list in which the opponents of the game machines 2c to 2h are matched again is transmitted to the game machines 2c to 2h so as to be the opponent. After transmitting these pieces of information, the connection between the center server 3 and each game machine 2 matched is released.

  Further, the center server 3 designates one parent game machine functioning as a server in the second round from among the six game machines 2 participating in the second round. In the example of FIG. 2, the game machine 2c is designated as the parent game machine. As a result, the game machines 2c to 2h are connected in a server-client type in the second round, with the game machine 2c serving as a server and the other game machines 2d to 2h serving as clients, respectively. A second round game is executed between them. By designating only one game machine 2c as a parent game machine, each game machine 2c to 2h is connected between each game machine 2c and 2d in the loser revival game and each game machine 2e to h in the semi-final game. Information can be exchanged. Thereby, the progress situation of the loser resurrection game and the progress situation of the semi-final game can be managed in an integrated manner. However, it is necessary to prevent the semi-final game and the loser resurrection game from being influenced by each other's progress. For this reason, one of the two game machines 2c and 2d fighting the loser revival game and one of the four game machines 2e to 2h fighting the semi-final game each manage the progress of the game. It is further set as a master machine. Each of these two master machines executes progress management of the two game machines 2c and 2d and progress management of the four game machines 2e to 2h. As the progress management, for example, each master machine executes the question management of each question that is given in the loser resurrection game and the semi-final game. The question management includes, for example, question data to which guard conditions such as “loser revival game” and “semi-final game” are transmitted from the center server 3 via the parent game machine 2c in response to a request from each master machine, Each game machine 2e to 2h is realized by processing the data to be given questions based on the guard condition and filtering the data other than the questions to be discarded. In the first round and the third round except the second round, each parent game machine also functions as a master machine. Then, the winner of the two fighters in the revival game loses, and the top two of the four scoring high scores out of the four cars in the semi-final match each advance to the final of the third round. In the example of FIG. 2, the game machine 2d has decided to advance to the final in the loser resurrection game, and the two game machines 2e and 2f have decided in the semi-final game. When each game machine 2d-f proceeding to the third round is determined, the connection between all the game machines 2 is disconnected again.

  In the final of the third round, a one-on-one battle is executed between a total of three game machines 2d to f that have won the loser resurrection game and the semi-final game of the second round, respectively. At the start of the third round, the game machines 2c to 2h and the center server 3 are reconnected so that they can communicate with each other, and the three game machines 2d to 2f fighting in the final are determined by the center server 3 for determining opponents. Make a matching request. The center server 3 displays a matching list obtained by rematching the opponents of the game machines 2d to 2f so that the three game machines 2d to 2f that have advanced to the third round as the final game are opponents of each other. 2d to f. The center server 3 designates one parent game machine that functions as a server in the final game from the three game machines 2 fighting the final game. After transmitting these pieces of information, the connection between the center server 3 and each game machine 2 matched is released. In the example of FIG. 2, the game machine 2d is designated as the parent game machine. Thereby, each game machine 2d-f is also connected in a server-client type in the third round, with the game machine 2d serving as a server and the other game machines 2e, 2f serving as clients. The game of the final game progresses between. Of the three game machines 2d to 2f in the final game, the one game machine that achieved the best results in the final game will win.

  Next, details of the matching list 10 transmitted to each game machine 2 will be described. FIG. 3 is a diagram illustrating an example of the matching list 10. The matching list 10 is for notifying each game machine 2 of the opponent from the game server 2 from the center server 3, and as shown in FIG. 3, each game machine 2 matched as an opponent is shown. Various data such as an IP address and a session ID 15 are included. The session ID 15 is given by the center server 3 in response to a request for participation in the game, and is used for matching each game machine 2. As shown in FIG. 3, the session ID 15 includes an ID portion 15a and a round identification unit 15b for identifying a game round. The ID part includes “numerical value” (increase with each use), “date”, “a combination of values unique to the user / game machine” (global IP address, store registration number, MAC address, present in the case) Unique values such as system ID, e-AMUSEMENT pass ID, etc. However, if you use one game machine, it will avoid inconvenience if you lose the game due to loss etc.) That's fine. In addition, the round number corresponding to the round executed by the game machine 2 is given to the round identification unit 15b. For example, “1” is given when the battle executed on the game machine 2 is the first round, “2” is given when the game is the second round, and “3” is given when the game is the third round. Has been.

  Next, a process when the control unit 7 of the center server 3 and the control unit 8 of each game machine 2 execute an intro music hitting game will be described. FIG. 4 is a flowchart showing the process of the control unit 8 of the game machine 2 and the process of the control unit 7 of the center server 3 when the opponent of each game machine 2 is determined. In step S1 of FIG. 4, the control unit 8 of the game machine 2 first determines whether or not the round to which each game machine 2 belongs has ended. If the round to which each game machine 2 belongs has been completed, the process proceeds to step S2, the connection between the game machines 2 is released, and the process proceeds to step S3. On the other hand, if it is determined in step S1 that the round to which each game machine 2 belongs has not ended, the following steps are skipped and the current routine is ended. In subsequent step S3, the control unit 8 of the game machine 2 determines whether or not an operation as an intention to participate in the game or the next round is performed by the player. As an intention to participate, collection of a play fee corresponds. If it is determined in step S3 that an intention to participate in a game or the like is displayed, the process proceeds to step S4. On the other hand, if it is determined in step S3 that the intention to participate in the game or the like is not displayed, the following steps are skipped and the current routine is terminated. In the subsequent step S4, the control unit 8 of the game machine 2 sends a matching request to the center server 3 as an intention display to participate in the intro music hitting game based on the operation of the player. If the game machine 2 has a session ID 15, the matching request in step S1 includes the session ID 15. The control unit 7 accepts a matching request from the game machine 2 in step S11. In subsequent step S12, the control unit 7 determines whether or not the session ID 15 exists in the matching request received from the game machine 2 as a predetermined condition. When the session ID 15 does not exist in the matching request, the process proceeds to step 13, and the control unit 7 adds the record of the game machine 2 to the 8 table. When eight records are added to the eight table, the control unit 7 issues a common (identical) session ID 15 to the eight game machines 2 included in the eight table in step S14. The process proceeds to step S15. That is, it is determined that each game machine 2 added to the table for 8 units, in other words, each game machine 2 corresponding to the first matching that does not have the session ID 15 satisfies the predetermined condition, and the session ID 15 is given. The The round identification unit 15b of the session ID 15 issued by the control unit 7 in step S14 is “1”.

  On the other hand, if an affirmative determination is made in step S12, the control unit 7 proceeds to step S18 and determines how many rounds of matching requests are applicable from the session ID 15 included in the matching requests. As described above, since the session ID 15 includes the round identifying unit 15b for distinguishing each round executed by the game machine 2, this determination is based on the round identifying unit 15b of the session ID 15. Executed. In step 18, when the round identification unit 15b included in the session ID 15 indicates the first round, that is, when the round identification unit 15b is “1”, the process proceeds to step S19, and six control units 7 are provided. Add a record of game machine 2 to the table. When adding the record of the game machine 2 to the 6-table, the control unit 7 adds the game machine 2 having the same session ID 15 to the same 6-table based on the session ID 15. When six records are added to the six-table, the process proceeds to step S20. In step S20, the control unit 7 rounds the session ID 15 held by the six game machines 2 in the six-table. The identification unit 15b is updated from “1” to “2”, and the process proceeds to step S15. The ID part 15a of the session ID 15 is not changed.

  In step S18, if the round identification unit 15b included in the session ID 15 indicates the second round, that is, if the round identification unit 15b is “2”, the process proceeds to step S21, and the control unit 7 The record of the game machine 2 is added to the table for 3 units. When adding the record of the game machine 2 to the table for 3 units, the control unit 7 adds the game machine 2 having the same session ID 15 to the same table for 3 units based on the session ID 15 as in step S19. . When three records are added to the three table, the process proceeds to step S20. In step S20, the control unit 7 rounds the session ID 15 held by the three game machines 2 of the three table. The identification unit 15b is updated from “2” to “3”, and the process proceeds to step S15.

  In step S15, the control unit 7 creates the matching list 10 based on the tables created in steps S13, S19, and S21. In subsequent step S16, the control unit 7 determines one parent game machine 2 that should function as a server between the game machines 2, and proceeds to step S17. The parent game machine may be determined according to various conditions that can identify one game machine, such as random selection and selection of the game machine that has been accessed most quickly. In step S17, the matching list 10 created in step S15 and the information of the parent game machine 2 determined in step S16 are transmitted to each game machine 2, and the current routine is terminated. Note that the information of the parent game device 2 may be included in the matching list 10. Further, the order between the creation of the matching list 10 and the determination of the parent game machine may be reversed. In addition, the loser resurrection game between the game machines 2 belonging to the loser group and the semi-final game between the game machines belonging to the winner group are identified by a code for identifying a separately provided group, and the matching list 10 is created. This is realized by considering a code for identifying this group.

  In step S <b> 5, the control unit 8 of the game machine 2 acquires the matching list 10 and the parent game machine 2 information transmitted from the control unit 7. In subsequent step S6, the control unit 8 of the game machine 2 executes setting of the matching environment. The setting of the matching environment corresponds to, for example, execution of a server-client type connection or display of an opponent or a friend so that the parent game machine 2 functions as a server. Each parent game machine also executes the setting of the master machine as the setting of the matching environment. At this time, in the second round, one master machine is set out of each game machine 2 belonging to the loser revival game and each game machine belonging to the semi-final game according to various conditions that can identify one machine. . In the next step S7, the control unit 8 of the game machine 2 permits the start of the game and ends the current routine.

  According to this aspect, the connection between the game machines is disconnected every round of the winning game, and the matching for determining the opponent and the determination of the parent game machine are executed on the center server 3 side. This can reduce the processing on the game machine side and the opportunity to transmit and receive information between the game machines, thereby reducing the load on the game machine side. Various processes and data can be managed centrally on the center server 3 side. By these, development load, maintenance load, etc. can be suppressed. Even if the parent game machine is defeated in each round, the center server 3 newly determines the parent game machine in the subsequent rounds. Server-client connection between the game machines 2 can be easily realized. Thereby, it is possible to suppress the occurrence of trouble in the progress of the game. Further, the same session ID 15 is assigned to the eight game machines 2 participating in the winning match. For this reason, by referring to the session ID 15, matching between the respective game machines 2 for each round executed on the center server 3 side can be easily realized. Further, since the matching executed for each round only changes the number of game machines 2 to be matched according to the round, a common process can be used for matching of each round. As a result, the development load and the hardware resources used can be suppressed. Moreover, since the center server 3 performs matching, it is possible to suppress matching processing to be implemented in each game machine 2. Compared with the center server 3, since there are many game machines 2, hardware resources can be saved greatly.

  In the above-described embodiment, the control unit 7 of the center server 3 functions as an ID assigning unit, a matching unit, and a determining unit by executing the routine of FIG. Further, when the control unit 8 of the game machine 2 executes the routine of FIG. 4, it functions as a matching request unit and a connection release unit. Moreover, the game machine 2 functions as a connection means and a master machine setting means by executing step S6 of FIG.

  This invention is not limited to the above-mentioned form, It can implement with a suitable form. In the above-described form, a win-type game that reduces the number of opponents for each round is executed as a game that fights a plurality of rounds. However, a game that fights a plurality of rounds is not limited to such a form. . For example, as a game for fighting a plurality of rounds, a league-type game may be executed in which a certain number of game machines compete with each other while changing opponents for each round, and compete for the winning percentage of the entire plurality of rounds. The connection between the game machines 2 is preferably a server-client type connection as described above, but is not limited to such a connection type.

  In the above-described form, the round identifying unit 15b included in the session ID 15 identifies the round. However, the round identifying unit 15b may include a code for identifying the loser revival game. In this case, for example, “A” may be used as the identification code for the loser revival game in the round identification unit 15b. Also, for example, when a session ID is assigned for the first time, “A”, “B”, etc. may be assigned to the round identification unit 15b as codes for distinguishing groups. Also in this case, in the case of two rounds of matching, the winner group can be matched to the semi-final match, and the loser group can be matched to the loser revival match. Further, a plurality of digits may be prepared as the round identification unit 15b.

  In the above-described form, the round ID 15b is included in the session ID 15, but it is not limited to such a form. As long as the number of matching requests corresponding to a round can be identified, for example, a code different from the session ID may be assigned as a round identification code, and the round may be identified by the code included in the matching request. This code may be given on the game machine side or may be updated in a round. Further, for example, the connection destination of each game machine may be distinguished for each round by an IP address or the like distinguished for each round included in the matching list. In this case, a center server may be prepared for each connection destination, or a connection destination for each round may be provided in one center server. In addition, the game may be configured such that participation of the game machine is possible from rounds in the middle of a plurality of rounds. In this case, for example, if another code is used as the round identification code, this code may be included in the matching request from the game machine as round information that the game machine wants to participate in. By using this code, the process changes to step S12 and step S13 in FIG. 4, and a step for identifying round information is prepared as a predetermined condition, and the process proceeds to step S19 or step S21 depending on the desired round of participation. In this case, a session ID may be assigned to a game machine that does not have a session ID.

  In the above-described form, a code for identifying the group is separately provided. However, like the round identification unit 15b, it may be included in the session ID, or a different connection destination is provided for each group. It may be. Further, in the above-described form, in the second round, two battles with different conditions, that is, a losing revival game of the top two losers in the first round and a semi-final of the four round winners in the first round A battle is being executed, but the conditions are not limited to such conditions. A process of further matching a plurality of groups to which a plurality of game machines formed by matching belong between the groups may be provided. As a result, a game executed in each group and a game executed between a plurality of groups can be combined, so, for example, one or a plurality of units that won the league game executed in each district A tournament-type game can be further executed between game machines. In other words, in the same round, it is possible to realize a battle with different conditions of a league game and a tournament game. Moreover, in the above-mentioned form, although the game machine 2 functions as a master machine setting means, it is not limited to such a form. For example, the setting of the master machine may be executed by the center server 3 in the same manner as the determination of the parent game machine. In this case, the control unit of the center server functions as a master machine setting unit.

1 game system 2 game machine (master machine setting means)
3 Center server 5 Network (communication line)
7 Control unit (ID assigning means, matching means, determining means)
8 Control unit (matching request means, connection means, connection release means)
10 Matching list 15 Session ID
15a ID part 15b Round identification part

Claims (8)

A center server and a plurality of game machines connectable to the center server via a communication line, and a constant one of the plurality of game machines according to a matching request from each game machine of the plurality of game machines A number of game machines are matched, and after the matching is finished, the connection between each of the matched game machines and the center server is released, and the fixed number of game machines connected so as to communicate with each other In a game system in which a game that fights multiple rounds is executed,
Each of the plurality of game machines includes a matching request unit that executes the matching request every time each round of the plurality of rounds starts, and each of the matched each time each round of the plurality of rounds starts. Connection means for connecting the game machines so that they can communicate with each other, and connection release means for releasing the connection between the matched game machines every time each round of the plurality of rounds is completed,
The center server includes matching means for matching each game machine satisfying a predetermined condition among the plurality of game machines as the fixed number of game machines at the start of each round in response to a matching request from each game machine. And an ID providing means for giving the same session ID to each game machine that is matched for the first time among the game machines that are matched at the start of each round by the matching means,
The matching means uses the session ID as the predetermined condition, and each game machine to which the same session ID is assigned, or each game machine to which the session ID is not assigned to each other, A game system characterized by matching. The center server is further provided with a determining means for determining a parent game machine that issues an instruction to another game machine based on an instruction from the center server among the game machines.
The game system according to claim 1, wherein the connection unit connects the game machines so that the parent game machine functions as a server and other game machines function as clients that follow instructions from the parent game machine.   The game system according to claim 2, wherein the determination unit determines the parent game machine every time each of the plurality of rounds starts. In the same round of the plurality of rounds, a plurality of battles to which each game machine matched under different conditions belongs is executed,
A master in which at least one of the center server and the plurality of game machines sets one master machine for managing the progress of the game from each game machine belonging to each of the plurality of competitions for each of the plurality of competitions. The game system according to any one of claims 1 to 3, further comprising a machine setting means.   The game system according to claim 1, wherein an identification code for identifying the plurality of rounds is included in the matching request from each game machine to the center server.   The game system according to claim 5, wherein the session ID includes a round identification unit as an identification code for identifying the plurality of rounds. A center server and a plurality of game machines connectable to the center server via a communication line, and a constant one of the plurality of game machines according to a matching request from each game machine of the plurality of game machines A number of game machines are matched, and after the matching is finished, the connection between each of the matched game machines and the center server is released, and the fixed number of game machines connected so as to communicate with each other A computer program applied to a game system in which a game for fighting multiple rounds is executed,
Matching request means for executing the matching request every time each of the plurality of rounds starts each of the plurality of game machines, and each of the matched game machines each time each round of the plurality of rounds starts A connection means for connecting the communication between each other, and a connection release means for releasing the connection between the matched game machines each time the rounds of the plurality of rounds are completed ,
Each of the plurality of game machines
The center server processes each game machine with the same session ID that is matched at the first of a plurality of rounds, or each game machine that is not assigned the session ID with each other. that, the computer program characterized by. A center server and a plurality of game machines connectable to the center server via a communication line, and a constant one of the plurality of game machines according to a matching request from each game machine of the plurality of game machines A number of game machines are matched, and after the matching is finished, the connection between each of the matched game machines and the center server is released, and the fixed number of game machines connected so as to communicate with each other A computer program applied to a game system in which a game for fighting multiple rounds is executed,
Matching means for matching the center server according to a matching request from each game machine, with each game machine satisfying a predetermined condition among the plurality of game machines as the fixed number of game machines, and It is configured to function as an ID granting unit that gives the same session ID to each game machine that is matched for the first time among the game machines that are matched at the start of each round,
Further, using the session ID as the predetermined condition, the game machines to which the same session ID is assigned to each other, or the game machines to which the session ID is not assigned to each other are used. A computer program configured to function as a matching means.

Images