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

Abstract

To provide an information processing program, information processing method, and information processing device that can suppress the occurrence of regional disparities, in a location-based information game.SOLUTION: In a location-based information game in which a player's position, identified from player's position information, moves in an area arranged in a virtual space, an information processing program causes a computer to execute processing to integrate a processing target area, which is an area in which an index value according to the scale is less than a threshold and at least one of one or more adjacent areas that are adjacent to the processing target area, so that the index value of the result of the integration is the threshold or larger.SELECTED DRAWING: Figure 4

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] 2. Description of the Related Art Location-based games are known in which the game progresses based on location information of a terminal carried by a player.

[0003] For example, Patent Document 1 discloses the use of map data including information on administrative districts in a location-based game. [Prior art documents] [Patent documents]

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

[0005] In location-based games, it is conceivable that administrative districts and other areas included in map data may be used as in-game areas. However, administrative districts vary in size, and for example, some areas may have relatively small areas densely packed together, which may result in regional disparities.

[0006] An object of the present disclosure is to provide an information processing program, an information processing method, and an information processing device that can suppress the occurrence of regional disparities in location-based games. [Means for solving the problem]

[0007] A first aspect of the information processing program causes a computer to execute a process in a position information game in which a player's position, identified from the player's position information, moves through an area located in a virtual space, to integrate a processing target area, which is an area whose index value according to its size is less than a threshold, and at least one adjacent area out of one or more adjacent areas that are adjacent to the processing target area, so that the index value of the result of the integration is greater than or equal to the threshold.

[0008] The information processing program of the second aspect causes a computer to execute a process in the information processing program of the first aspect, which selects an area in which the index value is less than the threshold value as the processing target area, and integrates each of the one or more adjacent areas adjacent to the selected processing target area into the processing target area in a predetermined order until the index value becomes equal to or greater than the threshold value.

[0009] An information processing program according to a third aspect is the information processing program according to the second aspect, wherein the predetermined order is an ascending order of the index value.

[0010] An information processing program of a fourth aspect, in the information processing program of the second or third aspect, causes a computer to execute a process of integrating a first adjacent area into the processing target area, and then adding a second adjacent area that is not adjacent to the processing target area but is adjacent to the first adjacent area to a list representing the specified order, with a lower priority than the existing adjacent areas.

[0011] An information processing program of a fifth aspect, in an information processing program of any one of the first to fourth aspects, causes a computer to execute a process of excluding from a target to be integrated into the processing target area an adjacent area among the one or more adjacent areas, the adjacent area being composed of a plurality of partial areas that are not adjacent to each other, and among the plurality of partial areas, only partial areas whose index value is less than a second threshold value are adjacent to the processing target area.

[0012] An information processing program of a sixth aspect is an information processing program of any one of the first to fifth aspects, which causes a computer to execute a process of excluding from the target for integration into the processing target area an adjacent area, among the one or more adjacent areas, which is adjacent to the processing target area composed of a plurality of partial areas that are not adjacent to each other, and which is adjacent only to a partial area among the plurality of partial areas whose index value is less than a second threshold value.

[0013] An information processing program of the seventh aspect, in an information processing program of any one of the first to sixth aspects, causes a computer to execute a process of excluding an adjacent area, the length of which adjacent to the processing target area is less than a third threshold, from an area to be integrated into the processing target area.

[0014] An information processing program of an eighth aspect is an information processing program of any one of the first to seventh aspects, which causes a computer to execute a process of integrating, after completion of a process of integrating the index value for a specific region group including a plurality of regions so that the index value is equal to or greater than the threshold, if there is a region within the specific region group where the index value is less than the threshold, integrating the region where the index value is less than the threshold into any of a plurality of regions adjacent to the region where the index value is less than the threshold.

[0015] An information processing program of a ninth aspect is an information processing program of any one of the first to eighth aspects, in which information representing accessible locations within the area in real space is set for the area, and the computer is caused to execute a process of merging an area in which the index value is equal to or greater than the threshold and the number of accessible locations set is less than a fourth threshold with at least one of a plurality of areas adjacent to the area, so that the number after merging is equal to or greater than the fourth threshold.

[0016] An information processing program of a tenth aspect is an information processing program of any one of the first to ninth aspects, in which a map is divided in stages from a finely divided hierarchy to a coarsely divided hierarchy, and the area divided in one hierarchy is the area, and among the areas in a hierarchy divided in a coarser hierarchy than the first hierarchy, only areas that exist in the same region as the area to be processed can be integrated with the area to be processed.

[0017] An eleventh aspect of the information processing method is a position information game in which a player's position, identified from the player's position information, moves through an area located in a virtual space, in which a computer executes a process to integrate a processing target area, which is an area whose index value according to its size is less than a threshold, and at least one adjacent area out of one or more adjacent areas that are adjacent to the processing target area, so that the index value of the result of the integration is greater than or equal to the threshold.

[0018] An information processing device of a 12th aspect includes a processor, and in a position information game in which a player's position, determined from a player's position information, moves through an area located in a virtual space, the processor integrates a processing target area, which is an area whose index value according to its scale is less than a threshold, and at least one of one or more adjacent areas that are adjacent to the processing target area, so that the index value of the result of the integration is greater than or equal to the threshold. Effect of the Invention

[0019] According to the present disclosure, it is possible to suppress the occurrence of regional disparities in location-based games. [Brief description of the drawings]

[0020] [Figure 1] FIG. 1 is a block diagram illustrating an example of a configuration of an information processing system. [Diagram 2] FIG. 2 is a block diagram showing an example of a hardware configuration of an information processing device. [Diagram 3] FIG. 1 is a diagram for explaining areas in a game. [Figure 4] FIG. 13 is a diagram illustrating an example of a region after integration. [Diagram 5] FIG. 1 is a diagram for explaining accessible locations within a region in real space. [Figure 6] FIG. 2 is a block diagram showing an example of a functional configuration of an information processing device. [Figure 7] FIG. 13 is a diagram for explaining a case where adjacent regions are excluded from integration. [Figure 8] FIG. 13 is a diagram for explaining a case where adjacent regions are excluded from integration. [Figure 9] FIG. 13 is a diagram for explaining a case where adjacent regions are excluded from integration. [Figure 10] 13 is a flowchart illustrating an example of a region merging process. [Figure 11] 11 is a diagram for explaining the order in which adjacent regions are added to an adjacent region list. FIG. [Figure 12] 11A and 11B are diagrams for explaining the order of integrating adjacent regions into a processing target region; DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

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

[0022] First, the configuration of an information processing system 10 according to this embodiment will be described with reference to Fig. 1. As shown in Fig. 1, the information processing system 10 includes a mobile terminal 12 and an information processing device 14 used by a game player. Examples of the mobile terminal 12 include a smartphone and a tablet-type terminal. Examples of the information processing device 14 include a computer such as a server computer and a cloud server. The information processing system 10 provides a game that uses location information of the mobile terminal 12 (hereinafter referred to as a "location information game").

[0023] The mobile terminal 12 and the information processing device 14 are each connected to a network and are capable of transmitting and receiving data to and from each other. The game progresses as the mobile terminal 12 and the information processing device 14 transmit and receive data via the network. In FIG. 1, a case where the location information game is provided as a so-called online game is shown as an example, but the disclosed technology is not limited to this form. When the location information game can be played offline, the information processing system 10 does not need to include the information processing device 14. That is, in the present disclosure, the information processing device 14 is not an essential component.

[0024] The mobile terminal 12 executes an application program for playing a game, thereby providing the player with an environment for playing the game according to the application program. The mobile terminal 12 includes an input device such as a touch panel display and a display device, and the player performs various inputs via the input device. The display device displays various game screens based on data transmitted from the information processing device 14. A game is a collection of activities and rules for playing or competing. For example, a game is played by a player making full use of strategies and techniques to achieve a specific objective. For example, 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, or a narrative objective such as completing the progression of a scenario. A game may be competitive or non-competitive.

[0025] The mobile terminal 12 also includes a GPS (Global Positioning System) device, and transmits location information measured by the GPS device to the information processing device 14. The information processing device 14 receives the location information transmitted from the mobile terminal 12, and handles the location information as location information of the player who owns the mobile terminal 12.

[0026] Next, a hardware configuration of the information processing device 14 according to the present embodiment will be described with reference to Fig. 2. As shown in Fig. 2, the information processing device 14 includes a CPU (Central Processing Unit) 20, a memory 21 as a temporary storage area, and a non-volatile storage unit 22. The information processing device 14 also includes a display device 23 such as a liquid crystal display, an input device 24 such as a keyboard and a mouse, and a network I / F (InterFace) 25 connected to a network. The CPU 20, the memory 21, the storage unit 22, the display device 23, the input device 24, and the network I / F 25 are connected to a bus 27. The CPU 20 is an example of a processor according to the disclosed technology.

[0027] The storage unit 22 is realized by a hard disk drive (HDD), a solid state drive (SSD), a flash memory, or the like. The storage unit 22 as a storage medium stores an information processing program 30. The CPU 20 reads the information processing program 30 from the storage unit 22, expands it in the memory 21, and executes the expanded information processing program 30.

[0028] Furthermore, the storage unit 22 stores map data 32. The map data 32 includes map information such as roads, facilities, and administrative districts. As shown in Fig. 3, in this embodiment, a geographical area in which a player can move within the game (for example, an area corresponding to Japan in the map data 32) is divided into a plurality of areas according to specific rules. In the example of Fig. 3, each area surrounded by a solid line represents an area.

[0029] The area according to the present embodiment is an area divided in one level by dividing a map step by step from a level divided in fine granularity to a level divided in coarse granularity. Specifically, the area is an area divided in one level of each level in a geographical hierarchical structure defined by the government. The geographical hierarchical structure defined by the government is, for example, a structure of "Prefecture"-"City / Ward / Town / Village"-"Town"-"Chome"-"Banchi". In this example, the later levels are expressed as levels divided in finer granularity. In addition, in this embodiment, an example is described in which an area divided in the "Chome" level is applied as an area. That is, for example, the area "Minatomirai, Nishi-ku, Yokohama City, Kanagawa Prefecture" is composed of six areas, with each of the areas "1-chome" to "6-chome" being considered as one area. Note that there is no particular limitation as to which level an area divided in is applied as an area. For example, an area divided in the "City / Ward / Town / Village" level may be applied as an area, or an area divided in the "Banchi" level may be applied as an area. Additionally, the geographic hierarchy defined by the government may be retroactive.

[0030] In the position information game according to this embodiment, the player's position, which is specified from the player's position information, moves through an area arranged in a virtual space. Then, when a predetermined condition is satisfied, the player acquires an area within the game according to the player's position information. In this embodiment, an object called a base (hereinafter, referred to as a "base object") is arranged at a predetermined position within the area. The position within the area at which the base object is arranged is not particularly limited, and may be, for example, the center position within the area. The player acquires the area when he enters the area, selects the base object arranged in the entered area, and defeats the character arranged in the base.

[0031] In the above-mentioned location-based game, it is considered that the game progresses by increasing the level of the player according to the number of areas the player has acquired, and by increasing the number of available functions according to the player's level. However, as shown in FIG. 3, the areas defined by the government vary in size. For example, in an area where relatively small areas are densely packed, the player can acquire multiple areas by moving a relatively short distance. On the other hand, in an area where relatively large areas are adjacent to each other, the player cannot acquire multiple areas unless he moves a relatively long distance. Therefore, as shown in FIG. 4, the information processing device 14 according to this embodiment has a function of integrating multiple areas into one area in order to suppress regional disparities.

[0032] Also, as shown in FIG. 5, information indicating accessible places in the area in the real space (hereinafter, referred to as "accessible place information") is set in the area included in the map data 32. In the example of FIG. 5, a downward black triangle mark indicates an accessible place. Also, in the example of FIG. 5, an area in which the number of accessible places is relatively small compared to the size, such as a reclaimed land where a factory is built, is shown. The accessible place here indicates a place where anyone can enter. In this embodiment, the accessible place information is set at equal intervals on a public road. Also, the accessible place information is set at a point on a public road that is closest to a commercial facility that anyone can enter. That is, the accessible place information is not set in a building where only people who have the entry qualification, such as a person who has an ID card or an entry ticket, can enter, or in private land, etc.

[0033] Next, a functional configuration of the information processing device 14 will be described with reference to Fig. 6. As shown in Fig. 6, the information processing device 14 includes a selection unit 40 and an integration unit 42. The CPU 20 executes the information processing program 30 to function as the selection unit 40 and the integration unit 42.

[0034] The selection unit 40 selects, from among the areas included in the map data 32, an area that has not been selected as a processing target for the area integration process and has an index value according to size (hereinafter simply referred to as "index value") less than a threshold value (hereinafter referred to as "first threshold value") as a processing target area. In this embodiment, an example in which area is used as an example of an index value according to size as the index value according to size will be described. Note that, as the index value according to size, a numerical value obtained by classifying the area into one of a plurality of stages according to the magnitude of the numerical value may be used, or a major axis may be used. The major axis here refers to the distance represented by the longest line segment among the line segments connecting two points on the outer frame of the area.

[0035] The integrating unit 42 integrates the processing target area selected by the selecting unit 40 with at least one of the one or more adjacent areas adjacent to the processing target area, so that the index value of the integration result is equal to or greater than a first threshold value. Specifically, the integrating unit 42 integrates each of the one or more adjacent areas adjacent to the processing target area selected by the selecting unit 40 with the processing target area in a predetermined order until the index value becomes equal to or greater than a first threshold value. In this embodiment, an example in which the order of the smallest index value is applied as the predetermined order will be described. Note that the predetermined order may be an order other than the order of the smallest index value, such as a random order.

[0036] Furthermore, in this embodiment, a prohibition condition for merging is set, and the merging unit 42 excludes, from among one or more adjacent regions adjacent to the processing target region, an adjacent region that satisfies the prohibition condition from being merged into the processing target region.

[0037] As an example, as shown in FIG. 7, an adjacent region may be composed of a plurality of partial regions that are not adjacent to each other. In the example of FIG. 7, S1 indicates the processing target region, and S2, which is composed of two partial regions R1 and R2 that are not adjacent to each other, indicates an adjacent region. The integration unit 42 excludes an adjacent region that is composed of a plurality of partial regions that are not adjacent to each other, among one or more adjacent regions that are adjacent to the processing target region, and in which only a partial region among the plurality of partial regions whose index value is less than a second threshold value is adjacent to the processing target region, from an integration target to be integrated into the processing target region. In this embodiment, the index value of the partial region with the largest index value is applied as the second threshold. That is, the integration unit 42 excludes an adjacent region that is composed of a plurality of partial regions that are not adjacent to each other, and in which only a partial region among the plurality of partial regions other than the partial region with the largest index value is adjacent to the processing target region, from an integration target to be integrated into the processing target region. The plurality of partial regions that are not adjacent to each other that constitute the adjacent region here means partial regions that are not adjacent to each other by sandwiching another region between them or by sandwiching an area that cannot be passed by people, such as a river, between them. That is, as shown in Fig. 7, if an adjacent area has an exclave partial area R1 and only the partial area R1 is adjacent to the processing target area, the adjacent area is excluded from the integration target. This makes it easier for the player to grasp the geographical range representing the area.

[0038] Similarly, the processing target area may be composed of a plurality of partial areas that are not adjacent to each other. The integration unit 42 excludes, from the integration target area to be integrated with the processing target area, an adjacent area, among one or more adjacent areas, that is adjacent to the processing target area composed of a plurality of partial areas that are not adjacent to each other and that is adjacent only to a partial area among the plurality of partial areas whose index value is less than the second threshold value. In other words, the integration unit 42 excludes, from the integration target area, an adjacent area that is adjacent only to an exclave partial area of ​​the processing target area that has an exclave partial area. This makes it easier for the player to grasp the geographical range that represents the area.

[0039] Due to the above two prohibited conditions, as shown in Fig. 8, when both the processing target area and the adjacent area are composed of multiple partial areas that are not adjacent to each other and the partial areas with the maximum index values ​​of the processing target area and the adjacent area are adjacent to each other, the processing target area and the adjacent area are integrated. Also, when both the processing target area and the adjacent area are composed of multiple partial areas that are not adjacent to each other and the partial areas with the maximum index values ​​of the processing target area and the adjacent area are not integrated, except when both the processing target area and the adjacent area are composed of multiple partial areas that are not adjacent to each other and the partial areas with the maximum index values ​​of the processing target area and the adjacent area are adjacent to each other. In the example of Fig. 8, S1 indicates the processing target area, S2 indicates the adjacent area, R1 indicates a partial area other than the partial area with the maximum index value of the processing target area or the adjacent area, and R2 indicates a partial area other than the partial area with the maximum index value of the processing target area or the adjacent area.

[0040] Also, as shown in Fig. 9, the integration unit 42 excludes adjacent areas whose length in contact with the processing target area is less than a third threshold from the integration target to be integrated into the processing target area. In the example of Fig. 9, S1 indicates the processing target area, and S2 indicates the adjacent area. This makes it easier for the player to grasp the geographical range representing the area.

[0041] In addition, in this embodiment, among the regions in a hierarchy divided into regions with a coarser granularity than the first hierarchy, only regions existing in the same region as the region to be processed are set as integrable with the region to be processed. In other words, among the regions in a hierarchy divided into regions with a coarser granularity than the first hierarchy, integration with regions existing in a region different from the region to be processed is prohibited. As a specific example, a case will be described in which each of the regions from "1-chome" to "6-chome" in the region of "Minatomirai, Nishi-ku, Yokohama, Kanagawa Prefecture" is regarded as one region, and each of the regions from "4-chome" to "7-chome" in the region of "Sakuragicho, Nishi-ku, Yokohama, Kanagawa Prefecture" is regarded as one region. In this case, for example, "Minatomirai 1-chome, Nishi-ku, Yokohama, Kanagawa Prefecture" and "Minatomirai 2-chome, Nishi-ku, Yokohama, Kanagawa Prefecture" are regarded as integrable because they are in the same region, "Minatomirai, Nishi-ku, Yokohama, Kanagawa Prefecture", in a hierarchy divided into regions with a coarser granularity than the "chome" hierarchy. On the other hand, "Minatomirai 4-chome, Nishi-ku, Yokohama, Kanagawa Prefecture" and "Sakuragicho 7-chome, Nishi-ku, Yokohama, Kanagawa Prefecture" are in different areas at a level that is coarser than the "chome" level, and therefore are prohibited from being merged.

[0042] Next, the operation of the information processing device 14 will be described with reference to Fig. 10. The CPU 20 executes the information processing program 30, whereby the region integrating process shown in Fig. 10 is performed.

[0043] In step S10 of FIG. 10, the selection unit 40 judges whether or not there is an area included in the specific area group that has not been selected as a processing target of the area integration process and has an index value less than the first threshold value. If this judgment is a positive judgment, the process proceeds to step S12. In this embodiment, as the specific area group, for example, an area group that represents a geographical range in which a player can move in a game, such as a geographical range in Japan, is applied. Note that the specific area group may be an area group that represents a part of a geographical range in which a player can move in a game, such as a region such as the Kanto region or a prefecture. In this case, the area integration process is executed for each part of the area group.

[0044] In step S12, the selection unit 40 selects the area with the smallest index value as the area to be processed from among areas included in a specific area group, that have not been selected as a processing target for the area merging process, and that have an index value less than the first threshold value.

[0045] In step S14, the integrating unit 42 adds adjacent areas adjacent to the processing target area in a predetermined order to a list for enumerating adjacent areas to be integrated with the processing target area (hereinafter referred to as the "adjacent area list"). As shown in FIG. 11, in this embodiment, the integrating unit 42 adds adjacent areas adjacent to the processing target area to the adjacent area list in ascending order of index value, as described above. In the example of FIG. 11, four adjacent areas are adjacent to the processing target area, and the numerical values ​​in each adjacent area represent the order of index value. When generating this adjacent area list, the integrating unit 42 does not add adjacent areas that satisfy the above-mentioned integration prohibition conditions to the adjacent area list.

[0046] In step S16, the integration unit 42 determines whether or not there is an area whose index value is less than the first threshold value among the adjacent areas included in the adjacent area list generated in step S14. If this determination is positive, the process proceeds to step S18. In step S18, the integration unit 42 integrates the first adjacent area in the adjacent area list into the processing target area. That is, in the subsequent processes, the processing target area becomes an area including the adjacent areas integrated in step S18.

[0047] After the adjacent regions are integrated into the processing target region in step S18, the integration unit 42 updates the adjacent region list in step S20. Specifically, first, the integration unit 42 deletes the first adjacent region from the adjacent region list, i.e., the adjacent region integrated in step S18. Next, the integration unit 42 adds a second adjacent region that is not adjacent to the processing target region but is adjacent to the first adjacent region integrated in step S18 to the adjacent region list with a lower priority than the existing adjacent regions. In this embodiment, the second adjacent region is added to the end of the adjacent region list in the above-mentioned predetermined order, i.e., in ascending order of index value.

[0048] In step S22, the integration unit 42 judges whether the index value of the processing target area, which is the result of the integration in step S18, is equal to or greater than the first threshold value. If this judgment is a negative judgment, the process returns to step S16, and if this judgment is a positive judgment, the process returns to step S10. That is, as shown in FIG. 12, the first adjacent area adjacent to the processing target area is integrated into the processing target area in ascending order of index value. If the index value of the processing target area is still less than the first threshold value after the first adjacent area is integrated into the processing target area, the second adjacent area adjacent to the first adjacent area is integrated into the processing target area. In the example of FIG. 12, the numerical values ​​in the area are represented in the order in which they are integrated into the processing target area. This makes it possible to prevent the processing target area, which is the result of the integration, from becoming a shape that makes it difficult for the player to grasp the range of the area, such as a long and narrow shape.

[0049] On the other hand, if the determination in step S16 is negative, the process proceeds to step S24. In step S24, the integration unit 42 updates the unreached area list by adding the processing target area to a list for managing areas that were selected as targets for the area integration process but whose index values ​​did not reach the first threshold (hereinafter, referred to as the "unreached area list"). When the process in step S24 ends, the process returns to step S10.

[0050] When the process of integrating the index values ​​of a specific area group including a plurality of areas so that the index values ​​are equal to or greater than the first threshold is completed, the determination in step S10 becomes negative, and the process proceeds to step S26. In step S26, the integration unit 42 determines whether or not there is an area in the unreached area list whose index value is less than the first threshold. If this determination becomes positive, the process proceeds to step S28.

[0051] In step S28, the selection unit 40 selects the area with the smallest index value from among the areas whose index values ​​are less than the first threshold value and are included in the unattained area list. In step S30, the integration unit 42 judges whether or not there is an adjacent area adjacent to the area selected in step S28. If this judgment is a positive judgment, the process proceeds to step S32. In step S32, the integration unit 42 integrates the adjacent area with the smallest index value among the adjacent areas adjacent to the area selected in step S28. That is, after the end of the process of integrating the index values ​​of a specific area group including a plurality of areas so that the index value is equal to or greater than the first threshold value, if there is an area in the specific area group whose index value is less than the first threshold value, the integration unit 42 integrates the area whose index value is less than the first threshold value with any of the multiple areas adjacent to the area whose index value is less than the first threshold value. In the subsequent processes, the area selected in step S28 becomes the area including the adjacent areas integrated in step S32. In step S34, the integration unit 42 updates the unreached area list by deleting from the unreached area list the adjacent area that was integrated in step S32. When the process of step S34 ends, the process returns to step S26.

[0052] On the other hand, if the determination in step S30 is negative, the process proceeds to step S36. In step S36, the integration unit 42 saves the area selected in step S28 as an area whose index value is less than the first threshold even when the area integration process is completed. The developer or the like determines whether or not to use the area saved in step S36 as an area in the game. An example of such an area is an isolated island whose index value is less than the first threshold. When step S36 ends, the process returns to step S26.

[0053] If the determination in step S26 is negative, the process proceeds to step S38. In step S38, the selection unit 40 determines whether or not there is an area in which the set number of accessible locations is less than a fourth threshold value among the areas in which the index value is equal to or greater than the first threshold value through the above processes. If the determination is positive, the process proceeds to step S40.

[0054] In step S40, the selection unit 40 selects the area with the smallest number of accessible locations from among the areas with a number of accessible locations less than the fourth threshold. In step S42, the integration unit 42 integrates the area selected in step S40 with at least one of the areas adjacent to the area so that the number of accessible locations after integration is equal to or greater than the fourth threshold. When the process of step S42 ends, the process returns to step S38. On the other hand, when the determination in step S38 is negative, the area integration process ends.

[0055] As described above, according to this embodiment, it is possible to suppress the occurrence of regional disparities.

[0056] In the above embodiment, the process executed by the CPU 20 after reading the software (program) may be executed by various processors other than the CPU. In this case, examples of the processor include a PLD (Programmable Logic Device) such as an FPGA (Field Programmable Gate Array) whose circuit configuration can be changed after manufacture, and a dedicated electric circuit such as an ASIC (Application Specific Integrated Circuit) which is a processor having a circuit configuration designed exclusively for executing a specific process. In addition, the process executed by the CPU 20 after reading the software (program) may be executed by one of these various processors, or may be executed by a combination of two or more processors of the same or different types (for example, a plurality of FPGAs, a combination of a CPU and an FPGA, etc.). In addition, the hardware structure of these various processors is, more specifically, an electric circuit that combines circuit elements such as semiconductor elements.

[0057] In the above embodiment, the information processing program 30 is stored (installed) in advance in the storage unit 22, but the present invention is not limited to this. The information processing program 30 may be provided in a form recorded on a recording medium such as a CD-ROM (Compact Disc Read Only Memory), a DVD-ROM (Digital Versatile Disc Read Only Memory), or a USB (Universal Serial Bus) memory. The information processing program 30 may be downloaded from an external device via a network. [Explanation of symbols]

[0058] 10. Information Processing Systems 12 Mobile devices 14 Information processing equipment 20 CPU 30 Information Processing Program 40 Selection section 42 Integration Department

Claims

1. In a location-based game in which a player's position, which is determined from the player's position information, moves through an area arranged in a virtual space, A processing target area, which is an area having a scale-dependent index value less than a threshold, and at least one adjacent area of ​​one or more adjacent areas, which are areas adjacent to the processing target area, are integrated so that the index value of a result of the integration is equal to or greater than the threshold. An information processing program for causing a computer to execute processing.

2. selecting a region in which the index value is less than the threshold as the processing target region; A process of integrating each of the one or more adjacent regions adjacent to the selected processing target region with the processing target region in a predetermined order until the index value is equal to or greater than the threshold value.

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

3. The predetermined order is an ascending order of the index value. The information processing program according to claim 2.

4. After integrating the first adjacent region into the processing target region, a second adjacent region that is not adjacent to the processing target region but is adjacent to the first adjacent region is added to the list representing the predetermined order with a lower priority than the existing adjacent regions.

4. The information processing program according to claim 2 or 3, for causing a computer to execute the process.

5. Among the one or more adjacent regions, an adjacent region that is configured by a plurality of partial regions that are not adjacent to each other and in which only a partial region of the plurality of partial regions whose index value is less than a second threshold value is adjacent to the processing target region is excluded from a target for integration into the processing target region.

4. The information processing program according to claim 1, for causing a computer to execute the process.

6. Among the one or more adjacent regions, an adjacent region adjacent to the processing target region constituted by a plurality of partial regions that are not adjacent to each other and adjacent only to a partial region among the plurality of partial regions whose index value is less than a second threshold value is excluded from a target to be integrated into the processing target region.

4. The information processing program according to claim 1, for causing a computer to execute the process.

7. The adjacent region, the length of which is in contact with the processing target region is less than a third threshold, is excluded from the integration target to be integrated into the processing target region.

4. The information processing program according to claim 1, for causing a computer to execute the process.

8. After completing the process of integrating the index values ​​of a specific region group including a plurality of regions so that the index values ​​are equal to or greater than the threshold value, if there is a region in the specific region group whose index value is less than the threshold value, the region whose index value is less than the threshold value is integrated into one of the plurality of regions adjacent to the region whose index value is less than the threshold value.

4. The information processing program according to claim 1, for causing a computer to execute the process.

9. The area is set with information indicating accessible locations within the area in real space, A region in which the index value is equal to or greater than the threshold value and the number of accessible locations set is less than a fourth threshold value is integrated with at least one of a plurality of regions adjacent to the region in such a way that the number of accessible locations set after integration is equal to or greater than the fourth threshold value.

4. The information processing program according to claim 1, for causing a computer to execute the process.

10. The map is divided into a fine-grained layer and a coarse-grained layer, and the area divided in one layer is the area; Among regions in a hierarchy divided into regions with a coarser granularity than the one hierarchy, only regions that exist in the same region as the processing target region can be integrated with the processing target region. The information processing program according to any one of claims 1 to 3.

11. In a location-based game in which a player's position, which is determined from the player's position information, moves through an area arranged in a virtual space, A processing target area, which is an area having a scale-dependent index value less than a threshold, and at least one adjacent area of ​​one or more adjacent areas, which are areas adjacent to the processing target area, are integrated so that the index value of a result of the integration is equal to or greater than the threshold. An information processing method in which processing is performed by a computer.

12. a processor, the processor comprising: In a location-based game in which a player's position, which is determined from the player's position information, moves through an area arranged in a virtual space, A processing target area, which is an area having a scale-dependent index value less than a threshold, and at least one adjacent area of ​​one or more adjacent areas, which are areas adjacent to the processing target area, are integrated so that the index value of a result of the integration is equal to or greater than the threshold. Information processing device.

Images