JP6820804B2 - Game system - Google Patents

Description

The present invention relates to a game system capable of competitive play between game machines.

Conventionally, there has been a game system in which game machines can be played against each other (for example, Patent Document 1).
However, in the conventional game system, the relationship between the play before the start of the competitive play and the competitive play is low.

Japanese Unexamined Patent Publication No. 2006-212288

An object of the present invention is to provide a game system having an improved relationship between a play before the start of a battle play and a battle play.

The present invention solves the problem by the following solution means. In addition, in order to facilitate understanding, the description will be given with reference numerals corresponding to the embodiments of the present invention, but the present invention is not limited thereto. Further, the configurations described with reference numerals may be appropriately improved, and at least a part thereof may be replaced with other configurations.

The first invention has a server (50,350,650) having a control unit (70,72), a first game machine (10 (G011)) having a control unit (30,31,32), and the like. A game system in which a plurality of game machines including a second game machine (10 (G022)) are provided, and battle play between game machines is started according to matching the first game machine and the second game machine. Therefore, in this game, a character operated by a player and an enemy character play against each other, and the control unit of the server is playing one player on the first game machine while the first game machine is in progress. When the one-player enemy character (C13) and the character (C13) selected by the player of the second game machine in one-player play are the same, the first game machine and the second game machine are used. It is a game system characterized by matching.
The second invention is the game system of the first invention, in which the game forms a team having a plurality of characters (C) in each game machine, and the control unit of the server (50, 350, 650). In (70, 72), while one-player play is in progress on the first game machine (10 (G011)), the enemy character (C13) fighting on the first game machine is the second game machine (10). (G022)) is a game system characterized in that the first game machine and the second game machine are matched when they are included in the team.
A third invention is a game system of the first or second invention, in which a character (C3) operated by a player and an enemy character (C13) are associated with each other in this game, and each game machine (10). ) Control unit (30, 31) is a game system characterized by executing a battle between a character selected by a player and an enemy character corresponding to the character selected by the player in one-player play. is there.
A fourth aspect of the present invention is that in the game system of the third aspect, the control units (30, 31) of each game machine (10) change the enemy character according to the change operation in one-player play. It is a featured game system.

According to the present invention, the following effects can be obtained.
-In the first invention, when the enemy character of the one-player play of the first game machine and the character selected by the player of the second game machine in the one-player play are the same, both are matched, so that one person You can improve the relationship between play and competitive play.
-In the second invention, when an enemy character competing in the first game machine is included in the team of the second game machine, both are matched. Therefore, in a game in which a team battle is performed by a plurality of characters, one person You can improve the relationship between play and competitive play.
-In the third invention, in one-player play, the character selected by the player and the corresponding enemy character play against each other, so that it is possible to play against a specific character corresponding to the selected character.
-In the fourth invention, in one-player play, the enemy character is changed according to the change operation, so that the player can play against a plurality of enemy characters.

It is a figure explaining the whole structure of the game system 1 of 1st Embodiment. It is a block diagram of the game machine 10, the billing card 41, the ID card 42, and the central server 50 of the 1st Embodiment. It is a perspective view of the game machine 10 of 1st Embodiment. It is a figure explaining the command table 21a (T1) and the command correction table 21b (T1) of the title T1 of 1st Embodiment. It is a figure explaining the store information storage unit 63, the operation information storage unit 64, and the communication state evaluation tables 26, 66 of 1st Embodiment. It is a figure explaining the communication state history storage unit 65, the communication state history storage unit 65a of 1st Embodiment. It is a figure explaining the player information storage part 67a of 1st Embodiment. It is a figure explaining the frame exchange process (small delay) in the inter-store battle play of 1st Embodiment. It is a figure explaining the frame exchange process (large delay) in the inter-store battle play of 1st Embodiment. It is a figure explaining the frame exchange process (stop period input process) in the inter-store battle play of 1st Embodiment. It is a figure explaining the transition of a series of operation states of the game system 1 of 1st Embodiment. It is a flowchart of the communication state acquisition processing of 1st Embodiment. It is a figure explaining the communication state acquisition process between the store A and the store B-D communication of 1st Embodiment. It is a flowchart from the play acceptance to the matching selection process of 1st Embodiment. It is a flowchart of the in-store matching process of 1st Embodiment. It is a flowchart of the inter-store matching process of 1st Embodiment. It is a flowchart of the inter-store matching process of 1st Embodiment. It is a figure which shows the title selection screen 80 and the matching type selection screen 81 of 1st Embodiment. It is a figure which shows the display screen at the time of matching in the store of 1st Embodiment. It is a figure which shows the display screen at the time of matching between stores of 1st Embodiment. It is a figure which shows one scene of the inter-store battle play screen 86 of 1st Embodiment. It is a flowchart of the cancellation processing of the battle play between stores of 1st Embodiment. It is a flowchart of the delay influence analysis processing of 1st Embodiment. It is a figure which shows the store-to-store battle play screen 87 of 1st Embodiment. It is a flowchart of the point giving process of 1st Embodiment. It is a flowchart of the store introduction process of 1st Embodiment. It is a figure explaining the store-to-store battle play end screen 88 of 1st Embodiment. It is a figure explaining the positional relationship between stores of 1st Embodiment, and the state of communication between stores. It is a figure explaining the search result display screen 91-93 of 1st Embodiment. It is a flowchart of the play restart processing of 1st Embodiment. It is a flowchart of the play restart processing of 1st Embodiment. It is a figure which shows the resumption title selection screen 95 of 1st Embodiment. The matching selection process of the second embodiment will be described. It is a figure which shows the matching type selection screen 281 and the title selection screen 280 of the 2nd Embodiment. It is a flowchart of the provisional point processing of 3rd Embodiment. It is a figure explaining the flow of the provisional point processing of 3rd Embodiment. It is a figure explaining the advance input process of 4th Embodiment. It is a figure explaining the in-store search time table 527a, 527b of the 5th embodiment. It is a figure explaining the character combination table 621c, the team composition storage unit 621d, and the standby team composition storage unit 668 of the sixth embodiment. It is a flowchart of the inter-store matching process of the sixth embodiment. It is a figure which shows the display screen at the time of the inter-store matching process of 6th Embodiment.

(Embodiment)
Hereinafter, embodiments of the present invention will be described with reference to the drawings and the like.
(First Embodiment)
Hereinafter, the first embodiment of the present invention will be described with reference to the drawings and the like.
FIG. 1 is a diagram illustrating an overall configuration of the game system 1 of the first embodiment.
FIG. 2 is a block diagram of the game machine 10, the billing card 41, the ID card 42, and the central server 50 of the first embodiment.
FIG. 3 is a perspective view of the game machine 10 of the first embodiment.
FIG. 4 is a diagram illustrating a command table 21a (T1) and a command correction table 21b (T1) of the title T1 of the first embodiment.
FIG. 5 is a diagram illustrating the store information storage unit 63, the operation information storage unit 64, and the communication state evaluation tables 26 and 66 of the first embodiment.
FIG. 6 is a diagram illustrating the communication state history storage unit 65 and the communication state history storage unit 65a of the first embodiment.
FIG. 7 is a diagram illustrating the player information storage unit 67a of the first embodiment.
In the embodiment, when a specific player P is indicated, a player name is used as appropriate, and a player ID, which is player identification information, is added in parentheses. That is, the specific player P is described as, for example, a player (P011), Ichiro (P011), or the like. Similarly, when a specific game machine 10 is indicated, a game machine ID (game machine identification information) is added in parentheses, and the game machine 10 (G011) or the like is described.
Further, in the embodiment, the term "matching" is mainly used to mean "combination" and "combination". Further, in the embodiment, the display of the display unit 14 which can be selected by the pointer 14a is also referred to as a “button” or the like, and the operation for selecting the display unit 14 is also referred to as a “button operation”, a “selection operation” or the like.

[Configuration of game system 1]
As shown in FIG. 1, the game system 1 includes a store system 5 which is an in-store system and a central server 50 installed at a place different from the store. Stores are those operated by game makers and store owners (also called amusement facilities), those owned by commercial facilities, and the like. Note that FIG. 1 shows an example in which the store system 5 is installed in four stores A to D in the game system 1, but in reality, the store system 5 is installed in more stores.
The central server 50 is a server owned by an operator (game maker or the like) who controls and manages the game system 1.

The store system 5 and the central server 50 are connected to each other via a communication network 2 such as the Internet via a connection device 6, and can communicate with each other.
As a result, information can be communicated between the store server 7 and the central server 50, and between the game machines 10 and the central server 50.
The connection device 6 has functions such as a store server 7, a modem for connecting the game machine 10 to the communication network 2, an ONU (optical network unit), and the store server 7 in the same store (hereinafter, also simply referred to as “in-store”). It is a device having a function of a router for communicating between the game machine 10 and the game machine 10.

The store server 7 and the game machine 10 in the store are connected by an in-store communication network 8 such as a LAN, and can communicate with each other. Note that the inter-device communication in the store includes communication between each game machine 10 and other game machines 10 in the store, in addition to communication between the store server 7 and each game machine 10 in the store. As a result, each game machine 10 and other game machines 10 in the store can play against each other.
Further, each store system 5 and the other store system 5 are connected by a communication network 2. As a result, the game machine 10 of each store system 5 and the game machine 10 of the other store system 5 communicate with each other without going through the central server 50 in battle play or the like (hereinafter, also referred to as "inter-store communication"). You can do). In the inter-store communication, each game machine 10 functions as a client and a server, and is also referred to as P2P (peer-to-peer).

In the embodiment, the computer means an information processing device provided with a storage device, a control device, and the like, and the game machine 10, the store server 7, and the central server 50 each include a storage unit and a control unit, and the concept of a computer. include.
Each storage unit is a storage device such as a hard disk or a semiconductor memory element for storing programs, information, and the like necessary for the operation of each device.
Each control unit is a device for performing arithmetic processing necessary for the operation of each device and for controlling each device in an integrated manner. The control unit is composed of, for example, a CPU (Central Processing Unit) or the like. The control unit realizes various functions of the embodiment by appropriately reading and executing various programs stored in the storage unit.

(Configuration of store system 5)
As shown in FIGS. 1 and 2, the store system 5 includes a game machine 10 and a store server 7 (play start management device). These devices are placed in the store.

(Game console 10)
As shown in FIGS. 1 to 3, the game machine 10 is a device in which each player P actually plays. In the game machine 10, for example, the player P plays while sitting on a chair.
In the embodiment, the store system 5 includes, for example, four game machines 10, and four players P can play at the same time. Hereinafter, the configuration of the game machine 10 (G011) of the store A will be mainly described, but the other game machines 10 also have the same configuration. Further, FIGS. 2 and 3 show the configuration of the game machine 10 (G011), but other game machines 10 have the same configuration.

The game machine 10 (G011) includes a coin slot 11a, a billing card RW (reader / writer) 11b, an ID card reader 12 (player identification information input unit), an operation unit 13, a display unit 14, a power switch 16, a storage unit 20, and the like. A control unit 30 is provided.
The coin slot 11a and the billing card RW11b are billing units that charge the play fee from the player P. The player P can pay the play fee by inserting coins or paying with the billing card 41.
The coin insertion slot 11a is an insertion slot for the player P to insert coins for playing. A coin detection unit (not shown) such as an optical sensor for detecting the inserted coin is provided in the coin insertion slot 11a. When the coin detection unit detects a coin, the coin detection unit outputs a coin detection signal to the control unit 30.

The billing card RW11b is a device that charges the play fee by communicating with the billing card 41 possessed by the player P.
The billing card 41 has a built-in RFID tag 41a that stores the remaining charge amount 41b. Communication between the billing card RW11b and the billing card 41 is possible in a non-contact manner by an electromagnetic induction method or the like. By communicating with the billing card 41, the billing card RW11b subtracts the play fee from the remaining charge 41b of the billing card 41.

The ID card reader 12 is a device that communicates with the ID card 42 possessed by the player P to read and acquire the player ID 42b (player identification information) capable of identifying the player P.
The ID card 42 has a built-in RFID tag 42a that stores the player ID 42b. The ID card reader 12 and the ID card 42 can communicate with each other in a non-contact manner by an electromagnetic induction method or the like.
The billing card 41 and the ID card 42 can also be used as one card. In this case, the identification information of the billing card 41 may be used as the player identification information, and the billing card RW11b and the ID card reader 12 may be combined into one device.

The operation unit 13 is operated by the player P before the start of play, during the progress of play, after the start of play, and the like. The operation unit 13 is provided on the operation panel 10a on the front side of the game machine 10 (G011).
The operation unit 13 includes one lever 13a, six buttons (a button to f button), and a start button 13b.
The lever 13a is a member that is operated so as to tilt in the left-right direction X, the depth direction Y, and a combined direction thereof.

The a button to the f button and the start button 13b are push buttons.
The a button to the f button are mainly operated during play.
The start button 13b is mainly used for an operation at the start of play and a selection operation of various buttons displayed on the display unit 14 before and after the start of play.

The display unit 14 is, for example, a liquid crystal display device or the like. The display unit 14 displays various screens before the start of play, play screens during play, various screens after the end of play, and the like.
The power switch 16 is a switch operated by a store clerk (worker) or the like to turn on the power of the game machine 10 (G011). The power switch 16 is arranged in a switch box for maintenance. The switch box is covered by the door 16a while the game machine 10 (G011) is in operation.

The storage unit 20 includes a game program 21 (21 (T1 to T4)), a matching program 22, a game machine ID storage unit 23, and a communication state evaluation table 26.
Game programs 21 (T1 to T4) are four programs with different titles. The number and genre (type) of the game program 21 are not limited.
For example, the two game programs 21 (T1) and 21 (T2) relate to fighting games with titles T1 and T2, respectively. The titles T1 and T2 are different types of games provided by different manufacturers. The game programs 21 (T3) and 21 (T4) relate to a racing game of title T3 and a shogi game of title T4, respectively.
In the embodiment, the game itself is also simply referred to as a title.
The titles T1 to T4 can be played by one player or in a competitive play depending on the selection of the player P.
The one-player play is a form in which the player (P011) of the game machine 10 (G011) competes by one person. The one-player play is also called a CPU battle, and in the case of a fighting game, the character C operated by the player P and the enemy character controlled by the control unit 30 play against each other. The battle play is a form in which a plurality of players (two players in the embodiment) play against each other. That is, in the battle play, the player (P011) of the game machine 10 (G011) and the player P of another game machine 10 play against each other. Is what you do.

Each game program 21 (T1 to T4) has a command table 21a (T1 to T4) and a command correction table 21b (T1 to T4).
4 (A) and 4 (B) show the command table 21a (T1) and the command correction table 21b (T1) of the title T1 as an example.
The command table 21a (T1) stores the operation of the operation unit 13 and the command (instruction) executed in the game in association with each other.
Since the title T1 is a fighting game, the command in the command table 21a (T1) is information about the skill of the character operated by the player P. Further, the command table 21a (T1) stores the attack value (damage to the enemy character) in association with the operation and command of the operation unit 13.

The types of commands include a command corresponding to a single operation of the operation unit 13 and a command corresponding to a combined operation of the operation unit 13.
The single operation is a single operation of the operation unit 13. For example, a single operation of the a button has a weak punch and an attack value of 5.
The combined operation is an operation having at least one of simultaneous operation and continuous operation of the operation unit 13. The arrows in the command table 21a (T1) indicate continuous operations. For example, after the lower operation of the lever 13a, the simultaneous pressing of the b button and the e button is trampled and the attack value is 100.
As described above, in the fighting game, the more complicated the operation of the operation unit 13, the greater the skill and the damage to the enemy.

Although not shown, the command table 21a (T1) stores a defense value for defending against an attack from an enemy. The command table 21a (T1) stores an operation for defense (for example, a lever operation) and a defense value in association with each other.
Such settings are not limited to fighting games. For example, in the case of a drive game, commands that require advanced techniques such as spin turns are set when the interval between multiple operations is short. You may.

The command correction table 21b (T1) stores correction values (parameter values according to the communication state) for correcting the attack value and defense value (ability value) of the command table 21a (T1) for each character C1 to C6.
The command correction table 21b (T1) stores the communication state (communication state between game machines) in association with the correction values of the attack value and the defense value. The communication state is the communication state of inter-store communication. Details of the communication status will be described later.
The correction value of the attack value and the defense value is a value for correcting the attack value and the defense value of each character C1 to C6. The attack value or the like in each communication state is calculated by the product of the attack value or the like of the command table 21a (T1) and the correction value of the command correction table 21b (T1).

The matching program 22 is a program for the game machine 10 (G011) to match with another game machine 10. The matching program 22 is a program for matching the game machine 10 (G011) and another game machine 10 (G012 to G014) in the store A, and the game machine 10 (G011) and the game machine 10 of another store match. Therefore, a program that performs processing related to communication between the game machine 10 (G011) and the central server 50 is included.
The game machine ID storage unit 23 stores the game machine ID that identifies the game machine 10 (G011). The game machine ID is individual information of each game machine 10.

As shown in FIG. 5C, the communication state evaluation table 26 stores the frame delay occurrence rate, the communication state evaluation, and the antenna image in association with each other.
That is, the communication state evaluation table 26 stores the evaluation of the communication state corresponding to the frame delay occurrence rate.
The frame delay occurrence rate indicates the degree of communication delay in inter-store communication. The details of the frame delay occurrence rate will be described later.
The evaluation of the communication state indicates the evaluation corresponding to each range of the frame delay occurrence rate. The communication state evaluation table 26 stores the following evaluation contents.
Less than 5%: Best 5% or more and less than 10%: Good 10% or more and less than 15%: Possible 15% or more and less than 20%: Evil 20% or more: Not possible

In the antenna image, the delay occurrence rate of the frame is shown as an image on the display unit 14.
The antenna image corresponds to each range of frame delay occurrence rates. In the antenna image, each range of the frame delay occurrence rate is represented by the number of antennas.
In the example of FIG. 5C, the frame delay occurrence rate is "less than 5%", "5% or more and less than 10%", "10% or more and less than 15%", "15% or more and less than 20%", "20%". Corresponding to the above, the number of antennas is "4", "3", "2", "1", and "0 (none)".

The control unit 30 includes a play control unit 31 and a matching control unit 32.
The play control unit 31 controls and processes the progress of play by operating the game program 21 (T1 to T4).
The matching control unit 32 controls and processes matching with another game machine 10 by operating by the matching program 22.
Details of the processing of the control unit 30 will be described later.

(Store server 7)
The store server 7 is a server that manages the store system 5.
The store server 7 includes a storage unit and a control unit (not shown), and can manage, aggregate, and the like the operating status, billing status, and the like of the game machine 10 in the store.
A detailed description of the store server 7 will be omitted.

(Configuration of central server 50)
As shown in FIGS. 1 and 2, the central server 50 is a server that manages the game system 1 in an integrated manner.
The central server 50 manages player information, sales of each store, matching processing between game machines 10 of different stores, and the like.

The central server 50 includes a storage unit 60 and a control unit 70.
The storage unit 60 includes a game program 21 (T1 to T4), a matching program 62, a store information storage unit 63, an operation information storage unit 64, a communication state history storage unit 65, a communication state evaluation table 66, and a player information storage unit 67. ..
The game program 21 (T1 to T4) is distributed to each game machine 10. That is, the game programs 21 (T1 to T4) of each game machine 10 are downloaded or updated from the central server 50.

The matching program 62 is a program for matching the game machines 10 of each store with the game machines 10 of other stores. That is, the matching program 62 is mainly related to the matching process of the inter-store battle play.

As shown in FIG. 5A, the store information storage unit 63 stores the store name (store identification information), the store location information, and the game machine ID in association with each other.
The store name is information used as store identification information. This identification information may be based on a list of alphanumeric characters (SHOP-ID001) or the like.
The store location information is information that identifies the location of the store. In the embodiment, the store location information is address information, but is not limited to this, and may be latitude / longitude information.
The game machine ID is that of the game machine 10 arranged in the store.

As shown in FIG. 5B, the operation information storage unit 64 stores the information of each game machine 10 at the present time.
The operation information storage unit 64 requests the game machine ID of each store, the player ID of the player P being played, the one-person title being played, the battle title during the in-store or inter-store battle, and the player P requesting inter-store matching. The titles are associated and stored.
The control unit 70 of the central server 50 acquires this information by communicating with each game machine 10 and stores it in the operation information storage unit 64.
In the example of FIG. 5B, in the operation information storage unit 64, for example, the player (P011) is playing the game of the title T1 on the game machine 10 (G011) of the store A “game ID = G011”. Yes, and also stores information requesting matching of titles T1 and T2.
The timing at which the central server 50 and each game machine 10 communicate with each other is not limited, and may be, for example, sequentially, every specified time, or the like. Further, for example, when each game machine 10 changes the state of each game machine 10 (for example, when a game is received from the player P), even if each game machine 10 transmits information on the change to the central server 50. Good.

As shown in FIG. 6A, the communication status history storage unit 65 stores the communication status history of inter-store communication between the game machine 10 of each store and the game machine 10 of another store.
Here, in the relationship between each store and other stores, the communication status history between one of the plurality of game machines 10 of each store and one of the plurality of game machines 10 of the other store should be stored. Just do it. This is because all the game machines 10 in the store usually have the same communication state with the outside. For example, in the relationship between the store A and the store B, the inter-store communication history of the game machine 10 (G014) of the store A and the game machine 10 (G021) of the store B may be stored.

In the embodiment, the communication state of transmission (so-called uplink) from the game machine 10 of each store and the communication state of reception (so-called downlink) from the game machine 10 of another store will be described as being the same. May be different. In this case, for example, the upstream communication state may be stored in the upper right column of FIG. 6A, and the downlink communication state may be stored in the column indicated by the diagonal line in the lower left.
The communication state history storage unit 65a of FIG. 6 (B) omits the correspondence between the communication state history storage unit 65 of FIG. 6 (A) and the game machine 10, and arranges only the correspondence between stores. ..

As shown in FIG. 5C, the communication state evaluation table 66 is similar to the communication state evaluation table 26 of the game machine 10.
As shown in FIG. 7, the player information storage unit 67 stores the player ID of the player P in association with various information.
Various information is a player name, a title, a rank, and points (dan points).
The player name is a nickname or the like used when the player P plays, and does not have to be the real name. The player name can be registered from a registration device (for example, an ID card 42 vending machine, a game machine 10, an information terminal (mobile phone, etc.) possessed by the player P, etc.).

The game title is the title name of the game that the player P has played in the past.
The player information storage unit 67 stores, for example, "player ID = P011" and titles T1 and T2 in association with each other. This is information indicating that the player (P011) has played the game of the titles T1 and T2 in the past.

The player information storage unit 67 stores the player P in association with the combination of the game title, the rank, and the points. That is, the player information storage unit 67 stores the player P and the ranks and points of each game title in association with each other.
In the example of FIG. 7, the player P with "player ID = P011" has a game play history of titles T1 and T2. Therefore, the player information storage unit 67 stores the "player ID = P011", the combination of the rank and points of the title T1, and the combination of the rank and points of the title T2.

The rank indicates the grade of the skill of the game of the player P. The calculation method and the like for the rank are set according to the specifications of each game. The rank can be determined by, for example, the following method.
That is, the ranks are set from the first rank to the tenth rank.
Each player P is given points "3" when he / she plays against a player P whose rank is the same as himself / herself, and points "2" when he / she plays against a player P whose rank is one rank different from his / her own. Points "1" are awarded when a player P with a rank different from one's own is played, and points are not given when a player P with a rank different from one's own is played. Granting is a concept that includes addition and subtraction, and if you win, points are added and points are subtracted. When the total points are 10 or more, the rank is promoted (that is, one step goes up), while when the total points are -10 or more, the rank is demoted (that is, one step goes down).

In the example of FIG. 7, the player information storage unit 67, “player ID = P011”, “title T1”, “dan = 6”, and “point = 8” are stored in association with each other. This is information indicating that the player P of the player (P011) is the rank 6 and the point 8 of the title T1.
Similarly, the player information storage unit 67 stores "player ID = P011", title T2, "dan = 5", and "point = -2" in association with each other. This is information indicating that the player (P011) is at rank 5 and point-2 of the title T2.

As shown in FIG. 2, the control unit 70 includes a matching control unit 72 and a point management unit 73.
The matching control unit 72 controls and processes inter-store matching of the game machine 10 by operating the matching program 62.
The point management unit 73 manages the points of the player P and the like.
Details of the processing of the control unit 70 will be described later.

The frame exchange process, which is the basic process of battle play, will be described.
8 to 10 are views for explaining the frame exchange process in the inter-store battle play of the first embodiment.
Here, as an example of the frame exchange process, an example in which a battle play of the title T1 is performed between the game machine 10 (G011) of the store A and the game machine 10 (G022) of the store B will be described.
Further, in the following example, for convenience, one operation of the operation unit 13 is contained in one frame, and an example in which the character is operated for each frame will be described. However, in reality, for example, one operation is adjacent. There are cases such as straddling matching frames and cases where continuous operations span several frames (for example, when the lever is tilted for a long time).

(When the frame delay is small)
FIG. 8A is a diagram illustrating a frame exchange process in a state where the frame delay is small.
The state in which the frame delay is small is a state in which a large delay does not occur in frame exchange.
In the play progress of the battle game, the elapsed time is divided into unit times, and the game information is managed per unit time. The frame is a concept indicating the play state (image of the play screen, operation information, etc.) per unit time. In the actual mode, one second is divided into 60 frames to manage the progress of play. Therefore, one frame includes a play state of 1/60 second.

In the embodiment, the operation information in each frame is referred to as frame information, and the exchange of frame information between the game machines 10 is referred to as frame exchange.
Since the communication between stores uses the communication network 2, even if the frame delay is small, it takes time from one transmitting the frame information to the other receiving the frame information.
FIG. 8A shows, as an example, an example in which the communication time of inter-store communication is 2 frames (2/60 seconds).
As shown by arrows a0 and b0, the a button is operated on the game machine 10 (G011) and the b button is operated on the game machine 10 (G022) in the scene where the frame F001 is being played. As will be described later, these operation information is used for the frame F004.

As shown by the arrows a1 and b1, each frame information including the operation information of the a button and the b button is transmitted at the end of the frame F001.
As shown by arrows a2 and b2, each game machine 10 waits until it receives the operation information of the frame F004 transmitted by another game machine 10 which is a communication partner when reflecting the operation information of its own machine. For example, when the game machine 10 (G011) reflects the operation of the a button of the frame F004 of its own machine, it waits until it receives the operation information of the b button of the frame F004 of the other game machine 10 (G022).

As shown by arrows a3 and b3, each game machine 10 receives the operation information transmitted by the other game machine 10. It takes two frames for the game machine 10 to receive each frame information. For example, it takes two frames for the game machine 10 (G011) to receive the frame information including the operation information of the b button.
As shown by arrows a4 and b4, the control unit 30 of each game machine 10 reflects the operation information of its own machine and the operation information received from the other game machine 10 to proceed with the play of the frame F004.

In this way, the control unit 30 of the game machine 10 receives the operation information of the frame F004 of the own machine, waits until the frame information of the frame F004 of the other game machine 10 is received, and then processes the frame F004. ..
As shown in FIG. 8B, the control unit 30 of the game machine 10 performs such processing for each frame, so that the same operation information is used in both game machines 10 to simultaneously proceed with the play. Can be done.
As described above, in the battle play using the inter-store communication, even if the frame delay is small, a delay of 2 frames occurs from the operation of the operation unit 13 to the reflection in the play. In the embodiment, a delay of 2 frames is well tolerated.

(Large frame delay)
FIG. 9A is a diagram illustrating a frame exchange process in a state where the frame delay is large.
FIG. 9A shows the communication time for inter-store communication for 3 frames (3/60 seconds).
Therefore, when the a and b buttons are operated on each game machine 10 as shown by arrows a10 and b10, each game machine 10 is set on the frame F004 as shown by arrows a11 and b11 and arrows a13 and b13. It takes 3 frames (3/60 seconds) to receive the reflected operation information from the other game machine 10.
As shown in the delay time L, for this reason, after playing the two frames of frames F002 and F003, it takes one frame's time to receive these operation information.
Therefore, in the case of FIG. 9A, as shown by arrows a11 and b11, each game machine 10 is more than in the case of FIG. 8A until the operation information is received from the other game machine 10. It is necessary to wait for one extra frame.

As shown by the arrows a14 and b14, for this reason, a delay time L for one frame is generated from the play processing for the frame F003 to the start of the play processing for the frame F004.
In the delay time L, the control unit 30 of each game machine 10 cannot perform the play progress process because the operation information cannot be acquired. Therefore, the control unit 30 of each game machine 10 is in a state where the play screen is stopped or the operation information from the operation unit 13 is not accepted in this delay time L.

As shown in FIG. 9B, if the state in which the frame delay is large continues, the delay time L occurs a plurality of times. In such a case, the game machine 10 is in a state where the play image is displayed in slow motion or the continuous operation of the operation unit 13 is not properly received.

In the embodiment, the communication state is evaluated according to the communication state evaluation tables 26 and 66 of FIG. 5C. The frame delay occurrence rate is the ratio of the number of occurrences of delays of 3 frames (3/60 seconds) or more out of all frames of the specified measurement time (for example, all 300 frames of the specified measurement time of 5 seconds).
As will be described later, the control unit 30 of the game machine 10 continues the battle play when it is "best" to "possible", but cancels the battle play when it is "evil" or "impossible". Perform the processing for. Further, the control unit 70 of the central server 50 does not perform matching when "impossible".

(Stop period input processing)
FIG. 10 is a diagram illustrating a stop period input process in the inter-store battle play of the embodiment.
The stop period input process is a process applied when the frame delay is large.
The frame delay state of FIG. 10 and the frame delay state of FIG. 9B are the same.
As shown by the arrow a20, the control unit 30 of the game machine 10 (G011) accepts the operation of the a button even during the delay time L. As shown by the arrow c20, and during the subsequent play of the frame F004, the operation of the c button is accepted. Then, as shown by the arrow c21, at the end of the processing of the frame F004, the frame information including the operation information of the a button and the c button is transmitted to the other game machine 10 (G022).
Then, as shown by the arrow c23, the control unit 30 of the game machine 10 (G011) waits until the frame information from the game machine 10 (G022) is received.

Similarly, as shown by the arrow d20, the control unit 30 of the game machine 10 (G022) accepts the operation of the b button during the delay time L, and receives the operation of the d button while the play of the frame F004 is in progress. Then, as shown by the arrow d21, at the end of the processing of the frame F004, the frame information including the operation information of the b button and the d button is transmitted to the game machine 10 (G011). Then, as shown by the arrow d23, the control unit 30 of the game machine 10 (G022) waits until the frame information is received from the game machine 10 (G011).

In this case, the control unit 30 of each game machine 10 receives these operation information with a delay of 3 frames.
Then, as shown by arrows c24 and d24, the control unit 30 of each game machine 10 sets the operation information of the a button during the delay time L as the operation information of the game machine 10 (G011) with respect to the frame F007. Both the operation information of the c button in the frame F004 are reflected. Similarly, the control unit 30 of each game machine 10 has the operation information of the b button during the delay time L and the d button in the frame F004 as the operation information of the game machine 10 (G022) with respect to the frame F007. Reflect the operation information of.

Further, the control unit 30 determines the operation timing during the delay time L based on the actual elapsed time, not the elapsed time of play.
That is, as the elapsed time of the play, the delay time L is the stop time at which the play does not progress. Therefore, as shown in FIG. 10, when the a button and the b button are operated in the game machine 10 (G011), both operation information is operated during F004 as shown by arrows c24 and d24. It will be treated as a thing.
Therefore, the control unit 30 processes both operation information, assuming that the operation intervals of the a button and the b button have a time interval corresponding to the actual elapsed time (for example, 1/60 second for one frame). As a result, even when a frame delay occurs, if the player continuously operates the buttons at normal timings, the control unit 30 can read the corresponding command from the command table 21a.

In this way, the game system 1 accepts the operation of the operation unit 13 even during the period when the play of the delay time L is stopped, and reflects the operation information and the subsequent operation information in the play together. It is possible to reduce the feeling of delay in play due to communication delay.

[Operation of game system 1]
The operation of the game system 1 will be described.
Hereinafter, the processing of the game machine 10 (G011) will be mainly described, but in reality, all the game machines 10 can independently perform the same processing.
Further, in the following description, the inter-store battle play is mainly performed between the player (P011) of the game machine 10 (G011) of the store A and the player (P022) of the game machine 10 (G022) of the store B. An example in which a T1 battle play is performed will be described.

[Outline of transition of operating state of game system 1]
The outline of the transition of a series of operating states of the game system 1 will be described.
FIG. 11 is a diagram illustrating a series of transitions of the operating state of the game system 1 of the first embodiment.
The following description is the main operation and transition of the game system 1, and may have other operations and transitions depending on the situation.

# 1: In the power-on state, the matching control unit 32 of the game machine 10 (G011) indicates that the power is turned on by turning on the power of the game machine 10 (G011) when the store is opened or the like. The power-on information is transmitted to the central server 50.
# 2: In the communication state acquisition processing state, the matching control unit 32 of the game machine 10 (G011) and the matching control unit 72 of the central server 50 perform the communication state acquisition processing. In this case, the matching control unit 72 of the central server 50 starts the communication state acquisition process together with the matching control unit 32 of the game machine 10 based on the reception of the power-on information.
In the communication state acquisition processing state, the game machine 10 of the store A acquires the communication state of inter-store communication with the game machine 10 of another store other than the store A. Further, the central server 50 receives and acquires this communication state information from the game machine 10 of the store A.

# 3: In the play acceptance processing state, the matching control unit 32 of the game machine 10 (G011) performs billing processing, play acceptance processing from the player P, and the like. Further, the matching control unit 32 of the game machine 10 (G011) immediately receives a selection of a one-person title for the player P to play independently on his / her own machine, a selection of a battle title for battle play, and the like.

# 4: In the matching processing state, the matching control unit 32 of the game machine 10 (G011) performs matching processing with another game machine 10 in the same store (hereinafter, also simply referred to as “in-store”). Alternatively, the matching control unit 32 of the game machine 10 (G011) and the matching control unit 72 of the central server 50 perform inter-store matching processing with the game machine 10 of another store.
The matching control unit 72 of the central server 50 performs matching processing between the game machine 10 (G011) and the game machine 10 of another store based on the request from the game machine 10 (G011). The matching control unit 72 of the central server 50 refers to the communication state or the like acquired in # 2 in the matching process. The matching control unit 72 of the central server 50 transmits the matching result to the game machine 10 (G011).

In the # 5: 1-player play execution state, the play control unit 31 of the game machine 10 (G011) is a one-player play in which the player P plays alone when matching is not established in the matching processing state of # 4. Run start. During this time, the matching control unit 32 of the game machine 10 (G011) and the matching control unit 72 of the central server 50 continue the matching process.

# 6: In the inter-store battle play processing state, the matching control unit 32 of the game machine 10 (G011) with the game machine 10 of another store according to the establishment of inter-store matching in # 4 or # 5. In between, the battle play starts.
# 6a: In the battle play end state, the play control unit 31 of the game machine 10 (G011) performs a process associated with the end of the battle play between stores. As will be described later, the form of ending the inter-store battle play includes one accompanying the cancellation of the play and one accompanying the normal termination. The former cancellation of play is due to communication between stores.
# 6b: In the point processing state, the control unit 30 of the game machine 10 (G011) and the point management unit 73 of the central server 50 perform processing related to the points of the player P based on the result of the inter-store battle play.

# 6c: In the store introduction processing state, the control unit 30 of the game machine 10 (G011) and the point management unit 73 of the central server 50 perform the store introduction processing.
The store introduction process is a process of transmitting information on nearby stores of store A to player P. Player P can move to another store and rematch with reference to this information.

# 7: In the in-store battle play processing state, the control unit 30 of the game machine 10 (G011) determines another game machine 10 (G011) in the store according to the in-store matching established in # 4 or # 5. ) And start the battle play.
# 7a: In the battle play end state, the control unit 30 of the game machine 10 (G011) performs a process associated with the end of the battle play in the store. In-store competitive play does not perform inter-store communication, so normally, processing associated with cancellation of play does not occur.
# 7b: In the point processing state, the control unit 30 of the game machine 10 (G011) and the point management unit 73 of the central server 50 perform processing related to the points of the player P in the same manner as in # 6b.

# 8: In the game restart processing state, the play control unit 31 of the game machine 10 (G011) and the play control unit 31 of the central server 50 perform the one-player play restart processing when the battle play ends.

[Details of operation of game system 1]
The details of the operation of the game system 1 will be described below.
[Communication status acquisition process after power on]
This process corresponds to # 1 and # 2 in FIG.
FIG. 12 is a flowchart of the communication state acquisition process of the first embodiment.
FIG. 13 is a diagram illustrating a communication state acquisition process between the store A and the store B to D communications of the first embodiment.
Hereinafter, an example of acquiring the communication state between the store A and the store B to D communication when the power of the game machine 10 (G011) of the store A is turned on will be described.
In S1, when the power switch 16 is operated, the matching control unit 32 of the game machine 10 (G011) transmits the power-on information via the communication network 2, and the matching control unit 72 of the central server 50 transmits this. Receive.
In S2, the matching control unit 72 of the central server 50 refers to the communication state history storage unit 65 in response to the reception of the power-on information, and causes the game machine 10 (G011) of the store A and the game machine 10 of another store. In response, it is instructed to start inter-store communication. In this case, the matching control unit 72 of the central server 50 extracts one of the other stores that has no communication status history with the store A.
Here, an example in which the matching control unit 72 of the central server 50 extracts the store B will be described.

In S3, the matching control unit 72 of the central server 50 refers to the operation information storage unit 64 (see FIG. 5B), and is played by the empty game machine 10 (that is, the player P) in the stores A and B. The game machines 10) that are not in operation are preferentially extracted one by one. Here, an example in which the game machine 10 (G014) and the game machine 10 (G021) of the store A are extracted will be described.
As a result, the game system 1 does not put a load on the operating game machine 10 because the operating game machine 10 is not frame-exchanged for the communication state acquisition (S5).
However, the matching control unit 72 of the central server 50 may select any game machine 10 in the store when all the game machines 10 in the store are in operation, and the store A may select any game machine 10. The game machine 10 (G011) that has transmitted the power-on information may be selected.

In S4, the matching control unit 72 of the central server 50 issues an inter-store communication execution command to the game machine 10 (G014) of the store A with the game machine 10 (G021). In this case, the matching control unit 72 of the central server 50 transmits the connection destination information (global IP address of the game machine 10 (G021), etc.) necessary for inter-store communication to the game machine 10 (G014).

In S5, the matching control unit 32 of the game machine 10 (G014) starts inter-store communication with the game machine 10 (G021) in response to a command from the central server 50.
Each matching control unit 32 of the game machine 10 (G014) and the game machine 10 (G021) acquires the communication state between the game machine 10 (G014) and the game machine 10 (G021) by exchanging frames. In this case, each matching control unit 32 does not need to actually execute the program of the battle game, and may communicate frame information including some operation information and the like.
In S6, the matching control unit 32 of the game machine 10 (G014) measures the delay occurrence rate in the frame exchange, and then transmits the measurement result to the central server 50.

In S7, when the matching control unit 72 of the central server 50 receives the measurement result of the delay occurrence rate, it stores it in the communication state history storage unit 65.
As a result, the matching control unit 72 of the central server 50 has, in the relationship between the store A and the store B, one of the plurality of game machines 10 of the store A and one of the plurality of game machines 10 of the other stores. Communication status information can be stored.
For example, in the communication state history storage unit 65 of FIG. 6A, the communication state “good” is stored as the game machine 10 (G014) of the store A and the game machine 10 (G021) of the store B.

After that, the matching control unit 72 of the central server 50 repeats the processing from S2. As a result, the matching control unit 72 sequentially sets the communication state between one of the plurality of game machines 10 in the store A and one of the plurality of game machines 10 in the store C (see S5c in FIG. 13), and the store A. Acquires the communication state between one of the plurality of game machines 10 and one of the plurality of game machines 10 in the store D (see S5d in FIG. 13), and stores these in the communication state history storage unit 65. To do.

In addition, although the example of acquiring the communication state between the store A and the stores B to D has been described here, in reality, the communication between the store A and all the stores is performed by performing the same processing. Get the state.
Further, after the matching control unit 72 of the central server 50 has acquired the communication status between all the stores, the communication status history storage unit 65 is converted into newer communication status information by performing the same processing again. You may update it.
Further, in S4, the global IP addresses of both game machines 10 may be assigned to each other, and in S5, inter-store communication may be started from both game machines 10 to each other's game machines 10.

[From play acceptance processing to matching processing]
This process corresponds to # 3 and # 4 in FIG.
FIG. 14 is a flowchart from the play acceptance of the first embodiment to the matching selection process.
FIG. 15 is a flowchart of the in-store matching process of the first embodiment.
16 and 17 are flowcharts of the inter-store matching process of the first embodiment.
FIG. 18 is a diagram showing a title selection screen 80 and a matching type selection screen 81 of the first embodiment.
FIG. 19 is a diagram showing a display screen at the time of in-store matching of the first embodiment.
FIG. 20 is a diagram showing a display screen at the time of matching between stores according to the first embodiment.

Hereinafter, the matching process and the like when the player (P011) plays the game machine 10 (G011) in the store A will be described.
In S11, the matching control unit 32 of the game machine 10 (G011) performs the billing process.
In this process, when the player (P011) inserts coins into the coin insertion slot 11a of the game machine 10, the coin detection unit transmits a coin detection signal, that is, billing information to the control unit 30. Alternatively, the player (P011) holds the billing card 41 over the billing card RW11b, so that the billing card RW11b transmits the billing information to the control unit 30. The control unit 30 receives this billing information.

In S12, the player ID acquisition process is performed.
The player ID acquisition process is a process for acquiring a player ID.
The control unit 30 of the game machine 10 (G011) acquires the player ID by communicating with the ID card 42 held over the ID card reader 12.
Although detailed description is omitted, the matching control unit 32 of the game machine 10 (G011) transmits the player ID to the central server 50, so that the player information (player name, play history, etc.) is transmitted from the central server 50. Can be obtained.

In S13, as shown in FIG. 18A, the matching control unit 32 of the game machine 10 (G011) displays the title selection screen 80 on the display unit 14.
The title selection screen 80 has a one-person title selection display unit 80a and a battle title selection display unit 80b.
The one-player title selection display unit 80a and the battle title selection display unit 80b display four titles T1 to T4 and their selection buttons, respectively.
The player (P011) can select a one-person title or a battle title according to these displays.
When selecting the buttons included in these displays, the player (P011) may operate the start button 13b after moving the pointer 14a displayed on the title selection screen 80 onto the selection button by operating the lever. .. In the drawing, the frame of the selected selection button is shown by a thick line.

In S14, the matching control unit 32 of the game machine 10 (G011) performs a one-person title selection process.
The one-player title selection process is a process of accepting the selection of a one-player title from the player (P011) of the game machine 10 (G011).
The player (P011) selects one title from the titles T1 to T4 of the one-person title selection display unit 80a. FIG. 18A is an example in which the title T1 (fighting game) is selected.

In S15, the matching control unit 32 of the game machine 10 (G011) performs the battle title selection process.
The battle title selection process is a process of accepting the selection of the battle title from the player (P011) of the game machine 10 (G011).
The player (P011) selects one or more titles from the titles T1 to T4 of the battle title selection display unit 80b. FIG. 18A is an example in which the title T1 (fighting game) and the title T2 (fighting game) are selected.
Here, as more battle titles are selected, the number of target player Ps (players P for which matching is established or not) increases. When the player (P011) selects more battle titles, matching is more likely to be established. Therefore, the player (P011) may select a plurality of battle titles when he / she strongly desires the battle play.

The game system 1 may determine the one-player title selected in S14 as one of the battle titles, and may further select an additional title of the battle title in S15.
Further, the game system 1 may be able to set a title for preferential matching when a plurality of battle titles are selected. In this case, for example, a plurality of battle titles can be prioritized in the order in which they are selected, that is, the first selected title may have the highest priority.

In S16, as shown in FIG. 18B, the matching control unit 32 of the game machine 10 (G011) performs the matching type selection process by displaying the matching type selection screen 81 on the display unit 14.
The matching type selection screen 81 is a process for accepting selection of which of in-store matching and inter-store matching is to be performed.
As shown in FIG. 18B, the matching type selection screen 81 includes an in-store matching button 81a and an inter-store matching button 81b.
In-store matching is performed only by matching with other game machines 10 in store A. Therefore, the player (P011) may select the in-store matching button 81a, for example, when he / she wishes to play against another player P in the store.
On the other hand, in the inter-store matching, matching is easily established because matching is performed with the game machines 10 of stores other than store A in addition to the inside of store A. Therefore, the player (P011) may select the inter-store matching button 81b, for example, when he / she strongly desires the competitive play.
Details of these matching processes will be described later.

The matching control unit 32 of the game machine 10 (G011) proceeds to S17 when the in-store matching button 81a is selected (S16: YES), and on the other hand, when it is determined that the inter-store matching button 81b is selected. (S16: NO) proceeds to S18.

In S17, the matching control unit 32 of the game machine 10 (G011) performs in-store matching processing.
On the other hand, in S18, the matching control unit 32 of the game machine 10 (G011) performs inter-store matching processing.

(In-store matching process)
As shown in FIG. 15, in S21, the matching control unit 32 of the game machine 10 (G011) performs an in-store search process.
The matching control unit 32 of the game machine 10 (G011) searches for the game machine 10 waiting for in-store matching by communicating with another game machine 10 in the store A, and as a result, the corresponding game machine 10 is found. If it exists, it matches with the game machine 10.
When a plurality of battle titles are selected and priorities are set, the matching control unit 32 of the game machine 10 (G011) gives priority to the game machine 10 waiting for the title with the higher priority. Just search. Then, the matching control unit 32 searches for the game machine 10 waiting for the next title when the matching is not established because the corresponding game machine 10 does not exist.
Further, when the matching control unit 32 of the game machine 10 (G011) searches for the game machine 10 waiting for in-store matching, if a plurality of game machines 10 exist, these games are displayed on the display unit 14. The player (P011) may be able to select an opponent by displaying the machine 10, the player P who is the opponent, and the like. Further, in this case, the matching control unit 32 may prioritize matching with a player P having a small difference in rank between the two players P and having similar skills.

In S22, the matching control unit 32 of the game machine 10 (G011) determines whether or not the in-store matching is established. The matching control unit 32 of the game machine 10 (G011) proceeds to S31 when it is determined that the in-store matching is established (S22: YES), and on the other hand, when it is determined that the in-store matching is not established (S22: YES). NO), proceed to S23.

In S23, as shown in the one-player screen 82 of FIG. 19A, the matching control unit 32 of the game machine 10 (G011) executes the one-player play of the one-player title selected in S14, and stores the store. Wait for internal matching.
In this process, since the in-store matching was not established in S22, the other game machine 10 in the store A starts the search for the opponent (that is, the in-store search process in S21) while the one-player play is in progress. Wait until you do.

In S24, the matching control unit 32 of the game machine 10 (G011) determines whether or not the in-store matching is established while the one-player play is in progress. The matching control unit 32 proceeds to S31 when it is determined that the in-store matching is established (S24: YES), and proceeds to S25 when it is determined that the in-store matching is not established (S24: NO).
As shown in FIG. 19B, when the in-store matching is established in this scene, the matching control unit 32 displays the in-store matching establishment screen 83 on the display unit 14.

In S25, the matching control unit 32 of the game machine 10 (G011) determines whether or not the one-player play is completed. When the one-player play ends, for example, the player (P011) wins the specified number of stages in the one-player play, or the player (P011) loses in the one-player play.
The matching control unit 32 of the game machine 10 (G011) proceeds to S26 when it is determined that the one-player play has ended (S25: YES), and on the other hand, when it is determined that it has not ended (S25: YES). NO), the process from S23 is repeated.
In S26, the matching control unit 32 of the game machine 10 (G011) ends the in-store matching process.
The reason for ending the in-store matching process is that the one-player play has ended because the matching has not been established in the previous processes.

In S31, the matching control unit 32 of the game machine 10 (G011) determines whether the one-person title and the competition title are the same title according to the in-store matching established in S22 or S24.
When it is determined that both titles are the same (S31: YES), the matching control unit 32 proceeds to S32, and when it is determined that both titles are different (S31: NO), it proceeds to S31a.

In S31a, the matching control unit 32 of the game machine 10 (G011) performs a billing process.
The billing process can be performed in the same manner as in S11.
The reason for performing the billing process is that when proceeding to S31a, a total of two titles are executed because the one-player title and the competition title are different.

In S32, the matching control unit 32 of the game machine 10 (G011) executes the battle play in response to the establishment of in-store matching.
If the one-player title and the battle title are the same title (S31: YES), the matching control unit 32 of the game machine 10 (G011) will perform the battle play without charging.
After that, the matching control unit 32 proceeds to S26 and ends the in-store matching process.

(Matching process between stores)
As shown in FIG. 16, in S41, the matching control unit 32 of the game machine 10 (G011) performs an in-store search process. This process is the same as S21 of the in-store matching process.
Hereinafter, an example in which the player (P011) of the game machine 10 (G011) of the store A and the player (P022) of the game machine 10 (G022) of the store B are matched will be described.
In S42, the matching control unit 32 of the game machine 10 (G011) determines whether or not the in-store matching is established. The matching control unit 32 proceeds to S42a when it is determined that the in-store matching is established (S42: YES), and proceeds to S43 when it is determined that the in-store matching is not established (S42: NO). This process is the same as S22 of the in-store matching process.

In S42a, the matching control unit 32 of the game machine 10 (G011) performs in-store battle play processing according to the establishment of in-store matching. The processing after S42a is the same as that after S31 of the in-store matching processing.

As described above, the game system 1 first performs the in-store matching process even when the inter-store matching is selected.
As a result, when the in-store matching is established, the game system 1 can proceed with the competitive play in the store without fear of frame delay. In addition, the game system 1 can also respond to a request from a store operator or the like to actively engage in in-store competition rather than in-store competition.

In S43, the matching control unit 32 of the game machine 10 (G011) requests the central server 50 for inter-store matching. The matching control unit 32 transmits information including information necessary for matching between stores (player ID, game machine ID, battle title, etc.).

In S44, the matching control unit 32 of the game machine 10 (G011) performs standby processing of the matching result from the central server 50 while executing the one-player play of the one-player title.
That is, in the one-player play in the in-store matching process, the in-store matching is awaited, whereas in the one-player play in the inter-store matching process, the inter-store matching is awaited.
As shown in FIG. 20A, the matching control unit 32 of the game machine 10 (G011) displays matching information (described later) received from the central server 50 on the one-player play screen 84. Details of the one-player screen 84 will be described later.

By the processing so far, the game machine 10 (G011) starts the in-store battle play (S42a) when the in-store matching is established at the time of accepting the play (S42: YES), and when this is not established. (S42: NO) shifts to the inter-store matching process without waiting for in-store matching (S43, S44). As a result, the game machine 10 (G011) gives priority to the in-store matching process immediately after accepting the play, but if this is not established, the game machine 10 (G011) can promptly shift to the inter-store matching process.

In S45, the matching control unit 72 of the central server 50 performs a matching partner extraction process in response to a request for inter-store matching from the game machine 10 (G011).
The matching partner extraction process is a process of extracting the matching partner of the game machine 10 (G011) of the store A from the game machine 10 of the store other than the store A.

In the matching partner extraction process, first, the game machine 10 that satisfies both of the following two conditions is extracted.
(1) The communication status of both stores is "OK" or higher. The matching control unit 72 of the central server 50 refers to the communication status history storage unit 65 (see FIG. 6), and the communication status is "OK" or higher. Extract the stores that are.
In the example of FIG. 6, the matching control unit 72 extracts stores B, C, and D.
As a result, the matching control unit 72 can extract the store in which the game machine 10 having a small frame delay in the battle play is installed.

(2) Matching between stores of titles T1 and T2 is in a standby state. The matching control unit 72 of the central server 50 is extracted from the operation information storage unit 64 (see FIG. 5B) in (1) above. By referring to the store information, the game machine 10 in which the matching of the titles T1 and T2 is in the standby state is extracted.
In the example of FIG. 5B, among the game machines 10 of the stores B, C, and D whose communication status is “OK” or higher, the game machine 10 (G022) of the store B and the game machine 10 (G041) of the store D Is extracted.

(3) When the matching control unit 72 of the central server 50 completes the processes (1) and (2) above, if the number of opponent players P, that is, the number of matchings is large, these Among them, the player P having a small rank difference from the player P of the store A is preferentially extracted. Then, the matching control unit 72 narrows down the plurality of matching to, for example, three.

In S46, the matching control unit 72 of the central server 50 transmits the matching result information, which is the result of the matching partner extraction process of S45, to the game machine 10 (G011).
The matching result information includes information associated with the title type, the connection destination information of the matching partner game machine 10, the communication status, and the matching partner player information (player name, rank, etc.).

In S47, when the matching control unit 32 of the game machine 10 (G011) receives the matching result information, it starts communication with the matching partner game machine 10 based on the connection destination information included in the matching result information. In this case, the matching control unit 32 acquires the current communication state by exchanging frames with the other game machine 10 in the same manner as in S5.
In S48, as shown in FIG. 20A, the matching control unit 32 of the game machine 10 (G011) displays the matching information display unit 84a on the one-player play screen 84.
The matching information display unit 84a displays a plurality of matching information in a list format.
The matching information display unit 84a displays the title type, player name, and rank of each matching partner in association with each other. These are based on the player name and rank of the matching partner included in the matching result information received from the central server 50.
For example, in the matching result display, the matching opponent in the first line from the top indicates "Title T1", "Player name = Jiro", and "Dan = 6".

Further, the matching information display unit 84a displays the communication status of each matching (communication status display process). This is based on the communication state acquired in S47. The communication status display has an antenna image with reference to the communication status evaluation table 26 in addition to the character display such as "OK".
As a result, the matching information display unit 84a can convey to the player (P011) the accurate communication state at the present time when the central server 50 has actually matched, not when the central server 50 has acquired the communication state in the past.
As the communication status displayed here, the one received from the central server 50 in S47 may be used as it is. In this case, the game machine 10 (G011) can display the communication status without exchanging frames.

The selection button is a button that accepts selection from a plurality of matchings of the matching information display unit 84a.
The player (P011) can select an opponent while referring to the title, rank, communication status, and the like.
For example, when the player (P011) wants to prioritize the stability of the communication state over the title type and rank, he / she may refer to the communication state display and select matching with a better communication state. Similarly, when the player (P011) wants to prioritize the title type or rank over other matching elements, for example, he / she can select matching that gives priority to this.

In S49, the matching control unit 32 of the game machine 10 (G011) determines whether or not one of the matching displayed in the list has been selected by operating the selection button (matching confirmation operation). When it is determined that matching is selected (S49: YES), the matching control unit 32 proceeds to S50, and when it is determined that matching is not selected (S49: NO), the matching control unit 32 repeats the processing from S43. ..
In the repeated processing of S43, the central server 50 is requested to match again. In response to this, the central server 50 again extracts the game machine 10 waiting for matching (S45). Therefore, the central server 50 can add the game machine 10 to the matching extraction target when the game machine 10 waiting for matching is newly added. As a result, when the extracted matching list changes, the matching control unit 32 can update the matching list of the matching information display unit 84a in the repeated processing of S48.

In S50, the matching control unit 32 of the game machine 10 (G011) transmits the matching acceptance information, which is information indicating that matching is selected, to the game machine 10 (here, the game machine 10 (G022)) of the matching partner. Send. The matching selection information includes title name, player information (player name, rank, etc.) of the player (P011), communication status information, and the like.

Although the flowchart of the game machine 10 (G022) is omitted, the matching control unit 32 of the game machine 10 (G022) displays the inter-store matching establishment screen 85 on the display unit 14 when the matching selection information is received.
As shown in FIG. 20B, the inter-store matching establishment screen 85 displays the matching information display unit 85a, the accept button 85b, and the reject button 85c.
The matching information display unit 85a displays information such as a title name, a matching partner player name "Ichiro", a rank "6", and a communication status "good". The player name, rank, and communication status are based on matching selection information.

The acceptance button 85b is a button for the player (P022) to accept the matching and confirm the execution of the battle play. That is, the acceptance button 85b is a button for the player (P022) to perform a matching confirmation operation (matching confirmation operation).
The reject button 85c is a button for the player (P022) to reject the matching.
The player (P022) may select whether to accept or reject the matching by referring to the rank and communication state of Ichiro (P011) (that is, the player (P011)).
When the accept button 85b and the reject button 85c are selected, the matching control unit 32 of the game machine 10 (G022) transmits the operation information to the game machine 10 (G011) and the central server 50.
When the matching control unit 72 of the central server 50 receives the operation information of the accept button 85b, it ends the matching process of the game machine 10 (G011), and on the other hand, when it receives the operation information of the reject button 85c. The matching process of the game machine 10 (G011) is continued.

In S51, the play control unit 31 of the game machine 10 (G011) determines whether or not to start the battle play based on the operation information received from the game machine 10 (G022).
When the play control unit 31 of the game machine 10 (G011) receives the operation information of the accept button 85b, it determines that the battle play is started (S51: YES), proceeds to S52, while the operation information of the reject button 85c Is received, it is determined that the matching process is continued without starting the battle play (S51: NO), and the process from S43 is repeated.

In S52, the matching control unit 32 of the game machine 10 (G011) determines whether the one-player title and the battle title are the same title, as in S31. The play control unit 31 of the game machine 10 (G011) proceeds to S when it is determined that both titles are the same (S52: YES), and proceeds to S when it is determined that they are different (S52: NO). Proceed to S52a.
In S52a, the matching control unit 32 of the game machine 10 (G011) performs the billing process in the same manner as in S31a, and then proceeds to S53.

In S53, the play control unit 31 of the game machine 10 (G011) starts a battle play using inter-store communication with the game machine 10 (G022).
In the battle play using the inter-store communication, the play control unit 31 performs the above-mentioned stop period input process in the communication state (for example, when the communication state drops below "OK").

As described above, in the game system 1 of the present embodiment, even when inter-store matching is selected, in-store matching processing is performed and then inter-store matching processing is performed. Therefore, in-store competition such as store operators can be performed. It can respond to the request to prioritize. Further, since the game system 1 performs matching processing for a plurality of titles at the same time, the possibility that matching is established can be improved.

[Character control during battle play between stores]
This process is a process related to character control in the inter-store battle play of # 6 in FIG.
FIG. 21 is a diagram showing a scene of the inter-store battle play screen 86 of the first embodiment.
As shown in FIG. 21, the store-to-store battle play screen 86 during the store-to-store battle play shows the characters C (C2 and C3) operated by both players P, the communication status display unit 86a, and the bubble image 86b (to the degree of communication status). Corresponding image) is displayed.
In the scene of FIG. 21, in the battle play of the title T1, the player P (Ichiro (P011)) of the game machine 10 (G011) of the store A operates the character C3, and the player P of the game machine 10 (G022) of the store B. This is an example in which (Jiro (P022)) is operating the character C2.
The communication status display unit 86a displays the current communication status. In the scene of FIG. 21, the characters of the communication state “OK” and the antenna image corresponding to the characters are displayed.

The play control unit 31 of the game machine 10 (G011) has the ability (attack power, defense power) of the character C in the battle play based on the command table 21a (T1) and the command correction table 21b (T1) (see FIG. 4). To determine.
As shown in the command correction table 21b (T1), the correction value (parameter) of the defense value and the attack value of the character C3 increases as the communication state decreases. Therefore, the character C3 becomes stronger as the communication state decreases.
Further, the attack value of the character C2 does not change as the communication state decreases, but the defense value decreases. Therefore, the character C2 becomes weaker as the communication state decreases.
Therefore, in the inter-store battle play, when the characters C2 and C3 play against each other, the character C3 becomes superior in terms of its ability as the communication state deteriorates.

The communication status also changes during battle play. The play control unit 31 of the game machine 10 (G011) sets the character correction value with reference to the command correction table 21b (T1) based on the current communication state. Therefore, the ability of character C increases or decreases even during the battle play.
As a result, the game system 1 can suppress the battle play from becoming monotonous, so that the fun can be improved.
In addition, the specifications of the title T1 are such that the three characters C, for example, the leading character, the middle-ranked character, and the general, are replaced in sequence each time they are defeated in the round. In some cases, the player P has an examination of which character C is selected according to the communication state at the start of play. Therefore, the game system 1 can provide the player P with a game that requests the selection of the character C according to the communication state.

The aspect of the bubble image 86b changes during the inter-store battle play.
That is, the bubble image 86b increases or increases as the communication state changes from “best” to “evil”. Since the bubble image 86b is displayed over the entire surface of the play screen of the display unit 14, it is displayed so as to overlap the character C itself, and is also displayed around the character C.
Therefore, the player P can naturally confirm the state of the bubble image 86b by operating the character C. As a result, the player P can recognize the current communication state without distracting the line of sight from the character display such as "OK" of the communication state display unit 86a and the antenna image.
The bubble image 86b may be displayed on the character C itself and at least one of the surroundings. Further, the display mode (color, brightness, etc.) of the character C itself may change depending on the communication state.

With the above configuration, the game system 1 can provide a new aspect of the game by utilizing the change in the communication state. That is, it is advantageous for the player P who operates the character C3 to turn to an attack on the other party when the communication state is lowered, while the player P who operates the character C2 or the like is when the communication state is lowered. , It will be necessary to perform operations such as dodging attacks from the other party.
In addition, the communication state during play may change gradually or may change rapidly. Even in this case, the player P can always grasp the current communication state by the bubble image 86b, so that the character C can be appropriately operated even when the communication state during play changes suddenly. Can be done.

As described above, the game system 1 of the present embodiment can provide a game of a new aspect by converting the ability of the character C according to the communication state.
In the above embodiment, the ability of the character C is changed according to the delay occurrence rate, but the present invention is not limited to this. For example, by accumulating communication delays (for example, delays of 3 frames or more occur 5 times), character C can perform a special move, or conversely, character C's physical strength value decreases. It may be. Even in such a form, since the characteristics of the character C can be changed according to the communication state, it is possible to provide a game of a new aspect.

[Cancellation of inter-store battle play]
This process corresponds to the cancellation of the play of # 6a in FIG.
FIG. 22 is a flowchart of the process of canceling the inter-store battle play of the first embodiment.
FIG. 23 is a flowchart of the delay effect analysis process of the first embodiment.
FIG. 24 is a diagram showing a store-to-store battle play screen 87 of the first embodiment.
The process of canceling the battle play between stores is a process related to the cancellation of the battle play due to a decrease in communication status or the like.
As shown in the inter-store battle play screen 87 of FIGS. 24 (A) and 24 (B), the matching control unit 32 of the game machine 10 (G011) measures the frame delay occurrence rate during the battle play. This is continuously performed, and the result (that is, the communication status) is displayed on the communication status display unit 87a of the display unit 14. As a result, the player P can play the battle while checking the delay occurrence rate of the frame.

As shown in FIG. 22, in S60, the matching control unit 32 of the game machine 10 (G011) performs delay influence analysis processing.
In the play content analysis process, mainly, when the communication state is lowered, the influence of the communication delay on the play is analyzed.
(Delay effect analysis processing)
The delay effect analysis process will be described with reference to FIG. 23.
In S61, the matching control unit 32 of the game machine 10 (G011) changes from a state in which the communication state is “possible” or higher (state in FIG. 21 (A)) to a state in “bad” (state in FIG. 21 (B)). Judge whether or not it has decreased to.
When the matching control unit 32 determines that the communication state has deteriorated to "evil" (S61: YES), the process proceeds to S62, while when it determines that the communication status has not decreased to "evil" (S61: YES). NO), the process of S61 is repeated.

In S62, the matching control unit 32 of the game machine 10 (G011) determines whether or not the number of operations per technique is within the determination value by analyzing the play contents of the battle play so far.
The matching control unit 32 proceeds to S64 when it is determined that the number of operations per technique is within the determination value (S62: NO), and on the other hand, when it is determined that the number of operations is greater than the determination value (S62). : YES), proceed to S63.

Here, when the player P is performing an accurate operation for a large technique, the number of operations per technique tends to be large (command table 21a (T1) of the title T1 in FIG. 4 (A)). See compound operations in).
Therefore, as the number of operations per technique increases, the amount of operation information contained in one frame or continuous frames increases, so that the frame delay has a large effect on the play. That is, due to the frame delay, it may not be possible to receive some operation information of the compound operation, or if this is omitted, the big skill may not be established.
Therefore, when the number of operations per technique is large (that is, S62: NO), the frame delay has a large effect on the battle play, and conversely, when this is small (that is, S62: YES), the frame delay is large. The effect on competitive play is small.
This determination value can be set, for example, "the number of operations per technique = 3 times".

In S63, the matching control unit 32 of the game machine 10 (G011) determines whether or not the damage to the enemy per operation is within the determination value by analyzing the play contents of the battle play so far. ..
The matching control unit 32 of the game machine 10 (G011) proceeds to S65 when the damage to the enemy per operation is within the determination value (S63: YES), while when it is larger than the determination value. (S63: NO), proceed to S64.

Here, when the player P performs an accurate operation to attack the enemy, the damage to the enemy per technique tends to be large. This is because the operation timing, the interval, etc. are accurate, so that even if the number of techniques is small, a large amount of damage can be given to the enemy.
For this reason, the greater the damage to the enemy per technique, the greater the effect of frame delay on play. That is, there are cases where the character cannot damage the enemy without performing the technique due to the inability to accept some operation information out of the originally small number of operations or the lack of this information. Because.
Therefore, when the damage to the enemy per technique is large (that is, S63: NO), the frame delay has a large effect on the battle play, and conversely, when this is small (that is, S63: YES), the frame. The effect of delay on competitive play is small.
When the initial value of the life value (at the start of play) is 100P (points), this determination value can be set as "damage to the enemy per technique = 20P" or the like.

By the processing of S62 and S63, when the matching control unit 32 of the game machine 10 (G011) is "S62: NO" or "S63: NO", the degree of influence of the deterioration of the communication state on the battle play is increased. It can be analyzed as large. On the other hand, when "S62: YES" and "S63: YES", it can be analyzed that the degree of influence of the decrease in communication status on the battle play is small.
The determination of the degree of influence of the decrease in communication status on the battle play is not limited to the above form, and even if it is analyzed that the degree of influence is large when, for example, "S62: NO" and "S63: NO". Good. Further, when it is "S62: YES" or "S63: YES", it may be analyzed that the degree of influence of the decrease in the communication state on the battle play is small.

In S64, the control unit 30 returns to this flow.
In S65, the matching control unit 32 of the game machine 10 (G011) determines whether or not the communication state has deteriorated from "bad" to "impossible".
The matching control unit 32 proceeds to S64 when the communication status is lowered to "impossible" (S65: YES), while the processing of S65 is performed when the communication status is not lowered to "impossible" (S64: NO). repeat.

Here, when proceeding to S65, as described above, it is a case where the degree of influence of the decrease in communication state on the battle play is small (S62: YES and S63: YES).
Therefore, even if the communication state is "bad", the matching control unit 32 repeats the process of S65 if the communication state has not decreased to "impossible" (S65: NO), so that the battle play can be performed. maintain.
On the other hand, when the communication state is reduced to an impossible level (S65: YES), the matching control unit 32 continues the battle play for the player P even if the degree of influence of the decrease in the communication state on the battle play is small. Is in an unbearable state. Therefore, the matching control unit 32 proceeds to the process after S64 and performs a process for canceling the battle play.

Returning to the main flow of FIG. 22, in S70, the matching control unit 32 of the game machine 10 (G011) determines whether or not the communication state has decreased from “bad” to “impossible”.
The matching control unit 32 proceeds to S76 when the communication status is lowered to "impossible" (S70: YES), and proceeds to S71 when the communication status is not lowered to "impossible" (S70: NO). ..
When the degree of influence of the communication state is small, the communication state is already in the impossible state (S65: YES in FIG. 23), so the determination of S70 is “S70: YES”. Therefore, when it is determined as "S70: NO", it is only when the degree of influence of the communication state is large.

In S71, as shown in the inter-store battle play screen 87 of FIG. 24B, the matching control unit 32 of the game machine 10 (G011) displays the stop button 87b.
When the player P wants to cancel the battle play, he / she may perform a stop operation (an operation of selecting the stop button 87b).
Here, in the scene of FIG. 24B, the player P is forced to play under the condition that the communication state is "evil" even though the play mode has a large influence on the communication state. Therefore, the game machine 10 (G011) is capable of canceling the battle play at the intention of the player P.

In S72, whether or not the matching control unit 32 of the game machine 10 (G011) has been canceled by both the own machine and the game machine 10 of the opponent player P (hereinafter, also referred to as "both game machines 10"). Is determined. The matching control unit 32 can confirm the operation status of the play stop button of the opponent's game machine 10 by the frame exchange process.
The matching control unit 32 proceeds to S76 when it is determined that the stop operation has been performed on both game machines 10 (S72: YES), and on the other hand, when it is determined that the stop operation has not been performed on both game machines 10. (S72: NO), proceed to S73.

In S73, the matching control unit 32 of the game machine 10 (G011) determines whether or not only the dominant side game machine 10 has been stopped. That is, when only one of the two game machines 10 is stopped, it is determined whether or not this is the operation of the dominant game machine 10.
The dominant side game machine 10 is the player P's game machine 10 which is dominant in the battle play.
Further, the superiority and inferiority of the competitive play may be determined by comparing the remaining life values, for example, in the case of a fighting game. That is, of both players P, the one with a large remaining life value is superior, and the one with a small remaining life value is inferior.
The matching control unit 32 of the game machine 10 (G011) proceeds to S74 when it is determined that the own machine is the dominant side (S73: YES), and on the other hand, when it is determined that the own machine is not the dominant side. (S73: NO) repeats the process from S70.

In S74, the matching control unit 32 of the game machine 10 (G011) determines whether the life value difference is within the determination value.
Here, by determining the life value difference, it is possible to determine how much the superiority or inferiority difference in the battle play is. When the life value difference is small, the superiority or inferiority difference is small, so there is a high possibility that the superiority or inferiority will be reversed. On the other hand, when the life value difference is large, the superiority / inferiority difference is large, so that the play state is unlikely to reverse.
At the time of judgment, the judgment value of the life value difference is set to such an extent that it is difficult to reverse the superiority or inferiority even if the battle play is continued. The determination value of the life value difference can be set to, for example, the life value difference of 50 or the like when the full state of the life value is the life value of 100.
If the specification of the title T1 is a winning battle with three characters, the life value of one character is set to 100P, and the life value is assumed to have a total life value of 300P in one battle play. The difference may be calculated.
When the matching control unit 32 determines that the life value difference is within the determination value (S74: YES), the process proceeds to S75, and when it determines that the life value difference is larger than the determination value (S74: NO), Proceed to S76.

In S75, the matching control unit 32 of the game machine 10 (G011) continues the battle play and repeats the process from S70.
The reason for continuing the battle play is that the superiority or inferiority difference of the battle play is small even when the communication state is bad and the dominant player P has selected to cancel the play. That is, it is terrible for the inferior player P to stop playing when there is a sufficient chance of reversal.

In S76, the matching control unit 32 of the game machine 10 (G011) cancels the battle play.
Here, when proceeding to S76, there are the following four scenes.
(A) The matching control unit 32 of the game machine 10 (G011) has changed due to the communication status being disabled (S65: YES) while the battle play with a small communication influence is in progress (S62: YES, S62: NO). Scene where play was forcibly stopped (B) While the battle play with a large communication influence was in progress (S62: NO, S62: YES), the communication status became disabled (S70: YES), and the game machine 10 (G011) ) The matching control unit 32 forcibly stopped the play (C) While the battle play with a large communication influence is in progress (S62: NO, S62: YES), by the stop operation of both players P (S72: YES), That is, with the consent of both players P, the scene where the matching control unit 32 of the game machine 10 (G011) stops playing (D) The battle is in progress (S62: NO, S62: YES) with a large communication influence. Because the difference in play is large, the difference in life value is equal to or greater than the judgment value in a state where the player P on the inferior side does not agree (S73: NO) in response to the cancel operation of the player P on the superior side. (S74: NO), scene where play was forcibly stopped

In the scenes (A) and (B), since the communication state is disabled, the battle play cannot be continued, so both players P have no choice but to accept the forced termination of the battle play.
In the scene (C), since both players P have canceled the battle play after approval, there is little dissatisfaction with the cancellation of the play.

The scene (D) is a state in which the battle play is canceled only by the approval of the player P on the superior side in the play in which the possibility of reversal of superiority or inferiority is low.
In this scene, the superior player P is in a state where the inferior player P wants to continue the play even though the situation is unlikely to reverse even if the play is continued. Therefore, it is harsh for the dominant player P to continue the battle play. That is, the inferior player P forces the superior player P to play harshly.
Therefore, in the embodiment, in order to rescue the dominant player P, the battle play is allowed to be canceled only by the approval thereof.
It should be noted that the inferior player P is less dissatisfied because the possibility of the situation reversal is low even if the battle play is canceled.

In S77, the control unit 30 of the game machine 10 (G011) performs a point awarding process when the play is stopped. The details of the point awarding process will be described later.
As a result, the process of canceling the battle play is completed due to the deterioration of the communication state.

As described above, the game system 1 of the present embodiment cancels the play with the consent of the player P when the play is stopped due to the communication state, so that the dissatisfaction of the player P can be reduced. Further, even when the play is forcibly stopped, the player P is dissatisfied because the play is stopped according to the superiority or inferiority difference of the play.

[Point award processing after the end of battle play]
The point awarding process associated with the end of the battle play is a process corresponding to # 6b and # 7b in FIG.
FIG. 25 is a flowchart of the point awarding process of the first embodiment.
The point awarding process is a process in which the central server 50 awards points to the player P after the end of the battle play (that is, after the battle play is stopped or the battle play ends normally).
As a premise of this process, at the end of the battle play, the control unit 30 of the game machine 10 (G011) transmits the play end information to the central server 50. The play end information includes information such as the game machine ID, the player ID, the score of the player P, the end form (that is, whether the play is canceled or the normal end), the victory or defeat at the normal end, and the superiority or inferiority at the time of the play stop. ..
Note that the end form of play stop means cancellation due to the communication state (when the process of S76 described above), and the end form of normal end means that play continues until the end without being stopped. It means the case where it ends normally.

In S81, the point management unit 73 of the central server 50 determines whether or not the play end form is play stop based on the play end information received from the game machine 10 (G011). When the point management unit 73 determines that the play is stopped (S81: YES), the process proceeds to S82, while when it is determined that the play is not stopped (S81: NO), that is, it is determined that the play is normally completed. If so, the process proceeds to S81a.

In S81a, the point management unit 73 of the central server 50 performs the point normal granting process.
Here, when proceeding to S81a, it is a case where the play ends normally.
Therefore, the point management unit 73 of the central server 50 gives points according to the play result based on the play end information. That is, the point management unit 73 adds points corresponding to the rank difference between the two players P to the winning player P, while subtracting points to the defeated player P, and player information. The information in the storage unit 67 (see FIG. 7) is updated. Further, the point management unit 73 updates the rank information when there is a change in the rank as a result of giving points.
Then, the point management unit 73 of the central server 50 ends the process.

In the processing after S82, the central server 50 performs a point awarding processing when the play is canceled.
In S82, the point management unit 73 of the central server 50 performs the point calculation process.
In the point calculation process, a point value (also referred to as “progress degree point value” in the embodiment) is calculated according to the play progress degree when the battle play is stopped.

Further, as described above, when the specification of the title T1 is a winning battle with three characters, the progress point value can be calculated as follows.
Progress point value = (Points at normal end corresponding to dan difference) x (Number of wins at stop of play) ÷ (Number of wins at normal end = 3)
For example, when "the rank difference between players is 2" and "the point at the time of normal end corresponding to the rank difference is 2P", it is as follows.
Progress point value = 2P x number of wins 2 ÷ number of wins at normal end 3 = 4 / 3P

The above-mentioned calculation method of the progress point value is an example, and can be transformed into various methods.
For example, it can be transformed as follows.
Progress point value = (Points at the end of normal corresponding to the rank difference) x (Number of wins at the end of play-Number of defeats) ÷ (Number of wins at the end of normal = 3)
In this case, the winning percentage can be reflected in the progress point value.

Further, for 1R (round) when the play is stopped, the progress degree point value corresponding to the play progress degree of the round may be calculated, and the progress degree point value may be calculated by further adding these points.
Since the point value corresponding to 1R (round) is 2 / 3P (= total 2P x 1R / total 3R), when the play time of 1R is 90 seconds in total, it can be transformed as follows.
Round progress point value when play is stopped = 2 / 3P x (elapsed time at the end of play) ÷ (1R play time 90 seconds)
In this form, the progress point value can be calculated even when the play is canceled in the first round.

In S83, the point management unit 73 of the central server 50 determines whether or not the life value difference (superiority difference) at the time of interruption of play is within the determination value. When the point management unit 73 determines that the life value difference is within the determination value (S83: YES), the point management unit 73 proceeds to S84, while when it determines that the life value difference is larger than the determination value (S83: NO), Proceed to S83a.
The determination of the superiority or inferiority difference is based on the life value difference as in the above S74. However, in S83, this determination process is performed even when the communication influence degree is small.

In S83a, the point management unit 73 of the central server 50 gives progress points to the dominant player P.
In the case of proceeding to S83a, since the possibility of the situation reversal is low, in the embodiment, all the progress points are given to the dominant player P.
In this case, the point management unit 73 of the central server 50 does not subtract points from the inferior player P. Therefore, the game system 1 can strongly urge the inferior player P to stop the play (S72) when the communication state is lowered (S70: YES above).

In S84, the point management unit 73 of the central server 50 divides the progress degree points proportionally among both players P and gives them. This is because when proceeding to S84, the play is canceled with a small difference in superiority and inferiority and a high possibility of a reversal of the situation.
In the apportionment method, for example, the progress point may be divided according to the ratio of the remaining life values of both players P.

As described above, in the game system 1 of the present embodiment, when the play is canceled due to the communication state, points are given to the superior player P at the time of the stop of the play, and the inferior player P is given points. Do not subtract points from. Therefore, there is a benefit to the superior player P and no disadvantage to the inferior player P. Further, in the game system 1, when the difference in superiority or inferiority at the time of stopping the play is small, the points are proportionally given, so that both the superior player P and the inferior player P have an advantage.

[Store introduction processing]
The store introduction process is a process corresponding to # 6c in FIG.
FIG. 26 is a flowchart of the store introduction process of the first embodiment.
FIG. 27 is a diagram illustrating the inter-store battle play end screen 88 of the first embodiment.
FIG. 28 is a diagram illustrating a positional relationship between stores and a state of communication between stores according to the first embodiment.
FIG. 29 is a diagram illustrating the search result display screens 91 to 93 of the first embodiment.

In the store introduction process, the central server 50 communicates with the player P after the end of the inter-store battle play (that is, after the end of the inter-store battle play or after the normal end). This is a process of transmitting the store information and the like to the player P by displaying it on the display unit 14 of each game machine 10 (G011, G022) (first game machine, second game machine).

As shown in FIG. 26, in S91, the control unit 30 of the game machine 10 (G011) transmits play end information to the central server 50 based on the cancellation or normal end of the battle play.
In S92, the point management unit 73 of the central server 50 receives the play end information. In this case, the point management unit 73 returns information such as point granting to each game machine 10 (G011, G022) in response to the end of the battle play between the game machines 10 (G011, G022).

In S93, the matching control unit 32 of the game machine 10 (G011) determines whether the play end is based on the communication state or the normal end. If the end of play is based on cancellation (S93: YES), the control unit 30 proceeds to S94, while if it determines that the end of play is based on normal end (S93: NO), the control unit 30 proceeds to S93a.

In S93a, the matching control unit 32 of the game machine 10 (G011) displays the play end screen. Although not shown, the play end screen displayed based on the normal end does not include the store search display unit 89. That is, this display screen is obtained by deleting the store search display unit 89 from the store-to-store battle play end screen 88 shown in FIG. 28.
For this reason, the game system 1 does not introduce the store when the battle play ends normally. After that, the matching control unit 32 ends the process related to the store introduction.

In S94, the matching control unit 32 of the game machine 10 (G011) displays the inter-store battle play end screen 88.
As shown in FIG. 27, the inter-store battle play end screen 88 has a play result display unit 88a, a message display unit 88b, and a store search display unit 89.

FIG. 27 is a display example of the display unit 14 of the game machine 10 (G011) of the store A (first store), but the same applies to the display unit 14 of the game machine 10 (G022) of the store B (second store). Screen is displayed.
The play result display unit 88a displays information regarding the result of the battle play.
In this example, the play result display unit 88a states that "the battle play of the title T1 has ended due to the cancellation of the play" and "Ichiro (P011) is inferior to the result when the battle play is canceled, and Jiro (P022). Information such as "predominance" and "proportionate points received from the central server 50 are +1 and +1.5, respectively" is displayed.

The message display unit 88b is a portion that displays a message between players P in text. That is, when the message is input, the matching control unit 32 of each game machine 10 transmits the message to the opponent's game machine 10 via inter-store communication. Then, the matching control unit 32 displays the input message and the received message on the message display unit 88b, respectively.
In the example of FIG. 27, the content that Ichiro (P011), who was inferior in the battle game, requests a rematch for Jiro (P022) is displayed.
The method of inputting a message is not limited, but for example, the display unit 14 may function as a software keyboard depending on the pointer 14a being arranged on the message display unit 88b.

The store search display unit 89 has search buttons 89a to 89c.
The search buttons 89a to 89c are for the player (P011) to request the central server 50 to search for a nearby store of his / her own store A.
In the embodiment, the term "neighborhood" means that the player P can move within about one hour (determined movement time) by using a normal moving means.
Ordinary means of transportation are those used on a daily basis, and the concept includes, for example, walking, automobiles traveling on general roads, conventional lines, general route buses (buses mainly operated on general roads), and the like. is there. On the other hand, ordinary means of transportation include those that are not used on a daily basis, such as automobiles that use expressways, highway buses (buses that operate including expressways), toll limited express trains, and airplanes. There is no concept.
In addition, the neighborhood is geographically, for example, the concept of the same or adjacent areas (municipalities, prefectures, etc.).

As shown in FIG. 28A, the search button 89a requests the central server 50 to search for a store that satisfies the following conditions.
(A) Stores near store A (third store)
Here, it is assumed that the neighboring store is store C.
However, the communication state between the game machine 10 (third game machine) of store C and the game machine 10 (second game machine) of store B is that of the game machine 10 (first game machine) of store A and store B. It is better than the communication state between the game machines 10.
Ichiro (P011) of store A may select the search button 89a, for example, when he / she wants to rematch by moving to a nearby store.

As shown in FIG. 28B, the search button 89b requests the central server 50 to search for a store that satisfies the following conditions.
(B) Store A's neighborhood store (3rd store) and store B's neighborhood store (4th store)
Here, it is assumed that the neighboring stores are stores C and D, respectively.
However, the communication state between the game machine 10 (third game machine) of store C and the game machine 10 (fourth game machine) of store D is that of the game machine 10 (first game machine) of store A and store B. It is better than the communication state between the game machines 10 (second game machines).
For example, when Ichiro (P011) of store A wants to rematch by moving to store C and having the other party Jiro (P022) move from store B to store D, the search button is displayed. 89b may be selected.

As shown in FIG. 28C, the search button 89c requests the central server 50 to search for a store that satisfies the following conditions.
(C) A nearby store of store A and a nearby store of store B Here, it is assumed that the neighboring store is store E.
Ichiro (P011) of store A may select the search button 89c when, for example, he and his opponent Jiro (P022) want to rematch by moving to the same store E.
The game system 1 continues the store introduction process according to the button selection of the store search display unit 89.

In S95, the matching control unit 32 of the game machine 10 (G011) transmits the button operation information to the central server 50 when any of the search buttons 89a to 89c is selected.
In S96, when the matching control unit 72 of the central server 50 receives the button operation information from the game machine 10 (G011), the store search process is performed as follows.

(Extraction of stores near store A: see Fig. 28 (A))
In S97, the matching control unit 72 of the central server 50 determines whether or not the button operation information is the operation information of the search button 89a. When the matching control unit 72 determines that the operation information of the search button 89a is (S97: YES), the process proceeds to S97a, while when it is determined that the information is not the operation information of the search button 89a (S97: NO). ), Proceed to S98.

In S97a, the matching control unit 72 of the central server 50 extracts stores that match the above (A) as follows.
(1) By referring to the store information storage unit 63 (see FIG. 5A), nearby stores of store A are extracted. In this case, neighboring stores are extracted based on the address of the store A. In this case, the matching control unit 72 obtains the distance from the store A to a neighboring store, the travel time, the means of transportation, and the like by using, for example, a database of geographic information, an application for calculating the travel time by means of transportation, and the like. As a result, the matching control unit 72 can extract stores in the vicinity of the store A based on the store information storage unit 63.
(2) By referring to the communication state history storage unit 65 (see FIG. 6A), the communication state of the neighboring store and the store A extracted in the above (1) is the normal state between the store A and the store B. Extract stores that are better than (for example, "good" or better).
In this case, the matching control unit 72 of the central server 50 may perform a process of confirming the current communication state by causing the game machine 10 of the neighboring store and the store A to perform the frame exchange process. The matching control unit 72 of the central server 50 does not extract this store as a neighboring store when the communication state at the present time is lower than that at the time of the battle.

(3) As the search result information, the store information (store name, distance from the store, travel time, means of transportation, communication status with store B, etc.) of the store extracted in (2) above is used in the game machine 10 (G011). Send to.
When the matching control unit 72 of the central server 50 has a plurality of stores corresponding to the above (2), the matching control unit 72 may transmit a plurality of store information as a search result, or the matching control unit 72 of the plurality of stores. Of these, store information with the best communication status may be transmitted.
Further, when the store corresponding to the above (2) does not exist, the matching control unit 72 of the central server 50 provides the game machine 10 (G011) with information indicating that the store does not exist as search result information. Send.

(Extraction of stores near store A and stores near store B: see Fig. 28 (B))
In S98, the matching control unit 72 of the central server 50 determines whether or not the button operation information is the operation information of the search button 89b. When the matching control unit 72 determines that the operation information of the search button 89b is (S98: YES), the process proceeds to S98a, while when it is determined that the information is not the operation information of the search button 89b (S98: NO). ), Proceed to S99.

In S98a, the matching control unit 72 of the central server 50 extracts stores that match the above (B) as follows.
(1) By referring to the store information storage unit 63 (see FIG. 5 (A)), the neighboring stores of the store A and the neighboring stores of the store B are extracted, respectively. In this case, similarly to S97a, the neighborhood stores of the store A and the neighborhood stores of the store B are extracted based on the addresses of the stores A and B. Further, the distance from the store A to the neighboring store, the traveling time, the means of transportation, etc. are obtained, and further, the distance from the store B to the neighboring store, the traveling time, the means of transportation, etc. are obtained.
(2) From the stores extracted in (1) above, a store whose communication state between both neighboring stores is better than the communication state between store A and store B (for example, "good" or higher) is extracted.

(3) As the search result information, the store information (store name, distance from the store, travel time, means of transportation, communication status with store B, etc.) of both neighboring stores extracted in (2) above can be used in the game machine 10 ( Send to G011).
In this case as well, the matching control unit 72 of the central server 50 may transmit a plurality of store information or the like as a search result, as in S98a. If the corresponding store does not exist, the matching control unit 72 transmits information indicating this to the game machine 10 (G011).

(Extraction of neighboring stores near store A and near store B: see FIG. 28 (C))
In S99, the matching control unit 72 of the central server 50 determines whether or not the button operation information is the operation information of the search button 89c. When the matching control unit 72 determines that the operation information is the search button 89c (S99: YES), the process proceeds to S99a, while when it is determined that the information is not the operation information of the search button 89c (S99: NO). ), Proceed to S99b.

In S99a, the matching control unit 72 of the central server 50 extracts stores that match the above (C) as follows.
(1) By referring to the store information storage unit 63 (see FIG. 5 (A)), a store that is in the vicinity of the store A and is in the vicinity of the store B is extracted. In this case, as in S97a, stores that are close to both stores A and B are extracted based on the addresses of stores A and B. Then, the distance from the store A to the neighboring store, the traveling time, the means of transportation, etc. are obtained, and the distance from the store B to the neighboring store, the traveling time, the means of transportation, etc. are obtained.

(2) As the search result information, the store information of the neighboring stores extracted in (1) above is transmitted to the game machine 10 (G011). In this case as well, the matching control unit 72 of the central server 50 may transmit a plurality of store information or the like as a search result as in S97a, and also provides information indicating that the corresponding store does not exist. , May be transmitted to the game machine 10 (G011).
After that, the matching control unit 72 of the central server 50 proceeds to S99b and ends the process.

In S100, the matching control unit 32 of the game machine 10 (G011) displays any of the search result display screens 91 to 93 on the display unit 14 in response to receiving the search result information from the central server 50.
The details of the search result display screens 91 to 93 will be described.
As shown in FIG. 29, the search result display screens 91 to 93 include neighborhood store information display units 91a to 93a and message display units 91b to 93b.
The neighborhood store information display units 91a to 93a display the store information included in the search result information.
The message display units 91b to 93b are display areas similar to the message display units 88b (see FIG. 27).
Although not shown, when the information indicating that the corresponding store does not exist is received from the central server 50, the information indicating "the corresponding store does not exist" is displayed on the display unit 14.

As shown in FIG. 29 (A), when the matching control unit 32 of the game machine 10 (G011) receives the search result information transmitted by the central server 50 in S97a, the neighborhood of the store A extracted in S97a. The store information of the store is displayed on the neighboring store information display unit 91a.
In the example of FIG. 29A, the neighborhood store information display unit 91a displays information such as the neighborhood store name “store C”, the means of transportation “train”, and the travel time “10 minutes”.
By referring to the neighboring store information display unit 91a, Ichiro (P011) of the game machine 10 (G011) of the store A sends a message to the opponent to tell the opponent that he / she will move to the store C and the time until the rematch. It can be input to the display unit 91b.

As shown in FIG. 29B, when the matching control unit 32 of the game machine 10 (G011) receives the search result information transmitted by the central server 50 in S98a, the neighborhood of the store A extracted in S98a. Each store information of the store and the neighboring store of the store B is displayed on the neighboring store information display unit 92a.
In the example of FIG. 29B, the neighborhood store information display unit 92a displays information such as the neighborhood store name “store C” of the store A, the means of transportation “train”, and the travel time “20 minutes”. In addition, the neighborhood store information display unit 92a displays information such as the neighborhood store name “store D” of store B, the means of transportation “train”, and the travel time “10 minutes”.
As a result, Ichiro (P011) of the game machine 10 (G011) of the store A moves to the store C by referring to the neighboring store information display unit 92a, and moves to the store D with respect to the opponent. A message for telling the opponent about the request, the time until the rematch, and the like can be input to the message display unit 92b.

As shown in FIG. 29 (C), when the matching control unit 32 of the game machine 10 (G011) receives the search result information transmitted by the central server 50 in S99a, the neighborhood of the store A extracted in S99a. The store information of the neighboring store, which is in the vicinity of the store B, is displayed on the neighboring store information display unit 93a.
In the example of FIG. 29 (C), the neighborhood store information display unit 93a has the neighborhood store name “store E”, the means of transportation “train” from store A, the travel time “20 minutes”, and the means of transportation “walking” from store B. , And the travel time is "10 minutes".
The player (P011) of the game machine 10 (G011) of the store A moves to the store E by referring to the neighboring store information display unit 93a, and moves to the same store E with respect to the opponent Jiro (P022). A message for requesting the movement of the player, the time until the rematch, and the like to inform the opponent can be input to the message display unit 93b.

As described above, when the inter-store battle play ends due to cancellation, the game system 1 introduces a store with good communication conditions and neighboring stores of both stores by performing a store introduction process. Therefore, for example, the game system 1 provides the player P with an opportunity to rematch in a better environment when the player P is dissatisfied with the communication state at the time of the match and wishes to rematch. Can be provided.

The above embodiment shows an example in which the store introduction process is performed when the play ends due to the cancellation, but the present invention is not limited to this, and the store introduction process may be performed even when the play ends due to the normal end. Even in this case, the game system 1 can provide an opportunity to rematch in a better environment.
Further, the store information storage unit 63 of the central server 50 may store each store in association with a neighboring store. In this case, the matching control unit 72 of the central server 50 can extract neighboring stores of each store based on the information of the store information storage unit 63, regardless of the location information such as the address.

[Play resume processing]
The play restart process is a process corresponding to # 11 in FIG.
30 and 31 are flowcharts of the play restart process of the first embodiment.
FIG. 32 is a diagram showing a restart title selection screen 95 of the first embodiment.
The play restart process is a process for resuming play on the game machine 10 (G022) after the end of the battle play. The battle play may be either an in-store battle or an inter-store battle. The play resumption process after the battle between stores may be performed according to the end of the store introduction process.
In S110, the play control unit 31 of the game machine 10 (G011) starts the play restart process in response to the end of the battle play.

In S111, the play control unit 31 determines whether or not the one-player title before the start of the battle play and the battle title in which the battle play is performed are the same title. When it is determined that both titles are the same (S111: YES), the play control unit 31 proceeds to S111a, while when it is determined that they are not the same (S111: NO), the play control unit 31 proceeds to S112.

In S111a, the play control unit 31 determines whether or not the player (P011) of the game machine 10 (G011) has won the battle play. If the play control unit 31 determines that it is a victory (S111a: YES), it proceeds to S114, while if it determines that it is not a victory (S111a: NO), that is, if it is defeated, it proceeds to S114. Proceed to S118 to end the process.
The reason for proceeding to S118 and ending the process is that since the one-player title and the battle title are the same (S111: YES), the play fee is charged only for the one-player title (see S11 in FIG. 14). In addition, the player (P011)'s right to play one player's title has been extinguished due to the defeat in the competitive play.

In S112, the play control unit 31 of the game machine 10 (G011) determines whether the end factor of the battle play is the play stop (see S76 in FIG. 22) or the normal end. The play control unit 31 proceeds to S115 when it is determined that the play is stopped (S112: YES), and proceeds to S113 when it is determined to be a normal end (S112: NO).
In the case of an in-store match, the play is not canceled due to the communication state, so it is determined that the match is normal (S112: NO).
In S113, the play control unit 31 of the game machine 10 (G011) determines whether or not the player (P011) of the game machine 10 (G011) has won the battle play. If it is determined that the play control unit 31 has won (S113: YES), the process proceeds to S115, while if it is determined that the player has been defeated (S113: NO), the process proceeds to S114.

In S114, the play control unit 31 of the game machine 10 (G011) resumes the play of the one-person title without charge. Further, in this case, the play of the one-player title is restarted from the position where the battle play was interrupted, that is, the elapsed position corresponding to the interruption. As for the position at the time of interruption, for example, the storage unit of the game machine 10 (G011), the store server 7 or the central server 50 may store the position when the one-player play is interrupted.

Explain the reason for resuming the play of one-player titles without charge.
There are the following two scenes to proceed to S114.
The first scene is a case where the one-player title and the battle title are the same (S111: YES), the play fee is charged only for the one-player title (S11 in FIG. 14), and the battle play is won. Yes (S111a: YES).
In this case, the play fee is charged only for one player title, but the player (P011) continues to have the right to play one player title by winning the battle play. Therefore, the game system 1 restarts the play of the one-player title without charge after the battle play is completed.

In the second scene, the one-player title and the battle title are different (S111: NO), and the play fee is charged for both titles (S11 in FIG. 14 for the one-player title, S31a in FIG. 15 for the battle title, or S52a) in FIG. 17, and the case is defeated in the battle play.
In this case, with respect to the battle title, the player (P011) has lost the right to play due to the normal end and defeat of the battle play. On the other hand, since the one-player title is in a state of being interrupted by the start of the battle play, the player (P011) continues to have the right to play the one-player title. Therefore, the game system 1 restarts the play of the one-player title without charge after the battle play is completed.

Further, the one-player title has been interrupted in order to start the competitive play (see S32 in FIG. 15 and S53 in FIG. 17) while the one-player title is being played.
In this S114, after the battle play is completed, the player (P011) continues to play the one-player title even if the battle play is sandwiched by restarting the one-player title from the position where the one-player title was interrupted. be able to.

The position where the one-person title is interrupted does not have to be the exact interrupted position as long as it corresponds to the interrupted position. For example, if the battle play is interrupted 45 seconds after the start of the play of one player title before the start, it does not have to be started exactly 45 seconds later.
For example, if the specifications of the game are the above-mentioned win-out battle, 3 rounds are one set, and the game is played over multiple stages, it restarts from the beginning of the stage at the time of interruption (that is, the beginning of the first round). You may. In this case, the process may be restarted from the beginning of the interrupted round.

In S115, as shown in FIG. 32, the play control unit 31 of the game machine 10 (G011) displays the restart title selection screen 95 on the display unit 14.
The resume title selection screen 95 has a one-person title selection button 95a and a battle title selection button 95b.
By selecting the one-player title selection button 95a and the battle title selection button 95b, the player (P011) can select a game to be restarted immediately after the end of the battle play from both titles.

The game system 1 will be described so as to accept the selection of both titles from the player (P011).
There are the following two scenes to proceed to S115.
In the first scene, the one-player title and the battle title are different (S111: NO), and the play fee is charged for both titles (S11 in FIG. 14 for the one-player title, S31a in FIG. 15 for the battle title, or S52a) in FIG. 17, and the battle play is canceled due to the communication state (S112: YES).
In this case, since the one-player title is in a state of being interrupted by the start of the battle play, the player (P011) continues to have the right to play the one-player title. In addition, the battle title is a state in which the battle play is canceled due to the communication state. Here, the play right is a right that can be performed until the end of the play by the normal end. Therefore, when the battle play is canceled due to the communication state, the player (P011) continues to have the right to play the battle title.
Therefore, at the end of the battle play, the player (P011) has the right to play both titles.
For this reason, the game system 1 makes it possible to select a game to be restarted from both titles after the battle play is completed.

In the second scene, the one-player title and the battle title are different (S111: NO), and the play fee is charged for both titles (S11 in FIG. 14 for the one-player title, S31a in FIG. 15 for the battle title, or S52a) in FIG. 17, and the case where the player wins the battle play (S113: YES).
In this case, the one-person title continues to have the right to play the one-person title as in the first scene. Further, regarding the battle title, the player (P011) continues to have the right to play the battle title by winning the battle play.
Therefore, in the second scene, at the end of the battle play, the player (P011) has the right to play both titles.
For this reason, the game system 1 makes it possible to select a game to be restarted from both titles after the battle play is completed.

In S116, the play control unit 31 of the game machine 10 (G011) determines whether or not the one-person title selection button 95a is selected on the restart title selection screen 95. When it is determined that the one-player title selection button 95a is selected (S116: YES), the play control unit 31 proceeds to S116a, while when it is determined that the battle title selection button 95b is selected (S116: NO). , S117a.

In S116a, the play control unit 31 of the game machine 10 (G011) responds to the selection of the one-person title selection button 95a on the restart title selection screen 95, or to the end of the play of the battle title ( S117c: NO, which will be described later), the play of the one-person title is resumed without charge. The end of the play of the battle title is when the battle title selection button 95b is selected on the restart title selection screen 95 (S116: NO) and the play is finished.
This process is the same as in S114, and the play control unit 31 resumes play without charge based on the play right of the one-player title, and restarts from the position when the play of the one-player title is interrupted.

In S116b, the play control unit 31 of the game machine 10 (G011) proceeds to S116c when the play of the one-person title is completed. The play right of the one-person title is extinguished when the play of the one-person title ends.

In S116c, the play control unit 31 of the game machine 10 (G011) determines whether or not the play of the battle title has already ended. The case where the play of the battle title has already ended is the case where the play process of the battle title is performed by S117a described later.
When the play control unit 31 of the game machine 10 (G011) determines that the play of the battle title has already ended (S116c: YES), the process proceeds to S118, while the play control unit 31 determines that this has not ended. (S116c: NO), the process proceeds to S117a.
If the play of the battle title has already ended (S116c: YES), the play rights of both titles have been extinguished. Therefore, the play control unit 31 proceeds to S118 and resumes play. To finish.

In S117a, the play control unit 31 of the game machine 10 (G011) has finished playing the match title selection button 95b (S116: NO) or one player title in response to the selection of the battle title selection button 95b on the restart title selection screen 95. In response, the play of the battle title is started without charge. The latter one-player title play ends when the one-player title selection button 95a is selected on the resume title selection screen 95 (S116: YES) and the play ends (S116b → S116c: NO).
In this case as well, the play control unit 31 starts playing without charge based on the play right of the battle title. However, since the battle title is not interrupted to start the battle play, the start position of the play of the battle title is the beginning of the play regardless of whether the end of the play is canceled or normally ended. (For example, the beginning of the first stage).

In S117b, the play control unit 31 of the game machine 10 (G011) proceeds to S117c when the play of the battle title is completed. The play right of the battle title is extinguished when the play of the battle title is completed.

In S117c, the play control unit 31 of the game machine 10 (G011) determines whether or not the play of the one-person title has already ended. The case where the play of the one-person title has already ended is the case where the play process of the one-person title by the above S116b has been completed.
When it is determined that the play of the one-person title has already ended (S117c: YES), the play control unit 31 of the game machine 10 (G011) proceeds to S118, while determining that this has not ended. In the case (S117c: NO), the process proceeds to S116a.
If the play of one player title has already ended (S117c: YES), the play rights of both titles have been extinguished. Therefore, the play control unit 31 proceeds to S118 and resumes play. End the process.

As described above, when the one-player play is resumed after the battle play is completed, the game machine 10 restarts the one-player play from the position where the one-player play was interrupted to start the battle play. Therefore, the player P can resume the play from the state before the battle play even when the battle play is performed.

(Second Embodiment)
Next, the second embodiment of the present invention will be described.
In the following description and drawings, the same reference numerals or the same reference numerals are appropriately added to the endings (last two digits) of the parts that perform the same functions as those of the above-described first embodiment, and duplicate explanations are appropriately given. Omit.
In this embodiment, the processing of in-store matching and inter-store matching is changed from the first embodiment.
FIG. 33 illustrates the matching selection process of the second embodiment.
FIG. 34 is a diagram showing a matching type selection screen 281 and a title selection screen 280 of the second embodiment.

In S11 and S12, the matching control unit of the game machine 210 (see the matching control unit 32 shown in FIG. 2) performs the billing process and the player ID acquisition process (see FIG. 14) as in the first embodiment.
In S216, as shown in FIG. 34A, the matching control unit of the game machine 210 displays the matching type selection screen 281 on the display unit 14 and performs the matching type selection process.
The player P may select the in-store matching button 281a when he / she desires in-store matching, and may select the in-store matching button 281b when he / she desires in-store matching.

The matching control unit of the game machine 210 proceeds to S217 when the in-store matching button 281a is selected (S216: YES), while when it determines that the inter-store matching button 281b is selected (S216: YES). NO), proceed to S218.

(In-store matching process)
In S217, the matching control unit of the game machine 210 starts the in-store matching process.
In the in-store matching process, the matching control unit of the game machine 210 displays a title selection screen (see the title selection screen 80 in FIG. 18A) similar to that of the first embodiment, so that the matching control unit can display one person's title. Accepts selection and selection of multiple battle titles.
After that, the matching control unit of the game machine 210 performs matching processing on a plurality of battle titles as in the first embodiment (see FIG. 15).

(Matching process between stores)
In S218, the matching control unit of the game machine 210 starts the inter-store matching process.
As shown in FIG. 34 (B), the matching control unit of the game machine 210 displays the title selection screen 280 in the inter-store matching process.
The title selection screen 280 has a one-person title selection display unit 280a and a battle title selection display unit 280b.
The one-person title selection display unit 280a is the same as the one-person title selection display unit 80a (see FIG. 18A) of the first embodiment.

On the other hand, the battle title selection display unit 280b does not receive the selection of a plurality of battle titles as in the first embodiment, but accepts the selection of only one battle title.
Therefore, the player can select only one desired battle title on the battle title selection display unit 280b.
Subsequent processing performs matching processing for one battle title selected by the battle title selection display unit 280b. Other processing is the same as that of the first embodiment. That is, in the first embodiment, the matching process is performed for a plurality of battle titles, whereas in the present embodiment, the matching process is performed for one battle title.
Therefore, the matching control unit of the game machine 210 first determines whether or not the in-store matching is established for one battle title (see S42 in FIG. 16), and when the in-store matching is not established. The central server is requested to match between stores for one match title (see S43 in FIG. 16).
The matching control unit of the central server performs matching opponent extraction processing for this one battle title (see S45 in FIG. 14), and transmits the result to the game machine 210 (see S46 in FIG. 14).
Then, the play control unit of the game machine 210 (see the play control unit 31 of FIG. 2) starts a battle play with another game machine based on the result of the matching partner extraction process of the central server.

As described above, in the present embodiment, in the case of in-store matching, matching processing is performed for a plurality of competition titles, while in the case of inter-store matching, matching processing is performed for only one competition title.
In the former case, the matching partner is limited to the game machine in the store (that is, the player in the same store), so that the matching process is performed for a plurality of battle titles as in the first embodiment. This is because matching is easily established.
On the other hand, in the latter case, since the matching partner is a plurality of game machines in a plurality of stores (that is, a plurality of game machines in a plurality of other stores), the population parameter is sufficiently large. Therefore, in the latter case, even if the matching process is performed only for one battle title, the matching is likely to be established.

Therefore, for the player, when he / she desires an in-store battle, there is a high possibility that the battle play can be performed by selecting a larger number of battle titles. On the other hand, if you want to play a match for one desired title, you can increase the possibility of playing a match by selecting matching between stores.
Further, the central server has a low load because it is sufficient to perform matching partner extraction processing or the like for one title.

(Third Embodiment)
Next, a third embodiment of the present invention will be described.
In this embodiment, the point processing at the time of stopping the play is changed from the first embodiment.
FIG. 35 is a flowchart of provisional point processing according to the third embodiment.
FIG. 36 is a diagram illustrating a flow of provisional point processing according to the third embodiment.

In S301, the point management unit of the central server 350 (see the point management unit 73 in FIG. 2) receives play end information from the game machine in response to the cancellation of the battle play. As described in the first embodiment, the play end information includes both player IDs and information on superiority or inferiority when the play is stopped.
In S302, as shown in FIG. 36, the point management unit of the central server 350 calculates temporary points (temporary benefits) and gives them to the dominant player.
Temporary points are calculated based on the superiority or inferiority information at the time of canceling the play included in the play end information. The provisional points may be, for example, points given to the winner of normal termination, or may be the apportioned points described in the first embodiment.

Then, the point management unit stores the player ID of the dominant player, the temporary point information, and the play stop information in association with the player information storage unit (see the player information storage unit 67 in FIG. 2) of the storage unit. The play cancellation information includes information such as the date and time of the canceled battle play and the opponent (player ID of the inferior player).

In S303, the point management unit of the central server 350 determines whether or not the rematch (rematch play) of the battle play that has been canceled has started within the specified period.
Since the point management unit performs inter-store matching processing (see FIGS. 16, 17, etc.) of both players as in the first embodiment, it is possible to determine whether or not both players have rematched.
Further, the rematch of both players may be based on the store introduction process of the first embodiment.

In the matching of the rematch, the control unit of the game machine receives a rematch request from the inferior player to the superior player (see S50 in FIG. 17, 20 (B), etc.), and the communication state is the original battle play. If better than time, dominant play prevents this request from being denied.
Further, the specified period can be appropriately set according to the specifications of the system, and for example, a period such as one week can be set.
If the point management unit of the central server 350 determines that the rematch (rematch play) has started within the specified period (S303: YES), it proceeds to S305, while if it determines that it does not start (S303: YES) S303: NO), proceed to S304.

In S304, the point management unit of the central server 350 converts the temporary points given to the superior player into the present points (this privilege) which are normal points. As a result, if the rematch is not performed, the superior player can acquire temporary points as the main points.
Here, the case where the rematch is not performed includes the case where the inferior player does not request the superior player to rematch. Therefore, the system operator and the like can treat it as "the inferior player admitted that he cannot beat the superior player even if he rematches." In addition, the inferior player does not deduct the points possessed by the original battle play. As a result, the inferior player does not have any disadvantage due to the provisional points being given to the superior player as the present points.

In S305, the point management unit of the central server 350 converts temporary points into main points (normal points) and gives them to the player who won the rematch play in response to the normal completion of the rematch play.
In this case, the point management unit of the central server 350 can determine the result of the rematch play by receiving the play end information transmitted by the game machine in response to the end of the rematch play.

As a result, in the rematch, when the superior player of the original battle play wins, this point is given to the superior player as in the above S304.
On the other hand, in the rematch, if the superior player of the original battle play is defeated, that is, the inferior player of the original battle play wins, the provisional points are converted into the main points (normal points) and the original battle play is performed. It is given to the inferior player of. As a result, the tentative points are forfeited by the dominant player in the original battle play.

By the processing of this S305, even if the inferior player of the original battle play is dissatisfied with, for example, "In the original battle play, if the communication condition is good, I should have been able to obtain points". It can be resolved. Also, for the superior player of the original battle play, even if the provisional points are confiscated due to the defeat in the rematch, it is unavoidable because it is the result of the rematch in a good communication condition. It turns out that. Further, for both players, it is advantageous because the provisional points can be converted into the main points before the specified deadline by rematching.

As described above, the game system of the present embodiment gives temporary points to the dominant player when the play is stopped, and converts the temporary points into the main points in response to a rematch or the like, so that the player is encouraged to rematch. Can be done.

(Fourth Embodiment)
Next, a fourth embodiment of the present invention will be described.
In this embodiment, the process of accepting the next operation after each operation is changed from the first embodiment.
FIG. 37 is a diagram illustrating the advance input process of the fourth embodiment.
Note that FIG. 37 describes the processing of one game machine 410 during the battle play, but the processing of frame exchange between the two game machines 410 during the battle play is the same as that of the first embodiment.
As shown in FIG. 37 (A), after the operation of the a button (weak punch) or the like, the operation information is reflected over several frames. In the first embodiment, the reflection of the operation information has been briefly described.

That is, when the a button is operated in the frame F001 (arrow a40), the control unit of the game machine 410 (see the control unit 30 in FIG. 2) reflects the operation information of the a button from the frame F004 due to the frame delay. Start. Then, the operation information of the a button is reflected over the frames F004 to F009 (hereinafter, also referred to as "operation reflection").
The operation reflection process includes a series of processes of generation, persistence, and rigidity. In the embodiment, each processing period is set to 2 frames as an example. The control unit of the game machine 410 performs each process as follows.

-Occurrence (arrow a41): F004, F005
A play screen in which a punch corresponding to the operation of the a button is delivered from the character is displayed on the display unit.
-Continued (arrow a42): F006, F007
Determine if the punch hits the enemy character. In addition, the play screen in which the character's arm is extended and fully extended is displayed on the display unit.
Rigidity (arrow a43): F008, F009
The play screen is displayed on the display unit until the character's arm returns from the fully extended state to the original position.

The control unit normally does not accept a new operation during the operation reflection process.
The advance input process is a process of accepting an operation during such a period in which the operation is not normally accepted. The period in which the advance input is possible can be, for example, a rigid period in the operation reflection process.

FIG. 37 (A) is an example in which the operation of the b button (strong punch) is accepted in the frame F008 during the rigid processing as the advance input (arrow a44).
In this way, after the a button operation (arrow a40), when the next operation b button operation (arrow a44) can be accepted, the form of performing the advance input processing usually accepts the operation from the frame F010 or later. It is faster than the form of.
Therefore, in the game system of the present embodiment, by performing the advance input processing, it is possible to reduce the sluggishness of the play progress due to the frame delay, and it is possible to reduce the feeling of frustration of the player.

FIG. 37B shows an example in which a frame delay occurs during the rigidity of the operation reflection process (arrow a46).
In this case, the period in which the operation can be accepted by performing both the advance input process and the stop period input process of the first embodiment is the period in which the advance input can be accepted and the delay time L. It will be the period of. As a result, the operable period becomes longer, so that the player can easily perform an input operation of, for example, a complicated technique (for example, a compound operation (for example, a compound operation (see FIG. 4A) that involves a plurality of operations)). ..

(Fifth Embodiment)
Next, a fifth embodiment of the present invention will be described.
In this embodiment, the in-store search process (see S41 in FIG. 16) performed before matching between stores is changed from the first embodiment.
FIG. 38 is a diagram illustrating the in-store search time tables 527a and 527b of the fifth embodiment.
As shown in FIG. 38 (A), the storage unit of the game machine of the present embodiment (see the storage unit 20 of FIG. 2) has an in-store search time table 527a (in-store search time storage unit).
The in-store search time table 527a stores the game machine operating rate and the in-store search time in association with each other.

The occupancy rate is the occupancy rate of four game machines (see game machines 10 (G011 to G014) of store A in FIG. 1) arranged in the same store. For example, if four are operating at a certain time, the operating rate is 100%, and if two are operating, the operating rate is 50%.
The in-store search time is the duration of the in-store search process (see S41 in FIG. 16).
The in-store search time table 527a has information that the in-store search time becomes longer as the operating rate increases. That is, when the occupancy rate is less than 30%, the in-store search time is 0 seconds, and as the occupancy rate increases, the in-store search time becomes longer, and when the occupancy rate is 80% or more, the in-store search time is 30 seconds.

Therefore, the control unit of the game machine (see the control unit 30 in FIG. 2) performs the in-store search process for a longer time as the operating rate of the game machine in the store is higher.
The reason is as follows.
The higher the operating rate of the game machine in the store, the larger the number of players playing on the game machine. Further, when the operating rate is high, the number of players who are present in the store but are not actually playing is usually large.
Therefore, when the game machine newly accepts the matching between stores (S14: NO → S18 in FIG. 14), even if the in-store matching is not established in the in-store search process (S41 in FIG. 16) immediately after that, a little By waiting for only the time, there is a high possibility that matching requests will be made from other game machines in the store.
In addition, when other players in the store strongly desire competitive play, they immediately confirm that one player has started accepting play with a matching request on the game machine, thereby immediately playing another game. In some cases, the machine accepts play with a matching request.

As described above, when the operating rate of the game machine in the store is high, there is a high possibility that the matching in the store will be established after waiting for a short time. Therefore, in the game machine of the present embodiment, when the operating rate is high, the time for the in-store search process is lengthened, and then when the in-store matching is not established, the inter-store matching process (S43 in FIG. 16). I am trying to move to.
On the other hand, when the operating rate of the game machine is low, it is unlikely that in-store matching will not be established even if the in-store search processing time is lengthened. Therefore, in the game machine of the present embodiment, when the operating rate of the game machine is low, the inter-store matching process (S43 in FIG. 16) is promptly performed without performing the in-store search process or by shortening the time. ).

As described above, the game system of the present embodiment uses the operating rate of the game machine in the store as information indicating the degree of ease of establishing the matching in the store, before the transition to the matching between stores. In-store matching can be easily established.

The information indicating the degree of ease of establishment of in-store matching is not limited to the operating rate of the game machine in the store, and may be information indicating this degree.
As shown in the in-store search time table 527b of FIG. 37 (B), for example, a time zone may be used as this information. This time zone is divided according to the number of players in the store and the operating rate of the game machine. The in-store search time is set longer during the time zone when the number of players in the store is large and the time zone when the operating rate of the game machine is high. This is because in-store matching is likely to be established during this time period.
On the other hand, the in-store search time is set short in the time zone when the number of players in the store is small and in the time zone when the operating rate of the game machine is low. This is because it is difficult to establish in-store matching during this time period.

Further, the in-store search time tables 527a, 527b and the like are not limited to the forms provided in the game machine, and may be provided in the store server, the central server and the like. In this case, the control unit of these servers may set the in-store search time in the game machine based on the information in the in-store search time tables 527a, 527b, etc. by instructing the game machine. ..

Furthermore, the presence or absence of in-store search processing (that is, the setting to perform in-store search processing, the setting to not perform in-store search processing) is set according to the degree of ease of establishment of in-store matching, not in the form of having a range of in-store search time. You may.
Further, for example, a clerk or the like may set the in-store search time of the game machine or set the presence / absence of the in-store search process each time.

(Sixth Embodiment)
Next, a sixth embodiment of the present invention will be described.
In this embodiment, the opponent extraction process (see S45 in FIG. 16) in the inter-store matching process is changed from the first embodiment.
FIG. 39 is a diagram illustrating the character combination table 621c, the team configuration storage unit 621d, and the standby team configuration storage unit 668 of the sixth embodiment.
As shown in FIG. 39A, each game machine 610 and the central server 650 include a character combination table 621c. The character combination table 621c may be included in the game program.

The character combination table 621c stores the selected character and the enemy character in association with each other.
The selected character is the character C selected by the player P to operate in the battle play.
The enemy character is the character C who opposes in one-player play. Therefore, in the one-player play, the selected character and the enemy character corresponding to the selected character will play against each other.

As shown in FIG. 39 (B), each game machine 610 includes a team configuration storage unit 621d.
The team composition storage unit 621d stores the selected character, the order of the battle, and the enemy character.
That is, the game of the present embodiment is played by forming a team with three selected characters selected by the player P.
Since FIG. 39 (B) is a table when the training mode is selected (described later), no enemy character is set for the second and third characters C4 and C5.

As shown in FIG. 39C, the central server 650 includes a standby team configuration storage unit 668.
The standby team composition storage unit 668 stores information on the game machine 610 that is waiting for a match. That is, after the matching request for the match between stores is requested to the central server 650, the information of the game machine 610 in which one player is playing is stored. The standby team configuration storage unit 668 stores information on the store name, game machine ID, player ID, selected character, selected character order, and enemy character in association with each other.

FIG. 40 is a flowchart of the inter-store matching process of the sixth embodiment.
FIG. 41 is a diagram showing a display screen during the inter-store matching process of the sixth embodiment.
Although detailed description will be omitted in FIG. 40, it is assumed that the inter-store matching process (S16: NO → S18 in FIG. 14) is selected for this process after the billing process (see S11 in FIG. 14). To do. Further, it is assumed that the one-person title and the battle title are the same title.
The processes of S601 to S603 can be performed after the one-person title is selected (see S14 in FIG. 14) and before the central server 650 is matched between stores.

In S601, the control unit of the game machine 610 (see the control unit 30 in FIG. 2) accepts the mode selection of one play as the processing after the selection of the one-person title.
Although not shown, the control unit of the game machine 610 can accept the selection of one play mode by displaying the training mode button and the CPU battle mode button on the display unit 14, for example.

In the training mode, one selected character of the player P's team and one enemy character controlled by the control unit compete against each other for a specified time (for example, 180 seconds) without change. However, as the player P changes the team composition, one character of the player P and one enemy character are changed.
In the CPU battle mode, as described in the first embodiment, the three characters of the player P's team and the three enemy characters controlled by the control unit perform a winning battle.
When the control unit of the game machine 610 accepts the mode selection, it proceeds to S602.

In S602, as shown in FIG. 41 (A), the control unit of the game machine 610 performs the character selection acceptance process by displaying the character selection screen 681 on the display unit 14.
The character selection screen displays 12 buttons for selecting characters C1 to C6 and characters C11 to C16. The player P may select three of these as the selected characters that constitute his team.
The character selection screen 681 of FIG. 41 (A) is an example in which characters C3, C4, and C5 are selected.

In S603, as shown in FIG. 41 (B), the control unit of the game machine 610 performs the order selection acceptance process by displaying the order selection screen 682 on the display unit 14.
The order selection screen 682 displays a button indicating the selected character selected in S602. The player P may select the character C in the order of the battle.
The order selection screen 682 of FIG. 41 (B) is an example in which the characters C3, C4, and C5 are selected in this order.

The control unit of the game machine 610 stores the character C selected in S602 and S603 and the order thereof in the team configuration storage unit 621d.
The team configuration storage unit 621d in FIG. 39 (B) is an example in which the team is configured by the player P, Ichiro (P011).

In S604, the control unit of the game machine 610 requests the central server 650 for inter-store matching. This process is the same as that of the first embodiment (see S43 in FIG. 16). However, the control unit of the game machine 610 transmits the information of the team configuration storage unit 621d to the central server 650.

The control unit of the game machine 610 executes one-player play with the team configuration set in S602 and S603. Further, the control unit of the game machine 610 waits for inter-store matching as in the first embodiment while the one-player play is in progress (see S44 in FIG. 16).
FIG. 41 (C) shows a one-player play screen 683 of the one-player play in the training mode.
In the training mode, the first (leading) character C3 among the characters C selected by Ichiro (P011) and the enemy character C13 controlled by the control unit play against each other.
The control unit extracts the enemy character C13 by referring to the character combination table 612c (see FIG. 39 (A)).

In the training mode, the enemy character C13 is not changed until Ichiro (P011) selects to change the team (S610: YES described later). That is, the control unit continues to play the characters C3 and C13 until the team is changed.
Therefore, Ichiro (P011) can choose to cancel or continue the battle with the enemy character C13 at his own will. As a result, Ichiro (P011) can practice corresponding to the characteristics (attributes) of the enemy character C13. For example, if the enemy character C13's specialty is a throwing technique, Ichiro (P011) can practice throwing through.

The training mode is not limited to the form in which the enemy character operates, and may be, for example, a form in which the enemy character is stopped, or a form in which the operation and stop of the enemy character can be selected. Even in the form in which the enemy character is stopped, Ichiro (P011) can practice the attack technique, for example, when the enemy character has a characteristic that it is difficult to apply a specific technique.
Further, even in the case of a CPU battle, when the character operated by Ichiro (P011) changes according to the stage, the progress of the round, etc., the control unit selects the enemy character based on the character combination table 621c. You may change it.

In S606, when the control unit of the central server 650 (see the control unit 70 in FIG. 2) receives the matching request from the game machine 610, the control unit of the central server 650 receives the information contained therein in the standby team configuration storage unit 668 (see FIG. 39 (C)). ).
As a result, information such as the game machine ID, player ID, selected character, and enemy character of the game machine 610 making the matching request is stored in the standby team composition storage unit 668.
Then, the control unit of the central server 650 performs matching processing between stores based on the standby team configuration storage unit 668.
In the control unit of the central server 650, the one-player enemy character C13 of the game machine 610 (G011) and the character C selected by the other game machine 610 are the same as the matching opponent of the game machine 610 (G011). If there is, match both. That is, when the control unit of the central server 650 has the same character C13 of the one-player play of the game machine 610 (G011) and the character C selected by the one-player play of the other game machine 610, both are set. Match.
In the example of the standby team configuration storage unit 668 of FIG. 39 (C), the control unit of the central server 650 is the same character C as the one-player enemy character C13 of the game machine 610 (G011) and the game machine 610 (G011). Matches with the selected game machine 610 (G022).

If the matching request of S604 includes the information of the selected character, the information of the enemy character may not be included. This is because the control unit of the central server 650 can identify the enemy character by referring to the character combination table 621c based on the information of the selected character.

In S607, the control unit of the central server 650 transmits the matching result to the game machine 610 (G011). Similar to the first embodiment, the matching result information includes connection destination information and the like of the game machine 610 of the matching partner, and also includes information indicating that if matching is not established.

In S608, when the control unit of the game machine 610 (G011) receives the matching result information, it determines whether or not the inter-store matching is established.
The control unit of the game machine 610 (G011) proceeds to S608a when it is determined that the matching between stores is established (S608: YES), and proceeds to S608a when it is determined that the matching is not established (S608: NO). , S609.

In S608a, the control unit of the game machine 610 (G011) executes the inter-store battle play process. In this process, as in the first embodiment, after the one-player play is interrupted, the competitive play is started (see S47 in FIG. 16 to S53 in FIG. 17).
Here, as in the above example, when the game machine 610 (G011) and the game machine 610 (G022) are matched, the team composition of the battle play is such that the game machine 610 (G011) has characters C3, C4, C5. The game machine 610 (G022) becomes the characters C13, C11, and C12.
For this reason, Ichiro (P001) of the game machine 610 (G011) is interrupted from the one-player play (see FIG. 41 (C)) against the enemy character C13, and continues to play against the character C13 in the inter-store battle play. become. Therefore, Ichiro (P001) can play against the character C13 as a practice in the one-player play, and can play against the character C13 in the inter-store battle play as if it were an actual battle.
It should be noted that such actions and effects are the same for Jiro (P022) of the game machine 610 (G022). This is because Jiro (P022) can continue to play against character C3, who was playing against the game machine 610 (G022) by himself.

Although not shown, the processing is performed in the same manner as in the first embodiment after the battle play between stores is completed. That is, the control unit of the game machine 610 (G011) resumes the one-player play when the inter-store battle play is won. When the training mode is selected in the one-player play, the control unit maintains the team composition and resumes the remaining play for the specified time.

In S609, the control unit of the game machine 610 (G011) determines whether or not the one-player play is completed. When the one-player play ends, the specified time in the training mode has elapsed, the specified stage is cleared in the CPU battle, the defeat in the CPU battle, and the like.
When the control unit of the game machine 610 (G011) determines that the one-player play has ended (S609: YES), it proceeds to S611 to end the process, and on the other hand, when it determines that the process has not ended. (S609: NO), proceed to S610.

In S610, the control unit of the game machine 610 (G011) determines whether or not the change in the team configuration has been accepted. The change of the team composition is to change the team composition selected in S602. Ichiro (P011) can change the team composition if the one-player play is not completed (S609: NO). Therefore, Ichiro (P011) can change the enemy character in the training mode. Changes in the team composition can be accepted, for example, by operating the start button.

When the control unit of the game machine 610 (G011) determines that the change in the team configuration has been accepted (S610: YES), the process from S602 is repeated, while when it is determined that the change has not been accepted (S610: YES). NO), the process from S605 is repeated.
When the team composition is changed by the repeated processing from S602, the control unit of the game machine 610 (G011) transmits the information of the changed team composition to the central server 650 (S604).
The control unit of the central server 650 can update the information of the standby team configuration storage unit 668 in response to this, and perform matching processing based on the changed team configuration.

As described above, the game system of the present embodiment can continue to play against an enemy character who is fighting in one-player play. As a result, the player can confirm, for example, the practice effect of the one-player play in the battle play. Further, in the one-player training mode, the player can change the selected character within the specified time, and can also change the enemy character accordingly. Further, when a store-to-store battle is established during play in the one-player training mode, the player can play a store-to-store battle without charge in addition to the training mode.

Although the embodiments of the present invention have been described above, the present invention is not limited to the above-described embodiments, and various modifications and changes can be made as described below, for example. It is within the technical scope of the present invention. Moreover, the effects described in the embodiments are merely a list of the most suitable effects arising from the present invention, and the effects according to the present invention are not limited to those described in the embodiments. It should be noted that the above-described embodiment and the later-described modified form can be used in combination as appropriate, but detailed description thereof will be omitted.

(Transformed form)
(1) In the embodiment, the inter-store communication (inter-game communication) during the inter-store battle play is shown as an example of P2P, but the present invention is not limited to this. This inter-store communication may be, for example, communication via a central server.

(2) In the embodiment, the communication state shows an example relating to the frame delay state, but the communication state is not limited to this. The communication state may be related to communication quality including lack of information, noise, etc. during information communication, for example.

(3) In the embodiment, the communication state history storage unit is provided in the central server, but the present invention is not limited to this. The communication state history storage unit may be provided in each game machine. In this case, each game machine may display the communication status at the time of matching between stores based on the communication status history storage unit.

(4) In the embodiment, when the in-store or inter-store battle play is started, an example is shown in which the player can select whether or not to accept the opponent, but the present invention is not limited to this.
For example, if only one in-store matching is established, and if this is established, the in-store battle play may be started regardless of the player's intention. Similarly, if only one match between stores is established and this is established, the match play between stores may be started regardless of the player's intention.

(5) In the embodiment, when the matching between stores is established, the connection destination information of the other game machine is transmitted to one game machine, but the present invention is not limited to this. As long as both game machines can communicate between stores according to the matching determined by the central server, the processing until both game machines start communication is not limited. For example, the central server may transmit mutual communication destination information to both game machines according to the establishment of matching, and based on this, both game machines may start communication with each other.

(6) In the embodiment, an example in which processing related to the communication state is performed with respect to inter-store communication is shown, but the present invention is not limited to this. Regarding in-store communication, processing related to the communication status may be performed. In this case, the store server may perform processing related to communication between game machines in the same store in the same manner as the central server.

1 ... Game system 2 ... Communication network 5 ... Store system 6 ... Connection device 7 ... Store server 8 ... In-store communication network 10,210,410,610 ... Game machine 14 ... Display unit 16 ... Power switch 20,60 ... Storage unit 21 ... Game program 21a ... Command table 21b ... Command correction table 22, 62 ... Matching program 26, 66 ... Communication status evaluation table 30, 70 ... Control unit 31 ... Play control unit 32, 72 ... Matching control unit 50, 350, 650 … Central server 73… Point management department A to E… Store

Claims (4)

A server with a control unit and
It has a control unit, and is equipped with a plurality of game machines including a first game machine and a second game machine.
A game system that starts a battle play between game machines in response to matching the first game machine and the second game machine.
This game is
The character operated by the player and the enemy character play against each other.
The control unit of the server
When one-player play is in progress on the first game machine, and the enemy character of the one-player play of the first game machine and the character selected by the player of the second game machine in one-player play are the same. , Matching the first game machine and the second game machine,
A game system featuring. In the game system according to claim 1,
This game is
In each game machine, form a team with multiple characters,
The control unit of the server
When one-player play is in progress on the first game machine and an enemy character competing on the first game machine is included in the team of the second game machine, the first game machine and the second game machine are included. Matching game consoles,
A game system featuring. In the game system according to claim 1 or 2.
This game is
The character operated by the player and the enemy character correspond to each other.
The control unit of each game machine
In one-player play, performing a battle between a character selected by the player and an enemy character corresponding to the character selected by the player,
A game system featuring. In the game system according to claim 3,
The control unit of each game machine
In one-player play, changing the enemy character according to the change operation,
A game system featuring.

Images