KR102310107B1 - Method and apparatus for generating game contents - Google Patents

Abstract

A method and apparatus for generating game content are disclosed. A method for generating game content according to an embodiment includes an operation of obtaining a rule of a neighbor relationship between a plurality of tiles corresponding to game content, an operation of generating a plurality of nodes, an operation of extracting a connection relationship between the plurality of nodes, and and disposing a plurality of tiles on a plurality of nodes based on a neighbor relationship rule and a connection relationship.

Description

Method and device for generating game content

The disclosed embodiments relate to game content creation techniques.

Online games require continuous and long-term gameplay, and through regular updates, new game play goals are proposed by releasing content such as new levels and items to game users. To this end, game companies provide various contents to users by using a procedural content generation (PCG) technique.

Recently, various game contents (eg, level, item arrangement, vector field) that satisfy the user's intuitively inputted adjacency rule are easily created using a wave function collapse (WFC) technique. However, the conventional grid-based wave function collapse technique has a problem in that it cannot be applied to unstructured data such as a navigation mesh.

Accordingly, there is a need for a method for generating game content applicable to the above-described unstructured data.

Disclosed embodiments are to provide a method and apparatus for generating game content.

A method for generating game content according to an embodiment includes an operation of obtaining a rule of a neighbor relationship between a plurality of tiles corresponding to game content, an operation of generating a plurality of nodes, an operation of extracting a connection relationship between the plurality of nodes, and and disposing a plurality of tiles on a plurality of nodes based on a neighbor relationship rule and a connection relationship.

The adjacency rule may include information on tiles that may be adjacent to each of the plurality of tiles, and the size of the adjacency rule may be determined based on the number of tiles and the number of tiles that may be adjacent to each of the plurality of tiles.

The connection relationship includes an edge connecting adjacent nodes among a plurality of nodes, and the extraction operation detects edges that intersect each other among a plurality of edges extracted from the plurality of nodes, and the edges that intersect each other You can choose one of them.

The arranging of the plurality of tiles may include selecting one of the plurality of nodes in which no tiles are disposed, arranging one of the plurality of tiles in the selected node based on information on tiles that can be placed in the selected node, and adjacent An operation of propagating information on tiles placed in a plurality of nodes to update information on tiles that can be placed in each of a plurality of nodes in which tiles are not placed on the basis of the relationship rule and the connection relationship, and in the adjacency rule and connection relationship and determining whether a tile disposed in each of a plurality of nodes in which a tile is disposed is suitable based on the operation.

The size of the information about the tile that can be arranged may be determined based on the number of the plurality of nodes and the number of the plurality of tiles.

The obtaining operation includes obtaining at least one of information on a tile that cannot be placed on each of the plurality of nodes and a selection frequency of each of the plurality of tiles, and the operation of arranging one of the plurality of tiles includes information on a placeable tile; One of the plurality of tiles may be disposed at the selected node based on at least one of information on tiles that cannot be disposed on each of the plurality of nodes and a selection frequency of each of the plurality of tiles.

The operation of arranging the plurality of tiles includes an operation of selecting one of the plurality of tiles until the tile is placed on a plurality of nodes on which the tile is not placed, if the tile placed on each of the plurality of nodes on which the tile is placed is suitable. The operation of placing and the operation of propagating may be repeatedly performed.

The disposing of the plurality of tiles may include relocating one of the plurality of tiles to a node at which the inappropriate tile is disposed when a tile disposed in at least one of the plurality of nodes in which the tiles are disposed is inappropriate.

A method for generating game content according to an embodiment includes a memory storing one or more instructions and one or more processors executing one or more instructions, wherein the one or more processors include: a rule of adjacency between a plurality of tiles corresponding to game content , create a plurality of nodes, extract a connection relationship between the plurality of nodes, and place a plurality of tiles on the plurality of nodes based on the neighbor relationship rule and the connection relationship.

The adjacency rule may include information on tiles that may be adjacent to each of the plurality of tiles, and the size of the adjacency rule may be determined based on the number of tiles and the number of tiles that may be adjacent to each of the plurality of tiles.

The connection relationship includes an edge connecting adjacent nodes among a plurality of nodes, and the one or more processors detect edges intersecting each other among a plurality of edges extracted from the plurality of nodes, and the edges intersecting each other You can choose one of them.

The one or more processors are configured to select one of the plurality of nodes in which no tile is placed, place one of the plurality of tiles in the selected node based on information about tiles that can be placed in the selected node, and follow the neighbor relationship rule and the connection relationship. The information on the tiles arranged in the plurality of nodes is propagated to update information on the tiles that can be placed in each of the plurality of nodes in which the tiles are not arranged based on the plurality of nodes, and the information on the tiles arranged in the plurality of nodes is propagated based on the neighbor relationship rule and the connection relationship. It may be determined whether a tile disposed in each node is appropriate.

The size of the information about the tile that can be arranged may be determined based on the number of the plurality of nodes and the number of the plurality of tiles.

The one or more processors are configured to obtain at least one or more of information on non-placeable tiles in each of the plurality of nodes and a selection frequency of each of the plurality of tiles, and information on deployable tiles and information on non-placeable tiles in each of the plurality of nodes. and arranging one of the plurality of tiles in the node selected based on at least one of a selection frequency of each of the plurality of tiles.

The one or more processors may perform an operation of selecting, arranging one of a plurality of tiles, until a tile is disposed on a plurality of nodes on which a tile is not disposed, when a tile disposed on each of the plurality of nodes on which the tile is disposed is suitable; The propagation operation can be repeatedly performed.

The one or more processors may relocate one of the plurality of tiles to a node on which the inappropriate tile is disposed when the tile disposed on at least one of the plurality of nodes on which the tile is disposed is inappropriate.

According to the disclosed embodiments, by arranging a plurality of tiles on a plurality of nodes based on a neighbor relationship rule and a connection relationship, a wave function technique is applied to unstructured data such as a navigation mesh to easily create game content can do.

1 is a block diagram of an apparatus for generating game content according to an embodiment.
2 is an exemplary diagram of a neighbor relationship rule according to an embodiment.
3 is an exemplary diagram of a plurality of nodes according to an embodiment.
4 is a diagram for explaining an example of generating a plurality of nodes according to an embodiment.
5 is a view for explaining an example of disposing a plurality of tiles according to an embodiment;
6 is an exemplary diagram of a plurality of nodes on which a plurality of tiles are disposed according to an embodiment.
7 is another exemplary diagram of a plurality of nodes on which a plurality of tiles are disposed according to an embodiment.
8 is an exemplary diagram of a plurality of nodes in which a plurality of tiles are disposed based on a selection frequency of each of the plurality of tiles, according to an embodiment.
9 is an exemplary diagram of a plurality of nodes generated in the form of a vector field according to an embodiment.
10 is an exemplary diagram in which a plurality of tiles are disposed on a plurality of nodes generated in the form of a vector field according to an exemplary embodiment.
11 is a diagram illustrating a result of particle simulation according to an exemplary embodiment.
12 is a flowchart of a method for generating game content according to an exemplary embodiment.
13 is a flowchart of a method of disposing a plurality of tiles according to an exemplary embodiment.
14 is a block diagram illustrating and describing a computing environment including a computing device suitable for use in example embodiments.

Hereinafter, specific embodiments will be described with reference to the drawings. The following detailed description is provided to provide a comprehensive understanding of the methods, apparatus, and/or systems described herein. However, this is only an example and is not limited thereto.

In describing the embodiments, if it is determined that a detailed description of a related known technology may unnecessarily obscure the gist of the present invention, the detailed description thereof will be omitted. And, the terms to be described later are terms defined in consideration of functions, which may vary depending on the intention or custom of the user or operator. Therefore, the definition should be made based on the content throughout this specification. The terminology used in the detailed description is for the purpose of describing the embodiments only, and should in no way be limiting. Unless explicitly used otherwise, expressions in the singular include the meaning of the plural. Also, expressions such as “comprising” or “comprising” are intended to indicate certain features, numbers, steps, acts, elements, some or combination thereof, and one or more other features than those described. , should not be construed to exclude the presence or possibility of any number, step, action, element, or any part or combination thereof.

Hereinafter, "game" means software that one or more gamers can enjoy using an input device mounted on or connected to a gaming device. Usually, it is performed by directly manipulating the player character or by manipulating the movement of objects in the game, and genres such as role-playing, adventure, and arcade are sometimes classified.

Hereinafter, the term "gaming device" refers to hardware that executes game software but performs calculations according to a user's input through an input device and outputs a result through an output device. For example, a personal computer (Personal Computer), laptop (Laptop Computer), game console (Game Console), smart phone (Smart Phone), tablet (Tablet) PC, smart band (Smart Band) or smart watch (Smart Watch) It may be in the form of a wearable device. In addition, hardware that satisfies the above definition is interpreted as belonging to a gaming device.

Hereinafter, the term “online game” refers to a game that must go through a network in order to play the game. In general, it refers to a game in which two or more gaming devices in a remote location are connected to each other through a network or synchronized through a server. As long as it satisfies the above definition, there is no limitation on the type of gaming device that executes the game. In addition to games executed on personal computers or game consoles, games executed on mobile devices such as smartphones, or games in which a plurality of different gaming devices (including different types of gaming devices) are linked or executed in the cloud are also described above. If it satisfies one definition, it is interpreted as belonging to an online game.

Hereinafter, “input device” refers to a device for inputting data into a gaming device. For example, an input device dedicated to game manipulation manufactured in the form of a joystick, mouse, keyboard, touch screen, hardware button or steering wheel, musical instrument, gun, glove, footrest, etc. may be mentioned. In addition, various sensors (temperature sensor, infrared sensor, motion sensor, gyro sensor, acceleration sensor, gravity sensor, etc.) installed or linked to gaming devices, Global Positioning System (GPS), Indoor Positioning System ), etc., can also be used as an example of an input device.

Hereinafter, the term “OutputDevice” refers to a device for displaying an operation result of a gaming device. The calculation result is displayed in a form that can be recognized using the human senses. It is not necessarily limited to a case where it is displayed visually or audibly, and it may be displayed in an olfactory or tactile form. For example, typical hardware such as speakers, monitors, and head-mounted displays satisfy the above definition, but devices that output in a tactile form, such as a 3D printer, or generate vibration, fragrance, or wind, may also be an example of the output device. have.

The above-described input device and output device may be included in the gaming device as one element of the gaming device, or may be connected to the gaming device through a separate wired or wireless interface.

1 is a block diagram of a game content generating apparatus 100 according to an exemplary embodiment.

In an embodiment, the game content generating apparatus 100 generates a plurality of nodes based on a graph structure, and then arranges the plurality of tiles on the plurality of nodes based on a rule of a neighbor relationship between a plurality of tiles corresponding to the game content. By doing so, it may be for generating game content. Specifically, the method for generating game content may be for generating game content even for unstructured data such as a navigation mesh by generating game content based on a graph structure. In this case, the game content may include various elements necessary for the game progress, such as in-game bases, resources, and non-player characters (NPCs).

Referring to FIG. 1 , the game content generating apparatus 100 includes an adjacency rule obtaining unit 110 , a graph structure generating unit 130 , and a tile arrangement unit 150 .

In an embodiment, the adjacency rule obtaining unit 110 , the graph structure generating unit 130 , and the tile arrangement unit 150 are implemented using one or more physically separated devices, or one or more processors or one or more processors and It may be implemented by a combination of software, and unlike the illustrated example, specific operations may not be clearly distinguished.

The adjacency rule acquiring unit 110 acquires the adjacency rule between a plurality of tiles corresponding to the game content.

In an embodiment, the adjacency rule obtaining unit 110 may obtain the adjacency rule between the plurality of tiles from the user.

In this case, the tile may be information corresponding to game content.

The adjacency rule may be a rule to be followed when arranging a plurality of tiles on a plurality of nodes. In an embodiment, the adjacency rule may include information on possible tiles adjacent to each of the plurality of tiles.

For example, as shown in FIG. 2 , it is assumed that A tile 210 , B tile 220 , and C tile 230 exist. A user may indicate that the A tile 210 may be adjacent to the A tile 210 , the B tile 220 , and the C tile 230 , the B tile 220 may be adjacent to the A tile 210 , and the C tile 230 . ) may input an adjacency rule indicating that the A tile 210 can be adjacent. In this case, the A tile 210 may be adjacent to all tiles according to the adjacency rule, but only the A tile 210 may be adjacent to the B tile 220 and the C tile 230 .

Also, the neighbor relationship rule obtaining unit 110 may obtain from the user at least one or more of information about tiles that cannot be placed in each of the plurality of nodes and a selection frequency of each of the plurality of tiles.

In this case, information on tiles that cannot be arranged on each of the plurality of nodes may be a constraint condition that cannot be arranged on each node.

The selection frequency of each of the plurality of tiles may be information (stationary) indicating a probability that each tile is selected when a tile to be disposed in a node is selected. For example, when the ratio of the selection frequency of tiles A and B is 2:1, when tiles are placed in a node, the probability of placing the A tile under the same conditions may be twice as high as the probability of placing the B tile. .

The graph structure generating unit 130 generates a graph structure for representing a virtual state space in the game. In this case, the graph structure may include a node and an edge connecting the nodes.

Specifically, the graph structure generating unit 130 generates a plurality of nodes.

In an embodiment, the graph structure generator 130 may generate a plurality of nodes for arranging game content in a virtual state space within the game. A node may be an area for arranging tiles corresponding to game content.

Also, the graph structure generator 130 may generate a plurality of nodes based on various algorithms such as a Voronoi diagram and a Poisson distribution.

For example, as shown in FIG. 3 , the graph structure generator 130 may generate a plurality of nodes in the form of a Voronoi diagram in the state space. In this case, the size, shape, shape, etc. of each node may be different for each node.

Meanwhile, the above-described example is merely an embodiment, and the graph structure generator 130 may generate a plurality of nodes through various methods other than the above-described algorithm.

The graph structure generator 130 extracts a connection relationship between a plurality of nodes.

In this case, the connection relationship may include information on which node each node is connected to. In an embodiment, the connection relationship may include an edge connecting adjacent nodes among a plurality of nodes.

For example, the graph structure generator 130 may extract an edge between a plurality of nodes based on a pathfinding algorithm. Specifically, the graph structure generating unit 130 may extract a plurality of edges having a length equal to or less than a preset threshold value while connecting each node.

Also, in an embodiment, the graph structure generator 130 may detect edges that intersect each other among a plurality of edges extracted from a plurality of nodes, and select one of the edges that intersect each other.

Specifically, the graph structure generator 130 may detect edges that intersect each other when viewed along the z-axis among the plurality of edges. Thereafter, the computing device 12 may select one of the intersecting edges by using a method of deleting the long edge among the intersecting edges.

Meanwhile, in the above-described example, the graph structure generator 130 has been described as extracting the edge based on the path finding algorithm, but the present invention is not limited thereto, and the edge may be extracted based on various algorithms.

The tile arrangement unit 150 arranges a plurality of tiles in a plurality of nodes based on an adjacent relationship rule and a connection relationship.

In an embodiment, the tile arrangement unit 150 may arrange a plurality of tiles on a plurality of nodes based on a Wave Function Collapse (WFC) technique.

In this case, the tile arrangement unit 150 may manage a neighbor relationship rule between a plurality of tiles and information on tiles that can be placed in a plurality of nodes by using variables such as a propagator and a compatibility.

In one embodiment, the adjacency rule may be stored in a variable called a propagation factor. In this case, the size of the adjacency rule may be determined based on the number of tiles and the number of tiles that may be adjacent to each of the plurality of tiles. Specifically, the size of the adjacency rule may be expressed as a product of the number of tiles and the number of tiles that may be adjacent to each of the plurality of tiles.

Also, information about tiles that can be placed in a plurality of nodes may be stored in a variable called compatibility. In this case, the size of the information about the tile that can be arranged may be determined based on the number of the plurality of nodes and the number of the plurality of tiles. Specifically, the size of the information on the tile that can be arranged may be expressed as a product of the number of the plurality of nodes and the number of the plurality of tiles.

That is, since the game content generating apparatus 100 generates game content based on the graph structure, it is difficult to specify the direction of each node unlike the existing grid structure-based method. Therefore, since the game content generating apparatus 100 generates game content based on the connection relationship between each node instead of the direction of each node, when determining the size of each of the information on the adjacent relationship rule and the placeable tile, the node direction is not taken into account. Accordingly, the information on the adjacency rule and the tile that can be placed has a size of a three-dimensional array in the grid structure-based method, but has the size of a two-dimensional array in the graph structure-based method.

Meanwhile, the tile arranging unit 150 selects a node on which a tile is not disposed among a plurality of nodes, performs an Observ operation of arranging a tile on the selected node, and transmits information about the disposed tile to other nodes except for the selected node. The propagation operation to propagate to the user can be repeatedly performed.

In an embodiment, the tile arrangement unit 150 may generate information about tiles that can be placed in each of a plurality of nodes. In this case, initially, all tiles can be arranged on a plurality of nodes, but as tiles are arranged, the number of tiles that can be arranged on each node can be gradually reduced according to a neighbor relationship rule and a connection relationship.

Also, according to an embodiment, the tile arrangement unit 150 may select one of a plurality of nodes on which tiles are not arranged.

Specifically, the tile arrangement unit 150 may select a node having the lowest entropy among a plurality of nodes in which tiles are not arranged. In this case, a node having the lowest entropy may be a node having the smallest number of tiles that can be arranged. Also, when the user sets the selection frequency of each of the plurality of tiles, the entropy of each node may be affected by the selection frequency of each tile.

Also, according to an embodiment, the tile arrangement unit 150 may place one of a plurality of tiles on the selected node based on information on tiles that can be placed on the selected node.

Specifically, the tile arrangement unit 150 may arrange one of the plurality of tiles in a node based on information about tiles that can be placed in each of the plurality of nodes, information about tiles that cannot be placed, and a selection frequency of each tile.

Also, according to an embodiment, the tile arrangement unit 150 is configured to update information on tiles that can be placed in each of a plurality of nodes where tiles are not arranged based on the neighbor relationship rule and the connection relationship to the tiles arranged in the plurality of nodes. information can be disseminated.

Specifically, the tile arrangement unit 150 may dispose a tile on a selected node and then propagate information indicating that no other tiles may be placed on the corresponding node to a plurality of nodes. Also, the tile arrangement unit 150 may update information on tiles that can be placed in nodes where tiles are not yet arranged by propagating information on tiles arranged in a plurality of nodes.

Accordingly, as the tiles are arranged, the uncertainty of the entire state space including the plurality of nodes may gradually decrease.

Also, the tile arrangement unit 150 may further include a backtrack operation of relocating a tile to a corresponding node when a tile placed in a node is not suitable after performing an observation operation and a propagation operation.

In an embodiment, the tile arrangement unit 150 may determine whether a tile disposed in each of a plurality of nodes in which a tile is disposed is suitable based on an adjacent relationship rule and a connection relationship.

Specifically, the tile arrangement unit 150 identifies nodes connected to each node in which the tile is arranged based on the connection relationship, and based on the neighbor relationship rule, the tile arranged at each node and the tile arranged at neighboring nodes. It can be determined whether they are adjacent to each other. In this case, when the tiles disposed in the neighboring nodes are adjacent to each other, the tile arrangement unit 150 may determine that a suitable tile is disposed.

Thereafter, when the tile arranged on each of the plurality of nodes on which the tiles are arranged is suitable, the tile arrangement unit 150 determines the plurality of nodes on which the above-described tiles are not arranged until the tiles are arranged on the plurality of nodes on which the tiles are not arranged. An operation of selecting one of the tiles, an operation of arranging one of the plurality of tiles, and an operation of propagating may be repeatedly performed.

Alternatively, when a tile disposed on at least one of a plurality of nodes on which tiles are disposed is inappropriate, the tile arrangement unit 150 may rearrange one of the plurality of tiles at a node on which an inappropriate tile is disposed.

Specifically, when a tile that violates the neighbor relationship rule is disposed on a node connected to the periphery, the node and the node connected to the periphery may collide with each other. In this case, the tile arrangement unit 150 may relocate the tile to the node where the inappropriate tile is placed while returning to the process before the collision occurs.

4 is a diagram for explaining an example of generating a plurality of nodes according to an embodiment.

4 may be for explaining an example of generating a plurality of nodes from, for example, a navigation mesh.

Fig. 4(a) shows an in-game map based on a navigation mesh.

In an embodiment, the graph structure generator 130 may extract a plurality of nodes using a Poisson distribution technique. It can be seen that the extracted nodes are distributed in each area as shown in FIG. 4(b). In this case, the extracted nodes are separated from each other by a certain distance and may be connected to one or more other nodes.

Thereafter, the graph structure generator 130 may extract a plurality of edges from a plurality of nodes based on a path finding algorithm. The extracted edges may be represented by lines connecting each node as shown in FIG. 4(c) .

Thereafter, the graph structure generating unit 130 extracts edges that intersect each other among a plurality of edges, and deletes long edges among the edges that intersect each other when the image is viewed from the z-axis. One of the edges can be selected.

For example, looking at area 410, it can be confirmed that edges intersecting each other exist. In this case, the graph structure generating unit 130 may delete long edges from among the edges that cross each other so that there are no edges that cross each other.

Accordingly, as shown in FIG. 4D , the graph structure generator 130 may finally generate a plurality of nodes connected by edges that do not overlap each other.

5 is a diagram for explaining an example of disposing a plurality of tiles according to an exemplary embodiment.

Referring to FIG. 5 , the adjacency rule obtaining unit 110 may obtain the adjacency rule 510 from the user. In this case, the adjacency rule 510 may be input in a text format.

For example, the user may use the A tile 520 and B tile 530 so that the A tile 520 can be adjacent to all tiles, but the B tile 530 and the C tile 540 can only be adjacent to the A tile 520 . ) and the adjacent relationship rule 510 between the C tile 540 may be input in text format.

Thereafter, the tile arrangement unit 150 may arrange a plurality of tiles in a plurality of nodes based on an adjacency rule. In this case, looking at each tile disposed in the plurality of nodes, it can be confirmed that each tile satisfies the neighbor relationship rule 510 .

Specifically, looking at region 550, nodes connected to the node on which the B tile 530 is disposed have the A tile 520 disposed, and the C tile 540 will be disposed around the node on which the B tile 530 is disposed. It can be confirmed that does not exist.

Also, looking at area 560 , it can be seen that tiles matching the neighbor relationship rule are also arranged in nodes connected to the node in which the C tile 540 is arranged in the same manner as in the B tile 530 described above.

6 is an exemplary diagram of a plurality of nodes on which a plurality of tiles are disposed according to an embodiment.

6 is a diagram illustrating solving a four-color problem using the game content generating apparatus 100 . At this time, the four-color problem is the theory that different colors can be arranged in nodes connected to each node with four colors.

Specifically, in FIG. 6 , each of the plurality of tiles may have a different color.

In this case, each tile may be adjacent to all tiles except itself according to the adjacency rule.

The tile arrangement unit 150 may arrange tiles in each of the plurality of nodes based on the above-described neighbor relationship rule. Specifically, it can be confirmed that the color arranged in each node is different from the color arranged in the nodes connected to the periphery.

Accordingly, it can be confirmed that the game content generating apparatus 100 can solve the four-color problem using only the connection relationship and the neighbor relationship rule of each node.

7 is another exemplary diagram of a plurality of nodes on which a plurality of tiles are disposed according to an embodiment.

In the example shown in FIG. 7 , it is assumed that a gray tile, a red tile, a yellow tile, and a blue tile exist. In this case, each tile may be information corresponding to game content.

Also, according to the adjacency rule, a gray tile may be adjacent to all tiles including itself, but only a gray tile may be adjacent to a red tile, a yellow tile, and a blue tile.

In this case, the tile arrangement unit 150 may arrange tiles on a plurality of nodes generated on the in-game map, respectively, based on the above-described neighbor relationship rule. Specifically, it can be confirmed that all tiles arranged in each node satisfy the adjacency rule.

8 is an exemplary diagram of a plurality of nodes in which a plurality of tiles are disposed based on a selection frequency of each of the plurality of tiles, according to an embodiment.

8 is a diagram in which each of the tiles is arranged in a plurality of nodes after the selection frequencies of each of the plurality of tiles are set to be different from each other.

Specifically, in FIG. 8A , the selection frequency of each of the gray tile, the red tile, the yellow tile, and the blue tile is set to 5:1:1:1.

In this case, referring to FIG. 8A , it can be seen that the number of nodes on which gray tiles are disposed is the largest.

8(b) shows that the selection frequency of each of the gray tile, the red tile, the yellow tile, and the blue tile is set to 1:5:1:1.

In this case, referring to FIG. 8B , it can be seen that there are more nodes in which red tiles are disposed than in nodes in which yellow tiles and blue tiles are disposed. At this time, according to the adjacency rule, a gray tile can be adjacent to all tiles, but a red tile can only be adjacent to a gray tile. It can be seen that there are more nodes where the gray tiles are arranged.

8(c) shows that the selection frequency of each of the gray tile, the red tile, the yellow tile, and the blue tile is set to 1:1:5:1.

In this case, referring to FIG. 8(c) , it can be confirmed that there are more nodes in which yellow tiles are arranged than in nodes in which red tiles and blue tiles are arranged. At this time, according to the adjacency rule, a gray tile can be adjacent to all tiles, but a yellow tile can only be adjacent to a gray tile. It can be seen that there are more nodes where the gray tiles are arranged.

FIG. 8(d) shows that the selection frequency of each of the gray tile, the red tile, the yellow tile, and the blue tile is set to 1:1:1:5.

In this case, referring to FIG. 8(d) , it can be confirmed that there are more nodes in which blue tiles are arranged than in nodes in which red tiles and yellow tiles are arranged. At this time, according to the adjacency rule, a gray tile can be adjacent to all tiles, but a blue tile can only be adjacent to a gray tile. It can be seen that there are more nodes where the gray tiles are arranged.

9 is an exemplary diagram of a plurality of nodes generated in the form of a vector field according to an embodiment.

FIG. 9 may be for generating an element called 'wind' in a game by using the game content generating apparatus 100 .

Specifically, in order to naturally generate wind, the direction or strength of the wind must change naturally. Therefore, in order to generate unstructured data called wind, it is necessary to create a plurality of nodes to apply the graph structure-based wave function collision technique.

Specifically, the graph structure generating unit 130 may generate a plurality of nodes for wind by using the Voronoi diagram, and then may generate a three-dimensional vector field by designating a vector value to each generated node. In this case, the vector may be composed of one size information and two direction information. Such a three-dimensional vector field can extract features of content with less computational cost than existing grid structure-based data, and can be used as a constraint (for example, information about tiles that cannot be placed in each of a plurality of nodes) or stationary (for example, For example, there is an advantage in that the selection frequency of each of the plurality of tiles) can be easily applied.

Meanwhile, the user may set the adjacency relationship rule between vectors based on the magnitude and direction of the vectors. For example, when the first vector and the second vector adjacent to the first vector have a size smaller than a preset threshold, the first vector and the second vector may be set to be adjacent. Also, when the size of the dot product of the two vectors is equal to or greater than a preset threshold, the two vectors may be set to be adjacent to each other.

For example, it is assumed that the neighboring vector is set to be adjacent to the neighboring vector when the size of the neighboring vector is 2 or less and the angle with the neighboring vector is 60 degrees or less with respect to the adjacency relation rule between the plurality of vectors. In this case, as shown in FIG. 9 , the green vector may be adjacent to the yellow vectors according to the adjacency rule.

10 is an exemplary diagram in which a plurality of tiles are disposed on a plurality of nodes generated in the form of a vector field according to an exemplary embodiment.

10 illustrates that a virtual three-dimensional space within a game is generated by using the game content generating apparatus 100 .

FIG. 10(a) shows that a plurality of tiles are arranged on a plurality of nodes generated in a sky space in a three-dimensional space, and FIG. 10(b) shows a plurality of tiles are disposed on a plurality of nodes generated in a space close to the ground surface. shown to be placed.

In an embodiment, when generating game content using a vector field in a three-dimensional space, the graph structure generator 130 may generate a plurality of nodes using a voronoi cell.

In this case, since game characters do not pass through the plurality of nodes generated in the sky, the precision of the plurality of nodes may be low. Accordingly, it can be confirmed that the plurality of nodes generated in the sky space are large in size and are generated far apart from each other.

On the other hand, since a plurality of nodes generated in a space close to the ground surface is a space through which game characters pass, the precision of the plurality of nodes must be high. Accordingly, it can be confirmed that the plurality of nodes generated in a space close to the earth's surface are small in size and generated to be close to each other.

11 is a diagram illustrating a result of particle simulation according to an exemplary embodiment.

FIG. 11 shows that particle simulation is executed in a virtual three-dimensional space in the game generated in FIG. 10 .

Specifically, it can be confirmed that a plurality of nodes existing in the three-dimensional space move in consideration of the connection relationship between each node. Accordingly, it can be seen that the plurality of nodes on which tiles are arranged move naturally.

Accordingly, the game content generating apparatus 100 may procedurally generate game content by applying the wave function collapse technique to unstructured data such as a navigation mesh, a 3D texture, and the like.

12 is a flowchart of a method for generating game content according to an exemplary embodiment.

The method shown in FIG. 12 may be performed, for example, by the game content generating apparatus 100 shown in FIG. 1 .

Referring to FIG. 12 , in operation 1210 , the game content generating apparatus 100 acquires a rule of a neighbor relationship between a plurality of tiles corresponding to the game content.

In this case, the game content generating apparatus 100 may acquire at least one of information about tiles that cannot be placed in each of the plurality of nodes and a selection frequency of each of the plurality of tiles.

In operation 1220, the game content generating apparatus 100 generates a plurality of nodes.

In operation 1230, the game content generating apparatus 100 extracts a connection relationship between a plurality of nodes.

In this case, the game content generating apparatus 100 may detect edges intersecting each other among a plurality of edges extracted from a plurality of nodes, and may select one of the intersecting edges.

In operation 1240 , the game content generating apparatus 100 arranges a plurality of tiles in a plurality of nodes based on a neighbor relationship rule and a connection relationship.

13 is a flowchart of a method of arranging a plurality of tiles in a plurality of nodes according to an embodiment.

The method illustrated in FIG. 13 may be performed by, for example, the game content generating apparatus 100 illustrated in FIG. 1 .

Referring to FIG. 13 , in operation 1310 , the game content generating apparatus 100 may select one of a plurality of nodes on which tiles are not disposed.

In operation 1320 , the game content generating apparatus 100 may arrange one of a plurality of tiles in the selected node based on information about tiles that can be placed in the selected node.

In this case, the game content generating apparatus 100 is configured to select a node from among a plurality of tiles based on at least one of information on a tile that can be placed, information about a tile that cannot be placed on each of the plurality of nodes, and a selection frequency of each of the plurality of tiles. You can place one.

In operation 1330 , the game content generating apparatus 100 updates information on tiles that can be placed on each of a plurality of nodes in which tiles are not arranged based on the neighbor relationship rule and the connection relationship, so as to update information on tiles arranged in a plurality of nodes. can spread

In operation 1340 , the game content generating apparatus 100 may determine whether a tile disposed in each of a plurality of nodes in which a tile is disposed is suitable based on a connection relationship and a neighbor relationship rule.

If it is determined in operation 1340 that the tile disposed on each of the plurality of nodes on which the tile is disposed is suitable, in operation 1350 , the game content generating apparatus 100 may determine whether the tile is disposed on all nodes.

If it is determined in operation 1350 that tiles are not arranged in all nodes, the game content generating apparatus 100 may repeat operations 1310 , 1320 , 1330 , and 1340 until tiles are arranged in all nodes.

Alternatively, if it is determined in operation 1350 that tiles are arranged in all nodes, the game content generating apparatus 100 may end the game content generating method.

Meanwhile, if it is determined in operation 1340 that the tile disposed on at least one of the plurality of nodes on which the tile is disposed is inappropriate, in operation 1360 , the game content generating apparatus 100 determines one of the plurality of tiles at the node on which the inappropriate tile is disposed. can be rearranged.

14 is a block diagram illustrating and describing a computing environment including a computing device suitable for use in example embodiments. In the illustrated embodiment, each component may have different functions and capabilities other than those described below, and may include additional components other than those described below.

The illustrated computing environment 10 includes a computing device 12 . In one embodiment, the computing device 12 may be the game content generating device 100 according to the disclosed embodiments.

Computing device 12 includes at least one processor 14 , computer readable storage medium 16 , and communication bus 18 . The processor 14 may cause the computing device 12 to operate in accordance with the exemplary embodiments discussed above. For example, the processor 14 may execute one or more programs stored in the computer-readable storage medium 16 . The one or more programs may include one or more computer-executable instructions, which, when executed by the processor 14, may be configured to cause the computing device 12 to perform operations in accordance with the exemplary embodiment. have.

Computer-readable storage medium 16 is configured to store computer-executable instructions or program code, program data, and/or other suitable form of information. The program 20 stored in the computer readable storage medium 16 includes a set of instructions executable by the processor 14 . In one embodiment, computer-readable storage medium 16 includes memory (volatile memory, such as random access memory, non-volatile memory, or a suitable combination thereof), one or more magnetic disk storage devices, optical disk storage devices, flash It may be memory devices, other forms of storage medium accessed by computing device 12 and capable of storing desired information, or a suitable combination thereof.

Communication bus 18 interconnects various other components of computing device 12 , including processor 14 and computer readable storage medium 16 .

Computing device 12 may also include one or more input/output interfaces 22 and one or more network communication interfaces 26 that provide interfaces for one or more input/output devices 24 . The input/output interface 22 and the network communication interface 26 are coupled to the communication bus 18 . Input/output device 24 may be coupled to other components of computing device 12 via input/output interface 22 . Exemplary input/output device 24 may include a pointing device (such as a mouse or trackpad), a keyboard, a touch input device (such as a touchpad or touchscreen), a voice or sound input device, various types of sensor devices, and/or imaging devices. input devices and/or output devices such as display devices, printers, speakers and/or network cards. The exemplary input/output device 24 may be included in the computing device 12 as a component constituting the computing device 12 , and may be connected to the computing device 12 as a separate device distinct from the computing device 12 . may be

In the above, the technical features have been described focusing on the embodiments. However, the disclosed embodiments should be considered from an illustrative point of view rather than a limiting point of view, and the scope of rights is indicated in the claims rather than the above description, and all differences within an equivalent range are interpreted as being included in the scope of rights. it should be

10: Computing Environment
12: computing device
14: Processor
16: computer readable storage medium
18: communication bus
20: Program
22: input/output interface
24: input/output device
26: network communication interface
100: game content creation device
110: adjacency rule acquisition unit
130: graph structure generating unit
150: tile placement unit

Claims (16)

one or more processors, and
A method performed in a computer device having a memory storing one or more programs to be executed by the one or more processors, the method comprising:
obtaining an adjacency rule between a plurality of tiles corresponding to game content;
creating a plurality of nodes;
extracting a connection relationship between the plurality of nodes; and
arranging the plurality of tiles in the plurality of nodes based on the neighbor relationship rule and the connection relationship;
The operation of arranging the plurality of tiles includes:
selecting one of a plurality of nodes on which tiles are not disposed;
arranging one of the plurality of tiles in the selected node based on information on tiles that can be placed in the selected node; and
and propagating the information on the arranged tiles to the plurality of nodes so as to update information on the tiles that can be placed in each of the plurality of nodes where the tiles are not arranged based on the neighbor relationship rule and the connection relation. How to create content. The method according to claim 1,
The adjacency rule includes information on tiles that can be adjacent to each of the plurality of tiles,
The size of the adjacency rule is determined based on the number of the plurality of tiles and the number of tiles that may be adjacent to each of the plurality of tiles. The method according to claim 1,
The connection relationship includes an edge connecting adjacent nodes among the plurality of nodes,
The extracting may include detecting edges intersecting each other among a plurality of edges extracted from the plurality of nodes, and selecting one of the intersecting edges. The method according to claim 1,
The operation of arranging the plurality of tiles includes:
and determining whether a tile disposed in each of a plurality of nodes in which a tile is disposed is suitable based on the neighbor relationship rule and the connection relationship. 5. The method according to claim 4,
The size of the information on the placeable tiles is determined based on the number of the plurality of nodes and the number of the plurality of tiles. 5. The method according to claim 4,
The acquiring includes acquiring at least one of information on tiles that cannot be placed in each of the plurality of nodes and a selection frequency of each of the plurality of tiles,
The disposing of one of the plurality of tiles may include: the selected based on at least one of information on the tile that can be placed, information on tiles that cannot be placed in each of the plurality of nodes, and a selection frequency of each of the plurality of tiles. A method for generating game content, comprising placing one of the plurality of tiles on a node. 5. The method according to claim 4,
The disposing of the plurality of tiles may include, if a tile disposed at each of the plurality of nodes on which the tiles are disposed is suitable, selecting the plurality of tiles until the tiles are disposed on the plurality of nodes where the tiles are not disposed; A method of generating game content by repeatedly performing an operation of arranging one of the following and an operation of propagating the same. 5. The method according to claim 4,
The arranging of the plurality of tiles includes, when a tile disposed on at least one of the plurality of nodes on which the tiles are disposed is inappropriate, relocating one of the plurality of tiles to the node on which the inappropriate tile is disposed. a memory that stores one or more instructions; and
one or more processors executing the one or more instructions;
The one or more processors,
obtaining a rule of adjacency between a plurality of tiles corresponding to the game content;
create multiple nodes,
Extracting the connection relationship between the plurality of nodes,
disposing the plurality of tiles in the plurality of nodes based on the adjacent relationship rule and the connection relationship,
Select one of a plurality of nodes with no tiles placed,
disposing one of the plurality of tiles in the selected node based on information on tiles that can be placed in the selected node;
and propagating information on the arranged tiles to the plurality of nodes so as to update information on the tiles that can be placed in each of the plurality of nodes where the tiles are not arranged based on the neighbor relationship rule and the connection relation. 10. The method of claim 9,
The adjacency rule includes information on tiles that can be adjacent to each of the plurality of tiles,
The size of the adjacency rule is determined based on the number of the plurality of tiles and the number of tiles that may be adjacent to each of the plurality of tiles. 10. The method of claim 9,
The connection relationship includes an edge connecting adjacent nodes among the plurality of nodes,
The at least one processor detects edges that intersect each other among a plurality of edges extracted from the plurality of nodes, and selects one of the intersecting edges. 10. The method of claim 9,
The one or more processors,
A game content generating apparatus for determining whether a tile disposed in each of a plurality of nodes in which a tile is disposed is suitable based on the neighbor relationship rule and the connection relationship. 13. The method of claim 12,
The size of the information on the placeable tiles is determined based on the number of the plurality of nodes and the number of the plurality of tiles. 13. The method of claim 12,
The one or more processors,
obtaining at least one or more of information on tiles that cannot be placed in each of the plurality of nodes and a selection frequency of each of the plurality of tiles;
A game in which one of the plurality of tiles is placed in the selected node based on at least one of information on the placeable tiles, information on tiles that cannot be placed on each of the plurality of nodes, and a selection frequency of each of the plurality of tiles content creation device. 13. The method of claim 12,
The one or more processors, if the tile disposed in each of the plurality of nodes on which the tile is disposed is suitable, the operation of selecting the tile until the tile is disposed on the plurality of nodes where the tile is not disposed, and disposing one of the plurality of tiles A game content generating device that repeatedly performs the operation and the propagation operation. 13. The method of claim 12,
The one or more processors may be configured to, when a tile disposed in at least one of a plurality of nodes in which tiles are disposed is inappropriate, relocating one of the plurality of tiles to a node in which the inappropriate tiles are disposed.

Images