Information processing program, information processing method, and information processing device

Abstract

To provide a program, a method, and a device for mutually relating adjacent compartments without using data showing a road, such as a sailing route, even if the compartments are discontinuous geographically.SOLUTION: An information processing program allows a computer to execute processing for: clustering multiple compartments obtained by dividing a geographical space into multiple clusters following continuity; and relating geographically discontinuous compartments from among the multiple compartments as adjacent compartments on the basis of the distance between compartments that belong to mutually different clusters from among the multiple clusters.SELECTED DRAWING: Figure 5

Description

[Technical field]

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

[0002] Patent Document 1 proposes a method and system for a computer to progress a game based on user position information, and a program for causing a computer to execute the method. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Patent Publication No. 2022-076018 Summary of the Invention [Problem to be solved by the invention]

[0004] However, there are cases where it is required to associate adjacent sections of a geographical space with each other. Conventionally, in order to meet such needs, for geographically discontinuous sections such as remote islands, route data indicating a route was used to associate sections where the route is connected (the section at the start point of the route and the section at the end point of the route) as adjacent sections. However, the conventional technology had a problem in that it was not possible to associate adjacent sections with each other for sections where the route or other road is not connected.

[0005] Therefore, an object of the present disclosure is to provide a program, method, and device that can associate adjacent sections with each other, even if they are geographically discontinuous, without using data indicating routes such as waterways. [Means for solving the problem]

[0006] An information processing program according to a first aspect causes a computer to execute a process of clustering a plurality of partitions obtained by dividing a geographical space into a plurality of clusters according to their continuity, and associating geographically discontinuous partitions among the plurality of partitions as adjacent partitions based on the distance between partitions belonging to different clusters among the plurality of clusters.

[0007] An information processing program according to a second aspect is an information processing program according to the first aspect, and causes the computer to execute a process of calculating a distance between the partitions using a distance between vertices of polygon data indicating the shape of one of the partitions belonging to the different clusters and a vertex of polygon data indicating the shape of the other partition.

[0008] An information processing program according to a third aspect is an information processing program according to the second aspect, which causes the computer to execute a process of calculating a distance between vertices included in a set of grids in which the distance between the grids is shortest between a group of grids including vertices of polygon data indicating the shape of one of the plurality of grids obtained by dividing the geographical space at equal intervals, and a group of grids including vertices of polygon data indicating the shape of the other of the plurality of grids.

[0009] An information processing program according to a fourth aspect is an information processing program according to any one of the first to third aspects, and causes the computer to execute a process of merging a cluster to which one of the adjacent areas belongs and a cluster to which the other of the adjacent areas belongs into one cluster.

[0010] An information processing program according to a fifth aspect is an information processing program according to the fourth aspect, which causes the computer to execute a process of associating the geographically discontinuous sections as adjacent sections for a set of clusters among the plurality of clusters, the distance between which is within a predetermined range.

[0011] An information processing program according to a sixth aspect is the information processing program according to the fifth aspect, further comprising a process for gradually expanding the predetermined range until the number of clusters becomes equal to or less than a predetermined threshold.

[0012] An information processing program according to a seventh aspect is an information processing program according to any one of the first to sixth aspects, and causes the computer to execute a process that enables a player to newly acquire a plot adjacent to a plot that the player has already acquired in a game that progresses by the player acquiring each of the plurality of plots.

[0013] An information processing method according to an eighth aspect involves a computer clustering a plurality of partitions obtained by dividing a geographical space into a plurality of clusters according to their continuity, and associating geographically discontinuous partitions among the plurality of partitions as adjacent partitions based on the distance between partitions belonging to different clusters among the plurality of clusters.

[0014] An information processing device according to a ninth aspect includes a processor, which clusters a plurality of partitions obtained by dividing a geographical space into a plurality of clusters according to continuity, and associates geographically discontinuous partitions among the plurality of partitions as adjacent partitions based on the distance between partitions belonging to different clusters among the plurality of clusters. Effect of the Invention

[0015] According to the information processing program, information processing method, and information processing device disclosed herein, adjacent sections can be associated with each other even if they are geographically discontinuous, without using data indicating routes such as waterways. [Brief description of the drawings]

[0016] [Figure 1] 1 is a diagram showing an example of a schematic configuration of a game system 10 according to the present embodiment. [Diagram 2]1 is a diagram illustrating an example of a hardware configuration of an information processing device 100 according to an embodiment of the present invention. [Diagram 3] FIG. 2 is a diagram illustrating an example of a functional configuration of an information processing device 100 according to the present embodiment. [Figure 4] FIG. 1 illustrates an example of a geographic space divided into multiple partitions 60. [Diagram 5] FIG. 2 is a diagram showing an example of the flow of information processing executed by the information processing device 100 according to the present embodiment. [Figure 6] FIG. 13 is a diagram showing a first example of clustering a plurality of partitions 60. [Figure 7] FIG. 1 is a diagram showing a grid superimposed on geographic space. [Figure 8] FIG. 13 is a diagram showing a second example of clustering a plurality of partitions 60. [Figure 9] FIG. 13 is a diagram showing a third example of clustering a plurality of partitions 60. [Figure 10] FIG. 13 is a diagram showing a fourth example of clustering a plurality of partitions 60. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0017] Hereinafter, an example of an embodiment of the present disclosure will be described with reference to the drawings. In each drawing, the same or equivalent components and parts are given the same reference numerals. In addition, the dimensional ratios of the drawings are exaggerated for the convenience of explanation and may differ from the actual ratios.

[0018] FIG. 1 is a diagram showing an example of a schematic configuration of a game system 10 according to the present embodiment. Here, a game is a collection of activities and rules for playing or competing. A game is played, for example, by a player making full use of strategies and techniques to achieve a specific objective. A game is played to achieve various objectives, such as a competitive objective such as winning, a combat objective such as defeating an enemy, an educational objective such as learning, and a narrative objective such as completing the progression of a scenario. A game may be in a competitive format or a non-competitive format. The game system 10 includes a communication means 20, a server device 30, and a terminal device 50. This figure shows a case in which a player 40 plays a position information game using the terminal device 50 in the game system 10, in which the player 40 moves in a virtual space based on the position information of the player 40. From here on, a case in which the game system 10 plays a position information game will be described as an example, but is not limited to this. The game system 10 may play any game in which the adjacent relationship between the sections is related to the progress of the game for a plurality of sections divided into geographical space.

[0019] Note that "adjacent" means that the plots are adjacent to each other, regardless of whether they touch each other. In other words, it is said that plots are "adjacent" not only when they are adjacent to each other on land, but also when they are adjacent across the sea. It is also said that plots are "adjacent" when they are adjacent to each other across a mountainous area. It is also said that plots are "adjacent" when they are adjacent to each other across a restricted area where the general public is prohibited from entering for various reasons, such as military, political, historical, or religious reasons.

[0020] The communication means 20 connects a plurality of computers so that they can communicate with each other. In this figure, the communication means 20 connects between the server device 30 and the terminal device 50. The communication means 20 may be the Internet, for example. However, the communication means 20 may be any means capable of connecting a plurality of computers so that they can communicate with each other, such as a LAN, a WAN, or an intranet.

[0021] The server device 30 executes processing according to the operation of the player 40 or the position information of the player 40 by transmitting and receiving data to and from the terminal device 50, and provides the execution result to the terminal device 50. More specifically, the server device 30 may execute a process of downloading programs (applications) and the like to the terminal device 50, a login process for the player 40, a management process for various databases, and the like.

[0022] The server device 30 may be realized by cloud computing, for example. Although the server device 30 is one device in the figure, the server device 30 may perform the above-mentioned processing in a distributed manner using a plurality of devices. Furthermore, the location information game is provided as a so-called online game in the figure, but the present invention is not limited to this. If the location information game can be played offline, the game system 10 may not include the server device 30. That is, in the present disclosure, the server device 30 is not a required component.

[0023] The terminal device 50 is a device that allows the player 40 to play a position information game by using position information measured by the terminal device 50 as position information of the player 40. In the figure, a case where the terminal device 50 is a smartphone is shown as an example. However, the terminal device 50 may be any device with which the player 40 can play a position information game, such as a mobile phone, a tablet terminal, a notebook computer, an all-in-one computer, a tablet computer, or a portable game machine.

[0024] Hereinafter, a case where the terminal device 50 is the information processing device 100 according to the present embodiment will be described as an example. However, the present invention is not limited to this, and the server device 30 may be the information processing device 100 according to the present embodiment. That is, the information processing according to the present embodiment may be processed on the terminal side or on the network side.

[0025] 2 is a diagram showing an example of a hardware configuration of the information processing device 100 according to this embodiment. The information processing device 100 has a CPU (Central Processing Unit) 121, a ROM (Read Only Memory) 122, a RAM (Random Access Memory) 123, a storage 124, a communication interface 125, a user interface 126, and a positioning device 127. These components are connected to each other via a bus 129 so as to be able to communicate with each other.

[0026] The CPU 121 is a central processing unit that executes various programs and controls each component. The ROM 122 stores various programs and various data. The RAM 123 temporarily stores programs or data as a working area. The storage 124 is composed of an HDD (Hard Disk Drive) or SSD (Solid State Drive) and stores various programs including an operating system and various data.

[0027] In the information processing device 100 according to this embodiment, an information processing program is stored in the ROM 122 or the storage 124. The CPU 121 reads the information processing program from the ROM 122 or the storage 124, and executes it using the RAM 123 as a working area, thereby controlling each component and executing various arithmetic processing in accordance with the information processing program.

[0028] The communication interface 125 is an interface for the information processing device 100 to communicate with other devices. The user interface 126 is an input / output interface for the information processing device 100 to exchange information with a user. The user interface 126 may include a touch panel, a keyboard, a microphone, etc. as input devices, and may include a monitor, a speaker, etc. as output devices.

[0029] The positioning device 127 measures a position and outputs position information indicating the measured position. The positioning device 127 may be, for example, a Global Positioning System (GPS) module. However, the positioning device 127 may be any device capable of measuring a position, such as a Global Navigation Satellite System (GLONASS), a BeiDou Navigation System (BeiDou), a Galileo, or a Quasi-Zenith Satellite System (QZSS) module.

[0030] 3 is a diagram showing an example of the functional configuration of the information processing device 100 according to this embodiment. The information processing device 100 has a clustering unit 131, a distance calculation unit 132, a partition management unit 133, and a game progression unit 134. These functional configurations are realized by the CPU 121 reading out an information processing program from the ROM 122 or storage 124, expanding it in the RAM 123, and executing it.

[0031] The clustering unit 131 clusters a plurality of partitions obtained by dividing a geographical space into a plurality of clusters according to continuity. Note that "clustering" refers to classifying a plurality of objects into clusters according to a predetermined rule, and may be interpreted here as classifying a plurality of partitions into clusters that are clusters of partitions that can be reached by tracing adjacent relationships. This will be described in detail later.

[0032] The distance calculation unit 132 calculates the distance between sections that belong to different clusters among the multiple clusters clustered by the clustering unit 131 .

[0033] The partition management unit 133 associates geographically discontinuous partitions among the multiple partitions as adjacent partitions, based on the distance between the partitions calculated by the distance calculation unit 132.

[0034] The game progression unit 134 progresses the game based on the adjacency relationships between the sections associated by the section management unit 133.

[0035] FIG. 4 is a diagram showing an example of a geographical space divided into a plurality of sections 60. In this figure, as an example of a geographical space, a mainland and four remote islands consisting of islands X, Y, Z, and W are shown. Such a geographical space may be divided into a plurality of sections 60 according to topography, administrative division, or the like. As an example, the mainland may be divided into a plurality of sections including section 60A and other sections not shown. Island X may be divided into three sections, sections 60B, 60C, and 60D. Island Y may not be divided into a plurality of sections, and the entire island may be one section 60E. Island Z may be divided into two sections, sections 60F and 60G. Island W may be divided into two sections, sections 60H and 60I.

[0036] Here, as described above, the game system 10 is intended to play a game in which the progress of the game is affected by the adjacency relationship between the sections 60. An example of such a game is a location-based game themed on historical territorial disputes, in which the player 40 acquires (makes a territory of) a section 60 that he or she has visited in the real world by capturing a base (not shown) set up in the section 60 in the game.

[0037] In such a location-based game, when the geographical space is a vast area that can be moved, such as an entire country, it is not realistic for the player 40 to visit all the sections 60 in the real world. Therefore, it is conceivable to implement an expedition mode in the game that allows the player 40 to send a military commander on an expedition only to sections 60 adjacent to sections 60 that the player 40 has already acquired, and when a base is captured through an expedition, the player 40 can acquire the section 60 in which the base is located without having to visit the section in the real world.

[0038] In such an expedition mode, only the sections 60 adjacent to the section 60 already acquired by the player 40 are candidates for the expedition destination. However, for example, even if the player 40 has already acquired the section 60A on the mainland, if the section 60A is not linked to any of the sections 60B to 60H on the remote island by an adjacent relationship, the warlord cannot be sent on an expedition from the mainland to the remote island. The same can be said about an expedition from the remote island to the mainland. Therefore, even if the sections are geographically discontinuous, the adjacent sections 60 must be associated with each other.

[0039] Therefore, the information processing device 100 according to the present embodiment makes it possible to associate adjacent sections with each other without using data indicating routes such as sea routes, even in geographically discontinuous sections such as between the mainland and an island, between two islands, etc. This will be described in detail using the flow in FIG. 5 and with appropriate reference to FIGS. 6 to 10.

[0040] 5 is a diagram showing an example of the flow of information processing executed by the information processing device 100 according to this embodiment. This flow is executed by the CPU 121 reading out an information processing program from the ROM 122 or the storage 124, expanding it in the RAM 123, and executing it.

[0041] In step S151, the CPU 121, as the clustering unit 131, clusters a plurality of partitions 60 obtained by dividing a geographical space into a plurality of clusters according to their continuity. For example, the CPU 121 may refer to data indicating the continuity of the partitions 60 pre-stored in the information processing device 100. Then, when the CPU 121 determines that the partition 60A and another partition 60 (not shown) are contiguous based on the data, the CPU 121 may cluster the partition 60A and the other partition 60 (not shown) into a cluster CL1. Similarly, the CPU 121 may cluster the partitions 60B, 60C, and 60D into a cluster CL2. Similarly, the CPU 121 may cluster the partition 60E into a cluster CL3. Similarly, the CPU 121 may cluster the partitions 60F and 60G into a cluster CL4. Similarly, the CPU 121 may cluster the partitions 60F and 60G into a cluster CL5. In this way, the CPU 121 can cluster a plurality of sections 60 obtained by dividing a geographical space into a plurality of clusters according to geographical continuity. That is, the CPU 121 can cluster adjacent sections that are adjacent to each other into the same cluster. However, instead of or in addition to this, the CPU 121 can also cluster adjacent sections separated by a mountainous area, a restricted area, or the like into the same cluster. For example, in this way, the CPU 121 classifies a plurality of sections 60 into clusters CL, which are groups of sections 60 that can be reached by tracing the adjacency relationships.

[0042] 6 is a diagram showing a first example of clustering a plurality of partitions 60. At an initial point in time, the plurality of partitions 60 may be clustered into, for example, five clusters CL1 to CL5 as shown in this diagram.

[0043] In step S152, the CPU 121 determines whether the number of clusters CL is equal to or less than a predetermined threshold. Here, it is assumed that the threshold is set to 1. Since the number of clusters CL is 5 at the initial point in time, the CPU 121 determines that the number of clusters CL is not equal to or less than the predetermined threshold (No), and proceeds to step S153.

[0044] In step S153, the CPU 121, as the distance calculation unit 132, determines a cluster set indicating a set of clusters to be processed from among the multiple clusters CL. For example, the CPU 121 may determine, as the cluster set, a set of clusters CL among the multiple clusters CL, in which the distance between the clusters falls within a predetermined range.

[0045] In this case, the predetermined range may be expandable in stages as described below. In the first stage, the predetermined range may be, for example, a range in latitude and longitude within a first degree (e.g., 0.15°).

[0046] Here, let us say that among the clusters CL1 to CL5, the distance between the clusters CL2 and CL3 is within the latitude and longitude range of 0.15°. In this case, the CPU 121 may determine [CL2, CL3] as a cluster set. Similarly, let us say that among the clusters CL1 to CL5, the distance between the clusters CL4 and CL5 is within the latitude and longitude range of 0.15°. In this case, the CPU 121 may determine [CL4, CL5] as a cluster set.

[0047] In step S154, the CPU 121 extracts vertices to be processed as the distance calculation unit 132. For example, the CPU 121 may determine a grid set indicating a set of grids to be processed from among a plurality of grids obtained by dividing a geographical space at equal intervals, and extract vertices included in the grid set as the processing targets. This will be described using the cluster set [CL2, CL3] as an example, but the cluster set [CL4, CL5] may also be processed in the same manner.

[0048] FIG. 7 is a diagram in which grids are superimposed on a geographical space. The geographical space may be divided at equal intervals in the latitude and longitude directions. In this figure, as an example, a geographical space including islands X and Y is divided into seven equal parts parallel to the latitude lines and seven equal parts parallel to the meridians, and is divided into a total of 49 grids GR. From here on, each grid GR will be defined by columns 1 to 7 and rows (1) to (7). That is, the grid GR in the lower right of this figure is located in column 7 and row (7), so it will be defined as grid GR_7(7).

[0049] Here, in the cluster set [CL2, CL3], there are three combinations of partitions 60 that belong to different clusters: partitions 60B and 60E, partitions 60C and 60E, and partitions 60D and 60E.

[0050] From here on, the sections 60B and 60E will be described as an example, but the sections 60C and 60E and the sections 60D and 60E may be processed in the same manner. The grid group GRb including the vertices of the polygon data (polygon data) Pb indicating the shape of the section 60B is the grids GR_4(1), 5(1), 6(1), 4(2), 5(2), 6(2), 5(3), and 6(3). Similarly, the grid group GRe including the vertices of the polygon data Pe indicating the shape of the section 60E is the grids GR_2(5), 3(5), 2(6), 3(6), and 3(7). Here, the set of grids GR with the shortest distance between the grid groups GRb and GRe is the grids GR_5(3) and GR_3(5). In this case, the CPU 121 may determine [GR_5(3), GR_3(5)] as the grid set.

[0051] Then, the CPU 121 may extract vertices included in the grid set [GR_5(3), GR_3(5)] as processing targets. That is, the CPU 121 may extract vertices of the polygon data Pb included in the grid GR_5(3) and vertices of the polygon data Pe included in the grid GR_3(5) as processing targets.

[0052] In step S155, the CPU 121, as the distance calculation unit 132, calculates the distance between the vertices extracted in step S154. Hereinafter, the sections 60B and 60E will be described as an example, but the sections 60C and 60E and the sections 60D and 60E may be processed in the same manner. The CPU 121 may calculate the distances Dbe_1 to Dbe_n between the vertices for all (n combinations) of the vertices of the polygon data Pb included in the grid GR_5(3) and the vertices of the polygon data Pe included in the grid GR_3(5). In this way, for example, the CPU 121 calculates the distance between the vertices included in the set of grids GR in which the distance between the grids is shortest between a grid group including the vertices of the polygon data P showing the shape of one section 60 among a plurality of grids GR obtained by dividing a geographical space at equal intervals and a grid group including the vertices of the polygon data P showing the shape of the other section 60 among the plurality of grids GR.

[0053] In step S156, the CPU 121, as the distance calculation unit 132, calculates the distance between the sections using the distance between the vertices calculated in step S155. Hereinafter, the sections 60B and 60E will be described as an example, but the sections 60C and 60E and the sections 60D and 60E may be processed in the same manner. The CPU 121 may sort the distances Dbe_1 to Dbe_n between the vertices in ascending order, and calculate the minimum distance Dbe_min as the distance Dbe between the sections 60B and 60E. In this way, for example, the CPU 121 calculates the distance between the sections using the distance between the vertices of the polygon data P indicating the shape of one section 60 among the sections 60 belonging to different clusters CL and the vertices of the polygon data P indicating the shape of the other section 60.

[0054] In step S157, the CPU 121, as the partition management unit 133, associates geographically discontinuous partitions as adjacent partitions 60 based on the distance between the partitions calculated in step S156. Here, the cluster set [CL2, CL3] will be described as an example, but the cluster set [CL4, CL5] may be processed in the same manner. Here, in step S156, the distances Dbe, Dce, and Dde between the partitions are calculated. In this case, the CPU 121 may sort the distances Dbe, Dce, and Dde between the partitions in ascending order, and associate the partitions with the smallest distance between the partitions as adjacent partitions 60. As an example, it is assumed that the distance Dce between the partitions is the smallest among the distances Dbe, Dce, and Dde between the partitions. In this case, the CPU 121 may associate the partitions 60C and 60E as adjacent partitions 60. In this manner, for example, the CPU 121 associates geographically discontinuous sections as adjacent sections 60 for a set of clusters CL among the plurality of clusters CL whose inter-cluster distances are within a predetermined range.

[0055] In step S158, the CPU 121, as the clustering unit 131, merges the clusters CL when partitions belonging to different clusters CL are associated as adjacent partitions 60 in step S157. Hereinafter, the cluster set [CL2, CL3] will be described as an example, but the cluster set [CL4, CL5] may be processed in the same manner. Since the partitions 60C and 60E are associated as adjacent partitions 60 in step S157, the CPU 121 may merge the cluster CL2 to which the partition 60C belongs and the cluster CL3 to which the partition 60E belongs into, for example, the cluster CL2 with the smaller number. In this way, for example, the CPU 121 merges the cluster CL to which one of the partitions 60 associated as adjacent partitions 60 belongs and the cluster CL to which the other belongs into one cluster CL.

[0056] 8 is a diagram showing a second example of clustering a plurality of partitions 60. At the end of the first stage of processing, the plurality of partitions 60 may be clustered into three clusters CL1, CL2, and CL4, for example, as shown in this diagram.

[0057] In step S159, CPU 121 expands the range for determining the cluster set. In the first stage, the range was within a first degree (e.g., 0.15°) of latitude and longitude. Therefore, when moving to the second stage, CPU 121 may expand the range to a second degree (e.g., 3.0°) of latitude and longitude that is greater than the first degree. Then, CPU 121 returns the process to step S152.

[0058] Since the number of clusters CL is three when the first stage processing is completed, the CPU 121 advances the process to step S153 and executes the second stage processing.

[0059] In the second stage of processing, it is assumed that the distance between clusters CL2 and CL4 among clusters CL1, CL2, and CL4 is within the moving longitude range of 3.0°. In this case, CPU 121 may determine [CL2, CL4] as a cluster set. Next, CPU 121 may associate partition 60E and partition 60F as adjacent partitions 60. Then, CPU 121 may combine cluster CL2 to which partition 60E belongs and cluster CL4 to which partition 60F belongs into cluster CL2, which is a cluster with a smaller number, for example.

[0060] 9 is a diagram showing a third example of clustering a plurality of partitions 60. At the end of the second stage of processing, the plurality of partitions 60 may be clustered into two clusters CL1 and CL2, for example, as shown in this diagram.

[0061] Then, when moving to the third stage, the CPU 121 expands the range for determining the cluster set. At this time, the CPU 121 may delete the range restriction for determining the cluster set, for example. Then, the CPU 121 returns the process to step S152.

[0062] Since the number of clusters CL is two when the second stage processing is completed, the CPU 121 advances the process to step S153 and executes the third stage processing.

[0063] In the third stage of processing, CPU 121 may determine [CL1, CL2] as a cluster set. Next, CPU 121 may associate partition 60A and partition 60G as adjacent partitions 60. Then, CPU 121 may merge cluster CL1 to which partition 60A belongs and cluster CL2 to which partition 60G belongs into cluster CL1, which is the cluster with the smaller number, for example.

[0064] 10 is a diagram showing a fourth example of clustering a plurality of partitions 60. At the end of the third stage of processing, the plurality of partitions 60 may be clustered into one cluster CL1 as shown in this diagram, for example.

[0065] Then, the CPU 121 returns the process to step S152. Since the number of clusters CL is 1 at the time when the third stage process is completed, the CPU 121 determines that the number of clusters CL is equal to or less than the predetermined threshold (Yes), and ends the flow. In this way, for example, the CPU 121 gradually expands the predetermined range until the number of clusters CL becomes equal to or less than the predetermined threshold.

[0066] When such an adjacent relationship is linked, the player 40 who has already acquired the section 60A can send a general on an expedition from the section 60A to the section 60G in the expedition mode. The player 40 can then acquire all the sections 60 in the Z island and the W island in the order of section 60G → section 60F → section 60H → section 60I. The player 40 who has already acquired the section 60F can send a general on an expedition from the section 60F to the section 60E in the expedition mode. The player 40 can also acquire all the sections 60 in the X island and the Y island in the order of section 60E → section 60C → section 60D (or section 60B) → section 60B (section 60D). In this way, for example, in a game in which the player 40 progresses by acquiring each of the multiple sections 60, the CPU 121 enables the player 40 to newly acquire a section adjacent to a section that the player 40 has already acquired. On the other hand, the CPU 121 disables the player 40 from newly acquiring a section that is not adjacent to a section already acquired by the player 40.

[0067] Conventionally, for geographically discontinuous sections, route data was used to associate the section 60 at the start point of a route with the section 60 at the end point as adjacent sections 60. However, the conventional technology had a problem in that it was not possible to associate adjacent sections 60 with each other for sections where roads such as routes are not connected. In addition, it was a cumbersome task to manually associate adjacent sections 60 with each other for sections where roads are not connected.

[0068] Therefore, the information processing device 100 of this embodiment clusters multiple sections 60 obtained by dividing a geographical space into multiple clusters CL according to their continuity, and associates geographically discontinuous sections among the multiple sections 60 as adjacent sections 60 based on the distance between sections that belong to different clusters CL among the multiple clusters CL.

[0069] As a result, according to the information processing device 100 of this embodiment, adjacent sections are associated with each other based on the distance between sections belonging to different clusters CL, so that adjacent sections 60 can be automatically associated with each other even in sections where the roads are not connected. Therefore, according to the information processing device 100 of this embodiment, it is possible to support the progress of the game by utilizing the adjacency relationships between sections.

[0070] In particular, the game may proceed by calculating the domination rate of the blocks 60 for each country, region, prefecture, and city, ward, town, and village, and giving a reward when the domination rate exceeds a certain ratio. In such a game progression, if the adjacent relationships are not linked, it is difficult to increase the domination rate of the blocks 60 in areas with many remote islands, and a problem may occur in which it is difficult to obtain a reward. However, since the information processing device 100 according to this embodiment can trace the associated adjacent relationships to reach remote islands from the mainland, from remote islands to remote islands, and from remote islands to the mainland, it is possible to easily increase the domination rate even in areas with many remote islands, thereby maintaining the game balance between regions.

[0071] Furthermore, the information processing device 100 according to this embodiment may calculate the distance between the partitions using the distance between vertices of polygon data indicating the shape of one of the partitions 60 belonging to different clusters CL and vertices of polygon data indicating the shape of the other partition 60. As a result, according to the information processing device 100 according to this embodiment, the distance between the partitions is calculated using only characteristic points in the partitions 60, so that the load associated with calculation can be reduced.

[0072] Furthermore, the information processing device 100 according to the present embodiment may calculate the distance between vertices included in a set of grids GR in which the distance between the grids is shortest between a group of grids including vertices of polygon data indicating the shape of one of the partitions 60 of a plurality of grids GR obtained by dividing a geographical space at equal intervals, and a group of grids including vertices of polygon data indicating the shape of the other of the partitions 60 of the plurality of grids GR. As a result, according to the information processing device 100 according to the present embodiment, the number of vertices to be processed when calculating the distance between the vertices can be truncated on a grid-by-grid basis, thereby further reducing the load associated with the calculation.

[0073] Furthermore, the information processing apparatus 100 according to this embodiment may integrate a cluster CL to which one of the sections 60 associated with each other as adjacent sections 60 belongs and a cluster CL to which the other section 60 belongs into one cluster CL.

[0074] As a result, according to the information processing device 100 according to this embodiment, the number of clusters CL can be reduced each time adjacent sections 60 are associated with each other.

[0075] In addition, the information processing device 100 according to this embodiment may target a set of clusters CL among a plurality of clusters CL, the distance between the clusters being within a predetermined range, and may associate geographically discontinuous sections as adjacent sections 60.

[0076] As a result, according to the information processing device 100 according to this embodiment, all the clusters CL are not targeted in one process, and therefore the processing load can be reduced.

[0077] Furthermore, the information processing device 100 according to the present embodiment may gradually expand the predetermined range until the number of clusters CL becomes equal to or less than a predetermined threshold value. As a result, the information processing device 100 according to the present embodiment can gradually expand the range to be processed while limiting the clusters CL to be processed in one process.

[0078] Furthermore, the information processing device 100 according to this embodiment may enable the player 40 to newly acquire a section adjacent to a section already acquired by the player 40 in a game in which the player 40 progresses by acquiring each of a plurality of sections 60. In this way, the information processing device 100 according to this embodiment allows a game that utilizes the adjacency relationship between sections, for example, a game in which an expedition mode is implemented, to progress regardless of region.

[0079] The above-described embodiment can be modified in various ways or applied to various uses. For example, the above description shows an example in which a plurality of partitions 60 are gradually integrated into one cluster CL by three-stage processing. However, a plurality of partitions 60 may be gradually combined into one cluster CL by two-stage processing. In this case, the range for determining the cluster set may be expanded so that all clusters are processed in the second stage processing.

[0080] In the above description, a case where multiple partitions 60 are ultimately integrated into one cluster CL is shown as an example. However, multiple partitions 60 may ultimately be integrated into two or more clusters CL. In other words, it is not necessary to be able to reach all partitions 60 by tracing the adjacent relationships.

[0081] In addition, in the above embodiments, the term "processor" refers to a processor in a broad sense, and includes general-purpose processors (e.g., CPUs, etc.) and dedicated processors (e.g., GPU: Graphics Processing Unit, ASIC: Application Specific Integrated Circuit, FPGA: Field Programmable Gate Array, programmable logic device, etc.).

[0082] In addition, the operations of the processor in the above embodiments may be performed not only by one processor, but also by multiple processors located at physically separate locations working together. The order of the operations of the processor is not limited to the order described in the above embodiments, and may be changed as appropriate.

[0083] Furthermore, the information processing device 100 in the present embodiment has been described as being configured from a single device as an example, but may be configured from a plurality of devices.

[0084] The processes performed by the information processing device 100 according to the above embodiment may be processes performed by software, may be processes performed by hardware, or may be processes that combine both. The processes performed by each unit of the information processing device 100 may be stored as a program in a storage medium and distributed.

[0085] Furthermore, the present disclosure is not limited to the above, and it goes without saying that various modifications can be made without departing from the spirit and scope of the present disclosure. [Explanation of symbols]

[0086] 10. Game System 20 Means of communication 30 Server device 40 Players 50 Terminal Equipment 60 plots 100 Information processing device 121 CPU

Claims

1. On the computer, A plurality of subdivisions of a geographical space are clustered according to contiguity into a plurality of clusters; associating geographically discontinuous sections among the plurality of sections as adjacent sections based on distances between sections that belong to different clusters among the plurality of clusters; An information processing program that executes processing.

2. The computer includes: calculating a distance between the partitions using a distance between vertices of polygon data representing a shape of one of the partitions belonging to the different clusters and vertices of polygon data representing a shape of the other partition; The information processing program according to claim 1 , which causes a process to be executed.

3. The computer includes: calculating a distance between vertices included in a set of grids that has the shortest distance between a grid group including vertices of polygon data representing the shape of one of the plurality of grids obtained by dividing the geographical space at equal intervals and a grid group including vertices of polygon data representing the shape of the other of the plurality of grids; The information processing program according to claim 2 , which causes a process to be executed.

4. The computer includes: a cluster to which one of the adjacent partitions belongs and a cluster to which the other of the adjacent partitions belongs are integrated into one cluster; The information processing program according to claim 1 , which causes a process to be executed.

5. The computer includes: associating the geographically discontinuous sections as adjacent sections for a set of clusters among the plurality of clusters, the set of clusters being located within a predetermined range of distance between the clusters; The information processing program according to claim 4 , which causes a process to be executed.

6. The computer includes: gradually expanding the predetermined range until the number of clusters is equal to or less than a predetermined threshold. The information processing program according to claim 5 , which causes a process to be executed.

7. The computer includes: In a game in which a player progresses by acquiring each of the plurality of sections, the player is allowed to newly acquire a section adjacent to a section already acquired by the player. The information processing program according to claim 1 , which causes a process to be executed.

8. The computer A plurality of subdivisions of a geographical space are clustered according to contiguity into a plurality of clusters; associating geographically discontinuous sections among the plurality of sections as adjacent sections based on distances between sections that belong to different clusters among the plurality of clusters; Information processing methods.

9. a processor, the processor comprising: A plurality of subdivisions of a geographical space are clustered according to contiguity into a plurality of clusters; associating geographically discontinuous sections among the plurality of sections as adjacent sections based on distances between sections that belong to different clusters among the plurality of clusters; Information processing device.

Images