JP2019005504A - Game machine and game system - Google Patents

Abstract

To provide a game machine and a game system capable of matching game machines having a satisfactory communication state.SOLUTION: A control part 30 of a game machine 10 displays a communication state indication for indicating a communication state of communication among game machines on a display part 14 according to matching with the game machine 10 in another store by a central server 50, and starts playing a match game according to reception of matching confirmation operation by both of the game machine 10 and the game machine 10 in another store.SELECTED DRAWING: Figure 16

Description

  The present invention relates to a game machine and a game system.

Conventionally, there has been a game system that plays by matching game machines in different stores (for example, Patent Document 1).
However, the conventional game system may not be able to match between game machines having a good communication state.

JP 2006-212288 A

  The subject of this invention is providing the game machine and game system which can match between game machines with a favorable communication state.

  The present invention solves the problems by the following means. In addition, in order to make an understanding easy, although the code | symbol corresponding to embodiment of this invention is attached | subjected and demonstrated, it is not limited to this. In addition, the configuration described with reference numerals may be improved as appropriate, or at least a part thereof may be replaced with another configuration.

-1st invention is a game machine (10,210,410,610) arrange | positioned in a store, Comprising: With another store game machine which is another game machine of another store, a server (50,350, 650) can be communicated between the game machines, and includes a control unit (30). The control unit matches the game machine and the other in response to being matched with the other store game machine by the server. A communication state display process for displaying a communication state display indicating a communication state of inter-game machine communication between store game machines is performed on the display unit (14), and after the communication state display process, the game machine and the other store The game machine is characterized in that a match game is started in response to accepting a matching confirmation operation in both game machines.
The second invention is the game machine of the first invention, wherein a plurality of game machines (10, 210, 410, 610) are arranged in the store, and the control unit is the other game machine in the store. (10 (G014)) and the said communication state display between the said other store game machines are displayed on a display part (14), It is a game machine characterized by the above-mentioned.
The third invention is the game machine of the first or second invention, wherein at least one game machine (10, 210, 410, 610) in the store and the other store game machine (10, 210, 410, 610), a communication state history storage unit that stores a history of communication states between the game machine and the other store game machine as the communication state display of the game machine and the other store game machine based on the communication state history storage unit The game machine is characterized by displaying a communication status display between another game machine (10 (G014)) in the store and the other shop game machine.
The fourth invention is the game machine according to any one of the first to third inventions, wherein the control unit (30, 32) is configured to execute the first game (T1) and the second game (T2) while the game is in progress. ) Is requested to the server, the communication state display between the first game and the other store game machine matched by the server, and the other of the second game matched by the server It is a game machine characterized by displaying the said communication status display between store game machines on a display part (14).
-A fifth aspect of the present invention is the game machine according to any one of the first to fourth aspects, wherein the control unit (30, 32) is powered on by the game machine (10, 210, 410, 610). In response to this, the game machine is characterized in that information on a communication state between the game machine and the plurality of other store game machines is acquired by sequentially communicating with the plurality of other store game machines.
The sixth invention is the game machine of any one of the first to fifth inventions, wherein the control unit (30, 32) is set to a later time from the current play state according to the communication state between game machines. A game machine characterized by executing a prior input process for receiving an operation corresponding to a corresponding play state.
The seventh invention is the game machine of any one of the first to sixth inventions, wherein the control unit (30, 32) is operated during a play stop period due to a communication delay according to a communication state between game machines. It is a game machine characterized by executing a stop period input process for accepting.
The eighth invention is the game machine (10, 210, 410, 610) of any one of the first to seventh inventions, and another store game machine (10, 210, 410, 610) and a server (50, 350, 650) having a control unit for matching the game machine and the other store game machine.
The ninth invention is the game system of the eighth invention, wherein the server (50, 350, 650) is in a communication state between another game machine (10 (G014)) in the store and the other store game machine. Communication state history storage unit (64a) for storing the history of the game machine, the control unit (30, 32) of the game machine as the communication state display of the game machine and the other store game machine, the server of the server A game system characterized by displaying a communication status display between another game machine in a store and the other store game machine based on a communication status history storage unit.
The tenth invention is the game system of the eighth or ninth invention, wherein the server (50, 350, 650) is between the game machine (10, 210, 410, 610) and the other store game machine. A communication state history storage unit (64a) for storing the communication state history of the game state, and when the battle state is possible by referring to the communication state history of the communication state history storage unit, the game machine and the other store game machine The control unit (30, 32) of the game machine starts communication with the other store game machine in response to the match between the game machine and the other store game, and the communication It is a game system characterized by displaying the communication state acquired by the started communication as a state display.
The eleventh invention is the game system according to any of the eighth to tenth inventions, wherein the control unit (30, 32) of the game machine (10, 210, 410, 610) is a power source of the game machine. In response to the turn-on, the communication state history between the game machine and the plurality of other store game machines is acquired by sequentially communicating with the other store game machines, and the server (50, 350, 650), the control unit (70, 72) stores a communication state history acquired by the game machine in the communication state history storage unit (64a).

According to the present invention, the following effects can be obtained.
The first and eighth inventions display the communication state of the communication between game machines and start playing the battle game in response to accepting the matching confirmation operation on both game machines. After confirmation, play can be started.
-Since 2nd, 9th invention displays the communication state display between the other game machines in a store, and another store game machine, it can manage the communication state between game machines as a communication state between stores. it can.
-Since 3rd invention is equipped with the communication status log | history memory | storage part which memorize | stores the log | history of the communication status between the at least 1 game machine in a store, and another store game machine, in the communication status log | history memory | storage part of a game machine Based on this, the communication status display can be displayed.
-Since the 4th invention displays the communication state display between the other store game machines of the 1st game, and the communication state display between the other store game machines of the 2nd game, the matching process of multiple titles Can be performed at the same time.
The fifth and eleventh inventions acquire information on the communication state between the game machine and a plurality of other store game machines when the game machine is turned on. The communication status information can be acquired.
-Since 6th invention performs a prior | preceding input according to the communication state between game machines, the influence of the delay of communication can be reduced.
-Since the 7th invention performs the stop period input process which receives operation in the play stop period accompanying a communication delay, it can reduce the influence of a communication delay.
-The tenth invention refers to the communication state history in the communication state history storage unit, and when the match play is possible, the game machine and the other store game machines are matched, so game machines with good communication state Can be matched.

It is a figure explaining the whole structure of the game system 1 of 1st Embodiment. It is a block diagram of game machine 10, billing card 41, ID card 42, and central server 50 of a 1st embodiment. It is a perspective view of game machine 10 of a 1st embodiment. It is a figure explaining the command table 21a (T1) and command correction table 21b (T1) of the title T1 of 1st Embodiment. It is a figure explaining store information storage part 63, operation information storage part 64, and communication state evaluation tables 26 and 66 of a 1st embodiment. It is a figure explaining the communication status log | history memory | storage part 65 of 1st Embodiment, and the communication status log | history memory | storage part 65a. 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 battle | competition play between stores of 1st Embodiment. It is a figure explaining the frame exchange process (large delay) in the battle | competition battle play of 1st Embodiment. It is a figure explaining the frame exchange process (stop period input process) in the battle | competition 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 status acquisition process of 1st Embodiment. It is a figure explaining the communication status acquisition process between the store A of 1st Embodiment, and stores BD communication. It is a flowchart from the play reception of 1st Embodiment to a matching selection process. It is a flowchart of the in-store matching process of 1st Embodiment. It is a flowchart of the matching process between stores of 1st Embodiment. It is a flowchart of the matching process between stores of 1st Embodiment. It is a figure which shows the title selection screen 80 and matching type selection screen 81 of 1st Embodiment. It is a figure which shows the display screen at the time of in-store matching 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 battle | competition battle play screen 86 of 1st Embodiment. It is a flowchart of the cancellation process of the battle | competition battle play of 1st Embodiment. It is a flowchart of the delay influence analysis process of 1st Embodiment. It is a figure which shows the battle | competition battle play screen 87 of 1st Embodiment. It is a flowchart of the point provision process of 1st Embodiment. It is a flowchart of the store introduction process of 1st Embodiment. It is a figure explaining the battle play end screen 88 between stores of a 1st embodiment. It is a figure explaining the positional relationship between the stores of 1st Embodiment, and the state of communication between stores. It is a figure explaining the search result display screens 91-93 of 1st Embodiment. It is a flowchart of the play restart process of 1st Embodiment. It is a flowchart of the play restart process of 1st Embodiment. It is a figure which shows the restart title selection screen 95 of 1st Embodiment. It is a matching selection process of 2nd Embodiment. It is a figure which shows the matching classification selection screen 281 and title selection screen 280 of 2nd Embodiment. It is a flowchart of the temporary point process of 3rd Embodiment. It is a figure explaining the flow of the temporary point process of 3rd Embodiment. It is a figure explaining the prior input process of 4th Embodiment. It is a figure explaining the search time tables 527a and 527b in a store of 5th Embodiment. It is a figure explaining the character combination table 621c, team composition storage part 621d, and standby team composition storage part 668 of 6th Embodiment. It is a flowchart of the matching process between stores of 6th Embodiment. It is a figure which shows the display screen at the time of the matching process between stores of 6th Embodiment.

(Embodiment)
Embodiments of the present invention will be described below with reference to the drawings.
(First embodiment)
Hereinafter, a first embodiment of the present invention will be described with reference to the drawings and the like.
FIG. 1 is a diagram illustrating the overall configuration of the game system 1 according to 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 according to the first embodiment.
FIG. 3 is a perspective view of the game machine 10 according to the first embodiment.
FIG. 4 is a diagram illustrating the command table 21a (T1) and the command correction table 21b (T1) of the title T1 according to 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 according to the first embodiment.
FIG. 6 is a diagram illustrating the communication state history storage unit 65 and the communication state history storage unit 65a according to 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 appropriately used, and a player ID as player identification information is given 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 attached in parentheses and is represented as a game machine 10 (G011) or the like.
In the embodiment, the term “matching” is mainly used to mean “combine” and “combination”. Furthermore, in the embodiment, as appropriate, the display on the display unit 14 that can be selected with the pointer 14a is also referred to as “button” or the like, and the operation for selecting this is also referred to as “button operation” or “selection operation”.

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

The store system 5 and the central server 50 are connected by a communication network 2 such as the Internet via the connection device 6 and can communicate.
Thereby, information can be communicated between the store server 7 and the central server 50 and between each game machine 10 and the central server 50.
The connection device 6 has functions such as a store server 7, a modem that connects the game machine 10 to the communication network 2, and an ONU (line terminating device), and the store server 7 in the same store (hereinafter also simply referred to as “in-store”). And a router function for communicating between the game machines 10.

The store server 7 in the store and the game machine 10 are connected by an in-store communication network 8 such as a LAN, and can communicate. In addition, in-store communication between devices 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. Thereby, each game machine 10 in the store and other game machines 10 can play a battle.
Each store system 5 and other store systems 5 are connected by the communication network 2. Thereby, the game machine 10 of each store system 5 and the game machine 10 of the other store system 5 communicate with each other between the game machines (hereinafter referred to as “inter-store communication”) without going through the central server 50 in battle play or the like. Say). In the store-to-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 refers to an information processing apparatus including a storage device, a control device, and the like. The game machine 10, the store server 7, and the central server 50 include a storage unit and a control unit, respectively. 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 overall control of each device. A control part is comprised from CPU (central processing unit) etc., for example. The control unit implements 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 arranged in the store.

(Game machine 10)
As shown in FIGS. 1 to 3, the game machine 10 is a device in which each player P actually plays. For example, the game machine 10 is played while the player P sits on a chair.
In the embodiment, the store system 5 includes, for example, four game machines 10 and four players P can play simultaneously. Hereinafter, although the structure of the game machine 10 (G011) of the shop A is mainly demonstrated, the other game machines 10 are also the same structure. 2 and 3 illustrate the configuration of the game machine 10 (G011), the 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, A control unit 30 is provided.
The coin insertion slot 11a and the billing card RW11b are billing units that charge a play fee from the player P. The player P can pay a play fee by either inserting coins or making a payment by 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, it outputs a coin detection signal to the control unit 30.

The billing card RW11b is a device that communicates with the billing card 41 possessed by the player P and charges a play fee.
The billing card 41 has a built-in RFID tag 41a that stores the remaining charge 41b. The billing card RW11b and the billing card 41 can communicate in a non-contact manner by an electromagnetic induction method or the like. The billing card RW11b communicates with the billing card 41 to subtract the play fee from the charge remaining amount 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 out and obtain a player ID 42b (player identification information) that can identify the player P.
The ID card 42 incorporates an RFID tag 42a that stores a player ID 42b. The ID card reader 12 and the ID card 42 can communicate 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 a single card. In this case, the identification information of the billing card 41 may be used as player identification information, and the billing card RW11b and the ID card reader 12 may be used as one device.

The operation unit 13 is operated by the player P before the start of play, at the time of play progress, after the start of play, or the like. The operation unit 13 is provided on the operation panel 10a on the near 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 operated so as to be tilted in the left-right direction X, the depth direction Y, and a direction in which these are combined.

The a button to the f button and the start button 13b are push buttons.
The a button to 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. The display unit 14 displays various screens before the start of play, a play screen during play, various screens after play, and the like.
The power switch 16 is a switch operated by a store clerk (operator) or the like to turn on the game machine 10 (G011). The power switch 16 is arranged in a maintenance switch box. 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.
The 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, two game programs 21 (T1) and 21 (T2) relate to fighting games with titles T1 and T2, respectively. Titles T1 and T2 are different types of games, and are different types of games. The game programs 21 (T3) and 21 (T4) relate to the racing game with the title T3 and the shogi game with the title T4, respectively.
In the embodiment, the game itself is also simply referred to as a title.
The titles T <b> 1 to T <b> 4 can be played by a single player and played against a match by the player P.
The one-player play is a form in which the player (P011) of the game machine 10 (G011) battles alone. The one-player play is also called a CPU battle, and in the case of a fighting game, a character C operated by the player P and an enemy character controlled by the control unit 30 face each other. The battle play is a mode in which a plurality of players (two in the embodiment) battle each other, that is, the battle play is a battle between the player (P011) of the game machine 10 (G011) and the player P of another game machine 10. To 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).
4A and 4B show a command table 21a (T1) and a command correction table 21b (T1) for the title T1 as an example.
The command table 21a (T1) stores the operation of the operation unit 13 and the command (command) 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 relating to the technique of the character operated by the player P. The command table 21a (T1) stores an attack value (damage to the enemy character) in association with the operation and command of the operation unit 13 in association with each other.

The command type includes a command corresponding to a single operation of the operation unit 13 and a command corresponding to a composite operation of the operation unit 13.
A single operation is a single operation of the operation unit 13. For example, a single operation of the a button is associated with a weak punch and an attack value of 5.
The composite operation is an operation having at least one of a simultaneous operation and a continuous operation of the operation unit 13. The arrow in the command table 21a (T1) indicates continuous operation. For example, after the lower operation of the lever 13a, the simultaneous pressing of the b button and the e button is stepped on and corresponds to the attack value 100.
As described above, in the fighting game, the more complicated the operation of the operation unit 13 is, the greater the skill and the greater the damage to the enemy.

In addition, although illustration is abbreviate | omitted, the command table 21a (T1) memorize | stores the defense value which defends the attack from an enemy. The command table 21a (T1) stores an operation for defense (for example, lever operation) and a defense value in association with each other.
Such a setting is not limited to a fighting game. For example, in the case of a drive game, when a plurality of operation intervals are short, a command that requires an advanced technique such as a spin turn is set. May be.

The command correction table 21b (T1) stores correction values (parameter values corresponding to the communication state) for correcting the attack value and defense value (ability value) of the command table 21a (T1) for each of the characters C1 to C6.
The command correction table 21b (T1) stores the communication state (inter-game machine communication state), the attack value and the defense value correction value in association with each other. The communication state is a communication state of communication between stores. Details of the communication state will be described later.
The attack value and the defense value correction value are values 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 the other game machines 10 (G012 to G014) in the store A, and the game machine 10 (G011) and the game machines 10 of other stores match. Therefore, a program for 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 a game machine ID for identifying 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 a frame delay occurrence rate, a communication state evaluation, and an antenna image in association with each other.
That is, the communication state evaluation table 26 stores the communication state evaluation corresponding to the frame delay occurrence rate.
The frame delay occurrence rate indicates the degree of communication delay in inter-store communication. Details of the frame delay occurrence rate will be described later.
The evaluation of the communication state indicates an 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 but less than 10%: Good 10% or more but less than 15%: Yes 15% or more but less than 20%: Bad 20% or more: No

The antenna image indicates the frame delay occurrence rate on the display unit 14 as an image.
The antenna image corresponds to each range of the frame delay occurrence rate. The antenna image represents each range of the frame delay occurrence rate 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 “above”, the number of antennas is “4”, “3”, “2”, “1”, “0 (no)”.

The control unit 30 includes a play control unit 31 and a matching control unit 32.
The play control unit 31 performs control and processing related to play progress by operating according to the game program 21 (T1 to T4).
The matching control unit 32 operates by the matching program 22 to perform control and processing related to matching with other game machines 10.
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, etc. the operating status, billing status, etc. of the game machine 10 in the store.
Detailed description of the store server 7 is 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.
For example, the central server 50 performs management of player information, management of sales at each store, matching processing between game machines 10 at 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 program 21 (T1 to T4) of each game machine 10 is downloaded from the central server 50 or updated.

  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 store-to-store battle play.

As shown in FIG. 5A, the store information storage unit 63 stores a store name (store identification information), store position information, and a game machine ID in association with each other.
The store name is information used as store identification information. This identification information may be a sequence of alphanumeric characters (SHOP-ID001) or the like.
The store location information is information that specifies the location of the store. In the embodiment, the store position information is address information, but is not limited thereto, and may be latitude and 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 information of each game machine 10 at the current time.
The operation information storage unit 64 requests the game machine ID of each store, the player ID of the player P who is playing, the title of one player who is playing, the battle title in the store or between stores, and the player P requests matching between stores. Are associated with each other and stored.
The control unit 70 of the central server 50 acquires these information by communicating with each game machine 10 and stores it in the operation information storage unit 64.
In the example of FIG. 5 (B), the operation information storage unit 64, for example, in the game machine 10 (G011) of “Game ID = G011” in the store A, the player (P011) is playing the game with the title T1. Yes, information that requests matching of titles T1 and T2 is stored.
The timing with which the central server 50 and each game machine 10 communicate is not limited, and may be, for example, sequentially or every specified time. Further, for example, each game machine 10 may transmit information regarding the change to the central server 50 when the state of each game machine 10 has changed (for example, when a game is received from the player P). Good.

As shown in FIG. 6A, the communication state history storage unit 65 stores a communication state 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 another store, the communication state 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 stores may be stored. That's fine. 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 store-to-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, a transmission (so-called uplink) communication state from the game machine 10 of each store and a reception (so-called downlink) communication state from the game machine 10 of another store are 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 downstream communication state may be stored in the lower left shaded column.
Note that the communication state history storage unit 65a in FIG. 6 (B) omits the correspondence between the game machines 10 from the communication state history storage unit 65 in FIG. 6 (A) and organizes only the correspondence between stores. .

As shown in FIG. 5C, the communication state evaluation table 66 is the same as 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 and various information in association with each other.
Various information includes a player name, a title, a rank, and points (stage points).
The player name is a nickname or the like used when the player P plays, and need not be a real name. The player name can be registered from a registration device (for example, a vending machine of the ID card 42, the game machine 10, an information terminal (such as a mobile phone) possessed by the player P).

The game title is a title name of a game played by the player P 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 title T1 and T2 games in the past.

The player information storage unit 67 stores a player P and a combination of a game title, a rank, and points in association with each other. That is, the player information storage unit 67 stores the player P and the level and point 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 the titles T1 and T2. For this reason, the player information storage unit 67 stores “player ID = P011”, the combination of the level and point of the title T1, and the combination of the level and point of the title T2.

The rank indicates the grade of the skill of the game of the player P. As for the rank, a calculation method or the like is set according to the specifications of each game. The stage can be determined by the following method, for example.
That is, the stage is set from the first stage to ten stages.
Each player P is awarded a point “3” when he / she plays a player P at the same level as himself / herself, and is given a point “2” when he / she plays a player P at a stage different from his / her own by one player. A point “1” is awarded when the player P is played against a player P that is two steps different from the player, and no points are awarded when the player P is played with a player P that is three or more steps different from the player P. Granting is a concept that includes addition and subtraction. When winning, points are added and points are subtracted. When the total points are 10 or more, the rank is promoted (that is, one step is increased), while when the points are −10 or more, the rank is demoted (that is, one step is decreased).

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

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 performs control and processing related to matching between stores of the game machine 10 by operating according to the matching program 62.
The point management unit 73 performs point management for the player P and the like.
Details of the processing of the control unit 70 will be described later.

A frame exchange process, which is a basic process of the battle play, will be described.
8 to 10 are diagrams for explaining frame exchange processing in the inter-store 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) at the store A and the game machine 10 (G022) at the store B will be described.
Further, the following example describes an example in which one operation of the operation unit 13 fits in one frame and a character is operated for each frame for convenience. There are cases in which a frame that fits is straddled, a case where a continuous operation extends over several frames (for example, when the lever is tilted for a long time).

(With low frame delay)
FIG. 8A is a diagram for explaining frame exchange processing in a state where the frame delay is small.
The state where the frame delay is small is a state where no large delay occurs in frame exchange.
In the play progress of the battle game, the elapsed time is divided into unit times, and game information is managed per unit time. A frame is a concept indicating a play state (play screen image, operation information, etc.) per unit time. In the actual form, one second is divided into 60 frames to manage the progress of play. Therefore, one frame includes a 1/60 second play state.

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, it takes time until one side receives the frame information and the other side receives it even if the frame delay is small.
FIG. 8A shows an example in which the communication time for inter-store communication is 2 frames (2/60 seconds) as an example.
As indicated by arrows a0 and b0, in the scene where the frame F001 is being played, the a button is operated on the game machine 10 (G011), and the b button is operated on the game machine 10 (G022). As will be described later, these pieces of operation information are used for the frame F004.

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

As indicated by arrows a3 and b3, each game machine 10 receives the operation information transmitted by the other game machines 10. It takes time for two frames before the game machine 10 receives each frame information. For example, it takes time for two frames until the game machine 10 (G011) receives the frame information including the operation information of the b button.
As indicated by arrows a4 and b4, the control unit 30 of each game machine 10 advances the play of the frame F004 by reflecting the operation information of the own machine and the operation information received from the other game machines 10.

As described above, the control unit 30 of the game machine 10 receives the operation information of the frame F004 of its own machine, waits until receiving the frame information of the frame F004 of another game machine 10, and then performs the process of the frame F004. .
As shown in FIG. 8 (B), the control unit 30 of the game machine 10 performs such processing for each frame, so that both game machines 10 can simultaneously play using the same operation information. Can do.
As described above, in the battle play using the inter-store communication, even when the frame delay is small, a delay of 2 frames occurs after the operation unit 13 is operated until it is reflected in the play. In the embodiment, it is assumed that a delay of two frames is sufficiently acceptable.

(With large frame delay)
FIG. 9A is a diagram for explaining frame exchange processing in a state where the frame delay is large.
In FIG. 9A, the communication time in the inter-store communication is 3 frames (3/60 seconds).
Therefore, when the a and b buttons are operated on each game machine 10 as indicated by arrows a10 and b10, each game machine 10 is displayed at frame F004 as indicated by arrows a11 and b11 and arrows a13 and b13. It takes three frames (3/60 seconds) to receive the reflected operation information from another game machine 10.
For this reason, as shown by the delay time L, it takes time for one frame to receive these pieces of operation information after the two frames F002 and F003 are played.
Therefore, in the case of FIG. 9A, as indicated by arrows a <b> 11 and b <b> 11, each game machine 10 has received more operation information from the other game machines 10 than in the case of FIG. 8A. It is necessary to wait for an extra frame.

As indicated by arrows a14 and b14, therefore, a delay time L of one frame occurs after the play processing for the frame F003 until the play processing for the frame F004 is started.
In the delay time L, the control unit 30 of each game machine 10 cannot process the play progress because the operation information cannot be acquired. Therefore, the control unit 30 of each game machine 10 is in a state in which the play screen is stopped or the operation information from the operation unit 13 is not accepted during the delay time L.

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

In the embodiment, the communication state is evaluated according to the communication state evaluation tables 26 and 66 of FIG. The frame delay occurrence rate is the ratio of the number of occurrences of delay 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 stops the battle play when it is “bad” or “impossible”. Process. Further, the control unit 70 of the central server 50 does not perform matching when “impossible”.

(Stop period input process)
FIG. 10 is a diagram illustrating a stop period input process in the inter-store battle play according to the embodiment.
The stop period input process is a process applied when the frame delay is large.
The frame delay state in FIG. 10 is the same as the frame delay state in FIG. 9B.
As indicated 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 indicated by the arrow c20, the operation of the c button is accepted during the subsequent play of the frame F004. Then, as indicated by an arrow c21, at the end of the processing of the frame F004, frame information including operation information on the a button and the c button is transmitted to the other game machine 10 (G022).
Then, as indicated by an arrow c23, the control unit 30 of the game machine 10 (G011) waits until receiving frame information from the game machine 10 (G022).

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

In this case, the control unit 30 of each game machine 10 receives the operation information with a delay of 3 frames.
Then, as indicated by arrows c24 and d24, the control unit 30 of each game machine 10 has, as the operation information of the game machine 10 (G011), operation information on the a button during the delay time L 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 similarly operates the operation information of the b button during the delay time L and the d button in the frame F004 as operation information of the game machine 10 (G022) for the frame F007. Reflect the operation information.

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 play, the delay time L is a stop time during which play does not progress. Therefore, as shown in FIG. 10, in the game machine 10 (G011), when the a button and the b button are operated, both operation information is operated during F004 as indicated by arrows c24 and d24. It will be treated as a thing.
For this reason, the control unit 30 processes both pieces of operation information on the assumption that the operation interval between the a button and the b button is a time interval (for example, 1/60 second for one frame) corresponding to the actual elapsed time. As a result, even when a frame delay occurs, if the player continuously operates the button at a normal timing, the control unit 30 can read a command corresponding to this from the command table 21a.

  Thus, 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 together in the play. The sense of delay in play due to communication delay can be reduced.

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

[Outline of transition of operation state of game system 1]
An outline of a transition of a series of operation states of the game system 1 will be described.
FIG. 11 is a diagram for explaining a series of operation state transitions of the game system 1 of the first embodiment.
In addition, the following description is a main thing among operation | movement and transition of the game system 1, and has a case where another operation | movement and transition are performed according to a condition.

# 1: In the power-on state, the matching control unit 32 of the game machine 10 (G011) indicates that the game machine 10 (G011) is powered on 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 process 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 process. 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 process state, the game machine 10 of the store A acquires the communication state of the inter-store communication with the game machines 10 of stores other than the store A. The central server 50 receives and acquires the communication state information from the game machine 10 of the store A.

  # 3: In the play acceptance process state, the matching control unit 32 of the game machine 10 (G011) performs a charging process, a process of accepting a play from the player P, and the like. In addition, the matching control unit 32 of the game machine 10 (G011) accepts selection of a single-player title that the player P plays alone on his / her own machine, selection of a battle title for battle play, and the like.

# 4: In the matching process state, the matching control unit 32 of the game machine 10 (G011) performs a matching process with another game machine 10 in the same store (hereinafter also simply referred to as “in the 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 an inter-store matching process with the game machine 10 of another store.
The matching control unit 72 of the central server 50 performs a matching process between the game machine 10 (G011) and the game machine 10 of another store based on a request from the game machine 10 (G011). The matching control unit 72 of the central server 50 refers to the communication state 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).

  # 5: In the one-player play execution state, the play control unit 31 of the game machine 10 (G011) performs the single-player that the player P plays alone, for example, when matching is not established in the matching processing state of # 4. Perform a 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) establishes a match with the game machine 10 of another store in response to the establishment of the inter-store matching in # 4 or # 5. Between them, the battle play starts.
# 6a: In the battle play end state, the play control unit 31 of the game machine 10 (G011) performs processing in accordance with the end of the store-to-store battle play. As will be described later, the end-to-store match play has a form of end with play stop and a form with normal end. The former stop of play is caused by inter-store communication.
# 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 play.

# 6c: In the store introduction process 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 process.
The store introduction process is a process of transmitting information about the store nearby the store A to the player P. The player P can move to another store with reference to this information and perform a rematch.

# 7: In the in-store battle play processing state, the control unit 30 of the game machine 10 (G011) responds to the establishment of in-store matching in # 4 or # 5, and the other game machine 10 (G011) in the store. ) And play play begins.
# 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 in-store battle play. Since in-store competitive play does not perform inter-store communication, processing associated with stop of play does not normally 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, similarly to # 6b.

  # 8: In the game resumption 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 a one-player resumption process as the battle play ends.

[Details of operation of game system 1]
Hereinafter, details of the operation of the game system 1 will be described.
[Communication status acquisition processing after power on]
This processing corresponds to # 1 and # 2 in FIG.
FIG. 12 is a flowchart of communication state acquisition processing according to the first embodiment.
FIG. 13 is a diagram illustrating a communication state acquisition process between the store A and the stores BD of the first embodiment.
Hereinafter, an example of acquiring the communication state between the store A and the stores BD communication when 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 power-on information via the communication network 2, and the matching control unit 72 of the central server 50 transmits this information. Receive.
In S <b> 2, 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 stores the game machine 10 (G011) in the store A and the game machines 10 in other stores. It instructs the start of inter-store communication. In this case, the matching control unit 72 of the central server 50 extracts one store having no communication state history with the store A among other stores.
Here, the matching control part 72 of the central server 50 demonstrates the example which extracted the shop B. FIG.

In S <b> 3, the matching control unit 72 of the central server 50 refers to the operation information storage unit 64 (see FIG. 5B) and is not played by the empty game machines 10 (that is, the player P in the stores A and B). First, the game machines 10) that are not in operation are preferentially extracted one by one. Here, the example which extracted the game machine 10 (G014) and the game machine 10 (G021) of the shop A is demonstrated.
As a result, the game system 1 does not cause the game machine 10 in operation to exchange frames for the communication state acquisition (S5), so that no load is applied to the game machine 10 in operation.
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, or in the store A The game machine 10 (G011) that transmitted the power-on information may be selected.

  In S4, the matching control unit 72 of the central server 50 instructs the game machine 10 (G014) of the store A to execute inter-store communication with the game machine 10 (G021). In this case, the matching control unit 72 of the central server 50 transmits connection destination information (such as the global IP address of the game machine 10 (G021)) necessary for the 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 part 32 of game machine 10 (G014) and game machine 10 (G021) acquires the communication state between game machine 10 (G014) and game machine 10 (G021) by performing frame exchange. In this case, each matching control unit 32 does not need to actually execute a battle game program, and may communicate frame information including some operation information.
In S <b> 6, the matching control unit 32 of the game machine 10 (G014) measures the delay occurrence rate in frame exchange, and then transmits the measurement result to the central server 50.

In S <b> 7, 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.
Thereby, in the relationship between the store A and the store B, the matching control unit 72 of the central server 50 has one of the game machines 10 of the store A and one of the game machines 10 of the other stores. The communication status information can be stored.
For example, the communication state history storage unit 65 in FIG. 6A stores the communication state “good” as the game machine 10 (G014) in the store A and the game machine 10 (G021) in the store B.

  Thereafter, the matching control unit 72 of the central server 50 repeats the processing from S2. As a result, the matching control unit 72 sequentially communicates 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), the store A. 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 is acquired (see S5d in FIG. 13) and stored in the communication state history storage unit 65. To do.

In addition, although the example which acquires the communication state between store A and stores BD was demonstrated here, in fact, communication between store A and all the stores is performed by performing the same process. Get state.
In addition, after acquiring the communication state between all the stores, the matching control unit 72 of the central server 50 performs the same process again to change the communication state history storage unit 65 to information on a newer communication state. It may be updated.
Further, in S4, the mutual IP addresses of both game machines 10 may be used, and in S5, the inter-store communication may be started from both game machines 10 to the mutual game machines 10.

[From play acceptance to matching]
This process corresponds to # 3 and # 4 in FIG.
FIG. 14 is a flowchart from play acceptance to matching selection processing according to the first embodiment.
FIG. 15 is a flowchart of the in-store matching process according to the first embodiment.
16 and 17 are flowcharts of the inter-store matching process according to the first embodiment.
FIG. 18 is a diagram illustrating a title selection screen 80 and a matching type selection screen 81 according to the first embodiment.
FIG. 19 is a diagram illustrating a display screen at the time of in-store matching according to the first embodiment.
FIG. 20 is a diagram illustrating 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 in the game machine 10 (G011) of the store A will be described.
In S11, the matching control unit 32 of the game machine 10 (G011) performs a charging process.
In this process, when the player (P011) inserts a coin 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, when the player (P011) holds the charging card 41 over the charging card RW11b, the charging card RW11b transmits the charging information to the control unit 30. The control unit 30 receives this billing information.

In S12, a 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 a detailed description is omitted, the matching control unit 32 of the game machine 10 (G011) transmits the player ID to the central server 50, whereby 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 section 80a and a battle title selection display section 80b.
The one-person title selection display unit 80a and the battle title selection display unit 80b display four titles T1 to T4 and these selection buttons, respectively.
The player (P011) can select a single player title and a battle title according to these displays.
When the player (P011) selects a button included in these displays, the pointer 14a displayed on the title selection screen 80 is moved onto the selection button by operating the lever, and then the start button 13b is operated. . In the drawing, the frame of the selected selection button is indicated by a bold line.

In S14, the matching control unit 32 of the game machine 10 (G011) performs a one-person title selection process.
The single player title selection process is a process of accepting selection of a single 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 shows 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 a battle title selection process.
The battle title selection process is a process of accepting a battle title selection from the player (P011) of the game machine 10 (G011).
The player (P011) selects one or more titles from the titles T1 to T4 in the battle title selection display unit 80b. FIG. 18A shows an example in which title T1 (fighting game) and title T2 (fighting game) are selected.
Here, by selecting more battle titles, the number of target players P (players P for which matching is determined) is increased. The player (P011) is more likely to be matched if more battle titles are selected. Therefore, the player (P011) may select a plurality of battle titles when he / she strongly desires a battle play.

Note that the game system 1 may determine the one-person title selected in S14 as one of the battle titles, and further select an additional title of the battle title in S15.
The game system 1 may be configured to set a title to be preferentially matched when a plurality of battle titles are selected. In this case, for example, the priority order can be set in the order in which a plurality of battle titles are selected, that is, the priority order of the title selected first may be set highest.

In S16, as shown in FIG. 18B, the matching control unit 32 of the game machine 10 (G011) displays the matching type selection screen 81 on the display unit 14, thereby performing the matching type selection process.
The matching type selection screen 81 is a process of accepting selection of which one of in-store matching and inter-store matching is 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 with other game machines 10 in the store A. For this reason, the player (P011) may select the in-store matching button 81a, for example, when he wants to play against another player P in the store.
On the other hand, since the matching between stores performs matching with the game machine 10 of stores other than the store A in addition to the store A, matching is easy to be established. For this reason, the player (P011) may select the inter-store matching button 81b, for example, when he strongly desires a competitive play.
Details of these matching processes will be described later.

  When the in-store matching button 81a is selected (S16: YES), the matching control unit 32 of the game machine 10 (G011) proceeds to S17, and on the other hand, when it is determined that the inter-store matching button 81b is selected. (S16: NO), the process 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 an inter-store matching process.

(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) communicates with other game machines 10 in the store A, and as a result of searching for the game machine 10 waiting for in-store matching, the corresponding game machine 10 If it exists, the game machine 10 is matched.
Note that the matching control unit 32 of the game machine 10 (G011) gives priority to the game machine 10 that is waiting for a high priority title when a plurality of battle titles are selected and priority order is set. Just search. Then, the matching control unit 32 searches for the game machine 10 that is waiting for the next title when matching is not established because the corresponding game machine 10 does not exist.
In addition, when the match control unit 32 of the game machine 10 (G011) searches for the game machine 10 that is waiting for in-store matching, and there are a plurality of game machines 10, these games are displayed on the display unit 14. The player (P011) may be able to select the opponent by displaying the machine 10, the player P who becomes the opponent, and the like. Further, in this case, the matching control unit 32 may prioritize matching with the player P having a small difference in stage between the two players P and having a close skill.

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

In S23, as shown in the single-player screen 82 in FIG. 19A, the matching control unit 32 of the game machine 10 (G011) executes the single-player play of the single-player title selected in S14. Wait for matching inside.
In this process, since the in-store matching was not established in S22, another game machine 10 in the store A starts searching for an opponent (that is, the in-store search process in S21) while playing one player. Wait until

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 single player is in progress. When it is determined that the in-store matching is established (S24: YES), the matching control unit 32 proceeds to S31. On the other hand, when it is determined that the in-store matching is not established (S24: NO), the processing proceeds to S25.
As shown in FIG. 19B, in this scene, when the in-store matching is established, 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 game is finished. The case where the one-player play ends is, for example, the case where the player (P011) has won the prescribed number of stages in the one-player play, or the case where the player (P011) has been defeated in the one-player play.
If the matching control unit 32 of the game machine 10 (G011) determines that the one-player game has ended (S25: YES), the process proceeds to S26, whereas if it determines that it has not ended (S25: 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 terminating the in-store matching process is that the single-player has been completed without matching being achieved in the processes so far.

In S31, the matching control unit 32 of the game machine 10 (G011) determines whether the one-person title and the battle title are the same title in response to the establishment of the in-store matching in S22 or S24.
When it is determined that the two titles are the same (S31: YES), the matching control unit 32 proceeds to S32. On the other hand, when it is determined that they are different (S31: NO), the matching control unit 32 proceeds to S31a.

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

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

(Inter-store matching process)
As shown in FIG. 16, in S41, the matching control unit 32 of the game machine 10 (G011) performs in-store search processing. 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) in the store A and the player (P022) of the game machine 10 (G022) in the store B are matched will be described.
In S42, the matching control unit 32 of the game machine 10 (G011) determines whether in-store matching has been established. When it is determined that the in-store matching is established (S42: YES), the matching control unit 32 proceeds to S42a. On the other hand, when it is determined that the in-store matching is not established (S42: NO), the processing proceeds to S43. 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 in response to the establishment of in-store matching. The processes after S42a are the same as the processes after S31 of the in-store matching process.

As described above, the game system 1 first performs the in-store matching process even when the inter-store matching is selected.
Thereby, the game system 1 can advance the battle | competition play in the store which does not have a concern of a frame delay, when in-store matching is materialized. In addition, the game system 1 can cope with a request from a store operator or the like that it is desired that the in-store battle is actively performed rather than the inter-store battle.

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

In S <b> 44, the matching control unit 32 of the game machine 10 (G011) performs a matching result standby process from the central server 50 while executing single-player for one player.
That is, in the one-player play in the in-store matching process, waiting for in-store matching is awaited, whereas in the one-player play in the inter-store matching process, waiting for in-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 single player screen 84 will be described later.

  By the processing so far, the game machine 10 (G011) starts the in-store battle play when the in-store matching is established at the time of accepting the play (S42: YES), and when this is not established. (S42: NO), the process proceeds to the inter-store matching process without waiting for the in-store matching (S43, S44). Thereby, although the game machine 10 (G011) gives priority to the in-store matching process immediately after the play is accepted, 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 matching partner extraction processing in response to a request for matching between stores 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 machines 10 of stores other than the store A.

In the matching partner extraction process, first, a game machine 10 that satisfies both of the following two conditions is extracted.
(1) The communication state of both stores is “OK” or more The matching control unit 72 of the central server 50 refers to the communication state history storage unit 65 (see FIG. 6), so that the communication state is “OK” or more. The store which is is extracted.
In the example of FIG. 6, the matching control unit 72 extracts stores B, C, and D.
Thereby, the matching control part 72 can extract the store in which the game machine 10 with few frame delays in a battle play was 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 in (1) above from the operation information storage unit 64 (see FIG. 5B). By referring to the store information, the game machine 10 in which the matching of the titles T1 and T2 is in a standby state is extracted.
In the example of FIG. 5B, among the game machines 10 among the shops B, C, and D whose communication state is “OK” or more, the game machine 10 (G022) in the shop B and the game machine 10 (G041) in the shop D To extract.

(3) The matching control unit 72 of the central server 50, when the processes (1) and (2) are completed, if the number of opponent players P, that is, the number of matchings is large, Among them, the player P with a small step difference from the player P in the store A is extracted with priority. Then, the matching control unit 72 narrows down the plurality of matchings to, for example, three.

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

In S47, upon receiving the matching result information, the matching control unit 32 of the game machine 10 (G011) starts communication with the matching partner game machine 10 based on the connection destination information included therein. In this case, the matching control unit 32 acquires the current communication state by exchanging frames with other game machines 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 on the first line from the top indicates “title T1”, “player name = Jiro”, and “dan = 6”.

Moreover, the matching information display part 84a displays the communication state of each matching (communication state display process). This is based on the communication state acquired in S47. The communication status display includes an antenna image by referring to the communication status evaluation table 26 in addition to character display such as “OK”.
Thereby, the matching information display part 84a can tell the player (P011) the correct communication state at the present time actually matched, not the time when the central server 50 acquired the communication state in the past.
The communication state displayed here may be the same as that received from the central server 50 in S47. In this case, the game machine 10 (G011) can display the communication state without exchanging frames.

The selection button is a button for accepting selection from among a plurality of matchings in the matching information display portion 84a.
The player (P011) can select an opponent while referring to the title, level, communication state, and the like.
For example, when the player (P011) wants to prioritize the stability of the communication state over the title type and the rank, the player (P011) may select matching with a better communication state with reference to the communication state display. Similarly, when the player (P011) wants to give priority to the title type or level over other matching elements, for example, the player (P011) can select the matching giving priority to this.

In S49, the matching control unit 32 of the game machine 10 (G011) determines whether or not one of the matchings displayed in the list is 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 processing from S43 is repeated. .
In the repeated processing of S43, matching is requested to the central server 50 again. In response to this, the central server 50 again extracts the game machines 10 waiting for matching (S45). For this reason, the central server 50 can add this game machine 10 to the extraction object of matching, when the game machine 10 in waiting for matching is newly added. Accordingly, when the extracted matching list is changed, 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) sends the matching acceptance information, which is information indicating that matching is selected, to the matching partner game machine 10 (here, the game machine 10 (G022)). Send. The matching selection information includes a title name, player information (player name, rank, etc.) of the player (P011), communication state information, and the like.

Although the illustration of 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 receiving the matching selection information.
As shown in FIG. 20B, the inter-store matching establishment screen 85 displays a matching information display section 85a, an acceptance button 85b, and a rejection button 85c.
The matching information display unit 85a displays information such as the title name, the matching player name “Ichiro”, the level “6”, and the communication state “good”. The player name, stage, and communication state are based on matching selection information.

The accept button 85b is a button for the player (P022) to accept the matching and confirm the execution of the battle play. That is, the accept 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 matching.
The player (P022) may select whether to accept or reject the matching with reference to the stage and communication status 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, the matching process of the game machine 10 (G011) is terminated, while the operation information of the reject button 85c is received. In this case, 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).
The play control unit 31 of the game machine 10 (G011) determines that the battle play is started when the operation information of the accept button 85b is received (S51: YES), and 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-person title and the battle title are the same title as in S31. When it is determined that the two titles are the same (S52: YES), the play control unit 31 of the game machine 10 (G011) proceeds to S. On the other hand, when it is determined that the titles are different (S52: NO), The process proceeds to S52a.
In S52a, the matching control unit 32 of the game machine 10 (G011) performs the charging 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 inter-store communication, the play control unit 31 performs the above-described stop period input process in the communication state (for example, when the communication state is lowered to “permitted” or lower).

  As described above, the game system 1 of the present embodiment performs the in-store matching process after performing the in-store matching process even when the inter-store matching is selected. Respond to requests for priority. In addition, since the game system 1 performs matching processing for a plurality of titles at the same time, it is possible to improve the possibility of matching.

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

The play control unit 31 of the game machine 10 (G011), based on the command table 21a (T1) and the command correction table 21b (T1) (see FIG. 4), the ability (attack power, defense power) of the character C in the battle play. To decide.
As shown in the command correction table 21b (T1), the character C3 increases the defense value and the attack value correction value (parameter) as the communication state decreases. For this reason, the character C3 becomes stronger as the communication state decreases.
In addition, the attack value of the character C2 does not change as the communication state decreases, but the defense value decreases. For this reason, the character C2 becomes weak as the communication state decreases.
For this reason, when the characters C2 and C3 play in the store-to-store battle play, the character C3 becomes dominant in terms of ability as the communication state decreases.

The communication state changes even during the battle play. The play control unit 31 of the game machine 10 (G011) refers to the command correction table 21b (T1) based on the current communication state and sets the character correction value. For this reason, the ability of the character C increases and decreases during the battle play.
Thereby, since the game system 1 can suppress that a battle | competition play becomes monotonous, it can improve interest.
In addition, the title T1 specification is a winning game in which, for example, the three characters C, the leader, the middle-ranking, and the general, are sequentially replaced every time they are defeated in a round, and the winning is determined by preempting three wins at the normal end. In some cases, the player P has an examination of which character C to select 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 selection of the character C according to the communication state.

The mode of the bubble image 86b changes during the inter-store play.
That is, the bubble image 86b increases or becomes larger as the communication state changes from “best” to “bad”. Since the bubble image 86b is displayed over the entire play screen of the display unit 14, the bubble image 86b is displayed so as to overlap the character C itself, and is also displayed around the character C.
Therefore, the player P can check the state of the bubble image 86b naturally by operating the character C. Accordingly, the player P can recognize the current communication state without diverting his / her line of sight to the character display such as “OK” or the antenna image of the communication state display unit 86a.
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 be changed according to the communication state.

With the above configuration, the game system 1 can provide a new mode game by utilizing the fact that the communication state changes. That is, it is advantageous for the player P who operates the character C3 to start an attack on the opponent when the communication state is lowered. On the other hand, the player P who operates the character C2 and the like is when the communication state is lowered. , Operations that dodge attacks from the other party will be required.
In addition, the communication state during play may change gradually or may change abruptly. Even in this case, the player P can always grasp the current communication state from the bubble image 86b, so that the player C can appropriately operate the character C even when the communication state during play changes rapidly. Can do.

As described above, the game system 1 of the present embodiment can provide a new mode of game 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, when a delay of 3 frames or more has occurred 5 times), the character C can make a special move, and conversely, the physical strength value of the character C can be reduced. It may be. Even in such a form, since the characteristics of the character C can be changed according to the communication state, a game of a new aspect can be provided.

[Cancellation of inter-store play]
This process is a process corresponding to the play stop of # 6a in FIG.
FIG. 22 is a flowchart of an inter-store play play cancellation process according to the first embodiment.
FIG. 23 is a flowchart of delay influence analysis processing according to the first embodiment.
FIG. 24 is a diagram illustrating an inter-store battle play screen 87 according to the first embodiment.
The inter-store competitive play cancellation process is a process related to the cancellation of the competitive play due to a decrease in the communication state or the like.
Note that, as shown in the inter-store match play screen 87 in FIGS. 24A and 24B, the matching control unit 32 of the game machine 10 (G011) measures the frame delay occurrence rate during the match play. It continues, and the result (that is, communication state) is displayed on the communication state display part 87a of the display part 14. FIG. Thus, the player P can play a battle while checking the frame delay occurrence rate.

As shown in FIG. 22, in S60, the matching control unit 32 of the game machine 10 (G011) performs a delay influence analysis process.
In the play content analysis process, mainly when the communication state is lowered, the influence of communication delay on play is analyzed.
(Delay effect analysis processing)
The delay effect analysis process will be described with reference to FIG.
In S61, the matching control unit 32 of the game machine 10 (G011) changes from the state where the communication state is “possible” or higher (the state shown in FIG. 21A) to the state “bad” (the state shown in FIG. 21B). It is determined whether or not it has dropped.
When the matching control unit 32 determines that the communication state has decreased to “bad” (S61: YES), the matching control unit 32 proceeds to S62. On the other hand, when the matching control unit 32 determines that the communication state has not decreased to “bad” (S61: 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 content of the previous battle play.
When it is determined that the number of operations per technique is within the determination value (S62: NO), the matching control unit 32 proceeds to S64, and when it is determined that the number of operations is greater than the determination value (S62). : YES), the process proceeds to S63.

Here, when the player P is performing an accurate operation for a big skill, the number of operations per technique tends to be large (command table 21a (T1) of the title T1 in FIG. 4A). See compound operations in).
For this reason, the greater the number of operations per technique, the greater the amount of operation information contained in one frame or a continuous frame, so the influence of frame delay on play is greater. In other words, due to the frame delay, some pieces of operation information of the composite operation cannot be accepted, or the lack of the operation information may fail to establish a great skill.
For this reason, when the number of operations per technique is large (that is, S62: NO), the influence of the frame delay on the battle play is large, and conversely, when this is small (that is, S62: YES), the frame delay is small. Small impact on play.
This determination value can be set, for example, “number of operations per technique = 3 times” or the like.

In S63, the matching control unit 32 of the game machine 10 (G011) determines whether or not the damage to the enemy per one operation is within the determination value by analyzing the play content of the previous battle play. .
When the damage to the enemy per operation is within the determination value (S63: YES), the matching control unit 32 of the game machine 10 (G011) proceeds to S65, and on the other hand, is larger than the determination value. (S63: NO), the process proceeds to S64.

Here, when the player P performs an accurate operation to attack the enemy, the damage to the enemy per technique tends to increase. This is because the operation timing, time interval, etc. are accurate, so that even if the number of techniques is small, the enemy can be greatly damaged.
For this reason, the greater the damage to an enemy per trick, the greater the effect of frame delay on play. That is, some of the operation information out of a small number of operations can not be accepted from the beginning, or the character may not be able to damage the enemy without performing a technique action due to lack of this. Because.
For this reason, when the damage to the enemy per technique is large (that is, S63: NO), the influence of the frame delay on the battle play is large. Conversely, when this is small (that is, S63: YES), the frame is delayed. The effect of delay on match play is small.
When the initial value of life value (at the start of play) is 100 P (points), this determination value can be set to “damage to enemy per skill = 20 P” or the like.

As a result of the processing of S62 and S63, the matching control unit 32 of the game machine 10 (G011) determines that the degree of influence on the competitive play due to the decrease in the communication state is “S62: NO” or “S63: NO”. Larger can be analyzed. On the other hand, in the case of “S62: YES” and “S63: YES”, it can be analyzed that the degree of influence on the battle play due to the decrease in the communication state is small.
Note that the determination of the degree of influence of the communication state drop on the battle play is not limited to the above-described form. For example, when “S62: NO” and “S63: NO”, it is analyzed that the degree of influence is large. Good. Further, in the case of “S62: YES” or “S63: YES”, it may be analyzed that the degree of influence on the battle play due to the decrease in the communication state 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 decreased from “bad” to “impossible”.
When the communication state has dropped to “impossible” (S65: YES), the matching control unit 32 proceeds to S64. On the other hand, when the communication state has not dropped to “impossible” (S64: NO), the processing of S65 is performed. repeat.

Here, the case where the process proceeds to S65 is a case where the degree of influence on the competitive play due to the decrease in the communication state is small as described above (S62: YES and S63: YES).
For this reason, even when the communication state is “bad”, the matching control unit 32 repeats the process of S65 when the communication state is not lowered to “impossible” (S65: NO), thereby performing the battle play. maintain.
On the other hand, the matching control unit 32 continues the play for the player P even if the degree of influence on the battle play due to the decrease in the communication state is small when the communication state is lowered to the impossible (S65: YES). Is unbearable. For this reason, the matching control part 32 progresses to the process after S64, and performs the process for stopping a battle | competition 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 dropped from “bad” to “impossible”.
If the communication state has dropped to “impossible” (S70: YES), the matching control unit 32 proceeds to S76. If the communication state has not decreased to “impossible” (S70: NO), the matching control unit 32 proceeds to S71. .
When the communication state influence degree is small, the communication state has already been disabled (S65: YES in FIG. 23), so the determination in S70 is “S70: YES”. For this reason, the case where it is determined as “S70: NO” is only when the communication state influence degree is large.

In S71, the matching control unit 32 of the game machine 10 (G011) displays a stop button 87b as shown in the inter-store battle play screen 87 in FIG.
When the player P wants to stop the battle play, the player P may perform a stop operation (an operation to select the stop button 87b).
Here, in the scene of FIG. 24 (B), the player P is forced to play under a condition where the communication state is “bad” although the play state has a large communication state influence degree. For this reason, the game machine 10 (G011) can stop the battle play according to the intention of the player P.

In S72, the matching control unit 32 of the game machine 10 (G011) determines whether or not a cancel operation has been performed on both the own machine and the game machine 10 of the opponent player P (hereinafter also referred to as “both game machines 10”). Determine whether. The matching control unit 32 can confirm the operation status of the play stop button of the opponent game machine 10 through the frame exchange process.
If the matching control unit 32 determines that the cancel operation has been performed on both game machines 10 (S72: YES), the process proceeds to S76. On the other hand, if the matching control unit 32 determines that the cancel operation has not been performed on both game machines 10 (S72: NO), the process proceeds to S73.

In S73, the matching control unit 32 of the game machine 10 (G011) determines whether only the dominant game machine 10 has been canceled. That is, when only one of the two game machines 10 is canceled, it is determined whether or not this is an operation of the dominant game machine 10.
The dominant game machine 10 is the game machine 10 of the player P who is dominant in the battle play.
In addition, for example, in the case of a fighting game, the superiority or inferiority of the battle play may be determined by comparing the remaining life values. That is, of the two players P, the one with a larger remaining life value is dominant and the one with a small remaining life value is inferior.
If the matching control unit 32 of the game machine 10 (G011) determines that the own machine is the dominant side (S73: YES), the process proceeds to S74, whereas if the own machine is determined not to be the dominant side. (S73: NO), the process from S70 is repeated.

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 the degree of superiority or inferiority in the battle play. When the life value difference is small, since the superiority / inferiority difference is small, the play state is highly likely to reverse the superiority / inferiority. On the other hand, when the life value difference is large, since the superiority / inferiority difference is large, the play state is less likely to be reversed.
The determination 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 at the time of determination. The determination value of the life value difference can be set to, for example, the life value difference 50 when the full value of the life value is the life value 100, for example.
In addition, when the specification of the title T1 is a winning game with three characters, the life value of one character is assumed to be 100P, and the life value is assumed to have a life value of 300P in one battle play. What is necessary is just to calculate a difference.
When it is determined that the life value difference is within the determination value (S74: YES), the matching control unit 32 proceeds to S75. On the other hand, when it is determined that the life value difference is greater 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 processing from S70.
The reason for continuing the battle play is that even if the communication state is in a bad state and the dominant player P has selected to cancel the play, the superiority difference of the battle play is small. In other words, it is harsh for the inferior player P to stop playing with a sufficient chance of reversal.

In S76, the matching control unit 32 of the game machine 10 (G011) stops the battle play.
Here, the process proceeds to S76 in the following four scenes.
(A) The match control unit 32 of the game machine 10 (G011) is instructed by the communication state being disabled (S65: YES) during a battle play with a low communication influence level (S62: YES, S62: NO). The scene where the play is forcibly stopped (B) While the battle play with a large communication influence degree is in progress (S62: NO, S62: YES), the communication state is disabled (S70: YES), and the game machine 10 (G011) ) Matching control unit 32 forcibly stopped playing (C) While a battle play with a large communication influence degree is in progress (S62: NO, S62: YES), by both player P's canceling operation (S72: YES), That is, with the consent of both players P, the match control unit 32 of the game machine 10 (G011) stops playing (D) The battle play progress with a large communication influence level On the other hand (S62: NO, S62: YES), since the superiority / inferiority difference of the competitive play is large, the inferior player P does not agree in accordance with the canceling operation of the dominant player P (S73: NO) When the life value difference is greater than or equal to the determination value (S74: NO), the scene where the play is forcibly stopped

Since the scenes (A) and (B) are in a state where the battle play cannot be continued because the communication state is disabled, both players P have no choice but to accept the forced end of the battle play.
In the scene of (C), both players P cancel the battle play after approval, so there is little dissatisfaction with the play stop.

The scene of (D) is a state in which the battle play is stopped only by the approval of the dominant player P in the play where the possibility of superiority / inferiority inversion is low.
In this scene, the dominant player P is in a state where the inferior player P desires to continue the play even though the possibility of the situation being reversed is low even if the play is continued. For this reason, it is severe for the dominant player P to continue the battle play. In other words, the inferior player P has forced a severe play against the dominant player P.
Therefore, in the embodiment, in order to rescue the dominant player P, it is decided to allow the stop of the battle play only by the approval.
For the inferior player P, there is little dissatisfaction because the possibility of the situation reversal is low even if the battle play is stopped.

In S77, the control unit 30 of the game machine 10 (G011) performs a point awarding process associated with the stop of play. Details of the point grant processing will be described later.
As described above, the process of canceling the battle play with the decrease in the communication state is completed.

  As described above, the game system 1 of the present embodiment stops 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 play is stopped according to the difference in superiority or inferiority of the play, so the dissatisfaction of the player P can be reduced.

[Points granted after the match play ends]
The point giving process at the end of the battle play is a process corresponding to # 6b and # 7b in FIG.
FIG. 25 is a flowchart of the point giving process according to the first embodiment.
The point giving process is a process in which the central server 50 gives points to the player P after the battle play is ended (that is, after the battle play is stopped or after the normal end).
As a premise of this process, at the end of the battle play, the control unit 30 of the game machine 10 (G011) transmits play end information to the central server 50. The play end information includes information such as a game machine ID, a player ID, a score of the player P, an end form (that is, whether the play is stopped or is a normal end), winning or losing at the normal end, superiority or inferiority at the time of stopping the play. .
It should be noted that the end form is a play stop, which means a stop due to a communication state (in the case of the process of S76 above), and that the end form is a normal end, the play continues to the end without being stopped. And when it ends normally.

  In S81, the point management unit 73 of the central server 50 determines whether or not the play end mode is play stop based on the play end information received from the game machine 10 (G011). If the point management unit 73 determines that the play is to be stopped (S81: YES), the process proceeds to S82. On the other hand, if it is determined that the play is not to be stopped (S81: NO), that is, it is determined that the play ends normally. If so, the process proceeds to S81a.

In S81a, the point management unit 73 of the central server 50 performs point normal grant processing.
Here, the case of proceeding to S81a is a case where the play is normally completed.
For this reason, the point management part 73 of the central server 50 gives the point according to a play result based on play completion information. That is, the point management unit 73 adds the points corresponding to the difference in stage between the two players P to the winning player P, while subtracting the points from the defeated player P. Information in the storage unit 67 (see FIG. 7) is updated. Further, the point management unit 73 updates the level information when there is a level change as a result of the point grant.
Then, the point management unit 73 of the central server 50 ends the process.

In the processing after S82, the central server 50 performs point grant processing when play is stopped.
In S82, the point management unit 73 of the central server 50 performs point calculation processing.
In the point calculation process, a point value (also referred to as “progress degree point value” in the embodiment) corresponding to the degree of progress of the play at the time of stopping the match play is calculated.

As described above, when the specification of the title T1 is a winning game by three characters, the progress degree point value can be calculated as follows.
Progress level point value = (Points at normal end corresponding to stage difference) x (Number of wins when play is stopped) ÷ (Number of wins at normal end = 3)
For example, when “the stage difference between players is 2” and “the point at the normal end corresponding to the stage difference is 2P” is as follows.
Progression point value = 2P x number of wins 2 / number of wins at normal end 3 = 4 / 3P

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

In addition, for 1R (round) at the time of play stop, a 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 this point.
Since the point value corresponding to 1R (round) is 2 / 3P (= all 2P × 1R / all 3R), when the play time of 1R is all 90 seconds, it can be modified as follows.
Round progress point value at the time of play stop = 2 / 3P x (elapsed time at the end of play) ÷ (1R play time 90 seconds)
In this form, even if the play is stopped in the first round, the progress degree point value can be calculated.

In S83, the point management unit 73 of the central server 50 determines whether the life value difference (dominance difference) at the time of play interruption is within the determination value. If 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. Proceed to S83a.
This determination of superiority or inferiority is based on the life value difference as in S74. However, in S83, this determination process is performed even when the communication influence degree is small.

In S <b> 83 a, the point management unit 73 of the central server 50 gives a progress degree point 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 degree 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. For this reason, the game system 1 can strongly urge the inferior player P to stop the play (S72) when the communication state is lowered (S70: YES).

In S <b> 84, the point management unit 73 of the central server 50 distributes and gives the progress degree points between both players P. This is because, in the case of proceeding to S84, the play is stopped in a state where the difference between superiority and inferiority is small and the possibility of the reversal of the situation is large.
The apportioning method may be, for example, dividing the progress degree point according to the ratio of the remaining life values of both players P.

  As described above, the game system 1 according to the present embodiment gives points to the dominant player P when the play is stopped due to the communication state, and the inferior player P when the play is stopped. Do not subtract points from For this reason, there is a profit for the dominant player P and no disadvantage for the inferior player P. Further, since the game system 1 prorates and gives points when the difference between superiority and inferiority at the time of stopping the play is small, both the dominant player P and the inferior player P are profitable.

[Store introduction process]
The store introduction process is a process corresponding to # 6c in FIG.
FIG. 26 is a flowchart of the store introduction process according to the first embodiment.
FIG. 27 is a diagram illustrating an inter-store play play end screen 88 according to 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 search result display screens 91 to 93 according to the first embodiment.

  In the store introduction process, after the central server 50 finishes the inter-store battle play (that is, after the inter-store match play is stopped or after the normal end), the store is in a better communication state or the like with respect to the player P. This is a process in which the information of the store is displayed on the display unit 14 of each game machine 10 (G011, G022) (first game machine, second game machine) and thereby transmitted to the player P.

As shown in FIG. 26, in S91, the control unit 30 of the game machine 10 (G011) transmits the play end information to the central server 50 based on the fact that the battle play has been stopped or ended normally.
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 point grant information and the like to each game machine 10 (G011, G022) in response to the completion 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 a stop based on the communication state or a normal end. When the end of play is based on cancellation (S93: YES), the control unit 30 proceeds to S94, whereas when determined to be 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 a play end screen. Although illustration is omitted, 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.
For this reason, the game system 1 is configured not to introduce the store when the battle play ends normally. Thereafter, 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 store-to-store battle play end screen 88.
As shown in FIG. 27, the inter-store play play end screen 88 includes a play result display section 88a, a message display section 88b, and a store search display section 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 display unit 14 of the game machine 10 (G022) of the store B (second store) is the same. Display a simple screen.
The play result display unit 88a displays information regarding the result of the battle play.
In this example, the play result display unit 88a indicates that “the match play of the title T1 has been terminated due to the play stop”, “Ichiro (P011) is inferior, and Jiro (P022) Information such as “Being superior” and “Proration points received from the central server 50 are +1 and +1.5 respectively” are displayed.

The message display portion 88b is a portion that displays a message between the players P as text. That is, the matching control part 32 of each game machine 10 will each transmit to the game machine 10 of an opponent via inter-store communication, if a message is input. 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 to Jiro (P022) is displayed.
The method for inputting the message is not limited. For example, the display unit 14 may function as a software keyboard in response to the pointer 14a being arranged on the message display unit 88b.

The store search display unit 89 includes 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 store A.
In the embodiment, the neighborhood means that the player P is close to the extent that the player P can move within, for example, about 1 hour (determination moving time) using normal moving means.
Ordinary transportation means are used on a daily basis, and include concepts such as walking, cars traveling on general roads, conventional lines, and general route buses (mainly buses operating on general roads). is there. On the other hand, normal transportation means are not used on a daily basis, and include, for example, automobiles using expressways, express route buses (buses that operate including expressways), toll express trains, airplanes, etc. There is no concept.
In addition, the neighborhood is geographically a concept of, for example, the same or adjacent area (city, village, prefecture, 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) Neighborhood store of store A (third store)
Here, the neighboring store is assumed to be store C.
However, the communication state between the game machine 10 (third game machine) in the store C and the game machine 10 (second game machine) in the store B is the same as the game machine 10 (first game machine) in the store A and the store B. It is better than the communication state between the game machines 10.
The store A Ichiro (P011) 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) Neighborhood store of store A (third store) and neighborhood store of store B (fourth 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) in the store C and the game machine 10 (fourth game machine) in the store D is the same as that of the game machine 10 (first game machine) in the store A and the store B. This is better than the communication state between the game machines 10 (second game machines).
The search button for the store A Ichiro (P011), for example, when he / she moves to the store C and wants to fight again by moving to the store D from the store B to the partner Jiro (P022). 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) Neighboring store of store A and neighboring store of store B Here, the neighboring store is assumed to be store E.
The store A Ichiro (P011) may select the search button 89c, for example, when he / she and his partner 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 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 button operation information from the game machine 10 (G011), it performs store search processing as follows.

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

In S97a, the matching control unit 72 of the central server 50 extracts stores that match the above (A) as follows.
(1) The neighboring store of the store A is extracted by referring to the store information storage unit 63 (see FIG. 5A). 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 the neighboring store, the travel time, the transportation means, and the like by using, for example, a geographic information database, an application for calculating travel time by transportation means, and the like. Thereby, the matching control unit 72 can extract a store near 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. Stores that are better (for example, “good” or higher).
In this case, the matching control unit 72 of the central server 50 may perform a process of checking the current communication state by causing the game machines 10 of the neighboring store and the store A to perform a frame exchange process. The matching control unit 72 of the central server 50 does not extract this store as a nearby store when the current communication state is lower than that at the time of the battle.

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

(Extraction of neighboring stores of store A and neighboring stores of store B: see FIG. 28B)
In S98, the matching control unit 72 of the central server 50 determines whether or not the button operation information is operation information of the search button 89b. When the matching control unit 72 determines that the operation information is the search button 89b (S98: YES), the process proceeds to S98a. On the other hand, when the matching control unit 72 determines that the search button 89b is not the operation information (S98: NO) ), Go 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. 5A), the neighboring store of the store A and the neighboring store of the store B are extracted. In this case, similar to S97a, the neighboring stores of the store A and the neighboring stores of the store B are extracted based on the addresses of the stores A and B. Further, the distance, travel time, transportation means, etc. from the store A to the neighboring store are obtained, and further, the distance, travel time, transportation means, etc. from the store B to the neighboring store are obtained.
(2) From the stores extracted in (1) above, a store in which the communication state between both neighboring stores is better (for example, “good” or higher) than the communication state between the store A and the store B is extracted.

(3) As search result information, store information (store name, distance from the store, travel time, transportation means, communication status with the store B, etc.) of both neighboring stores extracted in (2) above is used as 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 pieces of store information and the like as search results, as in S98a. Moreover, the matching control part 72 transmits the information which shows this to the game machine 10 (G011), when an applicable store does not exist.

(Extraction of neighboring stores that are near store A and near store B: see FIG. 28C)
In S99, the matching control unit 72 of the central server 50 determines whether or not the button operation information is operation information of the search button 89c. If the matching control unit 72 determines that the operation information is for the search button 89c (S99: YES), the process proceeds to S99a. If the matching control unit 72 determines that the operation information is not for the search button 89c (S99: NO) ), Go 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. 5A), stores that are in the vicinity of the store A and in the vicinity of the store B are extracted. In this case, similarly to S97a, based on the addresses of stores A and B, stores that are nearby to both stores A and B are extracted. Then, the distance, travel time, transportation, etc. from the store A to the neighboring store are obtained, and the distance, travel time, transportation, etc. from the store B to the neighboring store 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 and the like as a search result, as in S97a, and information indicating that the corresponding store does not exist. It may be transmitted to the game machine 10 (G011).
Thereafter, 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.
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 neighboring store information display units 91a to 93a and message display units 91b to 93b.
Neighborhood store information display parts 91a-93a display the store information contained in search result information.
The message display portions 91b to 93b are display areas similar to the message display portion 88b (see FIG. 27).
Although illustration is omitted, when information indicating that the corresponding store does not exist is received from the central server 50, information indicating that “the corresponding store does not exist” is displayed on the display unit 14.

As shown in FIG. 29A, 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 vicinity of the store A extracted in S97a The store information of the store is displayed on the nearby store information display unit 91a.
In the example of FIG. 29A, the neighboring store information display unit 91a displays information such as a neighboring store name “Store C”, a moving means “Train”, and a traveling time “10 minutes”.
Ichiro (P011) of the game machine 10 (G011) of the store A refers to the nearby store information display unit 91a, and sends a message to the opponent to inform the opponent of the time to move to the store C, the time until the rematch, etc. 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 vicinity of the store A extracted in S98a. Each store information of the store and the nearby store of the store B is displayed on the nearby store information display unit 92a.
In the example of FIG. 29B, the neighboring store information display unit 92 a displays information such as the neighboring store name “Store C”, the moving means “Train”, and the traveling time “20 minutes” of the store A. In addition, the neighboring store information display unit 92a displays information such as the neighboring store name “store D” of the store B, the moving means “train”, and the traveling time “10 minutes”.
Thereby, Ichiro (P011) of the game machine 10 (G011) of the store A refers to the nearby store information display unit 92a, so that he / she moves to the store C and moves to the store D with respect to the opponent. A message that informs the opponent of the time until the rematch or the like can be input to the message display section 92b.

As shown in FIG. 29C, 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 vicinity of the store A extracted in S99a. And the store information of the nearby store that is the neighborhood of the store B is displayed on the nearby store information display section 93a.
In the example of FIG. 29C, the neighboring store information display unit 93a displays the neighboring store name “Store E”, the store A from the travel means “train”, the travel time “20 minutes”, and the store B from the travel means “walk”. ”And information of travel time“ 10 minutes ”are displayed.
The player (P011) of the game machine 10 (G011) at the store A refers to the nearby store information display unit 93a, and moves to the store E, and goes to the same store E with respect to the opponent Jiro (P022). A message that informs the opponent of the request for movement, the time until the rematch, and the like can be input to the message display section 93b.

  As described above, when the inter-store play is ended due to the cancellation, the game system 1 introduces a store having a good communication state and neighboring stores of both stores by performing a store introduction process. For this reason, for example, the game system 1 has an opportunity to perform a rematch in a better environment with respect to the player P when the player P is dissatisfied with the communication state at the time of the battle and desires a rematch. Can be provided.

In addition, although the said form showed the example performed when a shop introduction process complete | finishes a play from cancellation, it is not limited to this, You may perform also when a play is complete | finished by normal completion. Even in this case, the game system 1 can provide an opportunity to perform a rematch in a better environment.
Further, the store information storage unit 63 of the central server 50 may store each store and a neighboring store in association with each other. In this case, the matching control unit 72 of the central server 50 can extract the neighboring stores of each store based on the information in 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 according to the first embodiment.
FIG. 32 is a diagram illustrating a resume title selection screen 95 according to the first embodiment.
The play resumption process is a process in the case where play is resumed on the game machine 10 (G022) after the battle play is completed. The battle play may be an in-store battle or an inter-store battle. The play restart process after the store-to-store battle may be performed in accordance with 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 starting the battle play and the battle title in which the battle play is performed are the same title. When it is determined that the two titles are the same (S111: YES), the play control unit 31 proceeds to S111a. On the other hand, when it is determined that the titles 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. When it is determined that the play control unit 31 is a victory (S111a: YES), the process proceeds to S114. On the other hand, when it is determined that it is not a victory (S111a: NO), that is, when it is a defeat, It progresses to S118 and complete | finishes a process.
The reason for proceeding to S118 and ending the process is that the single player title and the battle title are the same (S111: YES), the play fee is charged only for the single player title (see S11 in FIG. 14). In addition, the player's (P011) play right relating to the title of one player has disappeared due to the defeat in the battle play.

In S112, the play control unit 31 of the game machine 10 (G011) determines whether the cause of the end of the battle play is stop play (see S76 in FIG. 22) or normal end. If it is determined that this is a play stop (S112: YES), the play control unit 31 proceeds to S115, whereas if it is determined that the play ends normally (S112: NO), the process proceeds to S113.
In the case of an in-store match, the play is not stopped due to the communication state, so it is determined that the game has ended normally (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. When it is determined that the play control unit 31 is a victory (S113: YES), the play control unit 31 proceeds to S115. On the other hand, when it is determined that the game is a defeat (S113: NO), the play control unit 31 proceeds to S114.

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

The reason for resuming the play of a single player without charge will be described.
There are the following two scenes to proceed to S114.
In the first scene, the single player title and the battle title are the same (S111: YES), and the play fee is charged only for the single player title (S11 in FIG. 14), and the battle play is won. Yes (S111a: YES).
In this case, although the play fee is charged only for one player's title, the player (P011) continues to have the right to play one player's title by winning the battle play. For this reason, the game system 1 resumes the play of one person title without charge after the end of the battle play.

The second scene is a state in which the one-person title and the battle title are different (S111: NO), and the play fee is charged for both titles (S11 of FIG. 14 for the one-player title, S31a of FIG. 15 for the battle title or This is a case where S52a in FIG. 17 is defeated in the battle play.
In this case, with respect to the battle title, the player (P011) has lost the right to play because the battle play is normally completed and defeated. On the other hand, since the single player title is interrupted by the start of the battle play, the player (P011) continues to have the right to play the single player title. For this reason, the game system 1 resumes the play of one person title without charge after the end of the battle play.

Further, the one-person title is interrupted in order to start the battle play while the single-person title is being played (see S32 in FIG. 15 and S53 in FIG. 17).
In this S114, the player (P011) continues to play the one-person title even after the match-up play by restarting the one-person title from the position where the one-person title was interrupted after the end of the battle play. be able to.

Note that the position where one person's title is interrupted may not be a strictly interrupted position as long as it corresponds to the interrupted position. For example, before the start of the battle play, when the play is interrupted 45 seconds after the start of the play of one person title, it does not have to be started strictly after 45 seconds.
For example, if the game specifications are the above-mentioned winning game and 3 rounds are 1 set, and the game is performed over multiple stages, it will restart from the beginning of the stage at the time of interruption (ie, the first of the first round) May be. In this case, it may be resumed from the beginning of the round at the time of interruption.

In S115, as shown in FIG. 32, the play control unit 31 of the game machine 10 (G011) displays a 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.
The player (P011) can select a game to be resumed immediately after the battle play is finished from both titles by selecting the single player title selection button 95a and the battle title selection button 95b.

The game system 1 will be described so as to accept selection of both titles from the player (P011).
There are the following two scenes to proceed to S115.
The first scene is a state in which the single player title and the battle title are different (S111: NO), and the play fee is charged for both titles (S11 of FIG. 14 for the single player title, S31a of FIG. 15 for the battle title or This is a case where the battle play is stopped due to the communication state (S52a in FIG. 17) (S112: YES).
In this case, since the single player title is interrupted by the start of the battle play, the player (P011) continues to have the right to play the single player title. The battle title is a state where the battle play is stopped due to the communication state. Here, the play right is a right that can be played until the play is terminated by normal termination. Therefore, when the battle play is stopped due to the communication state, the player (P011) continues to have the play right of 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 is configured so that a game to be resumed can be selected from both titles after the battle play is completed.

The second scene is a state in which the one-person title and the battle title are different (S111: NO), and the play fee is charged for both titles (S11 of FIG. 14 for the one-player title, S31a of FIG. 15 for the battle title or This is a case where S52a) in FIG. 17 is won and the battle play is won (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. As for the battle title, the player (P011) has the play right of the battle title continuously 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 is configured so that a game to be resumed can be selected 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 resume title selection screen 95. When it is determined that the one-person title selection button 95a is selected (S116: YES), the play control unit 31 proceeds to S116a. On the other hand, when it is determined that the battle title selection button 95b is selected (S116: NO). The process proceeds to 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 resume title selection screen 95 or the completion of play of the battle title ( S117c (NO described later): The play of a single title is resumed without charge. The battle title play ends when the battle title selection button 95b is selected on the resume title selection screen 95 (S116: NO) and the play ends.
This process is the same as S114 described above, and the play control unit 31 resumes the play without charge based on the play right of the one-person title, and resumes from the position when the play of the one-person 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. Note that the right to play a single title disappears when the play of the single 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 a case where the play process of the battle title is performed in 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, and on the other hand, 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 disappeared, so the play control unit 31 proceeds to S118 and resumes play. Exit.

In S117a, the play control unit 31 of the game machine 10 (G011) responds to the selection of the battle title selection button 95b on the resume title selection screen 95 (S116: NO), or the play of one player's title is completed. Depending on the situation, play of the battle title is started without charge. The latter one-player title is finished when the one-person title selection button 95a is selected on the resume title selection screen 95 (S116: YES) and the play is finished (S116b → S116c: NO).
Also in this case, 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 in order to start the battle play, the play start position of the battle title is the first of the play regardless of whether the play end is stopped or the normal end. (For example, 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. Note that the play right of the battle title disappears when the play of the battle title ends.

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 single-player title has already been played is a case where the single-player title play processing in S116b has been completed.
When the play control unit 31 of the game machine 10 (G011) determines that the play of one person's title has already ended (S117c: YES), the process proceeds to S118, and on the other hand, determines that this has not ended. In the case (S117c: NO), the process proceeds to S116a.
When the play of one title has already been completed (S117c: YES), the play control unit 31 proceeds to S118 and resumes play because the play rights for both titles have disappeared. The process ends.

  As described above, when the game machine 10 resumes the one-player play after the match play, the game machine 10 resumes from the position where the one-player play is interrupted to start the match play. For this reason, even if it is a case where the player P plays a battle | competition play, it can restart a play from the state before a battle | competition play.

(Second Embodiment)
Next, a second embodiment of the present invention will be described.
In the following description and drawings, parts having the same functions as those of the first embodiment described above are given the same reference numerals or the same reference numerals at the end (the last two digits), and overlapping explanations are appropriately given. Omitted.
In the present embodiment, in-store matching and inter-store matching processing are 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 according to 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 billing processing and player ID acquisition processing as in the first embodiment (see FIG. 14).
In S216, as shown in FIG. 34A, the matching control unit of the game machine 210 displays a matching type selection screen 281 on the display unit 14 and performs a matching type selection process.
The player P may select the in-store matching button 281a when desiring for in-store matching, and may select the inter-store matching button 281b when desiring to match between stores.

  When the in-store matching button 281a is selected (S216: YES), the matching control unit of the game machine 210 proceeds to S217, whereas when it is determined that the inter-store matching button 281b is selected (S216: NO), the process proceeds 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 in the first embodiment, so that one person's title is displayed. Selection and selection of a plurality of battle titles are accepted.
Thereafter, 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).

(Inter-store matching process)
In S218, the matching control unit of the game machine 210 starts an inter-store matching process.
As shown in FIG. 34B, the matching control unit of the game machine 210 displays a 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 a selection of a plurality of battle titles as in the first embodiment, but accepts selection of only one battle title.
Therefore, the player can select only one desired battle title in the battle title selection display unit 280b.
In the subsequent processing, matching processing is performed for one battle title selected by the battle title selection display unit 280b. Other processes are the same as those in the first embodiment. That is, in the first embodiment, matching processing is performed for a plurality of battle titles, whereas in this embodiment, matching processing is performed for one battle title.
For this reason, the matching control unit of the game machine 210 first determines whether or not in-store matching is established for one battle title (see S42 in FIG. 16), and when in-store matching is not established. The central server is requested to match between stores for one battle title (see S43 in FIG. 16).
The matching control unit of the central server performs a matching partner extraction process 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 (see the play control unit 31 in FIG. 2) of the game machine 210 starts a battle play with another game machine based on the result of the matching partner extraction process of the central server.

Thus, in this embodiment, in the case of in-store matching, matching processing is performed for a plurality of battle titles, while in the case of inter-store matching, matching processing is performed only for one battle title.
In the former case, the matching partner is limited to a game machine in the store (that is, a player in the same store), and therefore matching processing is performed for a plurality of battle titles as in the first embodiment. This is because the matching is easily established.
On the other hand, in the latter case, 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), and therefore has a sufficiently large population. For this reason, in the latter case, even if the matching process is performed for only one battle title, the matching is easily established.

For this reason, when a player desires an in-store battle, the possibility of a battle play is increased by selecting a plurality of battle titles. On the other hand, when a match play is desired for a desired title, the possibility of a match play is increased by selecting matching between stores.
Further, the central server only needs to perform the matching partner extraction process and the like for one title, so the load is low.

(Third embodiment)
Next, a third embodiment of the present invention will be described.
In the present embodiment, the point processing at the time of stop of 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 for explaining the 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 play of the battle play being stopped. 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.
The provisional points are calculated based on superiority or inferiority information at the time of play stop included in the play end information. The provisional points may be, for example, points given to normal winners, or the prorated points described in the first embodiment.

  The point management unit stores the player ID, temporary point information, and play stop information of the dominant player in association with each other in 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 replay of the battle play for which play has been stopped (a replay of the battle) has been started within the specified period.
As in the first embodiment, the point management unit performs matching processing between the stores of both players (see FIGS. 16 and 17 and the like), so it can be determined whether or not both players have rematched.
Further, the rematch between both players may be based on the store introduction process of the first embodiment.

In the rematch matching, the control unit of the game machine requests a rematch from the inferior player to the dominant player (see S50 in FIG. 17, FIG. 20B, etc.), and the communication state is the original battle play. If it is better than the time, the dominant play prevents the request from being rejected.
Further, the specified period can be set as appropriate according to the specifications of the system. 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 (against the battle play) has been started within the specified period (S303: YES), the process proceeds to S305, whereas if it is determined not to start ( (S303: NO), the process proceeds to S304.

In S304, the point management unit of the central server 350 converts the provisional points given to the dominant player into the normal points (main benefits) that are normal points. Thereby, when a rematch is not performed, the dominant player can acquire a provisional point as this point.
Here, the case where the rematch is not performed includes the case where the inferior player does not make a rematch request to the dominant player. For this reason, the system operator or the like can handle it as “the inferior player acknowledges that even if he replays, he cannot win the dominant player”. In addition, the inferior player does not subtract the possession points by the original battle play. Thereby, for the inferior player, there is no disadvantage due to the provision of the temporary points as the main points to the dominant player.

In S <b> 305, the point management unit of the central server 350 converts the provisional points to the present points (ordinary points) and gives them to the player who has won the rematch play in response to the successful 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 play end information transmitted by the game machine in response to the end of the rematch play.

Thereby, in the rematch, when the dominant player of the original battle play wins, this point is given to the dominant player as in S304.
On the other hand, in the rematch, when the dominant player of the original battle play is defeated, that is, when the inferior player of the original battle play wins, the temporary point is converted to this point (ordinary point) and the original battle play is performed. To inferior players. As a result, the tentative points are confiscated for the dominant player of the original battle play.

  Even if the inferior player of the original battle play is dissatisfied such as “the original battle play should have been able to acquire points if the communication state is good” by the process of S305, Can be resolved. Also, for the dominant player of the original competitive play, even if the temporary points are confiscated due to defeat in the rematch, it is a result of the ability game that was replayed in a good communication state, so it is unavoidable It turns out that. In addition, for both players, a rematch makes it possible to make provisional points into real points before the specified deadline.

  As described above, the game system according to the present embodiment gives temporary points to the dominant player when play is stopped, and converts the temporary points to the main points according to a rematch or the like. Can do.

(Fourth embodiment)
Next, a fourth embodiment of the present invention will be described.
In the present embodiment, the acceptance process for the next operation after each operation is changed from the first embodiment.
FIG. 37 is a diagram for explaining the advance input process according to the fourth embodiment.
FIG. 37 describes the processing of one game machine 410 during the battle play, but the frame exchange process between the game machines 410 during the battle play is the same as in the first embodiment.
As shown in FIG. 37A, 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 described in a simplified manner.

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 by the frame delay. Start. 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 two 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 on which a punch corresponding to the operation of the a button is drawn out from the character is displayed on the display unit.
・ Continue (arrow a42): F006, F007
It is determined whether or not the punch hits the enemy character. In addition, a play screen in which the arm of the character is extended and extended is displayed on the display unit.
・ Stiffness (arrow a43): F008, F009
The play screen is displayed on the display unit until the arm of the character returns from the fully extended state to the original posture.

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

FIG. 37A shows an example in which the operation of the b button (strong punch) is accepted (arrow a44) in the frame F008 that is undergoing the rigid processing as the preceding input.
As described above, after the a button operation (arrow a40), when the next button b operation (arrow a44) can be accepted, the mode in which the preceding input process is performed normally accepts the operation from frame F010 onward. It is faster than the form.
For this reason, the game system of this embodiment can reduce the play progress sluggish resulting from a frame delay by performing a prior | preceding input process, and can reduce a player's irritation feeling.

FIG. 37 (B) shows an example in which a frame delay occurs while the operation reflection process is stiff (arrow a46).
In this case, when the control unit performs both the preceding input process and the stop period input process of the first embodiment, the period during which the operation can be accepted includes the period during which the preceding input can be accepted, and the delay time L. It becomes the period. As a result, the operable period becomes longer, and it becomes easier for the player to perform an input operation of, for example, a complicated technique (for example, a multiple operation such as a combined operation (see FIG. 4A)). .

(Fifth embodiment)
Next, a fifth embodiment of the present invention will be described.
In the present embodiment, the in-store search process (see S41 in FIG. 16) performed before the matching between stores is changed from the first embodiment.
FIG. 38 is a diagram illustrating the in-store search time tables 527a and 527b according to the fifth embodiment.
As shown in FIG. 38A, the storage unit (see the storage unit 20 in FIG. 2) of the game machine of this embodiment 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 operation rate and the in-store search time in association with each other.

The operation rate is an operation rate of four game machines (refer to game machines 10 (G011 to G014) of the 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 operation rate becomes higher. That is, the in-store search time is 0 second when the operation rate is less than 30%, the in-store search time increases as the operation rate increases, and the in-store search time is 30 seconds when the operation rate is 80% or more.

For this reason, the control part (refer control part 30 of Drawing 2) of a game machine will perform in-store search processing for a longer time, so that the operation rate of the game machine in a store is high.
The reason is as follows.
The higher the operating rate of the game machine in the store, the greater the number of players playing on the game machine. Further, when the operation rate is high, the number of players who are present in the store but have not actually played is usually large.
For this reason, if the game machine newly accepts matching between stores (S14 in FIG. 14: NO → S18), even if in-store matching is not established in the store search process (S41 in FIG. 16) immediately after that, a little. There is a high possibility that matching will be requested from other game machines in the store.
In addition, if another player in the store strongly desires a match play, the player immediately confirms that another player has started accepting a play with a matching request on the game machine, so that another game There are also times when a machine accepts a play with a matching request.

Thus, when the operating rate of the game machine in the store is high, there is a high possibility that in-store matching will be established after a short time. For this reason, the game machine of this embodiment lengthens the time of in-store search processing when the operation rate is high, and thereafter, when in-store matching is not established, inter-store matching processing (S43 in FIG. 16). I am trying to migrate to.
On the other hand, when the operating rate of the game machine is low, there is a low possibility that in-store matching will not be established even if the in-store search processing time is extended. For this reason, when the operating rate of the game machine is low, the game machine of this embodiment does not perform the in-store search process or shortens the time, and promptly performs the inter-store matching process (S43 in FIG. 16). ).

  As described above, the game system according to the present embodiment uses the operating rate of the game machine in the store as information indicating the degree of ease of establishment of the in-store matching, so that the pre-migration to the inter-store matching is performed. In-store matching can be easily established.

Note that the information indicating the degree of ease of establishment of in-store matching is not limited to the operating rate of game machines in the store, and may be information indicating this degree.
As shown in the in-store search time table 527b of FIG. 37B, 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. And in the time zone when the number of players in the store is large and the time zone where the operating rate of the game machine is high, the in-store search time is set longer. 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 a time zone where the number of players in the store is small and a time zone where the operating rate of the game machine is low. This is because in-store matching is difficult to be established during this time period.

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

In addition, the presence or absence of in-store search processing (that is, the setting to perform in-store search processing or not to be set at all) is set according to the ease of establishment of in-store matching, rather than in a form that has a wide range of in-store search time. May be.
Further, for example, a store clerk or the like may set the in-store search time of the game machine or the presence or absence of the in-store search process each time.

(Sixth embodiment)
Next, a sixth embodiment of the present invention will be described.
In the present 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 a character combination table 621c, a team configuration storage unit 621d, and a standby team configuration storage unit 668 according to 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 a character C that the player P has selected for his / her operation in the battle play.
The enemy character is a character C that fights against one player. For this reason, in the one-player game, the selected character and the enemy character associated with the selected character battle each other.

As shown in FIG. 39B, each game machine 610 includes a team configuration storage unit 621d.
The team composition storage unit 621d stores the selected character, its battle order, and enemy characters.
That is, the game according to the present embodiment is a game in which a team is constituted by three selected characters selected by the player P.
39B 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 configuration storage unit 668 stores information of the game machine 610 that is waiting for a match. That is, the information of the game machine 610 that is playing a single player is stored after the central server 650 is requested to match between stores. The standby team configuration storage unit 668 stores store name, game machine ID, player ID, selected character, selected character order, and enemy character information in association with each other.

FIG. 40 is a flowchart of the inter-store matching process according to the sixth embodiment.
FIG. 41 is a diagram illustrating a display screen during the inter-store matching process according to the sixth embodiment.
In FIG. 40, detailed description is omitted, but in this process, after the charging process (see S11 in FIG. 14), the store matching process (S16 in FIG. 14: NO → S18) is selected. To do. Further, it is assumed that the single player title and the battle title are the same title.
The processing of S601 to S603 can be performed after the selection of one person title (see S14 in FIG. 14) until the inter-store matching is performed on the central server 650.

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

In the training mode, one selected character of the team of the player P and one enemy character controlled by the control unit face each other without change for a specified time (for example, 180 seconds). However, when the player P changes the team configuration, 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 team of the player P and the three enemy characters controlled by the control unit perform a winning game.
When accepting the mode selection, the control unit of game machine 610 proceeds to S602.

In S602, as shown in FIG. 41A, the control unit of the game machine 610 performs a character selection receiving 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 should just select three from these as the selection characters which comprise his team.
A character selection screen 681 in FIG. 41A is an example in which characters C3, C4, and C5 are selected.

In S603, as shown in FIG. 41B, the control unit of the game machine 610 performs the order selection receiving process by displaying the order selection screen 682 on the display unit.
The order selection screen 682 displays a button indicating the selected character selected in S602. The player P has only to select the character C in the order of battle.
The order selection screen 682 in FIG. 41B is an example in which 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. 39B is an example in which the team is configured by Ichiro (P011) who is the player P.

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

The control unit of the game machine 610 executes a one-player game with the team configuration set in S602 and S603. Moreover, the control part of the game machine 610 waits for matching between stores similarly to 1st Embodiment during one-player play (refer S44 of FIG. 16).
FIG. 41C shows a single-player screen 683 for single-player in the training mode.
In the training mode, the first (first player) character C3 of the characters C selected by Ichiro (P011) and the enemy character C13 controlled by the control unit face each other.
The control unit extracts the enemy character C13 by referring to the character combination table 612c (see FIG. 39A).

In the training mode, the enemy character C13 is not changed until Ichiro (P011) selects team change (S610: YES described later). That is, the control unit continues the battle between the characters C3 and C13 until the team is changed.
Therefore, Ichiro (P011) can select to cancel or continue the battle with the enemy character C13 at his / her will. Thereby, Ichiro (P011) can practice corresponding to the characteristic (attribute) of the enemy character C13. For example, if the enemy character C13 has a characteristic such as a throwing technique, Ichiro (P011) can practice throwing away.

The training mode is not limited to the form in which the enemy character moves. For example, the form in which the enemy character has stopped or a form in which the action and stop of the enemy character can be selected may be used. Even if the enemy character is stopped, Ichiro (P011) can practice the attack technique when, for example, the enemy character has characteristics that make it difficult to take a specific technique.
In addition, even in the case of a CPU battle, the control unit selects an enemy character based on the character combination table 621c when the character operated by Ichiro (P011) changes according to the stage, the progress of the round, and the like. It may be changed.

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 standby team configuration storage unit 668 (see FIG. 39C) receives the information included therein. ).
As a result, the standby team configuration storage unit 668 stores information such as the game machine ID, player ID, selected character, enemy character, and the like of the game machine 610 requesting the matching.
The control unit of the central server 650 performs matching processing between stores based on the standby team configuration storage unit 668.
The control unit of the central server 650 is the same as the matching character of the game machine 610 (G011), the one-player enemy character C13 of the game machine 610 (G011) and the character C selected by the other game machine 610. In some cases, match both. In other words, the control unit of the central server 650 determines that the one-player enemy character C13 of the game machine 610 (G011) is the same as the character C selected by the one-player play of the other game machine 610. Match.
In the example of the standby team configuration storage unit 668 of FIG. 39C, the control unit of the central server 650 is the same character C as the game machine 610 (G011) and the enemy character C13 of the game machine 610 (G011) playing alone. Is matched with the game machine 610 (G022) for which is selected.

  Note that the matching request in S604 does not need to include the enemy character information as long as the information on the selected character is 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). As in the first embodiment, the matching result information includes connection destination information of the matching game machine 610 and information indicating that matching is not established.

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

In S608a, the control unit of the game machine 610 (G011) executes an inter-store battle play process. In this process, as in the first embodiment, the battle play is started after the one-player play is interrupted (see S47 in FIG. 16 to S53 in FIG. 17).
Here, when the game machine 610 (G011) and the game machine 610 (G022) are matched as in the above example, the game machine 610 (G011) has the characters C3, C4, and C5 as the team configuration of the battle play. 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 by one-player play (see FIG. 41C) that plays against the enemy character C13, and continues to play against the character C13 in the inter-store play. become. For this reason, Ichiro (P001) can play against the character C13 as practice in the one-player play and can play against the character C13 in a sense like an actual battle in the store-to-store play.
Note that these 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 the character C3 who has played against the single player of the game machine 610 (G022) in the battle play.

  In addition, although illustration is abbreviate | omitted, after the battle | competition play between stores is complete | finished, it processes similarly to 1st Embodiment. That is, the control unit of the game machine 610 (G011) resumes the one-player play when, for example, winning the store-to-store battle play. When the training mode is selected in the single player play, the control unit maintains the team configuration 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 game has ended. The case where the one-player play is finished includes a case where a prescribed time in the training mode has elapsed, a case where a prescribed stage is cleared in a CPU battle, a case where a player is defeated in a CPU battle, and the like.
If the control unit of the game machine 610 (G011) determines that the one-player game has ended (S609: YES), the process proceeds to S611 to end the process, whereas if it determines that it has not ended. (S609: NO), it progresses to S610.

  In S610, the control unit of the game machine 610 (G011) determines whether or not a team configuration change has been accepted. Changing the team configuration means changing the team configuration selected in S602. If Ichiro (P011) is in a state where the one-player game has not ended (S609: NO), the team composition can be changed. For this reason, Ichiro (P011) can change the enemy character in the training mode. The change of the team configuration can be accepted, for example, by operating the start button.

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

  As described above, the game system according to the present embodiment can continue to battle against an enemy character that is playing in a single-player game. Thereby, the player can confirm the practice effect of one-player play, for example, by battle play. In addition, in the single-player training mode, the player can change the selected character within a specified time, and can also change the enemy character accordingly. Furthermore, in a case where a store-to-store battle is established during play in the single-player training mode, the player can perform a store-to-store battle without charge in addition to the training mode.

  As mentioned above, although embodiment of this invention was described, this invention is not limited to embodiment mentioned above, For example, various deformation | transformation and a change are possible like the deformation | transformation form etc. which are mentioned later, These are also It is within the technical scope of the present invention. In addition, the effects described in the embodiments are merely a list of the most preferable effects resulting from the present invention, and the effects of the present invention are not limited to those described in the embodiments. It should be noted that the above-described embodiment and modifications described later can be used in appropriate combination, but detailed description thereof is omitted.

(Deformation)
(1) In the embodiment, the inter-store communication (inter-game machine communication) at the time of the inter-store battle play is P2P, but is not limited thereto. This inter-store communication may be communication via a central server, for example.

(2) In the embodiment, an example in which the communication state relates to the state of the frame delay is shown, but the present invention is not limited to this. The communication state may relate to communication quality including, for example, lack of information and noise during information communication.

(3) In the embodiment, the example in which the communication state history storage unit is provided in the central server is shown, 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 a communication state at the time of matching between stores based on the communication state history storage unit.

(4) In the embodiment, in the case of starting the in-store or inter-store battle play, 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, it may be configured such that only one in-store matching is established, and when this is established, the in-store battle play is started regardless of the player's will. Similarly, only one matching between stores may be established, and when this is established, an inter-store play may be started regardless of the player's will.

(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. However, the present invention is not limited to this. As long as both game machines can communicate with each other in accordance with the matching determined by the central server, 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 in response to the establishment of matching, and based on this, both game machines may start communication with each other.

(6) Although the example which performs the process regarding a communication state was shown regarding communication between stores in embodiment, it is not limited to this. Regarding in-store communication, processing relating to the communication state 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.

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

Claims (11)

A game machine arranged in a store,
Communication with other game machines that are other game machines in other stores is possible without using a server,
With a control unit,
The controller is
A communication state in which a communication state display indicating a communication state of communication between game machines between the game machine and the other store game machine is displayed on the display unit in response to being matched with the other store game machine by the server. Display processing,
After the communication state display process, in response to accepting a matching confirmation operation in both the game machine and the other store game machine, to start playing a battle game;
A game machine characterized by The game machine according to claim 1,
There are multiple game consoles in the store,
The controller is
Displaying the communication status display between other game machines in the store and the other store game machines on a display unit;
A game machine characterized by In the game machine according to claim 1 or 2,
A communication state history storage unit for storing a history of communication state between at least one game machine in the store and the other store game machine;
The controller is
Displaying the communication status display between the other game machines in the store and the other store game machine as the communication status display of the game machine and the other store game machine based on the communication status history storage unit;
A game machine characterized by The game machine according to any one of claims 1 to 3,
The controller is
While the game is in progress, the server is requested to match the first game and the second game,
The communication status display between the first game matched by the server and the other store game machine and the communication status indication between the second game matched by the server Is displayed on the display unit,
A game machine characterized by The game machine according to any one of claims 1 to 4,
The controller is
Obtaining information on a communication state between the game machine and the plurality of other store game machines by sequentially communicating with the plurality of other store game machines in response to the power of the game machine being turned on;
A game machine characterized by The game machine according to any one of claims 1 to 5,
The controller is
Executing a prior input process for accepting an operation corresponding to a play state corresponding to a later time point from the current play state according to the communication state between game machines;
A game machine characterized by The game machine according to any one of claims 1 to 6,
The controller is
Executing a stop period input process for accepting an operation in a play stop period associated with a communication delay according to a communication state between game machines;
A game machine characterized by A game machine according to any one of claims 1 to 7,
Other store game machines that are other game machines of other stores,
A server having a control unit for matching the game machine and the other store game machine;
A game system comprising: The game system according to claim 8,
The server
A communication state history storage unit that stores a history of communication states between other game machines in the store and the other store game machines,
The control unit of the game machine
As the communication state display of the game machine and the other store game machine, a communication state display between the other game machine in the store and the other store game machine is displayed based on the communication state history storage unit of the server. about,
A game system characterized by In the game system according to claim 8 or 9,
The server
A communication state history storage unit for storing a communication state history between the game machine and the other store game machine;
Refer to the communication status history of the communication status history storage unit, and when the match play is possible, match the game machine and the other store game machine,
The control unit of the game machine
In response to the game machine and the other store game being matched, starting communication with the other store game machine, and displaying the communication state acquired by the started communication as the communication state display,
A game system characterized by The game system according to any one of claims 8 to 10,
The control unit of the game machine
In response to the game machine being turned on, by sequentially communicating with a plurality of other store game machines, to obtain a history of the communication state between the game machine and a plurality of other store game machines,
The control unit of the server is
Storing a communication state history acquired by the game machine in the communication state history storage unit;
A game system characterized by

Images