JP6283846B2 - GAME SYSTEM, Rival Setting Control Method, and Computer Program - Google Patents

Description

  The present invention relates to a game system capable of setting rival relationships between users.

  A game system having a function of matching a plurality of users to match is well known. In addition, in order to maintain and improve the user's motivation for playing the game, a game system is also known in which a rival relationship is set between users and a game score or the like is competed between rivals (for example, Patent Documents 1 and 2). reference).

JP 2006-116046 A JP 2007-181549 A

  In a conventional game system, as a method for setting a rival relationship, a method that a user sets himself or a method in which the system automatically extracts and sets users who are close to game skills, etc. is adopted. . However, in these methods, the relevance with the condition for matching users is not considered. In addition, once a rival relationship is established, the relationship is fixed and the number of rivals is limited. Therefore, as the number of users who wish to participate in the game increases, the chance that each user is matched with the rival user decreases, and there is a possibility that the user cannot fully enjoy the rivalry.

  SUMMARY OF THE INVENTION An object of the present invention is to provide a game system and the like that can increase the number of opportunities for competition with rivals.

  The game system (1) of the present invention includes a matching means (25) for matching a plurality of users who should compete in a game, and a rival setting means (25; 32) for setting a rival relationship between the users. A battle history record, in which each time a user plays a match in the game, the content of the battle is recorded in the battle history information so that at least information for identifying the opponent user is included. A means (33, S5) is further provided, and the rival setting means sets the rival relationship with reference to the battle history information (see S11 to S20 in FIG. 4).

  Further, the rival setting control means of the present invention is applied to a game system (1) provided with matching means (25) for matching a plurality of users to be played in a game, and sets rival relations between the users. A rival setting control method for each game where each user battles in the game, and the content of the battle is recorded in the battle history information so that at least information for identifying the opponent user is included. A procedure (S5) and a procedure (S11 to S20) for setting the rival relationship with reference to the battle history information are provided.

  Furthermore, the computer program (PG1; PG2) of the present invention is applied to and included in the game system (1) having matching means (25) for matching a plurality of users who should compete in the game. At least one computer (2; 3), rival setting means (25; 33) for setting a rival relationship between the users, and every time each user battles in the game, the content of the battle is at least It is made to function as battle history recording means (33, S5) for recording in the battle history information so as to include information for discriminating the opponent user, and further, the rival relationship is set with reference to the battle history information Thus, the rival setting means is configured to function (see S11 to S20 in FIG. 4).

  According to the present invention, every time a user battles in a game, the content is recorded in the battle history information. In the battle history information, information for discriminating the user of the opponent with whom the user has played in the battle in the past, that is, the user of the matched opponent is accumulated. Therefore, if the match history information is referred to, other users who are relatively likely to be matched with the user are identified, and if the user is set as a rival, the battle opportunity with the rival can be increased. .

  In the present invention, the rival setting means may set the rival relationship between users matched by the matching means. According to this, since the rival is set by the matched opponent user, the user can compete with the rival on the game in the battle with the matched opponent. As a result, the opportunity to compete with rivals can be reliably increased.

  In the present invention, the rival setting means refers to the battle history information, identifies another user who is relatively likely to be matched with the user, and relates the rival to the identified user. May be set. According to this, a user who is relatively likely to be matched can be reliably set as a rival.

  In the present invention, the rival setting means refers to the battle history information, and a user whose index value correlates with the possibility of being selected as the matching opponent is recorded in the battle history information as the opponent. It is also possible to compare the determined index value with a reference value and set a user exceeding the reference value as a rival. In this case, as the index value, at least one of the number of battles or the battle frequency with the opponent may be determined, or at least one of the frequency of losing the opponent or the frequency of losing is determined. May be. That is, by referring to the battle history information, it is possible to determine the number and frequency of the user's battle with other users, or the number of times and the frequency of losing against other users. Since it is assumed that the larger the value, the higher the possibility of being selected as a matching partner, it is possible to set a user with a relatively high possibility that the user will fight using these index values as rivals. it can. Accordingly, the user is motivated to win the opponent who frequently competes, and the motivation to play the game can be maintained and improved. In particular, if the number of losses and the frequency of losing are determined as index values, the user is motivated to win a rival that cannot be easily won, and can be given more motivation. Further, when determining the number of battles or the battle frequency as an index value, the rival setting means has a ratio between the number of wins and the number of loses, or a ratio between the number of wins and the frequency of losses among users exceeding the reference value. A user who is within a predetermined range across% may be set as a rival. According to this, it is possible to set other users who are relatively likely to be matched and have the same level of winning and losing as rivals. Such a user is particularly suitable as a rival, and is suitable as an opponent that stimulates the user's willingness to play. Note that the predetermined range in this case may be set as appropriate according to the operating status of the game system and the like.

  Further, the rival setting means may control the reference value so that the number of users as rivals falls within a predetermined range. According to this, the possibility that an excessive number of users are set as rivals can be eliminated.

  In addition, in the above description, in order to make an understanding of this invention easy, the reference sign of the accompanying drawing was attached in parenthesis, but this invention is not limited to the form of illustration by it.

  As described above, according to the present invention, every time a user battles in a game, the content is recorded in the battle history information, and the rival relationship is set with reference to the battle history information. , It is possible to identify other users who are relatively likely to be matched with the user, and set the user as a rival, thereby increasing the opportunity to play against the rival.

The figure which shows the whole structure of the game system which concerns on one form of this invention. The conceptual diagram which shows the structure which sets the relationship of a rival. The functional block diagram in the principal part of the game system of FIG. The flowchart which shows the procedure of the rival setting process performed in order to set a rival.

  Hereinafter, a game system according to an embodiment of the present invention will be described. First, the overall configuration of the game system will be described with reference to FIG. The game system 1 includes a center server 2 as a server device, and a game machine 3 and a user terminal device 4 as client devices connectable to the center server 2 via a predetermined network 5. The center server 2 is configured as a single logical server device by combining server units 2A, 2B... As a plurality of computer devices. However, the center server 2 may be configured by a single server unit. Alternatively, the center server 2 may be logically configured using cloud computing.

  The game machine 3 is configured as a commercial (business) game machine that allows a user to play a game within a range corresponding to the play fee in exchange for payment of a predetermined play fee. This type of game machine 3 may be called an arcade game machine. The game machine 3 is a computer device installed in a predetermined facility such as the store 6 for the purpose of increasing the profit by repeatedly playing a game with a large number of users. One or more appropriate number of game machines 3 are installed in the store 6. In FIG. 1, the game machine 3 is drawn without distinction, but the hardware configuration and game content may be appropriately selected. The game machine 3 may be configured as a dedicated machine having a physical configuration (for example, an operation unit) suitable for a specific game, or may be configured as a general-purpose machine that can handle various games by rewriting software. May be.

  On the other hand, the user terminal device 4 is a computer device that can be connected to a network and is used for a user's personal use. For example, a stationary or book-type personal computer (hereinafter referred to as a PC) 4a or a mobile terminal device 4b such as a mobile phone (including a smartphone) is used as the user terminal device 4. In addition, various computer devices that can be connected to the network and are used for personal use of the user, such as stationary home game machines, portable game machines, and portable tablet terminal devices, are used as the user terminal device 4. It's okay. The user terminal device 4 can allow the user to enjoy various services provided by the center server 2 by installing various computer software.

  The network 5 may be appropriately configured as long as the game machine 3 and the user terminal device 4 can be connected to the center server 2 respectively. As an example, the network 5 is configured to realize network communication using a TCP / IP protocol. Typically, it is constructed by connecting the Internet 5A as a WAN and LANs 5B and 5C that connect the Internet 5A to the center server 2 and the game machine 3 via the router 5D. The user terminal device 4 is also connected to the Internet 5A with an appropriate configuration. Note that a local server may be installed between the game machine 3 and the router 5D of the store 6, and the game machine 3 may be communicably connected to the center server 2 via the local server. The server units 2A, 2B,... Of the center server 2 may be connected to each other by the WAN 5A instead of or in addition to the LAN 5C.

  Next, the features of the game in the game system 1 will be described with reference to FIG. First, each game machine 3 of the game system 1 can play a network battle type game in which a plurality of users participate and battle each other. In FIG. 2, the case where the user X plays a battle game over a plurality of times is shown as an example. Each battle game is advanced according to the procedure of steps S1 to S5 shown in the figure. If the Nth battle game is described as an example, first, a process of matching the user X with another user is performed (step S1). For example, it is assumed that the user X is matched with the users A, B, C... O in the Nth battle game, and 16 users including the user X play the same battle game. When the matching is established, a rival user is set for the user X among the matched users A to O (step S2). The rival is selected with reference to the battle history information 52 stored in the play data 51 of the user X. The play data 51 is data in which game play contents are stored in order for the user to continue playing the game. The battle history information 52 is information obtained by recording the contents of past battle games played by the user for each battle. For example, information for determining the details of a match, such as the opponent user, in other words, the matched user, the match date, the match time, and the match result (win / loss, ranking, etc.) is recorded in the match history information 52 for each match. Accumulated. In the battle history information 52, the content of past battles may be recorded without limitation, or the content thereof may be recorded only for battles in a past fixed period.

  In the rival setting, the battle history information 52 is referred to, and the number of battles for each of the matched users A to O is determined as an index value. Then, a user whose number of battles exceeds a predetermined reference number is set as a rival. In the example of FIG. 2, since the number of battles with the user C exceeds the reference number, the user C is set as a user X rival. However, the rival is not limited to one user, and a plurality of users may be set as rivals in one battle game. When the number of users exceeding the reference number exceeds the upper limit value, the reference number may be increased so that the number of rivals falls within the upper limit value. On the other hand, when there is no user exceeding the reference number, at least one user may be set as a rival by decreasing the reference number.

  When the rival is set, the battle game is executed (step S3). When the battle game is over, processing corresponding to the game result is performed such as updating the user level and the parameter group of the user item, character, etc. recorded in the user play data 51 according to the game result (step S4). . In this case, when the user wins the rival user, a bonus, a reward, or the like may be given to the user. Thereafter, the content of the current battle game is recorded in the battle history information 52.

  As described above, in the game system 1, every time a user plays a battle game, the content is recorded in the battle history information 52, and the number of battles determined from the battle history information 52 is greater than or equal to a predetermined reference number. Is set as a rival. In short, a user with a large number of battles is a user who has a relatively high probability of being matched. Therefore, if a user who has a relatively large number of battles in the past is set as a rival, as a result, a battle opportunity with a rival user increases. Accordingly, the user is motivated to win a rival that frequently competes, and the user's motivation for game play can be maintained and improved.

  Note that the index value to be specified from the battle history information 52 in order to set a rival is not limited to the number of battles in the above example. In short, an index value that correlates with the possibility of being selected as a matching partner is determined from the battle history information 52, the index value is compared with a reference value, and a user exceeding the reference value is set as a rival. . For example, instead of or in addition to the number of battles, the accumulated value of the battle time, the battle frequency, the number of times the user lost, and the frequency of the user losing are determined from the battle history information 52 as index values, and these index values are predetermined. Users who exceed the reference value may be set as rivals. The battle frequency is the number of battles played within a reference time (for example, a period having a moderate length such as one month), or a battle is played while the user plays a battle game for a reference number of times (for example, a moderate number of times such as 100). It can be calculated as the number of times. Further, the losing frequency can be obtained as the number of times of losing within the reference time or the number of times of losing while the user plays the battle game for the reference number of times. Even when rivals are set according to these index values, it is possible to set users with relatively many battle opportunities as rivals. When the number of losses or the frequency of losing is referred to, an opponent who has relatively many battle opportunities and cannot win can be set as a rival. Thereby, it is possible to cause the user to have a stronger desire to win the rival. Alternatively, when using the number of battles or the battle frequency as an index value, assuming that they are users exceeding a certain reference value, the ratio between the number of wins and loses against that user, or the frequency of winning and losing And a user whose ratio is within a predetermined range across 50% may be set as a rival. In this case, it is possible to set other users who are relatively likely to be matched and have similar wins and losses as rivals. In any case, since the battle history of each user is recorded in the battle history information 52 including the opponent's information, the match history information 52 is referenced to match each user. By discriminating other users who have a relatively high possibility and setting the user as a rival, it is possible to increase the opportunity to compete with the rival.

  In the example of FIG. 2, every time a battle game is played, a rival is set by the matching partner user at that time, but the rival setting may be performed every time the battle game is repeated a predetermined number of times. . In other words, a user who has a relatively high number of battles in the past is selected as a rival by one rival setting, so there is a relatively high possibility that the rival user once set will be matched again thereafter . Therefore, it is possible to increase the number of rivalry opportunities even if the rival setting is not executed for each battle game but is re-executed after a certain period of time to review the rival setting. .

  Next, with reference to FIG. 3, the structure of the principal part of the control system of the game system 1 related to the setting of rivals will be described. First, the center server 2 is provided with a game service management unit 21, a Web service management unit 22, and a storage unit 23. The management units 21 and 22 are logical devices realized by a combination of computer hardware (including a CPU and a memory as an internal storage device necessary for its operation) of the center server 2 and software. The storage unit 23 is an external storage device realized by a storage unit including a nonvolatile storage medium (computer-readable storage medium) such as a hard disk array. The memory | storage part 23 may be comprised so that all the data may be hold | maintained on one memory | storage unit, and may be comprised so that data may be distributed and memorize | stored in a some memory | storage unit. The storage unit 23 records a computer program PG1 as software for causing the computer hardware resources of the center server 2 to function as the management units 21 and 22. Various data are also recorded in the storage unit 23, but the play data 51 described above is shown in FIG. The play data 51 is created for each user and is recorded in the storage unit 23 in association with the user identification information. However, FIG. 3 shows only the play data 51 associated with one user identification information.

  The game service management unit 21 provides a predetermined game service to the game machine 3. As a game service, for example, user authentication information (for example, user identification information and password) is received from the game machine 3 to authenticate the user, and play data 51 corresponding to the user is received from the game machine 3 and stored therein. 23, or a service for providing the game machine 3 with user play data 51 stored in the storage unit 23, and software of the game machine 3 (computer program PG2 and various data for the game machine 3) are networked. There is a service etc. that is updated through 5. The game service management unit 21 is further provided with a play data management unit 24 and a battle processing unit 25 as logical devices. The play data management unit 24 stores the play data 51 in the storage unit 23 in response to a request from the game machine 3 and provides the play data 51 to the game machine 3. The battle processing unit 25 is in charge of processing for matching users who want to play, processing for setting rivals, and the like. The battle processing unit 25 functions as a matching unit of the present invention by processing matching. The procedure of the matching process may be the same as that of a well-known game system, and the details thereof are omitted. The procedure of rival setting processing will be described later.

  The web service management unit 22 provides various web services to the user terminal device 4. As an example, the Web service management unit 22 receives user authentication information (for example, unique identification information and password for each user) from the user terminal device 4, authenticates the user, and responds to the authenticated user request. Thus, the play data 51 of the user is provided to the user terminal device 4 as browsing data. Note that the web service management unit 22 may be appropriately provided with a function of providing a community service that provides an exchange place such as information transmission, exchange, and sharing using the user terminal device 4. Those explanations are omitted.

  Further, the center server 2 charges a charge as a consideration for providing a paid service on the game to each user of the game machine 3 and the user terminal device 4 and collects the charge from the user. Has also been implemented. As a specific method of payment, the user pays for the service by using electronic payment, such as a credit card, debit card, or electronic currency, which can be paid for using electronic data exchange, Anything that collects the price commensurate with the price. The electronic payment may be a publicly known one, and a description of a specific configuration and procedure for realizing it is omitted.

  Next, the game machine 3 is provided with a game control unit 31 and a storage unit 32. The game control unit 31 is a logical device realized by a combination of hardware of the game machine 3 (including a CPU and a memory as an internal storage device thereof) and a computer program PG2 as software. The game control unit 31 executes various arithmetic controls necessary for the progress of the game, and executes various processes necessary for enjoying the game service provided by the game service management unit 21 of the center server 2. The game control unit 31 is provided with a battle processing unit 33 as a further logical device. The battle processing unit 33 cooperates with the battle processing unit 25 of the center server 2 to execute processing necessary for causing the user of the game machine 3 to play the battle game.

  The storage unit 32 is an external storage device realized by a storage unit including a non-volatile storage medium (computer-readable storage medium) such as a hard disk or a semiconductor storage device. Various data are recorded in the storage unit 32 together with the above-described program PG2. In FIG. 3, play data 51 provided from the center server 2 is shown. The play data 51 includes the battle history information 52 as described above.

  The game machine 3 is provided with various input / output devices such as an input device 36 that outputs a signal corresponding to a user operation, a display device 37 for presenting a game screen to the user, and a card reader 38. The card reader 38 is a device for reading a unique card ID for each card recorded on a card 39 possessed by the user as a kind of identification information to be used for user authentication. Note that user identification information to be used for user authentication may be different between user authentication in the game machine 3 and user authentication in the user terminal device 4, or may be common. For example, in the game machine 3, the card ID recorded on the user's card 39 is used as identification information, and the card ID and the play data 51 are associated with each other and stored in the storage unit 23. When using a user ID uniquely set for each user as user identification information, by setting a correspondence between the user ID and the card ID, any ID is also used as the user identification information. be able to. Further, by associating the card ID with the user ID, the user and the play data 51 can be specified regardless of the card ID or the user ID.

  The user terminal device 4 is provided with a Web service processing unit 41 as a logical device realized by a combination of the computer hardware (including a CPU and a memory as an internal storage device) and software. . The web service processing unit 41 executes processes necessary for receiving various services provided by the web service management unit 22 of the center server 2. The user terminal device 4 is also provided with an external storage device for storing appropriate data, but the illustration thereof is omitted.

  Next, a procedure for rival setting processing will be described with reference to FIG. The process in FIG. 4 is a process corresponding to the procedure in step S2 in FIG. 2, and is a process after the user is authenticated by the center server 2 and matching is established. The process of FIG. 4 can be executed by either the battle processing unit 25 of the center server 2 or the battle processing unit 33 of the game machine 3. Here, description will be made assuming that the battle processing unit 25 of the center server 2 functions as the rival setting means of the present invention by executing the processing of FIG. Note that the processing of FIG. 4 performed by the battle processing unit 25 of the center server 2 is performed individually for each of the matched users. The rival setting state as the execution result is notified to at least the game machine 3 of the user for which the rival relationship is set. In the process of FIG. 4, rivals are selected based on the number of battles.

  When the rival setting unit 25 starts the rival setting process in FIG. 4, the battle processing unit 25 first refers to the battle history information 52 of the user play data 51 and determines the number of battles for each matched opponent user (step S <b> 11). Next, the battle processing unit 25 extracts users whose number of battles exceeds the reference number based on the determination result of step S11 (step S12), and then determines whether one or more users have been extracted (step S12). Step S13). If no one has been extracted, the battle processing unit 25 proceeds to step S14, and determines whether or not the reference count is set to a predetermined lower limit. If the lower limit is not set, the battle processing unit 25 decreases the reference number by a predetermined amount α (step S15), and then returns to step S12. This process is a process for finding a rival by reducing the reference count when a rival user is not found.

  When it is determined in step S13 that one or more users are extracted, the battle processing unit 25 determines whether or not the number of extracted users is within the upper limit (step S16). If the upper limit is exceeded, the battle processing unit 25 proceeds to step S17 and increases the reference number by a predetermined amount β (step S17). The predetermined amount β may be the same as or different from the predetermined amount α. This process is a process for narrowing down the number of users when the number of users exceeding the reference number is too large.

  After the reference number increases, the battle processing unit 25 again extracts users exceeding the reference number (step S18), and then returns to step S16. When it is determined in step S16 that the number of users is within the upper limit, the battle processing unit 25 proceeds to step S20 and sets the user extracted at that time as a rival. Thereafter, the battle processing unit 25 ends the process of FIG. If the reference number has decreased to the lower limit in step S14, the process proceeds to step S20 without further decreasing the reference number. In this case, step S20 is processed on the assumption that there are no users set as rivals, that is, there are no users who can be set as rivals. Further, even if the process returns to step S16 via steps S17 and S18 and step S16 is determined affirmatively, there may be zero users exceeding the reference count. Also in this case, priority is given to limiting the number of rivals within the upper limit value, and step S20 is processed assuming that there is no user who can be set as a rival.

  In the above processing, the battle processing unit 25 of the center server 2 is caused to execute the processing of FIG. 4 so that the battle processing unit 25 functions as the rival setting means of the present invention. By executing the processing of FIG. 4 in the battle processing unit 33, the battle processing unit 33 may function as a rival setting unit. In addition, by selecting one game machine 3 as the execution subject of the rival setting process from the game machines 3 of the plurality of matched users, and collecting the match history information 52 of each user matched with the game machine 3, It is also possible to cause the battle processing unit 33 of the game machine 3 to execute rival setting processing for all matched users.

  Also, the battle history recording means of the present invention can be realized by causing the battle processing unit 33 of each game machine 3 to execute the process of step S5 in FIG. 2 at the end of the battle game. That is, the game processing unit 33 of each game machine 3 records the content of the game of the user of the game machine 3 in the game history information 52 of the play data 51 held in the storage unit 32 of the game machine 3. The battle processing unit 33 can function as the battle history recording means of the present invention. The play data 51 stored in the storage unit 32 of the game machine 3 is transmitted from the game machine 3 to the center server 2 at an appropriate time, for example, when the play of the battle game is completed, and the play data management unit 24 Is stored in the storage unit 23. Therefore, the battle history information 52 stored in the storage unit 32 of the game machine 3 and the battle history information 52 stored in the storage unit 23 of the center server 2 are equivalent when the match processing unit 25 establishes matching. Therefore, when the rival setting process is performed, the battle history information 52 existing in any of the storage units 23 and 32 may be referred to.

  In the present invention, the rival relationship does not necessarily need to be a bidirectional relationship between users. For example, even if one user is set as a rival for one user or one user is not set as a rival for the other user, there is a rival between those users. It can be considered that a relationship (however, a unilateral relationship) is established. For example, if rivals are set based on the number of battles and the frequency of battles, a bi-directional rival relationship can be essentially set. However, when setting a rival based on the number of times lost and the frequency of loss, a one-sided rivalry relationship is set. Alternatively, as shown in FIG. 4, when one or more rivals are secured or the reference value is changed for each user so as to keep the number of rivals within the upper limit, a one-sided rivalry relationship can occur. The rival relationship of the present invention does not exclude this unilateral relationship. However, in the above-mentioned form, the other user is selected as a rival in the rival setting process for one user, and the other user is selected as a rival in the rival setting process for another user. As a condition, if a rival relationship is set between both users, establishment of a two-way rival relationship can be ensured.

  In the present invention, the user is not necessarily limited to a real user. There may be a user who is virtually generated by a computer mixed with a real user, and the virtual user may be included in the target set as a rival. Further, the present invention can be applied to a so-called asynchronous battle game in which a computer is a main player using play data 51 of the actual user even if the user to be matched is an actual user. Is applicable. In the present invention, the concept of “match” is not limited to a form in which a plurality of users simultaneously act and compete in a common game space. Even a form in which each of the matched users plays a game and the users compete for the score or the like obtained as a result of the play is included in the concept of “match” of the present invention.

  The rival setting means according to the present invention does not exclude conventional rival settings in which the user himself / herself sets rivals or the computer automatically sets rivals of similar levels as rivals. The rival setting means by and the rival setting means according to the present invention may be used in combination. In addition, the present invention is not limited to an example in which a rival user is selected from matched users when matching is established. By referring to the user's battle history information, it is possible to identify other users who are highly likely to be matched with each other. Therefore, the rival setting of the present invention is not limited to when matching is established, but at any time. A rival may be set by the means. Therefore, when the rival setting is instructed to the center server 2 from the user terminal device 4 of FIG. 1, the battle processing unit 25 of the center server 2 sets a rival with reference to the battle history information 52 of the user. Deformation is possible.

  In the present invention, the game machine is not limited to a commercial game machine, and any game machine that can be connected to a network may be used as appropriate. The game machine is not limited to an example in which an input / output function for a user and various arithmetic processing functions necessary for game control are integrated in a computer device as a single physical device. For example, a game device performs arithmetic control on a server device, and a network terminal device for the server device is used as a remote operation terminal device that should have an input / output function. The present invention can be applied even to a configuration that functions as a simple game machine. Therefore, each means of the present invention is not limited to an example realized by a single computer apparatus, and each means may be realized by appropriately cooperating a plurality of computer apparatuses. Or when making a network terminal device function as a remote control terminal device, all the means may be implement | achieved by the server apparatus.

DESCRIPTION OF SYMBOLS 1 Game system 2 Center server 21 Game service management part 22 Web service management part 24 Play data management part 25 Competition processing part (matching means, rival setting means)
3 game machines 33 battle processing unit (rival setting means, battle history storage means)
4 User terminal device 5 Network 51 Play data 52 Battle history information

Claims (6)

Matching means for matching a plurality of users to be competition in the game, and a rival setting means for setting a rival relationship between the user, the relationship of the competitor that is set, the the definitive control of the game It is a game system that is reflected in the grant of benefits to the user or reflected in the rival notification ,
Each time a user battles in the game, the game further comprises battle history recording means for recording the content of the battle in the battle history information so that at least information for identifying the opponent user is included.
The rival setting means refers to the battle history information, and the battle frequency as an index value that correlates with the possibility of being selected as a matched opponent is recorded as the opponent in the battle history information. determined for the user, by compared with a reference value match the frequency of the resultant index value extracts the user more than the reference value, identify other users relatively high possibility of being the user matched And setting a rival relationship for the identified user.   The game system according to claim 1, wherein the rival setting unit sets the rival relationship between users matched by the matching unit.   The rival setting means sets, as a rival, a user whose ratio exceeds the reference value and the ratio between the number of wins and loses or the ratio between the frequency of winning and losing is within a predetermined range with 50% between them. The game system according to claim 2. The games system according to any one of claims 1 to 3 , wherein the rival setting unit controls the reference value so that the number of users as the rival falls within a predetermined range. It includes a matching means for matching a plurality of users to be competition in the game, the relationship of the set rival between the user, are reflected in the application of privilege for the user to definitive control of the game, or the rivalry A rival setting control method that is applied to a game system reflected in a notification and sets the rival relationship between the users,
Each time each user battles in the game, the content of the battle is recorded in the battle history information so that at least information for identifying the opponent user is included,
With reference to the battle history information, the battle frequency as an index value correlating with the likelihood of being selected as a matching opponent is obtained and obtained for the user recorded as the opponent in the battle history information. By comparing the battle frequency as the index value with the reference value and extracting users exceeding the reference value, other users who are relatively likely to be matched with the user are identified, and the identified users are identified. A rival setting control method for a game system, comprising: a procedure for setting a rival relationship for a user. It includes a matching means for matching a plurality of users to be competition in the game, the relationship of the set rival between the user, are reflected in the application of privilege for the user to definitive control of the game, or the rivalry Applied to the game system reflected in the notification, at least one computer included in the game system,
Rival setting means for setting the rival relationship between the users, and each time each user battles in the game, the content of the battle includes at least information for identifying the opponent user, It functions as a battle history recording means for recording in the battle history information,
The rival setting means refers to the battle history information, and the battle frequency as an index value that correlates with the possibility of being selected as a matched opponent is recorded as the opponent in the battle history information. determined for the user, by compared with a reference value match the frequency of the resultant index value extracts the user more than the reference value, identify other users relatively high possibility of being the user matched And a game system computer program configured to set the rival relationship for the identified user.

Images