JP2011206447A - Server system and game machine - Google Patents

Abstract

PROBLEM TO BE SOLVED: To achieve such a game system that player's game play influences time release.SOLUTION: The order of character's time release is determined by a "time release battle" in which the player participates. At first, the player selects a desired candidate character out of a plurality of candidates of characters (candidate characters) shown to be released in a sustained manner, and belongs to a group of the selected candidate character. During an execution period of the time release battle, TR points (Time Release points) are acquired according to the player's play result (victory/defeat, type of the battle against person/CPU, etc.). After termination of the execution period, group points, which means, the sum of the TR points acquired by the players of the group, are calculated for each group, so as to determine the order of the candidate characters to be released in descending order of the group points of the corresponding group.

Description

  The present invention relates to a server system that is communicably connected to a game machine and manages player data of each player.

  In a commercial game device installed in a store such as a game center, a player can use a player character as a player character at a given time condition (whether a given operating time has been reached or at a given time). A so-called “time release” function is known, in which a new character is added (released) when the condition is satisfied (see, for example, Patent Document 1).

JP 2001-9162 A

  However, in the time release described above, the time-released character, its release time, the time condition for the release, etc. are determined by the game device seller (game maker) side, and there is no choice for the player. There was no. The present invention has been made in view of the above circumstances, and an object thereof is to realize a game system in which a game play of a player affects time release.

The first form for solving the above problem is
A server system that is communicably connected to a game machine and manages play data of each player (for example, the server system 2000 in FIG. 1),
Candidates (hereinafter collectively referred to as “usable bodies”) of characters, items, clothes, and game stages (hereinafter collectively referred to as “usable bodies”) that can be used by the player in the game machine as time releases. Presenting means (for example, the display screens of FIGS. 16 and 17, the time release battle management unit 512 of FIG. 25, step C7 of FIG. 37),
Group configuration means for associating each player with each of the plurality of usable candidates and forming a group of each usable candidate (for example, time release battle management unit 512 in FIG. 25, steps C13 and C23 in FIG. 37). When,
Aggregating means (for example, the time release battle management unit 512 in FIG. 25, step C43 in FIG. 38) that aggregates the given points calculated using the game results of the game machine of the player for each group;
A determination means (for example, the time release battle management unit 512 in FIG. 25, step C45 in FIG. 38) for determining available candidates for time release based on the points counted for each group;
Time release control means (for example, time release battle management unit 512 in FIG. 25, step C49 in FIG. 38) for time releasing the usable candidates determined by the determination means in the game machine;
Is a server system.

  According to the first aspect, the usable candidates to be time-released are groups of players in which a given point calculated using the play result of the player's game machine is associated with each usable candidate. Each point is determined based on the total points. That is, it is possible to realize a completely new time release function in which usable candidates to be time released are determined according to the play result of the player. Furthermore, in addition to the game play on the game machine, the player can be provided with another enjoyment of being able to be involved in determining the time-released candidate candidates.

As a second form, a server system of the first form,
The determining means determines the priorities of usable candidates to be time-released based on points counted for each group,
The time release control means shifts the time according to the priority determined by the determination means, and causes the usable candidates to be time released;
A server system may be configured.

  According to the second aspect, the priority order of the usable candidates to be time released is determined based on the points totaled for each group. That is, the order in which the presented usable candidates are time-released is determined by the game play of the player in the game machine.

As a third form, the server system of the first form,
The determining means determines a predetermined number of usable candidates to be time released,
The presenting means adds a new usable candidate to the usable candidate that has not been selected by the determining means and re-presents,
The group composition unit, the aggregation unit, the determination unit, and the time release control unit are configured to perform group release, point aggregation for each group, and time release use for the re-presented plurality of usable candidates. Re-execution of possible candidate determination and time release control of the determined usable candidate,
A server system may be configured.

  According to the third aspect, a predetermined number of usable candidates are time-released from the plurality of presented usable candidates. For the usable candidates that have not been time-released, new usable candidates are added, and a player is associated with each other to form a group. The points based on the player's play results are aggregated for each group. Then, a predetermined number of usable candidates to be time released are determined. In other words, not all the available candidates presented are time released, but some usable candidates with many tabulated points are time released, for example.

As a fourth mode, the server system according to any one of the first to third modes,
The group forming means selects a usable candidate to be associated with the player according to the selection operation of each player to form a group.
A server system may be configured.

  According to the fourth aspect, according to the selection operation of each player, the usable candidates associated with the player are selected to form a group. That is, the player can select a usable candidate to which the player is associated. This allows the player to select, for example, a usable candidate that he wants to release time.

As a fifth form, the server system of the fourth form,
The apparatus further includes selection signal receiving means (for example, the communication unit 430 in FIG. 25 and steps C9 and C19 in FIG. 37) for receiving a selection signal for selecting an available candidate to be associated with the player from the player terminal of each player.
The group constituting unit selects a usable candidate based on the selection signal received by the selection signal receiving unit, and constitutes a group.
A server system may be configured.

  According to the fifth embodiment, the selection of usable candidates by the player is made at the player terminal of each player.

As a sixth form, the server system of the fourth or fifth form,
The counting means counts the points during a given counting period for each group, and associates the players associated with the usable candidates by the group forming means during the counting period. The point until it is made is also subject to aggregation.
A server system may be configured.

  According to the sixth embodiment, the points for each group of usable candidates are aggregated during a given aggregation period, but are associated with the usable candidates in the middle of the aggregation period. For the assigned players, the points until they are associated are also counted. That is, the association between the player and the usable candidate can be performed at any time during the counting period.

As a seventh aspect, the server system according to any one of the first to sixth aspects,
The counting means totals the points during a given counting period for each group,
Notifying means for notifying the progress of counting points for each group during the counting period counted by the counting means (for example, the display screens in FIGS. 11, 12, 18, 19 and the time release battle management in FIG. 25) Part 512),
A server system may be configured.

  According to the seventh aspect, the points for each group of usable candidates are summed up during the given summing period, and the progress of the summing points is reported. The player can know, for example, the superiority / inferiority of the usable candidate with which the player is associated by the progress of the notified total points, and, in the case of inferiority, the usable candidate object. The player can be prompted to play the game, such as playing more games to increase the points of the group.

As an eighth aspect, the server system according to any one of the first to seventh aspects,
The time release control means distributes the data of usable candidates determined by the determining means to the game machine, thereby making the usable candidate object usable in the game machine.
A server system may be configured.

Moreover, as another form, it is a game machine connected to the server system of the eighth form (for example, the arcade game apparatus 1000 of FIG. 1),
Receiving means (for example, the communication unit 150 in FIG. 20, step A41 in FIG. 35) for receiving the data of the usable candidates from the server system;
Based on the data received by the receiving means, usable body providing means for providing a new usable body (for example, the game calculation unit 210 in FIG. 20, step A33 in FIG. 35);
It is good also as comprising the game machine provided with.

  According to the eighth aspect and the like, the server system distributes the data of the usable candidates determined to be time-released to the game machine, and the game machine connected to be communicable with the server system uses the server system. Based on the received usable candidate data, a new usable candidate can be provided.

As a ninth aspect, the server system according to any one of the first to seventh aspects,
The game machine includes a storage unit that stores data of the usable candidates as an inactive state,
The time release control means changes the data of the usable candidates determined by the determination means to the active state among the usable candidate data stored in the storage unit of the game machine. Making a usable candidate a usable body in the game machine;
A server system may be configured.

Moreover, as another form, it is the game machine connected so that communication with the server system of the 9th form was possible,
Storage means for storing the usable candidate data as an inactive state;
Receiving means for receiving an instruction signal of an available candidate to be activated from the server system;
Activating means for making a new usable body by activating the data of the usable candidate stored in the storage means according to the instruction signal received by the receiving means;
It is good also as comprising the game machine provided with.

  According to the ninth aspect, the game machine that is communicably connected to the server system stores the data of usable candidates as an inactive state, and is received from the communicably connected server system. Then, according to the instruction signal of the usable candidate to be activated, the stored usable candidate data is activated to make a new usable object.

The block diagram of a game system. An example of the appearance of an arcade game device. An example of a game screen in an arcade game device. An example of the appearance of a player terminal. Overview of time release. Explanatory drawing of grouping of players. Explanatory drawing of acquisition of TR points by game play. Explanatory drawing of determination of time release order. Explanatory drawing of the implementation schedule of a time release game. The example of a display screen after completion | finish of the game in a commercial game device. The example of a power distribution screen display in an arcade game device. The example of a personal ranking screen display in an arcade game device. The example of a menu page display in a player terminal. The example of a display of the time release game page in a player terminal. The example of a display of the time release game page in a player terminal. The example of a display of the candidate character list page in a player terminal. The example of a display of the candidate character list page in a player terminal. A display example of a TR battle status page on a player terminal. The example of a display of the personal ranking page in a player terminal. 2 is a functional configuration example of an arcade game device. The data structural example of TR point calculation table. Data structure example of TR battle status data. The data structural example of power distribution data. Data configuration example of personal ranking data. Example of functional configuration of server system. The data structure example of card DB. The data structural example of TR battle participation history data. The data structural example of TR point acquisition history data. The data structural example of TR battle implementation DB. Data configuration example of participation status data. The data structural example of TR point total data. Data configuration example of intermediate summary data. Data structure example of release order data. The data structural example of registration player data. The flowchart of a game process. The flowchart of a game management process. The flowchart of a time release battle management process. 37 is a continuation of the flowchart of FIG.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings. In the following, a game system in which a competitive fighting game is executed in an arcade game device will be described, but embodiments to which the present invention can be applied are not limited thereto.

[System configuration]
FIG. 1 is an overall configuration diagram of a game system 1 in the present embodiment. As shown in FIG. 1, the game system 1 includes a plurality of arcade game apparatuses 1000, a server system 2000, and a player terminal 3000 that are connected to each other via a communication line N1 so as to be able to transmit and receive data. . Here, the communication line N1 is a communication path through which data can be transmitted and received, and includes the Internet, a local network (LAN), a dedicated line network, other line networks, and a relay device that mediates communication.

[Professional game device]
The arcade game apparatus 1000 is installed in a store such as a game center. In addition, the arcade game apparatuses 1000 in the same store are connected to be communicable with each other via a communication line N2 that is an in-store LAN, and a battle game between players in the store is possible.

  FIG. 2 is an example of the external appearance of the arcade game apparatus 1000. As shown in FIG. 2, the arcade game apparatus 1000 can be played by two players at the same time. For the two players, a display 1002 that displays a game screen, a speaker 1004 that outputs game sound, and the like. A joystick 1006 and a push button 1008 for inputting a game operation, a coin counter 1010 for inserting coins (coins) as a game consideration, and a card reader / writer for reading / writing data to / from the game card 10 1012. A control unit 1020 is built in the housing.

  The control unit 1020 includes various microprocessors such as a CPU (Central Processing Unit), GPU (Graphics Processing Unit), and DSP (Digital Signal Processor), ASIC (Application Specific Integrated Circuit), VRAM and RAM, flash memory 1024, and the like. In addition to the IC memory, a so-called I / F such as a communication device 1026 for connecting to the communication line N1, a driver circuit for the display 1002, an amplifier circuit for mainly playing audio to the speaker 1004, and a signal input / output circuit for the joystick 1006 and the push button 1008 A circuit (interface circuit) is mounted. Each element mounted on the control unit 1020 is electrically connected via a bus circuit so that data can be read and written and signals can be transmitted and received. The flash memory 1024 stores programs and various setting data necessary for executing various arithmetic processes related to game play.

  When the control unit 1020 detects the insertion of a predetermined number of coins into the coin counter 1010, the control unit 1020 reads a program and data from the flash memory 1024 and temporarily stores them in an IC memory to be mounted. Then, the read program is executed to control the progress of the game, a game image is generated and displayed on the display 1002, and a game sound is generated and emitted from the speaker 1004. The player plays the game by operating the joystick 1006 and the push button 1008 while listening to the game sound emitted from the speaker 1004 while watching the game screen displayed on the display 1002.

  Further, in the game system 1 of the present embodiment, the player can store the player character data and the like in the server system 2000 by owning the game card 10 and registering it in the game system 1. In any arcade game apparatus 1000, a game using his / her player character can be enjoyed. Here, the game card 10 is provided to the player by sales or the like, and is realized by, for example, an IC card incorporating an IC chip in which a unique card ID is stored.

[Game Overview]
In the arcade game apparatus 1000, a “matching fighting game” is performed. In this battle-type fighting game, a “personal battle” for playing against other players in the same store and a “CPU battle” for playing against CPU characters are possible.

  FIG. 3 is an example of a game screen displayed on the display 1002. In the game, an object such as a floor is arranged in a virtual three-dimensional space to form a game space. In this game space, a player character 2 and a battle character 4 are arranged, and a virtual character is set so that both characters are within the field of view. The camera is set up. And a game screen is produced | generated by combining the information display of the physical strength gauge 6 of each character, the remaining time 8 of a battle, etc. with the game space image based on this virtual camera.

[Server system]
The server system 2000 is installed and managed on the operating system (game maker) side of the game system 1 and is configured using a known server computer. The server system 2000 mainly functions as (1) a game server for managing game execution in the game system 1 and (2) a website for providing services linked to the game executed in the game system 1 It functions as a website server that publishes and manages on the Internet.

[Player terminal]
The player terminal 3000 is owned by the player, and is realized by, for example, a mobile phone, a portable game device, a personal computer, a UMPC (Ultra-Mobile Personal Computer), a PDA (Personal Digital Assistant) or the like. Further, the player terminal 3000 has a web browser function, and can communicate with the server system 2000 via the base station 4010 and the communication carrier server 4000 to browse a website managed by the server system 2000. is there.

  FIG. 4 is an appearance example of a mobile phone that is an example of the player terminal 3000. As shown in FIG. 4, the mobile phone includes a flip-flop type or slide type housing, a speaker 3004 and a microphone 3006 for calling, a dial key 3008 and a direction key 3010 used for input operations such as a dial number, And a display 3002 for displaying an image of the input dial number or the like. In addition, a control unit 3030 equipped with a wireless communication module 3032 that realizes wireless communication with the communication line N1 and the base station 4010 and a battery (not shown) are built in the housing, and the player is controlled by the control unit 3030. Terminal 3000 functions as a telephone by communicating wirelessly with base station 4010.

  In addition, the player terminal 3000 includes a memory card slot 3022 in which the memory card 3020 can be freely attached and removed to read / write information, and the control unit 3030 can read application programs and data stored in the memory card 3020.

[principle]
(A) Time Release The game system 1 of the present embodiment has a so-called “time release” function in which characters that can be used as player characters are sequentially added as time passes.

  FIG. 5 is a diagram for explaining the outline of time release. In the figure, the vertical direction is the time axis. First, at the start of operation of the arcade game apparatus 1000, the existing characters 1, 2,... Can be used as player characters. Thereafter, when a predetermined date and time (for example, one month after the operation start date) is reached, a new character A is time-released and added to the usable character as a player character. That is, after this, the existing characters 1, 2,... And the additional character A can be used as player characters.

  Thereafter, when a predetermined date and time (for example, two months after the operation start date) is reached, a new character B is time-released and added to the usable character as a player character. That is, after this, the existing characters 1, 2,... And the additional characters A and B can be used as player characters.

(B) Time Release Battle In the present embodiment, the order in which the characters are time released (time release order) is determined by the “time release battle” in which the player participates.

  Specifically, first, as shown in FIG. 6, a plurality of character candidates (candidate characters) scheduled to be time-released are presented to the player. The player selects a candidate character for which time release is desired from among these candidate characters (usable candidates). Then, the player belongs to the “group (power)” of the selected candidate character. In this way, a plurality of groups that are a set of players who have selected each candidate character are formed. In FIG. 6, four candidate characters A to D are presented, and groups A to D corresponding to the respective candidate characters A to D are formed.

  Then, as shown in FIG. 7, when the player plays a game on the arcade game apparatus 1000, “TR points” corresponding to the play result (win / loss, type of interpersonal / CPU battle, etc.) are acquired. The This TR point is added to the “group point” of the group to which the player belongs. That is, the group point of each group is the total of the TR points acquired by the players belonging to the group through game play.

  Finally, as shown in FIG. 8, the time release order of the candidate characters is determined based on the group points of each group. That is, the order of time release of the corresponding candidate characters is in the order of increasing group points. In FIG. 8, there are many group points in the order of groups B, D, A, and C. Therefore, the time release order is the order of candidate characters B, D, A, and C.

(C) Implementation Schedule FIG. 9 is a diagram for explaining an implementation schedule (procedure) in order of time release. In the figure, the right direction is the time axis.

  First, the player is notified of the candidate characters to be time released and the implementation period (holding period) of the time release battle. For example, the notice is displayed on a website of the game viewed on the player terminal 3000, or a predetermined notice screen is displayed when a game is not played on the arcade game apparatus 1000. This is done by displaying.

  After this notification, the player can participate in the time release battle by selecting one candidate character from the presented candidate characters. However, the player needs to own the game card 10 and register it in the game system 1 in order to participate in the time release battle. The announcement date is set, for example, about several to a dozen days before the start date of the time release battle. In FIG. 9, the announcement date is set two days before the start date of the time release battle.

  Subsequently, in the time release battle implementation period, TR points based on the play results are obtained for each player. In the middle of the implementation period, the player can select a candidate character and participate in the time release battle. However, once selected, the candidate character cannot be changed.

  In addition, during the implementation period of the time release game, several group points are counted and the results of the intermediate counting are announced. This intermediate count result is announced by, for example, displaying a predetermined result screen on the arcade game device 1000 after the game play is completed, or displaying a predetermined result on the game website viewed on the player terminal 3000. This is done by displaying the page.

  Moreover, the implementation period of the time release game is set to, for example, about one week to one month. In FIG. 9, the implementation period of the time release game is set to 14 days.

  When the time release battle implementation period ends, the release order of the candidate characters is determined by the group points of each group acquired during the implementation period. Thereafter, candidate characters are released in a predetermined release order on a predetermined release date. In FIG. 9, four time release dates are defined. In other words, the first time release date is determined three days after the end date of the time release game, and the second to fourth time release dates are determined ten days, twenty days and thirty days after the first release, respectively. It has been.

[Display screen example]
In the implementation period of the time release game, after the game on the arcade game apparatus 1000 is finished, the player can see the TR points acquired by this play and the current situation of the time release game.

  FIG. 10 is a diagram illustrating an example of a display screen after the game is over in the arcade game apparatus 1000. As shown in FIG. 10, TR points acquired by the game play are displayed on the game screen after the game ends. Further, by performing an operation designated on this game screen (pressing a predetermined button in FIG. 10), “power distribution” that is a group point acquisition status for each group and “individual ranking” based on acquired TR points. You can also see

  FIG. 11 is a diagram illustrating an example of a power distribution screen. On the power distribution screen, the power distribution of each group is displayed as a pie chart showing the ratio of the group points of each group to the whole by the fan-shaped area. The group point itself is not displayed. This power distribution may be displayed not as a pie chart but as a bar chart, for example. In this case, the ratio (percentage) of the group point of each group is displayed as the length (height) of the bar.

  FIG. 12 is a diagram illustrating an example of the personal ranking screen. On the personal ranking screen, the national ranking and the regional ranking of the registered area of the player are displayed. In each ranking, among the players participating in the time release game, a list of player names and affiliation groups is displayed for a predetermined number of players (for example, 30 players) who have the highest total TR points in the current time release game. The

  In addition, the player participates in the time release game using the player terminal 3000 owned by the player. Specifically, first, when accessing the website of the fighting fighting game, a top page as shown in FIG. 4 is displayed. On the top page, links to each page of “login” and “new registration” are set. On the “new registration” page, a predetermined registration operation for inputting a player name, a password, an owned card ID, and the like is performed.

  Further, when a predetermined login operation for inputting a registered player name and password is performed on the “login” page, a “menu” page shown in FIG. 13 is displayed. As shown in FIG. 13, in the “menu” page, as a service that can be received by the registered player, links of pages of “customization of own character” and “time release battle” are set.

  On the “custom character customization” page, by consuming game points, it is possible to customize the appearance, clothes, and determined pose of the self character registered in the game card 10. In the arcade game apparatus 1000, the customized player character can be used. Of the usable characters prepared in the arcade game apparatus 1000, the character used in the game play is registered in the game card 10 as the “own character”.

  In addition, in the “time release battle” page, if today is before the time release battle implementation period, as shown in FIG. 14, a message indicating that it is before the time release battle implementation period is displayed, A link to the “candidate character list” page is set. If today is within the time release battle implementation period, a message indicating that it is within the time release battle implementation period is displayed as shown in FIG. 15, and “list of candidate characters”, “ Links to each page of “Current Status of TR Battle” are set.

  As shown in FIG. 16, the “list of candidate characters” page displays images and brief explanations for each candidate character in the time release battle, and also has a link to the “select” page. ing. The player can participate in the time release battle by selecting a link to the “selection” page of a desired candidate character and confirming the selection of the candidate character on the “selection” page.

  However, the selected candidate character cannot be changed. For this reason, when the player has already participated, a “candidate character list” page as shown in FIG. 17 is displayed. In this case, the link to the “selection” page of each candidate character is invalid.

  Also, in the “TR war situation” page, as shown in FIG. 18, the acquisition status of group points for each group corresponding to each candidate character, as in the power distribution screen (see FIG. 11) in the arcade game apparatus 1000. Is a pie chart showing the ratio of group points of each group to the whole.

  In addition, a link to a “personal ranking” page is set on the “TR battle status” page. On the “personal ranking” page, as shown in FIG. 19, the national ranking and the regional ranking of the player's registered area are displayed, as in the personal ranking screen (see FIG. 12) in the arcade game apparatus 1000.

[Function configuration]
(A) arcade game device 1000
FIG. 20 is a block diagram showing a functional configuration of the arcade game apparatus 1000. According to FIG. 2, the arcade game apparatus 1000 functionally includes an operation input unit 110, a card read / write unit 120, a processing unit 200, an image display unit 130, an audio output unit 140, and a communication unit 150. And a storage unit 300.

  The operation input unit 110 receives an operation instruction input from the player and outputs an operation signal corresponding to the operation to the processing unit 200. This function is realized by, for example, a button switch, lever, dial, mouse, keyboard, various sensors, and the like. In FIG. 2, the joystick 1006 and the push button 1008 correspond to this.

  The card read / write unit 120 reads out data such as a card ID recorded on the inserted game card 10 and outputs the data to the processing unit 200. In addition, according to an instruction from the processing unit 200, the card reading / writing unit 120 Write. In FIG. 2, the card reader / writer 1012 corresponds to this.

  The processing unit 200 performs various arithmetic processes such as overall control of the arcade game apparatus 1000, game progress, and image generation. This function is realized by, for example, an arithmetic device such as a CPU (CISC type, RISC type), ASIC (gate array, etc.) or a control program thereof. In FIG. 2, a microprocessor or the like mounted on the control unit 1020 corresponds to this. Further, the processing unit 200 is mainly viewed from a given viewpoint such as a virtual camera based on a game calculation unit 210 that performs calculation processing related to the execution of the game and various data obtained by the processing of the game calculation unit 210. The image generation unit 220 generates an image in the virtual three-dimensional space (game space), and the sound generation unit 230 generates a game sound such as a sound effect or BGM.

  The game calculation unit 210 executes various game processes based on operation signals input from the operation input unit 110, programs and data read from the storage unit 300, and the like. As game processing, for example, processing for arranging various objects in a virtual three-dimensional space and setting a game space, control of a player character based on an operation signal from the operation input unit 110, hit cross determination of an object (hit check) And control of the viewpoint (virtual camera).

  In addition, the game calculation unit 210 performs a game process according to the game program 310. Specifically, when the game card 10 is inserted into the apparatus, the server system 2000 is requested to perform card authentication together with the card ID of the game card 10 read by the card read / write unit 120. Then, the play data transmitted from the server system 2000 in response to this request is received.

  Further, according to the operation instruction of the player input from the operation input unit 110, the battle type (CPU battle / player battle) is determined and the opponent is determined.

  Next, a character that can be used as a player character is presented to the player, and a character to be used as a player character is determined in accordance with an instruction from the player input from the operation input unit 110. The usable characters presented here are existing characters prepared in advance and additional characters added by time release. When the game card 10 is present, the character designated as the player character in the received play data is presented as a customized character based on the customization data included in the play data.

  Here, usable character data is stored as a usable character data group 350. The usable character data group 350 includes character data 351 of each existing character prepared in advance and character data 352 of each additional character released in time. Each character data 351 and 352 includes model data, texture data, motion data, ability parameters, and the like, together with a character ID for identifying the character.

  Then, the battle process with the determined opponent is started. When the match is over, the game calculation unit 210 updates the play data based on the match result when the game card 10 is present. Then, the updated play data is transmitted to the server system 2000 together with the card ID.

  Furthermore, when there is a game card 10 and it is within the implementation period of the time release battle, the TR points that the player acquires are calculated according to the TR point calculation table 330 based on the battle results. Then, the calculated acquired TR points are transmitted to the server system 2000 together with the updated play data. The acquired TR points are calculated regardless of whether or not the player participates in the time release battle.

  FIG. 21 is a diagram illustrating an example of a data configuration of the TR point calculation table 330. According to FIG. 21, the TR point calculation table 330 stores the acquired TR points 332 in association with the respective calculation conditions 331. The calculation condition 331 is a condition related to the play result, and includes victory and defeat and a battle type (personal battle / CPU battle).

  Subsequently, the game calculation unit 210 causes the image display unit 130 to display the calculated acquired TR points, for example, as illustrated in FIG. Further, according to the operation instruction of the player, the status of the time release battle based on the TR battle current status data 340 is displayed on the image display unit 130 as shown in FIGS. 11 and 12, for example.

  FIG. 22 is a diagram illustrating an example of the data configuration of the TR battle status data 340. The TR battle status data 340 is data distributed from the server system 2000. As shown in FIG. 22, the total date 341 indicating the current situation, the power distribution data 342, and the personal ranking data, as shown in FIG. 343.

  FIG. 23 is a diagram illustrating an example of a data configuration of the force distribution data 342. According to FIG. 23, the power distribution data 342 stores each candidate character 342a in association with the group point acquisition ratio 342b of the corresponding group. The acquisition ratio 342b represents the ratio of the group points of the corresponding group to the group points of all the groups as a percentage.

  FIG. 24 is a diagram showing an example of the data structure of the personal ranking data 343. As shown in FIG. According to FIG. 24, the personal ranking data 343 includes national ranking data 344 and regional ranking data 345 for each of a plurality of regions into which the whole country is divided. The national ranking data 344 stores the player name 344b, the selected candidate character 344c, and the registered area 344d in association with each rank 344a. The regional ranking data 345 stores the player name 345c and the selected candidate character 345d in association with each of the rankings 345b together with the corresponding regional name 345a.

  Referring back to FIG. 20, the image generation unit 220 generates a game image (3DCG image) for displaying the game screen based on the calculation result by the game calculation unit 210, and sends the image signal of the generated image to the image display unit 130. Output.

  Based on the image signal from the image generation unit 220, the image display unit 130 displays the game screen while redrawing the screen of one frame every 1/60 seconds, for example. This function is realized by hardware such as CRT, LCD, ELD, PDP, and HMD. In FIG. 2, the display 1002 corresponds to this.

  The sound generation unit 230 generates game sounds such as sound effects and BGM used during the game, and outputs sound signals of the generated game sounds to the sound output unit 140.

  The sound output unit 140 outputs game sounds such as BGM and sound effects based on the sound signal from the sound generation unit 230. This function is realized by, for example, a speaker. In FIG. 2, the speaker 1004 corresponds to this.

  The storage unit 300 stores a system program for realizing various functions for causing the processing unit 200 to control the arcade game device 1000 in an integrated manner, a program and data necessary for executing the game, and the like. Used as a work area of the processing unit 200, temporarily stores calculation results executed by the processing unit 200 according to various programs, input data input from the operation input unit 110, and the like. This function is realized by, for example, various IC memories, hard disks, CD-ROMs, DVDs, MOs, RAMs, VRAMs, and the like. In FIG. 2, the IC memory such as the flash memory 1024 mounted on the control unit 1020 corresponds to this. In the present embodiment, a game program 310 is stored in the storage unit 300 as a program, and game space setting data 320, TR point calculation table 330, TR battle status data 340, and usable characters are stored as data. A data group 350 is stored.

(B) Server system 2000
FIG. 25 is a block diagram illustrating a functional configuration of the server system 2000. According to FIG. 25, the server system 2000 is functionally configured to include an operation unit 410, a processing unit 500, a display unit 420, a communication unit 430, and a storage unit 600.

  The operation unit 410 receives an operation instruction from the administrator of the server system 2000 and outputs an operation signal corresponding to the operation to the processing unit 500. This function is realized by, for example, a button switch, lever, dial, mouse, keyboard, touch panel, various sensors, and the like.

  The processing unit 500 includes a program and data stored in the storage unit 600, an operation signal input from the operation unit 410, data received from an external device (mainly, the arcade game device 1000) via the communication unit 430, and the like. Based on the above, overall control of the server system 2000 is performed. This function is realized by, for example, an arithmetic device such as a CPU (CISC type, RISC type), ASIC (gate array, etc.) or a control program thereof. In the present embodiment, the processing unit 500 includes a game management unit 510 and a website management unit 520.

  The game management unit 510 includes a time release battle management unit 512 and manages a game in the game system 1. Specifically, the game management unit 510 manages data of a player who has registered the game card 10 using the card DB 620.

  FIG. 26 is a diagram illustrating an example of a data configuration of the card DB 620. As illustrated in FIG. According to FIG. 26, the card DB 620 is a set of card data for each game card 10, and each card data is owned as the card ID 621 of the corresponding game card 10 and the data of the owning player of the game card 10. The player ID 622a, owned player name 622b, registration area 623, play data 624, play history data 625, TR battle participation history data 626, and TR point acquisition history data 627 are stored.

  The play data 624 includes own character data 624a, possessed items 624b, and retained virtual money 624c. The player character data 624a is a character ID of a character (player character) that the player has used as a player character among the available characters prepared in the arcade game apparatus 1000, and the player character data 624a. Includes customization data. The personal character is customized by accessing the game website on the player terminal 3000.

  FIG. 27 is a diagram illustrating an example of the data configuration of the TR battle participation history data 626. The TR battle participation history data 626 is a history of time release battles that the player has participated so far. According to FIG. 27, the time release battle ID 626a and the selected candidate character 626b for each of the time release battles that have participated. And the participation date 626c are stored in association with each other.

FIG. 28 is a diagram illustrating an example of the data configuration of the TR point acquisition history data 627.
The TR point acquisition history data 627 is a history of TR points that the player has acquired so far. According to FIG. 28, the acquisition date 627a, the acquired store 627b, and the acquisition for each TR point acquisition. Stored in association with the TR point 627c.

  TR points are earned within the time release battle period, regardless of whether or not they participate in the time release battle. Then, in the final aggregation of group points performed after the end of the implementation period, the acquired TR points of the players participating in the time release battle are aggregated. In other words, for example, all TR points acquired within the implementation period are counted regardless of when they participate in the time release battle, such as before the implementation period or at the end of the implementation period.

  When the card authentication is requested from the arcade game apparatus 1000, the game management unit 510 refers to the card DB 620 based on the card ID received together with the request, and is the game card 10 that is properly registered. Determine whether or not. Then, if it is confirmed that the registration is regular, the corresponding play data is transmitted to the arcade game device 1000.

  When the play data is received from the arcade game apparatus 1000, the game card 10 is specified from the received card ID, the play data 624 of the corresponding card DB 620 is updated, and the play history data 625 is updated.

  The time release battle management unit 512 manages the execution of the time release battle in the game system 1. Here, data on the time release battle to be executed is stored as the TR battle execution DB 650.

  FIG. 29 is a diagram illustrating an example of a data configuration of the TR battle execution DB 650. As illustrated in FIG. The TR battle execution DB 650 is a set of TR battle execution data for each time release battle. According to FIG. 29, each TR battle execution data includes the time release battle ID 651 of the corresponding time release battle and the execution schedule data 652. , Participation status data 653, TR point total data 654, release candidate character ID 657, and release order data 658 are stored. Among these data in the TR battle execution data, the execution schedule data 652 and the release candidate character ID 657 are set before the execution of the time release battle, and the participation situation data 653 and the TR point total data 654 are being executed in the time release battle. The release order data 658 is set after the execution of the time release battle.

  The execution schedule data 652 stores a notification date and time 652a, an execution period 652b, an intermediate tabulation date 652c in the execution period, and a candidate character scheduled release date 652d.

  FIG. 30 is a diagram illustrating an example of a data configuration of the participation status data 653. According to FIG. 30, the participation situation data 653 stores, for each candidate character 653a, the player ID 653b of the corresponding group and the participation date 653c in association with each other.

  FIG. 31 is a diagram showing an example of the data configuration of the TR point total data 654. As shown in FIG. The TR point total data 654 includes intermediate total data 655 generated for each intermediate total, and final total data 656 generated by the final total. The intermediate tabulation data 655 and the final tabulation data 656 have the same configuration, and as shown in FIG. 32, group points of corresponding groups are stored for each candidate character 655c for each region 655b divided into the whole country, with the tabulation date 655a. is doing.

  FIG. 33 is a diagram illustrating an example of a data configuration of the release order data 658. As illustrated in FIG. According to FIG. 33, the release order data 658 stores candidate characters 658b in association with the release orders 658a.

  First, the time release battle management unit 512 sets an execution schedule according to the operation instruction of the administrator input from the operation unit 410. That is, a time release candidate character, a time release battle notification date, a time release battle implementation period, an intermediate date for the implementation period, a candidate character release date, and the like are set.

  Then, when the notification date determined in the implementation schedule comes, the notification process is started. In other words, the candidate characters and time release battle implementation period determined in the implementation schedule are posted on the website managed by the website management unit 520, or the corresponding data is distributed to the arcade game device 1000. Display.

  Also, participation acceptance by the player is started. Upon receiving a time release battle participation request from the player terminal 3000, the requested player is identified, and the identified player belongs to a group corresponding to the candidate character received together with the request and participates in the time release battle. Let

  During the time release battle period, when the acquired TR points transmitted together with the play data are received from the arcade game apparatus 1000, the game card 10 and the player are identified from the received card ID, and the identified player is identified. As the acquired TR points, the TR point acquisition history data 627 of the corresponding card DB 620 is updated.

  Moreover, when the interim aggregation date determined in the implementation schedule is reached, interim aggregation of group points for each group is performed. That is, for each group, for each player belonging to the group, referring to the TR point acquisition history data 627 of the corresponding card DB 620, the total of TR points acquired during the current time release battle implementation period (provisional acquisition TR Points) and the calculated total provisional TR points for each assigned player are set as the group points of the group.

  Next, the ratio of the group points of each group to the sum of the group points of all groups is calculated, and a power distribution is generated. Subsequently, a national ranking and a regional ranking are generated for the players participating in the time release game. That is, for each region, among the players participating in the time release game, the players having the registered region as the registered region are ranked in descending order of the provisional acquisition TR points, and the region ranking of the region is generated. In addition, all players participating in the time release battle are ranked in descending order of provisional acquisition TR points to generate a national ranking.

  Then, TR battle status data 340 including the generated power distribution, nationwide ranking, and regional ranking data is generated and distributed to each arcade game device 1000.

  When the execution period of the time release battle ends, the time release battle management unit 512 ends the acceptance of participation by the player. Next, the final aggregation of the group points of each group is performed in the same manner as the intermediate aggregation. Then, the release order of the candidate characters is determined based on the final group point of each group. Here, the release order is set in order of increasing group points.

  Here, a predetermined privilege may be given to the higher ranking player in the personal ranking. Examples of the privilege to be granted include items that can be used during the game, virtual money, and points that can be used on the website. In addition, for this privilege, “good privilege” or “many privileges” may be given to a player with a higher ranking.

  Thereafter, each time the release date determined in the implementation schedule is reached, the character data of the corresponding candidate character is distributed to the arcade game device 1000 in the determined release order.

  The website management unit 520 manages a website for providing various services related to a fighting fighting game executed in the game system 1. Here, data about players registered on the website is stored as a registered player DB 630.

  FIG. 34 is a diagram illustrating an example of a data configuration of the registered player DB 630. As illustrated in FIG. The registered player DB 630 is a set of registered player data for each player registered on the website. As shown in FIG. 34, each registered player data includes a player ID 631 of the corresponding registered player, a player name 632, and the like. , Password 633 and possession card ID 634 are stored.

  Returning to FIG. 25, the display unit 420 displays a display screen based on the image signal from the processing unit 500. This function is realized by hardware such as CRT, LCD, ELD, and PDP.

  The communication unit 430 is connected to the communication line N1 according to a control signal from the processing unit 500, and performs data communication with an external device (mainly, the arcade game device 1000). This function is realized by a wireless communication module, TA, router, wired communication cable jack, control circuit, and the like.

  The storage unit 600 stores a system program for realizing various functions for causing the processing unit 500 to control the server system 2000 in an integrated manner, a program and data for realizing various functions in the present embodiment, and the like. , Which is used as a work area of the processing unit 500, temporarily stores calculation results executed by the processing unit 500 according to various programs, input data input from the operation unit 410, and the like. This function is realized by, for example, various IC memories, hard disks, CD-ROMs, DVDs, MOs, RAMs, VRAMs, and the like. In the present embodiment, the storage unit 600 stores a game management program 612 and a website management program 614 as programs, and as data, a card DB 620, a registered player DB 630, website data 640, A TR battle execution DB 650 and a candidate character data group 660 are stored.

[Process flow]
(A) arcade game device 100
FIG. 35 is a flowchart for explaining the flow of game processing executed in the arcade game apparatus 1000. According to FIG. 35, if a predetermined number of coins are inserted and the execution of the battle-type fighting game is instructed (step A1: YES), the game calculation unit 210 first determines the presence or absence of the game card 10. If there is a game card 10 (step A3: YES), the card ID of the game card 10 is read, and a card authentication request is transmitted to the server system 2000 together with the read card ID (step A5). In response to this request, the play data transmitted from the server system 2000 is received (step A7).

  Further, according to the operation instruction of the player, the battle type (personal battle / CPU battle) and its opponent are determined (step A9). Next, a character that can be used as a player character is presented to the player (step A11). From these characters, a character to be used as a player character by the player is determined in accordance with the operation instruction of the player (step A13). Thereafter, execution of the fighting type fighting game is started (step A15).

  When the game ends (step A17), the game calculation unit 210 determines whether or not the game card 10 is present. If there is a game card 10 (step A19: YES), the play data is updated based on the battle result ( Step A21).

  Next, it is determined whether or not today is within the implementation period of the time release battle. If it is within the implementation period (step A23: YES), the acquired TR points are calculated based on the battle result, and the calculated acquired TR Points are displayed (step A25). Also, the current status display of the time release battle based on the TR battle current status data 340 (display of power distribution and personal ranking) is performed (step A27).

  Thereafter, the updated play data is transmitted to the server system 2000 together with the acquired TR points when there are acquired TR points (step A29).

  If the time-released candidate character data is received from the server system (step A31: YES), the received character data is added to the usable character data group 350 as new additional character data 352 ( Step A33).

  If the TR battle status data 340 is received from the server system 2000 (step A35: YES), the stored TR battle status data 340 is updated (step A37). If the above process is performed, it will return to step A1 and will repeat the same process.

(B) Server system 2000
(B1) Game Management Processing FIG. 36 is a flowchart for explaining the flow of game management processing executed in the server system 2000. This process is a process related to one time release battle.

  According to FIG. 37, if the game management unit 510 receives a card authentication request from the arcade game apparatus 1000 (step B1: YES), the game management unit 510 identifies the game card 10 from the received card ID and refers to the card DB 620. Then, card authentication as to whether the game card 10 is properly registered is performed (step B3). If the card is authenticated, the play data 624 of the corresponding card DB 620 is transmitted to the game device (step B5).

  If play data is received from the arcade game apparatus 1000 (step B7: YES), the game card 10 is specified from the received card ID, and the corresponding card DB 620 is stored based on the received play data. Update (step B9). If the above process is performed, it will return to step B1 and will repeat the same process.

(B2) Time Release Battle Management Processing FIGS. 37 and 38 are flowcharts for explaining the flow of time release battle management processing executed in the server system 2000. According to FIG. 37, the time release battle management unit 512 first sets a candidate character to be time released in accordance with an operation instruction from the manager (step C1). Also, an execution schedule for the time release battle is set (step C3).

  When the notification timing set in the execution schedule is reached (step C5: YES), notification of candidate characters, time release battle implementation period, release date, etc. is started (step C7).

  Also, when the player starts accepting participation and receives a time release battle participation request from the player terminal 3000 (step C9: YES), the player is identified from the card ID received together with the request, and the player It is determined whether it belongs to any group and has participated. If not participating (step C11: YES), the player is made to belong to the group corresponding to the requested candidate character and participate in the time release battle (step C13). If it has already participated (step C11: NO), it notifies the player terminal 3000 that it has already participated (step C15).

  Even after the start date of the time release battle is reached (step C17: YES), if a participation request for the time release battle is received from the player terminal 3000 (step C19: YES), the card ID received together with the request is received. The player is identified from the above, and it is determined whether or not the player belongs to any group and has participated. If not participating (step C21: YES), the player is made to belong to the group corresponding to the requested candidate character and participate in the time release battle (step C23). If it has already participated (step C21: NO), the player terminal 3000 is notified that it has already participated (step C25).

  If the acquired TR point is received together with the play data from the arcade game apparatus 1000 (step C27: YES), the game card 10 is identified from the card ID received together, and the TR point acquisition history of the corresponding player is recorded. Update (step C29: YES).

  Further, if the predetermined intermediate counting date is reached (step C31: YES), the total of the acquired TR points of each player to which the current player belongs is calculated for each group, and the intermediate counting as the group point of the group is performed. Perform (Step C33). Next, a power distribution indicating the ratio of the group points of each group to the whole is generated from the calculated group points of each group. In addition, a personal ranking (national ranking and regional ranking of each region) based on the acquired TR points for the players who are currently participating in the time release game is generated. Then, TR battle status data 340 including the generated power distribution and personal ranking data is generated and distributed to each arcade game device 1000 (step C35).

  Further, when a TR battle status browsing request is made from the player terminal 3000 (step C37: YES), the latest TR battle status data 340 is transmitted to the player terminal 3000 (step C39).

  And if it becomes the end date of a time release game (step C41: YES), participation acceptance of a time release game will be ended. Next, for each group, final aggregation is performed to calculate the final group point of the group, which is the total of the acquired TR points of the player belonging to the implementation period of the time release game (step C43). Then, the release order of the candidate characters is determined in the order of the final group points of each group (step C45).

  Thereafter, if the predetermined time release date is reached (step C47: YES), the character data of the corresponding candidate character is distributed to the arcade game apparatus 1000 according to the determined release order (step C49). When the distribution of the character data is completed for all candidate characters (step C51: YES), the time release battle management process is terminated.

[Action / Effect]
As described above, according to the present embodiment, the release order of the time-released characters is determined by the result of the time release battle in which the player participates.

[Modification]
It should be noted that embodiments to which the present invention can be applied are not limited to the above-described embodiments, and can be appropriately changed without departing from the spirit of the present invention.

(A) Time Release Battle Method For example, in the above-described embodiment, the time release battle is a “release order determination method” that determines the release order of a plurality of candidate characters. It is also possible to use a “winning method” that determines the character to be released at the time.

  In this case, for example, among a plurality of characters (for example, four bodies), only a predetermined number of characters (for example, one body) are time-released in descending order of group points in the time release battle. Then, in the next time release battle, new candidate characters (for example, one body) are added to the remaining candidate characters (for example, three bodies) that have not been time-released. The character to be time released is determined by the winning method.

(B) Selection of candidate character In the above-described embodiment, the player arbitrarily selects a candidate character to be associated when the player participates in the time release battle. For example, the player character used by the player is selected. May be automatically determined based on the tendency (type, characteristic, etc.), past game results, and the like. Specifically, for example, existing characters prepared in advance in the arcade game apparatus 1000 are classified into a plurality of groups, and candidate characters are associated with each category in advance. Then, a candidate character to be associated with the player is determined in accordance with which category group the player character uses most as the player character.

(C) Participation in Time Release Battle In the above-described embodiment, the participation in the time release battle is performed by operation input from the player terminal 3000. Alternatively, it may be performed on a live monitor installed separately from the arcade game apparatus 1000 in the store. Further, in this case, a website for providing a service linked to the game is not required, and the player terminal 3000 for accessing the website is not required. It may be performed only by 1000 or a live monitor.

(D) Character data to be released in time In the above-described embodiment, the server system 2000 distributes the corresponding character data to each arcade game device 1000 as a method for realizing the time release of the additional character. However, in the arcade game apparatus 1000, all candidate character data may be stored as data encrypted by a predetermined encryption method. Then, when the time release date is reached, the server system 2000 delivers a decryption key corresponding to the data of the character to be time released, and the arcade game apparatus 1000 can decrypt and use the corresponding character data with the received composite key Character.

(E) Notification of candidate character In addition, for example, prior to the implementation of the time release battle, the candidate character may appear as a CPU character in the game. In this case, in the arcade game apparatus 1000, it is necessary to distribute and store the data of the corresponding candidate character in advance.

(F) Time Release Battle Implementation Area In the above-described embodiment, the time release battle is performed nationwide. However, the implementation area is not limited to this, and may be, for example, a prefecture unit or a store.

(G) Usable Candidate In the above-described embodiment, the usable candidate is a player character. However, the usable character is not limited to a player character. For example, for a CPU character acting with a player character during a game, or a player It may be a character (assistant character) or the like that gives advice on the progress of the game, or may be a game stage or the like in addition to items used by the player character, clothes to be worn, weapons to be equipped, and the like.

(H) Application to Power Battle The concept of a time release battle in this embodiment in which players are grouped in association with candidate characters scheduled to be released and the candidate characters are ranked according to the play results of each player is as follows. It can also be applied to a power battle (group battle) according to various matters other than the candidate character. For example, a player's preference to present a plurality of main characters appearing in a game and determine a character that is more popular with the player, or present a plurality of game magazines and determine a game magazine that is more favored by the player. It can be applied to a questionnaire to search for a game, or it can be applied to a profile power battle or the like that is divided into groups according to personal data (age, gender, occupation, etc.) of the player at the time of registration of the game card 10.

(I) Type of Game In the above-described embodiment, the case where the present invention is applied to a fighting fighting game has been described. However, it is needless to say that the present invention can be applied to other games. Candidate candidates can be set as appropriate according to the type of game to be applied.

(J) Game System In the above-described embodiment, the game system 1 includes the arcade game apparatus 1000. However, the present invention is not limited to this. For example, an online game in which a home game apparatus or a portable game apparatus is connected by communication. It is also applicable to the system. In this case, the additional character data is distributed to the home game device or the portable game device.

DESCRIPTION OF SYMBOLS 1 Game system 1000 Operation | use game device 110 Operation input part, 120 Card reading / writing part 200 Processing part 210 Game operation part, 220 Image generation part 230 Sound generation part, 240 Communication control part 130 Image display part, 140 Sound output part, 150 Communication Unit 300 storage unit 310 game program, 320 game space setting data 330 TR point calculation table, 340 TR battle status data 350 usable character data 351 existing character data, 352 additional character data 10 game card 2000 server system 410 operation unit 500 processing unit 510 Game management unit, 512 Time release battle management unit 520 Website management unit 420 Display unit, 430 Communication unit 600 Storage unit 612 Game management program, 614 Website management Program 620 Card DB, 630 Registered player DB, 640 Website data 650 TR battle implementation DB, 660 Candidate character data 3000 Player terminal

Claims (11)

A server system that is communicably connected to a game machine and manages play data of each player,
Candidates (hereinafter collectively referred to as “usable bodies”) of characters, items, clothes, and game stages (hereinafter collectively referred to as “usable bodies”) that can be used by the player in the game machine as time releases. Presenting means for presenting a plurality of
Group constituting means for associating each player with each of the plurality of usable candidates and forming a group of each usable candidate;
A counting means for counting a given point calculated for each group by using a game result of the game machine of the player;
A determination means for determining an available candidate for time release based on the points counted for each group;
Time release control means for time releasing the usable candidates determined by the determination means in the game machine;
Server system with The determining means determines the priorities of usable candidates to be time-released based on points counted for each group,
The time release control means shifts the time according to the priority determined by the determination means, and causes the usable candidates to be time released;
The server system according to claim 1. The determining means determines a predetermined number of usable candidates to be time released,
The presenting means adds a new usable candidate to the usable candidate that has not been selected by the determining means and re-presents,
The group composition unit, the aggregation unit, the determination unit, and the time release control unit are configured to perform group release, point aggregation for each group, and time release use for the re-presented plurality of usable candidates. Re-execution of possible candidate determination and time release control of the determined usable candidate,
The server system according to claim 1. The group forming means selects a usable candidate to be associated with the player according to the selection operation of each player to form a group.
The server system as described in any one of Claims 1-3. Selection signal receiving means for receiving a selection signal for selecting an available candidate to be associated with the player from the player terminal of each player;
The group constituting unit selects a usable candidate based on the selection signal received by the selection signal receiving unit, and constitutes a group.
The server system according to claim 4. The counting means counts the points during a given counting period for each group, and associates the players associated with the usable candidates by the group forming means during the counting period. The point until it is made is also subject to aggregation.
The server system according to claim 4 or 5. The counting means totals the points during a given counting period for each group,
A notification means for notifying the progress of the counting points for each group during the counting period counted by the counting means;
The server system as described in any one of Claims 1-6. The time release control means distributes the data of usable candidates determined by the determining means to the game machine, thereby making the usable candidate object usable in the game machine.
The server system as described in any one of Claims 1-7. The game machine includes a storage unit that stores data of the usable candidates as an inactive state,
The time release control means changes the usable candidate object data determined by the determination means to the active state among the usable object candidate data stored in the storage unit of the game machine. Making a usable candidate a usable body in the game machine;
The server system as described in any one of Claims 1-7. A game machine that is communicably connected to the server system according to claim 8,
Receiving means for receiving data of the usable candidates from the server system;
Usable body providing means for providing a new usable body based on the data received by the receiving means;
A game machine equipped with. A game machine that is communicably connected to the server system according to claim 9,
Storage means for storing the usable candidate data as an inactive state;
Receiving means for receiving an instruction signal of an available candidate to be activated from the server system;
Activating means for making a new usable body by activating the data of the usable candidate stored in the storage means according to the instruction signal received by the receiving means;
A game machine equipped with.

Images