JP6541951B2 - Program and server system - Google Patents

Description

  The present invention relates to a program for causing a computer to execute a competitive game.

  One of the game genres is a battle game in which a group formed of a plurality of objects and another group are made to match each other in accordance with the user's organizing operation. A tactical game or a game called a strategic game is a good example. In addition, in RPG (role playing game) and the like, there are cases where it is adopted as an in-game battle system.

  And what is often seen by control of a competitive game is a form in which a computer automatically controls a group. Automatic control is also called AI control. A single algorithm for automatically controlling a group makes it possible for people to be aware of the behavior pattern of the other group while playing several times, and so it is upset in recent years. Devices are elaborated.

  For example, in Patent Document 1, a special area is set in a map, and a technology for changing the attack behavior of a character that is automatically controlled inside and outside the special area is disclosed.

JP 2014-46198 A

  The present invention has been conceived for the purpose of providing a new technology that brings about diversity in the behavior of automatically controlled groups in the background described above.

A first invention for solving the above-mentioned problems is a program for causing a computer to execute a battle game in which a group formed by a plurality of objects is made to play against an enemy object in accordance with a user's formation operation,
Behavior algorithm setting means (for example, server processing unit 200s of FIG. 11, game management unit 210, adaptation behavior algorithm selection unit) which sets the behavior algorithm to be executed by the group among the plurality of behavior algorithms according to the organization of the group 214, group formation data 630 of FIG. 16, matching behavior algorithm name 635, step S42) of FIG.
Parameters related to the behavioral algorithm set by the behavioral algorithm setting means (for example, algorithm rank 633 in FIG. 16, success probability of attack, avoidance probability of enemy attack in FIG. 8 (2), confidence of FIG. 8 (3) Parameter setting means (for example, the server processing unit 200s of FIG. 11, the game management unit 210, the algorithm rank setting unit 233, step S28 of FIG. 20) for setting the appearance rate of one strike based on the formation of the group
Automatic control means (for example, the server processing unit 200s of FIG. 11, game, etc. shown in FIG. 11, which automatically controls the action of the group according to the action algorithm set by the action algorithm setting means using the parameters set by the parameter setting means A program for causing the computer to function as a management unit 210, an automatic control unit 250, and steps S78 and S80) in FIG.

The organization of a group is to define the composition of the group such as the number of objects constituting the group, the types of objects constituting, the number of components by type, and the arrangement positional relationship of objects.
The diversity of organization of a group depends on the specification of the group (for example, the maximum number of object configurations, the position / range where objects can be placed, the number of sub-groups included, etc.). Diversify the types of groups to be organized.

  And according to 1st invention, the action algorithm according to organization of a group is selected, and also the parameter which concerns on the said action algorithm is set. Furthermore, when automatically controlling the group, control is performed using the selected behavioral algorithm and the value of the set parameter. That is, depending on what kind of group the player organizes, the behavior in automatically controlling the group can be determined, and the behavior of the group can be provided with unprecedented diversity.

  In the second invention, in the behavior algorithm, one behavior algorithm includes a plurality of behavior patterns (for example, a movement target position selection method 563 in FIG. 15 and an attack target selection method 564), and the formation of the group The automatic control is performed by causing the computer to further function as action pattern selection means (for example, action pattern selection unit 251 in FIG. 11, appearance rate 565 in FIG. 15, step S110 in FIG. The means is a program according to the first invention, which automatically controls the group according to the action pattern selected by the action pattern selection means.

  According to the second invention, a plurality of behavior patterns included in one behavior algorithm are selected and applied based on the formation of a group targeted for automatic control. Therefore, the behavior of the group by the automatic control (specifically, the action of each object constituting the group) reflects the characteristics of the composition of the group, and while the diversity is increased, the human being is It is possible to give the player a feeling as if operating.

  According to a third aspect of the present invention, the object has compatibility with each other according to the attribute of the object (e.g., the relationship between the three habits in FIG. 4), and the action pattern selection means configures the group Selection probability according to the compatibility between the object and the enemy object (for example, the appearance probability 565 of “free selection from among customers” in FIG. 15 (2), “unfavorable partner”) It is a program of the 2nd described selected using the appearance probability 565 of "optionally selected from".

  According to the third invention, it is possible to realize control as if acting in consideration of affinity with the enemy. As the diversity increases, it is possible to give the player a feeling as if it is being operated by a human while being automatic control.

  A fourth aspect of the invention is a property determination unit (for example, the server processing unit in FIG. 11) that determines the property of the group (for example, the first requirement or the second requirement in the selection condition 542 in FIG. 6) based on the organization of the group. The computer further functions as a game management unit 210, a group property determination unit 231, and step S24 in FIG. 20), and the action algorithm selection unit selects an action algorithm according to the property of the group. A program according to any one of the third inventions.

According to the fourth invention, it is possible to select a behavioral algorithm to be applied to the group in accordance with the nature of the group, in other words, the characteristics of the group estimated from the composition of the group.
Therefore, for example, it is possible to automatically control a group which is composed of objects having a long range attack and which does not have a melee attack ability to take a long range attack instead of making a quick action such as a melee attack. The behavior of a group becomes natural corresponding to the nature of the group.

  In a fifth aspect of the invention, the action controlled by the automatic control means includes attack and / or defense, and the parameter setting means has an execution success probability of the action controlled by the automatic control means (for example, Probability setting means (for example, the action success probability setting unit 235 of FIG. 11, S 120 of FIG. 22) which sets “successful probability of attack” and “avoidance probability of enemy attack” of FIG. 8 (2) based on formation of the group. It is a program of any of the 1st-4th invention which has -S122).

  According to the fifth invention, the execution success probability of the action by the automatic control can be set based on the formation of the group. Thus, diversity can be further enhanced. In addition, the quality of organization can be easily reflected in the match result.

  A sixth invention causes the computer to further function as property determination means for determining the property of the group based on the formation of the group, and the probability setting means sets the execution success probability based on the property of the group It is a program of the 5th invention.

  Furthermore, according to the sixth invention, the execution success probability of the action by the automatic control can be set based on the property of the group. Thus, diversity can be further enhanced. In addition, the quality of organization can be easily reflected in the match result.

  In the seventh invention, the property determining means determines the similarity of the objects (for example, x1, x2, x3 in FIG. 8A) constituting the group into the property, and the probability setting means The program according to the sixth aspect of the invention is a program according to a sixth aspect of the invention, wherein the execution success probability is set to be higher as it is determined that the similarity determined by the property determining unit is higher (for example, FIGS.

  According to the seventh invention, since the execution success probability can be further set in accordance with the similarity of the objects constituting the group, the diversity can be further enhanced, and the quality of organization can be easily reflected in the match result.

  In an eighth aspect according to the present invention, the automatic control means uses the execution success probability set by the probability setting means when the automatic control means controls the execution of the attack action, whether or not the attack damages the enemy object. (For example, step S130 in FIG. 22), the program of the seventh invention.

  According to the eighth invention, the goodness or badness of the formation of a group can be easily reflected in the result of the game.

  In a ninth aspect of the invention, the property determining unit determines the property of the group including the arrangement position of the objects constituting the group in the property determination criterion (for example, the second requirement in FIG. 6) fourth and It is a program of any one of the sixth to eighth inventions.

  According to the ninth aspect, the arrangement position of the objects constituting the group can be used to determine the property of the group. Therefore, in a game that deals with a group that acts in a formation like a front row, a middle row, and a rear row, it is possible to select a group behavior algorithm in consideration of which object is arranged and where.

  In a tenth aspect of the invention, the property determining unit determines the property of the group including the type, the attribute, and the level of each of the objects constituting the group in the property determination criteria (for example, 8 (1), the fourth and sixth to ninth aspects of the invention.

  According to the tenth invention, it is possible to select a group behavior algorithm in consideration of which object is placed where. Therefore, it is possible to increase the diversity of behavior by automatic control of the group. In addition, since the validity of the composition of the group and the selected behavioral algorithm is improved, it is easy to give an impression as if the user is operating the group to be automatically controlled.

  The eleventh invention is characterized in that the property judging means judges including the ability index value indicating the ability of the action (for example, the third requirement in FIG. 6, the algorithm rank 633 in FIG. 16) in the property of the group. And the program of any of the sixth to tenth inventions.

  According to the eleventh invention, it becomes possible to select an action algorithm according to the ability level of action as a group. There is a difference in the behavior of automatic control according to the ability as a group, and the diversity is further improved.

  A twelfth aspect of the present invention is the action algorithm notification control means for performing control to notify the user of the action algorithm selected by the action algorithm selection means (for example, the adaptive action algorithm display unit 53 of FIG. 9, advice of FIG. The first to eleventh inventions for causing the computer to further function as the display unit 74, the server processing unit 200s of FIG. 11, the game management unit 210, the action algorithm notification control unit 220, and step S202 of FIG. Is a program of

  According to the twelfth invention, the selected behavioral algorithm is notified to the user, which can help the user to evaluate the formation of his / her group. Therefore, it can be expected that the user desires to organize a stronger group, that is, an effect of enhancing the motivation for game play.

  A thirteenth invention is a battle condition statistics notification control means (for example, a war condition statistic value display unit 69 in FIG. 9) for performing control to notify the user of the war condition statistics associated with the behavior algorithm selected by the behavior algorithm selection means. 11, the server management unit 200s of FIG. 11, the game management unit 210, the battle status statistical unit 270, the battle status statistical value display control unit 272, step S200 of FIG. It is a program of another invention.

Battle statistics are statistics that describe actions during battle and results of battle. For example, it is possible to appropriately include a friend's shot ratio, the probability of attacking a compatible enemy, and the like.
According to the thirteenth aspect of the present invention, it is possible to provide information for knowing what kind of behavior the automatically controlled group has performed statistically and what kind of result it has become. Therefore, the organization organization of the user provides the user with the material to determine the desired result and whether the desired result is obtained, and the motivation for organizing the group matching the user's idea, that is, the game play. It can be expected to have the effect of enhancing motivation.

  A fourteenth invention is a server system for communicating with a user terminal and controlling execution of a battle game in which a group formed by a plurality of objects battles against an enemy object in accordance with a user's formation operation. Behavior algorithm setting means for setting a behavior algorithm to be executed by the group according to organization of the group among behavior algorithms, and parameters related to the behavior algorithm set by the behavior algorithm setting means are based on organization of the group And parameter control means for automatically controlling the action of the group according to the action algorithm set by the action algorithm setting means using the parameter set by the parameter setting means. Server system.

  According to the fourteenth invention, the same effect as that of the first invention can be obtained.

The figure which shows an example of a structure of a game system. FIG. 2 is a perspective external view showing a configuration example of a player terminal. The figure for demonstrating a game cycle. The figure which shows the example of the attribute provided to a character, and the example of correlation. The figure which shows the example of a game screen at the time of new group formation. The figure for demonstrating selection of an action algorithm. The figure which shows the explanation display example of an action algorithm. The figure for demonstrating the calculation method and effect of algorithm rank. The figure which shows the example of a display of the game screen in competition. The figure which shows the example of a screen which announces a battle result. FIG. 2 is a functional block diagram showing an example of a functional configuration of a server system according to the first embodiment. The figure which shows the example of the program and data which the server memory part in 1st Embodiment memorize | stores. The figure which shows the data structural example of character initialization data. The figure which shows the data structural example of action algorithm definition data. The figure which shows the data structural example of a probability setting table. Diagram showing an example of data configuration of user management data The figure which shows the data structural example of matching candidate registration data. The figure which shows the data structural example of play data. The flowchart for demonstrating the flow of the process which concerns from the game start to completion in a server system. The flowchart for demonstrating the flow of group formation processing. " The flowchart for demonstrating the flow of a battle | competition play process. The flowchart for demonstrating the flow of an automatic battle process. The flowchart continued from FIG. FIG. 10 is a functional block diagram showing an example of a functional configuration of a server system according to a second embodiment. FIG. 13 is a functional block diagram showing an example of a functional configuration of a player terminal in the second embodiment. The functional block diagram which shows the function structural example of the server system in a modification. The figure which shows the example of a game screen at the time of new group formation in a modification. The flowchart for demonstrating the flow of the battle | competition play process in a modification. The figure which shows the example of a game screen at the time of new group formation in a modification. The figure which shows the example of a game screen at the time of new group formation in a modification.

First Embodiment
As a first embodiment to which the present invention is applied, an online competition game will be described by way of example in which a player who is a user plays a group organized.

  FIG. 1 is a diagram showing an example of the configuration of a game system according to the present embodiment. The game system of the present embodiment includes a server system 1100 connectable to the communication line 9 and a player terminal 1500 capable of data communication with the server system 1100.

  The communication line 9 means a communication path capable of data communication. That is, the communication line 9 includes a communication line such as a telephone communication network, a cable network, and the Internet, in addition to a dedicated line (a dedicated cable) for direct connection and a LAN (Local Area Network) by Ethernet (registered trademark). It means, and it does not matter whether it is wired or wireless for the communication method.

  The server system 1100 includes, for example, a main device 1101, a keyboard 1106, a touch panel 1108, and a storage 1140. A control board 1150 is mounted on the main device 1101. The control board 1150 includes various microprocessors such as a central processing unit (CPU) 1151, a graphics processing unit (GPU), and a digital signal processor (DSP), various ICs such as an application specific integrated circuit (ASIC), VRAM, RAM, and ROM. A memory 1152 and a communication device 1153 are mounted.

  Then, the server system 1100 performs arithmetic processing on the control board 1150 based on predetermined programs and data, thereby 1) a user management function related to user registration and game card use registration, and 2) the player 2 is a player. A game management function of providing data necessary for game play on the terminal 1500, and 3) an online shopping function of selling contents such as available items in the game are realized. That is, the video game of this embodiment is realized as a kind of client server type online game.

  In the example of FIG. 1, although the server system 1100 is described as a single unit, a plurality of blade servers sharing the user management function, the online shopping function, and the game management function are mounted, and data is mutually exchanged via the internal bus. It may be configured to be communicably connected. Alternatively, a plurality of independent servers installed at remote locations may be configured to function as the server system 1100 as a whole by causing data communication via the communication line 9.

FIG. 2 is a front external view showing a configuration example of the player terminal 1500. As shown in FIG.
The player terminal 1500 is a computer that can connect to the communication line 9 to access the server system 1100, and is an electronic device (electronic device). The player terminal 1500 of this embodiment is a device classified as a so-called smart phone, but a portable game device, a stationary home game device, a game controller of a stationary home game device, a business game device, a personal computer, a tablet type It may be a device classified as a computer, a wearable computer or the like.

  The player terminal 1500 in this embodiment includes a direction input key 1502, a button switch 1504, a touch panel 1506 functioning as an image display device and a contact position input device, a speaker 1510, a built-in battery 1509, a microphone 1512, an image sensor A unit 1520, a control board 1550, and a memory card reader 1542 capable of reading and writing data from a memory card 1540 which is a computer readable storage medium. In addition, a power button, a volume control button, and the like not shown are provided. In addition, an IC card reader capable of reading and writing data without contact with an IC card credit card or a prepaid card may be provided.

  The control board 1550 performs wireless communication with the CPU 1551, various microprocessors such as GPUs and DSPs, various IC memories 1552 such as VRAMs, RAMs and ROMs, and mobile phone base stations and wireless LAN base stations connected to the communication line 9. Wireless communication module 1553 is mounted. In addition, a driver circuit of the touch panel 1506, a circuit for receiving signals from the direction input key 1502 and the button switch 1504, an output amplifier circuit for outputting an audio signal to the speaker 1510, and an input signal for generating an audio signal collected by the microphone 1512 A so-called I / F circuit 1557 (interface circuit) such as a generation circuit, an input of image data photographed and generated by the image sensor unit 1520, a signal input / output circuit to the memory card reader 1542, and the like are mounted. The elements mounted on the control board 1550 are electrically connected to one another via a bus circuit or the like, and are connected so as to be able to read and write data and transmit and receive signals. Note that part or all of the control substrate 1550 may be configured by an ASIC or an FPGA.

  The control board 1550 temporarily stores programs and data for realizing game play on the player terminal 1500 in the IC memory 1552. Then, the program is executed to execute arithmetic processing, and each part of the player terminal 1500 is controlled according to the operation input from the direction input key 1502, the button switch 1504, and the touch panel 1506 to enable game play. In the present embodiment, the player terminal 1500 is configured to acquire necessary programs and various setting data from the server system 1100. However, the player terminal 1500 may be configured to read out from a storage medium such as a memory card 1540 acquired separately.

  Returning to FIG. 1, the player 2 needs to obtain the game card 3 as preparation for playing the game of this embodiment. Also, a user registration procedure is performed to acquire a user ID (account). Then, the card registration procedure for making the obtained game card 3 usable (enabled) in the game is performed, and the activated game card 3 is used (more specifically, data linked to the game card 3: specific) The game is played using characters, etc.).

  User registration is realized by accessing a website provided by the server system 1100 and performing predetermined procedures. When the user is registered, a user ID (account: ID unique to the player) is issued. Thereafter, the player 2 accesses the website and logs in with the issued user ID, thereby enabling card registration procedures and game start operations.

The game card 3 is an element necessary to play the game in the present embodiment, that is, a game play element and constitutes a part of the game content.
The game card 3 may be a card having an entity (a so-called "trading card"), or may be a virtual card of electronic information only having no entity. In the case of a card having an entity, for example, a predetermined number (for example, two or five) may be sold as one package in an actual store. When a virtual card is used, a predetermined number is given by lottery each time the user logs in or exercises a separately acquired lottery right, or an online shopping site realized by the server system 1100 or a known online shopping site. It is preferable to be able to purchase on an online shopping site. The form of the game play element is not limited to the card, and can be set as appropriate. For example, it may be a three-dimensional object imitating the appearance of a character, an item or the like. In that case, it is more preferable to adopt a form having properties as a collection item as well as game play including size and design.

  In the present embodiment, one character 4 is assigned to one game card 3. Although there are a plurality of game cards 3 to which the same character 4 is assigned, the game cards 3 are individually different. Therefore, a unique card ID is given to each game card 3, and the card ID is printed or displayed by a bar code 5 or the like.

  When user registration is performed, user management data 600 linked to the user ID is created in the server system 1100 (for example, the storage 1140). Then, when the player 2 declares the card ID of the game card 3 and performs a card registration procedure, the newly registered game card 3 is registered in the valid card list 604 of the user management data 600. As a result, the character 4 of the newly registered game card 3 becomes available in the game.

  In the card registration procedure, the card ID printed on the game card 3 may be input using a keyboard or the like, or the card ID is read by photographing the bar code 5 with the image sensor unit 1520 of the player terminal 1500. It is good also as composition.

[Description of game content]
FIG. 3 is a diagram for explaining the game cycle of the present embodiment.
The game according to the present embodiment is a battle game in which a group formed of a plurality of objects and another group are played against each other according to the user's formation operation.
As shown in FIG. 3 (1), first, the player 2 organizes the group 6 with the character 4 tied to the registered game card 3 as a configuration object, and registers the organized group 6 as a matching candidate It starts. At this time, an action algorithm to be applied when automatically controlling the group is set based on the type and the number of the characters 4 constituting the group 6, the arrangement positional relationship, and the like. Details of the action algorithm and its setting will be described later.

  As shown in FIG. 3 (2), the player 2 selects one of the groups 6 created by the player 2 as one's own army, and selects one of the groups 6 b of the other players 2 b registered as matching candidates and selects an enemy army. Play a match game as. At this time, with regard to the group 6 of its own army, it is possible for the player 2 itself to select operation control to control an action or automatic control using an action algorithm set at the time of group formation. The enemy group 6b is automatically controlled based on an action algorithm. That is, the computer operates. At this time, the player 2 is notified of the set behavior algorithm for the side that is automatically controlled.

  As shown in FIG. 3 (3), when the battle play is over, it becomes an announcement of the outcome and the outcome of the battle. The experience value is added to the characters 4 of the groups 6, 6b who participated according to the battle record. That is, the character 4, that is, the groups 6, 6b is grown and strengthened by passing the battle. Focusing on the group 6b, it is possible for the other player 2b that created the group to be able to grow without being used and grown.

  Since the announcement of the match play and the result of the victory and defeat include the notification of the action algorithm applied to the automatic control, the player 2 may construct a stronger group in consideration of the result of the defeat and the results of the battle and the applied action algorithm. Group formation can be strengthened. That is, in the game of the present embodiment, it is motive and attractive to compete for the group formed by oneself to compete to form a group stronger than anyone.

  Now, as shown in FIG. 4, three types of "attributes" of "proximity attack type", "medium distance attack type", and "long distance attack type" are different in advance for characters 4 for forming a group, as shown in FIG. It is prepared, and any attribute is assigned to each. In these three types of attributes, the relationship between the pros and cons at the time of the match constitutes the so-called "Misumi". The player 2 will organize a group in consideration of the relationship of Sansho.

FIG. 5 is a view showing an example of a game screen at the time of new group formation.
The formation of the group 6 is performed by selecting and arranging the characters 4 in a predetermined arrangement frame 12.
In this embodiment, as the arrangement frame 12 in which a group can be arranged, a rectangular arrangement frame 12 in which only one character 4 can be arranged (in FIG. It will be done. The shape of the arrangement frame 12 may be another polygon (for example, a triangle or a hexagon), and the number of vertical and horizontal sides of the arrangement frame 12 can also be set as appropriate.

  When a group 6 is newly formed, the arrangement frame 12 is displayed on the group organization screen W4, and the character list display unit 14 for the characters 4 already enabled by the player 2 is displayed so as to be scrollable. . The player 2 points the character icon 16 from the column of the desired character 4 in the character list display unit 14 toward the empty arrangement frame 12 and performs drag and drop operation to determine the arrangement. Incidentally, if the character icon 16 displayed in the arrangement frame 12 is dragged and dropped out of the frame, the arrangement can be canceled.

  When the character 4 is placed, the composition of the group 6 at that time changes. Then, the behavior algorithm is automatically selected according to the changed configuration, and the algorithm rank to be applied to the selected behavior algorithm is automatically determined.

  In the present embodiment, a behavior algorithm in which the configuration of the current group 6 matches the selection condition is selected and displayed on the adaptive behavior algorithm display unit 20 in a selectable manner, and selection is made by slightly changing the configuration of the current group 6 Another behavioral algorithm that satisfies the condition can be displayed on the semi-adapted behavioral algorithm display unit 22. In the present embodiment, if there are a plurality of action algorithms that match the selection condition, for example, a randomly selected action algorithm is selected as the action algorithm to be actually applied. The configuration may be determined by the operation.

  The other operation input icons such as the selection operation input of the action algorithm and the formation confirmation operation input may be appropriately set in the range displayed when the group formation screen W4 is scrolled upward on the screen.

FIG. 6 is a diagram for explaining the selection of the behavioral algorithm, and is a diagram showing an example of the data configuration of the behavioral algorithm selection table 540.
The server system 1100 stores in advance a behavior algorithm selection table 540 in which the selection condition 542 and the behavior algorithm name 544 are associated. Specifically, the selection condition 542 of the behavioral algorithm in the present embodiment is configured by a combination of a plurality of requirements in the first requirement, the second requirement, and so on in which the property of the group 6 is described. And one action algorithm name 544 is assigned to one combination.

  The behavioral algorithm name 544 associated with the selection condition 542 in which all the requirements are satisfied is taken as the “conforming behavioral algorithm”. Each of the requirements of the selection condition 542 is assigned a determination priority, and among the requirements lower than the priority, a behavioral algorithm corresponding to the selection condition 542 is not satisfied only a predetermined number (for example, one or two) It is said to be a "semi-matching behavior algorithm".

  Referring back to FIG. 5, the matching behavior algorithm and the near matching behavior algorithm selected from time to time are displayed on the matching behavior algorithm display unit 20 and the near matching behavior algorithm display unit 22, respectively. These displays also serve as icons for detailed display operation input, and when a touch operation is detected, an explanatory display of the action algorithm is popped up.

FIG. 7 is a diagram showing an example of description display of the action algorithm.
For example, as shown in FIG. 7A, the pop-up display 30 in the case where the suitable action algorithm display unit 20 is touch-operated includes, for example, a title 31, an action algorithm name 33, and an explanatory text display unit 35. . Therefore, if the matching action algorithm display unit 20 is touch-operated, the player 2 can know what action algorithm can be applied to the current configuration of the group 6.
Further, as shown in FIG. 7 (2), for example, a title 31, an action algorithm name 33, a selection condition 34, and an explanatory text display on the pop-up display 30 when the quasi-conforming action algorithm display unit 22 is touched. And 35 are included. The selection condition 34 discloses the requirement of the composition of the group for the behavioral algorithm to be applied. Thus, the player 2 can know the possibility of arranging the current group configuration.

  Referring back to FIG. 5, the algorithm rank applied to the adaptive behavior algorithm display unit 20 is an index of the strength of the group in the battle, and the higher the rank with the same behavioral algorithm, the stronger. Then, the algorithm rank applied from time to time is automatically determined by the configuration of the group 6 and displayed on the rank display unit 23.

FIG. 8 is a diagram for explaining the method of calculating the algorithm rank and the effect.
As shown in FIG. 8 (1), the algorithm rank is defined by a function f (x1, x2,...) In which values of a plurality of parameters describing the configuration of a group are variables x1, x2,. In the present embodiment, as a parameter representing the property of the group 6, "number of characters of the same attribute that constitute the group (x1)", "number of characters of the same type that constitute the group (x2)", and "a group The central value (x3) of the level of the character to constitute is used. Then, the algorithm rank is set to be higher, that is, to be stronger as a group, as the number (x1) of characters of the same attribute constituting the group increases. Further, the algorithm rank is set to be higher as the number (x2) of characters of the same type constituting the group is larger and as the median value (x3) of character levels is higher. In addition, the parameter which can be made into a variable can be suitably set according to the game content not only in these.

  Then, as shown in FIG. 8 (2), the higher the algorithm rank, the higher the success probability of the attack and the avoidance probability of avoiding the enemy attack, that is, the execution success probability of the attack or the defense. In addition, the higher the algorithm rank, the higher the appearance rate of "commitment blow" and "defense in attendance". In other words, the higher the algorithm rank, the more advantageous it is in battle and the stronger it is as a group. Of course, the effect of the algorithm rank can be set appropriately according to the game content.

FIG. 9 is a view showing a display example of the game screen during the battle.
On the game screen during the battle, that is, the battle screen W6, a state is displayed where a group of players and a group of other players registered as matching candidates are engaged.
Although the layout of the screen can be set appropriately, in the present embodiment, the upper side of the screen is
1) An enemy group display unit 50 in which the current state of the enemy army group in the game space is drawn,
2) An enemy status display unit 51 for displaying various parameter values and the like indicating the states of the characters 4 constituting the enemy group;
3) an adaptive behavior algorithm display unit 53 for notifying a behavior algorithm applied to automatic control of an enemy group;
4) The rank display unit 55 is displayed.

Down on the screen
1) A self group display unit 60 in which the current state of the player 2, that is, a group of self groups in the game space is drawn;
2) A self status display section 61 displaying various parameter values etc. indicating the state of the characters 4 constituting the self group;
3) an adaptive behavior algorithm display unit 63 for notifying a behavior algorithm applied to the automatic control of the self group;
4) The rank display unit 65,
5) A war condition explanation display section 67 for displaying a description of the war condition as text or the like,
6) A battle statistics display section 69 is displayed, on which statistics of war statistics (war statistics) relating to the army are displayed.

  The war statistics are statistics describing the situation of the battle and are statistics characterizing the behavior algorithm. For example, as a statistical value relating to an attack, "probability of selecting an enemy character of an attribute which is good as an attack target", conversely, "probability of selecting an enemy character of an attribute which is not good", A selected probability, a probability of selecting the back row, a probability of executing hit and away, and the like can be adopted. Of course, the present invention is not limited to these, and can be appropriately set according to the game content.

  It is assumed that the type of statistics displayed in the battle status statistical value display unit 69 is set in advance for each behavior algorithm. The player 2 can see the display of the battle statistics display portion 69 and can judge whether or not the behavior algorithm applied to his / her group 6 is functioning as expected. Then, if it is not functioning and is disappointing, the organization of the group 6 used this time may be adjusted, and group organization to which an expected behavior algorithm is applied may be searched and re-challenged.

FIG. 10 is a diagram showing an example of a screen for presenting the battle result.
The match result presentation screen W8 includes 1) a win / loss display unit 70 for displaying the result of the win / loss, and 2) an acquired experience value display unit 72 for displaying the change of the character level accompanying the assignment of the experience value and the experience value. And 3) an advice display section 74 for displaying advice about the self group used this time.

In FIG. 10, the advice display section 74 displays the semi-adapted behavior algorithm selected at the time of group formation. This display doubles as a touch operation icon, and when the touch operation is detected, the explanation display of the semi-adapted behavior algorithm is popped up (see FIG. 7).
The player 2 evaluates the work of the group used this time according to the contents of the match result presentation screen W8, adjusts the group formation or makes a new group formation with reference to the display of the advice display section 74. be able to.

[Description of functional configuration]
FIG. 11 is a functional block diagram showing an example of a functional configuration of the server system 1100 in the present embodiment. The server system 1100 according to the present embodiment includes an operation input unit 100s, a server processing unit 200s, an image display unit 392s, a communication unit 394s, and a server storage unit 500s.

  The operation input unit 100 s is a means for inputting various operations for managing the server. In the example of FIG. 1, the keyboard 1106 corresponds.

  The server processing unit 200s is realized by, for example, a microprocessor such as a CPU or a GPU, an ASIC (application specific integrated circuit), an electronic component such as an IC memory, and each function unit including the operation input unit 100s and the server storage unit 500s. Control input and output of data between Then, various operations are executed based on predetermined programs and data, operation input signals from the operation input unit 100s, and data received from the player terminal such as the player terminal 1500 to integrate the operation of the server system 1100. Control. In the example of FIG. 1, the control board 1150 corresponds to this.

  The server processing unit 200s of the present embodiment includes a user management unit 202, an online shopping management unit 204, a game management unit 210, an image generation unit 292s, and a communication control unit 294s.

The user management unit 202 performs processing related to the user registration procedure and registration management processing of various data associated with the registered user.
For example, 1) issue processing of issuing a unique user ID to a user who has passed a predetermined registration procedure, ie, a player, 2) tying processing of an electronic payment medium used for electronic payment, 3) setting of an account for electronic payment, 4 ) Payment processing to an account using cash or credit card, 5) Settlement processing such as payment of play consideration, 6) Storage management of settlement history, 7) Login processing, 8) Registration procedure processing of the game contents to be used (this In the embodiment, a card registration procedure of the game card 3 can be performed.

  The online shopping management unit 204 enables online purchase of game content (game card 3 in the present embodiment), items, lottery rights, event participation rights, game points, and the like. It can be realized in the same manner as known online shopping.

The game management unit 210 performs various processes related to game play.
The online game according to the present embodiment is a kind of client-server online game, so the game management unit 210 activates a game requested to be executed from the player terminal 1500 and communicates with the player terminal 1500. Control to provide data necessary for play. For example, it is possible to control the operation by arranging the characters 4 of both teams 6 forming a game space corresponding to the battlefield in the virtual three-dimensional space as well as matching the opponents. In addition, it is possible to perform attack hit determination processing and damage reflection processing, win and loss determination processing, count processing of the number of turns and elapsed time, update processing of play history, processing to grow character 4 who participated in battle according to play results, etc. is there. In addition, processing necessary for game progress control can be appropriately executed according to the game content.

  Then, the game management unit 210 in the present embodiment includes a group formation unit 212, a matching behavior algorithm selection unit 214, a semi-matching behavior algorithm selection unit 216, a behavior algorithm notification control unit 220, and a rank display control unit 222. It has a parameter setting unit 230, an automatic control unit 250, a battle statistics unit 270, and a battle statistics display control unit 272.

  The group formation unit 212 performs control of newly forming a group and changing the configuration of an existing group. Specifically, the group formation screen W4 (see FIG. 5) is displayed on the player terminal 1500, and an arrangement indicating the group to be organized according to the operation input, the ID of the character 4 to be assigned, and the arrangement position thereof. Group organization is realized by acquiring the ID of the frame 12 from the player terminal 1500 and storing it in association with the user ID of the player 2.

  The adaptive behavior algorithm selection unit 214 selects an behavioral algorithm adapted to the organized group. Specifically, the nature based on the formation of a group is compared with the respective requirements of the selection condition 542 of the behavioral algorithm to extract the behavioral algorithm name 544 satisfying all the requirements (see FIG. 6). Then, any one of the extracted action algorithms is selected according to random lottery processing or selection operation input by the player 2, and it is determined as a matching action algorithm to be actually applied to automatic control.

  The semi-matching behavior algorithm selection unit 216 is a behavior algorithm similar to the fitting behavior algorithm, and selects a behavior algorithm that satisfies the selection condition 542 as a semi-matching behavior algorithm by changing a part of the organized group. Specifically, an action algorithm corresponding to a selection condition in which one or two of the requirements of the selection condition 542 are different but the other requirements are satisfied is extracted.

The action algorithm notification control unit 220 controls the display of the identifier (for example, the text of the action algorithm name, an icon) in order to notify the player 2 of the matching action algorithm or the semi-matching action algorithm.
In this embodiment, 1) display control of the matching behavior algorithm display unit 20 and the semi-matching behavior algorithm display unit 22 in the group formation screen W4 (see FIG. 5), and 2) the enemy forces in the battle screen W6 (see FIG. 9). The display control of the adaptive behavior algorithm display unit 53 and the adaptive behavior algorithm display unit 63 according to the own army is performed. Further, 3) display control of the matching behavior algorithm and the identifier of the semi-matching behavior algorithm in the outcome display section 70 and the advice display section 74 of the battle result presentation screen W8 (see FIG. 10) is performed.

  The rank display control unit 222 performs display control of the algorithm rank. In the present embodiment, 1) display control of the rank display unit 23 in the group formation screen W4 (see FIG. 5), and 2) a rank display unit 55 according to the enemy army in the battle screen W6 (see FIG. 9) And display control of the display unit 65. In addition, 3) it is possible to control the display of the algorithm rank in the result display section 70 of the battle result presentation screen W8 (see FIG. 10).

  The parameter setting unit 230 sets the value of the parameter related to the behavior algorithm based on the formation of the group 6. The present embodiment includes a group property determining unit 231, an algorithm rank setting unit 233, and an action success probability setting unit 235.

The group property determination unit 231 determines the property of the group based on the formation of the group 6. The "property" mentioned here is the content considered in selecting an action algorithm.
In the present embodiment, “properties” are determined by the requirements of the selection condition 542 of the behavior algorithm selection table 540. Specifically, the number of identical attributes of the characters 4 constituting the group 6 (x1 in FIG. 8 (1)), the number of characters of the same kind (x2 in FIG. 8 (1)), The parameters considered in determining the algorithm rank, such as the median value of the level (x3 in FIG. 8 (1)), the arrangement positional relationship, etc. correspond to the “property”, and the group property determination unit 231 calculates these values. can do. Of course, parameters corresponding to the nature can be set as appropriate according to the game content.

  The algorithm rank setting unit 233 determines an algorithm rank. Specifically, it is calculated by a predetermined function f having a predetermined parameter value describing group formation as a variable (see FIG. 8).

  The action success probability setting unit 235 sets the execution success probability of the action controlled by the automatic control means based on the formation of the group 6, in particular, the nature of the group. In the present embodiment, for example, the “attack success probability” and the “evading attack probability” of FIG. 8 (2) correspond to this.

The automatic control unit 250 automatically controls the characters 4 of the group 6 to be automatically controlled at the time of the match play according to the matching behavior algorithm set for the group.
In the present embodiment, the behavior pattern selection unit 251 is included.
The action pattern selection unit 251 selects the action pattern of the characters 4 of the group with a selection probability according to the formation of the group to be subjected to automatic control. The action pattern of the present embodiment is defined as, for example, a method of selecting a movement target position or an attack target, and in each selection method, a selection probability corresponding to the formation of a group is set as an appearance rate. The action pattern selection unit 251 determines an actual action pattern of the character 4 by randomly selecting a selection method according to the set appearance rate.

  The battle status statistics unit 270 sequentially updates predetermined types of statistical values that describe the battle status from the start to the end of the battle.

  The battle status statistical value display control unit 272 sequentially displays the battle status statistical value on the battle screen W6 (see FIG. 9). In the present embodiment, when the player 2 automatically controls his army, the battle condition statistic value display unit 69 displays the statistic value of the type associated with the applied action algorithm of the group of the army participating in the battle. .

  The image generation unit 292 s is realized by, for example, a processor such as a GPU or digital signal processor (DSP), a video signal IC, a program such as a video codec, or a drawing frame IC memory such as a frame buffer. Then, the image generation unit 292 s generates data for displaying an image of the game screen on the player terminal 1500 based on the processing result by the game management unit 210. In addition, an image necessary for system management is generated, and an image signal is output to the image display unit 392s.

  The image display unit 392s displays various images for system management based on the image signal input from the image generation unit 292s. For example, it can be realized by an image display device such as a flat panel display, a cathode ray tube (CRT), a projector, or a head mounted display. In the example of FIG. 1, the touch panel 1108 corresponds.

  The communication control unit 294 s executes data processing related to data communication, and realizes exchange of data with an external device via the communication unit 394 s.

  The communication unit 394 s connects to the communication line 9 to realize communication. For example, it is realized by a wireless communication device, a modem, a TA (terminal adapter), a jack of a wired communication cable, a control circuit, and the like. The communication device 1153 corresponds to the example of FIG.

  The server storage unit 500s stores a system program for realizing various functions for integrally controlling the server system 1100 by the server processing unit 200s, a program necessary to manage a game, various data, and the like. Further, it is used as a work area of the server processing unit 200s, and temporarily stores calculation results etc. that the server processing unit 200s executes according to various programs. Such functions are realized by, for example, an IC memory such as a RAM or a ROM, a magnetic disk such as a hard disk, an optical disk such as a CD-ROM or a DVD, an online storage, or the like. In the example of FIG. 1, a storage medium such as an IC memory 1152 or a hard disk, and a storage 1140 correspond to this.

FIG. 12 is a diagram showing an example of a program or data stored in the server storage unit 500 s in the present embodiment.
The server storage unit 500 s stores in advance a system program 501, a server program 502, a distribution client program 507, and game initial setting data 510. The server storage unit 500s stores game card management data 590, user management data 600, matching candidate registration data 690, and play data 700 as data sequentially generated and updated. Furthermore, other information such as timers, counters, and various flags can be stored appropriately.

  The system program 501 is a basic program for realizing a basic input / output function necessary as a computer by being read and executed by the server processing unit 200 s.

  The server program 502 is a program for realizing a function as a game server of an online game. In this embodiment, a user management program 503 for realizing the function of the user management unit 202, an online shopping management program 504 for realizing the function of the online shopping management unit 204, and a function of the game management unit 210. And a game management program 505 for realizing the above.

  The distribution client program 507 is a program to be executed on the player terminal 1500 in order to execute the game. The distribution client program 507 may be realized, for example, as a dedicated program. Alternatively, if the game of the present embodiment is realized as a web game, a web technology that actively controls screen display using Java (registered trademark), CSS (Cascading Style Sheets), etc. together with HTML based on a web browser. Alternatively, it may be realized using a plug-in such as Adobe (registered trademark) Flash. Of course, other methods may be used.

  The game initial setting data 510 stores various initial setting data required to execute the game. A part of them may be used for distribution to the player terminal 1500. In the present embodiment, item initial setting data 512, character initial setting data 520, an action algorithm selection table 540, and action algorithm definition data 550 are included. Of course, data other than these can also be stored appropriately.

  The item initial setting data 512 is prepared for each item available in the game, and stores data defining the effect of the item together with the item ID.

  The character initial setting data 520 is prepared for each type of character 4 that can be used in the game. For example, as shown in FIG. 13, one character initial setting data 520 includes a character ID 521, character display data 522, character movement control data 523, character name 524, attribute 525, and initial ability parameter value. And a list 530.

  The attribute 525 is information for classifying the property of the character, and in the present embodiment, there are three types of “proximity attack type”, “medium distance attack type” and “long distance attack type”, but according to the game content It can be set as appropriate.

  The initial ability parameter value list 530 stores initial values such as various abilities of the character. For example, it includes an experience value 531 and a level 532 that indicate the degree of growth of the character. Also, it includes a endurance value 533 corresponding to the initial state HP (hit point), a range distance 534, an offensive power 535, a defense power 536, and a movement power 537. Of course, data other than these can also be stored appropriately.

  Referring back to FIG. 12, the action algorithm selection table 540 stores the action algorithm name 544 in association with the selection condition 542 (see FIG. 6).

  The behavioral algorithm definition data 550 is prepared for each behavioral algorithm, and stores various data defining the behavioral algorithm. For example, as shown in FIG. 14, one action algorithm definition data 550 is associated with the action algorithm name 551, and a plurality of probability setting tables 560 for defining the action tendency of the character 4 of each attribute in the action algorithm The and away trigger rate 570 and the display target battle status statistic type 572 are stored in association with each other. Of course, data other than these can also be stored appropriately.

  The probability setting table 560 defines the tendency of each basic action in the battle. The basic action is a classification of basic battle action, and can be appropriately set according to the game content such as movement, attack, defense, recovery, and support. In the present embodiment, there are three types of movement (movement only), attack (including approach movement to the attack target), and recovery, and the character 4 can perform any class of action during one turn. .

  For example, as shown in FIG. 15 (1), the probability setting table 560 in which "move" is assigned as the basic action to be applied includes: 1) applicable basic action type 561 set to "move"; The table includes the basic behavior activation probability 562 in the behavioral algorithm, and 3) the movement target position selection method 563 and the appearance rate 565 in association with one another.

In FIG. 15 (1), the basic action activation probability 562 is the probability that “move” is selected.
The contents of the movement target position selection method 563 each define an action pattern in the basic action “movement”, and can be appropriately set according to the game contents and rules.
The appearance rate 565 is distributed so that all together, it will be "1.0" or "100%". By this allocation and the movement target position selection method, an action tendency regarding "movement" of the attribute in the action algorithm is shown. In the present embodiment, the probability is set according to the compatibility with each object constituting another group. In FIG. 15, the notation [] of the probability shown in the appearance rate 565 is an abbreviation representing a selection method.

  Similarly, as shown in FIG. 15 (2), the probability setting table 560 in which “attack” is assigned as the applied action classification is 1) an applied basic action type 561 set to “attack”, And 2) a table in which an attack target selection method 564 and an appearance rate 565 are associated with each other. The contents of the attack target selection method 564 can be set as appropriate according to the game contents and rules.

  In the present embodiment, it is assumed that a probability setting table 560 for the basic action of “recovery” not shown is prepared.

  Returning to FIG. 14, the hit-and-away trigger rate 570 defines the probability of performing hit and away from the attacked enemy after one attack.

  The display target battle status statistic type 572 defines the type of statistics to be displayed on the battle status statistic value display unit 69 of the battle screen W6 (see FIG. 9). Multiple statistics types may be defined.

  Returning to FIG. 12, the game card management data 590 stores data describing the usage status of each game card 3 (see FIG. 1). For example, in association with a card ID unique to a game card, a character ID indicating a character associated with the game card and a registered flag indicating whether the game card is registered by the player are stored. The initial value of the registered flag is "0 (not registered)", but is changed to "1 (registered)" when a registration application is made in the card registration procedure. The user ID of the card-registered player 2 may be further stored in association with the card ID.

The user management data 600 is prepared for each player registered as a user.
One piece of user management data 600 is, for example, as shown in FIG.
1) User ID 601,
2) play history data 602 in which the play start date and time, the play end date and time, and the play result are associated with each other and stored in time series;
3) A valid card list 604 for storing the card ID of the game card 3 for which the registration procedure has been completed,
4) Character save data 610 storing data describing the situation of the character 4 made available by registration of the game card 3;
5) an owned item list 612 for storing item IDs of available items;
6) group formation data 630; Of course, data other than these can also be stored appropriately.

  The character save data 610 is prepared for each registered game card of the user, and the character ID indicating the character 4 assigned to the game card 3 and the ability parameter value (experience value, level, attack power) of the character , Save the defense power, etc.).

The group organization data 630 is prepared for each group created by the player 2 and stores various data defining the group organization.
For example, one group formation data 630 includes 1) group name 631, 2) algorithm rank 633, 3) matching behavior algorithm name 635, 4) quasi matching behavior algorithm name 637, and 5) character ID by arrangement position. And a table 639.

  The arrangement position-based character ID table 639 is data indicating the relationship between the characters 4 constituting the group and the arrangement position thereof. In the present embodiment, the character ID of the arranged character 4 is stored as array data of a total of nine arrangement frames 12 (see FIG. 5) of the front row, middle row, rear row and left wing, center, right wing of each row. Do. In addition, a predetermined value (NULL) is set to the unarranged arrangement frame.

Returning to FIG. 12, the matching candidate registration data 690 is a record in which groups created by various players are registered as matching candidates for competition play. For example, as shown in FIG. 17, the registration date 691, the registrant user ID 692, the group name 693, and the battle record 694 are stored in association with each other. Of course, data other than these can be stored in appropriate correspondence.
With regard to the track record history 694, not only the total number of wins and losses but also statistical histories such as the win / loss ratio by tactical algorithm, the win / loss ratio by algorithm rank can be appropriately included.

  Returning to FIG. 12, the play data 700 stores various data prepared for each game being played and describing the progress. For example, as shown in FIG. 18, one piece of play data 700 includes a start date and time 701, the number of turns 702, and group management data 710 for each group participating in a match.

  One group management data 710 includes 1) a user ID 711 indicating a player who organized the group, 2) a group name 712, 3) an algorithm rank 713, 4) a matching behavior algorithm name 714, and 5) a semi-matching behavior It includes an algorithm name 715, 6) character status data 720 prepared for each of the characters 4 constituting the group, and 7) battle status statistical data 740 for storing various types of battle status data related to the group. Of course, data other than these can also be stored appropriately.

  The group name 712, the algorithm rank 713, the matching behavior algorithm name 714, and the near matching behavior algorithm name 715 are copied from the grouping data 630 of the user management data 600 (see FIG. 16) with which the user ID 711 matches.

  One character status data 720 includes a character ID 721, a character name 722, an attribute 723, an arrangement position coordinate 724, an attack target position coordinate 725, a movement target position coordinate 726, and a latest ability parameter value list 730. . Of course, data other than these can also be stored appropriately.

The character ID 721, the character name 722, the attribute 723 and the arrangement position coordinates 724 of the initial value are copied from the group organization data 630 of the user management data 600 (see FIG. 16) with which the user ID 711 matches.
The latest ability parameter value list 730 has an initial value copied from the character initial setting data 520 (see FIG. 13) matching the character ID 721 and is successively changed, for example, reflecting damage etc. in accordance with the progress of the battle.

[Description of process flow]
FIG. 19 is a flowchart for explaining the flow of processing relating to the game start to end in the server system 1100.
The flow of processing described here is implemented by the server system 1100 executing the server program 502. As a premise, it is assumed that the player 2 has already completed user registration and card registration and is in a logged-in state. Also, it is assumed that the player terminal 1500 executes the distribution client program 507 and establishes data communication with the server system 1100.

When the player terminal 1500 detects an input of a predetermined grouping operation, the player terminal 1500 transmits a grouping request to the server system 1100.
When receiving this, the server system 1100 determines that a group formation operation has been detected (YES in step S2), and executes a group formation process (step S4).

  FIG. 20 is a flowchart for explaining the flow of group formation processing in the present embodiment. The server system 1100 causes the player terminal 1500 of the transmission source of the group formation request to display the group formation screen W4 (see FIG. 5), and provides options for the work form “new group creation” and “change existing group”. It is displayed (step S10).

The server system 1100 receives the selection result of the work mode from the player terminal 1500.
If "Create new" is selected (newly created in step S12), new group organization data 630 is created in the user management data 600, and it is empty (group 4 with no character 4) in the group organization screen W4. The arrangement frame 12 and the character list display unit 14 are displayed (step S14).

  If "change existing group" is selected (change in step S12), referring to group organization data 630 of user management data 600 (see FIG. 16), select an existing group on group organization screen W4 The list is displayed as possible, and the selection input of the group to be changed is accepted (step S16). When the information of the group to be changed is received from the player terminal 1500, the configuration of the group to be changed and the character list display unit 14 are displayed (step S18).

Next, the server system 1100 changes the configuration of the group based on the information of the character arrangement operation received from the player terminal 1500 (step S22).
Then, along with the change of the composition of the group, the behavior algorithm selection table 540 (refer to FIG. 6) is referred to, and the matching behavior algorithm name 635 (refer to FIG. 16) is set in the group organization data 630 of the group. The selection result is displayed on the adaptive behavior algorithm display unit 20 (see FIG. 5) on the screen W4 (step S24). At this stage, a plurality of matching action algorithm names 635 may be set.

Similarly, the semi-matching behavior algorithm is selected and the semi-matching behavior algorithm name 637 is set, and the selection result is displayed on the semi-matching behavior algorithm display unit 22 on the group formation screen W4 (step S26).
Further, in accordance with the change of the configuration of the group, the server system 1100 determines the algorithm rank 633, and causes the rank display unit 23 (see FIG. 5) to display (step S28).

In addition, while the group formation screen W4 is displayed, when the player terminal 1500 detects a touch operation on the matching behavior algorithm display unit 20 or the semi-matching behavior algorithm display unit 22, the detail display operation request and the touch operation are performed. The identification information of the action algorithm is transmitted to the server system 1100.
When receiving this, the server system 1100 causes the player terminal 1500 to display a pop-up display 30 (see FIG. 7) for the requested action algorithm (step S30).

When the formation end operation is input, in the present embodiment, the player terminal 1500 detects the input of the formation end operation, and transmits a formation end request to the server system 1100.
When the server system 1100 receives this (YES in step S40), the server system 1100 determines an action algorithm to be actually applied by automatic control (step S42). In the present embodiment, the matching behavior algorithm name 635 (see FIG. 16) is narrowed to one. In the present embodiment, random lottery processing is selected, but in the case of a configuration in which the player selects, instead of this step, a step of accepting any selection operation from the adaptation behavior algorithm display unit 20 after step S30 is provided. Good.

  Then, the data of the group currently organized is saved (step S44), information on the group is added to the matching candidate registration data 690 (see FIG. 17), and registered as a matching candidate (step S46). End the organization process.

  Returning to the flowchart of FIG. 19, when the server system 1100 receives a match play start operation request from the player terminal 1500, the server system 1100 regards the match start operation as detection (YES in step S50) and executes the match play process (step S52). .

FIG. 21 is a flowchart for explaining the flow of the battle play process.
In the same process, the server system 1100 first causes the player 2 to select a group 6 to be used as a player (step S70). For example, with reference to the group formation data 630 of the user management data 600, the group selection list is displayed on the player terminal 1500, and the result of the selection operation is received.

  Next, the server system 1100 refers to the matching candidate registration data 690, and selects a group of computer controlled enemy forces (step S72). For example, it may be selected randomly from all the registered groups, or may be selected from among those close in algorithm rank 633 with reference to the group organization data 630.

  Next, the server system 1100 causes the player 2 to select the play style (step S74). That is, the player terminal 1500 displays the option of operating the group of the army in “manual” or “automatic” using the matching behavior algorithm, and receives the selection result.

If "manual" is selected (manual in step S76), the server system 1100 controls the operation according to the operation input on the player terminal 1500 for its own army, and for the enemy army, the adaptive action algorithm name 635. Game progress control is started as automatic control by "automatic battle processing" based on the action algorithm shown (step S78).
On the other hand, if "automatic" is selected (automatic at step S76), the server system 1100 automatically controls the "automatic battle process" based on the action algorithm indicated by the compatible action algorithm name 635 for both the own army and the enemy army. In particular, game progress control is started (step S80).

  22 to 23 are flowcharts for explaining the flow of automatic battle processing, so-called AI processing. The automatic battle process is performed for each of the characters 4 that remain capable of action.

In the same process, the server system 1100 first determines the basic action of the character 4 to be processed. In the present embodiment, any one of attack, movement, and recovery is determined (step S100).
Specifically, the action algorithm definition data 550 (see FIG. 14) indicated by the matching action algorithm name 635 in the group formation data 630 (see FIG. 16) of the group to be processed is referred to. Then, the basic action activation probability 562 (see FIG. 15) for each basic action type is read out, and the type of basic action is determined by lottery based on the read out probability.

  If "attack" is selected as a result of the lottery (YES in step S102), the server system 1100 sets the number of retries as a control variable and initializes it to "0" (step S104).

  Next, the server system 1100 refers to the probability setting table 560 in which the applied basic behavior type 561 is "attack" (step S106; see FIG. 15 (2)). The appearance rate 565 of each of the attack target selection methods 564 is temporarily stored in the storage unit 500, and the temporarily stored appearance rate 565 is a characteristic of the processing object of the automatic control process, for example, the level of the character 4 to be processed or The correction is made based on the algorithm rank 713 and the like of the group 6 of the characters 4 (step S108).

Specifically, the appearance rate 565 according to the attack target selection method 564 is slope-distributed to realize the tactical tendency of the behavior algorithm. In the correction, correction is made to increase the tendency of the slope distribution. Further, as the correction, either one or both of the level of the character 4 to be processed and the algorithm rank 713 of the group 6 can be adopted.
For example, while only the value k1 according to the level of the character 4 or the algorithm rank 713 is added to any of the appearance rate 565 of the maximum value, the same value k1 is subtracted from any appearance rate 565 of the minimum value. Next, one of the second highest appearance rates 565 is added to only one value k2 according to the level of the character 4 and the algorithm rank 713 to any one of the second appearance rates 565, and one of the second lowest appearance rates 565 remains unchanged. To the same value k2. It is possible to appropriately set up to what order the same process is repeated. The values k1 and k2 are calculated by a predetermined function.

  Next, the server system 1100 executes a lottery process based on the corrected appearance rate 565 to select any one of the attack target selection methods 564 (step S110). This corresponds to selecting the action pattern of the character to be processed.

  If the attack target selection method 564 is selected, an attack target is selected according to the method (step S112), and it is determined whether the character 4 to be processed can attack the attack target (step S114). For example, if the attack target is within the range, or if the movement target is within the range by moving, it is determined that the attack is possible. Besides, the rule of availability can be set according to the contents of the game.

  If the attack target is to be attacked (YES in step S114), the server system 1100 determines that the attack is a strike of the meeting with a probability proportional to the algorithm rank 713 of the group on the attack side (turn side in the present embodiment). The activation determination is performed (step S116; see FIG. 8), and the activation determination of “defense in account” is performed with a probability proportional to the algorithm rank 713 of the defense group (step S118; see FIG. 8).

  Next, the server system 1100 calculates an attack success rate according to the algorithm rank 713 of the attacking group (step S120; see FIG. 8), and calculates an avoidance rate according to the algorithm rank 713 of the defending group Step S122; see FIG. 8).

Then, the server system 1100 causes the character 4 to be processed to take an attack action (step S130).
Specifically, if the range is insufficient, the movement target is appropriately controlled and then the attack target is attacked. Then, the hit determination of the attack is performed based on the attack success probability, the avoidance rate, and the result of the determination of the activation of the "perception of the conscience" and the "defense of the conscience". Then, the amount of damage is determined based on the attack power of the character 4 attacking, the defense power of the character 4 defending, etc., and the damage is reflected.

  Next, the server system 1100 determines whether the character 4 to be processed can be hit and away (step S132). For example, if the movement ability set for the character 4 still remains after being consumed to approach the attack target, it may be determined that hit and away is possible. In addition, the determination rule can be appropriately set in accordance with the game content and the like.

  Then, if it is determined that it is possible (YES in step S132), the action algorithm definition data 550 indicated by the matching action algorithm name 714 of the group of characters to be processed is referred to and the activation lottery is performed according to the hit and away activation rate 570 To execute activation control (step S134; see FIG. 14).

  Incidentally, if it is determined that the attack is not possible in step S114 (NO in step S114), the number of retries of the control variable is incremented by 1 (step S140), and the number of retries does not reach the predetermined upper limit. (NO in step S142), the attack target selection method is reselected (step S110). If a target that can be attacked is not found even if the number of retries reaches the upper limit (YES in step S142), the type of basic action is reselected (step S100).

  On the other hand, when "move" of the basic action is selected in step S100 (YES in step S150 of FIG. 23), the server system 1100 sets the number of retries and initializes it to "0" (step S152). The action type 561 refers to the probability setting table 560 of "move" (step S154).

  Then, the server system 1100 corrects the appearance rate 565 according to the movement target position selection method 563 referred to in the same manner as step S108 (step S156). Then, a lottery process is executed based on the corrected appearance rate 565, and one of the movement target position selection methods 563 is selected (step S158).

  If the movement target position selection method 563 is selected, the movement target position is selected according to the method (step S160), and it is determined whether the character 4 to be processed can be moved to the movement target position (step S162).

If it can move (YES in step S162), the server system 1100 moves the character 4 to be processed to the movement target position (step S164).
If it is determined that movement is not possible (NO in step S162), the number of retries of the control variable is incremented by 1 (step S166), and if the number of retries does not reach the predetermined upper limit (step S168). NO), and the movement target position selection method is reselected (step S158). If a target that can be attacked is still not found even if the number of retries reaches the upper limit (YES in step S168), the type of basic action is reselected (step S100 in FIG. 22).

  On the other hand, when a basic action other than “attack” or “move” is selected in step S100 (NO in step S130 of FIG. 23), the server system 1100 performs processing similar to that shown in FIG. A method of determining details of the basic action is selected based on the appearance rate 565 of the probability setting table 560, and specific details are determined by the selected method (step S170). For example, in the case of the "recovery" action, the recovery object selection method is determined at the appearance rate 565 for the other character of the friend as well as the character to be processed, the recovery object is selected, and the recovery action is executed.

  Referring back to the flowchart of FIG. 21, as the game progress control is started, the server system 1100 starts calculation and display of battle status statistics for each army and enemy army (step S200), and for each army and enemy army. The display of the matching behavior algorithm name and the algorithm rank is started (step S202).

If the battle play satisfies the predetermined end condition (step S204), the server system 1100 causes the player terminal 1500 to display the battle result presentation screen W8 (see FIG. 10) (step S220), and this time according to the game result. In step S222, a growth process is performed such as giving an experience value to the characters 4 in the group used for the battle play of the game (step S222).
Then, the save data and the like are updated (step S224), and the battle play process is ended. Specifically, group formation data 630 and character save data 610 of characters constituting the group (see FIG. 16), play history data 602 of player 2, match candidate registration, data of a group used for the current match play The battle record 694 of the data 690 is updated, and the battle play process is ended.

  Returning to the flowchart of FIG. 19, when the player terminal 1500 detects a predetermined match result confirmation operation input and the match result confirmation request is transmitted to the server system 1100, the server system 1100 regards it as the match result confirmation operation ( In step S240, the player terminal 1500 causes the player terminal 1500 to display the matching action algorithm name for each group, the algorithm rank, and the track record history 694 with reference to the user management data 600 and the matching candidate registration data 690. (Step S242).

  When a predetermined game termination operation input is detected on the player terminal 1500 and a game termination request is transmitted to the server system 1100 (YES in step S244), a series of processing is terminated.

  As described above, according to the present embodiment, it is possible to provide diversity in the behavior of a group automatically controlled by a computer to further enhance the interest of the game.

Second Embodiment
Next, a second embodiment to which the present invention is applied will be described.
In the first embodiment, the main processing is performed by the server system 1100. However, in the present embodiment, the player terminal 1500 performs a game management function. In the following, only the differences from the first embodiment will be described. The same components as those in the first embodiment will be assigned the same reference numerals, and redundant descriptions will be omitted.

The configuration of the game system is the same as that of the first embodiment.
The functional configuration of the server system 1100 is configured as shown in FIG.

Then, the functional configuration of the player terminal 1500 is configured as shown in FIG.
More specifically, the player terminal 1500 of the present embodiment includes an operation input unit 100, a processing unit 200, a sound output unit 390, an image display unit 392, a communication unit 394, and a storage unit 500.

  The operation input unit 100 outputs an operation input signal to the processing unit 200 in accordance with various operation inputs made by the player. For example, it can be realized by a push switch, a joystick, a touch pad, a track ball, an acceleration sensor, a gyro, a CCD module, or the like. The direction input key 1502, the button switch 1504, and the touch panel 1506 in FIG. 2 correspond to this.

  The processing unit 200 is realized by, for example, a microprocessor such as a CPU or a GPU, or an electronic component such as an ASIC or an IC memory, and performs data input / output control with each function unit including the operation input unit 100 and the storage unit 500. Do. Then, various operations are executed based on predetermined programs and data, operation input signals from the operation input unit 100, various data received from the server system 1100, and the like to control the operation of the player terminal 1500. The control board 1550 of FIG. 2 corresponds to this. Then, the processing unit 200 includes a game management unit 210, a sound generation unit 290, an image generation unit 292, and a communication control unit 294.

  The sound generation unit 290 is realized by, for example, a digital signal processor (DSP), a processor such as a voice synthesis IC, an audio codec capable of reproducing a sound file, or the like. BGM and sound signals of various operation sounds are generated and output to the sound output unit 390.

  The sound output unit 390 is realized by a device that outputs sound such as a sound effect or BGM based on a sound signal input from the sound generation unit 290. The speaker 1510 of FIG. 2 corresponds to this.

The image generation unit 292 is realized by, for example, a processor such as a GPU or digital signal processor (DSP), a video signal IC, a program such as a video codec, or a drawing frame IC memory such as a frame buffer.
Then, the image generation unit 292 generates an image of one game screen in one frame time (for example, 1/60 seconds) based on the processing result by the game management unit 210, and displays the generated image signal of the game screen as an image. Output to the section 392.

  The image display unit 392 displays various game images based on the image signal input from the image generation unit 292. For example, it can be realized by an image display device such as a flat panel display, a cathode ray tube (CRT), a projector, or a head mounted display. In the present embodiment, the touch panel 1506 of FIG. 2 corresponds to this.

  The communication control unit 294 executes data processing related to data communication, and realizes exchange of data with an external device (such as the server system 1100) via the communication unit 394. The communication unit 394 connects with the communication line 9 to implement communication. For example, it is realized by a wireless communication device, a modem, a TA (terminal adapter), a jack of a communication cable for wired communication, a control circuit or the like, and the wireless communication module 1553 in FIG. 2 corresponds to this.

  The storage unit 500 stores a system program for realizing various functions for integrally controlling the player terminal 1500 in the processing unit 200, a program necessary for game play, various data, and the like. Further, it is used as a work area of the processing unit 200, and temporarily stores calculation results executed by the processing unit 200 according to various programs, input data input from the operation input unit 100 and the like. Such functions are realized by, for example, an IC memory such as a RAM or a ROM, a magnetic disk such as a hard disk, an optical disk such as a CD-ROM or a DVD, or the like. The IC memory 1552 and the memory card 1540 mounted on the control board 1550 in FIG. 2 correspond to this.

  The storage unit 500 stores a terminal system program 509, a game management program 505, game initial setting data 510, and play data 700. In addition, information such as play data 700, a timer, a counter, and various flags are stored as data generated and managed in accordance with the progress of the game.

The terminal system program 509 is a program for realizing a basic function of input and output as a computer of the player terminal 1500.
The game management program 505 and the game initial setting data 510 are downloaded from the server system 1100 and stored. Alternatively, it is prepared by mounting a memory card 1540 (FIG. 2) or the like obtained separately.

  The flow of processing from the game start to the end in the player terminal 1500 in the present embodiment is the same as that of the first embodiment. That is, the “server system 1100” may be read as the “player terminal 1500” in the description of the flow of processing in the first embodiment.

  However, information necessary for creating the play data 700, for example, information on a group of opponents, is acquired from the server system 1100 before the start of the game (before step S2 in FIG. 19). In addition, in step S 204 (see FIG. 21) after the end of the match play, a step is added to transmit information such as the battle record and the battle status statistics regarding the group of opponents from the player terminal 1500 to the server system 1100. Then, the server system 1100 updates the battle record history 694 of the matching candidate registration data 690 based on the received information. Furthermore, among the user management data 600 of the opponent, the play history data 602, the character save data 610, and the like are changed.

Also in this embodiment, the same effect as that of the first embodiment can be obtained.
In the present embodiment, if all the players are players, game play is realized by a client server type system with any one of the player terminals 1500 as a game server. Alternatively, the player terminal 1500 of the opponent may be connected by peer-to-peer, and the functions of the game management unit 210 may be further shared by those player terminals 1500 to realize game play.

[Modification]
As mentioned above, although the example of embodiment which applied this invention was demonstrated, the form which can apply this invention is not limited to the said form, Addition, omission, and change of a component can be given suitably.

[Part 1]
For example, the player terminal 1500 may be a commercial game device installed in a game center or the like.

[Part 2]
Further, in the above embodiment, one match behavior algorithm is applied to one group to perform match play, but a configuration is also possible in which a plurality of match behavior algorithms are applied to one group.
Specifically, based on the first embodiment, a predetermined number (two or more) of action algorithms are selected from the action algorithms satisfying the selection condition 542 in the action algorithm selection table 540 (see FIG. 6). And the adaptation behavior algorithm. The selection method may be such that the player 2 makes a manual selection, or a random lottery process may be performed to make an automatic selection.

  Then, as shown in FIG. 26, the game management unit 210 has a switching condition setting unit 274 that sets a switching condition for switching the predetermined number of selected matching behavior algorithms during the match play according to the operation input of the player. Configure to

  As shown in FIG. 27, when the group formation screen W4 is scrolled, as shown in FIG. 27, the switching condition setting unit 274 gives 1) an order of priority to assign an application order (priority order) of the action algorithm displayed on the matching action algorithm display unit 20. The operation field 24 and 2) the switching condition selection field 26 are displayed.

  The options of the switching condition displayed in the switching condition selection field 26 can be appropriately set according to the game content. For example, as the threshold condition of the switching condition, it is possible to set the number of turns, the attrition rate of the own army, the attrition rate of the enemy army, the elapsed time from the start of the battle play, and the like. In the case of a game on the theme of base defense, it is preferable that the distance between the base and the enemy group character, the distance between the enemy base and the character of the group, and the like can be set as the threshold condition.

  Then, when the application order is set in the order assignment operation field 24, the switching condition setting unit 274 associates the set application order with the adaptation action algorithm name 714 in the group management data 710 of the play data 700. Store. Further, when the player 2 selects any one in the switching condition selection field 26, the switching condition identifier is stored in the group management data 710 of the play data 700 according to the selection result.

  Then, as shown in FIG. 28, in the battle play process, the switching condition of each group management data 710 is set for each group used for the battle play until the battle play is finished (NO in step S206). It is determined whether the switching condition indicated by the identifier is satisfied, and processing of switching the matching behavior algorithm of the satisfied group is performed (step S208).

  By providing a plurality of adaptation behavior algorithms applied at the time of automatic control and preparing a switching condition to be switched in a scene to be applied, it is possible to bring about diversity of application algorithms and to further enhance the interest of the game.

[Part 3]
Further, in the above embodiment, the matching behavior algorithm or the semi-matching behavior algorithm is selected from among those prepared in advance, but the present invention is not limited to this. For example, a configuration is also possible in which the player 2 acquires and registers the behavior algorithm itself as in the game card 3 and selects it as a compatible behavior algorithm or a quasi-conforming behavior algorithm.

  Specifically, a game card 3 to which a behavior selection algorithm is assigned, or an item available in the game or online shopping in which a release key of the behavior selection algorithm is set, is prepared. In the case of the game card 3, as in the case of the character, it is validated by going through the registration procedure. In the case of items, they shall be automatically activated upon acquisition, or shall be activated when used. Then, in step S24 and step S26 (see FIG. 20) of the group formation process, the action algorithm name 544 is extracted based on the action algorithm selection table 540 in the same manner as the above embodiment, and the extracted action algorithm is validated. If it is, it will be taken as a matching action algorithm or a semi-matching action algorithm.

  Further, in the configuration, as shown in the group formation screen W4 of FIG. 29, the game card style icon 17 of the character activated by the player 2 is displayed in the character list display 14, and the icon is dragged and dropped. Group formation is performed by arranging by operation etc. The match behavior algorithm display unit 20 and the near match behavior algorithm display unit 22 display the game card style icons 27 of the match behavior algorithm and the near match behavior algorithm selected in the steps S24 and S26 (see FIG. 20). In step S42 (see FIG. 20), the player 2 drags and drops the icon to the action algorithm selection field 30 to set an action algorithm applied to automatic control of the group 6 being organized. Is preferable.

  Furthermore, although the adaptation behavior algorithm is applied to the entire group in the above embodiment, the adaptation behavior algorithm may be set for each subpopulation included in the group. The sub group is a group of relative positional relationships in the front row, middle row, and rear row groups, a platoon unit, etc., and can be set as appropriate according to the game content, in particular, the rules regarding the state of the group.

  Specifically, as shown in FIG. 30, the adaptation behavior algorithm setting field 30 is prepared for each subgroup. Then, in step S42 (see FIG. 20), the player 2 selects manually, not automatically by the computer. That is, the player 2 sets the setting group for each sub group by dragging and dropping from the matching action algorithm display field 20 to the icon of the desired action algorithm.

[Part 4]
Further, in the above embodiment and its modification, the probability setting table 560 of the action algorithm definition data 560 (see FIG. 14) is prepared for each subgroup even if it is the same basic action, that is, even if it is "move". It will be subdivided in such a way as "for front row", "for middle row" and "for back row". This is more effective for diversification of automatic control.

[Part 5]
Further, in the above embodiment, the group is described as if it is composed of a plurality of characters, but the group may be composed of only integral characters.
In addition, although it has been described as a battle between players, it may be a group prepared in advance by the game provider company side as an opponent, or may be an integrated enemy character only.

[Part 6]
Although the behavioral algorithm has been described as fixed, a growth factor may be added. For example, the growth parameter and the level are set in the behavioral algorithm, and the value of the growth parameter is increased as the behavioral algorithm is applied to win. Then, every time the level-up threshold is reached, the level of the behavioral algorithm may be increased to update the control content of the behavioral algorithm.

2 ... player 4 ... character 6 ... group 20 ... matching action algorithm display part 22 ... semi-matching action algorithm display part 23 ... rank display part 35 ... explanation sentence display part 53 ... matching action algorithm display part 55 ... rank display part 60 ... self Group display section 61 Self-status display section 63 Conforming action algorithm display section 65 Rank display section 69 Battle status statistical value display section 200s Server processing section 210 Game management section 212 Group organization section 214 Conformance action algorithm selection section 216: quasi-conforming action algorithm selection unit 220: action algorithm notification control unit 222: rank display control unit 230: parameter setting unit 231: group property determination unit 233: algorithm rank setting unit 235: action success probability setting unit 250: automatic control unit 251 ... Behavior pattern selection unit 270 ... War situation Total area 272: Battle status statistical value display control area 500s ... Server storage area 502 ... Server program 505 ... Game management program 540 ... Behavior algorithm selection table 542 ... Selection condition 544 ... Behavior algorithm name 550 ... Behavior algorithm definition data 551 ... Behavior algorithm name 553 ... application condition 560 ... probability setting table 561 ... application basic action type 562 ... basic action activation probability 563 ... movement target position selection method 564 ... attack target selection method 565 ... appearance ratio 572 ... display target battle status statistic type 600 ... user management data 630 ... group organization data 631 ... group name 633 ... algorithm rank 635 ... matching behavior algorithm name 637 ... semi-matching behavior algorithm name 700 ... play data 710 ... group management data 712 ... group name 713 ... algorithm Rank 714-Conforming action algorithm name 715-Semi-conforming action algorithm name 720-Character status data 723-Attribute 724-Placement position coordinates 725-Attack target position coordinates 726-Moving target position coordinates 740-War status statistical data 1150-Control board 1500-... Player terminal 1550: Control board W4: Group formation screen W6: Battle screen W8: Battle result announcement screen

Claims (12)

A program for causing a computer to execute a competition game in which a group formed by a plurality of objects in accordance with a user's organization operation and an enemy object perform a battle action including attack and defense to damage an opponent. ,
A group organization including at least an arrangement configuration relating to how many objects are arranged, what kind of arrangement, and which objects are arranged at which arrangement position is organized according to the organization operation of the user Group forming means for forming the group by
Among the plurality of behavior algorithms associated with the selection condition based on the arrangement configuration, the action algorithm regarding the battle action executed by the group is based on the arrangement configuration of the group formation organized by the group formation means. Behavioral algorithm setting means to set by selecting
Parameter setting means for setting parameters related to the action algorithm set by the action algorithm setting means based on the group formation formed by the group formation means
Automatic control means for automatically controlling the battle action of the group according to the action algorithm set by the action algorithm setting means using the parameter set by the parameter setting means;
As a program to make the computer work. The behavioral algorithm includes a plurality of behavioral patterns in one behavioral algorithm,
Causing the computer to further function as action pattern selection means for selecting an action pattern with a selection probability according to the group formation organized by the group formation means;
The automatic control means automatically controls the battle action of the group according to the action pattern selected by the action pattern selection means.
The program according to claim 1. The objects have compatibility with each other according to the attributes of the objects,
The action pattern selection means selects an action pattern of each object constituting the group using a selection probability according to the compatibility between the object and the enemy object.
The program according to claim 2. The parameter setting means has probability setting means for setting the execution success probability of the battle action controlled by the automatic control means based on the group formation organized by the group formation means.
The program according to any one of claims 1 to 3 . Operating the computer further as a property determining means for determining a property of the group based on the group organization organized by the group organization means;
The probability setting unit sets the execution success probability based on the property of the group.
The program according to claim 4 . The property determining means determines the similarity of the objects constituting the group in the property, and determines
The probability setting means sets the execution success probability higher as it is determined that the similarity determined by the property determining means is higher.
The program according to claim 5 . When controlling execution of an attack action, the automatic control means controls whether the attack gives damage to the enemy object, using the execution success probability set by the probability setting means.
The program according to claim 6 . The property determining unit determines the property of the group, including at least one of the type, the attribute, and the level of each of the objects constituting the group in the property determination criteria.
The program according to any one of claims 5 to 7 . The property determining means determines the property of the group including the ability index value indicating the ability of the action.
The program according to any one of claims 5 to 8 . Behavioral algorithm notification control means for performing control for notifying the set action algorithm by the action algorithm setting means to the user,
The program according to any one of claims 1 to 9 , for causing the computer to further function as War situation statistical notification control means for performing control for notifying the progress statistics associated with the set behavioral algorithms by the action algorithm setting means to the user,
The program according to any one of claims 1 to 10 , further causing the computer to function as. Communicate with the user terminal, and control the execution of a battle game in which a group formed of a plurality of objects and an enemy object perform a battle action including attack and defense in response to the user's formation operation to damage the other party A server system,
A group organization including at least an arrangement configuration relating to how many objects are arranged, what kind of arrangement, and which objects are arranged at which arrangement position is organized according to the organization operation of the user Group forming means for forming the group by
Among the plurality of behavior algorithms associated with the selection condition based on the arrangement configuration, the action algorithm regarding the battle action executed by the group is based on the arrangement configuration of the group formation organized by the group formation means. Action algorithm setting means to set by selecting ;
Parameter setting means for setting parameters relating to the action algorithm set by the action algorithm setting means based on the group formation formed by the group formation means;
Automatic control means for automatically controlling the battle action of the group according to the action algorithm set by the action algorithm setting means using the parameter set by the parameter setting means;
Server system with

Images