Program, computer system and game system
The program addresses player stagnation by allowing relocation when stuck, enhancing gameplay interest through dynamic path changes.
Patent Information
- Application Number
- JP2020164762
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2020-09-30
- Publication Date
- 2024-11-20
- Estimated Expiration
- 2040-09-30
AI Technical Summary
Players in games often encounter situations where they become stuck due to dead ends or being surrounded by enemies, leading to a lack of progression and loss of interest.
A program that includes a predicament determination unit to identify when a player character is stuck, allowing relocation to a new position via warp activation when certain conditions are met, with constraints on relocation frequency, timing, or item consumption.
Enables players to continue the game by relocating to a new position, enhancing game interest by providing alternative paths and improving gameplay dynamics.
Smart Images

Figure 0007587385000001 
Figure 0007587385000002 
Figure 0007587385000003
Abstract
Description
[Technical field]
[0001] The present invention relates to a program for executing a game. [Background technology]
[0002] Conventionally, games in which a player enjoys moving and operating an operating object such as a character are known. For example, a game is known in which the player moves through a maze-like passage, collects items, and proceeds while avoiding or fighting enemies encountered. There is also a game in which the player forms a passage and fights against enemy characters that invade (see Patent Document 1). [Prior art documents] [Patent documents]
[0003] [Patent Document 1] JP 2016-67819 A Summary of the Invention [Problem to be solved by the invention]
[0004] Incidentally, the above-mentioned character's passage may be set with a dead end that the character cannot proceed through. Also, the passage may be blocked during the game process, and become a dead end there. In a game in which the player must escape from an enemy, the vicinity of such a dead end is likely to lead to a predicament. This is because the player cannot pass through the dead end, and if an enemy comes from the other side, the player will be caught in between. In addition, even if it is not a dead end, all possible directions of movement may be surrounded by enemies. In either case, the player has no way to escape, and the game is in a so-called "stuck" state. Or, although there is a possible direction to pass through, there is an area or a pitfall that steals vitality points ahead, so that the player is at a disadvantage no matter which direction he proceeds in, and he may be in a predicament.
[0005] Therefore, an object of the present invention is to provide a technique that can increase the interest of a game by allowing a new game development to occur when a player character finds himself in a difficult position regarding his movement. [Means for solving the problem]
[0006] A first invention for solving the above problem is a program for causing a computer system to execute movement control of a player character in a given game space based on a player's movement operation, the program causing the computer system to function as a judgment means (e.g., a crises judgment unit 231 in FIG. 13) for judging whether or not a crises condition set as a condition indicating that the player character has reached a crises related to movement is satisfied, and a rearrangement control means (e.g., a rearrangement control unit 233 in FIG. 13) for performing rearrangement control to rearrange the player character to a given rearrangement position when a given warp activation condition is satisfied, the rearrangement control means including at least a positive judgment by the judgment means.
[0007] According to the first aspect of the present invention, when at least a predicament condition indicating that the player character is in a predicament regarding movement is satisfied, the warp activation condition is satisfied, and the player character can be relocated to a given relocation position. This makes it possible for the player character to warp to another location that is the relocation position and proceed with the game from there, even if the player character is in a predicament regarding movement, thereby making it possible to improve the entertainment value of the game.
[0008] A second aspect of the present invention is the program according to the first aspect of the present invention, wherein the predicament condition includes a state of impasse regarding the direction of movement of the player character.
[0009] According to the second aspect of the present invention, when the player is stuck in the direction of movement, it can be determined that the predicament condition is met.
[0010] A third invention is a program of the second invention, in which the determination means determines whether a state in which all selectable directions for the player character's movement are blocked by enemy characters and / or a given dead end satisfies the predicament condition.
[0011] According to the third invention, a blocked state in which the player character is surrounded by enemy characters or a dead end is regarded as a deadlock state, and a predicament condition can be determined.
[0012] In addition, a fourth invention is a program of any of the first to third inventions for causing the computer system to function as a notification control means (e.g., the predicament notification control unit 235 in Figure 13) that performs control to notify of a positive judgment made by the judgment means.
[0013] According to the fourth invention, it is possible to notify the player that a predicament condition has been met.
[0014] A fifth invention is a program of any one of the first to fourth inventions, in which the rearrangement control means performs the rearrangement control when the warp activation condition is that a positive judgment is made by the judgment means and a specified operational input is made.
[0015] According to the fifth aspect of the present invention, when a distress condition is met and the player performs a predetermined operational input, it is determined that the warp activation condition is met, and rearrangement control of the player character can be performed.
[0016] In addition, a sixth invention is a program of any of the first to fifth inventions, wherein the rearrangement control means determines the rearrangement position according to a character situation based on a status and / or movement speed of the player character.
[0017] According to the sixth aspect, the rearrangement position can be determined according to the character status of the player character.
[0018] In addition, a seventh invention is a program of any of the first to sixth inventions, wherein the rearrangement control means determines as the rearrangement position a position where the positional situation of at least any of an enemy character, an ally character, and a specified game object satisfies a given positional situation condition.
[0019] According to the seventh aspect of the present invention, the rearrangement position can be determined based on the arrangement of predetermined game objects such as enemy characters, ally characters, and items in the game space.
[0020] In addition, an eighth invention is a program of any of the first to seventh inventions, wherein the rearrangement control means determines as the rearrangement position a position where a character situation based on the status and / or movement speed of an enemy character and / or an ally character satisfies a given character situation condition.
[0021] According to the eighth aspect of the invention, the rearrangement positions can be determined based on the character states of the enemy characters and ally characters in the game space.
[0022] A ninth invention is a program of any of the first to eighth inventions, wherein a plurality of rearrangement candidate positions are preset in the game space, and the rearrangement control means determines the rearrangement position by selecting one of the rearrangement candidate positions.
[0023] According to the ninth aspect, one of the preset rearrangement candidate positions can be selected as the rearrangement position.
[0024] In addition, a tenth invention is a program of any of the first to ninth inventions, wherein the rearrangement control means, when there is a corresponding position previously associated with the position of the player character in the deadlock state, determines the corresponding position as the rearrangement position.
[0025] According to the tenth aspect of the present invention, a corresponding position is associated with a predetermined position in the game space, and when the player character becomes stuck at a predetermined position, it is possible to warp the character to the corresponding position and reposition it.
[0026] In addition, an eleventh invention is a program of any of the first to tenth inventions, in which the rearrangement control means changes the character situation based on the status and / or movement speed of the player character, and makes the character appear at the rearrangement position.
[0027] According to the eleventh aspect, when the player character is made to appear at the rearrangement position, the character state can be changed.
[0028] In addition, a twelfth invention is a program of any of the first to eleventh inventions, in which constraint conditions are set in advance based on at least one of the number of times the rearrangement control is possible, the timing, the ability parameter values to be consumed, and the items to be consumed, and the rearrangement control means makes a judgment by including the constraint conditions in the warp activation conditions.
[0029] According to the twelfth aspect of the invention, it is possible to limit the number of times or the time when rearrangement control is performed, or to perform rearrangement control in exchange for consuming ability parameter values or consuming items.
[0030] In addition, a thirteenth invention is a program of any one of the first to twelfth inventions for causing the computer system to function as a rearrangement position display control means (e.g., rearrangement position display control unit 237 in Figure 13) that performs control to display the rearrangement position in an identifiable manner when a positive judgment is made by the judgment means.
[0031] According to the thirteenth aspect, when a distress condition is met, the rearrangement position can be identifiably displayed and presented to the player.
[0032] A fourteenth invention is a computer system which executes movement control of a player character in a given game space based on a player's movement operation, the computer system comprising: a judgment means for judging whether or not a distress condition set as a condition indicating that the player character has reached a distress situation regarding movement is satisfied; and a rearrangement control means for performing rearrangement control to make the player character appear at a given rearrangement position when a given warp activation condition is satisfied, the warp activation condition including at least a positive judgment by the judgment means.
[0033] According to the fourteenth aspect, it is possible to realize a computer system that provides the same effects as the first aspect.
[0034] A fifteenth aspect of the present invention is a game system (e.g., game system 1000 in FIG. 1) including a server system (e.g., server system 1100 in FIG. 1) which is the computer system of the fourteenth aspect of the present invention, and an operation terminal (e.g., operation terminal 1500 in FIG. 1) on which a player plays the game.
[0035] According to the fifteenth aspect, a game system that provides the same effects as the first aspect can be realized. [Brief description of the drawings]
[0036] [Figure 1] FIG. 1 is a diagram showing an example of the overall configuration of a game system. [Diagram 2] FIG. 2 is a diagram showing an example of the device configuration of an operation terminal. [Diagram 3] FIG. 1 is a diagram showing an example of a game space. [Figure 4] FIG. 13 is a diagram showing an example of a game screen. [Diagram 5] FIG. 13 is a diagram showing an example corresponding to a deadlock state. [Figure 6] FIG. 13 is a diagram showing another example corresponding to a deadlock state. [Figure 7] FIG. 13 is a diagram showing an example that does not fall into the deadlock state. [Figure 8] A diagram showing an overview of the placement situation conditions and character situation conditions. [Figure 9] 6A to 6C are diagrams for explaining acquisition of the placement status of enemy characters and items. [Figure 10] FIG. 13 is a diagram showing an example of a notification that a predicament determination has been made positive. [Figure 11] FIG. 13 is a diagram showing an example of identification display of a rearrangement position. [Figure 12] 13A and 13B are diagrams showing examples of the visual display of the warp movement of a player character; [Figure 13] FIG. 2 is a block diagram showing an example of the functional configuration of the server system. [Figure 14] FIG. 4 is a diagram showing an example of the data structure of play data. [Figure 15] FIG. 4 is a block diagram showing an example of a functional configuration of an operation terminal. [Figure 16] 6 is a flowchart showing a process flow in the server system. [Figure 17] FIG. 13 is a diagram showing a modified example of the deadlock state. [Figure 18] FIG. 11 is a diagram showing an example of a functional configuration of an operation terminal in Modification 2. [Figure 19] 13A and 13B are diagrams showing modified examples of a state in which the player character is in a difficult position with respect to movement. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0037] Hereinafter, an example of a preferred embodiment of the present invention will be described with reference to the drawings. Note that the present invention is not limited to the embodiment described below, and the form to which the present invention can be applied is not limited to the following embodiment. In addition, in the description of the drawings, the same parts are given the same reference numerals.
[0038] [Overall configuration] Fig. 1 is a diagram showing an example of the overall configuration of a game system 1000 in this embodiment. As shown in Fig. 1, the game system 1000 includes a server system 1100, which is a computer system, and an operation terminal 1500 owned by a player (user) 2 of the game in this embodiment, which are connected to each other via a network N so as to be able to communicate data with each other.
[0039] The network N refers to a communication path that allows data communication. In other words, the network N includes a dedicated line (dedicated cable) for direct connection, a LAN (Local Area Network) using Ethernet (registered trademark), etc., as well as a telephone communication network, a cable network, the Internet, and other communication networks, and the communication method can be either wired or wireless.
[0040] The server system 1100 includes a main device 1101, a keyboard 1106, a touch panel 1108, and a storage 1140. The main device 1101 includes a built-in control board 1150 on which are mounted various electronic components such as a CPU (Central Processing Unit) 1151, a GPU (Graphics Processing Unit), a DSP (Digital Signal Processor), etc., various IC memories 1152 such as a VRAM, a RAM, a ROM, etc., and a communication device 1153. Note that a part or the whole of the control board 1150 may be realized by an ASIC (Application Specific Integrated Circuit), an FPGA (Field-programmable gate array), or a SoC (System on a Chip).
[0041] This server system 1100 realizes a user management function related to user registration and the like, and a game management function that provides data necessary for playing a game on the operation terminal 1500 and manages execution control of the game on the operation terminal 1500, by the CPU 1151 and the like performing calculations based on predetermined programs and data. In other words, the game in this embodiment is realized as a kind of client-server type online game. Player 2 accesses the server system 1100 with his / her own operation terminal 1500, logs in with an issued account, and enjoys the game of this embodiment.
[0042] 1, the server system 1100 may be configured to include multiple blade servers each assigned to one function, and connected to each other via an internal bus for data communication. Alternatively, the server system 1100 may be configured to function as a whole as multiple independent servers installed at separate locations communicating data via a network N.
[0043] The operation terminal 1500 is a computer system that functions as a man-machine interface, and is connected to the network N via a mobile phone base station or a wireless communication base station, etc., and can perform data communication with the server system 1100. This operation terminal 1500 can take the form of, for example, a smartphone, a mobile phone, a portable game device, a stationary home game device, a controller for a stationary home game device, an arcade game device, a personal computer, a tablet computer, a wearable computer, etc.
[0044] Fig. 2 is a diagram showing an example of the device configuration of a smartphone, which is an example of the operation terminal 1500. As shown in Fig. 2, the operation terminal 1500 includes a direction input key 1502, a home key 1504, a touch panel 1506 that functions as an image display device and a contact position input device, a built-in battery 1509, a speaker 1510, a microphone 1512, a control board 1550, and a memory card reader 1542 that can read and write data to a memory card 1540 that is a computer-readable storage medium. In addition, a power button, a volume control button, a vibrator that is a vibration generating device, and the like, which are not shown, are also provided.
[0045] The control board 1550 is equipped with various microprocessors such as a CPU 1551, a GPU, and a DSP, various IC memories 1552 such as a VRAM, a RAM, and a ROM, and a wireless communication module 1553 for wireless communication with a mobile phone base station or a wireless LAN base station connected to the network N. The control board 1550 is also equipped with a so-called I / F circuit (interface circuit) 1557, such as a circuit for receiving signals from the direction input key 1502 and the home key 1504, a driver circuit for the touch panel 1506, an output amplifier circuit for outputting a sound signal to the speaker 1510, an audio signal generating circuit for generating a signal of the sound collected by the microphone 1512, and a signal input / output circuit for the memory card reader 1542. Each of these elements mounted on the control board 1550 is electrically connected to each other via a bus circuit or the like, and is connected so as to be able to read and write data and transmit and receive signals. Note that a part or all of the control board 1550 may be configured with an ASIC, an FPGA, or an SoC.
[0046] In this control board 1550, a game client program and various setting data required for executing this game client program are stored in IC memory 1552. The game client program and the like are downloaded from server system 1100 at an appropriate timing. Alternatively, the game client program and the like may be read from a separately obtained storage medium such as memory card 1540. Then, CPU 1551 and the like execute the game client program to perform calculation processing, and control each part of operation terminal 1500 in response to operational inputs to touch panel 1506, directional input keys 1502, and home key 1504, thereby enabling player 2 to play the game.
[0047] The game of this embodiment is a game in which the player operates a character to aim to clear the game, and the game is cleared when a predetermined achievement condition is met. The achievement condition can be set appropriately, for example, such as collecting all the bait described below, reaching a predetermined number of baits, reaching a set goal point, reaching a predetermined number of defeated enemy characters, defeating a given enemy character, etc. Alternatively, the condition for clearing the game may be that the time limit has elapsed without the game being over.
[0048] FIG. 3 is a diagram showing an example of a game space. In this embodiment, the game space is composed of a plurality of (three in FIG. 3) floors F (F-1 to F-3), and the player character 12 can move between floors by passing through entrances D (D-1 to D-6) provided on each floor. Specifically, as shown by the dashed arrows in FIG. 3, the entrance D-1 of the lower floor F-1 communicates with the entrance D-6 of the upper floor F-3, the entrance D-2 communicates with the entrance D-3 of the middle floor F-2, and the entrance D-4 of the middle floor F-2 communicates with the entrance D-5 of the upper floor F-3. In this embodiment, only the player character 12 can pass through the entrance D, and it is a dead end for the enemy character 13. In other words, the enemy character 13 cannot move between floors F. However, the enemy character 13 may also be able to pass through the entrance D like the player character 12.
[0049] Each floor F has a maze-like layout, and constitutes a game stage with a different level of difficulty. In this embodiment, the difficulty level increases as the floor F increases. Specifically, the higher the floor F, the more complex the maze structure and the greater the number of enemy characters 13. It is also possible to adjust the difficulty level by changing the type of enemy character for each floor F, such as making the enemy characters appear stronger on the higher floor F. For example, different types of enemy characters with different movement speeds are prepared, and enemy characters with faster movement speeds are made to appear on the higher floor F. In addition, the movement speed of the enemy characters 13 is set to be faster on the higher floor F. In addition, the number of bait 14 and power bait 15 (see FIG. 4), which are items placed at the start of the game, and the type and number of special items appearing during the game are also different for each floor F.
[0050] 4 is a diagram showing an example of a game screen when the player character 12 is on the lower floor F-1. As shown in FIG. 4, the game screen includes a game image display section 10, a score display section 40, a remaining life display section 50, and a floor display section 60.
[0051] The game image display section 10 displays an image (game image) of the game stage of the floor F on which the player character 12 is currently located.
[0052] The score display unit 40 displays the player's game score, which is calculated from time to time while the game is being played. The game score is added when various items (game objects) such as the bait 14 and the power bait 15 are acquired. In this embodiment, a unit score is set for the bait 14, and each time the player character 12 acquires the bait 14, the unit score is added to the game score. The game score is also added when the enemy character 13 is defeated. For example, when the enemy character 13 is defeated, a predetermined additional score is added to the game score. The player operates the player character 12 to collect the bait 14 while defeating the enemy character 13, aiming to clear the game.
[0053] In this embodiment, the player inputs a movement direction as an operation of the player character 12. The operation of the player character 12 is performed by a slide operation (also called a flick operation, a swipe operation, or the like) in which the game screen (touch panel 1506) is touched and the touched position is slid. Specifically, the player inputs the movement direction by performing a slide operation in four directions, "up," "down," "left," and "right," along the vertical and horizontal directions shown in FIG. 4 of the game screen. However, the movement direction may also be input by the direction input key 1502.
[0054] The remaining number of player characters 12 (remaining lives) that the player can use in the current game (3 in the example of FIG. 4) is displayed on the remaining life display section 50. For example, at the start of the game, a predetermined number (e.g., 4) of player characters 12 are given to the player. In addition, new player characters 12 are given during the game when a predetermined condition is met, for example, when the game score reaches a predetermined value.
[0055] The floor F on which the player character 12 is currently located is displayed on the floor display section 60. In the example of Fig. 4, the lowest floor is hatched, indicating that the player character 12 is on the lower floor F-1.
[0056] Here, the game of this embodiment will be described in detail with reference to the display contents of the game image display unit 10 shown in Fig. 4. First, the game stage is configured by arranging a player character 12, an enemy character 13, and various items such as food 14 and power food 15 on a passage 11 forming a maze. Fig. 4 shows the initial arrangement of the characters and items at the start of the game.
[0057] The passage 11 is configured to be wide enough for one of the characters (the player character 12 or the enemy character 13) to pass through, and the characters cannot pass each other without touching each other.
[0058] The passage 11 includes a dead-end point Pe of the passage 11, which is surrounded by a dashed line. In addition, the end of the passage 11 leading to the outside of the frame of the game image display unit 10, which is surrounded by a dashed line in Fig. 4, is an entrance D (entrances D-1 and D-2 in Fig. 4) leading to another floor F, and the corresponding entrance D (D-6 and D-3; see Fig. 3) of the destination floor F is set in advance. Therefore, when the player character 12 reaches the entrance D, the display on the game image display unit 10 switches to the display of the destination floor F, and the player character 12 appears near the corresponding entrance D of the floor F.
[0059] The enemy character 13 is computer-controlled to move along the passage 11 from the nest 18 as a starting point and to pursue the player character 12. In this embodiment, all the enemy characters 13 are of the same type, but enemy characters with different appearances or movement characteristics (for example, movement speed, pursuit movement pattern, etc.) may be included.
[0060] The bait 14 and the power bait 15 are arranged along the passage 11. In this embodiment, the entire passage 11 is divided in advance into invisible squares at equal intervals, and each square is determined as a placement position for an item. Then, prior to the start of the game, the bait 14 and the power bait 15 are placed at each placement position. Also, in this embodiment, a special item appears at a predetermined placement position during the game.
[0061] Examples of the special item include an item that adds bonus points to the game score when the special item is acquired, and an item that gives a predetermined number of new player characters 12 (remaining lives). In addition, if the game is such that various ability parameter values, including values that change with the progress of the game such as hit points (HP), magic points (MP), and stamina values, are set for the player characters, the special items may include items that strengthen or recover the parameter values. In this embodiment, the special items include an obstacle item 16 (see FIG. 17) that can place an obstacle (e.g., a wall or a rock) on the passage 11 to make it impassable, and a treasure chest item that randomly selects one of the various special items exemplified and gives it to the player. The special items may be configured to be available for purchase by paying a separate fee.
[0062] In this embodiment, in order to place these items, initial item placement data 521 (see FIG. 13) relating to the initial placement of items and an item appearance table 523 (see FIG. 13) relating to control of the appearance of special items are prepared in advance.
[0063] The item initial placement data 521 is a data table that sets the bait 14 or the power bait 15 as the item type of the item to be placed for each placement position where the item is to be placed at the start of the game. The server system 1100 places the bait 14 or the power bait 15 on the passage 11 in accordance with the item initial placement data 521 at the start of the game.
[0064] The item appearance table 523 is a data table that sets the type of special item and its appearance timing for each placement position where the special item is to appear during the game. The appearance timing specifies the time when the special item is to appear. For example, the appearance timing can be set to when a predetermined time has passed since the start of the game, when a predetermined number of baits 14 have been acquired, when a predetermined number of enemy characters 13 have been defeated, etc. During the game, the server system 1100 monitors the arrival of the appearance timing by referring to the item appearance table 523. If there is a special item whose appearance timing has come, the appearance of the special item is controlled by placing it at the placement position.
[0065] The player moves the player character 12 along the passage 11 while avoiding contact with the enemy character 13, and collects food 14, power food 15, and special items by passing through the locations where these are located. If the player character 12 accidentally comes into contact with the enemy character 13, the player character 12 is defeated by the enemy character 13 and disappears. On the other hand, when the player character 12 is defeated, if the player has any remaining lives, the number of remaining lives is reduced by one, and the player character 12 is placed again at the initial placement position. When the player runs out of remaining lives, the game is over for that player.
[0066] Here, the power bait 15 is an item that weakens the enemy character 13. In this embodiment, when the player character 12 obtains the power bait 15, the enemy character 13 changes from a "normal state" to a "weakened state" for a predetermined weakening time. When the weakening time has elapsed since the acquisition of the power bait 15, the enemy character 13 returns to the normal state. The normal state and the weakened state are distinguished from each other by changing the form, such as the color, shape, pattern, etc., or the facial expression of the enemy character 13, or by adding a mark indicating each state.
[0067] Then, when the player character 12 comes into contact with the weakened enemy character 13, it is possible to defeat the enemy character 13. The defeated enemy character 13 returns to the nest 18 and waits for a certain period of time, after which it revives and resumes the pursuit action.
[0068] In summary, the player moves the player character 12 along the passage 11 by inputting the movement direction, and collects food 14 and the like while avoiding the enemy characters 13. In addition, if there are any special items that can be used among the acquired items, they can be used appropriately. Then, the player aims to clear the game by having the player character 12 come into contact with the enemy character 13, which has been weakened by acquiring the power food 15, and defeating it.
[0069] [detail] In this embodiment, the server system 1100 judges whether or not a distress condition is met (hereinafter referred to as "distress judgment") during execution of the game described above (distress judgment process). Then, in accordance with the result of the distress judgment, it performs rearrangement control and warps the player character 12 (rearrangement control process). In addition, the server system 1100 performs control to notify a player of a distress judgment that has been affirmatively judged (distress notification control process), control to identifiably display the rearrangement position of the player character 12 (rearrangement position display control process), and control to display the appearance of the warp movement of the player character 12 to the rearrangement position (warp performance control process).
[0070] 1. Crisis Judgment In the predicament determination process, the server system 1100 performs a predicament determination as to whether or not a predicament condition set as a condition indicating that the player character 12 has reached a predicament regarding movement is satisfied. The predicament condition is "the action of the player character 12 has been restricted." As an example, in this embodiment, the predicament condition is "the player character 12 has reached a deadlock in the movement direction." Specifically, the predicament condition is determined to be "a case in which all directions selectable as the movement direction of the player character 12 are in a blocked state surrounded by enemy characters 13 and / or a given dead end" and whether or not the predicament condition is satisfied. FIGS. 5 and 6 are diagrams showing examples corresponding to the deadlock state. On the other hand, FIG. 7 is a diagram showing an example not corresponding to the deadlock state.
[0071] First, in the example of Fig. 5, the player character 12 cannot move to the "right" direction, which is one of the moving directions of "up," "down," "left," and "right," because there is a wall. Furthermore, enemy characters 13 exist in all other directions, and the player character 12 is in a blocked state surrounded by the enemy characters 13. Next, in the example of Fig. 6, the player character 12 is at a dead-end point Pe, so he can only move to the "left," but there is an enemy character 13 on the left, and the player character 12 is in a blocked state surrounded by the enemy character 13 and the dead end. Furthermore, in the blocked state shown in each example, there are enemy characters 13 in all directions in which the player character 12 can move, so there is nothing the player can do, and it can be said that the player is stuck.
[0072] In contrast, in the example of FIG. 7, there are enemy characters 13 in all directions in which the player character 12 can move: "up," "down," and "left." However, because there is a T-junction in front of the enemy character 13, the player character 12 can move "down." For this reason, this does not constitute an impasse. Also, as will be described in detail below, the enemy character 13 in the upper direction is more than five squares away from the placement position indicated by the arrow in FIG. 7, so this also does not constitute an impasse.
[0073] Specifically, in the predicament determination process, first, a direction selectable as a moving direction from the current position of the player character 12 is identified. Then, for each of the identified moving directions, it is determined whether or not there is a dead end. For the determination, squares, which are the arrangement units of the above-mentioned items, are used. That is, for example, if there is a dead end point Pe between the position of the player character 12 and a predetermined number of squares (for example, a maximum of five squares as indicated by an arrow in Figs. 5 to 7) in the moving direction, and there is no passage 11 leading to another direction before that, or if there is an enemy character 13 before that number of squares and there is no passage 11 leading to another direction before that, it is determined that there is a dead end in that direction. Then, if it is determined that there is a dead end in all of the identified moving directions, it is determined that there is a dead end and the predicament condition is satisfied, and the predicament determination is affirmative. It is to be noted that the number of squares in the search range for determining whether or not there is a deadlock for each movement direction from the position of the player character 12 is not limited to five, and may of course be four or less, or six or more.
[0074] 2.Relocation control process In the rearrangement control process, the server system 1100 first determines whether a given warp activation condition is met, which condition includes at least a positive determination of the predicament determination, and then performs rearrangement control when the warp activation condition is met.
[0075] 2-1. Warp activation conditions In this embodiment, the server system 1100 makes a judgment by including in the warp activation conditions a constraint condition based on the number of times rearrangement control is possible (upper limit number of times) and the fact that a warp operation, which is a predetermined operational input, has been performed. Specifically, first, if the predicament judgment is judged as positive, it is judged whether or not the constraint condition is satisfied. For example, if the upper limit number is set to "3 times," rearrangement control is limited to three times in one game, and even if the predicament judgment is judged as positive, it is judged that the constraint condition is not satisfied if rearrangement control has already been performed three times.
[0076] Note that the constraint condition may be determined based on the time when the rearrangement control is possible (activation time) without being limited to the upper limit number of times. The activation time can be set as the time when the rearrangement control is possible (activation time), for example, "until a predetermined time has elapsed from the start of the game" or "while the enemy character 13 is in a normal state".
[0077] Also, if a predetermined ability parameter value is set to be consumed by warping, the constraint condition may be determined based on the consumed ability parameter value. For example, in a game in which an ability parameter value that varies during the game is set, this can be realized by setting the type of ability parameter value consumed in rearrangement control and the consumption amount of the ability parameter value consumed in one rearrangement control. For example, a predetermined amount of vitality value is consumed each time rearrangement control is performed.
[0078] Also, the constraint condition may be determined based on the consumed item. For example, a warp activation item may be prepared as one of the special items that can be acquired during the game. Then, if the player uses the warp activation item when the player is stuck, the relocation control may be performed.
[0079] In addition, constraints may be set by combining all or part of the upper limit number of times, the timing of activation, the ability parameter value to be consumed, and the item to be consumed.
[0080] If the restriction conditions are met (=determined not to be restricted), the player's warp operation is accepted. If a warp operation is performed, it is determined that the warp activation conditions are met. In this embodiment, the server system 1100 detects as a warp operation any of the movement direction inputs "up," "down," "left," or "right" input by the player after the predicament determination is judged to be positive (after the player is stuck).
[0081] It is also possible to configure the system so that a unique operation command for a warp operation is assigned in advance, and input of that operation command is detected as a warp operation.
[0082] 6, when any of the four sides of the player character 12 is a dead-end point Pe, an input in the direction of the dead-end point Pe ("right" in FIG. 6) may be detected as a warp operation. In this case, in the subsequent warp performance control process, the performance display of the movement through the normally inaccessible dead-end point Pe to the rearrangement position may be controlled as a warp movement.
[0083] 2-2. Overview of relocation control In the subsequent rearrangement control, the server system 1100 judges whether the player is currently in a favorable or unfavorable position. If the player is in a favorable position, the server system 1100 determines a position where the player is likely to turn to a disadvantageous position, and if the player is in a unfavorable position, the server system 1100 determines a position where the player is likely to turn to an advantageous position. This increases the interest of the game because the situation can be reversed if the player character 12 warps when the game reaches a deadlock.
[0084] For this reason, in this embodiment, when rearranging the player character 12, the rearrangement position is determined based on the positioning situation conditions of the enemy characters 13 and items around the rearrangement position and the character status conditions of the enemy characters 13 around the rearrangement position. The positioning situation conditions and character status conditions are determined separately for cases where the player character 12 is in a superior position and a disadvantageous position. Therefore, the rearrangement position is determined so as to satisfy the positioning situation conditions and character status conditions according to the player's situation (whether superior or disadvantageous). FIG. 8 is a diagram showing an overview of the positioning situation conditions and character status conditions.
[0085] The placement situation condition for the rearrangement position where the player character 12 is rearranged when the player character 12 has the upper hand is, for example, that there are many enemy characters 13 around the rearrangement position and few items are arranged in the vicinity. Also, the character situation condition for the rearrangement position where the player character 12 is rearranged when the player character 12 has the upper hand is that the movement speed of the enemy characters 13 around the rearrangement position is fast. Therefore, a position on the passage 11 that satisfies these conditions is determined as the rearrangement position.
[0086] The placement situation condition for the rearrangement position where the player character 12 is rearranged when the player character 12 is at a disadvantage is, for example, that there are few enemy characters 13 around the rearrangement position and that there are many items around. Also, the character situation condition for the rearrangement position where the player character 12 is rearranged when the player character 12 is at a disadvantage is that the movement speed of the enemy characters 13 around the rearrangement position is slow. Therefore, a position on the passage 11 that satisfies these conditions is determined as the rearrangement position.
[0087] Thereafter, the server system 1100 rearranges the player character 12 to the determined rearrangement position. The rearrangement may cause the character status of the player character 12 to change from before the rearrangement. Also, the server system 1100 variably controls the warp time required for the player character 12 to appear at the rearrangement position.
[0088] 2-3. Details of relocation control The specific procedure for rearrangement control is as follows: first, the player's situation is determined (situation determination process). Next, the rearrangement position is determined (warp destination determination process), and the warp time is set (warp time setting process). Also, settings related to the character situation at the time of rearrangement of the player character 12 (hereinafter also referred to as "rearrangement situation setting") are performed (rearrangement situation setting process). Thereafter, by waiting for the warp time to elapse, the warp time required for making the player character 12 appear at the rearrangement position is variably controlled. Then, when the warp time has elapsed, the character situation is changed according to the rearrangement situation setting, and the player character 12 is rearranged to the rearrangement position.
[0089] 2-4. Situation Judgment Processing In the situation determination process, the player's situation is determined using a character situation based on the status of the player character 12. In this embodiment, the remaining number (number of remaining lives) of the player character 12 is used as the character situation. For example, if the number of remaining lives is 0, the player is determined to be at a disadvantage, and if the number of remaining lives is 1 or more, the player is determined to be at a disadvantage.
[0090] In addition, whether or not the player character 12 is within the weakening time of the enemy character 13 due to the acquisition of the power food 15 may be used as a status to determine the situation. That is, when the enemy character 13 is weakened and the player character 12 is in a status where the enemy character 13 can be defeated, the player character 12 is determined to be in an advantageous position.
[0091] In addition, in the case of a game in which variable ability parameter values are set for the player character 12, the ability parameter values may be included in the status and used to determine the situation. For example, if the stamina value is equal to or greater than a predetermined threshold, the player is in an advantageous position, and if it is below the threshold, the player is in a disadvantageous position.
[0092] The character state may also include the form, such as shape and size, and the type. In addition, the current game score or the time elapsed since the start of the game may be used for the determination. Alternatively, it may be used in combination with the various statuses exemplified.
[0093] In addition, when applied to a competitive game with other players as described later in Modification 1, it is also possible to determine which player is dominant and which player is subordinate based on the relative relationship of the ability parameter values of the player characters of each player. It is also possible to determine based on the magnitude or difference of each game score.
[0094] Furthermore, the stages for judging the situation are not limited to two stages, ie, superiority or inferiority, but may be three or more stages.
[0095] 2-5. Warp destination determination process In the warp destination determination process, the server system 1100 determines the rearrangement position of the player character 12. In this embodiment, a plurality of rearrangement candidate positions are determined in advance, and the rearrangement position is determined by selecting one of them. For example, all dead-end points Pe in the game stage of each floor F and all entrances D in the game stage of each floor F, as shown by the dashed line in FIG. 4, are set as rearrangement candidate positions.
[0096] In selecting a rearrangement candidate position, first, the placement status of the enemy character 13 and items in the game space is obtained for each rearrangement candidate position. In this embodiment, for each rearrangement candidate position, the placement status of the enemy character 13 within a predetermined range based on the rearrangement candidate position and the placement status of the items within the predetermined range are obtained.
[0097] FIG. 9 is a diagram for explaining the acquisition of the arrangement situation, and shows an example of the acquisition of the arrangement situation for a dead-end point Pe, which is one rearrangement candidate position. As shown in FIG. 9, in this embodiment, a range of a predetermined number of squares (for example, 5 squares) from the rearrangement candidate position to the top, bottom, left and right is set as a predetermined range A1, with the rearrangement candidate position (dead-end point Pe-1 in FIG. 9) as the center. Then, the number of enemy characters 13 (0 in FIG. 9) and the number of various items (20 in FIG. 9) within the range A1 are acquired as the respective arrangement situations. Regarding the number of items, the number of bait 14, power bait 15, and special items may be counted separately.
[0098] Next, in accordance with the player's situation determined in the situation determination process, ranking is performed to select rearrangement candidate positions that satisfy the placement situation conditions and character situation conditions shown in FIG.
[0099] Specifically, when the player is in an advantageous position, first, the rearrangement candidate positions are rearranged in descending order of the number of enemy characters 13 acquired as the placement status of the enemy characters 13. Then, the higher the ranking of each rearrangement candidate position, the larger the points are given to the rearrangement candidate position. Next, the rearrangement candidate positions are rearranged in descending order of the number of various items acquired as the placement status of items. At that time, for rearrangement candidate positions containing power bait 15 or special items, it is advisable to adjust the ranking to be lower the more the number of items is. Then, the higher the ranking of each rearrangement candidate position, the larger the points are given to the rearrangement candidate position. This is to make it easier to turn to a disadvantage. Next, points related to the character situation condition are given to each rearrangement candidate position. In this embodiment, since the moving speed of the enemy characters 13 is faster as the floor increases, higher points are assigned in descending order from the upper floor F, and the assigned points are given to each rearrangement candidate position of the floor F. Then, the total value of the assigned points is calculated for each rearrangement candidate position, and is set as the candidate points for each rearrangement candidate position.
[0100] On the other hand, when the player is at a disadvantage, first, the rearrangement candidate positions are rearranged in descending order of the number of enemy characters 13 acquired as the placement status of the enemy characters 13. Then, the higher the ranking of each rearrangement candidate position, the larger the points are given to that rearrangement candidate position. Next, the rearrangement candidate positions are rearranged in descending order of the number of various items acquired as the placement status of the items. At that time, for rearrangement candidate positions containing power bait 15 or special items, it is advisable to adjust the ranking to be higher the more the number of items. This is to make it easier to turn the game around. Then, the higher the ranking of each rearrangement candidate position, the larger the points are given to that rearrangement candidate position. Next, points related to the character situation condition are given to each rearrangement candidate position. In this embodiment, since the moving speed of the enemy characters 13 is slower as the floor goes down, higher points are assigned in descending order from the lowest floor F, and the assigned points are assigned to each rearrangement candidate position of that floor F. Then, the total value of the assigned points is calculated for each rearrangement candidate position, and is set as the candidate points for each rearrangement candidate position.
[0101] After the candidate points for each rearrangement candidate position are obtained in accordance with the player's situation in this manner, the rearrangement candidate position with the largest candidate point is selected as the rearrangement position. If there are multiple applicable rearrangement candidate positions, one of them is selected at random.
[0102] In addition, when there is not one type of enemy character but different types of enemy characters with different moving speeds are mixed, or when the moving speed of the enemy characters can vary as in Modification 3 described later, the moving speed of the enemy characters within a predetermined range may be acquired for each rearrangement candidate position in a similar manner to the acquisition of the placement situation. Then, when the player is in an advantageous position, high points may be awarded to rearrangement candidate positions that include many enemy characters with fast moving speeds, and when the player is in a disadvantageous position, high points may be awarded to rearrangement candidate positions that include many enemy characters with slow moving speeds to calculate the candidate points.
[0103] Although the character status based on the moving speed is exemplified as the character status of the enemy character 13 here, the character status based on the status related to the enemy character 13 may be used. In this case, a character status condition is set for the status. For example, a status condition is set such that "there is no weakened enemy character 13 in the vicinity" if the player is in an advantageous position, and "there is a weakened enemy character 13 in the vicinity" if the player is in a disadvantageous position. Then, points are given to each rearrangement candidate position depending on whether or not there is a weakened enemy character 13 within a predetermined range. In addition, both the status and the moving speed may be used to select the rearrangement candidate position. In this case, a character status condition is set by combining the status condition and the above-mentioned moving speed condition.
[0104] 2-6. Warp time setting process In the warp time setting process, a warp time required for warping movement of the player character 12 to the rearrangement position is set. In this embodiment, different warp times are set in advance for cases where the player is judged to be in a favorable position and cases where the player is judged to be in a disadvantageous position. For example, the warp time required for the favorable position can be set short, and the warp time required for the disadvantageous position can be set long. Conversely, the warp time required for the favorable position can be set long, and the warp time required for the disadvantageous position can be set short.
[0105] When the warp time is short, the player character 12 will appear from the rearrangement position immediately, so the change in the situation around the rearrangement position during that time is small. On the other hand, when the warp time is long, the situation around the rearrangement position may change significantly during the time until the player character appears from the rearrangement position. For example, even if the rearrangement position is initially selected as a rearrangement candidate position that is likely to turn to an advantageous position, the enemy characters 13 may gather around the rearrangement position as the warp time has passed, so that the player character may be in a difficult situation again after the warp movement. Conversely, even if the rearrangement position is initially selected as a rearrangement candidate position that is likely to turn to an advantageous position, the enemy characters 13 may be farther away from the rearrangement position as the warp time is long, so that the player character may be less likely to turn to an advantageous position than expected. When the present invention is applied to a multiplayer game in which the player plays with other players as in the modified example 1 described later, the development may change depending on the actions of the other players. This improves the interest of the game.
[0106] 2-7. Status setting process during relocation In the rearrangement situation setting process, a setting (rearrangement situation setting) is performed to change the character situation based on the status related to the player character 12 at the time of rearrangement according to the player's situation determined in the situation determination process. For example, the number of remaining lives is used, and when the player is in an advantageous position, the number of remaining lives is set to "-1", and when the player is in an inferior position, the number of remaining lives is set to "+1". Also, when the player character 12 is in an inferior position, the player character 12 may be set to a state in which the player character 12 has virtually acquired the power food 15 at the time of rearrangement (i.e., the enemy character 13 is in a weakened state for a predetermined time). Alternatively, in the case of a game in which a variable ability parameter value is set for the player character 12, a setting may be included in which when the player is in an advantageous position, the ability parameter value (e.g., physical strength value) is consumed by a predetermined amount, and when the player is in an inferior position, the ability parameter value is restored by a predetermined amount. In this way, the character situation of the player character 12 can be changed before and after rearrangement according to the player's situation.
[0107] 2-8. Distress notification control processing In the predicament notification control process, when it is determined that the warp activation condition is satisfied during the rearrangement control process, control is performed to notify the player that the predicament determination has been affirmative. For example, as shown in Fig. 10, the notification is performed by displaying a message M3 indicating that a deadlock has occurred at a predetermined position (lower left in Fig. 10) within the game screen. This allows the player to understand that a deadlock has occurred and that warp movement is possible.
[0108] 2-9.Relocation position display control process In the rearrangement position display control process, when the rearrangement position is determined in the process of the rearrangement control process, the rearrangement position is displayed in an identifiable manner and presented to the player. For example, as shown in FIG. 11, the current state of the periphery of the rearrangement position (for example, the predetermined range A1 in FIG. 9) is temporarily displayed on the floor display unit 60 at the bottom right of the game screen. Then, for example, a mark (star) is added to the rearrangement position to control the identifiable display of the rearrangement position. In addition, when the dead end point Pe or the entrance / exit D in the current floor F is determined as the rearrangement position, the game image display unit 10 may be configured to change or blink the background color of the surroundings including the rearrangement position (for example, the dead end point Pe-1 in FIG. 11) to control the identifiable display of the rearrangement position. This allows the player to grasp the arrangement of the enemy characters 13 and various items in the vicinity of the rearrangement position as well as the rearrangement position before the rearrangement control. Note that the floor display unit 60 may display a map of the entire floor (lower floor F-1 in FIG. 11) to which the rearrangement position belongs, and the rearrangement position may be marked to be identified.
[0109] 2-10. Warp performance control processing In the warp effect control process, control is performed to display the appearance of the warp movement of the player character 12 during the warp required time determined in the process of the rearrangement control process. For example, Fig. 12 shows an example in which the player character 12 temporarily becomes huge in a semi-transparent color and floats above the game stage, and moves to the rearrangement position before the warp required time has elapsed, as the appearance of warp movement. Note that the content of the display effect may be any content and may be set appropriately.
[0110] [Function configuration] 1. Server system Fig. 13 is a block diagram showing an example of a functional configuration of the server system 1100. As shown in Fig. 13, the server system 1100 of this embodiment includes an operation input unit 100s, a server processing unit 200s, an image display unit 390s, a sound output unit 392s, a communication unit 394s, and a server storage unit 500s.
[0111] The operation input unit 100s is for inputting various operations for system management, maintenance, etc., and can be realized by, for example, a keyboard, a mouse, a touch panel, etc. In FIG.
[0112] The server processing unit 200s can be realized by a processor, which is an arithmetic circuit such as a CPU, GPU, ASIC, or FPGA, or an electronic component such as an IC memory, and controls input and output of data between each unit of the device including the operation input unit 100s and the server storage unit 500s. Then, various types of arithmetic processing are performed based on predetermined programs and data, operation input signals from the operation input unit 100s, data received from the operation terminal 1500, etc., and the server processing unit 200s centrally controls the operation of the server system 1100. In FIG. 1, the control board 1150 and its CPU 1151 correspond to this.
[0113] The server processing unit 200s includes a user management unit 210, a game management unit 230, a timing unit 280s, an image generation unit 290s, a sound generation unit 292s, and a communication control unit 294s.
[0114] The user management unit 210 performs processes related to user registration and manages the data of each registered user (player) linked to the account. For example, it can execute processes such as granting a unique account to a registered user, registration information management processes for registering and managing personal information for each account, and usage history management processes for managing login and logout history. Of course, it can also appropriately include management processes for other data linked to the user account.
[0115] The game management unit 230 performs various processes related to game execution management. Since the game of this embodiment is a client-server type online game, the game management unit 230 performs control to provide data necessary for game play while communicating with the operation terminal 1500. In providing the data, the following processes can be performed as processes related to game progress control and reflection of play results: 1) process of setting a game space by arranging items, etc. in the maze-like game stage of each floor F, 2) process of arranging the player character 12 in the game space and controlling the player character 12 according to the input of the movement direction in the operation terminal 1500, 3) process of arranging and controlling a virtual camera in the game space, 4) process of arranging an enemy character 13 in the game space and controlling its movement, 5) process related to contact judgment and acquisition judgment of the player character 12, enemy character 13, items, etc. and reflection thereof, 6) game progress control based on the item acquisition result of the player character 12, 7) process of generating an image (game image) of the game space seen from the virtual camera, 8) process of judging whether the end condition of the game has been met, etc. In addition, various data necessary for controlling game play can be stored in the server storage unit 500s.
[0116] The game management unit 230 includes a predicament determination unit 231 , a rearrangement control unit 233 , a predicament notification control unit 235 , a rearrangement position display control unit 237 , and a warp performance control unit 239 .
[0117] The predicament determination section 231 is a functional section that performs a predicament determination process, and performs a predicament determination as to whether or not a predicament condition, which is a condition indicating that the player character 12 has reached a predicament regarding movement, is satisfied.
[0118] The rearrangement control unit 233 is a functional unit that performs rearrangement control processing, and performs control to rearrange the player character 12 to the rearrangement position when the warp activation condition is satisfied. In this embodiment, when the predicament determination is affirmative, the limiting condition based on the upper limit number of rearrangement control is satisfied, and a warp operation is performed, the warp activation condition is deemed to be satisfied and rearrangement control is performed.
[0119] The predicament notification control unit 235 is a functional unit that performs predicament notification control processing, and when a predicament determination is affirmative, performs control to notify the player by displaying a message to that effect (see FIG. 10).
[0120] The rearrangement position display control unit 237 is a functional unit that performs rearrangement position display control processing, and performs control to identifiably display the rearrangement position of the player character 12 determined in the course of the rearrangement control processing, and presents it to the player (see Figure 11).
[0121] The warp performance control unit 239 is a functional unit that performs warp performance control processing, and controls the performance display of the warp movement of the player character 12 for the warp required time determined in the process of the rearrangement control processing (see Figure 12).
[0122] The timekeeping unit 280s uses a system clock to keep track of the current date and time, time limit, and the like.
[0123] The image generating unit 290s generates images relating to system management of the server system 1100 and outputs them to the image display unit 390s.
[0124] The sound generation unit 292s is realized by executing an IC or software that generates or decodes audio data, and generates or decodes audio data such as operation sounds and BGM related to the system management and video distribution of the server system 1100. Audio signals related to system management are output to the sound output unit 392s.
[0125] The communication control unit 294s performs communication connection and data processing for data communication with an external device (for example, the operation terminal 1500) via the communication unit 394s, and realizes data exchange with the external device.
[0126] The image display unit 390s displays various screens for system management and the like based on the image signal input from the image generation unit 290s. For example, this can be realized by an image display device such as a flat panel display, a projector, or a head mounted display. In FIG. 1, this corresponds to the touch panel 1108.
[0127] The sound output unit 392s emits the sound signal input from the sound generation unit 292s. In FIG. 1, this corresponds to a speaker (not shown) provided in the main device 1101 or the touch panel 1108.
[0128] The communication unit 394s realizes communication by connecting to the network N. For example, it can be realized by a wireless communication device, a modem, a TA (terminal adapter), a jack of a wired communication cable, a control circuit, etc. In FIG. 1, the communication device 1153 corresponds to this.
[0129] In the server storage unit 500s, programs for operating the server system 1100 and realizing various functions of the server system 1100, data used during execution of the programs, etc. are stored in advance or temporarily stored each time processing is performed. For example, it can be realized by IC memory such as RAM or ROM, a magnetic disk such as a hard disk, an optical disk such as a CD-ROM or DVD, etc. In FIG. 1, this corresponds to the IC memory 1152 and the storage 1140.
[0130] The server storage unit 500s also stores a server program 501, a distribution game client program 503, user management data 510, game setting data 520, and play data 530. In addition, other necessary data such as timers, counters, various tables, thresholds, flags, etc. are also stored as appropriate.
[0131] The server program 501 is a program for causing the server processing unit 200s to function as the user management unit 210 and the game management unit 230. Note that this may also include programs for causing the server processing unit 200s to function as the image generation unit 290s, the sound generation unit 292s, and the communication control unit 294s, as appropriate.
[0132] The distribution game client program 503 is the original of the game client program 502 (see FIG. 15) downloaded to the operation terminal 1500.
[0133] User management data 510 is prepared for each player who has completed user registration, and stores various data for managing the game play of that player, including the player ID (account), play history, and the like.
[0134] The game setting data 520 stores various setting data necessary to execute the game, including setting data related to the player character 12, such as model data of the player character 12 and motion data used to control the movement of the player character 12, setting data related to the enemy character 13, such as model data of the enemy character 13 and movement pattern data defining the pursuit movement pattern of the enemy character 13, and setting data related to the game stage of each floor F, such as map data.
[0135] In this embodiment, the game setting data 520 includes item initial placement data 521 that sets the initial placement of items, an item appearance table 523 for special items, and a rearrangement candidate position list 525. The rearrangement candidate position list 525 stores a list of dead-end points Pe and entrances / exits D in the game stage that are to be used as rearrangement candidate positions.
[0136] Play data 530 is prepared for each player playing a game (i.e., for each operation terminal 1500 connected to the server system 1100). For example, as shown in Fig. 14, one play data 530 includes a game ID 531 assigned to each game play, player information 533 of the player playing the game, and play situation data 550.
[0137] The player information 533 stores the account of the relevant player, the player name, the device ID of the operation terminal 1500 used, and the like.
[0138] The play situation data 550 stores various data describing the play situation (progress) of the game of the relevant player. For example, it includes player character control data 551, enemy character control data 553, item arrangement data 555, and rearrangement control data 560. It also includes a game score 571 and the remaining number (remaining number of lives) 573 of the player character 12. In addition, it can appropriately store the number of each of various items such as the bait 14 obtained, whether the game has ended, and the like.
[0139] The player character control data 551 stores various data describing the latest state of the player character 12 in the game space, such as the floor number of the current floor F, the current position on the game stage, the posture, the movement speed, etc.
[0140] The enemy character control data 553 is prepared for each enemy character 13, and stores various data describing the latest state of each enemy character in the game space. For example, one enemy character control data 553 stores an enemy character ID for identifying the enemy character 13, the floor number of the floor F on which the enemy character 13 is located, the current position, posture, movement speed, state (normal state or weakened state), etc. on the game stage.
[0141] The item placement data 555 stores various data describing the latest placement state of various items such as the bait 14, the power bait 15, and special items at each placement position on the game stage of each floor F.
[0142] The rearrangement control data 560 is generated each time the rearrangement control unit 233 performs rearrangement control. For example, if the upper limit number of rearrangement controls is set to "three times", a maximum of three pieces of rearrangement control data 560 are generated during one game. Each piece of rearrangement control data 560 stores a rearrangement position 563, a warp time 565, a rearrangement time setting 567, and the like, which are set during the rearrangement control process, in association with an implementation number 561, which is assigned as a serial number from 1 to 3 in the implementation order.
[0143] 2. Operation terminal 15 is a block diagram showing an example of a functional configuration of a user terminal, an operation terminal 1500. As shown in FIG. 15, the operation terminal 1500 includes an operation input unit 100, a device processing unit 200, an image display unit 390, a sound output unit 392, a communication unit 394, and a device storage unit 500.
[0144] The operation input unit 100 is used by the player to input various operations, and can be realized by, for example, a button switch, a joystick, a touch pad, a track ball, an acceleration sensor, an angular velocity sensor, a CCD module, etc. In Fig. 2, this corresponds to the direction input key 1502, the home key 1504, and the touch panel 1506.
[0145] The device processing unit 200 can be realized by a processor, which is an arithmetic circuit such as a CPU, GPU, ASIC, or FPGA, or an electronic component such as an IC memory, and controls input and output of data between each unit of the device including the operation input unit 100 and the terminal storage unit 500. Then, various arithmetic processes are performed based on predetermined programs and data, an operation input signal from the operation input unit 100, data received from the server system 1100, and the like, and the device processing unit 200 centrally controls the operation of the operation terminal 1500. In FIG. 2, the control board 1550 and its CPU 1551 correspond to this. Then, the device processing unit 200 in this embodiment includes an operation terminal arithmetic unit 270, a timer unit 280, an image generation unit 290, a sound generation unit 292, and a communication control unit 294.
[0146] The operation terminal calculation unit 270 executes various calculation processes for causing the operation terminal 1500 to function as a terminal for a player to play a game. For example, the operation terminal calculation unit 270 includes an operation signal transmission control unit 271 and a game screen display control unit 273.
[0147] The operation signal transmission control unit 271 performs processing for transmitting various data and request information to the server system 1100 in response to an operation input to the operation input unit 100 .
[0148] The game screen display control unit 273 performs control for displaying a game screen based on various data received from the server system 1100. For example, if the online game of this embodiment is realized as a web game, it can be realized using a web technology that actively controls screen display using HTML together with Java (registered trademark) and CSS (Cascading Style Sheets) based on a web browser, or a plug-in such as Adobe (registered trademark) Flash. Of course, other methods may be used. In addition, in the configuration of this embodiment, a game space image (e.g., 3DCG, etc.) that is the base of the game screen is generated by the server system 1100, but it is also possible to configure the game space image to be generated by the operation terminal 1500. In that case, the game screen display control unit 273 controls objects arranged in a virtual three-dimensional space for generating the 3DCG.
[0149] The image generation unit 290 cooperates with the game screen display control unit 273 to generate an image signal for displaying one game screen per frame time (for example, 1 / 60 seconds) based on various data received from the server system 1100, and outputs the generated image signal to the image display unit 390. For example, this can be realized by a processor such as a GPU or a digital signal processor (DSP), a video signal IC, a program such as a video codec, an IC memory for drawing frames such as a frame buffer, and the like.
[0150] The sound generation unit 292 is realized, for example, by a digital signal processor (DSP), a processor such as a voice synthesis IC, an audio codec for playing audio files, etc., and generates audio signals for game sound effects, background music, and various operation sounds, and outputs them to the sound output unit 392.
[0151] The communication control unit 294 performs communication connection and data processing for data communication with an external device (eg, the server system 1100) via the communication unit 394, and realizes data exchange with the external device.
[0152] The image display unit 390 displays various screens such as a game screen based on the image signal input from the image generation unit 290. For example, this can be realized by an image display device such as a flat panel display, a projector, or a head mounted display. In FIG. 2, this corresponds to the touch panel 1506.
[0153] The sound output unit 392 emits sound effects, background music, and the like related to the game based on the audio signal input from the sound generation unit 292. In FIG.
[0154] The communication unit 394 realizes communication by connecting to the network N. For example, it can be realized by a wireless communication device, a modem, a TA, a jack for a wired communication cable, a control circuit, etc. In FIG. 2, the wireless communication module 1553 corresponds to this.
[0155] In the terminal storage unit 500, programs for operating the operation terminal 1500 and realizing the functions of the operation terminal 1500, data used during execution of the programs, etc. are stored in advance or temporarily stored each time processing is performed. For example, it can be realized by IC memory such as RAM or ROM, a magnetic disk such as a hard disk, an optical disk such as a CD-ROM or DVD, etc. In Fig. 2, this corresponds to the IC memory 1552 and the memory card 1540.
[0156] The terminal storage unit 500 also stores a game client program 502. The game client program 502 is a program for causing the terminal processing unit 200 to function as the operation terminal calculation unit 270. This game client program 502 may be a dedicated client program according to a technical method for realizing an online game, or may be configured by a web browser program and a plug-in for realizing interactive image display. In this embodiment, it is a copy of a distribution game client program 503 (see FIG. 13) provided by the server system 1100.
[0157] [Processing flow] 16 is a flowchart for explaining the process flow in the server system 1100 of this embodiment, focusing on one game. The process described here is realized by the server processing unit 200s reading and executing the server program 501. It is assumed that a separate login procedure has already been completed in the operation terminal 1500.
[0158] First, prior to the start of the game, the game management unit 230 sets the game space (step S1). At that time, the game management unit 230 performs various processes necessary for starting the game, such as a process of placing the bait 14 and the power bait 15 at each placement position in the game space according to the item initial placement data 521.
[0159] Thereafter, the game management unit 230 starts the game (step S3). At that time, the game management unit 230 starts various processes required for the progress of the game, such as a process for controlling the appearance of special items according to the item appearance table 523.
[0160] Then, when the game is started, the predicament determination unit 231 performs a predicament determination process to determine whether or not a predicament condition indicating that the player character 12 has reached a predicament regarding movement is satisfied (step S5). If the predicament determination in step S5 is judged to be positive (step S7: YES), the rearrangement control unit 233 starts a rearrangement control process to first determine whether or not a constraint condition based on the upper limit number of times is satisfied. If the constraint condition is satisfied (step S9: YES) and a warp operation in the operation terminal 1500 is detected (step S11: YES), the rearrangement control unit 233 determines that the warp activation condition is satisfied. In that case, the predicament notification control unit 235 performs a predicament notification control process to perform notification control to the effect that the predicament determination is judged to be positive (step S13).
[0161] Next, the rearrangement control unit 233 performs a situation determination process and determines whether the player is in a favorable or unfavorable position by referring to the play situation data 550 (step S15). Then, the rearrangement control unit 233 performs a warp destination determination process and determines the rearrangement position by selecting one of the rearrangement candidate positions from the rearrangement candidate position list 525 (step S17). In this embodiment, first, based on the play situation data 550, candidate points are calculated for each rearrangement candidate position in a procedure according to the player's situation determined in step S15. Then, the rearrangement candidate position with the largest candidate points is selected as the rearrangement position 563.
[0162] Then, once the rearrangement position has been determined, the rearrangement position display control unit 237 then performs rearrangement position display control processing, and performs control for identifying and displaying the rearrangement position (step S19).
[0163] Next, the rearrangement control unit 233 performs a warp time setting process, and sets the warp required time 565 according to the player's situation determined in step S15 (step S21). The rearrangement control unit 233 also performs a rearrangement time situation setting process, and sets the character situation at the time of rearrangement of the player character 12 as a rearrangement time situation setting 567 according to the player's situation determined in step S15 (step S23).
[0164] Then, until the warp required time 565 set in step S21 has elapsed, the warp performance control unit 239 performs warp performance control processing, and displays the appearance of the player character 12 warping to the rearrangement position (step S25).
[0165] Then, when the warp time 565 has elapsed, the rearrangement control unit 233 changes the character situation in accordance with the rearrangement situation setting 567 set in step S23 (step S27), and then places the player character 12 at the rearrangement position (step S29).
[0166] Thereafter, the process returns to step S5 and repeats the above-mentioned processing until the game is ended (step S31: NO), and when the game is ended (step S31: YES), this processing ends.
[0167] As described above, in this embodiment, the deadlock is set when all directions selectable as the moving direction of the player character 12 are blocked by the enemy characters 13 and / or dead ends. Then, during the game, the deadlock is set as a predicament condition, and when the predicament determination is positive, the restriction condition is satisfied, and a warp operation is performed, the work activation condition is satisfied, and the relocation control of the player character 12 can be performed. Therefore, even if the player character reaches a predicament regarding movement, the player character can warp to another location that is a relocation position and proceed with the game from there, which can improve the interest of the game. In addition, in the relocation control, it is determined whether the player is currently in a favorable or unfavorable position, and if the player is in a favorable position, a relocation position that is likely to turn to a disadvantageous position is selected from the relocation candidate positions, and the player character 12 can be relocated. According to this, the player's situation can be reversed after the relocation, which can further improve the interest of the game.
[0168] The forms to which the present invention can be applied are not limited to the above-described embodiments, and constituent elements can be added, omitted, or modified as appropriate.
[0169] [Variation 1] For example, in the above embodiment, a single-player game in which one player plays the game is illustrated, but the present invention can also be applied to a multiplayer game in which multiple players participate and cooperate or compete with each other. In the former case, each player operates their own player character and cooperates to achieve the conditions for clearing the game.
[0170] In this case, a placement status condition of the ally character may be set and used to determine the rearrangement position. Also, a character status condition based on the status or movement speed of the ally character may be set and used to determine the rearrangement position. Alternatively, the placement status condition of the ally character may be combined with the placement status condition of the enemy character or item, or the character status condition of the ally character may be combined with the character status condition of the enemy character.
[0171] For example, the placement status condition of the ally characters can be set as "few ally characters in the vicinity" when the player is in an advantageous position, and "many ally characters in the vicinity" when the player is in a disadvantageous position. In that case, the placement status of the ally characters is obtained by counting the number of ally characters within a predetermined range for each rearrangement candidate position in the same manner as described with reference to Fig. 9. Then, based on the obtained placement status, points according to the player's situation are reflected in the candidate points.
[0172] In addition, the character status conditions for the ally characters can be set as "the average vitality value of the ally characters in the vicinity is below a predetermined threshold value" or "the movement speed of the ally characters in the vicinity is slow" when the player is in an advantageous position, and "the average vitality value of the ally characters in the vicinity is above a predetermined threshold value" or "the movement speed of the ally characters in the vicinity is fast" when the player is in a disadvantageous position. In this case as well, the character status of the ally characters within a predetermined range is obtained for each rearrangement candidate position. Then, based on the obtained character status, points according to the player's situation are reflected in the candidate points.
[0173] On the other hand, when players compete against each other, the player character of the opponent player (opponent player) is treated as an enemy character, and the positioning situation and character status are acquired in the same manner as in the above embodiment. Then, based on the acquired positioning situation and character status, points according to the player's situation are reflected in the candidate points.
[0174] Furthermore, when competing against another player, a situation may occur in which the player's player character 12a is caught between a dead end point Pe and an obstacle item 16 placed by the opponent player's player character 12b, resulting in a blocked state, as shown in Fig. 17. In this modified example, such a situation may be regarded as one of the deadlock states, and a predicament condition may be determined.
[0175] [Variation 2] Also, in the above embodiment, the server system 1100 is described as the processing entity for game management, but the configuration may be such that the operation terminal 1500 is the processing entity, or the processing related to the game management may be distributed and executed by the server system 1100 and the operation terminal 1500. For example, in the configuration of the above embodiment, when the operation terminal is the processing entity, an example of the functional configuration of the operation terminal 1500A is as shown in Fig. 18. Note that in Fig. 18, the same reference numerals are used to denote the same components as those in the above embodiment.
[0176] 18, in the operation terminal 1500A of this modification, the device processing unit 200 has a game management unit 230, and the game screen display control unit 273 is omitted. That is, the operation terminal 1500A of this modification does not acquire data for displaying an image of a game screen from the server system 1100, but the game management unit 230 executes processing related to game management to control the progress of the game and generate an image of the game screen. The terminal storage unit 500 of this operation terminal 1500A stores a game program 504 for causing the device processing unit 200 to function as the operation terminal calculation unit 270 and the game management unit 230, and stores user management data 510 related to the player of the operation terminal 1500A, play data 530 related to the game play, and game setting data 520.
[0177] The process flow of the operation terminal 1500A of this modified example is basically the same as the flowchart shown in FIG. 16, and each step may be interpreted as being executed by the game management section 230 of the operation terminal 1500A.
[0178] According to this modification, the same effects as those of the above embodiment can be obtained. Note that the operation terminal 1500 may be configured to take on only a part of the functions of the game management section 230, rather than taking on all of the functions.
[0179] Also, when applied to a multiplayer game in which multiple players participate as in the above-mentioned modified example 1, multiple operation terminals 1500 can be connected in a peer-to-peer manner. In that case, any one of the operation terminals 1500 is made to take on the functions of the server system 1100 of the above-mentioned embodiment. Alternatively, the functions of the game management unit 230 may be shared among multiple operation terminals 1500. A computer system is configured by connecting multiple operation terminals 1500. Meanwhile, the server system 1100 mainly performs user registration, management of the information, and matching, and provides the information in response to a request from the operation terminal 1500A.
[0180] [Variation 3] In the above embodiment, the moving speed of the player character 12 is fixed, but it may be variably controlled. For example, when the power fodder 15 is obtained, the moving speed of the player character 12 may be increased during the weakened time thereafter. Alternatively, an item that increases or decreases the moving speed may be prepared as a special item, and the moving speed of the player character 12 may be changed for a predetermined effective time in exchange for consuming the item.
[0181] In addition, in the case where the moving speed of the player character 12 can change during the game as described above, the moving speed can also be used as the character status of the player character 12. For example, in the situation determination process, the situation may be determined from the moving speed of the player character 12. If the moving speed is fast, it is determined that the player character 12 is in an advantageous position. Alternatively, the situation may be determined by combining the moving speed with the status related to the player character 12 described above.
[0182] Also, in the rearrangement situation setting process, the moving speed of the player character 12 at the time of rearrangement may be set as the rearrangement situation setting. For example, the moving speed may be changed to slower if the player is in an advantageous position, and faster if the player is in a disadvantageous position. Alternatively, by including the moving speed setting in the rearrangement situation setting, it is possible to set both the status and the moving speed of the player character 12 at the time of rearrangement. Then, when the player character 12 is rearranged, the moving speed of the player character 12 is changed according to the rearrangement situation setting. Note that the moving speed once changed may be maintained as it is until the moving speed is changed next time, or may be returned to the original moving speed after a predetermined effective time has elapsed.
[0183] [Variation 4] In the above embodiment, the predicament condition is determined to be a state in which the player character 12 is surrounded by enemy characters 13 and / or dead ends and the player character 12 is stuck in a moving direction. In other words, the predicament condition is determined to be satisfied when the player character 12 cannot pass through all of the moving directions selectable by the player character 12. In contrast, it is also possible to configure the predicament condition to be satisfied when some or all of the selectable moving directions are passable but have a disadvantageous effect on the player character 12 when moving forward. For example, in the example of FIG. 19, the player character 12 is at a crossroads intersection, and there are enemy characters 13 in each of the directions "up", "down" and "left". On the other hand, a damage floor 17 is placed on the right side, which is set to reduce the vitality value of the player character 12 when the player character 12 passes through the damage floor. In this case, the predicament condition may be determined to be satisfied.
[0184] [Variation 5] In the above embodiment, a configuration has been described in which a rearrangement candidate position that satisfies the placement status conditions of the enemy character 13 and items and the character status conditions of the enemy character 13 is selected as the rearrangement position from among a plurality of predetermined rearrangement candidate positions. In contrast, a configuration may be adopted in which, when an impasse occurs, control is performed to display each rearrangement candidate position as a choice on the game screen, and a selection operation for any one of them is accepted. Then, a configuration may be adopted in which the rearrangement candidate position selected by the player is determined as the rearrangement position.
[0185] In addition, in the above embodiment, the dead-end point Pe and the entrance / exit D in the game stage are set as candidate rearrangement positions, and the rearrangement position is determined by selecting one from among them, but the configuration may also be such that any position on the passage 11 is set as a candidate rearrangement position.
[0186] 6, when a deadlock state in which the player character 12 is sandwiched between a dead-end point Pe and an enemy character 13 is determined as a predicament condition, a corresponding position of a warp destination may be set in advance for each dead-end point Pe in the game stage. Then, the corresponding position may be determined as a rearrangement position. The corresponding position may be another dead-end point Pe or an entrance / exit D on the same floor F, or may be set as an arbitrary position on the passage 11, such as the initial position of the player character 12. Alternatively, the corresponding position may be set on another floor F.
[0187] In the above embodiment, the end of the passage 11 leading to the outside of the frame of the game image display unit 10 is described as an entrance / exit D for passing between the floors F, but it may be configured to be a dead end normally. Then, only when the player character 12 is stuck near the dead end entrance / exit D and the predicament determination is affirmatively determined, the entrance / exit D may be allowed to pass through. Then, as in the above embodiment, it may be made to appear near the corresponding entrance / exit D of the transition destination floor F. In other words, the corresponding position of the dead end entrance / exit D is set as the entrance / exit D of the other floor F.
[0188] [Variation 6] In the above embodiment, a predicament determination is performed by regarding a dead end point set in advance in a maze-like passage as a dead end in the game space, but a dead end also includes a place where a passage is blocked during the game progress and it becomes impossible to pass through. In addition, one of the games in which multiple players participate is a game (also called a battle royale game, etc.) in which player characters operated by each player are placed in a common game stage and fight until only one player remains in a predetermined battle area in the game stage that gradually shrinks over time. If the player character 12 goes outside the battle area, his or her vitality value is lost, which has a disadvantageous effect on the player character 12. When applied to such a game, a predicament determination may be performed by regarding a boundary separating the inside and outside of the battle area as a dead end.
[0189] [Variation 7] In the above embodiment, an example was shown in which a game stage was set using map data prepared in advance, but a configuration in which a game map is generated based on a map of the real world is also possible. For example, a map selection operation by the player is accepted prior to the start of the game. Alternatively, the player's current position may be acquired, and a map of a predetermined range based on the acquired current position may be selected. Then, road information may be extracted from the selected map, and a game map may be generated in which each road is the above-mentioned passage 11.
[0190] [Other variations] In addition, the input of the movement direction is not limited to the input indicating a two-dimensional direction as illustrated, but may include an input indicating a three-dimensional direction. For example, this is the case when the game world is an underground labyrinth in which passages can branch out up, down, left, right, front, back, and so on. [Explanation of symbols]
[0191] 1000…Game System 1100...Server system 100s…Operation input section 200s…Server processing section 210...User Management Department 230…Game Management Department 231… Crisis Judgment Department 233...Relocation control unit 235... Distress notification control unit 237...Rearrangement position display control unit 239…Warp performance control unit 290s…Image generation section 292s…sound generation section 294s…Communication control section 390s...Image display section 392s…Sound output section 394s…Communication Department 500s…Server storage 501...Server program 503...Streaming game client program 510...User management data 520...Game setting data 521…Item initial placement data 523…Item appearance table 525...Relocation candidate location list 530...Play data 531...Game ID 533...Player information 550...Play status data 551...Player character control data 553...Enemy character control data 555...Item placement data 560...Relocation control data 563…Relocation position 565…Warp time required 567…Relocation status setting 571…Game score 573…Number of remaining player characters 1500, 1500A...Operation terminal 100...Operation input section 200...Terminal processing section 270...Operation terminal calculation unit 271...Operation signal transmission control unit 273...Game screen display control unit 290...Image generation unit 292...Sound generation section 294…Communication control unit 390...Image display section 392…Sound output section 394…Communications Department 500…Device memory section 502 - Game client program 504...Game program N…Network 2. Player 10...Game image display section 40…Score display section 50…Remaining lives display section 60…Floor display section 12...Player character 13...Enemy character 11...Aisle Pe…Dead end D...Entrance / exit
Claims
1. A program for causing a computer system to execute movement control of a player character in a given game space based on a movement operation of the player, comprising: a determination means for determining whether or not a predicament condition set as a condition indicating that the player character has reached a predicament regarding movement is satisfied; a rearrangement control means for determining a rearrangement position of the player character so as to satisfy a placement situation condition according to the player's situation during game play when a given warp activation condition including at least a positive determination by the determination means is satisfied, and performing rearrangement control for rearranging the player character to the rearrangement position; A program for causing the computer system to function as the
2. A program for causing a computer system to execute movement control of a player character in a given game space based on a movement operation of the player, comprising: a determination means for determining whether or not a predicament condition set as a condition indicating that the player character has reached a predicament regarding movement is satisfied; a rearrangement control means for determining a rearrangement position of the player character in accordance with a character state based on a status and / or a moving speed of the player character when a given warp activation condition including at least a positive determination by the determination means is satisfied, and performing rearrangement control for rearranging the player character to the rearrangement position; A program for causing the computer system to function as the
3. A program for causing a computer system to execute movement control of a player character in a given game space based on a movement operation of the player, comprising: a determination means for determining whether or not a predicament condition set as a condition indicating that the player character has reached a predicament regarding movement is satisfied; a rearrangement control means for determining, when a given warp activation condition including at least a positive determination by said determination means is satisfied, a position where a character situation based on a status and / or a moving speed of an enemy character and / or an ally character satisfies a given character situation condition as a rearrangement position of said player character, and performing rearrangement control for rearranging said player character to said rearrangement position; A program for causing the computer system to function as the
4. A program for causing a computer system to execute movement control of a player character in a given game space based on a movement operation of the player, comprising: a determination means for determining whether or not a predicament condition set as a condition indicating that the player character has reached a predicament regarding movement is satisfied; a rearrangement control means for performing rearrangement control for rearranging the player character to a given rearrangement position when a given warp activation condition including at least a positive determination by the determination means is satisfied; and causing the computer system to function as A constraint condition is set for determining whether the reallocation control is possible; and the relocation control means determines the warp activation conditions including the constraint conditions; program.
5. The constraint condition is a condition based on at least one of the number of times the rearrangement control is possible, the timing, the ability parameter value to be consumed, and the item to be consumed. The program according to claim 4.
6. A program for causing a computer system to execute movement control of a player character in a given game space based on a movement operation of the player, comprising: a determination means for determining whether or not a predicament condition set as a condition indicating that the player character has reached a predicament regarding movement is satisfied; a rearrangement control means for performing rearrangement control for rearranging the player character to a given rearrangement position when a given warp activation condition including at least a positive determination by the determination means is satisfied; a rearrangement position display control means for controlling to identifiably display the rearrangement position when the determination means makes a positive determination; A program for causing the computer system to function as the
7. The predicament condition includes a state of impasse regarding the direction of movement of the player character. The program according to any one of claims 1 to 6.
8. the determination means determines whether a state in which all selectable directions as moving directions of the player character are blocked by enemy characters and / or a given dead end is the deadlock state and satisfies the predicament condition; The program according to claim 7.
9. a notification control means for controlling, when a positive determination is made by the determination means, to notify the user of the positive determination; The program according to any one of claims 1 to 8, for causing the computer system to function as a
10. the rearrangement control means performs the rearrangement control when the warp activation condition is that the determination means has made a positive decision and a predetermined operational input has been made. The program according to any one of claims 1 to 9.
11. the rearrangement control means determines, as the rearrangement position, a position where a positional situation of at least one of an enemy character, a friendly character, and a predetermined game object satisfies a given positional situation condition; The program according to any one of claims 1 to 10.
12. A plurality of rearrangement candidate positions are set in advance in the game space, the relocation control means determines the relocation position by selecting one of the relocation candidate positions; The program according to any one of claims 1 to 11.
13. the rearrangement control means, when a corresponding position that is previously associated with the position of the player character in the impasse state, determines the corresponding position as a rearrangement position; The program according to any one of claims 1 to 12.
14. the rearrangement control means changes a character state based on a status and / or a moving speed of the player character, and makes the character appear at the rearrangement position; The program according to any one of claims 1 to 13.
15. A computer system that controls the movement of a player character in a given game space based on a movement operation of the player, comprising: a determination means for determining whether or not a predicament condition set as a condition indicating that the player character has reached a predicament regarding movement is satisfied; a rearrangement control means for determining a rearrangement position of the player character so as to satisfy a placement situation condition according to the player's situation during game play when a given warp activation condition including at least a positive determination by the determination means is satisfied, and performing rearrangement control to make the player character appear at the rearrangement position; A computer system comprising:
16. A computer system that controls the movement of a player character in a given game space based on a movement operation of the player, comprising: a determination means for determining whether or not a predicament condition set as a condition indicating that the player character has reached a predicament regarding movement is satisfied; a rearrangement control means for performing rearrangement control to determine a rearrangement position of the player character in accordance with a character state based on a status and / or a moving speed of the player character when a given warp activation condition including at least a positive determination by the determination means is satisfied, and to cause the player character to appear at the rearrangement position; A computer system comprising:
17. A computer system that controls the movement of a player character in a given game space based on a movement operation of the player, comprising: a determination means for determining whether or not a predicament condition set as a condition indicating that the player character has reached a predicament regarding movement is satisfied; a rearrangement control means for performing rearrangement control to determine, when a given warp activation condition including at least a positive determination by said determination means is satisfied, a position where a character situation based on a status and / or a moving speed of an enemy character and / or an ally character satisfies a given character situation condition as a rearrangement position of said player character, and to cause said player character to appear at said rearrangement position; A computer system comprising:
18. A computer system that controls the movement of a player character in a given game space based on a movement operation of the player, comprising: a determination means for determining whether or not a predicament condition set as a condition indicating that the player character has reached a predicament regarding movement is satisfied; a rearrangement control means for performing rearrangement control to make the player character appear at a given rearrangement position when a given warp activation condition including at least a positive determination by the determination means is satisfied; Equipped with A constraint condition is set for determining whether the reallocation control is possible; and the relocation control means determines the warp activation conditions including the constraint conditions; A computer system.
19. A computer system that controls the movement of a player character in a given game space based on a movement operation of the player, comprising: a determination means for determining whether or not a predicament condition set as a condition indicating that the player character has reached a predicament regarding movement is satisfied; a rearrangement control means for performing rearrangement control to make the player character appear at a given rearrangement position when a given warp activation condition including at least a positive determination by the determination means is satisfied; a rearrangement position display control means for controlling the rearrangement position to be identifiable when a positive determination is made by the determination means; A computer system comprising:
20. A server system which is a computer system according to any one of claims 15 to 19; an operation terminal on which a player plays a game; A game system comprising:
Citation Information
Patent Citations
Network game system, recording medium, and program
JP2002263371A
Program, information storage medium, terminal, and server
JP2012210243A
Program and server device
JP2016067819A
Program and game system
JP2020031781A
Game system and program
JP2020044101A
