JP3359981B2 - Group Character Display Method in Role Playing Game - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a role playing game of a type using a group of characters.

[0002]

2. Description of the Related Art Early role-playing games were games in which one character was the main character. Later, role-playing games in which a plurality of characters are active in groups appeared, and most role-playing games are nowadays. It is of the type that is performed in groups of multiple characters.

[0003] In addition, while the initial role-playing game mainly displayed various numerical values of characters in terms of screen display, nowadays, the screen viewed from the hero's viewpoint,
Various types, such as screens viewed from diagonally above, are being used.

On the screen viewed from the above obliquely upper side, the hero himself is also displayed on the screen. In a case where the character is composed of a group of a hero and a plurality of other characters, the characters constituting the group are arranged and moved in a daisy chain. This has led to changes in the game, making it more complex and more realistic.

[0005] In a game having a friend who moves in a tracing manner by connecting beads, the movement of the following friend is a potato vine type. As shown in FIG. 1, an example will be described in which six characters from No. 1 to No. 6 move in a group. When the first character at the beginning moves, the second character is moved to the empty position, and the platoon is moved to the third position at the second position.

[0006] The field on which the main characters walk on the screen of the role playing game is called a map. The map depicts trees, houses, village marks, doors, and the like, and is displayed on a BG (background) screen. Each time the protagonists enter the village, get out of the village, enter the store ...
All maps switch. That is, the background changes.

As shown in FIG. 2, a map is a picture in units of 16 × 16 dots called a cell, and includes a tree, a village entrance, a shop entrance, a bridge, and so on. The upper left corner of the map is at cell coordinates (0,
0), the right side is determined as (1,0), and the lower side is determined as (0,1). In the case of a 256 × 256 dot map, the lower right corner is (15,15). The position of the character is represented by cell coordinates.

[0008] The hero moves by the putting operation of the player. If there is no obstacle in the direction in which the direction key is pressed, the hero moves in that direction. It will not move if there are obstacles. In this example, the hero moves in units of 16 dots, that is, in units of cells. Even if the pad is pressed lightly and released immediately, it moves in units of 16 dots.

Therefore, in this example, the hero is always located on a cell, and does not exist at an incomplete position such as between a tree cell and a soil cell. Considering this in terms of cell coordinates, it is assumed that the hero is at cell coordinates (x, y) at a certain point in time. The direction key pressed and the cell coordinates to be moved at that time are as shown in the chart of FIG. The hero moves in units of several dots (usually in units of one dot) from the moment it is pressed, and when it advances by 16 dots, the program recognizes that it has reached the target cell and stops if there is no input from the pat at that time .

Next, the movement of a fellow character will be described. The number of friends is N (≧ 1), and the cell coordinates of the hero are (X
₀ (t), Y ₀ (t)), the direction is D ₀ (t), and the friend n
The cell coordinates of (1 ≦ n ≦ N) are represented by (X _n (t), Y
_n (t)), the direction and D _n (t). Here, t is a natural number representing a time point. Immediately after the map switch, the protagonist and his friends are all located at the same cell coordinates and in the same direction. This is the state at t = 0 in FIG. Time point t = 0
Then

X ₀ (0) = X ₁ (0) =... = X _N (0) Y ₀ (0) = Y ₁ (0) =... = Y _N (0) D ₀ (0) = D ₁ (0) =... = D _N (0)

## EQU1 ## Here, when the hero moves by unit in the direction d (1), the target cell of the hero becomes (X ₀ (1), Y ₀
(1)). Actually, one in one of the top, bottom, left and right
Since only six dots have been moved, either X or Y of the cell coordinates has changed. The point is that this is moved to the next cell, so if you use the formula,

| X ₀ (1) −X ₀ (0) | + | Y ₀ (1)
−Y ₀ (0) | = 1 {X ₀ (1) −X ₀ (0)} × {Y ₀ (1) −Y ₀ (0)}
= 0 D ₀ (1) = d (1)

## EQU1 ## This is the state at t = 1 in FIG. At the same time, friends move. Since the target cell of a friend is the cell coordinates of the friend located in front of him before moving,

X _n (1) = X _n-1 (0) Y _n (1) = Y _n-1 (0) D _n (1) = D _n-1 (0) (1 ≦ n ≦ N)

## EQU1 ## If this is repeated T (≧ N) times, the friend before him will always be in the cell next to himself. This can be expressed as

| X _n (T) −X _n−1 (T) | + | Y
_{n (T) -Y n-1} (T) | = 1 {X n (T) -X n-1 (T)} × {Y n (T) -Y
_n-1 (T)｝ = 0 (1 ≦ n ≦ N, T ≧ N)

## EQU1 ## With the above formula, the march of the friend's potato vine (beading rosary) formula following the hero can be expressed.

[0019]

The movement of the potato vine type as described above is natural for an orderly arrangement such as an army, but it is a natural process, but it is a procession of children, monkeys and dogs. It is unnatural in a platoon made by animals such as
In addition, there are aspects that are orderly and lack interest.

In the present invention, the main purpose is to provide a variety of movements in accordance with the individuality of the characters forming the platoon, thereby providing a more active game configuration. However, the basic platoon itself does not break down extremely. This is because if the movement is completely disjointed, it will not be a platoon.

[0021]

As in the prior art, the main character (the leading character) is moved by the instruction of the player. Subsequent companion characters are listed in order, and the position in the case of following the hero as usual (a pot-vine march) is set as the basic position of the companion character. Next, a relative position is determined by an algorithm determined for each of the fellow characters. The vector sum of the basic position and the relative position is set as the target position of the fellow character, and the character is moved to the target position at a unique moving speed set for the fellow character.

FIG. 5 is a diagram for explaining the displacement of the third character. The third position in the case of the conventional potato vine type as shown in FIG. This is calculated according to the algorithm of the third character, and the relative position is determined as shown in (2) of FIG. As a result, the target position is obtained from the basic position and the relative position as shown in (3) of FIG. The algorithm defined for each of the fellow characters (characters other than the main character) is as follows.

(A) Determine the moving speed. (B) Determine the probability of performing a direction change (random walk). However, the relative position of some characters is determined only by their positional relationship. In some cases, the range of the relative position is determined. In any case, these are set as motion rules for each character. (C) Determine how long the hero moves, or how long it will take before turning.

The above is the initial setting, and the calculation of the actual direction change (random walk) is performed as follows.

(D) Find a basic position. In this case, the position of each character assuming the potato vine movement is determined, and this is set as the basic position. (E) Determine whether to change direction. Generate random numbers,
If the probability is within the range specified for the character, change direction.
It is not necessary to calculate probabilities for characters having directivity in their positional relationship or direction of movement. (F) When it is decided to change the direction, the relative position is obtained according to the algorithm defined for the character. (G) The basic position and the relative position are added, and this is set as the target position. (H) However, if there is an obstacle at the target position or if there is another character and cannot move, the target position is returned to the previous value, and the relative position is determined so that the target position becomes that value. (That is, put the character in a state of a short pause.) (I) Compare the current position with the target position, and if there is a difference, move to the target position at the moving speed of the character.

The above is the algorithm of the present invention, and FIG. 6 shows each algorithm in a flowchart.

[0027]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS As an embodiment of the present invention, a case will be described in which the main character No. 0 moves with his fellow No. 1 to 5 characters. As discussed in the prior art, the potato vine march

X _n (t) = X _n-1 (t-1) Y _n (t) = Y _n-1 (t-1) D _n (t) = D _n-1 (t-1)

## EQU1 ## Based on this equation, t = t _{0 to} t ₀ +4
FIG. 7 illustrates the movement up to this point. Here the hero (0
Numbers are squares and friends are circles. However, the direction D is ignored, but in an actual game, the direction D is important for people and animals.

Attention is paid to the character of n = 2 (black circle in FIG. 7). No. 2 is the relative position ± 5 cells (± 80 dots)
And the direction change is 25 for every 16 dots
Suppose that it is performed with a probability of%. To change the direction with a probability of 25%, a uniform random number R (0 ≦ R ≦ 1) is generated on the program, and if 0.25 ≧ R, the direction change is performed, and the relative position is calculated.

The relative position can be calculated as 5 × Rp by generating a uniform random number R _p (| R _p | ≦ 1) for the X axis and the Y axis.
That is, a random walk within ± 5 cells is obtained. FIG. 8 shows an example of a march based on this condition. t = t ₀ +2
At the time of, the black dot protrudes from the column. This character does not return to the line until the relative position becomes (0, 0) by repeating the direction change. .

By changing the probability of the direction change and the range of the free action, the way of movement changes. For example, assuming that the direction change probability R is 70%, the result is as shown in FIG. In FIG. 9, the columns are disturbed even at t = t ₀ +3. That is, the higher the change probability, the higher the degree of movement regardless of the column.

As described above, when the direction change probability and the moving speed are determined for each character, a variety of marches can be expressed while maintaining the basic columns. By changing the random number sequence, a different march can be expressed.

As another embodiment, the main character is a friend No. 1 and a friend.
An example in which three persons No. 2 and No. 3 move in a group will be described. FIG. 10 shows a chart that defines rules for the movement of each of the fellow characters Nos. 1, 2, and 3. In the table, “processing time” indicates how much processing is performed with respect to the time v for processing the movement of the hero.

Since the friend No. 1 and the friend No. 2 are “every v”, this indicates that the processing time is the same as the processing time of the hero.
On the other hand, since the friend No. 3 is 4v, the movement of the hero is processed once while the movement of the hero is processed four times. On the other hand, the movement speed is the same for the hero No.1 and the hero No.2
Second, the friend No. 3 moves 4 dots during one processing time v.

When the friend No. 1 is located immediately after the hero, he walks diagonally to the right in the traveling direction, and the friend No. 2 moves normally. (Relative position is fixed at (0,0))

Friend No. 3 moves the relative position one cell at a random probability with a probability of 1/4, and one cell relative to the current direction with a probability of 3/4. There are two ways. The movement range is relative position (-6, -6) to (+ 6, + 6)
And move a wide range. The way of movement of the friend No. 3 is similar to the example shown in FIG. 8 or FIG.

On the other hand, the friend No. 1 and the friend No. 2 move according to certain rules (rules that are not probabilities). However, the friend No. 2 has twice the speed of the hero, so it looks like he is walking fine.

The processing for obtaining the relative position is performed in the part of "calculating the relative position" in the flowchart of FIG. That is, in the program, this portion is formed as a subroutine, and the relative position is calculated according to an algorithm determined for each character. When each character is moved according to the above rules, the formation order and the steps of each character are not necessarily fixed. However, since the basic position is fixed, even if there is a temporary disturbance of the platoon, the platoon will not be significantly collapsed. That is, the moving direction of the entire platoon is always ensured.

[0040]

As described above, according to the present invention, it is possible to make a fellow character accompanying a hero make a unique movement, and to produce a game full of a sense of reality. In the potato-vine type movement, the screen is monotonous while looking at the screen, but in the active walk of the present invention, each character has individuality and can change the movement.

[Brief description of the drawings]

FIG. 1 is an explanatory diagram of character movement in a conventional role playing game in which a plurality of characters move in groups.

FIG. 2 is an explanatory diagram of a map in a game.

FIG. 3 is a chart showing a direction key and a destination of a hero.

FIG. 4 is an explanatory diagram of a conventional movement of a group of characters.

FIG. 5 is an explanatory diagram of movement of a group of characters according to the present invention.

FIG. 6 is a flowchart of a movement of a group of characters according to the present invention.

FIG. 7 is an example of movement of a group of characters in a conventional role playing game.

FIG. 8 is an example of movement of a group of characters in the role playing game of the present invention.

FIG. 9 is an example of movement of a group of characters in the role playing game of the present invention.

FIG. 10 is a table showing a setting example of characters in the embodiment of the role playing game of the present invention.

──────────────────────────────────────────────────続 き Continuation of the front page (56) References JP-A-61-58680 (JP, A) JP-A-61-58681 (JP, A) "A computer game by Akira Yamashita Review on Playphone with phone! TARGET 13 MOTOR (Nintendo) ", microcomputer BASIC Magazine, Denpa Shimbun, October 1, 1989, Vol. 8, No. 10, p. 266-269 Tomoyoshi Yoshino, "X68 Game Programming with GCC, 19th Game Finishing (Part 2)", C MAGAZINE, SoftBank Corp., June 1, 1993, Vol. 5, No. 6 , P. 143-148 (58) Fields investigated (Int. Cl. ⁷ , DB name) G06T 13/00 A63F 13/00 CSDB (Japan Patent Office)

Claims (2)

(57) [Claims] In a role-playing game in which a group composed of a hero character and a plurality of fellow characters that move according to an instruction of a game operator moves, at least one fellow character of the fellow characters changes the moving speed and direction. Timing, and the probability of changing direction are determined, and the virtual position of the fellow character is assumed to be the basic position of the fellow character, assuming that the hero character has moved in a line following the trajectory of the hero character. When the direction change operation is determined, the relative position is obtained according to the algorithm determined for the fellow character, and the vector sum of the basic position and the relative position is set as the target position, but there is an obstacle at the target position. In this case, the target position is returned to the previous value, and the current position of the fellow character and the target position A group character display method, wherein if there is a difference, the group character is moved to the target position at the moving speed determined for the fellow character. 2. The group character display method according to claim 1, wherein the relative position is within a predetermined range.