JP2016190000A - GAME SYSTEM AND PROGRAM - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a game system and a program capable of realizing an unprecedented battle game with a hierarchical structure implemented in game play elements.SOLUTION: The game system includes a game processing part, a game achievement calculation part, and a display processing part. As a result of a battle, each of a plurality of game play elements for which the hierarchical structure is set is associated with each of a plurality of players. When a player uses a player game play element for a battle, the game processing part accepts a battle request for a game play element which the player selects from a plurality of game play elements at least excluding game play elements immediately below the player game play element in the hierarchical structure. The display processing part performs processing of displaying at least either a first hierarchical structure image which is an image of hierarchical structure to which the player game play element belongs or a second hierarchical structure image which is an image of a hierarchical structure to which the game play element to be an opponent candidate belongs.SELECTED DRAWING: Figure 4

Description

  The present invention relates to a game system, a program, and the like.

  Conventionally, a game system that realizes a game to be played using a game play element such as a character represented by a card or the like is known. As a conventional technique of such a game system, for example, techniques disclosed in Patent Documents 1 and 2 are known.

  In such a game system, the players put each other's cards into play, determine the victory or defeat based on the fighting power, defense power, etc. of the character represented by each card, and enjoy the battle game.

JP 2008-259640 A JP 2009-39143 A

  However, in the conventional game system, a game that realizes a hierarchy in the real world (hierarchical system, hierarchical system) has not been proposed. For this reason, it is difficult for the player to feel the superiority standing on the person and the refreshing feeling of the reversal of the situation.

  In an SNS (Social Networking Service) game or the like, the character used by the player grows in direct proportion to time. For this reason, although a solid sense of fulfillment can be provided, there is a problem that the future can be predicted. In addition, for example, it is difficult to stimulate the competitive consciousness among players in the ranking among the number of participants in the network game of thousands or more.

  According to some aspects of the present invention, it is possible to provide a game system, a program, and the like that can realize an unprecedented battle game in which a hierarchical structure is introduced into game play elements.

  According to one aspect of the present invention, a game processing unit that performs a game process of a battle game in which a plurality of players play a game using game play elements, a game result calculation unit that calculates a game result of the player, and display of a game image Each of the game play elements of the plurality of game play elements for which a hierarchical structure is set as a result of the battle is associated with each player of the plurality of players, and the game processing section includes: When a player plays using a player game play element, a game play element selected by the player from a plurality of game play elements excluding at least a game play element immediately below in the hierarchical structure of the player game play element The display processing unit is allowed to make a battle request for the hierarchical structure image to which the player game play element belongs. A certain first hierarchical structure image related to a game system that performs processing for displaying at least one of the second hierarchical image gameplay element as a match candidate is the image of the hierarchical structure belonging. 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.

  In one aspect of the present invention, a hierarchical structure is set for a plurality of game play elements as a result of the battle. When the player plays a match using the player game play element, a match request for the game play element selected by the player from a plurality of game play elements excluding at least the game play element immediately below the player game play element is issued. Allowed. That is, at least a battle request for a game play element immediately below the player game play element is not permitted. Then, a process of displaying at least one of the first hierarchical structure image of the player game play element and the second hierarchical structure image of the game play element that is a battle candidate is performed. In this way, by disabling the battle request for the game play element directly below, it is possible to suppress the occurrence of a situation in which a meaningless battle is performed or, for example, an upper player becomes excessively advantageous. In addition, by displaying the hierarchical structure image, the player can visually recognize the power situation represented by the hierarchical structure, and a game of an unprecedented type in which a hierarchical structure is introduced into the game play element. Can be realized.

  In one aspect of the present invention, the game processing unit may permit a battle request for a game play element belonging to another hierarchical structure different from the hierarchical structure to which the player game play element belongs.

  In this way, by permitting a battle request for game play elements belonging to another hierarchical structure, it is possible to realize a change in the hierarchical structure or the like due to the result of the battle.

  In one aspect of the present invention, the game processing unit, when a player wins a battle with another game play element using the player game play element, the other game play element or the other game play element. You may perform the process which makes the game play element of the lower layer of a game play element and the said other game play element belong to the lower layer of the said player game play element.

  In this way, when the player wins the battle game, the other game play elements that are the opponents belong to the lower layer of the player game play element, and the fun of expanding his power is It can be given to the player.

  According to another aspect of the present invention, a game processing unit that performs a game process of a battle game in which a plurality of players play a game using game play elements, a game result calculation unit that calculates a game result of the player, a game image Each of the game play elements of the plurality of game play elements for which a hierarchical structure is set as a result of the battle is associated with each player of the plurality of players, and the game processing section When the player wins a match with another game play element using the player game play element, the other game play element, or the lower layer of the other game play element and the other game play element The game processing element is made to belong to a lower layer of the player game play element, and the display processing unit A game system that performs processing to display at least one of a first hierarchical structure image that is a hierarchical structure image to which an element belongs and a second hierarchical structure image that is a hierarchical structure image to which a game play element that is a battle candidate belongs Related to. 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.

  In one aspect of the present invention, a hierarchical structure is set for a plurality of game play elements as a result of the battle. Further, a process of displaying at least one of the first hierarchical structure image of the player game play element and the second hierarchical structure image of the game play element that is a battle candidate is performed. When the player wins the battle game, other game play elements that are opponents belong to the lower layer of the player game play element. In this way, the player can enjoy the fun and the like that his power expands by winning the battle game. In addition, by displaying the hierarchical structure image, the player can visually recognize the power situation represented by the hierarchical structure, and a game of an unprecedented type in which a hierarchical structure is introduced into the game play element. Can be realized.

  In one aspect of the present invention, the game processing unit may set an attackable period during which the player can attack and an attack impossible period during which the player cannot attack.

  In this way, the player cannot attack during the period during which the attack is not possible, so that an unlimited number of attacks can be suppressed. In addition, by using the period during which no attack is possible, the player can go through various strategies and strategies, and improve the fun of the game.

  In one aspect of the present invention, the game processing unit may perform a process of limiting the number of attacks by the player.

  By limiting the number of attacks in this way, the strategic interest of the game can be improved.

  In one aspect of the present invention, the game score calculation unit includes a number of lower-layer game play elements, which is the number of lower-layer game play elements of the player game play elements, and the player game play elements and lower-layer game play elements. Based on at least one of the game parameters of the affiliated game play element, the winning / losing determination process of the competitive game may be performed.

  In this way, the player can advantageously advance the battle game by increasing the number of lower-layer game play elements under his / her own control, improving the game parameter value of the belonging game play element, and the like. Thus, it is possible to make the player feel the superiority of standing up.

  In one aspect of the present invention, the game score calculation unit determines whether or not the competitive game is won or lost based on at least one of the number of lower-layer game play elements, the game parameter of the belonging game play element, and the probability element parameter. Processing may be performed.

  In this way, it is possible to suppress a situation in which the winning or losing of the competitive game is influenced by the probability element parameter and the result of the winning or losing of the competitive game becomes uniform.

  In one aspect of the present invention, the game result calculation unit may calculate a player's game result based on an arrangement duration or number of arrangements of the player game play elements on a predetermined hierarchy in a hierarchical structure. .

  In this way, the player's game results are calculated according to the arrangement duration time and the number of arrangements in the predetermined hierarchy of the hierarchical structure, and the hierarchical structure of the player game play elements has been effectively utilized. A type of competitive game can be realized.

  Also, in one aspect of the present invention, the game score calculation unit has a given duration of arrangement to the top layer of the hierarchical structure in a state where the game play element occupancy rate of the player is equal to or higher than a given rate. It may be determined that the player has cleared the game when the time is exceeded or when the number of placements on the top layer of the hierarchical structure is a given number or more.

  In this way, for example, the game clear condition of the player is determined based on the arrangement duration time and the number of arrangements that reigned in the top layer of the hierarchical structure of many powers. Can be improved.

  Also, in one aspect of the present invention, the game score calculation unit, when the player game play element has won in the battle game, uses the acquired points of the battle game as a game play element below the player game play element. You may perform the process to distribute.

  In this way, even if the player game play element is in the lower layer, the upper player game play element or the like can win the battle and receive the distribution of the acquired points. The fun of the battle game can be increased.

  Also, in one aspect of the present invention, the game score calculation unit uses the earned points according to the degree of relationship between the player game play element and the lower game play element of the player game play element as the lower game play element. You may perform the process to distribute.

  In this way, for example, the higher the degree of relationship between the lower-layer game play elements and the upper-layer player game play elements, the greater the number of acquisition points that can be received. Point distribution processing can be realized.

  In one aspect of the present invention, the game process, the game result calculation process, or the display process is performed in accordance with the degree of relationship between the player game play element and a game play element below the player game play element. May be.

  In this way, the degree of relationship between the player game play elements in the hierarchical structure and the game play elements in the lower layer is reflected in the game process, the game result calculation process, and the display process. It is possible to realize the fun of the game peculiar to the game.

  In the aspect of the invention, the display processing unit may perform display processing for identifying the degree of relation in at least one hierarchical structure image of the first and second hierarchical structure images.

  In this way, the player can visually recognize the level of relationship in the hierarchical structure while viewing the hierarchical structure image.

  In one aspect of the present invention, a time limit may be set for the competitive game, and the game score calculation unit may calculate a game score when the time limit has elapsed as a final game score.

  In this way, the final game score of the player can be calculated based on various factors when the time limit has elapsed.

1A to 1E are explanatory diagrams of a configuration example of a game system according to the present embodiment. The structural example of the server system of this embodiment. The structural example of the terminal device of this embodiment. The example of the game image of the battle | competition game implement | achieved by this embodiment. The example of the game image of the battle | competition game implement | achieved by this embodiment. 6A and 6B are explanatory diagrams of a battle game realized by the present embodiment. FIG. 7A and FIG. 7B are also explanatory diagrams of a battle game realized by this embodiment. FIG. 8A to FIG. 8C are explanatory diagrams of a battle game realized by this embodiment. Explanatory drawing of the technique of permission / denial of the competition request | requirement of this embodiment. Explanatory drawing of the method of the modification of this embodiment. Explanatory drawing of the setting method of an attack possible period and an attack impossible period. Explanatory drawing of the chat implement | achieved by the game of this embodiment. FIG. 13A and FIG. 13B are explanatory diagrams of the advantage of changing the hierarchical structure. FIG. 14A and FIG. 14B are explanatory diagrams of a method using a probability element parameter. Explanatory drawing about the various items used by this embodiment. Explanatory drawing about a game stage. The flowchart for demonstrating the battle | competition process of this embodiment. The flowchart for demonstrating the battle | competition process of this embodiment. The flowchart for demonstrating the determination process of game stage clear. The flowchart for demonstrating the process according to the degree of relationship between a player character and a subordinate. FIGS. 21A and 21B are explanatory diagrams of display processing using the degree of relationship.

  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 First, a configuration example of the game system of the present embodiment will be described with reference to FIGS. 1 (A) to 1 (E).

  In FIG. 1A, a server system 500 (information processing system) is communicatively connected to terminal devices TM1 to TMn via a network 510. For example, the server system 500 is a host, and the terminal devices TM1 to TMn are clients. In the following description, the 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. However, the game system and all or part of the processing are performed by the terminal devices TM1 to TMn. It may be realized. Hereinafter, each of the terminal devices TM1 to TMn will be appropriately referred to as a terminal device TM.

  The server system 500 can be realized by, for example, one or a plurality of servers (management server, game server, billing server, service providing server, content distribution server, authentication server, database 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. Thereby, for example, the terminal device TM which is a player terminal accesses the server system 500 in order to use SNS (Social Networking Service) and the like, and the play of a social game which is an online game provided from the server system 500 is performed. It becomes possible.

  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 terminal device TM (player terminal) is, for example, a terminal having a network connection function (Internet connection function). As these terminal devices TM, for example, the portable communication terminal (smart phone, future phone, mobile phone) of FIG. 1 (B), the portable game device of FIG. 1 (C), and the home game device of FIG. 1 (D). (Stationary type) or various devices such as the arcade game device of FIG. 1E can be used. Alternatively, an information processing device such as a personal computer (PC) or a tablet computer may be used as the terminal device TM.

  FIG. 2 shows a configuration example of the server system 500 (game system) 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. Note that the configuration of the server system 500 is not limited to FIG. 2, and various modifications such as omitting some of the components (each unit) or adding other components are possible. Each processing of the processing unit 600 of the server system 500 may be realized by the processing unit 100 of the terminal device TM of FIG. 3 or by distributed processing of the processing unit 600 of the server system 500 and the processing unit 100 of the terminal device TM. It may be realized.

  The processing unit 600 (processor) is necessary for game processing, game result calculation processing, display processing, sound processing, and a server based on various information stored in the storage unit 670 (database), programs, operation information, and the like. Various control processes or management processes are performed. The function of the processing unit 600 can be realized by hardware such as various processors (CPU, GPU, etc.), ASIC (gate array, etc.), and programs.

  The processing unit 600 includes a reception processing unit 602, a transmission processing unit 604, a game processing unit 608, a game score calculation unit 610, an authentication processing unit 615, a billing processing unit 616, a management processing unit 618, a display processing unit 620, and a sound processing unit 630. including. Various modifications such as omitting some of these components or adding other components are possible.

  The reception processing unit 602 performs information reception processing. For example, a process for receiving information from the terminal device TM or 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 terminal device TM or 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.

  Details of the game processing unit 608 and the game score calculation unit 610 will be described later.

  The authentication processing unit 615 performs player authentication processing. For example, authentication processing of a player who has logged in using the terminal device TM is performed. This authentication process is performed based on, for example, a password or account information input by the player.

  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 processing for displaying an image on a display unit such as the terminal device TM. For example, image generation data for generating the image is generated. Or you may perform control which displays an image on display parts, such as terminal unit TM. The sound processing unit 630 performs processing for outputting sound from a sound output unit such as the terminal device TM. For example, sound generation data for generating the sound (sound, game sound, sound effect) is generated. Or you may perform control which outputs a sound from sound output parts, such as terminal unit TM. Here, the image generation data for generating the image is data for displaying the image generated by the method of the present embodiment on the terminal device TM or the like, and may be the image data itself, It may be various data (display screen setting data, object data, etc.) used by the terminal device TM 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 play element information storage unit 672, hierarchical structure information storage unit 674, billing information storage unit 676, and user information storage unit 678. The game play element information storage unit 672 stores information on game play elements. For example, game parameters of game play elements such as characters (cards), item information, and the like are stored. The hierarchical structure information storage unit 674 stores hierarchical structure information set in the game play element. For example, connection information of a plurality of nodes in which game play elements are set in each node are stored as hierarchical structure information. 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.

  The communication unit 696 communicates with the terminal device TM or the like via a wired or wireless network 510, and the function can be realized by hardware such as a communication ASIC or a communication processor, or communication firmware. .

  FIG. 3 shows a configuration example of the terminal device TM (player terminal, client device) of the present embodiment. Note that the configuration of the terminal device TM is not limited to that in FIG. 3, and various modifications such as omitting some of the components (each unit) or adding other components are possible.

  The terminal device TM includes a processing unit 100, an operation unit 160, an imaging unit 162, a storage unit 170, a display unit 190, a sound output unit 192, an I / F unit 194, and a communication unit 196.

  The processing unit 100 (processor) performs processing for providing various services, game processing, game results calculation processing, display processing, sound processing, and the like based on operation information and programs from the operation unit 160. 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 an input receiving unit 101, a reception processing unit 102, a transmission processing unit 104, a game processing unit 108, a game score calculation unit 110, a display processing unit 120, and a sound processing unit 130.

  The input receiving unit 101 receives input information from a player (user). For example, a process for receiving information input via the operation unit 160 is performed. The reception processing unit 102 receives information from an external device such as the server system 500 or another terminal device. The transmission processing unit 104 performs transmission processing of information to an external device such as the server system 500 or another terminal device. The game processing unit 108 performs various game processes. The game score calculation unit 110 performs a game score calculation process for the player. Note that the game processing and game result calculation processing of the present embodiment may be realized by either one of the server system 500 and the terminal device TM, or by distributed processing of the server system 500 and the terminal device TM. Also good. The display processing unit 120 performs processing for displaying an image on the display unit 190. For example, when an image is generated on the terminal device side, a drawing process is performed based on the results of various processes (application process and game process) performed by the processing unit 100, thereby generating an image and displaying the image on the display unit 190. Output. When an image is generated on the server side, an image based on image information from the server system is displayed on the display unit 190. The sound processing unit 130 performs sound control based on the results of various processes performed by the processing unit 100. As a result, BGM, sound effects, or voices are output from the sound output unit 192.

  The operation unit 160 is for a user (player) to input various information such as operation information, and functions thereof are an operation button, a direction instruction key, an analog stick, a lever, and various sensors (an angular velocity sensor, an acceleration). Sensor), a microphone, or a touch panel display.

  The imaging unit 162 (camera) captures a subject and is realized by an optical system including an image sensor such as a CCD or a CMOS sensor and a focus lens.

  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, an SSD, an HDD, 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. 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 on the information storage medium 180 (a program for causing the computer to execute processing of each unit). I can remember.

  The display unit 190 outputs an image generated according to the present embodiment, and its function can be realized by an LCD, an organic EL display, a CRT, 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 is for a user to save various types of information, and is a storage device that retains storage of such information even when power is not supplied. The portable information storage medium 195 can be realized by an IC card (memory card), a USB memory, a magnetic card, or the like.

  The communication unit 196 communicates with an external device such as the server system 500 and other terminal devices via the network 510, and functions thereof are hardware such as a communication ASIC or a communication processor, This can be realized by communication firmware.

  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.

  In this embodiment, as shown in FIG. 2, the server system 500 (or terminal device TM), which is a game system, includes a game processing unit 608 (game processing unit 108) and a game results calculation unit 610 (game results calculation unit 110). , A display processing unit 620 (display processing unit 120).

  The game processing unit 608 performs game processing. Specifically, a game process of a battle game in which a plurality of players play a battle using game play elements is performed. For example, the game processing unit 608 accepts a player's battle request (attack request), and between a game play element corresponding to the player and a game play element corresponding to another player (human player, computer player). Game processing for realizing a battle game is performed. 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 game score calculation unit 610 calculates the game score (scores, points, etc.) of the player. For example, calculation processing of the player's acquired points, determination processing of game clear conditions, and the like are performed. The display processing unit 620 performs a game image display process. For example, display processing for displaying a game image on a display unit such as the terminal device TM is performed. Examples of the game image include a game image (battle screen) of a battle game and an image for informing the player of the game progress and game results.

  In the present embodiment, each game play element of the plurality of game play elements for which a hierarchical structure is set as a result of the battle is associated with each player of the plurality of players. That is, each player of a plurality of players plays a battle game with the game play elements of other game players using their own game play elements. And the hierarchical structure is set with respect to several game play elements by the result of the battle | competition between such game play elements.

  In the present embodiment, the game processing unit 608, when the player battles using the player game play elements, includes a plurality of game play elements excluding at least the game play elements immediately below in the hierarchical structure of the player game play elements. A match request for the game play element selected by the player is permitted.

  That is, in this embodiment, the player selects a game play element desired as an opponent from a plurality of game play elements used by other plurality of players, and makes a battle request (attack request). In this case, the game processing unit 608, as an opponent of the player game play element used by the player, in the hierarchical structure to which the player game play element belongs, at least a game play element immediately below the player game play element (directly below the hierarchical structure). Does not allow a match request.

  For example, the hierarchical structure includes first to Mth layers, the first layer is the highest layer, the Mth layer is the lowest layer, and the player game play element layer is the i-th layer (1 ≦ i ≦ M). In this case, the game processing unit 608 does not permit at least a battle request for a game play element arranged in the (i + 1) -th layer immediately below the i-th layer. That is, the game play element of the (i + 1) th hierarchy is not permitted as an opponent of the player game play element. It should be noted that a battle request for game play elements in the (i + 2) th to Mth layers may be disapproved or allowed.

  On the other hand, the game processing unit 608 permits a battle request for a game play element on the upper layer of the player game play element or in the same layer as the player game play element in the hierarchical structure to which the player game play element belongs. That is, a match request for the game play elements in the first to (i-1) -th layers that are upper layers is permitted. In addition, a match request for another game play element (and a game play element in the lower layer) arranged in the i-th layer of the same layer is also permitted.

  The game processing unit 608 permits a battle request for a game play element belonging to another hierarchical structure different from the hierarchical structure to which the player game play element belongs. For example, for game play elements belonging to other hierarchical structures, a match request is permitted regardless of whether the player game play element is in the upper layer, the same layer, or the lower layer.

  Then, the display processing unit 620 includes at least a first hierarchical structure image that is a hierarchical structure image to which the player game play element belongs and a second hierarchical structure image that is a hierarchical structure image to which the game play element that is a battle candidate belongs. Process to display one. For example, the display processing unit 620 performs processing for displaying only the first hierarchical structure image, displaying only the second hierarchical structure image, or displaying both the first and second hierarchical structure images. The first and second hierarchical images may be displayed as a battle screen during a battle game, or may be displayed as a screen that informs the player of the game progress and game results.

  The hierarchical structure image (first and second hierarchical structure images) is an image for the player to identify the state / situation of the hierarchical structure. The hierarchical structure image is an image for the player to identify game play elements belonging to the hierarchical structure. This hierarchical structure image can include, for example, an icon image representing a game play element. The hierarchical structure image can include an image representing a connection between game play elements in the hierarchical structure. Specifically, an image of a line connecting nodes that are game play elements can be included. Further, only a part of the hierarchical structure image may be displayed on the screen of the display unit. Then, for example, another part of the hierarchical structure image outside the screen may be displayed on the screen based on, for example, a scroll operation by the player.

  The hierarchical structure is a data structure for game play element data, for example, and is a structure in which each layer is stacked in order from the lower layer to the upper layer or from the upper layer to the lower layer. As the hierarchical structure, for example, a tree structure can be used. However, the present invention is not limited to this, and various modifications (for example, a structure in which a star type or a ring type is hierarchized) are possible. A tree structure is a kind of data structure, and a plurality of nodes (a plurality of game play elements, a plurality of game plays) located in a lower hierarchy from one node (game play elements, data of game play elements) belonging to a certain hierarchy. Element data) is arranged in a branched state. In the tree structure, each hierarchy has a parent-child relationship, and the parent has a plurality of children, and the child can have a plurality of children with himself / herself as a parent. In addition, the highest hierarchy positioned higher than all nodes (game play elements) is also referred to as a root.

  The game play element is an element used by the player for game play, such as a character. The game play element may be an item (a card with which the item is associated). This game play element is used as a card representing a character (or item) in a card game (electronic card game), for example. When the game play element is a character or the like, the game parameter of the game play element is a status parameter of the character or the like (a parameter indicating attack power, defense power, magic power, hit points, durability, or the like). The game processing unit 608 executes a game process using a game parameter associated with the game play element. As items, for example, various items such as equipment (weapons, etc.), tools, belongings, and subordinates used in the game can be assumed.

  In addition, when the player uses the player game play element to win a battle with another game play element, the game processing unit 608 displays at least other game play elements as lower layers (in the hierarchical structure) of the player game play elements. Process to belong to the lower layer. When the layer of the player game play element is the i-th hierarchy (1 ≦ i ≦ M), the other game play elements are assigned (arranged) to the (i + 1) -th hierarchy which is the lower layer. More preferably, when the player uses the player game play element to win a battle with another game play element, the game processing unit 608 may play the other game play elements and the game play below the other game play elements. A process of causing the element to belong to a lower layer of the player game play element is performed. Specifically, the other game play elements belong to, for example, the (i + 1) th layer, and the game play elements below the other game play elements belong to, for example, any one of the (i + 2) to Mth layers.

  Note that the process of causing a game play element to belong to a hierarchy is, for example, a process of arranging and setting data (identification number, index, etc.) of the game play element for a node corresponding to the hierarchy. Hierarchical structure information for representing such a data structure is stored in the hierarchical structure information storage unit 674. In addition, when the player game play element wins, the belonging process (arrangement process) of other game play elements and the game play elements below it is not limited to the above process, and various modifications can be made.

  In addition, the game score calculation unit 610 calculates the game score of the player based on the arrangement duration time of the player game play elements on the predetermined hierarchy of the hierarchical structure. Alternatively, the game result of the player may be calculated based on the number of times of placement in the predetermined hierarchy. For example, the game score calculation process is performed so that the player's game score (score, in-game point, etc.) increases as the duration of arrangement of the player game play elements on a predetermined hierarchy is longer. Alternatively, the game result calculation process is performed so that the player's game result becomes higher as the number of times the player game play element is arranged on the predetermined hierarchy is higher. The arrangement continuation time is, for example, a time during which player game play elements are arranged continuously (continuously) in a predetermined hierarchy (predetermined node). The number of times of arrangement is, for example, the total number of times that the player game play element is arranged in a predetermined hierarchy (predetermined node).

  Note that even if the arrangement duration time or the number of arrangements is the same, the game results (scores, in-game points) given to the player may be higher as the predetermined hierarchy is higher. Further, the game result of the player may be calculated in consideration of both the arrangement continuation time and the number of arrangements on the predetermined hierarchy.

  In addition, the game score calculation unit 610 is configured so that the arrangement duration time for the top layer of the hierarchical structure (predetermined level in a broad sense) is a given time in a state where the game play element occupancy rate of the player is equal to or higher than the given rate When the above is reached, it is determined that the player has cleared the game (game stage has been cleared). Alternatively, when the game play element occupancy rate is equal to or higher than a given rate, the player determines that the game has been cleared when the number of placements on the top layer of the hierarchical structure is equal to or higher than the given number. .

  Here, the game play element occupancy ratio is, for example, the player's belonging game play with respect to the number of the plurality of game play elements of a plurality of players participating in the game (a plurality of players existing in an area that is a game stage). This is information indicating the ratio of the number of elements. The affiliation game play element is a game play element below the player game play element and the player game play element. For example, the belonging game play element is a subordinate game play element belonging to a group of players. Further, it is desirable that the given rate is, for example, a rate of more than a majority (for example, a rate greater than 50%). Further, when the player clears the game, it is desirable to move the player to the game stage (next area) next to the game stage where the game is being performed.

  The game score calculation unit 610 also includes the number of lower-layer game play elements, which is the number of lower-layer game play elements of the player game play elements, and the game parameters of the belonging game play elements including the player game play elements and the lower-layer game play elements. Based on at least one of the above, a fixed process of winning or losing the battle game is performed. For example, the winning or losing of the competitive game is determined based on the number of lower-layer game play elements (the number of subordinates), or the winning or losing of the competitive game is determined based on the game parameters of the belonging game play elements (self and subordinates). Alternatively, the winning or losing of the competitive game is determined based on both the number of lower-layer game play elements and the game parameters of the belonging game play elements.

  In this case, the target of the win / loss determination is the number of lower game play elements of the opponent player and the game parameters of the game play elements to which the opponent player belongs. Basically, the greater the number of lower-layer game play elements, the easier it is to win in the battle game. In addition, the better the attack parameter, the defense parameter, and the item parameter (parameters of items such as equipped weapons) that are game parameters of the belonging game play element, the easier it is to win in the battle game.

  More specifically, the game score calculation unit 610 performs a battle based on at least one of the lower-layer game play element number (subordinate number), the game parameter of the belonging game play element (self and subordinate), and the probability element parameter. The game win / loss determination process is performed. In other words, the winning / losing determination process is not performed based on only the number of lower-layer game play elements and the game parameters of the belonging game play elements, but in addition to the probability elements based on the probability element parameters. I do. For example, when the number of lower layer game play elements of the player is smaller than the number of lower layer game play elements of the opponent player, or the game parameter of the player's belonging game play element is inferior to the game parameter of the game play element of the opponent player. In this case, the probability based on the probability element parameter works favorably for the player, so that the player can win the battle.

  Or, conversely, when the number of lower-layer game play elements (number of subordinates) of the player is larger than the number of lower-layer game play elements (number of subordinates of the opponent) of the opponent player, or the game parameters of the game play elements to which the player belongs However, even when the game parameter of the opponent player's game play element is superior, if the probability based on the probability element parameter works against the player, the player may lose.

  In addition, when the player game play element wins the battle game, the game score calculation unit 610 performs a process of allocating the acquired points of the battle game to the game play elements below the player game play element. Acquired points are points awarded by players in in-game games, in-game points, and the like. For example, the score is a point indicating that the player has excellent game results. In-game points are points (in-game currency, etc.) that can be used to acquire (purchase) or strengthen items. The lower-layer game play elements to which the acquisition points are distributed are the game play elements to which the player belongs, and the game play elements under the player. Moreover, it is desirable to change the distribution ratio of the acquired points according to the hierarchy. For example, the higher the game play element, the higher the distribution ratio. Further, the distribution ratio of the acquired points may be changed according to the degree of relationship between the player game play element and the lower-layer game play element to be distributed. For example, the higher the degree of relationship, the higher the distribution ratio.

  In the present embodiment, game processing, game result calculation processing, or display processing is performed according to the degree of relationship between the player game play elements and the game play elements below the player game play elements. That is, the game processing unit 608 performs a game process in accordance with the degree of relationship between the player game play element and the game play element below it. In addition, the game score calculation unit 610 and the display processing unit 620 perform game score calculation processing and display processing according to the degree of relationship between the player game play element and the game play elements below it.

  Specifically, the game processing unit 608 performs a battle process using the degree of relationship in a battle between a player game play element and a game play element of another player. For example, when the player game play element has a higher degree of relationship with the game play element below it, a battle process is performed so that the player game play element can easily win. Specifically, the degree of relationship is used when determining the winning or losing of the competitive game.

  The game score calculation unit 608 performs a calculation process using the degree of relationship when calculating the game score of the player. For example, the higher (stronger) the degree of relationship between the player game play element and the game play element below it is, the more earned points can be obtained by the player when winning the battle.

  In addition, the game score calculation unit 608 performs a process of allocating the acquired points according to the degree of relationship between the player game play element and the game play element below the player game play element to the lower game play element. That is, the ratio of the distribution of acquired points to the lower game play element is changed according to the degree of relationship between the player game play element and the lower game play element. For example, the earned points are distributed at a higher distribution rate for game play elements having a high degree of relationship. In determining the game clear condition, the degree of relationship between the player game play element and the game play element below it may be considered. For example, the higher the degree of relation, the lower the difficulty level of the game clear condition so that the player can easily clear the game.

  The display processing unit 630 performs display processing for identifying the degree of relationship between the player game play element and the game play element below it in at least one hierarchical structure image of the first and second hierarchical structure images. For example, a hierarchical structure image display process is performed so that the player can identify the level of relationship (strong or weak). For example, in the hierarchical structure image, the level of the relationship is expressed based on the thickness, color, brightness, shape, or the like of an image such as a connection line connecting the game play element icon images. For example, when the degree of relationship is high (when it is strong), the image of the connection line or the like is made thicker, a conspicuous color, or the luminance is increased. On the other hand, when the degree of relationship is low (when weak), the image of the connection line is made thin, the color is inconspicuous, or the luminance is lowered.

  The display processing unit 630 performs display processing for identifying whether the player corresponding to the game play element is in an online state participating in the network game or in an offline state not participating in the network game. May be. Specifically, display processing is performed to identify whether the image is in an online state or an offline state in the hierarchical structure image (first and second hierarchical structure images).

  In addition, the game processing unit 608 makes an attack possible period (a period during which a match is permitted) in which the player can attack (match) and an attack impossible period (a match is not permitted) in which the player cannot attack (match). Period). For example, the attack possible period and the attack impossible period are alternately set. For example, an attack-impossible period of a given time width is set for each given time without allowing an attack (match) at all times of 24 hours. In this attack disabled period, even when the player makes a battle request, this battle request is not accepted, and the player game play element cannot attack the game play elements of other players.

  In addition, the game processing unit 608 performs processing for limiting the number of attacks by the player. For example, a process for limiting the number of attacks of the player within a given period is performed. For example, the number of attacks (number of actions) is not limited, but is limited to a given number. In this case, the player may limit the number of attacks within a given period as long as the number of times the player can attack within the period is substantially limited to the given number. For example, when the player's possible attack number (for example, 3 times) is set and the player (player game play element) makes an attack, the attackable number of times is decremented by, for example, −1. I can't do it. Further, for every given recovery time (for example, several hours), the number of possible attacks is incremented by +1 and recovered. For example, if a given period is T time (for example, 24 hours) and a recovery time is T / K time (for example, 8 hours, K = 3), the number of attacks at T time within a given period is This is practically limited to K times.

  Note that the process for limiting the number of attacks by a player is not limited to the process for limiting the number of attacks by a player within a given period. For example, when m times are given as the number of possible attacks of the player, the m times are not used as in the so-called ticket system, because there is no expiration date such as the given period described above. Try not to reduce the number of times. And if it is used once, for example, the number of possible attacks is reduced to, for example, m-1 times, and if it is reduced to 0 times, the attack becomes impossible. In this case, for example, when an item is purchased, a given point is acquired in the game, or the recovery time has elapsed as described above, the possible number of attacks may be incremented to recover. Alternatively, the possible number of attacks may be returned to m times when the game ends.

  In the present embodiment, a time limit may be set for the battle game. Then, the game score calculation unit 610 calculates the game score when the time limit has elapsed as the final game score. In this case, for example, the player with the highest score (total points) of the competitive game when the time limit has elapsed is determined as the winner. Alternatively, the player with the highest game play element occupancy when the time limit has elapsed is determined as the winner. For example, it is determined that the player with the highest game play element occupancy ratio, which is the ratio of the number of assigned game play elements to the total number, has won the game. Alternatively, points according to the game play element occupancy rate may be given to the player. That is, the higher the game play element occupation ratio, the higher the points given to the player.

  In addition, although the case where the server system 500 of FIG. 2 performs the game process of this embodiment, a game results calculation process, and a display process was demonstrated above, this embodiment is not limited to this. For example, the terminal device TM of FIG. 3 may perform part or all of the game processing (matching processing), game result calculation processing, and display processing of the present embodiment described above. In this case, the terminal device TM (or a system in which the terminal device and the server system cooperate) functions as the game system of this embodiment.

2. Next, the method of this embodiment will be described in detail. In the following, the case where the game play element is a character in a game (a card in a card game) will be mainly described as an example, but the present embodiment is not limited to this. For example, the game play element may be a card associated with an element other than a character. For example, the card etc. with which the item etc. are linked | related may be sufficient. For example, the game play element only needs to be associated with a game parameter or the like used in a calculation process (matching process) of the game process. The character (game character) may represent a person or a hero in the real world, or may represent a car, an airplane, a ship, a train, a robot, or a living creature other than a person.

2.1 Battle Game Using Hierarchical Structure In this embodiment, a battle system game is provided in which a hierarchical structure is set for a plurality of characters appearing in the game (game play elements in a broad sense; hereinafter the same). . In this game, a plurality of characters are associated with a plurality of players participating in the game (game stage, area). For example, when the first to Kth players participate, each player of the first to Kth players is assigned to each of the first to Kth characters. For example, the player and the character are associated one to one (or one to many). A direct confrontation between players is realized by the battle between characters. For example, the battle between the p-th character and the q-th character among the first to K-th characters is the p-th player using the p-th character and the q-th character using the q-th character. A confrontation between players.

  When a player (player character) defeats an opponent (an opponent character), the player can be made his / her subordinate (subordinate), and when the opponent has a subordinate, the entire player can be made his / her own subordinate. The player becomes stronger in proportion to the number of subordinates. In this game, timing and situation judgment are the keys to victory, and by winning, you can get a sense of superiority that stands on people. In addition, there is an exhilarating feeling of one-shot reversal, and a so-called “smooth feeling” can be obtained with excitement when a chance comes.

  In this embodiment, a battle system in which a hierarchy is set for a character is provided. That is, in a game in which a hierarchy is set for a character, for example, a battle system in which an upper person and a lower person face each other and a lower person wins the upper person's hierarchy.

  Specifically, the challenger (player) can challenge the opponent (attack) against an opponent other than his / her subordinate (a person who is in a hierarchy hanging from the challenger). Then, a battle game win / loss determination process is performed, and the hierarchical structure is determined based on the battle win / loss result. That is, the hierarchical structure is set (reset) according to the battle result.

  For example, when the challenger wins the opponent of the top layer (root) of the hierarchical structure, the challenger moves to the top layer. Then, the hierarchical structure (arrangement relationship) is reset, and the subordinates of the challenger are arranged at a level lower than the hierarchy where the challenger is arranged. The losing opponent moves to a lower level than the challenger. In other words, the losing opponent is placed in, for example, the hierarchy immediately below the winner, and the losing opponent's subordinates move together while maintaining the relationship.

  Challengers can also attack against opponents in the same hierarchy, and if they win against opponents in the same hierarchy, the hierarchical structure is reset, and opponents in the same hierarchy are placed in the lower hierarchy of the challenger. Be placed.

  On the other hand, the challenger cannot attack the opponent arranged immediately below in the hierarchical structure to which the challenger belongs. However, an opponent who belongs to a different hierarchical structure can attack regardless of whether the hierarchy is up or down.

  When the challenger wins by the battle, the challenger is given points acquired by the battle. This acquired point may be a point corresponding to the hierarchy to which the challenger belongs. In addition, the earned points are distributed to subordinates below the challenger. In this case, the proportion of acquired points is increased, for example, as the subordinates of the upper layer. In this way, even if the subordinate is in an offline state or the like, if the upper character wins the battle, the subordinate can receive the distribution of the acquired points. Therefore, it is possible to receive benefits as subordinates, and it is possible to improve the fun of the game using the hierarchical structure.

  Further, the game clear condition of the game stage (area) is determined according to the continuous placement time (or the number of times of placement) on the top layer. For example, when the character occupancy ratio with respect to the total number is equal to or higher than a given rate, and the continuous placement time on the top layer is longer than a given time, it is determined that the player has cleared the game stage, and the next Promote to stage.

  According to the game of the present embodiment, even when standing at the top, which is the uppermost layer, there is a stimulus due to a tension that may be lowered. For example, a person who becomes a new champion (for example, a person who stands at the top layer in a hierarchical structure with a given occupation ratio or higher) is notified to other players and becomes a new target of other players. If the champion keeps his position for a given time (continuous placement time), the game stage can be cleared, so there is a sense of tension, and a game where you can enjoy the superiority and tactics of winning.

  FIG. 4 shows an example of a game image of a game realized by the game system of this embodiment. In FIG. 4, icon images of a plurality of characters (game play elements) are displayed. Each of the plurality of characters corresponds to each player of the plurality of players participating in the game in the area (game stage). When there are not enough human players to participate, some of the plurality of players may be so-called computer players.

  In FIG. 4, for example, A1 is a player character (player game play element in a broad sense) used by a player for a battle. That is, A1 is a player character used by a player having a terminal device on which the game image of FIG. 4 is displayed. Therefore, in FIG. 4, the game image is displayed so that the A1 player character is arranged at the center of the screen, for example.

  As shown in A2, a plurality of subordinate characters belong to the lower layer in the player character hierarchical structure shown in A1. Each of the plurality of characters is also a character used by other players. That is, a plurality of players corresponding to the plurality of characters shown in A2 belong as subordinates (subordinates) of the player shown in A1.

  The hierarchical structure is a tree structure, and player characters are arranged in the first hierarchy, which is the uppermost layer, as indicated by A1. One character is arranged in the second layer below the first layer. The characters in the second hierarchy are also characters corresponding to other players. Therefore, in the terminal device of another player who operates the character of the second layer, the game image is displayed with the character of the second layer serving as the player character of the other player. Become.

  Two characters are arranged in the third layer below the characters of the second layer. A character is also arranged in a fourth layer below the right character of the two characters, and a character is also arranged in a fifth layer below the character.

  In this way, a plurality of characters are arranged below the player character shown in A1, thereby setting a hierarchical structure of a tree structure.

  In the present embodiment, the player character shown in A1 and the character below the player character (player game play element in a broad sense and game play elements below the player game play element) are assigned to the belonging character (the game play element belonging to a broad sense). ).

  In the present embodiment, a hierarchical structure image to which a player character belongs (in a broad sense, a hierarchical structure image to which a player game play element belongs) is displayed as a first hierarchical structure image IMP. This hierarchical structure image IMP is an image including, for example, icon images of belonging characters (player character and its lower layer character). In FIG. 4, the hierarchical structure image IMP includes six icon images corresponding to six belonging characters. The hierarchical structure image IMP also includes an image representing the connection between characters (between game play elements) in the hierarchical structure. In FIG. 4, the image representing this connection is an image of a line connecting six icon images.

  A3 is a character used by other players. In other terminal devices of the player, the game image is displayed so that the character indicated by A3 is arranged at the center of the screen, for example.

  In the lower layer of the character A3, a plurality of characters shown in A4 belong as subordinates (subordinates). A plurality of characters indicated by A6 belong to the A5 character immediately below the A3 character. The A5 character (and each character under the A5 character) is also a character used by other players. The terminal device of the other player is arranged such that the A5 character is arranged at the center of the screen, for example. A game image is displayed.

  Similarly, a plurality of characters indicated by A8 belong to the lower layer of the character A7. A plurality of characters indicated by A10 belong to the lower layer of the character A9. These characters A7, A8, A9, and A10 are also characters used by other players.

  In the game image of FIG. 4, in addition to the first hierarchical structure image IMP that is the hierarchical structure image to which the A1 player character belongs, the second hierarchical structure image to which the player character battle candidate belongs belongs. Hierarchical structure images IME1, IME2, and IME3 are displayed.

  In the game image of FIG. 4, both the first hierarchical structure image IMP and the second hierarchical structure images IME1 to IME3 are displayed. For example, only the first hierarchical structure image IMP is displayed. Only the second hierarchical structure images IME1 to IME3 may be displayed. That is, only the first hierarchical structure image IMP to which the player belongs may be displayed, or only the second hierarchical structure images IME1 to IME3 to which the battle candidates belong may be displayed.

  In FIG. 4, the player can scroll the screen by performing a swipe operation on the touch panel screen of the terminal device or the like. By doing so, the player can also view the hierarchical structure images of the battle candidates that are not displayed on the screen.

  Then, the player of the player character A1 can make an attack by making a battle request to any character whose icon image is displayed in the hierarchical structure images IME1, IME2, and IME3. That is, it is possible to attack any of the characters shown in A3, A4, A5, A6, A7, A8, A9, and A10.

  On the other hand, as will be described later, the player cannot attack the character indicated by A2 belonging to the lower layer of the player character indicated by A1. That is, a battle request for a character under his / her own (at least directly below) is not permitted.

  In FIG. 4, the player has selected the character (Sasuke) shown as A5 as the opponent. Specifically, by touching the icon image of the A5 character on a touch panel screen of a terminal device or the like, the character is selected and an attack is made against the character.

  As a result, a battle game image (due screen) shown in FIG. 5 is displayed, and a battle process between the A1 player character and the A5 character is performed. In this case, in this embodiment, the winning or losing of the battle is determined based on the number of subordinates of the player character (in a broad sense, the number of lower layer game play elements, the number of lower layer characters) and the probability element parameter. For example, the number of subordinates (the number of lower-layer game play elements) of the player character shown in A1 in FIG. 4 is 5, and the number of subordinates of the opponent character (the number of lower-layer game play elements) shown in A5 is 10. In this embodiment, for example, 1 point (predetermined addition point in a broad sense) is added for one subordinate. Further, 10 points are given as a base point to the A1 player character and the A5 opponent character.

  Therefore, as indicated by F1 in FIG. 5, the base point of the attack on the player side is 10 points and the number of subordinates is 5, so that 10 points + 1 point × 5 people = 15 points Become. As shown in F2, the reference point on the other side is 10 points + 1 point × 10 people = 20 points because the base point is 10 points and the number of subordinates is 10. Accordingly, if there is no probability element parameter, the opponent's reference point = 20 points is larger than the player's attack reference point = 15 points, so the player loses.

  However, in the present embodiment, as will be described later, the battle win / loss determination process is performed in consideration of the probability element parameter. In FIG. 5, as indicated by F3, the magnification based on the probability element parameter on the player side is 1.7 times, which is high. On the other hand, as indicated by F4, the multiple by the other party's probability element parameter is 1.0. Accordingly, the player-side earned points are 1.7 × 15 = 25.5 points, and the opponent-side earned points are 1.0 × 20 = 20 points, so the player wins. In addition, the display shown to F1, F2, F3, F4 of FIG. 4 is displayed as shown to B1 also in the game image of FIG. Therefore, the player can determine the opponent while viewing the display of B1.

  Thus, when the player wins, as will be described in detail later, the opponent character shown in A5 and its subordinate (subordinate) character shown in A6 also belong to the lower layer of the player character A1. Is reconstructed. As a result, the hierarchical images IMP, IME1, etc. in FIG. 4 are also changed in real time so as to reflect the reconstruction of the hierarchical structure. Accordingly, the winning player can visually recognize the increase in the number of characters under his / her own by looking at the hierarchical structure image IMP. Can taste.

  In the present embodiment, a predetermined number of players (for example, 10, 20, 30, 40, etc.) are participating in one game stage area. A player placed at the top layer of the hierarchical structure in a state where the character occupancy rate (game play element occupancy rate in a broad sense) is equal to or higher than a given rate is recognized as a champion.

  For example, the game stage area of FIG. 4 is an area where 20 players participate. Then, in a state where the character occupancy rate is, for example, 60% or more (more than a majority in a broad sense), the player placed on the top layer is recognized as the champion. For this reason, the uppermost player with the number of belonging characters (the number of belonging game play elements in a broad sense) of 20 × 0.6 = 12 is recognized as the champion. In FIG. 4, the number of characters belonging to the player indicated by A3 is 12 or more, and the character occupancy is 60% or more. Therefore, the A3 player is recognized as the champion, and a crown image is added to the icon image of the character.

  And in this embodiment, the arrangement continuation time in the state of becoming a champion (in a broad sense, the arrangement continuation time to the top layer of the hierarchical structure in a state where the game play element occupancy is equal to or higher than a given rate) When the time exceeds a given clearing time (for example, 4 hours or more), the player is judged to have cleared the game stage area (game is cleared) and is promoted to the next area. For this reason, in FIG. 4, as shown in B2 and B3, a notification display is provided to notify how many hours the arrangement continuation time in the champion's state will reach the clear time. The other players see this display and take action to prevent the A3 player from clearing the game.

  For example, in FIG. 5, since the player character of A1 in FIG. 4 has won the character shown in A5, the situation is reversed and the champions are replaced.

  In other words, before winning the battle, as shown in B4, the number of belonging characters of the player character of A1 is 6 (one is himself and 5 are subordinates) and corresponds to a character occupancy rate of 60%. It has not reached people. However, since the A1 player character wins over the A5 character (number of subordinates = 10, number of belonging characters = 11), who is the subordinate of the character of A3, the number of belonging characters of the player character of A1 is from 6, Increase to 6 + 11 = 17 people. As a result, the qualification condition for the champion is satisfied, and the player character of A1 now reigns as the champion.

  In this way, frequent replacement of the champions due to one-time reversal increases the sense of urgency, excitement, and exhilaration of the game, and an unprecedented game system can be realized.

2.2 Details of the Battle Game Next, details of the battle game of the present embodiment will be described.

  In this embodiment, if the opponent is won in a battle (due), the opponent can be made a subordinate. For example, in FIG. 6A, the character C1 and the character C2 are competing and C1 is victorious. Specifically, the first player uses the character C1, the second player uses the character C2, and the character C1 attacks the character C2 and wins. In this case, the character C2 becomes a subordinate of C1, and the character C2 belongs to the lower layer of the character C1 in the hierarchical structure. That is, the second player is under the control of the first player.

  Even if the attacking character C1 is defeated and the defending character C2 wins, the hierarchical structure does not change and remains unchanged.

  Further, as will be described later, the number of possible attacks is limited to a given number of times, for example. For example, the number of attacks within a given period is limited so that three attacks per day are possible. Also, if you win the opponent in a match, your opponent's subordinates belong to their own subordinates and become subordinates. That is, the subordinates are also subordinates.

  In addition, each character becomes stronger in proportion to the number of its subordinates. For example, in FIG. 6B, characters C2, C3, and C4 belong to the lower layer of the character C1, and there are three subordinates. For example, assuming that the base point of the character C1 is 10 points, the point added when one subordinate is present is, for example, 1 point (predetermined addition point). Therefore, the attack point (reference point) of the character C1 is 10 + 1 × 3 = 13 points, and the strength of the character C1 is 1.3 times by having three subordinates.

  On the other hand, since the character C2 has only one subordinate, the attack point is 10 + 1 = 11 points, and the presence of the subordinate increases the strength by 1.1 times. Since characters C3 and C4 have no subordinates, their attack points are 10 points, and the strength remains unchanged and is 1.0 times.

  As described with reference to FIG. 5, based on these attack points and probability element parameters, a process for determining the victory or defeat of the battle between characters is performed.

  In FIG. 6B, the battle win / loss determination process is performed based on the number of subordinates (the number of lower-layer game play elements), but the present embodiment is not limited to this. For example, the battle win / loss determination process may be performed based on the game parameters of the affiliated character, or based on the number of subordinates and the game parameters of the affiliated character. For example, in FIG. 6B, a boss character C1 and subordinate characters C2, C3, and C4 are belonging characters. Therefore, in this case, the battle win / loss determination process is performed using the game parameters of the characters C1, C2, C3, and C4. Note that the game parameters of the subordinate characters C2, C3, and C4 may be used instead of the game parameters of the boss character C1, and the battle win / loss determination process may be performed. Or the reverse may be sufficient.

  In the present embodiment, as described in B2 and B3 in FIG. 4, the state of the king who has subordinate the number of characters in the area of, for example, 60% or more (more than a majority) is set for a predetermined time or more (for example, several hours or more) If it can be maintained, it is determined that only one player (character) has cleared the game, and the process proceeds to the next area. In this case, the player cannot take the subordinate character in that area to the next area.

  In the present embodiment, the player has a sense of tension that waits for a chance to imagine, or a pleasure to worry about selecting whether or not to move the battlefield without waiting for such a chance. Even during such thinking time, the hierarchical structure (tree structure) may change in real time, and the player's enjoyment of thinking is great.

  In addition, maintaining a predetermined time (for example, 4 hours) while being a champion creates, for example, the same fun and tension as mahjong's post-reach bargaining. For example, as shown in B3 of FIG. 4, the securing of the character occupancy rate of 60% by the king is told to all players, and other players ride on the winning horse, drag the king down, Overheats.

  In addition, according to the present embodiment, the player can get an opportunity to get a “feeling of doing it” at a stretch, and depending on enemy trends, things may not progress as well. is there.

  For example, in FIG. 7A, it is assumed that the player character used by the player is C1. There are two subordinates of this player character C1 as shown by D1, and there are four subordinates of the enemy character C2 as shown by D2, C3 and D3. For this reason, it is difficult for the player to win in this situation.

  Therefore, the player changes his aim to the subordinate C3 of the character C2, and attacks the character C3 having two subordinates as shown in D3. In this case, since the number of subordinates of C1 and C3 is the same two as shown in D1 and D3, there is a possibility of winning. As described with reference to FIG. 5, winning / losing is determined by a probability element parameter (magnification 1.7 times, 1 time, etc.).

  In FIG. 7B, since the player character C1 has won the character C3, the subordinates shown in the characters C3 and D3 belong to the lower layer of the player character C1. By doing so, the situation can be reversed as shown in FIG. 7B from the state of FIG. 7A by one hand, and the player can perform one-shot reverse rotation. That is, in FIG. 7A, the numbers of subordinates C1 and C2 are 2 to 4, respectively, and C2 is dominant, but in FIG. 7B, the numbers of subordinates C1 and C2 are , Each is 5 to 1, and the situation is reversed at a stretch.

  In addition, it is also fun for the player to consider the subsequent development of FIG. For example, the character C2 may be attacked and won in FIG. 7B, but there is a limit to the number of possible attacks, and if the possible number of attacks is used up, the battle cannot be performed thereafter. In FIG. 7B, the number of subordinates of the player character C1 and the character C2 is 5 to 1 and the player is overwhelmingly advantageous, but there is a probability factor described in FIG. It is not always possible. Therefore, in this case, a strategy of changing the aim and attacking the character D2 who is a subordinate of C2 is also born.

  As described above, in this embodiment, when a player wins a battle against another character C3 (another game play element) using the player character C1 (a player game play element), the other character C3 and its character C3 are displayed. The lower layer character D2 (the other game play elements and the game play elements below the other game play elements) belongs to the lower layer of the player character C1. When the player character C1 wins, it is possible to perform a modification in which only the other character C3 (other game play elements) belongs to the lower layer of the player character C1.

  In addition, when there are a large number of players participating in the area, most players will be in the position of someone's subordinates, but the game realized by this embodiment can also enjoy the game even with subordinates. The following is a case where the player in the subordinate's position becomes the top as expected.

  For example, in FIG. 8A, it is assumed that the player character used by the player is C3. It is assumed that the player character C3 has left three times as the possible number of attacks per day (action power). The player predicts that, for example, the situation changes from the situation shown in FIG. 7A to the situation shown in FIG. 8A, and the character C1 who is his boss will attack the character C2.

  However, in the situation of FIG. 8A, since the number of subordinates of the player character C3 is two as shown by D3 and the number of subordinates of the character C2 is one, there is a possibility of winning. Therefore, the player plans to attack the character C2 before the character C1 as the boss.

  When the attack is successful, the state changes to a hierarchical structure as shown in FIG. That is, the character C2 is placed below the player character C3 and becomes a subordinate, and the number of subordinates of the player increases from two to four in FIG.

  In this state shown in FIG. 8B, the player then attacks the character C4, who is a subordinate of the player character C3. When winning, as shown in FIG. 8 (C), the character C4 and its subordinate D4 are arranged in the lower layer of the player character C3 and become subordinates. The number of subordinates is from the four in FIG. 8 (B). Increase to 6 people.

  That is, from the situation of FIG. 8A, the number of subordinates has increased from two to six in two attacks. And since the number of subordinates of the character C1 of his boss is seven persons including himself, the number of subordinates is antagonistic. Therefore, if the last attack of the third time is set against the character C1 as a boss and won, the position of the champion can be obtained. And if the state as a champion can be maintained for a given time or more, the game is cleared and it is possible to proceed to the next stage. In other words, success as a subordinate succeeds.

  As described above, in this embodiment, in FIG. 8B, the player character C3 cannot attack the subordinate D3 (particularly the subordinate directly), but the upper character C1 or the same character in the same hierarchical structure. The character C4 in the layer can be attacked. Since the character of D4 is not a subordinate directly under him, he can attack.

  In FIG. 8A, the player character C3 can attack a character having a hierarchical structure different from the hierarchical structure to which the player character C3 belongs, such as the characters C2 and D2, regardless of whether the hierarchy is up or down. .

  By doing so, as described in FIGS. 8A to 8C, the player improves his position through various strategies and plans, and eventually becomes a champion. It becomes possible to clear the game.

  For example, in FIG. 9, the player cannot attack at least the characters C4 and C5 immediately below the player character C3 (gameplay elements immediately below in the hierarchical structure of the player gameplay elements in a broad sense). Further, it cannot attack the lower-level character C6. Then, a battle request for the character selected by the player from the plurality of characters C1, C2, C7 to C10, and C11 to C14 excluding these characters C4, C5, and C6 is permitted. It should be noted that a modification may be made in which a battle request for a character C6 that is not directly under the player character C3 is permitted.

  In the present embodiment, a battle request is permitted for the upper-layer characters C1 and C2 and the upper-layer character C7 in the hierarchical structure of the player character C3. Also, since the characters C8, C9, and C10 are not subordinates of the player character C3, a battle request for these characters C8, C9, and C10 is permitted.

  The characters C11 to C14 belong to another hierarchical structure different from the hierarchical structure to which the player character C3 belongs (hierarchical structure including C1 to C10). Therefore, a battle request for characters C11 to C14 belonging to such another hierarchical structure is also permitted.

  For example, even if the player character C3 attacks the characters C4 and C5 directly below and wins, the hierarchical structure does not change and is meaningless. Make permission.

  On the other hand, if the attack on the subordinates is permitted, the upper layer character becomes too strong and the game balance may be lost. Therefore, such attacks on the subordinates are not permitted.

  For example, as shown in FIG. 8C described above, a situation where there is only one character C3 immediately below the upper character C1 is a dangerous situation for the upper character C1. That is, in FIG. 8C, the ratio of the numbers of the subordinates of the characters C1 and C3 is 7 to 6, and the fighting power is antagonizing. Therefore, when the character C3 attacks the character C1, depending on the probability setting based on the above-described probability element parameter, the character C1 is likely to be defeated. If defeated, the boss and the subordinate are switched.

  Therefore, it is desirable for the player of the character C1 to be able to attack the subordinate characters C2 and C4 in order to avoid such a dangerous situation. For example, the number of subordinates of the character C2 is one, and if the character C2 is attacked, the possibility of winning is high. When the character C2 is won, the character C2 becomes a subordinate immediately below the character C1, and is no longer a subordinate of the character C3. Also, the character D2 is no longer a subordinate of the character C3, but a subordinate of the character C1. Therefore, if the character C2 is attacked and won, the number of subordinates of the character C3 decreases from six to four, so that the critical state of FIG.

  Furthermore, if the character C1 attacks and wins the character C4, the characters C4 and D4 are removed from the subordinates of the character C3 and become subordinates of the character C1. That is, the situation is that the three subordinate characters C3, C2, and C4 belong directly below the character C1.

  In such a situation, the number of subordinates of the character C1 remains high with seven people, whereas the number of subordinates of the character C3 immediately below it is two, and the subordinates of the characters C2 and C4 are subordinate. The number will be one. Therefore, the characters C3, C2, and C4 no longer have the problem of reversing their posture, and the character C1 has an overwhelming advantage.

  In this regard, in the present embodiment, an attack on his / her subordinate is not permitted. Therefore, the upper character C1 cannot attack the subordinate characters C3, C2, C4, etc., and the occurrence of the above problems can be prevented.

  In FIG. 10, when the character C3 wins by attacking the upper character C2, the hierarchical structure changing process may be performed as shown in FIG. That is, when the character C3 wins over the C2, the character C3 becomes independent from the subordinates of the character C2, and only the characters C4, C5, and C6 that are his / her subordinates are brought together to form another separated hierarchical structure.

  That is, normally, when the character C3 wins the character C2, the positions of the characters C3 and C2 are switched, and the character C7 and the characters C8 and C9 below it are also subordinates below the character C3. However, some players desire to be independent from the hierarchical structure that is the organization of the characters C1 and C2. Alternatively, there are players who do not want the character C7 to be a subordinate due to personal circumstances. If separation / independence of the hierarchical structure as shown in FIG. 10 is allowed, it is possible to meet such a player's demand.

  Further, in the present embodiment, as shown in FIG. 11, an attack possible period (competition possible period) in which the player can attack (match) and an attack impossible period (competition impossible period) in which the player cannot make an attack are made. It is set. For example, 24 hours a day is divided into a plurality of time frames, and an attackable period and an attack impossible period are set as these time frames. For example, an attack possible period and an attack impossible period are alternately set.

  It should be noted that it is desirable to set the attackable period and the attack impossible period for all players participating in the game stage area, but it is also possible to set different settings for one or more players. is there. For example, for players who frequently play online games during night hours, the percentage of time allocation in the attackable period is higher in the night time period than in the non-attack period. In the time zone, the ratio of time allocation of the attack possible period is lowered. On the other hand, for players who frequently play online games in the morning hours, in the morning hours, the percentage of time allocation in the attackable period is higher than in the no-attack period, and daytime and nighttime In the time zone, the ratio of time allocation of the attack possible period is lowered.

  According to the method of FIG. 11, for example, an attack impossible period in which an attack is not possible is set every given time (for example, every hour). In the period when the attack is not possible, the battle is not performed and the hierarchical structure does not change. Therefore, it is time for the player to chat as shown in FIG. That is, a cycle in which a relaxed time called an attack impossible period and an intense time called an attack possible period are repeated.

  The enjoyment of the game is deepened by the existence of such an attack impossible period (due due period). For example, immediately after the attack period begins, you can choose whether to attack immediately, or if the opponent moves and then sees the other person's movement, or how many times the other person can attack It is possible to make a strategy of the game by checking whether or not, thinking through various thoughts and thoughts. The number of possible attacks can be held up to a predetermined number (for example, 3 times), and is recovered once every predetermined time (for example, 6 hours).

  For example, in the chat screen of FIG. 12, during the attack impossible period, players of characters belonging to different hierarchical structures chat with each other and carry out various plots.

  In particular, in the present embodiment, a limited number of players such as 20, 30, and 40 people participate in one area. Therefore, while these predetermined number of players repeatedly play a game or chat, there is a habit of how to play each player's game, personality, or the time period during which they are playing online. Other players will be able to grasp. Therefore, compared with a network game in which a very large number of players, such as thousands to tens of thousands, play a game, the strategy and fun of the game can be greatly increased.

  In FIG. 12, display processing may be performed so that the character of the player who is online and chatting can be identified during the period when the attack is not possible. That is, display processing is performed in such a manner that the icon image of the character of the player who is chatting and the icon image of the character of the player who is not chatting can be identified. In this way, for example, the player of the boss feels suspicious when the player under his / her subordinate is frequently chatting, and becomes suspicious, which may increase the fun of game play. it can. In this case, a special item that can be purchased by paying a fee may be used so that the contents of chat between players can be known or exposed.

  In the present embodiment, such a chat is performed during an attack-impossible period, etc., and various strategies are established. It is possible to reverse.

  For example, in FIG. 13A, it is assumed that the player character used by the player is C3. The player character C3 is a subordinate immediately below the boss character C1, and no other character exists in the same layer. For this reason, the number of subordinates of the character C1 and the player character C3 is 7 to 6, which is antagonistic. Therefore, there is a high possibility that the player character C3 will win when attacking the character C1. When the player character C3 wins, the hierarchical structure changes as shown in FIG.

  In FIG. 13B, the player character C3 is placed on the top layer and is in a position to aim at the champion. In FIG. 13A, there is only one character directly below the uppermost character C1, which is disadvantageous for the character C1. On the other hand, in FIG. 13B, the number of characters immediately below the player character C3 is four, and the number of subordinates of these characters is one or two, which is very small. Accordingly, a player who has succeeded in reversing can secure a stable top-level position, and realizes a large reversal utilizing the opportunity.

  Thus, in the competitive game of the present embodiment, how to use the limited number of possible attacks at what timing is important for winning the game. In this case, for example, the user may be charged for an increase in the number of possible attacks. For example, by preparing a special item that can increase the number of possible attacks and purchasing it with in-game currency or the like, the limited number of possible attacks can be increased.

  In this embodiment, a long time is spent thinking for an attack or the like, and the battle (duel) with the opponent ends in an instant. For example, when the player selects a character to be an opponent as shown by A5 in FIG. 4 and performs a slash operation to move his / her finger to cut with a sword, for example, a game image of a duel screen as shown in FIG. 5 is displayed on the terminal device. Is displayed. Then, for example, a battle effect display for several seconds is performed, and the player is notified of the win or loss of the battle, and the hierarchical structure images IMP, IME1, and the like in FIG. 4 change according to the battle result. Then, the one-time reversal as shown in FIG. 13A and FIG. 13B occurs, so that a game with a refreshing feeling can be provided to the player.

  For example, a duel screen as shown in FIG. 5 is displayed on the terminal device of the player who has made the attack, for example, for several seconds. It is determined instantly at the timing when the opponent is selected and attacked. Therefore, during the period in which the duel screen of FIG. 5 is displayed on the terminal device of the player, the hierarchical structure image reflecting the winning / losing result of the battle is displayed on the terminal device of the other player. If another player attacks during this period and the hierarchical structure further changes, the layer expected by the player at the timing when the duel screen display in FIG. The structure may be different from the structure. Therefore, in this case, after the duel screen display is finished, for example, how the player chooses replay, how other players played and how the hierarchical structure changed. It is desirable to make it visible later in the replay image.

  In the present embodiment, a battle game win / loss determination process is performed based on the probability element parameter. Specifically, as shown in FIG. 14A, in the present embodiment, basically, the number of subordinates (the number of lower layer characters and the number of lower layer game play elements) and subordinate characters (boss characters and their lower layers). Based on at least one of the game parameters of the subordinate character), a battle game win / loss determination process is performed. In FIG. 14A, a probability element parameter is also added to this, and a battle game win / loss determination process is performed. For example, a random number is generated, a probability is set based on the random number, and a value of the probability element parameter is set. Then, based on the number of subordinates or the game parameters of the affiliated character and the probability element parameters, a battle game win / loss determination process is performed.

  A specific example of the win / loss determination process based on the probability element parameter will be described with reference to FIG. For example, in FIG. 14 (B), there are prepared special moves for which the degree of death is “small”, “medium”, “large”, and “super”. These special moves can be realized by equipping the characters (cards) used by the player with items corresponding to these special moves.

  “Small” special moves have a magnification of 1.3, which is not so high, but the probability of occurrence is relatively high, such as 24%.

  The “middle” special move has a magnification of 1.7 times, which is higher than the “small” special move, but has a probability of occurrence of 11.2%, which is lower than the “small” special move.

  The “Large” special technique has a magnification of 3.0 times, which is considerably higher than the “Small” and “Medium” special techniques, but the probability of occurrence is 1.84%. It is considerably lower than its Special Move.

  “Super” Special Moves have a very high magnification of 5.0 times, but the probability of occurrence is 0.4%, which is very low. The activation of the special technique with such an occurrence probability is controlled using the probability element parameter of FIG.

  Then, based on the magnification set in FIG. 14B, the battle win / loss determination process described in FIG. 5 is performed. For example, in FIG. 5, as indicated by F <b> 1, the reference point for attacking the player character is 15 points because the base point is 10 points and the number of subordinates is five. On the other hand, as shown in F2, the reference point of the opponent character is 20 points because the base point is 10 points and the number of subordinates is 10.

  For the player character, as shown in F3 of FIG. 5, the “medium” special move technique of FIG. 14B is activated, and the attack reference point = 15 points is 1.7 times, The attack point of the player character is 15 × 1.7 = 25.5 points.

  On the other hand, as for the attack point of the opponent character, as shown in F4 of FIG. 5, none of the special moves in FIG. 14B is activated, and the reference point = 20 points remains. Therefore, although the player character has fewer subordinates and the reference point is lower than that of the opponent character, the attack point is increased by 1.7 times due to the “medium” special move generated by the probability element parameter. And I am victorious. In other words, even if the number of subordinates is small and the situation is unfavorable, the battle is won thanks to the probability element parameter.

  In this way, by using the probability element parameter, it is possible to eliminate a uniform determination process in which winning or losing is determined only by the number of subordinates, and it is possible to improve the fun of the competitive game.

  Moreover, in the competitive game of this embodiment, various items can be used in order to increase the interest and the strategy of the competitive game.

  For example, in FIG. 15, the item “temptation” possessed by the character C4 who is the subordinate of the character C1 is used for the character C3 which is the subordinate of the character C2. When this “temptation” item is used, the character C3 is not counted as a subordinate of the character C2, for example, once or a plurality of times. That is, in FIG. 5, 1 point is added to one subordinate, but 1 point is not added to a subordinate to whom “temptation” is exercised. Specifically, taking FIG. 15 as an example, for example, the attack point of character C2 decreases from 10 + 4 = 14 points to 10 + 3 = 13 points.

  In FIG. 15, the character C4 uses the item “lucky” for the character C1 of his boss. When this “good luck” item is used, for example, the probability of occurrence of each of the special moves shown in FIG. 14B increases, and the magnification increases. Thereby, the character C1 can advance a battle | competition advantageously.

  Further, when the boss character C1 battles with another character C2, the boss character C1 consumes, for example, the number of times he can attack, the special items he possesses, etc. Can be used. This makes it possible to increase the probability of winning the battle game in a decisive battle that must be won.

  In addition, the boss character C1 can, for example, consume his / her possible number of attacks, special items possessed, and the like, and cause his / her subordinate character C4 to attack other characters.

  For example, an attribute may be set for a character or its possessed item, and compatibility may be set between the attributes. If the attribute of the character that the boss character C1 wants to play and the attribute of the possessed item are not compatible with the attribute of the boss character C1 or the attribute of the possessed item, the subordinate who has a good compatibility with this attribute. The character C4 is made to fight. This makes it possible to obtain a better match result even when the compatibility of attributes is poor.

  In this embodiment, as will be described later, various processes are performed in accordance with the degree of relationship between the player character and the subordinate who is the lower character. For example, game processing (matching processing), game result calculation processing, and display processing are performed according to the degree of relationship between the player character and his subordinate. Specifically, when the player character wins the battle, processing for distributing the acquired points to the subordinates of the player character is performed.

  FIG. 16 is an explanatory diagram of a game stage used in the game of this embodiment. Area 1 is the lowest level game stage. For example, seven players participate and a battle in which a hierarchical structure as shown in FIGS. 4 and 5 is set by seven characters used by the seven players. A game is played. When one of these seven players becomes a champion and satisfies the above-mentioned game clear conditions, the player can proceed to area 2 which is the next game stage.

  The area 2 is a game stage having a higher level than the area 1. For example, 12 players who have advanced from the area 1 participate and 12 characters used by the 12 players use FIG. 4 and FIG. A battle game in which a hierarchical structure as shown in FIG. When one of these 12 players becomes a champion and satisfies the above-mentioned game clear conditions, the player can proceed to area 3 as the next game stage.

  The same applies to the subsequent areas. When the number of participating players in each area is insufficient, a computer player whose behavior is controlled by a computer may be used instead of a human player.

2.3 Battle Process and Game Result Calculation Process FIGS. 17 and 18 are flowcharts for explaining the battle process of this embodiment.

  First, it is determined whether or not the recovery time for the possible number of attacks has elapsed, and if it has elapsed, an increment process for the possible number of attacks is performed (steps S1 and S2). For example, the possible attack count is incremented by one. At this time, the number of possible attacks does not exceed the maximum value (for example, 3 times). That is, when the maximum value is reached, the increment process is not performed.

  Next, it is determined whether or not the player has selected an attack (step S3). If an attack is selected, it is determined whether the possible number of attacks is 0 (step S4). If the possible number of attacks is 0, the process returns to step S1.

  On the other hand, if the possible number of attacks is not 0, it is determined whether or not the attack is permitted (step S5). That is, it is determined whether or not the time when the attack is selected is within the attack permission period described with reference to FIG. If it is not within the attack permission period, the process returns to step S1. If it is within the attack permission period, the player's attack is permitted and a decrement process is performed to decrement the possible number of attacks by, for example, -1 (step S6).

  As described above, in the present embodiment, by setting the number of possible attacks of the player, the process of limiting the number of attacks (the number of battles and the number of actions) of the player (the process of limiting the number of attacks within a given period) is performed. Realized.

  Next, the probability element parameters described in FIGS. 14A and 14B are calculated (step S7). For example, the probability element parameter is calculated based on a random number. Next, the degree of relationship with the subordinate is calculated (step S8). That is, the degree of relationship between the player character (player game play element) and the lower layer character (lower layer game play element) that is a subordinate thereof is calculated. Then, based on the probability element parameter, the number of subordinates, the game parameters of the affiliation character (player character, subordinate), the degree of relationship, etc., a battle game win / loss determination process is performed (step S9). That is, the processing described in FIGS. 14A and 14B is performed.

  Next, it is determined whether or not the player has won (step S10). If the player has won, hierarchical structure reconstruction processing is performed (step S11). For example, a process of causing the opponent character and the lower layer character (other game play elements and lower game play elements) to belong to the lower layer of the player character is performed. Next, the player's acquisition points in the battle are calculated (step S12). Then, based on the degree of relationship and the like, the distribution process of the acquired points to subordinates is performed (step S13).

  As described above, in this embodiment, when the player character (player game play element) wins in the battle game, the process of distributing the battle game acquisition points to the subordinates (game play elements below the player game play element). It is carried out.

  FIG. 19 is a flowchart illustrating a game clear condition determination process, which is one of the game score calculation processes.

  First, it is determined whether or not the player's character occupancy is equal to or higher than a given rate (for example, 60% or higher) (step S31). The character occupancy rate (game play element occupancy rate) is a ratio of the number of characters belonging to the player (player characters and subordinate lower level characters) to the total number of characters in the game stage (area).

  If the character occupancy is equal to or higher than the given rate, the player character placement duration time on the top layer of the hierarchical structure is calculated (step S32). That is, the duration time reigning as a champion is calculated. Note that the number of times the player character is arranged on the top layer of the hierarchical structure may be calculated.

  Then, it is determined whether or not the arrangement continuation time is longer than a given time (step S33). Alternatively, it may be determined whether or not the number of arrangements is a given number or more. When the arrangement duration time is equal to or longer than the given time (or when the number of arrangements is equal to or greater than the given number), it is determined that the player has cleared the game stage (area), and the next The stage is advanced (step S34).

  As described above, in the present embodiment, the player's game results are calculated based on the arrangement duration time and the number of arrangements of the player character (player game play element) in a predetermined hierarchy of the hierarchical structure. Specifically, when the player's character occupancy rate (game play element occupancy rate) is equal to or higher than a given rate, and the duration of arrangement on the top layer of the hierarchical structure is equal to or longer than the given time It is determined that the player has cleared the game (or when the number of arrangements exceeds a given number).

  In FIG. 19, the game calculation process in the case where the predetermined hierarchy of the above hierarchical structure is the uppermost layer has been described, but the present embodiment is not limited to this. Even when the player character is placed in a layer other than the top layer, the player's game results (for example, points acquired at the time of winning the battle) are calculated based on the duration and number of times of placement in the layer. You may calculate.

  FIG. 20 is a flowchart for explaining processing according to the degree of relationship between the player character and his / her subordinates.

  First, the subordinate's affiliation time is calculated (step S21). For example, the total time (cumulative time) of the time when the lower layer character who is a subordinate of the player character belongs as the player character is calculated as the belonging time (affiliation duration). Alternatively, the number of affiliations may be calculated instead of the affiliation time.

  Next, the attribute relevance with the subordinate is calculated (step S22). For example, in the present embodiment, attributes (for example, attributes of fire, water, soil, wind, etc.) are set for a character and a possessed item of the character. The compatibility is set between the attributes, and the attribute relevance with the subordinate is calculated according to the compatibility between the attribute of the player character and the attribute of the lower layer character that is the subordinate. For example, when the compatibility between characters is good (when the compatibility between characters is compatible), it is determined that the attribute relevance with the subordinate is high. Further, the degree of attribute relevance with the subordinate is calculated according to the compatibility between the possessed item of the player character and the attribute of the possessed item of the lower character. For example, when the compatibility between items is good (when the compatibility between items is compatible), it is determined that the attribute relevance with the subordinate is high.

  Next, based on the affiliation time (or the number of affiliations) obtained in steps S21 and S22, the degree of attribute relevance, etc., the degree of relationship with the subordinate is calculated (step S23). For example, when the affiliation time is long (or when the number of affiliations is large) or when the attribute relevance level is high, the degree of relationship with the subordinate is set to a high value. On the other hand, when the affiliation time is short (or when the number of affiliations is small) or when the attribute relevance level is low, the degree of relationship with the subordinate is set to a low value.

  Then, a game process (matching process) based on the degree of relationship with the subordinates or the like is executed (step S24). In addition, a game result calculation process and a display process based on the degree of relationship with subordinates and the like are executed (step S25).

  As described above, in this embodiment, game processing, game result calculation processing, and display processing are performed in accordance with the degree of relationship with the subordinate (the degree of relationship between the player game play element and the game play element below it).

  Various processes are conceivable as the game process and the game calculation process according to the degree of relationship with the subordinate. For example, when the degree of relationship with the subordinate is high, the attack power of the character is increased or the effectiveness of the possessed item of the character is increased. For example, if the degree of relationship with subordinates is normal, the increase in attack points per subordinate is 1 point, but if the degree of relationship with subordinates is high, the attack per subordinate Increase the point increase value to be greater than 1 point. Alternatively, as described above, when the player wins the battle, the distribution process of the acquired points according to the degree of relation with the subordinate is performed. For example, when the degree of relationship with the subordinate is high, the proportion of the player's earned points to the subordinate is increased.

  21A and 21B are examples of display processing based on the degree of relationship with subordinates. In FIGS. 21A and 21B, display processing is performed to identify the degree of relationship with subordinates in the hierarchical structure images IMP and IME (first and second hierarchical structure images).

  For example, in FIG. 21A, it is determined that the degree of relationship between the player character P1 and the subordinate character PG, which is a subordinate thereof, is high. Therefore, in this case, in the hierarchical structure image IMP, as a display process for identifying the degree of relationship with subordinates, for example, a display process for drawing connection lines between character icon images is performed. That is, by thickening the connection line, the player is visually identified that the degree of relationship between the characters is high. On the other hand, the opponent character E1 is determined not to have a high degree of relationship with the subordinate character EG that is its subordinate. Therefore, in the hierarchical structure image IME, display processing for drawing connection lines between character icon images with normal lines is performed.

  In FIG. 21B, conversely, it is determined that the player character P1 has a lower degree of relationship with his subordinates and the opponent character E1 has a higher degree of relationship with his subordinates. Therefore, in this case, in the hierarchical structure image IMP, display processing is performed in which connection lines between character icon images are drawn with normal lines. On the other hand, in the hierarchical structure IME, display processing for drawing connection lines between character icon images with thick lines is performed.

  In FIGS. 21A and 21B, as a display process for identifying the degree of relationship with subordinates, a display process for drawing connection lines between character icon images is performed. The present embodiment is not limited to this. For example, various modifications such as increasing the brightness of these connection lines, blinking the connection lines, and setting the colors of the connection lines to be conspicuous are possible. Or you may change the display mode of a character's icon image according to the degree of relation instead of the display mode of a connection line. For example, when the degree of relationship between characters is high, increase the brightness of the icon image, surround the icon image with a thick border, blink the icon image, and set the icon image color to a special color Various modifications can be made such as.

2.4 Modifications The method of the present embodiment described above can be variously modified.

  For example, both the player character and the subordinate character have attributes, and if the attributes match, the attack power is increased. That is, when the degree of association of attributes is high, it is determined that the degree of relation between the character and the subordinate is high, and the attack point is increased. For example, in normal times, the increase value of attack points by subordinates is 1 point, but when the degree of relationship is high, the increase value is made higher than 1 point.

  In addition, the trust pipe becomes thicker by the time of the subordinate of the character (arrangement continuation time), making it difficult to overcome. In other words, if the time of subordinates is long, it is determined that the relationship between the character and the subordinates is high. For example, when the subordinate attacks the boss character, the number of possible attacks is set to two times. Perform the process.

  Further, if the relationship between the boss character and the subordinate character is long, the character of the opponent character is affected. For example, various game parameter values of the character are increased according to the attribute. On the other hand, if the subordinate is rebellious, such processing is invalidated and there is no such thing. In addition, the degree of relationship that is the bond between the upper and lower layers is increased according to the length of time that is in the relationship between the boss and the subordinate, and the game parameter values of the boss and the subordinate character are increased.

  Also, for example, the attack power (attack points) at the time of the battle according to the ratio of the subordinates who belong to the online state (the state where the terminal device is connected to the network game and is playing the network game) among the subordinates to which they belong Up. For example, when all the subordinates are online, the attack power at the time of the battle is the maximum value.

  In addition, since the earned points are distributed to the subordinates, the degree of relationship between the boss and the subordinates is increased, and as described above, it is difficult to overcome the subordinates. Also increase the increase in attack points by subordinates.

  Further, for example, when a battle is performed, the value of the game parameter such as the attack power of the defensive character may be decreased. That is, in this embodiment, when the attacking character wins, the hierarchical structure and the like change, but when the defensive character wins, such a change does not occur. Moreover, there is a limit to the number of attacks, and the attacker can only attack a predetermined number of times a day, which is disadvantageous. Therefore, if the character is attacked many times, the game parameter value of the defensive character who has been attacked is decreased so that the character gradually becomes weaker.

  Further, at the start of the game (at the start of the game on the game stage), it is desirable that the hierarchical structure is a flat hierarchical structure (a hierarchical structure having only one hierarchy), but the present embodiment is not limited to this. For example, at the start of the game, a non-flat hierarchical structure has already been created, and each character may be arranged in one of the hierarchical structures. In this case, for example, a layer to be arranged may be determined based on a value of a game parameter that the character has as a basic value (for example, a game parameter value of a character card).

  Moreover, you may make it set arbitrarily the period which performs the correction process of the attack power based on the probability element parameter as shown to FIG. 14 (A) and FIG. 14 (B). For example, the correction process is not performed for a given period from the start of the game, and the correction process is performed after the given period has elapsed and the hierarchical structure of the character is completed to some extent. Also good. Or, conversely, the correction process may be performed only during a given period after the game starts.

  In the present embodiment, a time limit may be set for the battle game. Then, the game score when this time limit has elapsed may be calculated as the final game score. For example, the final game score of the player may be calculated in accordance with the total points of the winning points of each player when the time limit has elapsed. Alternatively, the final game score of the player may be calculated according to the number of characters (character occupancy rate) of each player when the time limit has elapsed. Alternatively, the final game score of the player may be calculated according to the degree of relationship with the subordinates and the degree of character growth when the time limit has elapsed.

  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, in the specification or drawings, terms (characters) described at least once together with different terms (game play elements, player game play elements, belonging game play elements, game play element occupancy rates, predetermined hierarchies, etc.) in a broader sense or the same meaning , Player character, affiliation character, character occupancy rate, top layer, etc.) can be replaced with the different terms anywhere in the specification or drawings. The hierarchical structure setting process, the battle process, the game process, the battle request permission process, the game score calculation process, the display process, the calculation process based on the degree of relation, etc. are not limited to those described in the present embodiment. Such an equivalent technique is also included in the scope of the present invention.

TM1 to TMn, TM terminal device,
100 processing unit, 101 input receiving unit, 102 reception processing unit, 104 transmission processing unit,
108 game processor, 110 game score calculator,
120 display processing unit, 130 sound processing unit, 160 operation unit, 162 imaging unit,
170 storage unit, 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, 608 game processing unit,
610 game score calculation unit, 615 authentication processing unit, 616 management processing unit,
620 display processing unit, 630 sound processing unit, 660 operation unit,
670 storage unit, 672 game play element information storage unit,
674 Hierarchical structure information storage unit, 676 Billing information storage unit, 678 User information storage unit,
680 Information storage medium, 696 communication unit

Claims (17)

A game processing unit for performing a game process of a battle game in which a plurality of players play using game play elements;
A game score calculation unit for calculating the player's game score;
A display processing unit that performs display processing of game images;
Including
As a result of the battle, each game play element of the plurality of game play elements for which a hierarchical structure is set is associated with each player of the plurality of players,
The game processing unit
When a player battles using a player game play element, a game play element selected by the player from among a plurality of game play elements excluding at least a game play element immediately below in the hierarchical structure of the player game play element is selected. Allow the match request,
The display processing unit
Processing for displaying at least one of a first hierarchical structure image that is a hierarchical structure image to which the player game play element belongs, and a second hierarchical structure image that is a hierarchical structure image to which a game play element that is a battle candidate belongs The game system characterized by performing. In claim 1,
The game processing unit
A game system that permits a battle request to a game play element belonging to another hierarchical structure different from the hierarchical structure to which the player game play element belongs. In claim 1 or 2,
The game processing unit
When a player wins a match with another game play element using the player game play element, the other game play element or a game below the other game play element and the other game play element A game system for performing a process of causing a play element to belong to a lower layer of the player game play element. A game processing unit for performing a game process of a battle game in which a plurality of players play using game play elements;
A game score calculation unit for calculating the player's game score;
A display processing unit that performs display processing of game images;
Including
As a result of the battle, each game play element of the plurality of game play elements for which a hierarchical structure is set is associated with each player of the plurality of players,
The game processing unit
When a player wins a match with another game play element using the player game play element, the other game play element or a game below the other game play element and the other game play element A process of causing a play element to belong to a lower layer of the player game play element;
The display processing unit
Processing for displaying at least one of a first hierarchical structure image that is a hierarchical structure image to which the player game play element belongs, and a second hierarchical structure image that is a hierarchical structure image to which a game play element that is a battle candidate belongs The game system characterized by performing. In any one of Claims 1 thru | or 4,
The game processing unit
A game system characterized by setting an attack possible period during which a player can attack and an attack impossible period during which a player cannot attack. In any one of Claims 1 thru | or 5,
The game processing unit
A game system that performs a process of limiting the number of attacks of a player. In any one of Claims 1 thru | or 6.
The game score calculation unit
Based on at least one of the number of lower-layer game play elements, which is the number of lower-layer game play elements of the player game play elements, and the game parameters of the game play elements belonging to the player game play elements and the lower-layer game play elements And a game system for performing a win / loss determination process of the competitive game. In claim 7,
The game score calculation unit
A game system, wherein a determination process of winning or losing of the competitive game is performed based on at least one of the number of lower-layer game play elements and game parameters of the belonging game play elements and a probability element parameter. In any one of Claims 1 thru | or 8.
The game score calculation unit
A game system for calculating a game result of a player based on an arrangement continuation time or number of arrangements of the player game play elements in a predetermined layer of a hierarchical structure. In claim 9,
The game score calculation unit
When the player's game play element occupancy rate is greater than or equal to a given rate, and the duration of the placement to the top layer of the hierarchical structure is greater than or equal to the given time, or to the top layer of the hierarchical structure A game system, wherein the player determines that the game has been cleared when the number of times of arrangement exceeds a given number. In any one of Claims 1 thru | or 10.
The game score calculation unit
When the player game play element wins in the battle game, the game system performs a process of distributing the acquisition points of the battle game to game play elements below the player game play element. In claim 11,
The game score calculation unit
A game system that performs a process of allocating the acquired points according to the degree of relationship between the player game play element and a lower game play element of the player game play element to the lower game play element. In any one of Claims 1 to 12,
A game system, wherein the game process, the game result calculation process, or the display process is performed according to a degree of relationship between the player game play element and a game play element below the player game play element. In claim 13,
The display processing unit
A game system, wherein display processing for identifying the degree of relationship is performed in at least one hierarchical structure image of the first and second hierarchical structure images. In any one of Claims 1 thru | or 14.
The battle game has a time limit,
The game score calculation unit
A game system, wherein a game score when the time limit elapses is calculated as a final game score. A game processing unit for performing a game process of a battle game in which a plurality of players play using game play elements;
A game score calculation unit for calculating the player's game score;
As a display processing unit that performs display processing of game images,
Make the computer work,
As a result of the battle, each game play element of the plurality of game play elements for which a hierarchical structure is set is associated with each player of the plurality of players,
The game processing unit
When a player battles using a player game play element, a game play element selected by the player from among a plurality of game play elements excluding at least a game play element immediately below in the hierarchical structure of the player game play element is selected. Allow the match request,
The display processing unit
Processing for displaying at least one of a first hierarchical structure image that is a hierarchical structure image to which the player game play element belongs, and a second hierarchical structure image that is a hierarchical structure image to which a game play element that is a battle candidate belongs The program characterized by performing. A game processing unit for performing a game process of a battle game in which a plurality of players play using game play elements;
A game result calculation unit for calculating a game result of the player's battle game;
As a display processing unit that performs display processing of game images,
Make the computer work,
As a result of the battle, each game play element of the plurality of game play elements for which a hierarchical structure is set is associated with each player of the plurality of players,
The game processing unit
When a player wins a match with another game play element using the player game play element, the other game play element or a game below the other game play element and the other game play element A process of causing a play element to belong to a lower layer of the player game play element;
The display processing unit
Processing for displaying at least one of a first hierarchical structure image that is a hierarchical structure image to which the player game play element belongs, and a second hierarchical structure image that is a hierarchical structure image to which a game play element that is a battle candidate belongs The program characterized by performing.

Images