Non-transitory computer-readable storage medium, information processing method

Abstract

To provide an information processing program, an information processing method, and an information processing device capable of preventing a first character from being surrounded by a plurality of second characters.SOLUTION: The information processing program causes a computer to execute a process of deriving a second density function obtained by combining first density functions representing a density distribution according to a distance from a position of each of a plurality of second characters present within a range of a predetermined distance from a first character present at a first position, and moving the first character to a second position having a lower density than the first position by using the second density function.SELECTED DRAWING: Figure 5

Description

[Technical Field]

[0001] The present disclosure relates to an information processing program, an information processing method, and an information processing device. [Background technology]

[0002] Patent Document 1 discloses a game in which a character operated by a player fights against a plurality of enemy characters. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Japanese Patent Application Publication No. 2018-038892 Summary of the Invention [Problem to be solved by the invention]

[0004] In some known games, a first character fights against multiple second characters, and in such games, it may not be desirable for the first character to be surrounded by multiple second characters who are his or her opponents.

[0005] An object of the present disclosure is to provide an information processing program, an information processing method, and an information processing device that can prevent a first character from being surrounded by a plurality of second characters. [Means for solving the problem]

[0006] The information processing program of the first aspect causes a computer to derive a second density function by combining first density functions that represent a density distribution according to the distance from the position of each of multiple second characters that exist within a predetermined distance range from a first character that exists at a first position, and to use the second density function to move the first character to a second position that has a lower density than the first position.

[0007] The information processing program of the second aspect is the information processing program of the first aspect, in which when the first character is attacked by the second character, the computer is caused to execute a process of moving the first character to the second position using the second density function.

[0008] An information processing program of a third aspect is an information processing program of the first or second aspect, wherein the second position is a position in a direction toward a position closest to the first position among positions of a specific density that is lower than the density of the first position represented by the second density function.

[0009] An information processing program of a fourth aspect is an information processing program of the first or second aspect, wherein the second position is a position where the density represented by the second density function is lowest within a predetermined distance range based on the first character.

[0010] An information processing program of a fifth aspect is an information processing program of any one of the first to third aspects, wherein the second position is a position that is farther away from the first position the higher the density of the first position represented by the second density function.

[0011] An information processing program of a sixth aspect is an information processing program of any one of the first to fifth aspects, in which, when there are multiple groups to which the multiple second characters belong and the number of the second characters is equal to or greater than a threshold, the information processing program causes a computer to execute a process of deriving one first density function for each of the multiple groups and deriving the second density function by combining the multiple first density functions corresponding to each of the multiple groups.

[0012] An information processing program of a seventh aspect is an information processing program of any one of the first to fifth aspects, in which, when there are multiple groups to which the multiple second characters belong and the distance between a virtual camera corresponding to a player's field of view in the virtual space and the first character is equal to or greater than a threshold, the information processing program causes a computer to execute a process of deriving one first density function for each of the multiple groups and deriving the second density function by combining the multiple first density functions corresponding to each of the multiple groups.

[0013] An information processing program of an eighth aspect is an information processing program of any one of the first to fifth aspects, in which, when there are multiple groups to which the multiple second characters belong and there is a group whose importance set for each group is less than a predetermined level, the information processing program causes a computer to execute a process of deriving one first density function for each of the second characters belonging to a group whose importance is equal to or greater than the predetermined level, and deriving one first density function for each of the groups whose importance is less than the predetermined level.

[0014] An information processing program of a ninth aspect is an information processing program of any one of the first to eighth aspects, in which, when there are multiple groups to which the multiple second characters belong, the information processing program causes a computer to execute a process of deriving the second density function and moving the first character to the second position using the second density function.

[0015] An information processing program of a 10th aspect is the information processing program of the 9th aspect, wherein when the group to which the multiple second characters belong is one group, the second position is a position away from the first position in the direction of movement of the group.

[0016] An information processing method of an eleventh aspect includes a computer that derives a second density function by combining first density functions that represent a density distribution according to the distance from the position of each of a first character located at a first position and a plurality of second characters located within a predetermined distance range from the first character located at a first position, and uses the second density function to move the first character to a second position having a lower density than the first position.

[0017] An information processing device of a twelfth aspect includes a processor, which derives a second density function that combines first density functions that represent a density distribution according to the distance from the position of each of multiple second characters that exist within a predetermined distance range from a first character that exists at a first position, and uses the second density function to move the first character to a second position that has a lower density than the first position. [Effects of the Invention]

[0018] According to the present disclosure, it is possible to prevent a first character from being surrounded by a plurality of second characters. [Brief explanation of the drawings]

[0019] [Figure 1] FIG. 2 is a block diagram illustrating an example of a hardware configuration of an information processing device. [Figure 2] FIG. 10 is a schematic plan view showing an example of the positioning of characters when a player character, an ally character, and an enemy character are engaged in battle. [Figure 3] FIG. 2 is a block diagram illustrating an example of a functional configuration of an information processing device. [Figure 4] FIG. 4 is a schematic plan view showing an example of a density distribution represented by a second density function. [Figure 5] FIG. 10 is a schematic plan view for explaining a process of deriving a second position using a second density function. [Figure 6] 10 is a flowchart showing an example of a destination derivation process according to the first embodiment. [Figure 7]FIG. 10 is a schematic plan view for explaining a process of deriving a first density function and a second density function according to the second embodiment. [Figure 8] 10 is a flowchart showing an example of a destination derivation process according to the second embodiment. [Figure 9] FIG. 10 is a schematic plan view for explaining a process of deriving a first density function and a second density function according to a modified example. [Figure 10] FIG. 11 is a schematic plan view for explaining the process of deriving the second position when the enemy character belongs to one group according to the third embodiment. [Figure 11] 11 is a flowchart showing an example of a destination derivation process according to the third embodiment. DETAILED DESCRIPTION OF THE INVENTION

[0020] Hereinafter, examples of embodiments for carrying out the technology of the present disclosure will be described in detail with reference to the drawings.

[0021] [First embodiment] First, the hardware configuration of an information processing device 10 according to this embodiment will be described with reference to Fig. 1. The information processing device 10 is, for example, a home game console, a portable game console, an arcade game console, a smartphone, a tablet terminal, a personal computer, etc. In this embodiment, as an example, a home game console will be described as the information processing device 10. The information processing device 10 is an example of a computer.

[0022] 1, the information processing device 10 includes a CPU (Central Processing Unit) 11, a memory 12, a storage 13, an external I / F (Interface) 14, a communication I / F 15, and an input I / F 16. The CPU 11, the memory 12, the storage 13, the external I / F 14, the communication I / F 15, and the input I / F 16 are connected to each other via a bus 20 so as to be able to communicate with each other.

[0023] The CPU 11 is a central processing unit that executes various programs and controls each part. The CPU 11 is an example of a processor. The memory 12 serves as a working area and temporarily stores programs or data. The storage 13 is composed of a storage device such as an HDD (Hard Disk Drive), an SSD (Solid State Drive), or a flash memory, and stores various programs and data.

[0024] The storage 13 stores an information processing program 30 for executing a predetermined game on the information processing device 10. The CPU 11 reads the information processing program 30 from the storage 13 and executes the information processing program 30 using the memory 12 as a work area. The information processing program 30 is not limited to being stored in the storage 13, but may be stored on a recording medium such as an optical disc, a USB (Universal Serial Bus) memory, or an SD memory card. The information processing program 30 may also be downloadable to the information processing device 10 via the communication I / F 15. The information processing program 30 may also be provided as a program product. The program product includes any type of product for providing a program. For example, the program product includes a program provided via a network such as the Internet, and a non-transitory computer-readable recording medium such as an optical disc on which a program is stored.

[0025] The external I / F 14 is an interface for connecting various external devices to the information processing device 10. In this embodiment, a speaker 21 and a display 22 are connected to the external I / F 14.

[0026] The speaker 21 outputs various sounds. The speaker 21 may be integrated with the information processing device 10, or may be integrated with the display 22. The display 22 is, for example, a liquid crystal display or an organic EL (Electro Luminescence) display, and displays various types of information. The display 22 may have an integrated touch panel. Furthermore, the display 22 may be integrated with the information processing device 10.

[0027] The communication I / F 15 is an interface for connecting the information processing device 10 to a network. The communication I / F 15 uses, for example, a wired communication standard such as Ethernet (registered trademark) or FDDI (Fiber Distributed Data Interface), or a wireless communication standard such as 4G, 5G, or Wi-Fi (registered trademark).

[0028] The input I / F 16 is an interface for connecting the input device 23 to the information processing device 10. The input device 23 is a game controller having operation buttons and directional keys, a mouse, a keyboard, or the like, and is used for various inputs. A user operates the game using the input device 23. Operation information indicating the content of the input operation performed by the user using the input device 23 is stored in the memory 12. The input device 23 may be integrated with the information processing device 10. Alternatively, the input device 23 may be detachable from the information processing device 10. The number of input devices 23 may be one or more. Alternatively, the input device 23 may be a touch panel integrated with the display 22. In this embodiment, an example in which a game controller is used as the input device 23 will be described.

[0029] The information processing device 10 according to this embodiment provides a game in which a character (hereinafter referred to as a "player character") operated by a player, who is a user of the information processing device 10, cooperates with an ally character to battle an enemy character. In this embodiment, an example will be described in which the ally character and the enemy character are NPCs (Non-Player Characters). A game is a collection of activities and rules for playing or competing. For example, a game is played by a player making full use of strategy and skill to achieve a specific objective. A game is played to achieve various objectives, for example, a competitive objective such as winning, a combat objective such as defeating an enemy, an educational objective such as learning, or a narrative objective such as completing the progression of a scenario. A game may be competitive or non-competitive.

[0030] As an example, in this embodiment, as shown in FIG. 2, a player character PC and multiple ally characters A form a group G1 called a unit. FIG. 2 also shows an example in which multiple enemy characters E1 form a group G2, and multiple enemy characters E2 form a group G3. Hereinafter, enemy characters E1 and E2 will be collectively referred to as enemy characters E. Characters belonging to the same group move in the same direction while maintaining a distance between each other below a certain value. In FIG. 2, arrow Y1 indicates the direction of movement of group G1, arrow Y2 indicates the direction of movement of group G2, and arrow Y3 indicates the direction of movement of group G3. While FIG. 2 shows an example in which group G1 fights two groups G2 and G3, group G1 may fight one group, or three or more groups.

[0031] In this case, the direction of movement of ally character A when attacked may differ depending on whether ally character A is attacked by enemy character E1 or enemy character E2, and this direction of movement may become unstable. In this case, the battle front of group G1 to which player character PC and ally character A belong becomes unstable.

[0032] Therefore, the information processing device 10 according to this embodiment has a function of deriving the movement direction of ally character A by using a density function, which will be described later.

[0033] Next, the functional configuration of the information processing device 10 will be described with reference to Fig. 3. As shown in Fig. 3, the information processing device 10 includes a derivation unit 40 and a movement control unit 42. The CPU 11 executes the information processing program 30, thereby functioning as the derivation unit 40 and the movement control unit 42.

[0034] The derivation unit 40 derives the movement direction of ally character A when ally character A is attacked by enemy character E. The movement direction here does not mean the direction in which ally character A autonomously moves, but the direction in which ally character A is pushed by the attack from enemy character E. Furthermore, the attacks here include close-range attacks using swords, bare hands, etc., long-range attacks using bows and arrows, crossbows, etc., and long-range attacks using magic, items, etc. Below, a specific example of the process of deriving the movement direction of ally character A by the derivation unit 40 will be described.

[0035] The derivation unit 40 derives a second density function that combines first density functions that represent density distributions according to distances from the positions of multiple enemy characters E that exist within a predetermined distance range from an ally character A that exists at a first position. The ally character A is an example of a first character related to the disclosed technology, and the enemy character E is an example of a second character related to the disclosed technology. The predetermined distance range may be a range of distances of a fixed value that is preset as a periphery of the ally character A, or may be a range according to the size of the ally character A, such as a predetermined multiple of the size of a predetermined part of the ally character A (for example, shoulder width).

[0036] In this embodiment, the derivation unit 40 uses a function expressed by the following formula (1) as the first density function. In formula (1), r represents the distance from the enemy character E. That is, the first density function according to this embodiment is a function that represents a density distribution in which the density decreases as the distance from the enemy character E increases, in other words, a density distribution in which the density increases as the distance from the enemy character E increases. In the first density function, the isosurface is a sphere centered on the position of the enemy character E. Note that the derivation unit 40 may use a function other than formula (1) that represents a density distribution according to the distance from the position of the enemy character E as the first density function.

[0037]

number

[0038] The derivation unit 40 according to this embodiment derives the second density function by adding up first density functions corresponding to each of a plurality of enemy characters E that exist within a predetermined distance from the ally character A. The shape represented by the isosurface of the second density function is called a metaball. Note that the derivation unit 40 may also derive the second density function by integrating the first density functions corresponding to each of a plurality of enemy characters E that exist within a predetermined distance from the ally character A.

[0039] Figure 4 shows an example of a density distribution represented by the second density function when three enemy characters E are present within a predetermined distance from ally character A. Curve C in Figure 4 represents a line connecting points of the same density above a certain value, with the outer lines connecting points of lower density. In the example of Figure 4, the density intervals between adjacent curves C are assumed to be equal.

[0040] Next, as shown in FIG. 5 , the derivation unit 40 derives a position in a direction closest to the first position from among positions with a specific density lower than the density of the first position represented by the second density function as a second position to which ally character A, who is present at the first position, should move. In FIG. 5 , the first position is the position of ally character A. In the example of FIG. 5 , the second position is indicated by point P as the second position from among positions with a density corresponding to the outermost curve C, which has a density lower than the density of the first position represented by the second density function. For example, the derivation unit 40 can use a predetermined algorithm, such as the steepest descent method, in the process of deriving the second position. Note that the second position may be closer to or farther from the first position than point P in the direction from the first position to point P.

[0041] Furthermore, the derivation unit 40 may derive, as the second position, the position where the density represented by the second density function is lowest within a range of a predetermined distance based on ally character A. In this case, the predetermined distance may be, for example, the upper limit of the distance that ally character A moves when attacked.

[0042] Furthermore, the derivation unit 40 may derive, as the second position, a position that is farther away from the first position as the density of the first position represented by the second density function increases. In this case, the closer ally character A is to the center of the group of multiple enemy characters E, the farther the second position to which ally character A moves will be from the first position.

[0043] When ally character A is attacked by enemy character E, the movement control unit 42 moves ally character A to the second position derived by the derivation unit 40 using the second density function.

[0044] Next, the operation of the information processing device 10 will be described with reference to Fig. 6. The CPU 11 executes the information processing program 30, thereby executing the destination derivation process shown in Fig. 6.

[0045] 6, the derivation unit 40 determines whether or not an enemy character E is present within a predetermined distance from an ally character A present at a first position. Step S10 is repeatedly executed until this determination is affirmative. If the determination in step S10 is affirmative, the process proceeds to step S12.

[0046] In step S12, the derivation unit 40 selects one enemy character E from among the enemy characters E present within a predetermined distance from the ally character A. When the processing of step S12 is repeatedly executed, the derivation unit 40 selects an enemy character E that has not been selected up to that point.

[0047] In step S14, the derivation unit 40 stores a first density function representing a density distribution according to the distance from the position of the enemy character E selected in step S12 in a predetermined area of ​​the memory 12. When the processing of step S14 is repeatedly executed, the derivation unit 40 stores the first density function in an area different from the first density function stored in the memory 12 up to that point.

[0048] In step S16, the derivation unit 40 determines whether or not there is an enemy character E that was not selected in step S12 among the enemy characters E that exist within a predetermined distance from the ally character A. If this determination is positive, the processing returns to step S12, and if this determination is negative, the processing proceeds to step S18.

[0049] In step S18, the derivation unit 40 derives a second density function by combining the first density functions stored in the memory 12 in step S14. In step S20, the derivation unit 40 derives, as a second position to which ally character A, who is present at the first position, should move, a position in the direction of a position closest to the first position among positions with a specific density lower than the density of the first position represented by the second density function derived in step S18.

[0050] In step S22, the movement control unit 42 determines whether or not ally character A has been attacked by enemy character E. If this determination is negative, the process returns to step S10, and if this determination is positive, the process proceeds to step S24. In step S24, the movement control unit 42 moves ally character A to the second position derived in step S20. When the processing of step S24 ends, the process returns to step S10.

[0051] When the processing of the above steps S10 to S24 is repeatedly executed, it is executed at a predetermined time interval, for example, once every predetermined number of frames.

[0052] As described above, according to this embodiment, the second position to which ally character A is to move is derived using a second density function that combines first density functions that represent density distributions according to distances from the positions of multiple enemy characters E. Therefore, the direction of movement of ally character A when attacked can be stabilized.

[0053] Furthermore, according to this embodiment, the second density function is used to move the ally character A to a second position where the density is lower than that of the first position. Therefore, it is possible to prevent the ally character A from being surrounded by multiple enemy characters E.

[0054] [Second embodiment] A second embodiment of the disclosed technology will be described below. Note that the hardware configuration of the information processing device 10 according to the second embodiment (see FIG. 1) is the same as that of the first embodiment, and therefore a description thereof will be omitted.

[0055] The functional configuration of the information processing device 10 will be described with reference to Fig. 3. Functional units having the same functions as those of the information processing device 10 according to the first embodiment will be denoted by the same reference numerals and will not be described again. As shown in Fig. 3, the information processing device 10 includes a derivation unit 40A and a movement control unit 42. The CPU 11 executes the information processing program 30, thereby functioning as the derivation unit 40A and the movement control unit 42.

[0056] When there are multiple groups to which multiple enemy characters E belong that exist within a predetermined distance from ally character A and the number of enemy characters E is equal to or greater than a threshold, the derivation unit 40A derives one first density function for each of the multiple groups. Then, the derivation unit 40A derives a second density function that combines the multiple first density functions corresponding to the multiple groups.

[0057] A specific example of the process of deriving the first density function and the second density function by the derivation unit 40A will be described with reference to Fig. 7. The example of Fig. 7 shows a case where three groups exist within a predetermined distance from ally character A: a group to which multiple enemy characters E1 belong, a group to which multiple enemy characters E2 belong, and a group to which multiple enemy characters E3 belong. Also, arrow Y1 in Fig. 7 indicates the direction of travel of the group to which enemy character E1 belongs, arrow Y2 indicates the direction of travel of the group to which enemy character E2 belongs, and arrow Y3 indicates the direction of travel of the group to which enemy character E3 belongs.

[0058] First, the derivation unit 40A derives, for each group, a rectangle whose four sides are the positions of the enemy characters E located outermost in each of a first axis direction along the group's traveling direction and a second axis direction perpendicular to the first axis direction. In the example of Fig. 7, the rectangle corresponding to the group to which enemy character E1 belongs is indicated by R1, the rectangle corresponding to the group to which enemy character E2 belongs is indicated by R2, and the rectangle corresponding to the group to which enemy character E3 belongs is indicated by R3.

[0059] Next, the derivation unit 40A derives an ellipse inscribed in the derived rectangle for each group. In the example of Fig. 7, the ellipse corresponding to the group to which enemy character E1 belongs is indicated by O1, the ellipse corresponding to the group to which enemy character E2 belongs is indicated by O2, and the ellipse corresponding to the group to which enemy character E3 belongs is indicated by O3.

[0060] The derivation unit 40A derives a density function corresponding to each of the groups, which is a density function according to the distance from the center of the derived ellipse and has an elliptical shape as the first density function. Note that the first density function may be a density function according to the distance from the center of a rectangle, such as that shown in the above formula (1).

[0061] The derivation unit 40A then derives a second density function by adding up the first density functions corresponding to the respective groups. Similarly to the derivation unit 40 according to the first embodiment, the derivation unit 40A derives a second position using the second density function.

[0062] Next, the operation of the information processing device 10 will be described with reference to Fig. 8. The CPU 11 executes the information processing program 30, thereby executing the destination derivation process shown in Fig. 8. Note that steps in Fig. 8 that execute the same processes as those in Fig. 6 are given the same reference numerals, and their description will be omitted.

[0063] If the determination in step S10 of Fig. 8 is positive, the processing proceeds to step S30. In step S30, the derivation unit 40A determines whether there are multiple groups to which multiple enemy characters E belong that exist within a predetermined distance from the ally character A, and whether the number of enemy characters E is equal to or greater than a threshold. If this determination is negative, steps S12 to S24 are executed as in the first embodiment. If the determination in step S30 is positive, the processing proceeds to step S32.

[0064] In step S32, the derivation unit 40A selects one population from the plurality of populations. When the process of step S32 is repeatedly executed, the derivation unit 40A selects a population that has not been selected up to that point. In step S34, the derivation unit 40A derives one first density function for the population selected in step S32, as described above.

[0065] In step S36, the derivation unit 40A stores the first density function derived in step S34 in a predetermined area of ​​the memory 12. When the process of step S36 is repeatedly executed, the derivation unit 40A stores the first density function in an area different from the first density function stored in the memory 12 up to that point.

[0066] In step S38, the derivation unit 40A determines whether or not there is a group that has not been selected in step S32 among the groups to which the enemy character E, who is present within a predetermined distance from the ally character A, who is present at the first position, belongs. If this determination is affirmative, the process returns to step S32, and if this determination is negative, the process proceeds to step S18.

[0067] As described above, according to this embodiment, it is possible to achieve the same effects as in Embodiment 1. Furthermore, according to this embodiment, since one first density function is derived for each of a plurality of groups, it is possible to reduce the amount of calculation compared to when one first density function is derived for each enemy character E.

[0068] As shown in Figure 9, when there are multiple groups to which multiple enemy characters E belong and the distance D between the virtual camera 25 corresponding to the player's field of view in the virtual space and the ally character A is equal to or greater than a threshold, the derivation unit 40A may derive one first density function for each of the multiple groups.

[0069] Furthermore, when there are multiple groups to which multiple enemy characters E belong, and there are groups whose importance levels set for each group are less than a predetermined level, the derivation unit 40A may derive one first density function for each enemy character E for enemy characters E that belong to groups whose importance levels are equal to or greater than the predetermined level, as in the first embodiment. In this case, the derivation unit 40A may derive one first density function for each group for groups whose importance levels are less than the predetermined level, as in the second embodiment.

[0070] [Third embodiment] A third embodiment of the disclosed technology will be described below. Note that the hardware configuration of the information processing device 10 according to the third embodiment (see FIG. 1) is the same as that of the first embodiment, and therefore a description thereof will be omitted.

[0071] The functional configuration of the information processing device 10 will be described with reference to Fig. 3. Functional units having the same functions as those of the information processing device 10 according to the first embodiment will be denoted by the same reference numerals and will not be described again. As shown in Fig. 3, the information processing device 10 includes a derivation unit 40B and a movement control unit 42. The CPU 11 executes the information processing program 30, thereby functioning as the derivation unit 40B and the movement control unit 42.

[0072] The derivation unit 40B derives a second density function in the same manner as the derivation unit 40 of the first embodiment when there are multiple groups to which multiple enemy characters E belong that are located within a predetermined distance from an ally character A located at a first position.

[0073] 10, when a group G2 is formed of multiple enemy characters E1 that exist within a predetermined distance from an ally character A that exists at a first position, the derivation unit 40B derives, as the second position, a position that is distant from the first position in the traveling direction of the group G2. In the example of FIG. 10, an arrow Y2 indicates the traveling direction of the group G2. In this case, the distance from the first position to the second position may be a preset fixed value, or may be a value that increases as the strength of the enemy character E1's attack increases.

[0074] Next, the operation of the information processing device 10 will be described with reference to Fig. 11. The CPU 11 executes the information processing program 30, thereby executing the destination derivation process shown in Fig. 11. Note that steps in Fig. 11 that execute the same processes as those in Fig. 6 are given the same reference numerals, and their description will be omitted.

[0075] If the determination in step S10 of Fig. 11 is positive, the processing proceeds to step S40. In step S40, the derivation unit 40B determines whether or not the group to which the multiple enemy characters E present within a predetermined distance from the ally character A present at the first position belong is one group. If this determination is negative, steps S12 to S24 are executed as in the first embodiment. If the determination in step S40 is positive, the processing proceeds to step S42.

[0076] In step S42, as described above, the derivation unit 40B derives, as the second position, a position that is away from the first position in the traveling direction of the group to which the enemy character E belongs. When the processing of step S42 ends, the processing proceeds to step S22.

[0077] As described above, according to this embodiment, it is possible to achieve the same effects as in Embodiment 1. Furthermore, according to this embodiment, when there is one group, the second position is derived without using a density function, and therefore the amount of calculation can be reduced compared to when a density function is used.

[0078] In the above embodiments, the CPU 11 derives the second position to which the ally character A is to move, but the disclosed technology is not limited to this. The CPU 11 may also derive the second position to which the player character PC is to move. In this example, the player character PC is an example of a first character related to the disclosed technology, and the enemy character E is an example of a second character related to the disclosed technology.

[0079] Alternatively, the CPU 11 may derive a second position to which the enemy character E is to move. In this embodiment, the enemy character E is an example of a first character related to the disclosed technology, and the player character PC and the ally character A are examples of a second character related to the disclosed technology.

[0080] Furthermore, in each of the above embodiments, a case where the second position to which ally character A should move when attacked is described, but the disclosed technology is not limited to this. A configuration in which the CPU 11 derives the second position to which ally character A should move when ally character A moves autonomously may also be adopted. In this configuration example, ally character A can be positioned to prevent being captured by enemy character E.

[0081] Alternatively, the CPU 11 may derive a second position to which the enemy character E will move when it moves autonomously. In this embodiment, the enemy character E is an example of a first character according to the disclosed technology, and the player character PC and the ally character A are examples of second characters according to the disclosed technology.

[0082] Furthermore, various processes executed by the CPU 11 after reading software (programs) in the above embodiments may be executed by various processors other than a CPU. Examples of such processors include programmable logic devices (PLDs) whose circuit configuration can be changed after fabrication, such as field-programmable gate arrays (FPGAs), and dedicated electrical circuits, such as application-specific integrated circuits (ASICs), which are processors with circuit configurations specifically designed to execute specific processes. Furthermore, various processes may be executed by one of these various processors, or by a combination of two or more processors of the same or different types (e.g., multiple FPGAs, or a combination of a CPU and an FPGA). Furthermore, the hardware structure of these various processors is, more specifically, an electrical circuit that combines circuit elements such as semiconductor devices. [Explanation of symbols]

[0083] 10. Information processing equipment 11 CPU 30 Information Processing Program 40, 40A, 40B Derivation part 42 Movement control unit

Claims

1. deriving a second density function that combines first density functions that represent density distributions according to distances from the positions of a plurality of second characters that exist within a predetermined distance range from a first character that exists at a first position; Using the second density function, move the first character to a second position that is less dense than the first position. An information processing program that causes a computer to execute a process.

2. When the first character is attacked by the second character, the first character is moved to the second position using the second density function.

2. The information processing program according to claim 1, for causing a computer to execute processing.

3. The second position is a position in a direction of a position closest to the first position among positions with a specific density that is lower than the density of the first position represented by the second density function.

3. The information processing program according to claim 1.

4. The second position is a position where the density represented by the second density function is lowest within a range of a predetermined distance from the first character.

3. The information processing program according to claim 1.

5. The higher the density of the first position represented by the second density function, the longer the distance between the second position and the first position.

3. The information processing program according to claim 1.

6. When there are a plurality of groups to which the plurality of second characters belong and the number of the second characters is equal to or greater than a threshold, deriving one of the first density functions for each of the plurality of groups; deriving the second density function by combining the first density functions corresponding to the plurality of populations, respectively; 3. The information processing program according to claim 1, for causing a computer to execute processing.

7. When there are a plurality of groups to which the plurality of second characters belong, and the distance between the first character and a virtual camera corresponding to a field of view of a player in the virtual space is equal to or greater than a threshold, deriving one first density function for each of the plurality of groups; deriving the second density function by combining the first density functions corresponding to the plurality of populations, respectively; 3. The information processing program according to claim 1, for causing a computer to execute processing.

8. When there are a plurality of groups to which the plurality of second characters belong, and when there is a group whose importance set for each group is less than a predetermined level, one first density function is derived for each of the second characters belonging to a group whose importance is equal to or greater than the predetermined level, and one first density function is derived for each of the groups whose importance is less than the predetermined level.

3. The information processing program according to claim 1, for causing a computer to execute processing.

9. If there are a plurality of groups to which the plurality of second characters belong, deriving the second density function, and moving the first character to the second position using the second density function.

3. The information processing program according to claim 1, for causing a computer to execute processing.

10. When the group to which the plurality of second characters belong is one group, the second position is a position away from the first position in the moving direction of the group. The information processing program according to claim 9.

11. deriving a second density function that combines first density functions that represent density distributions according to distances from the positions of a plurality of second characters that exist within a predetermined distance range from a first character that exists at a first position; Using the second density function, move the first character to a second position that is less dense than the first position. An information processing method in which processing is performed by a computer.

12. a processor, the processor comprising: deriving a second density function that combines first density functions that represent density distributions according to distances from the positions of a plurality of second characters that exist within a predetermined distance range from a first character that exists at a first position; Using the second density function, move the first character to a second position that is less dense than the first position. Information processing device.

Images