JP7196459B2 - game program - Google Patents

Description

The present invention relates to game programs.

For example, there are matching methods and matching systems for matching users with other users in games. 2. Description of the Related Art Conventionally, in a competitive game or the like, user matching for determining a plurality of users to play together, that is, a user and another user who is an opponent to be played by the user, depends on the skill level and the like of the plurality of users. , based on the game environment of the terminal device used by the user (see, for example, Patent Document 1).

JP 2017-159090 A

However, even in a game in which a plurality of players matched to a group play together, the skill level of the players matched to the group and the game environment may not be taken into consideration. In such a case, for example, if the possibility of a player with a disadvantageous skill level or game environment being able to win against another player who is an opponent becomes extremely low, there is a risk of losing sight of the goal during the game.

SUMMARY OF THE INVENTION The present invention has been made in view of the above problems, and an object of the present invention is to provide the players with a new goal during the game in a game played by a plurality of players matched to a group.

In order to solve the above-described problem, claim 1 of the present application provides a computer in which one of a plurality of players matched to the same group plays a game, and a computer that plays a game with the plurality of players matched to the same group. rival selection means for selecting at least one rival player for said one player based on a predetermined standard, rival display means for displaying said selected rival player, said matched plurality of players in execution of the game , as reward giving means for giving a reward to the one player according to the result of the game between the one player and the rival player ;
The rival display means is a game program characterized by displaying the selected rival player before and during the game .

According to the present invention, in a game played by a plurality of players matched to a group, it is possible to provide the players with a new goal during the game.

1 is a configuration diagram of an example of a game system according to an embodiment; FIG. 1 is a hardware configuration diagram of an example of a computer according to the embodiment; FIG. 1 is a hardware configuration diagram of an example of a game device according to an embodiment; FIG. It is a processing block diagram of an example of the game system according to the present embodiment. 4 is a configuration diagram of an example of player information stored in a player information storage unit; FIG. 4 is a configuration diagram of an example of group information stored in a group information storage unit; FIG. 6 is a flowchart of an example of racing game processing according to the present embodiment; FIG. 11 is an image diagram of an example of a screen during matching; FIG. 10 is an image diagram of an example of a matching screen rearranged in order of event points; FIG. 11 is an image diagram of an example of a rival designation cut-in screen; FIG. 10 is an image diagram of an example of a matching screen with a rival notation added; FIG. 11 is an image diagram of an example of a screen during a race; FIG. 11 is an image diagram of an example of a screen during a race; FIG. 11 is an image diagram of an example of a result screen; FIG. 11 is an image diagram of an example of a result screen; 7 is a flowchart of an example of rival selection processing according to the present embodiment; FIG. 10 is a screen image diagram of an example of rival notation. FIG. 10 is a screen image diagram of an example of rival notation.

Next, embodiments of the present invention will be described in detail.
[First embodiment]
In this embodiment, as an example of a game played by a plurality of players matched to the same group, a racing game played by a plurality of players matched to the same group (race) will be described.

<System configuration>
FIG. 1 is a configuration diagram of an example of a game system according to this embodiment. In the game system 1, a server device 10 is connected to a network 22 such as a LAN of stores 14 such as amusement facilities through a network 20 such as the Internet. One or more game devices 12 are installed in stores 14 in various places. Game device 12 is connected to network 22 of store 14 . The game system 1 shown in FIG. 1 is merely an example, and it goes without saying that there are various system configuration examples depending on the application and purpose. For example, the server device 10 may be distributed among a plurality of computers. The server device 10 manages information about the players playing the game on the game device 12, game result information by the players, information about groups (races) in which the players are matched, and the like. Server device 10 may be connected to network 22 of store 14 .

The game device 12 is a device for a player to play a racing game. When the game device 12 is a drive housing, it includes, for example, an operation unit, a seat unit, an image display unit, and the like. It should be noted that the game device 12 is not limited to a dedicated game device for commercial use installed in a store 14 or the like, and may be a PC, a smartphone, a tablet, a dedicated game device for home use, or the like.

<Hardware configuration>
The server device 10 in FIG. 1 is implemented by, for example, a computer having the hardware configuration shown in FIG. FIG. 2 is a hardware configuration diagram of an example of a computer according to this embodiment.

The computer in FIG. 2 includes an input device 501, an output device 502, an external I/F 503, a RAM 504, a ROM 505, a CPU 506, a communication I/F 507, an HDD 508, and the like, which are interconnected via a bus B. Note that the input device 501 and the output device 502 may be connected and used when necessary.

An input device 501 is a touch panel, operation keys and buttons, a keyboard, a mouse, and the like used by the player to input various signals. The output device 502 includes a display such as liquid crystal or organic EL for displaying a screen, a speaker for outputting sound data such as voice or music, and the like. A communication I/F 507 is an interface that connects the computer to the network 20 . Thereby, the computer can perform data communication via the communication I/F 507 .

Also, the HDD 508 is an example of a non-volatile storage device that stores programs and data. The stored programs and data include an OS, which is basic software that controls the entire computer, and applications that provide various functions on the OS.

Note that the computer may use a drive device (for example, solid state drive: SSD) that uses flash memory as a storage medium instead of the HDD 508 .

An external I/F 503 is an interface with an external device. The external device includes a recording medium 503a and the like. This allows the computer to read from and/or write to the recording medium 503a via the external I/F 503. FIG. The recording medium 503a includes a flexible disk, CD, DVD, SD memory card, USB memory, and the like.

The ROM 505 is an example of a nonvolatile semiconductor memory (storage device) that can retain programs and data even when the power is turned off. The ROM 505 stores programs and data such as the BIOS, OS settings, and network settings that are executed when the computer is started. A RAM 504 is an example of a volatile semiconductor memory (storage device) that temporarily holds programs and data.

The CPU 506 reads programs and data from storage devices such as the ROM 505 and the HDD 508 onto the RAM 504, and executes processing (including processing for generating images and sounds to be output to the output device 502) to control the entire computer. It is a computing device that realizes functions.

The server apparatus 10 according to the present embodiment can implement various processes described later by executing a program in a computer having the hardware configuration described above.

Also, the game device 12 in FIG. 1 is realized by a hardware configuration as shown in FIG. 3, for example. FIG. 3 is a hardware configuration diagram of an example of the game device according to this embodiment.

Gaming device 12 includes a computer 650 that controls the entire device. The game device 12 also includes an operation unit 600 , an image display unit 610 , a sound unit 620 and an IO board 640 connected to the computer 650 . Furthermore, the game device 12 includes an IC card unit 660 , a coin insertion unit 670 and a communication unit 680 that are connected to the computer 650 .

The operation unit 600 is for the player to operate the game. The operation unit 600 includes operation units such as a steering wheel, an accelerator pedal, a brake pedal, and a shift lever. The image display unit 610 is for displaying the game screen. The sound unit 620 includes, for example, an amplifier and a speaker. The sound unit 620 is for outputting game sounds.

Various types of lighting 630 such as a cold cathode tube 631, a fluorescent lamp 632, and a lamp 633 are connected to the IO board 640, for example. For example, the lighting 630 is controlled to perform a predetermined lighting/blinking operation as an effect according to the scene of the game.

The game device 12 also has an IC card unit 660 and a coin insertion unit 670 . The IC card unit 660 includes an IC card reader/writer 661 that reads and writes information on an IC card, which is an information storage medium. When the player holds the IC card over the IC card unit 660 to read the IC card information, the game device 12 acquires the player information linked to the IC card information from the server device 10 . In this way, the game device 12 can identify the player playing the game.

The coin entry unit 670 is a game play fee entry mechanism. Communication unit 680 is an interface that connects game device 12 to network 22 . Thereby, the game device 12 can perform data communication via the communication unit 680 .

<Software configuration>
《Processing block》
A software configuration of the game system 1 according to this embodiment will be described. FIG. 4 is a processing block diagram of an example of the game system according to this embodiment. The server device 10 implements a player management section 30, a group management section 32, a player information storage section 36, and a group information storage section 38 by executing a server program. Also, the game device 12 implements a game control unit 40, a group information reception unit 42, a rival selection unit 44, a group display unit 46, and a game execution unit 48 by executing the client program.

The player management unit 30 manages information about players. A group management unit 32 manages information about a group of players participating in the same race. The player information storage unit 36 stores information about players. The group information storage unit 38 stores information about the player's group.

The game control unit 40 is notified of IC card information read from the IC card of the player and credit information of coins inserted into the coin insertion unit 670 .

The game control unit 40 is notified of the credit information indicating that the game play fee has been inserted, and upon receiving an operation to start the game from the player, requests the server device 10 to participate in the race. Further, when the IC card information is notified, the game control unit 40 requests the server device 10 for the player information linked to the IC card information, thereby specifying the player who plays the game.

The group information receiving unit 42 receives from the server device 10 information (group information) regarding a group of players participating in the same race that has been matched in the server device 10 as will be described later. Based on the group information received from the server device 10, the rival selection unit 44 selects one or more rivals as will be described later. Based on the group information received from the server device 10, the group display unit 46 displays information (player information) about the players participating in the same race, and displays so that the selected rival players can be identified.

The game execution unit 48 controls the display of the game screen, the output of the game sound, and the lighting/flashing operation of the lighting 630 to allow the player to execute the racing game. When the racing game ends, the game execution unit 48 gives rewards such as in-game points to the player according to the results of the racing game (the ranking of the player and the ranking of rival players). An example of event points will be described below as an example of in-game points. A player can obtain additional event points if he or she finishes in a higher order than a rival player.

FIG. 5 is a configuration diagram of an example of player information stored in the player information storage unit. The player information in FIG. 5 includes items such as IC card information, player name, team name, rival information, result information, license grade, and event points.

The IC card information is unique information that can be read from the player's IC card. With this IC card information, the player information in FIG. 5 and the IC card information that can be read from the IC card are linked. The player name is the name used by the player within the game. The belonging team name is the name of the team to which the player belongs in the game. The rival information is information of a rival player selected as described later.

The result information is various results of the racing game executed by the player. The license grade is an index that indicates the game skill of the player. Event points are in-game points accumulated according to the results of racing games played by the player.

FIG. 6 is a configuration diagram of an example of group information stored in the group information storage unit. The group information in FIG. 6 has items such as a group name and belonging players. A group name is the name of a group in which a plurality of players are matched, such as the name of a race in which the matched players participate. Also, the affiliated player is information indicating a player matched as a player participating in the same race.

<Processing>
FIG. 7 is a flowchart of an example of racing game processing according to this embodiment. A player who plays a racing game performs an operation to start the game on the game device 12 . The game device 12 that has received the game start operation from the player requests the server device 10 to participate in the race.

In step S11, the group management unit 32 of the server device 10 accepts participation in the race from the game device 12 operated by the player. The group management unit 32 causes the group information storage unit 38 to sequentially store information indicating the players accepted to participate in the race. The group management unit 32 notifies the game device 12 requesting participation in the race of information indicating the player accepted for participation in the race.

The group information reception unit 42 of the game device 12 causes the group display unit 46 to display, for example, a matching screen as shown in FIG. FIG. 8 is an image diagram of an example of the screen during matching. The matching screen in FIG. 8 displays information indicating the four players ``Oh,'' ``Kakekeke,'' ``Yeah,'' and ``Uuu'' in the order in which the server apparatus 10 accepts participation in the race. When the matching time elapses or when the maximum number of participants who can participate in the same race has been accepted, the group management unit 32 ends the acceptance of participation in the race, and proceeds from step S12 to step S13.

In step S13, the group information reception unit 42 of the game device 12 is notified by the server device 10 of the end of reception of participation in the race. The group display unit 46 rearranges the plurality of players matched to participate in the same race in order of event points, for example, as shown in FIG. FIG. 9 is an image diagram of an example of a matching screen rearranged in order of event points. In the matching screen of FIG. 9, "2224pt" or the like displayed in the lower right column of the information indicating the player represents event points. After displaying the matching screen of FIG. 9, the group display unit 46 displays a rival designation cut-in screen as shown in FIG. 10, for example.

In addition, the rival selection unit 44 performs a rival selection process of selecting a rival player based on a predetermined criterion from the players other than the player matched to participate in the same race. Details of the rival selection process will be described later. Proceeding to step S14, the group display unit 46 gives the selected rival player a rival notation 1001 as shown in the matching screen of FIG. In addition, a continuous first place notation 1002 is given to the player who was first in the previous race. Note that the matching screen in FIG. 11 is an example for the player "kekeke". Granted.

The player can confirm the rival player designated for this race only by confirming the rival notation 1001 displayed on the matching screen of FIG. By awarding additional event points to players who finish higher than rival players, even if the player is less likely to finish in 1st place, they will finish higher than rival players. you get the goal. Further, by giving additional event points to a player who finished in a higher rank than the player of the continuous first place notation 1002, the player can obtain a new goal.

Proceeding to step S15, the game execution unit 48 starts the race in the order shown in FIG. After the start of the race, the player can visually confirm the rival player and the player who was first in the previous race by the rival display 1001 and the continuous first place display 1002 on the screen during the race as shown in FIG.

FIG. 12 is an image diagram of an example of a race screen. In the racing screen of FIG. 12, a rival notation 1001 and a continuous first place notation 1002 are displayed in a passing rank field 1004 that displays the rank in which each player passed the control line (lap line). In the race screen of FIG. 12, the current positions of rival players and the player who was first in the previous race are displayed on the minimap 1006 in different colors and shapes so that the current positions can be visually recognized. With the screen during the race as shown in FIG. 12, even after the race has started, the player can proceed with the racing game while confirming the position of the rival player and the player who was first in the previous race.

Also, during the race, when a rival player or the player who was first in the previous race approaches within a certain distance, for example, as shown in FIG. A rival notation 1001 and a continuous first place notation 1002 may be displayed. FIG. 13 is an image diagram of an example of a race-in-progress screen. In FIG. 13, a rival notation 1001 is displayed next to the player name "Uuu" displayed above the vehicle of the player "Uuuu".

When the player reaches the finish line, the game execution unit 48 proceeds to step S16, and displays a result screen as shown in FIG. 14 in result processing. If the player finishes in a higher order than the rival player and the player who was first in the previous race (wins), the player is notified as shown in FIG. 14 . FIG. 14 is an image diagram of an example of the result screen. On the result screen of FIG. 14, "Victory against target!" and "Victory against rival!" are announced.

Also, the game execution unit 48 transitions from the result screen of FIG. 14 to, for example, the result screen of FIG. 15, and displays the details of the event points obtained by the race to the finish line. FIG. 15 is an image diagram of an example of the result screen.

The rival selection process in step S13 is performed, for example, according to the procedure shown in FIG. FIG. 16 is a flowchart of an example of rival selection processing according to this embodiment. Proceeding to step S21, the group display unit 46 rearranges the plurality of players matched to participate in the same race in descending order of event points, as shown in FIG. 9, for example.

Proceeding to step S22, the rival selection unit 44 further excludes the player who was first in the previous race (target player) from the players other than the player matched to participate in the same race, and then to select a rival player. For example, in the case of the matching screen for the player "kekeke", after removing the player "kekeke" and the player who was first in the previous race "yeah", a rival player is selected according to a predetermined criterion.

For example, the rival selection unit 44 selects the player whose order on the starting grid is one ahead as the rival player. In the example of FIG. 11, the player "Kikiki" who is one rank before the player "Kekeke" is selected as a rival. By selecting the player who is one ahead on the starting grid as a rival player, the player can easily see the rival player at the start of the race. Since there is no player one rank before the player ranked first on the starting grid, the player one rank behind (second place) is selected as a rival.

Furthermore, the rival selection unit 44 selects a player whose license grade is the same as or lower than the player's class as a rival. In this way, the rival selection unit 44 can select rival players based on criteria different from the order on the starting grid. Also, if there is no player whose license grade is the same as or lower than the player's class, the rival selection unit 44 may select a rival player from players whose class is higher than that of the player.

In the example of FIG. 11, the player "Uuu" is selected as a rival by giving priority to the first player among the players having the same license grade as the player "Kekeke" or lower.

Note that if all the players other than the player who are matched to participate in the same race are the first players in the previous race, the rival selection unit 44 selects the competitor because all the players other than the player are target players. Don't select a player. The rival selection unit 44 may select a plurality of players as rivals based on one criterion, or may select a plurality of players as rivals based on different criteria.

According to the game system 1 of the present embodiment, when a plurality of players matched to participate in the same race includes a player with a high license grade, it is difficult for a player to obtain a higher ranking. , can provide a new goal of beating a target or rival player.
[Other embodiments]
In the first embodiment, the rival player is shown before the race by giving the rival notation 1001 to the matching screen before the start of the race, but the rival player may be shown at another timing. . For example, the game system 1 of the present embodiment may indicate rival players after the race has started and a predetermined condition such as the number of laps has been met.

Furthermore, in the first embodiment, an example of a racing game has been described, but it can also be applied to a game in which a plurality of matched players play a battle royale. In this case, for each of the plurality of players matched for battle royale, for example, as shown in FIG. 17, other players whose levels are close to each other are selected as rivals. FIG. 17 is a screen image diagram of an example of rival notation.

FIG. 17 shows an example of a screen for the player "yeah" as an example. Since the level of the player with the player name "Eee" is "10", the player with the player name "Eee" whose level is similar to the player with the player name "Eee" is selected as a rival in the screen example of FIG. there is

In the first embodiment, an example of a racing game has been described, but it can also be applied to a game in which groups such as guilds compete against each other. In this case, for each of the plurality of players shown in FIG. 18, for example, who are matched with a plurality of groups, a player with a similar level is selected as a rival from among the plurality of players belonging to the opponent's group. FIG. 18 is a screen image diagram of an example of rival notation.

FIG. 18 shows, as an example, a screen example for a player "ahhh" who belongs to "group A". Since the level of the player with the player name "Aaaa" is "10", the player with the player name "aaa" whose level is close to the player with the player name "Aaa" is selected as a rival from "Group B" in the screen example of FIG. It is

The invention is not limited to the specifically disclosed embodiments above, but various modifications and changes are possible without departing from the scope of the claims.

1 game system 10 server device 12 game device 14 store 20, 22 network 30 player management unit 32 group management unit 36 player information storage unit 38 group information storage unit 40 game control unit 42 group information reception unit 44 rival selection unit 46 group display unit 48 Game execution part 1001 Rival notation 1002 First place continuation notation

Claims (5)

A computer on which one of a plurality of players matched to the same group plays a game,
rival selection means for selecting at least one rival player for said one player based on a predetermined criterion from said plurality of players matched in said same group;
rival display means for displaying the selected rival player;
Reward giving means for giving a reward to the one player according to the result of the game between the one player and the rival player in the execution of the game by the plurality of matched players;
function as
The rival display means displays the selected rival player before and during the game.
A game program characterized by A computer that plays games among groups of multiple players,
rival selection means for selecting at least one rival player for one of the plurality of players belonging to one group based on a predetermined standard from a plurality of players belonging to another group;
rival display means for displaying the selected rival player;
Reward giving means for giving a reward to the one player according to the result of the game between the one player and the rival player in the execution of the game between the groups;
function as
The rival display means displays the selected rival player before and during the game.
A game program characterized by A computer on which one of a plurality of players matched to the same group plays a game,
rival selection means for selecting at least one rival player for said one player based on a predetermined criterion from said plurality of players matched in said same group;
rival display means for displaying the selected rival player;
Reward giving means for giving a reward to the one player according to the result of the game between the one player and the rival player in the execution of the game by the plurality of matched players;
function as
The rival display means displays the selected rival player when a predetermined condition is satisfied during the game.
A game program characterized by A computer that plays games among groups of multiple players,
rival selection means for selecting at least one rival player for one of the plurality of players belonging to one group based on a predetermined standard from a plurality of players belonging to another group;
rival display means for displaying the selected rival player;
Reward giving means for giving a reward to the one player according to the result of the game between the one player and the rival player in the execution of the game between the groups;
function as
The rival display means displays the selected rival player when a predetermined condition is satisfied during the game.
A game program characterized by 5. The game program according to any one of claims 1 to 4, wherein said rival selection means selects a plurality of rival players for said one player based on different criteria.

Images