JP2016002413A - Game system and communication game processing method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a game system, a communication game processing method, and the like which enable players to form a group with members they like and to play a communication game.SOLUTION: A game system includes: a matching processing part which creates a room corresponding to a key word when a participation request to a group comes from a terminal device of a first player who has inputted the key word and performs processing to allow a second player to enter the room when a participation request comes from a terminal device of the second player who has inputted the same key word to perform matching processing that has players who have inputted the same key word belong to the same group; and a game processing part which performs processing for a communication game using the group formed by the matching processing.

Description

  The present invention relates to a game system, a communication game processing method, and the like.

  2. Description of the Related Art Conventionally, a game system is known in which a large number of players can participate and play a communication game such as a battle game using a network such as the Internet. As a conventional technique of such a game system, there is a technique disclosed in Patent Documents 1 and 2, for example.

  In such a game system, when a player makes a request (entry) to participate in a communication game using a terminal device, a matching process is performed to determine a group (team) to which the player belongs. In this way, each group is organized by a plurality of players, and a battle game or the like is performed between the organized groups.

JP 2008-113783 A Japanese Patent Laid-Open No. 9-115063

  However, in conventional game systems, the group to which a player belongs is automatically determined by matching processing based on the game play level of the player and the like. For this reason, it is difficult for a player to form a group with friends and play a battle game between the groups. In particular, it was very difficult to form a group and play a battle game or the like between friends playing games at different geographically separated stores (amusement facilities).

  According to some aspects of the present invention, it is possible to provide a game system, a communication game processing method, and the like that allow a player to organize a group with members or the like desired to play a communication game.

  According to one aspect of the present invention, when a request for joining the group is received from a terminal device of a first player who has input a keyword for identifying a player who belongs to the same group and plays a communication game, A corresponding room is created, and when a participation request is received from the terminal device of the second player who has input the same keyword, the same keyword is obtained by performing a process of causing the second player to enter the room. Related to a game system including a matching processing unit that performs a matching process that causes an input player to belong to the same group, and a game processing unit that performs a process for the communication game using the group organized by the matching process To do. The present invention also relates to a program that causes a computer to function as each of the above-described units, or a computer-readable information storage medium that stores the program.

  According to one aspect of the present invention, when a participation request is received from the first player who has input a keyword, a room corresponding to the keyword is created. Thereafter, when a participation request is received from a second player who has input the same keyword, a process is performed in which the second player enters the room created by the participation request of the first player. This realizes a matching process in which players who input the same keyword belong to the same group, and a process for a communication game using a group organized by the matching process is performed. Therefore, it is possible to form a group for the communication game by the matching process using the keyword. For example, the group can be formed by members desired by the player and the communication game can be played.

  In the aspect of the invention, the matching processing unit starts a matching period when a participation request is received from the terminal device of the first player who has input the keyword. When a request for participation is received from the terminal device of the second player who has input the same keyword, a process of causing the second player to enter the room may be performed.

  In this way, the matching period is started by the participation request of the first player, and when the second player who inputs the same keyword makes a participation request within the matching period, the second player is put into the room. After entering the room, the first and second players can organize the group. Therefore, the communication game can be started after the end of the matching period started by the participation request of the first player without the player specifying the start date and time of the communication game in advance.

  In the aspect of the invention, the matching processing unit may perform processing for notifying a player of matching status information after the start of the matching period until the end of the matching period.

  In this manner, by notifying the player of the matching status information within the matching period, it is possible to convey appropriate information necessary for requesting participation to the player who is requesting participation.

  In the aspect of the present invention, the matching processing unit may end the matching period when there is an instruction to end matching from a terminal device of a player who has entered the room within the matching period.

  In this way, even if the time limit for the matching period has not elapsed or the number of people entering the room has not reached the capacity, the matching period can be ended by the will of the player who has entered the room. It becomes possible.

  In the aspect of the invention, the matching processing unit may end the matching period when there is an instruction to end matching from the terminal device of the first player within the matching period.

  In this way, even if the time limit of the matching period has not elapsed or the number of people entering the room has not reached the capacity, the matching period is ended by the will of the first player who created the room. It becomes possible to make it.

  In the aspect of the invention, the matching processing unit may enter the room when the number of players who have entered the room by entering the same keyword within the matching period has reached the capacity. It may be closed.

  In this way, even when the time limit for the matching period has not elapsed, when the number of people entering the room reaches the fixed number, the room can be closed and the matching period can be ended. As a result, for example, even when the communication game group has a capacity, it is possible to appropriately cope with this.

  Moreover, in one aspect of the present invention, the matching processing unit may change the number of people who can enter the room in accordance with the communication game being held within the matching period.

  In this way, it becomes possible to set the number of people entering the room to an appropriate number according to the number of people of the group of communication games held during the matching period.

  In one aspect of the present invention, the matching processing unit, when the number of players who enter the room is less than the number of people at the end of the matching period, You may perform the process which belongs to a group.

  In this way, even if the number of people entering the room does not reach the number of people and the number of members of the group becomes less than the number of people, the group is formed by supplementing other players searched by matching. become able to.

  In one aspect of the present invention, the matching processing unit creates another room when a request for participation comes from a terminal device of another player who has input the keyword after the matching period ends. The process of entering the other player into the other room may be performed.

  In this way, for example, even if the number of players entering the room reaches the maximum number of people or the matching period ends due to elapse of the time limit, the player who has entered the same keyword after that has entered another room. You can enter a room and organize a group of other rooms.

  Further, according to one aspect of the present invention, when a player inputs the keyword, a registration processing unit may be included that receives the keyword input and registers the received keyword in the storage unit in association with the player.

  If the keyword is registered in association with the player in this way, it is possible to save the player's input of the keyword and the like during the group matching process by the keyword, and the convenience of the player can be improved.

  In the aspect of the invention, the registration processing unit may perform a process for allowing a player in which the keyword is registered to select a game mode to be played by a group organized by the keyword. Good.

  In this way, a player in which a keyword is registered is allowed to select a game mode to be played by a group organized by the keyword. For example, the player can match groups by keyword by selecting the game mode. It becomes possible to request processing.

  In the aspect of the invention, the matching processing unit may perform a process for displaying information on a plurality of rooms that can be entered by inputting the same keyword on the player.

  By displaying information about a plurality of rooms on the player in this way, the player can select the room in which he / she enters by looking at the information on the plurality of rooms, thereby improving the convenience of the player.

  According to another aspect of the present invention, matching is performed when a request to join the group is received from the terminal device of the first player who has input a keyword for identifying a player who belongs to the same group and plays a communication game. When a request for participation is received from the terminal device of the second player who has input the same keyword within the matching period that is started, the second player is the same as the first player. The present invention relates to a game system including a matching processing unit that performs a matching process to belong to a group, and a game processing unit that performs a process for the communication game using the group organized by the matching process. The present invention also relates to a program that causes a computer to function as each of the above-described units, or a computer-readable information storage medium that stores the program.

  According to another aspect of the present invention, a matching period is started by a first player's participation request, and when the second player who inputs the same keyword makes a participation request within the matching period, the second player A player can enter a room and a group can be organized by the first and second players. Therefore, the communication game can be started after the end of the matching period started by the participation request of the first player without the player specifying the start date and time of the communication game in advance.

  According to another aspect of the present invention, when a request to join the group comes from a terminal device of a first player who has input a keyword for identifying a player who belongs to the same group and plays a communication game, A room corresponding to a keyword is created, and when a request for participation is received from a terminal device of a second player who has input the same keyword, a process for causing the second player to enter the room is performed. The present invention relates to a communication game processing method for performing a matching process for causing a player who has input a keyword to belong to the same group, and performing a process for the communication game using the group organized by the matching process.

  According to another aspect of the present invention, matching is performed when a request to join the group is received from the terminal device of the first player who has input a keyword for identifying a player who belongs to the same group and plays a communication game. When a request for participation is received from the terminal device of the second player who has input the same keyword within the matching period that is started, the second player is the same as the first player. The present invention relates to a communication game processing method for performing a matching process for belonging to a group and performing a process for the communication game using the group organized by the matching process.

An example of the network configuration of the game system of the present embodiment. An example of a game device and a game management device. The structural example of the server system of this embodiment. The structural example of the game device of this embodiment. 5A to 5E show other examples of network configurations and terminal devices. Explanatory drawing of the method of this embodiment. FIG. 7A and FIG. 7B are also explanatory diagrams of the method of this embodiment. FIG. 8A to FIG. 8D are explanatory diagrams of matching processing according to the present embodiment. FIGS. 9A and 9B are explanatory diagrams of the matching period. FIGS. 10A and 10B are also explanatory diagrams of the matching period. FIGS. 11A and 11B are explanatory diagrams of the number of rooms. Explanatory drawing about the creation method of another room by participation of another player. FIG. 13A and FIG. 13B are explanatory diagrams of a replenishment method for other players. FIG. 14A and FIG. 14B are explanatory diagrams of the registration process of this embodiment. FIG. 15 (A) and FIG. 15 (B) are also explanatory diagrams regarding the registration processing of the present embodiment. Explanatory drawing about the display method of a several room. Explanatory drawing about the display method of a several room. Explanatory drawing about the method of mixing a friend and an enemy in one room. The flowchart of the detailed process example of this embodiment. The flowchart of the detailed process example of this embodiment. The flowchart of the detailed process example of this embodiment.

  Hereinafter, this embodiment will be described. In addition, this embodiment demonstrated below does not unduly limit the content of this invention described in the claim. In addition, all the configurations described in the present embodiment are not necessarily essential configuration requirements of the present invention.

1. Game System FIG. 1 shows an example of the network configuration of the game system of this embodiment. In FIG. 1, a server system 500 (information processing system) communicates with a game device and a game management device of a store A, a store B, a store C,... It is connected. For example, the game devices GM1A to GM4A in the store A are communicatively connected to the server system 500 via the game management device MNA (terminal). The game devices GM1B to GM4B in the store B are connected to the server system 500 through the game management device MNB. The same applies to other stores X and the like. Each store A, B,... X is an amusement facility in a different area such as Tokyo, Yokohama, Osaka or the like. In the following, the game devices GM1A to GM4A, GM1B to GM4B,... GM1X to GM4X in each store are referred to as game devices GM1 to GM4 as appropriate, and the game management devices MNA, MNB,. The game management device MN will be described as appropriate.

  For example, the server system 500 is a host, the game management device MN (MNA, MNB, etc.), the game devices GM1 to GM4 (GM1A to GM4A, GM1B to GM4B, etc.), and the communication terminal device TCM are clients. Specifically, a plurality of game devices GM1 to GM4 and a game management device MN connected to the game devices GM1 to GM4 are installed in an amusement facility such as a store. The game management device MN is also called a terminal and is a non-game device that cannot play a game, but performs various management processes on the game devices GM1 to GM4. The game management device MN serves as a parent device for the game devices GM1 to GM4, and the game management device MN and the game devices GM1 to GM4 are communicatively connected via a LAN or the like. Communication connection between the server system 500 and the game devices GM1 to GM4 is performed via the game management device MN. In the following description, a case where the game system and its processing according to the present embodiment are mainly realized by the server system 500 will be described as an example. It may be realized by the device MN or the communication terminal device TCM.

  The server system 500 can be implemented by, for example, one or a plurality of servers (game server, matching server, database server, management server, billing server, service providing server, content distribution server, authentication server, communication server, or the like). The server system 500 provides various services for managing community-type websites and online games, and can manage data necessary for game execution and distribute client programs and various data.

  The network 510 (distribution network, communication line) is a communication path using, for example, the Internet or a wireless LAN. In addition to a LAN using a dedicated line (dedicated cable) or Ethernet (registered trademark) for direct connection, telephone communication is also possible. A communication network such as a network, a cable network, or a wireless LAN can be included. The communication method may be wired / wireless.

  The communication terminal device TCM is a terminal having a network connection function (Internet connection function). As these communication terminal devices TCM, various terminal devices, such as a smart phone, a mobile telephone, or a future phone, can be used, for example.

  FIG. 2 shows an example of the game devices GM1 to GM4 and the game management device MN. Each of the game devices GM1 to GM4 has a monitor 10 that functions as a display unit 190 of FIG. The monitor 10 is a dome-shaped monitor, for example, and displays a powerful image by projection mapping or the like. Each of the game devices GM1 to GM4 includes operation levers 22 and 23 and pedals 24 and 25 that function as the operation unit 160 in FIG. 4, a card reader 28, and the like. The player sits on the seat of the game apparatus and operates the operation levers 22 and 23, the pedals 24 and 25, etc., and enjoys the robot battle game (team battle). In addition, by touching the card reader 28 with a game card (portable information storage medium in a broad sense) possessed by the player, the user information and the like of the player can be downloaded from the server system 500 and called.

  The game management device MN includes a monitor 40 for displaying various types of information, a touch panel monitor 42 for inputting various types of information, a card reader 44 for game cards, a carry-out port 46 for game cards purchased by players, and takeover. A magnetic card slot 48 and the like.

  FIG. 3 shows a configuration example of the server system 500 (game system in a broad sense) of the present embodiment. The server system 500 includes a processing unit 600, an operation unit 660, a storage unit 670, and a communication unit 696. The processing unit 600 includes a reception processing unit 602, a transmission processing unit 604, a matching processing unit 606, a game processing unit 608, a registration processing unit 610, a billing processing unit 616, a management processing unit 618, a display processing unit 620, and a sound processing unit 630. Including. Note that the configuration of the server system 500 is not limited to FIG. 3, and various modifications such as omitting some of the components (each unit) or adding other components are possible.

  The reception processing unit 602 performs information reception processing. For example, a process for receiving information from the game management device MN, the game devices GM1 to GM4, the communication terminal device TCM, and the like via the network 510 is performed. The transmission processing unit 604 performs information transmission processing. For example, a process of transmitting information to the game management device MN, the game devices GM1 to GM4, the communication terminal device TCM, and the like via the network 510 is performed. Here, the reception process includes a process of instructing the communication unit 696 to receive information, a process of acquiring information received by the communication unit 696, and writing the information in the storage unit 670. The transmission process is a process of instructing the communication unit 696 to transmit information, or instructing the communication unit 696 to transmit information.

  The matching processing unit 606 performs a matching process for determining a group to which the player belongs, and the game processing unit 608 performs a game process such as a game progress process. The registration processing unit 610 performs registration processing for user information and the like. Details of the matching processing unit 606, the game processing unit 608, and the registration processing unit 610 will be described later.

  The billing processing unit 616 performs various billing processing (billing determination processing, billing data creation processing, storage processing, etc.). The billing information storage unit 676 of the storage unit 670 stores billing information to be charged by the billing processing unit 616.

  The management processing unit 618 performs various server management processes. For example, management processing of various services provided by the server and management processing of various information such as server management information are performed.

  For example, in order to use the service provided by the server system 500, the player performs a predetermined procedure to acquire an account. By logging in by entering the password associated with the acquired account, the player can play network games, service on the game site, online shopping for items, etc., exchange messages between players, and friends Various services such as user registration can be used. The management processing unit 618 also performs such account information management processing of the player.

  The display processing unit 620 performs various display processes for displaying an image on a terminal device such as a game device. For example, image generation data generation processing for generating an image is performed. The sound processing unit 630 performs various types of sound processing for outputting sound with a terminal device such as a game device. For example, sound generation data for generating sound (voice, game sound, sound effect) is generated. Here, the image generation data for generating an image is data for generating (displaying) an image generated by the method of the present embodiment on a terminal device such as a game device, and is image data itself. Alternatively, it may be various data (display screen setting data, object data, etc.) used by a terminal device such as a game device to generate an image. The same applies to sound generation data generated by the sound processing unit 630.

  The operation unit 660 is for a system administrator (operator) to input various information.

  The storage unit 670 stores various types of information. For example, various information is stored in a database format. The storage unit 670 functions as a work area such as the processing unit 600 and the communication unit 696. The function of the storage unit 670 can be realized by RAM (DRAM, SRAM, VRAM), SSD (Solid State Drive), HDD (Hard Disk Drive), or the like.

  Storage unit 670 includes game data storage unit 672, matching information storage unit 674, billing information storage unit 676, and user information storage unit 678. The game data storage unit 672 stores game data. The game data is data of game content such as mobile objects appearing in the game or items used in the game, game music, game images, or game images. The matching information storage unit 674 stores matching information. The matching information is, for example, information obtained by matching processing, and may be room information, information about players who enter each room, information about a group organized by players who enter the room, or the like. The billing information storage unit 676 stores billing processing information performed by the billing processing unit 616. The user information storage unit 678 stores player personal information (name, sex, date of birth, e-mail address, etc.) as user information. For example, the aforementioned player account information is also stored as user information. The accounting information stored in the accounting information storage unit 676 is associated with each account information of each player.

  An information storage medium 680 (a computer-readable medium) stores programs, data, and the like, and its function can be realized by an HDD, a memory (ROM, etc.), an optical disk (CD, DVD), or the like. In this information storage medium 680, a program (a process for each unit) for causing each unit of the game system (server system or the like) of the present embodiment to function as a computer (an apparatus including an operation unit, a processing unit, a storage unit, and an output unit) A program for causing a computer to execute) is stored.

  The communication unit 696 performs communication with the game management device MN, the game devices GM1 to GM4, the communication terminal device TCM, and the like via a wired or wireless network 510, and functions as a communication ASIC or a communication processor. It can be realized by hardware such as, and communication firmware.

  FIG. 4 shows a configuration example of the game devices (GM1 to GM4) of the present embodiment. Note that the configuration of the game device is not limited to that shown in FIG. 4, and various modifications may be made such as omitting some of the components (each unit) or adding other components.

  The operation unit 160 is for a player to input operation data, and functions thereof are direction instruction keys, operation buttons, analog sticks, levers, various sensors (such as an angular velocity sensor and an acceleration sensor), a microphone, or a touch panel type. This can be realized with a display.

  The storage unit 170 serves as a work area for the processing unit 100, the communication unit 196, and the like, and its function can be realized by a RAM (DRAM, SRAM, VRAM) or the like.

  The information storage medium 180 (a computer-readable medium) stores programs, data, and the like, and functions as an optical disk (DVD, CD, etc.), HDD (hard disk drive), memory (ROM, etc.), etc. Can be realized. The processing unit 100 performs various processes of the present embodiment based on a program (data) stored in the information storage medium 180. That is, in the information storage medium 180, a program for causing a computer (an apparatus including an operation unit, a processing unit, a storage unit, and an output unit) to function as each unit of the present embodiment (a program for causing the computer to execute processing of each unit). Is memorized.

  The display unit 190 outputs an image generated according to the present embodiment, and the function can be realized by an LCD, an organic EL display, a CRT, various projector-type displays, an HMD, or the like. The sound output unit 192 outputs the sound generated by the present embodiment, and its function can be realized by a speaker, headphones, or the like.

  The I / F (interface) unit 194 performs interface processing with the portable information storage medium 195, and the function can be realized by an ASIC for I / F processing or the like. The portable information storage medium 195 stores various information for a player to play a game, and can be realized by an IC card (memory card), a USB memory, a magnetic card, or the like.

  When the portable information storage medium 195 is an IC card (game card), the I / F unit 194 can be realized by the card reader 28 in FIG. 2 that reads information from the IC card.

  The communication unit 196 communicates with an external device (for example, another game device, a game management device, a server system, etc.) via a wired or wireless network, and functions as a communication ASIC or communication. It can be realized by hardware such as a processor for communication and firmware for communication.

  Note that a program (data) for causing a computer to function as each unit of the present embodiment is transferred from the information storage medium included in the server system (host device) to the information storage medium 180 (or storage unit 170) via the network and communication unit 196. You may distribute. Use of the information storage medium by such a server system can also be included in the scope of the present invention.

  The processing unit 100 (processor) performs game processing, display control processing, sound output processing, or the like based on operation data from the operation unit 160, a program, or the like. The processing unit 100 performs various processes using the storage unit 170 as a work area. The functions of the processing unit 100 can be realized by hardware such as various processors (CPU, GPU, etc.), ASIC (gate array, etc.), and programs.

  The processing unit 100 includes a game processing unit 102, an object space setting unit 104, a moving body calculation unit 106, a virtual camera control unit 108, a reception processing unit 110, a transmission processing unit 114, a battle processing unit 116, a display control unit 120, and sound control. Part 130. It should be noted that modifications can be made such as omitting some of these components or adding other components.

  The game processing unit 102 performs various game processes. Here, the game process includes a process for starting a game when a game start condition is satisfied, a process for advancing the game, and a process for ending a game when a game end condition is satisfied.

  The object space setting unit 104 performs an object space setting process in which a plurality of objects are arranged. For example, various objects (polygons, free-form surfaces or subdivisions) representing display objects such as moving objects (robots, cars, people, airplanes, ships, animals, etc.), maps (terrain), buildings, courses (roads), trees, walls, etc. The object is configured to place and set an object composed of a primitive surface such as a surface in the object space. In other words, the position and rotation angle of the object in the world coordinate system (synonymous with direction and direction) are determined, and the rotation angle (rotation angle around the X, Y, and Z axes) is determined at that position (X, Y, Z). Arrange objects. Specifically, the object data storage unit 172 of the storage unit 170 stores object data such as the position, rotation angle, moving speed, moving direction, etc. of the object (part object) in association with the object number. . The object space setting unit 104 performs a process of updating the object data for each frame, for example.

  The moving object calculation unit 106 performs an operation for moving the moving object. Also, a calculation for operating the moving object (moving object) is performed. That is, based on operation data input by the player through the operation unit 160, a program (movement / motion algorithm), various data (motion data), etc., a moving body (object, model object) is moved in the object space, Performs processing to move the moving body (motion, animation). Specifically, a simulation for sequentially obtaining movement information (position, rotation angle, speed, or acceleration) and movement information (part object position or rotation angle) of a moving body for each frame (1/60 seconds, etc.). Process. A frame is a unit of time for performing a moving / movement process (simulation process) and an image generation process of a moving object.

  The virtual camera control unit 108 performs control processing of a virtual camera (viewpoint, reference virtual camera) for generating an image that can be seen from a given (arbitrary) viewpoint in the object space. Specifically, processing for controlling the position (X, Y, Z) or rotation angle (rotation angle about the X, Y, Z axis) of the virtual camera (processing for controlling the viewpoint position, the line-of-sight direction or the angle of view) I do.

  The reception processing unit 110 receives information from an external device such as a server system or a game management device. The transmission processing unit 114 performs processing for transmitting information to an external device such as a server system or a game management device. Here, the reception process includes a process of instructing the communication unit 196 to receive information, a process of acquiring information received by the communication unit 196, and writing the information in the storage unit 170, and the like. The transmission process is a process of instructing the communication unit 196 to transmit information, or instructing the communication unit 196 to transmit information.

  The battle processing unit 116 performs various processes for battle play. For example, a battle process is performed between a player moving body controlled based on operation information from the operation unit 160 and an enemy moving body controlled by an operation of a computer or another player.

  The display control unit 120 performs processing for displaying an image on the display unit 190. For example, a drawing process is performed based on the results of various processes (game process, simulation process) performed by the processing unit 100, thereby generating an image and displaying it on the display unit 190. Specifically, geometric processing such as coordinate transformation (world coordinate transformation, camera coordinate transformation), clipping processing, perspective transformation, or light source processing is performed. Based on the processing result, drawing data (the position of the vertex of the primitive surface) Coordinates, texture coordinates, color data, normal vector, α value, etc.) are created. Then, based on the drawing data (primitive surface data), the perspective transformation (geometry processing) object (one or a plurality of primitive surfaces) is converted into image data in units of pixels such as a drawing buffer 176 (frame buffer, work buffer, etc.). Draw in a buffer that can be stored. Thereby, an image that can be seen from the virtual camera (given viewpoint) in the object space is generated.

  The sound control unit 130 performs control for outputting sound by the sound output unit 192. For example, sound processing is performed based on the results of various processing performed by the processing unit 100 to generate game sounds such as BGM, sound effects, or voices, and the sound output unit 192 outputs the game sounds.

  4 shows the configuration of the game devices GM1 to GM4 of FIGS. 1 and 2, the game management device MN can be realized by the same configuration as that of FIG. For example, the game management device MN includes a processing unit, an operation unit, a storage unit, a display unit, a sound output unit, an I / F unit, a communication unit, and the like, similarly to the game device. The processing unit of the game management device MN can be realized by the same configuration as the processing unit 100 of FIG. 4 except that the game calculation is not performed. The storage unit, the display unit, the sound output unit, the I / F unit, and the communication unit of the game management device MN are the same as the storage unit 170, the display unit 190, the sound output unit 192, the I / F unit 194, and the communication unit 196 in FIG. A similar configuration can be realized. The I / F unit of the game management device MN can be realized by the card reader 44 of FIG. The communication unit of the game management device MN communicates with the server system 500 via the network 510. The communication unit communicates with the game devices GM1 to GM4 via a network such as a LAN provided in the amusement facility.

  FIG. 5A shows another example of the network configuration of the game system of this embodiment. In FIG. 5A, a server system 500 and terminal devices TM1 to TMn such as game devices are connected for communication without going through a game management device or the like. As these terminal devices TM1 to TMn, for example, a home game device (stationary type) in FIG. 5B, a portable game device in FIG. 5C, and a portable communication terminal device in FIG. Various devices such as a smartphone, a future phone, and a mobile phone) or the arcade game device in FIG. 5E can be used. Alternatively, an information processing device such as a personal computer (PC) or a tablet computer may be used as the terminal devices TM1 to TMn.

  As shown in FIG. 3, in this embodiment, the server system 500 (game system) includes a matching processing unit 606 and a game processing unit 608.

  The matching processing unit 606 performs a matching process in which players who input the same keyword belong to the same group (team or the like). Specifically, for example, a request to join a group from the terminal device (game device) of the first player that has input (registered) a keyword (ID) for identifying a player who belongs to the same group and plays a communication game (Matching request) comes. In this case, the matching processing unit 606 creates a room corresponding to this keyword. Then, when a participation request is received from the terminal device of the second player who has input (registered) the same keyword, a process for causing the second player to enter the room is performed. For example, after a room is formed by a first player request to join a group, a request for participation comes from the terminal devices of the second to Nth players (N is an integer of 2 or more) that has entered the same keyword as that room. In such a case, a process of entering the second to Nth players into the room is performed. Thereby, a matching process is realized in which players (first to Nth players) who input the same keyword belong to the same group, and a group of these players is organized. Then, the game processing unit 608 performs processing for a communication game (Network game) using a group organized by matching processing.

  Here, the keyword is expressed by, for example, letters (Japanese, English, etc.), numbers, symbols, or the like. For example, the keyword is a password or the like decided by players to form a group. This keyword may be input by the players (first and second players) at the time of requesting to join the group, or registered as user information or the like by registration processing of the registration processing unit 610 described later. It may be a thing.

  In addition, when a player joins a group from a terminal device, for example, when the player uses the terminal device to select the start of a communication game using the group or makes a group matching request, For example, it is transmitted from the terminal device to the server system.

  The room is a place (place in the virtual space) where the player waits for waiting (preparation) before the start of the communication game, for example. The group may be organized by a plurality of players who play a joint game, or may be organized by a plurality of players who play a battle game. Alternatively, the group may be organized by one or a plurality of players playing a battle game with one or a plurality of players playing a joint game.

  In addition, the communication game is a game that is performed while communicating information between a server system and a terminal device that are connected through a network such as the Internet. As a communication game using a group, various forms such as a battle game between groups, a joint game between groups, a battle game between players in a group, or a joint game between players in a group are available. A game can be assumed. In addition, the communication game may be a game realized by an arcade game device as shown in FIG. 2 or a game realized by a home game device. Alternatively, the communication game may be a game for a personal computer or an SNS (social network) game realized by a portable communication terminal device such as a smartphone. The process for the communication game performed by the game processing unit 608 includes a process for starting a game when a game start condition is satisfied, a process for advancing the game, a game score calculation process, or a game end condition. There is a process to end the game in the event of a failure. These processes may be performed independently by a server system or the like (game system), or may be realized by distributed processing of the server system and the terminal device.

  The matching processing unit 606 starts the matching period when a participation request is received from the terminal device of the first player who has input the keyword. That is, the count of the time limit for the matching period is started. Then, when a participation request is received from the terminal device of the second player who has input the same keyword within the started matching period, the second player enters the room. For example, when a room is created in response to a request from the first player and a matching period starts, and when a request for participation comes from the second to Nth players who have input the same keyword within the matching period, The Nth player enters the room.

  In addition, the matching processing unit 606 ends the matching period when there is an instruction to end matching from the terminal device of the player who has entered the room within the matching period. For example, even when the number of players entering the room does not reach the room capacity, if there is an instruction to end the matching from the terminal device of the player who has entered the room, the matching period is terminated and terminated. An instruction to end matching can be input by the player using the operation unit of the terminal device, for example.

  In this case, the matching processing unit 606 ends the matching period within the matching period, for example, when there is an instruction to end matching from the terminal device of the first player. That is, a room is created, and the matching period is ended when there is a matching end instruction from the terminal device of the first player who is the host of the room. In this case, the matching period is not terminated by the matching termination instruction from the terminal device of another player.

  The matching processing unit 606 performs a process for notifying the player of the matching status information from the start of the matching period until the end of the matching period. That is, the matching status information is notified to the player during the matching period. Here, the matching status information is, for example, information for identifying a player who has entered the room (player icon image, name, nickname, etc.), information on the order of player entry, information on the number of players who have entered the room, or information on the player Notification information. For example, when the matching status information changes in real time within the matching period, a process for notifying the player of the change is performed. This notification process can be realized, for example, by outputting an image or sound for notifying the matching status information.

  Also, the matching processing unit 606 closes the room entry when the number of players who have entered the room by entering the same keyword within the matching period has reached the capacity. For example, after reaching the number of rooms, even if there is a request for participation from a player who has input the same keyword, the player is prevented from entering the room (the room that has reached the capacity).

  In this case, the matching processing unit 606 may change the number of people in the room according to the communication game held in the matching period. For example, the capacity is set according to the communication game held in the matching period (the time period of the matching period). It is assumed that the first and second communication games are held during the matching period, and the first communication game has a larger number of groups than the second communication game. In this case, it is desirable to set the room capacity to, for example, the group capacity in the first communication game.

  In addition, when the number of players who enter the room by entering the same keyword at the end of the matching period is less than the number of players when the matching period ends, the matching processing unit 606 belongs to another group obtained by matching. To perform the process. For example, a player that matches the level of the player is searched from players on the network, and the player is assigned to the group. If an appropriate player cannot be searched, for example, a computer player (player who plays according to a given algorithm) belongs to a group.

  The matching processing unit 606 creates another room when a request for participation is received from the terminal device of another player who has input the same keyword after the matching period ends, and the other player To enter the room. For example, when the number of players entering the room reaches the maximum number or the time limit for the matching period elapses, the matching period ends. Suppose a request comes. In this case, the matching processing unit 606 performs processing for creating another room and allowing the other player to enter the other room. For example, when the number of players entering the first room reaches the maximum number of people or the time limit has passed, the matching period ends, and then the same keyword as that of the first room is entered. When the player requests participation, a second room is created and another player enters the second room. In this case, the first room is hidden from view by another player. Then, when another player who has input the same keyword requests to participate, the player enters the second room. When the matching period of the second room ends, a third room is created this time. Thus, every time the matching period ends, another room is created. In this case, as the end of the matching period, for example, an end due to reaching the capacity, an end due to the elapse of the time limit, or an end due to an end instruction from the player can be assumed.

  The server system 500 (game system) in FIG. 3 includes a registration processing unit 610. A registration processing unit 610 performs registration processing of player user information and the like. For example, the registration processing unit 610 receives an input of a keyword when the player inputs the keyword. Then, the received keyword is associated with the player and registered in the storage unit 670. For example, the user information storage unit 678 of the storage unit 670 is referenced to search for user information of the player who has input the keyword. Then, the input keyword is written in the keyword field in the searched user information. By doing so, the written keyword is stored in association with the player.

  As described above, when a keyword is registered, the registration processing unit 610 performs a process for allowing a player in which the keyword is registered to select a game mode to be played by a group organized by the keyword. . For example, in a terminal device of a player who has not registered keywords, a game mode to be played by a group organized by keywords cannot be selected. For example, such a game mode selection item is not displayed on the game mode selection screen of the terminal device of the player. On the other hand, the terminal device of the player who has registered the keyword can select a game mode to be played by a group organized by the keyword. For example, such game mode selection items are displayed on the game mode selection screen of the terminal device of the player. For example, the server system 500 transmits user information in which a keyword field (item) is blank to a terminal device of a player who has not registered a keyword. On the other hand, the server system 500 transmits the user information in which the keyword is written in the field to the terminal device of the player who has registered the keyword. By doing so, it becomes possible to permit a game mode of playing with a group organized by a keyword only to a player in which the keyword is registered.

  The matching processing unit 606 may perform processing for displaying information on a plurality of rooms that can be entered by inputting the same keyword on the player. For example, a screen (lobby screen) on which information on a plurality of rooms is displayed is displayed on the terminal device. For example, information on a first room in which a first group of players organized by the method of the present embodiment has entered, and information on a second room in which a player of the second group organized by the method of the present embodiment has entered. Information is displayed on the terminal device. In this case, a battle game may be performed between the first group and the second group, or a joint game that achieves a joint purpose is performed between the first group and the second group. You may be made to be.

2. Next, the method of this embodiment will be described. In the following description, the case where the method of the present embodiment is realized by a server system that is communicatively connected to a game device will be mainly described. Hereinafter, the server system is appropriately referred to as a server.

2.1 Group organization by keyword In a communication game (Network game) using a network, a matching process for determining a group to which a player belongs is performed. For example, when a group battle (hereinafter referred to as a team battle) is played between groups, a group (hereinafter referred to as a team) is organized by matching processing prior to the start of the game.

  For example, in the method of the first comparative example, the first to fourth players who are friends enter the game devices GM1 to GM4 installed in the same store as shown in FIG. Then, each of the first to fourth players selects a simultaneous dispatch mode (burst dispatch) in which team members simultaneously perform on the game mode selection screen of each game device GM1 to GM4. When all the first to fourth players select the simultaneous dispatch mode and the teams (groups in a broad sense) of the first to fourth players are formed, they are formed by other players nationwide. A nationwide battle will be held to play against the team that was made. By doing in this way, the player can form a team with friends who are in good luck, and enjoy a battle game with the teams of other players. Taking the robot battle game as an example, the first to fourth robots operated by the first to fourth players constituting the first team and the fifth to eighth players constituting the second team. A team battle is performed with the fifth to eighth robots operated by.

  However, in the method of the first comparative example, in order for friendly friends to form a team, it is necessary for all players to play on the game device in the same store. For this reason, for example, a team in a store in a distant store such as a store in Tokyo and a store in Osaka cannot form a team match.

  As a method of the second comparative example, the battle date and time, participating members and the like are determined in advance, and these pieces of information are registered in the server database as battle reservation information. The server manages the battle reservation information, and the player A technique for allowing a player to play a battle game is conceivable. In the method of the second comparative example, when the registered (reserved) battle date and time approaches, the server notifies the registered member members that the battle game will be started soon by e-mail or the like. When the registered battle date and time is reached, a battle game by the registered participating members is automatically started.

  However, in the method of the second comparative example, it is necessary to register (reserve) the battle date and time in advance. For this reason, for example, if one of the members becomes inconvenient at the registered match date and time or the game device in the store is not free due to the game play of another player, the game can be started at the scheduled match date. The situation that disappears will occur. Further, in the second comparative example, the server needs to manage the battle reservation information and the like, which increases the processing load on the server and the amount of processing data, thereby increasing the load on the server. There is also a problem.

  Therefore, in the present embodiment, a technique of using a keyword input by the player is employed for the group organization matching process. For example, a player inputs a secret word or the like decided between friends as a keyword, and based on the keyword, matching processing is performed with less restrictions than the method of the second comparative example described above. Specifically, a room for a communication game is created based on the input keyword, and a player who has input the same keyword enters the room. That is, when a player inputs a keyword for identifying a player who belongs to the same group and plays a communication game, and makes a request to join the communication game group (matching request), a room corresponding to the keyword is created. . After that, when another player who inputs the same keyword makes a participation request (matching request), the other player who inputs the keyword enters the room. This realizes a matching process in which players who input the same keyword belong to the same group.

  FIG. 6, FIG. 7 (A), and FIG. 7 (B) are diagrams for explaining the method of this embodiment. In A1 of FIG. 6, three players who live in Yokohama, Omiya, and Shinagawa have a dialogue such as “Let's search for keywords from 9:00 tomorrow” via SNS such as LINE (registered trademark) or email. Yes. In A2, the SNS or the like is informed to another player that the keyword for keyword selection is, for example, the keyword “Matsuri Daisuki”. The keyword “Matsuri Daisuki” is a secret word of the three players, and is a word decided by friends. After that, these three players get into the game devices of the stores in their residences (Yokohama, Omiya, Shinagawa) around 9 o'clock, which is the promised time decided in A1, and as shown in A5, “ Enter the keyword “Matsuri Daisuki”. When all three players enter the same keyword, these three players can belong to the same team. Therefore, friends who are in remote locations belong to the same team and can play a battle game with other teams.

  In A3 of FIG. 6, a player who lives in Nagoya asks on the bulletin board on the Internet, "Would you like to make a keyword on this Sunday?" In response to this question, players who live in Omiya and Kitakyushu replied, “You can join in the evening” or “Please join me”. In A4, a Nagoya player says “I need your help with this keyword” and wrote the keyword “Matsuri Daisuki” on the bulletin board. The player who lives in Omiya or Kitakyushu knows the keyword by this writing and promises to register it as a keyword for keyword selection. After that, these three players get into the game devices of the stores in their respective residences (Nagoya, Omiya, Kitakyushu) on Sunday evening and enter the keyword “Matsuri Daisuki” as shown in A5. To do. When all three players enter the same keyword, these three players can belong to the same team. Therefore, for example, even if players with the same skill and the same consciousness live in remote places, they can belong to the same team and play a battle game with another team.

  In FIG. 7A, a player living in Yokohama (Tanaka) makes a request (entry) to participate in the keyword selection at the beginning at the promised time. For example, the player enters a game device in a store in Yokohama, and selects a keyword-playing game mode in which a team is organized based on a keyword and then is played. Thus, in this embodiment, when the first player makes a participation request, a room corresponding to the keyword is created at that timing. For example, in FIG. 7A, a room corresponding to the keyword “Matsuri Daisuki” is created. Then, the matching period for the room starts.

  After that, when the Omiya player (Yoshida) who inputs the keyword “Matsurai Daisuki” selects the keyword sortie, the Omiya player enters the “Matsudai Daisuki” room as the second player. Next, when a Shinagawa player (Aoki) who has input the keyword “Matsuri Daisuki” selects keyword sortie, that Shinagawa player enters the room as the third player.

  Then, when a given time limit elapses after the first player in Yokohama makes a request for participation, the matching period ends and entry into the room is closed. Thereafter, three players form a team and a battle game with another team is played.

  In B1 of FIG. 7 (B), after the battle game is over, the three players discuss the strategy of the next battle by reflecting on the current game at SNS or the like. After that, these players make a promise as shown in A1 of FIG. 6 and the like, and again form the same team to challenge the next match. In B2, three players are promised to perform the next match on the bulletin board, for example, at 35 minutes of the time. Then, the three players select the keyword sortie on the game device when it becomes 35 minutes while watching their clocks. By doing so, it becomes possible to enjoy the next competitive game by forming the same team again.

  According to the method of the present embodiment described above, when a plurality of players input keywords such as passwords, a group is organized by the players who have input the same keyword, and a communication game using the organized group is performed. It becomes like this. Therefore, it is possible to enjoy a group of friends who are close to each other and players who have the same skill and the same consciousness even if they are in a remote place and play a communication game together. For example, in conventional game systems, when a regular member can no longer participate in the game, or when a friend leaves the office due to employment, for example, there is no other person to form a group together. I had to play the game. According to the method of the present embodiment, even in such a case, it is possible to enjoy a battle game or a joint game by a group by inputting the same keyword at a remote store and participating in the communication game.

  Further, in the method of the second comparative example described above, it is necessary to input the battle reservation information such as the battle date and time and the battle members in advance and register them in the database of the server. Therefore, there is a problem that the processing load and the processing data amount of the server increase. In addition, once a battle date and time and a battle member are registered, it is difficult to change it, and it is difficult to cope with this when some players do not meet the promised battle date and time. is there.

  In this regard, in the present embodiment, groups are organized by a loosely limited matching process called keyword matching. Accordingly, it is not necessary to previously register the battle date and time and the battle members in the database of the server, so that it is possible to suppress an increase in server processing load and processing data amount.

  Further, in this embodiment, it is only necessary to determine the keywords among the players, and the battle date and time and participating members can be flexibly changed by dialogue on the SNS or the bulletin board on the Internet. Therefore, even when some players are not in time for the promised match date or when there is a sudden member change, it becomes possible to flexibly cope with this. In other words, with the spread of SNS and the like, it is possible to easily and instantly transmit information such as the date and time of a battle and participating members between players without using a server for managing a game. In this embodiment, paying attention to this point, the transmission of information such as the date and time of the battle and the participating members is left to information transmission by SNS or the like. Then, the player decides only the keyword among the friends, and enters the keyword at the battle date and time transmitted using SNS or the like to participate in the communication game. By doing so, it is possible to enjoy a battle game or a joint game by organizing a group among players who input the same keyword while suppressing an increase in the load on the server.

2.2 Matching Process and Matching Period FIGS. 8A to 9B are detailed explanatory diagrams regarding the matching process and the matching period of the present embodiment. In FIG. 8A, for example, a request for participation (entry) comes from the game device GMA (terminal device in a broad sense) of the player PA (first player) that has input the keyword “Matsuri Daisuki” to the server. Yes. Specifically, the player PA selects a keyword sorter to enter by entering a keyword in the game device GMA, and the game device GMA that receives this selects a server participation request (group matching). Request).

  Then, as shown in FIG. 8B, in this embodiment, for example, a server (matching server) creates a room corresponding to the keyword. That is, a room associated with the keyword “Matsuri Daisuki” is created. For example, a channel for matching processing is formed as a room, and the keyword “Matsuri Daisuki” is associated with the channel. When the room is created in this way, the matching period starts and the player is informed that the remaining time (time limit) of the matching period is, for example, 240 seconds.

  Next, in FIG. 8C, a request for participation is received from the game device GMB of the player PB (second player) who has input the same keyword as the player PA (“Matsuri Daisuki”). Specifically, the player PB selects the keyword selection in the game device GMB, and the game device GMB that receives the keyword issues a request to join a group (request for group matching) to the server.

  Then, as shown in FIG. 8D, a process for allowing the player PB to enter the room of “Matsuri Daisuki” is performed. As a result, the players PA and PB that have input the same keyword enter the room corresponding to the keyword, and a matching process for allowing the players PA and PB to belong to the same group is realized. At this time, the remaining time of the matching period decreases from 240 seconds in FIG. 8B to 195 seconds, for example.

  As described above, in the present embodiment, processing for sequentially entering a player who has input the same keyword into a room corresponding to the keyword is performed. Specifically, as shown in FIG. 9A, a player PA (first player) makes a participation request, a room is formed, and a matching period starts. Then, when a request for participation is received from the game devices of the players PB, PC, and PD that input the same keyword within the started matching period, a process of entering these players PB, PC, and PD into the room corresponding to the keyword is performed. Is called.

  Then, when the matching period ends (for example, 240 seconds have elapsed), the room entry is closed. Specifically, as shown in FIG. 9B, the remaining time of the matching period is 0 seconds, and the fact that acceptance of the participation request has been completed is notified to the player who has requested the participation thereafter. Then, after the end of the matching period, a communication game using a team formed by the players PA, PB, PC, and PD starts.

  As described above, in the present embodiment, as shown in FIG. 9A, when the first player PA inputs a keyword and requests participation, the matching period TA starts. Then, when other players PB, PC, and PD who input the same keyword make a participation request within the matching period TA, a process of entering these players PB, PC, and PD into the room is performed. When the time limit elapses, the matching period TA ends, entry into the room is closed, and a battle game or the like starts.

  In this way, even if the battle date and time is not registered (reserved) in advance as in the method of the second comparative example described above, the matching period starts in response to the first player's participation request. After the end, it becomes possible to start a battle game using a group organized by keyword input. Therefore, it is not necessary to register the battle date and time in the server database, and the load on the server can be reduced.

  In addition, for example, in a prior discussion by SNS or the like, the start of the battle game was 18:00, but one of the members could not start the battle game unless it was 19:00 due to work or other reasons. Is assumed. In such a case, according to this embodiment, one of the members notifies other players that participation is delayed by SNS or the like. The key member player who received this delays the request for participation in the keyword sortie from 18:00 to 19:00. Then, the start of the matching period, which was originally scheduled to start at 18:00, is delayed and becomes 19:00. Then, for example, when the time limit of 240 seconds or the like elapses, the matching period ends and the battle game starts. Accordingly, the battle game can be started from about 19:00, and a player who is delayed due to work or the like can join the group and play the battle game. Therefore, the method of the present embodiment has an advantage that it can flexibly cope with a change of the start time due to the circumstances of the member, etc., compared with the method of the second comparative example.

  In addition, in matching by keyword input, an unintended player may join the group. For example, the first to fourth players decide keywords and try to create a group, but if the fifth player accidentally inputs the same keyword and requests participation, the fifth player A situation occurs in which the player is transferred to the group of four players.

  In this regard, in the present embodiment, a matching period is provided, and the matching period is terminated with a short time limit such as 240 seconds. Therefore, for example, unless the fifth player inputs the same keyword and requests participation within 240 seconds, for example, the fifth player will be in the group when the first player requests to join. Will not be incorporated into. Therefore, it is possible to effectively suppress the occurrence of such a situation that the fifth player is accidentally incorporated into the first to fourth groups.

  Moreover, if the length of the matching period is long, the waiting time of the player before the start of the battle game becomes long, and the operation rate of the game device may be lowered. In this respect, in the present embodiment, a matching period is provided and the matching period is ended in a short period, thereby suppressing such a decrease in the operating rate of the game apparatus.

  In this embodiment, as shown in FIGS. 8B, 8D, and 9B, in this embodiment, processing for notifying the player of matching status information from the start of the matching period until the end of the matching period. It is carried out. For example, in FIG. 8B, information (name, icon face image, etc.) of the first player who created the room and information on the remaining time of the matching period are notified (displayed) to the player. In FIG. 8D, information of the second player in addition to the first player is notified. Also, the player is informed of the points that are within the matching period and are accepting participation and the remaining time of the matching period. Further, the screen is changed as shown in FIG. 8B to FIG. 8D, so that the player is notified that the members who have entered the room and the number of people who have entered the room have changed. Also, in FIG. 9B, the end of the matching period and the acceptance of participation, and information on the players of the last member of the group are informed.

  In this way, by notifying the player of the matching status information within the matching period, it is possible to effectively convey appropriate information necessary for requesting participation to the player who is requesting participation. For example, the player can check whether the player who has entered the room is surely his friend or the like by looking at the matching status information. In addition, it will be possible to confirm how long the matching period will end, information on friends who were scheduled to participate but have not been requested to participate.

  In the present embodiment, the matching period is ended when there is an instruction to end the matching from the game device (terminal device) of the player who entered the room within the matching period. Specifically, for example, when there is an instruction to end matching from the game device of the first player (first player) who created the room within the matching period, the matching period is ended.

  For example, in FIG. 10A, three players have entered the room, and the number of people entering the room does not reach the capacity = four people described later. In addition, since the time limit for the matching period has not elapsed, a point indicating that participation is being accepted is displayed on the screen. Further, the point that the recruitment is canceled when the player presses the start button of the game apparatus and the matching period ends is displayed on the screen.

  In FIG. 10B, within the matching period, the player entering the room gives an instruction to end the matching period, and the matching period ends. Specifically, the first player PA presses a start button provided on the game device, so that the recruitment is terminated and the matching period ends. That is, although the time limit has not elapsed, the matching period ends with the intention of the player.

  For example, it is assumed that the initially planned number of participants was 4, but the number of participants was reduced to 3 because the convenience of one player was not convenient. The first player PA, which is a key member, knows the non-participation of the inconvenient player through contact via SNS or e-mail. Therefore, in such a case, even if the matching period continues, time is wasted. Therefore, after confirming the participation of other players PB and PC on the screen of FIG. 10A, the player PA ends the matching period by pressing the start button of his game device before the time limit has elapsed. Let By ending the matching period in this way, it becomes possible to immediately start a battle game with another team by keyword search. That is, in FIG. 10A, when the end of the matching period is waited, for example, the player waits for at least 150 seconds before starting the battle game.

  In this regard, if the matching period can be ended as shown in FIG. 10B by the player's end instruction, a battle with another player's team can be started immediately without waiting for the 150-second waiting period to elapse. It becomes like this. Therefore, the stress felt by the player can be eliminated and the operating rate of the game device can be improved.

  In FIGS. 10A and 10B, the first participation request player PA is a key member player, and the authority to end the matching period or select each option of the game play is given. In this way, by giving the authority only to one player PA, it is possible to prevent a situation in which confusion arises when a large number of players make different selections. In addition, by leaving the player PA to make selections for setting a keyword battle, the player PA can be set as a key member player, and the game can proceed smoothly.

  In the present embodiment, when the number of players who enter the room by inputting the same keyword reaches the capacity, the entrance to the room is closed. That is, even if the time limit for the matching period has not elapsed, when the number of people entering the room reaches the maximum number of people, the room is closed, and thereafter, no other player can enter the room. By providing a fixed number in this way, it becomes possible to play a battle or the like between teams having an appropriate number of members.

  In this case, in this embodiment, the number of people is changed according to the communication game held within the matching period. For example, in the present embodiment, a communication game with a different number of people is held according to the date (date and time) of the event.

  Specifically, in FIG. 11A, a national battle mode and an event battle mode are prepared as the battle mode, and the player can arbitrarily select them. The nationwide battle mode is a mode in which players gathered from all over the country form a team and compete. The event battle mode is a battle mode in which participation conditions and special rules are set. Like the nationwide battle mode, players gathered from all over the country form a team and battle each other. As shown in FIG. 11 (A), the number of players in the national battle mode is fixed at 4 people, but in the event battle mode, the number of players varies depending on the date of the event. For example, the number of matches for the event E held on July 1 is six, and the number of matches for the event F held on July 2 is three.

  In the present embodiment, when the number of players is different between the national battle mode and the event battle mode, the number of people in the room is set to the maximum number of players in the battle mode. Therefore, on July 1st, the number of people entering the room will be set to 6 people (= the number of matches for Event E), and on July 2, the number of people will be 4 (= nationwide number of matches). Is set. In this way, the number of people entering the room during the matching period changes according to the date (or date and time). That is, the number of people entering the room changes according to the communication game (national match, event match) held within the matching period.

  Therefore, when the date to which the matching period belongs is July 1, as shown in FIG. 11 (B), the number of people entering the room is set to six (= the number of people in the event E match). When the number of people entering the room reaches 6, the reception is ended. That is, even if the time limit for the matching period has not elapsed, the room entry is closed and the number of teams formed is six. In other words, since it is not certain whether the player chooses the battle mode of the national battle or the event battle after this, the number of people entering the room matches the number of the battle mode of the larger battle mode. When a team of six people is formed, the nationwide battle mode having a capacity of four is not displayed on the screen of the game device of the player (first player) as a battle mode option. Therefore, if the player wishes to play nationwide, the recruitment may be terminated when the number of people entering the room reaches four.

  Further, in this embodiment, when the matching period ends because the number of people in the room reaches the capacity, a method of creating another room and allowing subsequent players to enter the other room is used. Adopted. Specifically, the number of people entering the room has reached the capacity, the time limit has passed, or the player has given an end instruction, and the matching period ends. It is assumed that a participation request is received from the terminal device of the player. In this case, another room is created, and the other player enters the other room.

  For example, in FIG. 12, a player PA who has input a keyword makes a participation request, thereby creating a room R1 and starting a matching period TA1. When the players PB, PC, and PD who input the same keyword as the player PA make a participation request within the matching period TA1, these players PB, PC, and PD enter the room R1. When the number of people entering the room reaches four, which is the maximum number, the room R1 is closed and the matching period TA1 ends. Alternatively, the matching period TA1 ends when the time limit of the matching period TA1 elapses or when the player PA is instructed to end.

  Then, after the matching period TA1 ends, it is assumed that another player PE who inputs the same keyword as the player PA makes a participation request. Then, in this case, a room R2 different from the room R1 is created, and the matching period TA2 is started. Then, when the players PF, PG, and PH who input the same keyword as the players PA and PE make a participation request within the matching period TA2, these players PF, PG, and PH enter the room R2. When the number of people entering the room reaches four, which is the maximum number, the room R2 is closed and the matching period TA2 ends. Alternatively, the matching period TA2 ends when the time limit of the matching period TA2 elapses or when the player PE is instructed to end.

  When another player PI who has input the same keyword as the players PA and PE makes a participation request after the matching period TA2 ends, another room R3 is created and the matching period TA3 is started. When the players PJ, PK, and PL who input the same keyword as the players PA, PE, and PI make a request for participation within the matching period TA3, the players PJ, PK, and PL enter the room R3. When the number of people entering the room reaches four, which is the maximum number, the room R3 is closed and the matching period TA3 ends. Alternatively, the matching period TA3 ends when the time limit of the matching period TA3 elapses or when an instruction to end the player PI is given.

  In this way, even if the number of players entering the room reaches the maximum number or the matching period ends because the time limit has elapsed, players who have entered the same keyword after that time will be in another room. It becomes possible to form a team in another room.

  For example, as shown in A3 and A4 in FIG. 6, when a keyword is written on a bulletin board on the Internet and a teammate is recruited, there is a possibility that many players will enter the same keyword and request participation. There is. Even in such a case, as shown in FIG. 12, if a method of creating another room every time the matching period of the previous room ends is adopted, a large number of players who input the same keyword can make each team It becomes possible to enjoy a battle etc. by assembling. In addition, a keyword determined by a friend may accidentally become the same keyword as a keyword of another player. Even in such a case, if another room is created by adopting the method shown in FIG. 12, it is possible to play a battle game by making friends belong to the same team.

  In the present embodiment, when the number of players who enter the room by entering the same keyword when the matching period is over is less than the number of players, the process of allowing other players obtained by matching to belong to the group I do.

  For example, in FIG. 13A, the number of rooms is four, but the recruitment is closed in a state where only three players who are less than the number of people are gathered. For example, although four friends were scheduled to gather at the beginning, one person can no longer come by convenience, and the first player who knows it has pushed the start button of the game device and has closed the recruitment. Alternatively, there may be a case where the time limit has elapsed and the matching period ends in a state where only three players less than the number of players are gathering.

  Thus, when the number of players entering the room is less than the fixed number, other players obtained by matching belong to the team (group) in order to fill the number of players. For example, in FIG. 13B, a player of the same level as the three players who have already participated is searched from all over the country, and that player belongs to the team as the fourth player. As a result, the number of teams reaches, for example, four, which is the capacity of the nationwide battle mode, and the four players can form a team and play against other teams. If the fourth player cannot be searched from all over the country, a computer player operating with a given algorithm may belong to the team.

2.3 Registration Process In this embodiment, it is desirable to perform a process for registering the keyword input by the player in the storage unit in association with the player. That is, when the player inputs a keyword, the registration processing unit 610 in FIG. 3 accepts the input of the keyword. Then, the received keyword is associated with the player and registered in the storage unit 670 (database). Specifically, the input keyword is written and registered in the user information of the player. In this way, for example, it is possible to save the trouble that the player must input a keyword every time the player selects a keyword battle.

  For example, in FIG. 14A, the player registers the user information in the user information storage unit of the server (database server). This user information is associated with the game card CD (IC card) and the communication terminal device TCM. That is, the player can call up the user information or rewrite the user information by using the game card CD or the communication terminal device TCM.

  FIG. 14B shows an example of user information. This user information has fields (items) such as a user ID, name, class, and keyword. In FIG. 14B, corresponding information is written in the user ID, name, and class fields, but the keyword field is blank. That is, since the user has not yet input a keyword, this field is blank.

  In FIG. 15A, the player touches the game card CD on the card reader of the game management device MN (terminal) of FIG. As a result, the user information in FIG. 14B is downloaded from the server to the game management device MN. That is, using the ID recorded on the game card CD as a key, the user information of the player is read from the storage unit 670 (user information storage unit) of the server and downloaded to the game management device MN.

  Next, the player inputs a keyword, which is a secret word between friends, in the game management device MN. As a result, the input keyword “Matsuri Daisuki” is written in the keyword field that is blank in FIG. 14B. Then, the user information in which the keyword is written is uploaded from the game management device MN to the server and stored in the storage unit 670 (user information storage unit) of the server.

  As described above, the keyword input by the player is registered in the storage unit 670 in association with the player (user information).

  Next, the player gets into the game device GM and touches the game card to the card reader of the game device GM. Then, the user information of the player registered as described above is downloaded from the server to the game device GM. In the keyword field of the downloaded user information, the keyword “Matsuri Daisuki” is written. Accordingly, on the game mode selection screen of the game apparatus GM, there are displayed keyword selection options for organizing a team based on keywords and making an appearance. That is, when the keyword field of the user information is blank as shown in FIG. 14B, the keyword selection option is not displayed on the game mode selection screen, but the keyword is written in the field. Then, the keyword selection options will be displayed.

  Then, when the player selects keyword sortie, the keyword can enter the room. Specifically, in FIG. 15B, since the player first selected the keyword sort out among friends, there is a room associated with the keyword “Matsuri Daisuki” based on the player's request for participation. Created. After that, when a fellow player who has registered the same keyword selects keyword selection on another game device, the fellow player enters the created room and forms a team with the player.

  As described above, in this embodiment, the keyword input by the player is registered in association with the player (user information). As a result, as shown in FIG. 15B, when the player enters the game apparatus GM and selects the keyword selection, it is not necessary to input the keyword again. That is, it is possible to enter a room corresponding to a registered keyword simply by selecting a game mode for keyword dispatch. For example, when the first keyword sort is completed and the second keyword sort is performed, it is not necessary to input the keyword again. Therefore, as long as the keyword is selected with the same keyword, the trouble of inputting the keyword every time the keyword is selected becomes unnecessary, and the convenience for the user can be improved.

  In the present embodiment, a process for allowing a player in which a keyword is registered to select a game mode to be played by a team (group) organized by the keyword is performed. Specifically, as shown in FIG. 15B, when a keyword is registered and the keyword is written in the keyword field of the user information, it is possible to select a keyword sortie to be played by a team organized by the keyword. . For example, when the player touches the game card CD on the card reader of the game device GM, the server (registration processing unit) downloads the user information to the game device GM. And so on. In this way, for a player who has registered a keyword, a keyword selection option is displayed as a game mode option. Then, when the player selects this option, matching processing for the team is automatically executed.

  In addition, although the case where only one room is displayed as a room that can be entered by inputting a keyword has been described above, the present embodiment is not limited to this. In the present embodiment, processing for displaying information on a plurality of rooms that can be entered by inputting the same keyword on the player may be performed.

  For example, in FIG. 16, information on four rooms R1, R2, R3, and R4 is displayed as rooms that can be entered by inputting the keyword “Matsuri Daisuki”. For example, as in A3 and A4 of FIG. 6, when a keyword is written on the bulletin board and participation players are recruited, it is assumed that an unspecified number of players participate in the keyword sortie. On the other hand, the capacity of each room (team) is not so large. Therefore, in such a case, as shown in FIG. 16, information on a plurality of rooms is displayed as rooms that can be entered by inputting the same keyword. In this way, each participating player can enter a desired room, form a team, and enjoy a battle game between the teams. For example, a player of the fellow group 1 can enter the room R1 and form a team, and a player of the fellow group 2 can enter the room R2 and form a team. Thereby, the convenience for the user can be further improved.

  Further, when displaying information on a plurality of rooms, the information may be displayed separately for each army to which the team of the room belongs. For example, in FIG. 17, team rooms belonging to the Y army are displayed in the left compartment (first region), and team rooms belonging to the Z army are displayed in the right compartment (second region). . In this way, a player who wants to belong to the Y army enters the rooms RY1 and RY2 of the Y army team, forms a team, and a player who wants to belong to the Z army is a team of the Z army. It becomes possible to form a team by entering the rooms RZ1, RZ2. Then, for example, the team of the Y army room RY1 and the team of the Z army room RZ1 can battle each other, and the team of the Y army room RY2 and the team of the Z army room RZ2 can battle each other. This makes it possible to divide the team into consideration for belonging to each army.

  In addition, as shown in FIG. 18, you may mix an enemy and a friend player in a group. For example, in FIG. 18, the player who entered the first, second, fourth and eighth members belongs to the Y army (ally), and the player who entered the third, fifth, sixth and seventh members is the Z army. Belongs to (enemy). Then, the first team is formed by the first, second, fourth, and eighth players belonging to the Y army, and the second team is formed by the third, fifth, sixth, and seventh players belonging to the Z army. A competitive game is played between this team and the second team. As described above, various modes can be envisaged as the mode of the player constituting the room.

  In addition, information on other players who have registered the same keyword is extracted and transmitted to the game device that has requested the selection of keyword selection or transmission of user information, and information on players that are candidates for team formation is displayed. You may make it perform the process for doing. As a result, the player who has started the game can check the status of the player who has already registered but has not started the game.

  For example, the first to fourth players who are friends have registered the keyword “Matsuri Daisuki”, and the first player among these first to fourth players is as shown in FIG. Assume that the game is started by selecting keyword sortie. In this case, the server extracts the information of the second to fourth players (information of other players) in which the keyword “Matsuri Daisuki” is registered, and transmits it to the game device of the first player. In this way, the first player who has started the game first can check the status of the second to fourth players who have not yet started the game.

3. Detailed Processing Next, a detailed processing example of the present embodiment will be described with reference to the flowcharts of FIGS. 19, 20, and 21.

  FIG. 19 is a flowchart for explaining the keyword registration process described in FIGS. 14A to 15B.

  First, it is determined whether or not the player has selected keyword registration (step S1). For example, in FIG. 15A, the player touches the game card CD on the card reader of the game management device MN. When the player selects keyword registration on the selection screen of the game management device MN, it is determined that the player has selected keyword registration.

  Next, it is determined whether or not the keyword is unregistered for the player (step S2). If not registered, a keyword input screen is displayed as shown in FIG. 15A (step S3). For example, when the keyword field of the user information is blank as shown in FIG. 14B, it is determined that the keyword has not been registered, and a keyword input screen is displayed. Then, it is determined whether or not the keyword registration is successful (step S4), and if successful, the user information is updated and the input keyword is registered (step S5). For example, the keyword input by the player is written in the keyword field of the user information, and the user information in which the keyword is written is uploaded from the game management device MN to the server.

  On the other hand, if it is determined in step S2 that the keyword has been registered, the registered keyword is displayed (step S6). For example, when the keyword “Matsuri Daisuki” is registered, the keyword is displayed on the display unit of the game management device MN. Then, it is determined whether or not the player has selected to cancel keyword registration (step S7). And when cancellation | release of registration is selected, user information is updated and registration of a keyword is cancelled | released (step S8). Thereby, the keyword field of the user information becomes blank, and the player can register a new keyword.

  20 and 21 are flowcharts for explaining the matching processing of this embodiment.

  First, it is determined whether or not there is a request for participation in the keyword selection from the player (step S11). For example, in the game mode selection screen shown in FIG. 15B, when the player selects keyword sortie, it is determined that a participation request has been made. If there is a participation request, the keyword input by the player is acquired with reference to the user information of the player (step S12). For example, the user information in the storage unit 670 of the server is searched, and the keyword written in the keyword field of the user information is extracted.

  Next, it is determined whether or not a room for the keyword has already been created (step S13). If a room has not yet been created, a room for the keyword is created (step S14). For example, as described with reference to FIGS. 8A and 8B, when the first player makes a participation request, a room for the keyword is created. Then, as described with reference to FIG. 9A, the matching period is started (step S15).

  On the other hand, if it is determined in step S13 that a room has already been created, the player is allowed to enter the room as described with reference to FIGS. 8C and 8D (step S16). Then, it is determined whether or not the number of players entering the room has reached the capacity (step S17). If the number has reached the capacity, the matching period as described with reference to FIGS. 9A and 9B. Is finished (step S18).

  As shown in FIG. 21, when it is determined that the matching period has started (step S21), the time limit for the matching period is counted (step S22). Then, it is determined whether or not the time limit has passed (step S23). If the time limit has passed, the matching period is ended (step S25). On the other hand, if the time limit has not elapsed, it is determined whether or not a matching period end instruction has been received from the player (step S24). When there is an end instruction, the matching period is ended as described with reference to FIGS. 10A and 10B (step S25). On the other hand, if there is no termination instruction, the process returns to step S22.

  Although the present embodiment has been described in detail as described above, it will be easily understood by those skilled in the art that many modifications can be made without departing from the novel matters and effects of the present invention. Accordingly, all such modifications are intended to be included in the scope of the present invention. For example, a term (team, game device, server system, etc.) described at least once together with a different term (group, terminal device, game system, etc.) in a broader sense or the same meaning is used in the specification or drawing. It can be replaced by the different terms at any point. Also, room creation / entry processing by keyword, matching processing, matching period control processing, keyword registration processing, etc. are not limited to those described in this embodiment, and techniques equivalent to these are also included in the scope of the present invention. It is. The present invention can be applied to various games. The present invention can also be applied to various game devices such as a business game system, a home game system, a large attraction system in which a large number of players participate, a simulator, a multimedia terminal, a system board for generating game images, and a mobile phone. .

GM1-GM4 game device, MN game management device, TCM communication terminal device,
TM1-TMn terminal device, TA, TA1-TA3 matching period,
10 monitor, 22, 23 control lever, 24, 25 pedal, 28 card reader,
40 monitor, 42 touch panel monitor, 44 card reader,
46 unloading port, 48 loading port,
100 processing unit, 102 game processing unit, 104 object space setting unit,
106 mobile object calculation unit, 108 virtual camera control unit, 110 reception processing unit,
114 transmission processing unit, 116 battle processing unit, 120 display control unit, 130 sound control unit,
160 operation unit, 170 storage unit, 172 object data storage unit,
176 Drawing buffer, 180 information storage medium, 190 display unit, 192 sound output unit,
194 I / F unit, 195 portable information storage medium, 196 communication unit,
500 server system, 510 network, 600 processing unit,
602 reception processing unit, 604 transmission processing unit, 606 matching processing unit,
608 game processing unit, 610 registration processing unit, 616 billing processing unit,
618 management processing unit, 620 display processing unit, 630 sound processing unit,
670 storage unit, 672 game data storage unit, 674 matching information storage unit,
676 Accounting information storage unit, 678 User information storage unit, 696 Communication unit

Claims (14)

When a request to join the group is received from the terminal device of the first player who has input a keyword for identifying a player who belongs to the same group and plays a communication game, a room corresponding to the keyword is created, When a request for participation is received from a terminal device of a second player who has input the same keyword, a process for causing the second player to enter the room is performed so that the player who has input the same keyword is included in the same group. A matching processing unit for performing a matching process to belong to,
A game processing unit that performs a process for the communication game using the group organized by the matching process;
A game system comprising: In claim 1,
The matching processing unit
When a request for participation is received from the terminal device of the first player who has input the keyword, a matching period is started, and the terminal of the second player who has input the same keyword within the started matching period A game system for performing a process of allowing the second player to enter the room when a participation request is received from an apparatus. In claim 2,
The matching processing unit
A game system for performing processing for notifying a player of matching status information from the start of the matching period until the end of the matching period. In claim 2 or 3,
The matching processing unit
In the matching period, when there is an instruction to end matching from a terminal device of a player who has entered the room, the matching system is ended. In any of claims 2 to 4,
The matching processing unit
A game system characterized in that, when the number of players who have entered the room by entering the same keyword within the matching period reaches a fixed number, entry to the room is closed. In any of claims 2 to 5,
The matching processing unit
A game system characterized by changing the number of people who can enter the room in accordance with the communication game held within the matching period. In any one of Claims 2 thru | or 6.
The matching processing unit
When the number of players who have entered the room is less than the number of people at the end of the matching period, the game system performs a process of causing other players obtained by matching to belong to the group . In any one of Claims 2 thru | or 7,
The matching processing unit
When a request for participation is received from a terminal device of another player who has input the keyword after the matching period has ended, a process of creating another room and entering the other player in the other room The game system characterized by performing. In any one of Claims 1 thru | or 8.
A game system comprising: a registration processing unit that receives an input of the keyword and registers the received keyword in a storage unit in association with the player when the keyword is input by the player. In claim 9,
The registration processing unit
A game system for performing processing for permitting a player in which the keyword is registered to select a game mode to be played by a group organized by the keyword. In any one of Claims 1 thru | or 10.
The matching processing unit
A game system that performs processing for displaying information on a plurality of rooms that can be entered by inputting the same keyword on a player. When a request to join the group is received from the terminal device of the first player who has input a keyword for identifying a player who belongs to the same group and plays the communication game, a matching period is started and the started In a matching period, when a request for participation is received from a terminal device of a second player who has input the same keyword, a matching process is performed for causing the second player to belong to the same group as the first player. A processing unit;
A game processing unit that performs a process for the communication game using the group organized by the matching process;
A game system comprising: When a request to join the group is received from the terminal device of the first player who has input a keyword for identifying a player who belongs to the same group and plays a communication game, a room corresponding to the keyword is created,
When a request for participation is received from a terminal device of a second player who has input the same keyword, a process for causing the second player to enter the room is performed so that the player who has input the same keyword is included in the same group. Matching process to belong to,
Processing for the communication game using the group organized by the matching process;
A communication game processing method characterized by the above. When a request to join the group comes from the terminal device of the first player who has input a keyword for identifying a player who belongs to the same group and plays the communication game, a matching period is started.
Matching that causes the second player to belong to the same group as the first player when a participation request is received from the terminal device of the second player who has input the same keyword during the started matching period. Process
Processing for the communication game using the group organized by the matching process;
A communication game processing method characterized by the above.

Images