Storage medium having game program stored therein, information processing system, information processing method, and information processing

Abstract

To provide a game program in which various courses are set on a field, a race can be performed for each course, and courses with variations can be set.SOLUTION: An example of the game system according to the exemplary embodiment is configured to present, after the end of a first race on a course having a goal point set in a first base area, a plurality of candidates including a first type of course candidate including an inter-base route from the first base area to another second base area and a second type of course candidate including an in-base route in a third base area different from the first base area to a player as course candidates for a next second race, One of the plurality of candidates is set as a second course on the basis of the player's selection.SELECTED DRAWING: Figure 7

Description

[Technical Field]

[0001] The present invention relates to a game program, an information processing system, an information processing method, and an information processing device that are capable of executing a racing game. [Background technology]

[0002] BACKGROUND ART Conventionally, there have been game systems in which a racing game is played on a plurality of types of courses (see, for example, Patent Document 1). [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Japanese Patent Application Publication No. 9-94350 Summary of the Invention [Problem to be solved by the invention]

[0004] In conventional games, a moving object travels the same route along a course multiple times, and there is room for improvement in terms of setting courses with more variety.

[0005] Therefore, an object of the present invention is to provide a game program, an information processing system, an information processing method, and an information processing device that allow races to be held on various courses on a field and that allow for a variety of course settings. [Means for solving the problem]

[0006] The present invention employs the following configuration.

[0007] (First Configuration) A game program of a first configuration causes a computer of an information processing device to run a control object on a field in a virtual space based on operation input. A plurality of base areas are set in the field. When an instruction to start a race between the control object and at least one other mobile object is given based on the operation input, the game program causes the computer to set on the field a course corresponding to the determined race, the course including at least one of an intra-base route that is a route set within the base area and an inter-base route that is set as a route connecting the base areas, and the finish point of which is set within one of the base areas, and starts the race. The game program also causes the computer to run the control object and the mobile object along the set course on the field in the race, and after a first race on a course with a finish point set in a first base area is completed, generate a plurality of course candidates for a subsequent second race, including at least a first type of candidate corresponding to a first type of course in which a starting point is set in the first base area and includes the inter-base route from the first base area to another second base area, and a second type of candidate corresponding to a second type of course in which a starting point is set in a third base area different from the first base area and includes an intra-base route in the third base area, causes the computer to select one of the plurality of course candidates based on operation input, determines the course for the second race based on the selection, and sets the determined course on the field to start the second race.

[0008] Based on the above, a variety of candidate courses can be presented to the user as the course for the second race, allowing the user to select one.

[0009] (Second Configuration) In a second configuration, in the above first configuration, the first type of course may be a plurality of courses including the inter-base route from the first base area to each of the plurality of second base areas.

[0010] Based on the above, it is possible to present to the user a route from a first base area to a plurality of second base areas connected by a plurality of inter-base routes, and allow the user to select one.

[0011] (Third Configuration) In a third configuration, in the first or second configuration, the first type of course may be a course in which the inter-base route from the first base area to the second base area is set followed by the intra-base route in the second base area. Also, the second type of course may be a course that circumnavigates the intra-base route in the third base area multiple times.

[0012] Based on the above, it is possible to cause the player object to travel along the intra-base route in the base area, whether the course is the first type or the second type.

[0013] (Fourth Configuration) In a fourth configuration, in any of the first to third configurations, the third base area may be set from among a plurality of base areas on the field based on a first condition regarding a direction on the field from the first base area.

[0014] Based on the above, a base area that satisfies the first condition regarding the direction from the first base can be set as the third base area, and the course of the second race can be varied.

[0015] (Fifth Configuration) In a fifth configuration, in any of the first to fourth configurations, the third base area may be set from among the base areas on the field based on a second condition regarding a distance from the first base area.

[0016] Based on the above, a base area that satisfies the second condition regarding the distance from the first base can be set as the third base area, and the course of the second race can be varied.

[0017] (6th Configuration) In a sixth configuration, in any of the first to fifth configurations, the third base area may be set from among a plurality of base areas on the field, starting from the base area with the highest evaluation, based on an evaluation that increases the farther the direction on the field from the first base area is from the direction from the first base area to the second base area, and that increases the closer the distance from the first base area is to a predetermined distance.

[0018] Based on the above, the third base area can be set to be a base area that is located in a direction different from the direction from the first base area to the second base area and that is close to a predetermined distance from the first base area, thereby adding variety to the course of the second race.

[0019] (7th Configuration) In a seventh configuration, in any of the above first to sixth configurations, the second base area and the third base area may be set from among the base areas on the field other than the base areas reached or passed through in the most recent predetermined number of races.

[0020] Based on the above, it is possible to prevent a racing game from being played using the same base area as the base area passed through or reached in the most recent race.

[0021] (8th Configuration) In an eighth configuration, in any of the first to seventh configurations above, the game program may further cause the computer to display, after the first race has ended, a candidate presentation UI that includes at least information that identifies the second base area for the first type of candidate and information that does not identify the third base area for the second type of candidate.

[0022] According to the above, the player can thereby select a desired base area, or move away from the base area where the player is currently located and select a base area where the destination is unknown.

[0023] (9th Configuration) In a ninth configuration, in the above eighth configuration, the game program may further cause the computer to generate a third type of candidate for the second race course, the candidate for the second race course having a starting point set in a fourth base area different from the first base area and corresponding to a third type of course including an intra-base route in the fourth base area, and display the candidate presentation UI for the third type of candidate, which further includes information identifying the fourth base area.

[0024] Based on the above, the player can select a base area where the player knows a destination away from the base area where the player is currently located.

[0025] (10th Component) In a tenth configuration, in any one of the first to ninth configurations, the game program may further cause the computer to run the control object on the field before the start of the race. Also, the game program may cause the computer to generate, before the start of a first race, a plurality of candidate courses for the first race, including at least a first type of candidate course in which a starting point is set in a fifth base area among the base areas that is closest to the position of the control object and that includes the inter-base route from the fifth base area to a sixth base area, and a second type of candidate course in which a starting point is set in a seventh base area different from the fifth base area and that includes an intra-base route in the seventh base area.

[0026] Based on the above, it is possible to allow the user to select either the first type of candidate or the second type of candidate for the first race as well.

[0027] (11th Element) In an eleventh configuration, in any of the first to tenth configurations above, the game program may cause the computer to determine the course of the second race to be the course corresponding to the candidate selected based on operational input.

[0028] Based on the above, the candidate selected by the player can be used as the course for the second race.

[0029] (12th Feature) In a twelfth configuration, in any of the first to tenth configurations above, the game program may cause the computer to conduct a race with multiple players based on communication, and to determine the course of the second race from among the candidates selected by each player.

[0030] Based on the above, in a racing game played by a plurality of players, the course of the second race can be determined by selection by the plurality of players.

[0031] Furthermore, the other configuration may be an information processing system that executes the game program, an information processing device, or an information processing method. [Effects of the Invention]

[0032] According to the present invention, it is possible to present to the user a variety of candidate courses as the course for the second race following the first race. [Brief explanation of the drawings]

[0033] [Figure 1] FIG. 1 illustrates an example of a game system. [Figure 2] A block diagram showing an example of the internal configuration of a main unit. [Figure 3] A diagram showing an example of the entire field F in a virtual space. [Figure 4] FIG. 10 is a diagram showing an example of an intra-site route CA1 set in a site area A1. [Figure 5] FIG. 10 is a diagram showing an example of a voting screen for determining the course for the next racing game. [Figure 6] FIG. 6 is a diagram showing the positional relationship of base areas indicated by the icons when the voting screen shown in FIG. 5 is displayed. [Figure 7] FIG. 10 is a diagram showing an example of a voting screen when two base areas A2 and A4 are extracted as first-type candidates and the remaining two are extracted as second-type candidates. [Figure 8] FIG. 8 is a diagram showing the positional relationship of base areas indicated by the icons on the voting screen shown in FIG. 7. [Figure 9] FIG. 10 is a diagram showing an example of a voting screen when no first-type candidates are extracted in the first step. [Figure 10] FIG. 15 shows an example of various data used in the processes shown in FIGS. 11 to 14. [Figure 11]1 is a flowchart illustrating an example of a main process. [Figure 12] A flowchart showing an example of the voting process in step S5. [Figure 13] 10 is a flowchart showing an example of the second candidate extraction process of step S13. [Figure 14] A flowchart showing an example of the racing game process in step S6. DETAILED DESCRIPTION OF THE INVENTION

[0034] (Game system configuration) A game system according to an example of this embodiment will be described below. FIG. 1 is a diagram showing an example of a game system. An example of a game system 1 according to this embodiment includes a main unit (information processing device; in this embodiment, it functions as a game device main unit) 2, a left controller 3, and a right controller 4. The main unit 2 is a device that executes various processes (e.g., game processes) in the game system 1. The left controller 3 and right controller 4 include a plurality of buttons (A button, B button, X button, Y button, L button, R button, etc.) and analog sticks as an example of an operation unit that allows the user to perform inputs.

[0035] The main unit 2 is configured so that the left controller 3 and the right controller 4 can be attached and detached. In other words, the game system 1 can be used as an integrated device by attaching the left controller 3 and the right controller 4 to the main unit 2, or the main unit 2 can be used as a separate device from the left controller 3 and the right controller 4. Note that, below, the left controller 3 and the right controller 4 may be collectively referred to as the "controller."

[0036] FIG. 2 is a block diagram showing an example of the internal configuration of the main unit 2. As shown in FIG. 2, the main unit 2 includes a processor 21. The processor 21 is an information processing unit that executes various types of information processing (e.g., game processing) executed in the main unit 2, and includes, for example, one or more central processing units (CPUs) and one or more graphics processing units (GPUs). The processor 21 may be composed of only a CPU, or may be composed of a system-on-a-chip (SoC) that includes multiple functions such as a CPU function and a GPU function. The processor 21 executes various types of information processing by executing an information processing program (e.g., a game program) stored in a storage unit (specifically, an internal storage medium such as flash memory 26, or an external storage medium inserted into slot 29, etc.).

[0037] The main device 2 also includes a display 12. The display 12 displays images generated by the main device 2. In this embodiment, the display 12 is a liquid crystal display (LCD). However, the display 12 may be any type of display device. The display 12 is connected to a processor 21. The processor 21 displays images generated (for example, by executing the above-described information processing) and / or images acquired from the outside on the display 12.

[0038] The main unit 2 also has a left terminal 22, which is a terminal for the main unit 2 to communicate with the left controller 3 via a wired connection, and a right terminal 23, which is a terminal for the main unit 2 to communicate with the right controller 4 via a wired connection.

[0039] The main device 2 also includes flash memory 26 and DRAM (Dynamic Random Access Memory) 27 as examples of internal storage media built into the main device 2. The flash memory 26 and DRAM 27 are connected to the processor 21. The flash memory 26 is a memory used primarily to store various types of data (which may be programs) saved in the main device 2. The DRAM 27 is a memory used to temporarily store various types of data used in information processing.

[0040] The main unit 2 includes a slot 29. The slot 29 has a shape that allows a predetermined type of storage medium to be inserted therein. The predetermined type of storage medium is, for example, a storage medium (e.g., a dedicated memory card) dedicated to the game system 1 and the same type of information processing device. The predetermined type of storage medium is used, for example, to store data used by the main unit 2 (e.g., save data for a game application, etc.) and / or programs executed by the main unit 2 (e.g., a game program, etc.).

[0041] The main device 2 includes a slot interface (hereinafter abbreviated as "I / F") 28. The slot I / F 28 is connected to the processor 21. The slot I / F 28 is connected to a slot 29, and reads and writes data from and to a predetermined type of storage medium (e.g., a dedicated memory card) inserted into the slot 29 in accordance with instructions from the processor 21.

[0042] The processor 21 reads and writes data from and to the flash memory 26, the DRAM 27, and the above-mentioned storage media as appropriate, to execute the above-mentioned information processing.

[0043] The main unit 2 also includes a network communication unit 24. The network communication unit 24 is connected to the processor 21. The network communication unit 24 communicates with external devices via a network, either wirelessly or via a wired connection. In this embodiment, the network communication unit 24 connects to a wireless LAN and communicates with external devices using a method conforming to the Wi-Fi standard as a first communication mode. The network communication unit 24 also performs wireless communication with other main units 2 of the same type using a predetermined communication method (e.g., communication using a proprietary protocol or infrared communication) as a second communication mode. Note that the wireless communication using the second communication mode enables wireless communication with other main units 2 located within a closed local network area, and realizes a function that enables so-called "local communication," in which data is transmitted and received between multiple main units 2 by communicating directly or indirectly via an access point.

[0044] The main unit 2 includes a controller communication unit 25. The controller communication unit 25 is connected to the processor 21. The controller communication unit 25 performs wireless communication with the left controller 3 and / or right controller 4. Any communication method may be used between the main unit 2 and the left controller 3 and right controller 4, but in this embodiment, the controller communication unit 25 performs communication with the left controller 3 and right controller 4 in accordance with the Bluetooth (registered trademark) standard.

[0045] The processor 21 is connected to the above-mentioned left terminal 22 and right terminal 23. When the processor 21 performs wired communication with the left controller 3, it transmits data to the left controller 3 via the left terminal 22 and receives operation data from the left controller 3 via the left terminal 22. When the processor 21 performs wired communication with the right controller 4, it transmits data to the right controller 4 via the right terminal 23 and receives operation data from the right controller 4 via the right terminal 23. In this way, in this embodiment, the main unit 2 can perform both wired and wireless communication with the left controller 3 and the right controller 4, respectively.

[0046] In addition to the elements shown in FIG. 2, the main unit 2 also includes a battery for supplying power and an output terminal for outputting images and audio to a display device other than the display 12 (an external display device, such as a television).

[0047] (Game Overview) Next, an outline of the game executed in the game system 1 will be described. The game of this embodiment is a racing game in which a player object (an example of an operation object) operated by a player and other moving objects controlled by other players or the processor 21 run on a field in a virtual space.

[0048] First, a description will be given of the field in the virtual space where the racing game of this embodiment is played in. Fig. 3 is a diagram showing an example of the entire field F in the virtual space.

[0049] In this embodiment, a vast field F is set in a virtual space (game space), and a racing game is played on various courses set on the field. As shown in FIG. 3, a plurality of base areas A are set on the field F in the virtual space. For example, base areas A1 to A17 are represented by circles as the plurality of base areas A. Each base area A includes an intra-base route CA along which a player object corresponding to a player can play the racing game. For example, base area A1 is an area representing a town, and includes an intra-base route CA1 formed by roads along which the player object can run. Furthermore, for example, base area A2 includes an intra-base route CA2 which is a racing circuit.

[0050] The multiple base areas are connected by inter-base routes R along which the player object can travel. For example, base area A1 and base area A2 are connected by inter-base route R1. Base area A1 and base area A4 are connected by inter-base route R3.

[0051] Hereinafter, an intra-base route established in a base area An (n is a positive integer) will be referred to as an "intra-base route CAn."

[0052] Next, an example of a base area will be described. Fig. 4 is a diagram showing an example of an intra-base route CA1 set in a base area A1.

[0053] As shown in FIG. 4, an intra-base route CA1 is provided in the base area A1. The intra-base route CA1 is an area in which a player object can move. A road is formed along the intra-base route CA1. The intra-base route CA1 is provided with gates that can serve as start and finish points. The intra-base route CA1 is also connected to inter-base routes R1 and R3. The inter-base route R1 is an area in which a player object can move, and is connected to the base area A2. The inter-base route R3 is an area in which a player object can move, and is connected to the base area A4.

[0054] In the game of this embodiment, a course including an inter-base route R and an intra-base route CA connected to the inter-base route R is set, and a racing game may be played in which a player object and other moving objects run along the course. For example, a course may be set in which the player object starts from a start point (gate) set on the intra-base route CA1, runs along the inter-base route R1 without going around the intra-base route CA1, enters the intra-base route CA2, makes one lap around the intra-base route CA2, and arrives at a goal point (gate) set on the intra-base route CA2. Alternatively, a course may be set in which the player object starts from a start point set on the intra-base route CA2, runs along the inter-base route R2 without going around the intra-base route CA2, enters the intra-base route CA3, makes one lap around the intra-base route CA3, and arrives at a goal point set on the intra-base route CA3.

[0055] A course including such an inter-site route R and an intra-site route CA is referred to as a “first type of course.” Note that the first type of course may be a course that circles the intra-site route CA, which has a starting point, once or multiple times, then enters the inter-site route R and arrives at the intra-site route CA that is connected to the inter-site route R.

[0056] In this embodiment, a course may be set in which the player object starts from a start point (gate) of the base intra-route CA, goes around the base intra-route CA multiple times, and reaches a goal point (gate). For example, a course may be set in which the player object goes around the base intra-route CA1 multiple times, or a course may be set in which the player object goes around the base intra-route CA2 multiple times. Note that a course set in which the player object starts from a start point of the base intra-route CA, goes around the base intra-route CA multiple times, and reaches a goal point set on the base intra-route CA is referred to as a "second type of course."

[0057] In the game of this embodiment, there may be cases where a racing game is played in which a course is not set and the player object runs at any position on the field F.

[0058] Next, the game modes will be described. In this embodiment, there are a single-play mode in which one player plays the game, and a multi-play mode in which multiple players play the game.

[0059] In single-play mode, one player controls a player object using controllers 3 and / or 4, and the processor 21 of the main unit 2 controls one or more other moving objects, thereby playing a racing game using multiple moving objects.

[0060] The multiplayer mode includes an offline multiplayer mode and an online multiplayer mode.

[0061] In offline multiplayer mode, multiple players play the game by wirelessly connecting multiple controllers to a single main unit 2, or by connecting multiple main units 2 via a wireless or wired LAN. The multiple players use their respective controllers to control their respective player objects. The main unit 2 acquires operation data related to the operations from the multiple controllers via wireless or wired communication, and controls the player objects corresponding to each player.

[0062] The online multiplayer mode is a mode in which multiple players play a game by connecting the main unit 2 to the Internet. Each main unit 2 of multiple players transmits a request to an Internet server to play a racing game in online multiplayer mode. The server matches multiple players in response to the request. For example, when a predetermined number of players have been matched, the racing game in online multiplayer mode begins. When the racing game begins, each player uses a controller to control their corresponding player object. Specifically, each main unit 2 controls its own player object based on operation data from the controller and transmits information about the player object (e.g., information about position, posture, speed, and action) to the server. Each main unit 2 also receives information about the player objects corresponding to other players (e.g., information about position, posture, speed, and action) from other main units 2 via the server. Each main unit 2 controls the player objects corresponding to other players based on the received information.

[0063] It is also possible to connect multiple controllers to a single main unit 2, and have multiple players play a game in online multiplayer mode using that single main unit 2. For example, two players can each operate two controllers connected to the main unit 2 and connect that main unit 2 to the Internet, allowing the two players to play a game in online multiplayer mode using a single main unit 2. In this case, the screen of an external display device connected to the main unit 2 is divided into two, and an image including each player object is displayed in each divided area.

[0064] It should be noted that a racing game may be played in online multiplay mode by multiple main units 2 communicating directly via the Internet without going through a server.

[0065] (Course Vote) When a command to start a game in this embodiment is given, multiple racing games using multiple courses are played in sequence until a predetermined end condition is met (for example, until a command to end the game is given by a player). In this embodiment, when a racing game is played in online multiplayer mode or offline multiplayer mode, after the previous racing game has ended, the course on which the next racing game will be played is decided by voting by multiple players.

[0066] FIG. 5 is a diagram showing an example of a voting screen for determining the course for the next racing game. For example, FIG. 5 shows a voting screen that is displayed after the previous racing game ends when multiple player objects reach a finish point set in base area A5. The base area A in which the finish point was set in the previous racing game is sometimes referred to as the "starting area." The "starting area" is the base area in which the player objects were located when the previous racing game ended. The course of the previous racing game may be a first type of course that passes through an inter-base route, or may be a second type of course that makes multiple laps around an intra-base route. After the previous racing game ends, the voting screen shown in FIG. 5 is displayed on each player's screen (the display 12 or the screen of an external display device). Note that the voting screen shown in FIG. 5 may also be displayed after a predetermined interval has elapsed since the previous racing game ended.

[0067] 5, the voting screen displays an image showing a part of field F including the starting area (here, base area A5) where the player object is located, and displays four candidate courses as candidates for the course on which the next racing game will be played. On the voting screen, the player is presented with a first type of candidate course (a course including a route between bases) and a second type of candidate course (a course that circles a route within a base).

[0068] 5, the following courses are presented as candidates for the first type of course: a course from the starting point area to base area A2 via inter-base route R5, a course from the starting point area to base area A4 via inter-base route R4, and a course from the starting point area to base area A8 via inter-base route R6. These candidates for the first type of course are determined by a computer based on a predetermined algorithm, which will be described later.

[0069] Specifically, an icon ICP indicating the player object, an icon ICX2 indicating the base area A2, an icon ICX4 indicating the base area A4, and an icon ICX8 indicating the base area A8 are displayed. Also displayed are dashed lines pointing from the starting point area (icon ICP) to icon ICX2 indicating the base area A2, dashed lines pointing from the starting point area to icon ICX4 indicating the base area A4, and dashed lines pointing from the starting point area to icon ICX8 indicating the base area A8. These dashed lines indicate that the starting point area and each base area A are connected by inter-base routes R. On the voting screen, the icon ICP indicating the player object, the icon ICX2 indicating the base area A2, the icon ICX4 indicating the base area A4, and the icon ICX8 indicating the base area A8 are displayed in positions that correspond to the relative positions of each of these base areas on the field.

[0070] In the following, an icon written as "icon ICX" is an icon that can identify which base area it is and indicates a course from the starting point area to the base area via the inter-base route R. Also, when written as "icon ICXn" (n is a positive integer), n indicates the number of the base area. For example, "icon ICX3" indicates a course from the starting point area to the base area A3 via the inter-base route R.

[0071] Additionally, an icon ICZ with the word "Automatic" written on it and no dashed line extending from the starting area is placed in the lower right corner of the voting screen. This icon ICZ is a candidate for a second type of course and is determined by the computer based on a predetermined algorithm. The icon ICZ indicates any one of the multiple base areas set on the field that is not connected to the starting area by the inter-base route R. The icon ICZ is displayed in a manner that prevents the player from recognizing the specific base area. In other words, the icon ICZ is displayed in a manner that prevents the player from identifying the base area A. In contrast, the icons ICX2, ICX6, and ICX8 are displayed in a manner that allows the player to identify the base area. For example, the icon ICX2 is an icon that shows the name and image of the base area A2.

[0072] The course corresponding to the icon ICZ is called the "automatic course." The "automatic course" is a course that goes around the intra-base route CA of any one of the multiple base areas set on the field that is not connected to the starting area by the inter-base route R multiple times. When the voting screen is displayed, the "automatic course" is internally determined by the computer. Note that the "automatic course" does not have to be determined by the computer when the voting screen is displayed. In this case, when the "automatic course" is determined based on the voting results of each player, the specific course that the "automatic course" will be (the course that goes around the intra-base route CA of which base area) may also be determined.

[0073] As will be described in detail later, on the voting screen, in addition to the icon ICX indicating the first type of course and the icon ICZ indicating the "random course," an icon ICY indicating the second type of course may also be displayed. The icon ICY is displayed in a manner that allows identification of which base area it is.

[0074] Each player uses cursor 30 to select one of the four displayed candidates (icon ICX2, icon ICX4, icon ICX8, and icon ICZ) and vote for the course corresponding to each icon. Based on the results of each player's vote, one of the four candidates is determined as the course for the next racing game.

[0075] For example, one of four candidates is randomly selected. Specifically, a random drawing is performed so that the course with the most votes is more likely to be selected. For example, if each player is given one vote and 24 players are playing an online multiplayer mode game, the total number of votes is 24. In this case, if the number of votes for the course indicated by icon ICX2 is "8," the number of votes for the course indicated by icon ICX4 is "7," the number of votes for the course indicated by icon ICX8 is "5," and the number of votes for the "automatic course" is "4," the respective selection rates are set to "8 / 24," "7 / 24," "5 / 24," and "4 / 24." A random drawing is then performed based on the set selection rates. Note that the course with the most votes may be selected as the course for the next racing game.

[0076] It is possible to connect multiple controllers to one main unit 2, and multiple players can use that single main unit 2 to participate in a game in online multiplayer mode. For example, two controllers can be wirelessly connected to one main unit 2, and two players can use that single main unit 2 to participate in a game in online multiplayer mode. In this case, one player may vote for one candidate on the voting screen as a representative, or two players may each vote on the voting screen. When one player votes for one candidate on the voting screen as a representative, the number of votes for that candidate is "2."

[0077] (Algorithm for generating next course candidates) Next, an algorithm for generating each candidate displayed on the voting screen will be described.

[0078] FIG. 6 is a diagram showing the positional relationship of the base areas indicated by the icons when the voting screen shown in FIG. 5 is displayed.

[0079] In this embodiment, four candidate courses to be used in the next racing game are generated through the first and second steps. In the first step, up to three base areas connected to the starting area by the base-to-base route R are extracted. The candidates extracted in this first step are referred to as "first-type candidates." If a predetermined condition is met, the number of first-type candidates extracted in the first step is set to a maximum of two. For example, if the course used in the previous racing game was not a second-type course (i.e., a first-type course), the number of first-type candidates extracted in the first step will be a maximum of two with a certain probability. Furthermore, if the icon ICY shown in FIG. 7 (described later) was displayed on the previous voting screen, the number of first-type candidates extracted in the first step is set to three when generating the current voting screen.

[0080] Specifically, first, the number of first-type candidates to be generated in the first step is determined by random lottery. For example, assume that the number of first-type candidates is determined by random lottery to be "3." In this case, if there are three or more base areas connected to the starting point area by the base route R, three are randomly selected from among them. Here, base areas used in the most recent predetermined number of races are excluded from the base areas to be selected. "Base areas used in the most recent predetermined number of races" are base areas that the player object arrived at or passed through in the most recent predetermined number of races. For example, "base areas used in the most recent predetermined number of races" are base areas where the start point of a first-type course is set, and base areas where the finish point of a first-type course or a second-type course is set in the most recent predetermined number of races.

[0081] In the example shown in FIG. 6, assume that the course used in the previous racing game was a course with base area A6 as the starting point and base area A5 as the finishing point. Also assume that the three base areas A2, A4, and A8 were not used in the most recent predetermined number of races. In this case, of the four base areas connected to the starting point area by inter-base route R, the three base areas A2, A4, and A8, excluding base area A6, are extracted in the first step. This extracts three of the four candidate courses for the next racing game. Note that in FIG. 6, the base area A used in the most recent predetermined number of races is indicated by a dashed circle. The three base areas A2, A4, and A8 extracted in the first step are indicated by thick circles.

[0082] Next, in a second step, at least one of a plurality of base areas set on the field is extracted based on a condition regarding the direction on the field from the starting point area and a condition regarding the distance from the starting point area. For example, the condition regarding the direction is a condition that tends to select a base area that is as different as possible from the direction from the starting point area to the base area extracted in the first step. For example, the condition regarding the distance is a condition that tends to select a base area that is a reasonable distance from the starting point area. For example, if three base areas A2, A4, and A8 are extracted in the first step, a base area is extracted in the second step based on these three base areas A2, A4, and A8 and the starting point area.

[0083] More specifically, for each base area set on the field, an evaluation value f(x) is calculated using Equation 1 shown below.

[0084]

number

[0085] Here, "x" is the vector from the origin area to the base area for which the evaluation value is to be calculated. n" is a vector from the starting area to the base area (candidate) that has already been extracted. "n" is the number of base areas that have already been extracted. Also, A, L, and M are constants, and e is the base of the natural logarithm.

[0086] f(x) is an evaluation based on the conditions related to the direction and the conditions related to the distance. Specifically, the first term on the right side of Equation 1 is the value related to the direction from the starting area. This value is calculated by dividing the vector "x" and the vector "u n " is smaller. In other words, a base area with a small value is a base area located in the opposite direction from the starting point area to the base area A that has already been extracted.

[0087] Additionally, the second term on the right side of Equation 1 is a value related to the distance from the origin area. This value is relatively large in the first range where the magnitude of vector "x" is greater than 0 and less than the first value, relatively small in the second range where the magnitude of vector "x" is greater than the first value and less than the second value, and relatively large in the third range where the magnitude of vector "x" is greater than the second value. In other words, this value is large for base areas that are too close to the origin area, and also large for base areas that are too far from the origin area. The value of the second term is small for base areas that are a certain distance away from the origin area, that is, neither too close nor too far.

[0088] Therefore, base areas that are located in the opposite direction from the origin area to the extracted base areas and that are some distance away from the origin area have a small value of f(x) (evaluation value).

[0089] Of all base areas set in the field, evaluation values ​​are calculated using Equation 1 for base areas excluding those used in the most recent predetermined number of races. One of the multiple base areas for which evaluation values ​​have been calculated is extracted. For example, one of the top four base areas with the highest evaluations (lowest evaluation values) is extracted at random. For example, a lottery is held so that the higher the evaluation (lower evaluation value) of the base area, the higher the probability of it being extracted. Alternatively, the base area with the highest evaluation (lowest evaluation value) may be extracted.

[0090] Here, it is assumed that a base area A13 is extracted in the second step. In FIG. 6, the base area A13 extracted in the second step is indicated by a double circle. The course candidates extracted in the second step are referred to as "second-type candidates." The second-type candidates are base areas that are located in a direction different from the direction toward the first-type candidates from the starting area where each player object was located at the end of the previous racing game, and that are some distance away from the starting area. One second-type candidate extracted in the second step is presented as an "automatic course."

[0091] In this way, a voting screen is displayed that includes three icons (icons ICX2, ICX4, ICX8) representing each of the three first-type candidates extracted in the first step, and one icon (icon ICZ) representing one second-type candidate extracted in the second step.

[0092] It should be noted that the number of first-type candidates extracted in the first step may be 2 or less. In this case, two or more second-type candidates are extracted in the second step.

[0093] For example, the number of first-type candidates to be extracted in the first step may be determined to be "2." Even if the number of first-type candidates to be extracted in the first step is determined to be "3," it may not be possible to extract three first-type candidates. For example, even if the starting area is connected to three or more base areas by inter-base route R, if any of the connected base areas has been used in a predetermined number of recent races, that base area will not be extracted in the first step. For example, if base area A5 is connected to four other base areas (A2, A4, A6, and A8) by inter-base route R, and of these four base areas, base area A6 and base area A8 have been used in a predetermined number of recent races, then two base areas, A2 and A4, are extracted as first-type candidates in the first step. In this case, two second-type candidates are extracted in the second step. One of the two second-type candidates is presented as an "automatic course."

[0094] FIG. 7 is a diagram showing an example of a voting screen when two base areas A2 and A4 are extracted as first type candidates and the remaining two are extracted as second type candidates.

[0095] As shown in Figure 7, an icon ICX2 corresponding to the course from the starting area (base area A5) via the inter-base route R5 to reach the base area A2, and an icon ICX4 corresponding to the course from the starting area via the inter-base route R4 to reach the base area A4 are displayed.

[0096] Furthermore, an icon ICZ indicating an "automatic course" is displayed as one of the two second-type candidates. Furthermore, an icon ICY7 indicating base area A7 is displayed as the other of the two second-type candidates. Icon ICY7 is an icon indicating a second-type course that involves multiple laps around the base area A7's intra-base route CA7. The dashed line leading from the starting area to icon ICY7 is not displayed. Icon ICY7, like icons ICX2 and ICX4, is displayed in a manner that allows the base area A7 (internal base route CA7) to be identified. For example, icon ICY7 is an icon that indicates a name or image indicating base area A7. The three icons ICX2, ICX4, and ICY7 on the voting screen are displayed in positions that correspond to the relative positions of each base area on the field.

[0097] In the following, when "icon ICYn" (n is a positive integer) is written, it indicates a second type of course that goes around the intra-base route CA of the base area numbered n multiple times. Icon ICXn and icon ICYn are displayed in different ways.

[0098] Base area A7 is extracted using the same algorithm as the automatic course. That is, based on the two base areas A2 and A4 extracted in the first step, the evaluation value shown in Formula 1 is calculated for all base areas set in the field, excluding the base areas used in the most recent predetermined number of races. Then, one of the top four base areas with the highest evaluations (lowest evaluation values) is randomly selected. Here, we will assume that base area A7 is selected as the result.

[0099] Fig. 8 is a diagram showing the positional relationship of the base areas indicated by the icons on the voting screen shown in Fig. 7. In the example shown in Fig. 8, a course that involves multiple laps around the base route CA14 in the base area A14 is internally determined as an "automatic course."

[0100] As shown in FIG. 8, base area A7 and base area A14 are located in the opposite direction from the starting point area (base area A5) to the two base areas A2 and A4, and are base areas that are some distance away from the starting point area.

[0101] When extracting two base areas in the second step, first, the first base area in the second step is extracted using formula 1 based on the two base areas A2 and A4 that have already been extracted. Next, the second base area in the second step is extracted using formula 1 based on the three base areas that have already been extracted. The base area set as the "automatic course" may be either the first base area extracted or the second base area extracted of the two base areas extracted in the second step.

[0102] When a voting screen is displayed and multiple players vote, one of the four candidates is determined as the course for the next racing game based on the voting results. For example, if the course indicated by icon ICX2 on the voting screen of FIG. 7 is determined, the next racing game will be played using that course. Specifically, multiple player objects start from the start point (gate) of the origin area where they are currently located, enter base area A2 via inter-base route R5, make one lap along intra-base route CA2 set in base area A2, and arrive at the finish point (gate).

[0103] Furthermore, when the course indicated by the icon ICY7 is determined, the multiple player objects instantly move from the starting area where they are currently located to the base area A7 and carry out the next race within the base area A7. Specifically, the multiple player objects start from a start point (gate) provided on the intra-base route CA7 in the base area A7, circle the intra-base route CA7 multiple times, and reach a finish point (gate) provided on the intra-base route CA7.

[0104] Furthermore, when the "automatic course" indicated by the icon ICZ is determined, the multiple player objects move from the starting area in which they are currently located to an internally determined base area A14, and conduct the next race within that base area A14. Specifically, the multiple player objects start from a starting point provided on an intra-base route CA14 in the base area A14, and travel around that intra-base route CA14 multiple times before reaching a goal point provided on that intra-base route CA14.

[0105] In this manner, in this embodiment, a plurality of candidates including first type candidates and second type candidates are presented to the player on the voting screen, which allows the player to play the racing game on various courses, such as a course in which the player object moves from the base area in which it is currently located to another base area via an inter-base route, or a course in which the player object moves from the base area in which it is currently located to a base area distant from the base area and runs within the base area of ​​the destination, and allows the player to play the racing game using a wide range of the field.

[0106] As shown in FIG. 7, if the icon ICY indicating the second type of course (a course that goes around a route within the base) is displayed on the current voting screen, the number of first type candidates extracted in the first step when the next voting screen is generated is set to "3." That is, the icon ICY is displayed on the current voting screen, a course is determined based on the results of the vote, the next racing game is played using the determined course, and after the next racing game is finished, the next voting screen is generated. In the first step when generating the next voting screen, the number of first type candidates extracted is set to "3." This allows a larger number of first type candidates to be presented on the next voting screen.

[0107] In some cases, no first-type candidates are extracted in the first step, in which case four second-type candidates are extracted in the second step.

[0108] FIG. 9 is a diagram showing an example of a voting screen when no first-type candidates are extracted in the first step. For example, as shown in FIG. 9, an icon ICY3 indicating base area A3, an icon ICY10 indicating base area A10, and an icon ICY12 indicating base area A12 are displayed. These three icons ICY3, ICY10, and ICY12 indicate base areas that are not connected to the starting area by an inter-base route, and indicate courses that involve multiple laps along the intra-base routes of each base area. No dashed lines are displayed from the starting area (base area A5) to each icon. The relative positions of these icons on the voting screen correspond to the relative positions of each base area in the field. An icon ICZ corresponding to an "automatic course" is also displayed in the lower right corner of the screen.

[0109] If no first-type candidates are extracted in the first step, three base areas are extracted in order using formula 1 in the second step. When extracting the first base area, since there is no "base area that has already been extracted," only the second term in formula 1 (a value related to the distance from base area A5) is calculated, and the first base area is extracted based on the value of the second term. The second base area is extracted using formula 1 based on the base area extracted first. The same is true for the third and subsequent base areas.

[0110] In the above, we have explained a case where the voting screen is displayed after the previous racing game ends and before the next racing game starts when multiple racing games are played in sequence. The "previous racing game" here refers to any racing game in a series of games (game session) in which multiple racing games are played in sequence.

[0111] The above-described voting screen is also displayed before the start of the first racing game in the series of games. In this case, the base area closest to a specific player object among the multiple player objects is set as the "starting area."

[0112] Specifically, when a player instructs the start of an online multiplayer game, the main unit 2 transmits a request for the online multiplayer game to a server on the Internet. The server receives the request, matches multiple players, and, if matched, starts a series of games (game sessions). Before match-ups are established (before a predetermined number of players have gathered), the server places player objects corresponding to each player at various positions on the field. For example, the server determines the positions of each player object and transmits the determined information to each main unit 2. Each main unit 2 receives information from the server and places the player object at the position determined by the server. Before match-ups are established, each player can freely move the placed player object on the field. When match-ups are established, the base area closest to the position of a specific player object among the multiple player objects is set as the "start area." All matched player objects are moved to the start area. For example, the main unit 2 corresponding to a specific player object identifies the base area closest to the position of the specific player object and transmits information about the identified base area to the server. The server transmits information about the identified base area to the main units 2 of all matched players. Each main unit 2 receives the information about the identified base area from the server, moves its own player object to the identified base area, and sets the identified base area as the starting area.

[0113] Note that, although the above describes an example in which a voting screen is displayed when a racing game is played in online multiplayer mode, a voting screen is also displayed when a racing game is played in offline multiplayer mode, and the course of the next racing game is determined by votes from multiple players.

[0114] The voting screen described above is also displayed when a racing game is played in single-play mode. In this case, the course selected by the player on the voting screen is used as the course for the next racing game.

[0115] (Processing details) Next, a specific process for voting for the next course will be described.

[0116] Fig. 10 is a diagram showing an example of various data used in the processes shown in Fig. 11 to Fig. 14. The various data shown in Fig. 10 is stored, for example, in a memory of the main device 2 (for example, DRAM 27, a storage medium attached to slot 29, or flash memory 26). Note that at least a portion of the various data shown in Fig. 10 may be stored in a server.

[0117] As shown in FIG. 10, the memory (for example, DRAM 27, a storage medium or flash memory 26 attached to slot 29, or memory in the server) stores a game program, player object data, other object data, field data, course data, history data, candidate data, and previous candidate data.

[0118] The game program is a program for executing each process (process shown in FIGS. 11 to 14) in this embodiment, which will be described later. The game program is stored in advance in, for example, a storage medium inserted in slot 29 or flash memory 26, and is read into DRAM 27 when the racing game is executed.

[0119] The player object data is data related to a player object controlled by a player of the main unit 2. The player object data includes data representing the shape of the player object, position and posture data representing the position and posture of the player object, and speed and acceleration data representing the speed and acceleration of the player object.

[0120] The other object data is data relating to a player object (referred to as an "other object") of another player other than the player of the main unit 2. Like the player object data, the other object data includes position and posture data representing the position and posture of the other object, and speed and acceleration data representing the speed and acceleration of the player object. The other object data is acquired from another main unit 2, for example, via a server on the Internet.

[0121] The field data is data that represents the entire field F. The field data includes data that indicates a plurality of base areas and data that indicates a plurality of inter-base route.

[0122] The course data is data relating to the course on which the racing game is played. In this embodiment, the courses on which the racing game is played include a first type of course that starts from a base area, travels along an inter-base route, and arrives at another base area, and a second type of course that involves multiple laps around an intra-base route set in a base area. The course data is stored in advance, and the course is set on the field when the racing game starts by reading the course data.

[0123] The history data is data relating to base areas used in a predetermined number of most recent races. The base areas used in a predetermined number of most recent races are base areas that a player object passed through or reached in a predetermined number of most recent racing games. For example, the base areas used in a predetermined number of most recent races are the base areas that served as the start points of the first type of course and the finish points of the first type of course or the second type of course in the predetermined number of most recent races.

[0124] The candidate data is data indicating candidate courses for the next racing game to be displayed on the voting screen. The candidate data includes data on four candidates. The candidate data is generated based on the first and second steps described above.

[0125] The previous candidate data is data relating to the four candidates displayed on the previous voting screen.

[0126] (Main processing) Next, a main process executed by the processor 21 of the main device 2 will be described. Fig. 11 is a flowchart showing an example of the main process. The main process shown in Fig. 11 is executed in response to, for example, a command from a player to start the above-described series of games. Here, a case where the above-described game is played in online multiplay mode will be described.

[0127] Processor 21 first performs a game start process to start a series of games (step S1). In the game start process, processor 21 transmits a request for an online multiplayer game to the server. The server receives the requests from multiple main units 2 and matches multiple players. Furthermore, when the server receives the requests from the main unit 2, it determines the placement position of the player object on the field and transmits position information related to the placement position to the main unit 2. Processor 21 receives the position information.

[0128] Next, processor 21 performs a placement process (step S2). Specifically, processor 21 places the player object at a position on the field according to the position information received from the server.

[0129] Next, processor 21 performs free running processing (step S3). Specifically, processor 21 executes processing for acquiring operation data according to a player's operation, processing for controlling a player object based on the acquired operation data, and rendering processing. Here, processor 21 causes the player object to run freely on the field according to the player's operation.

[0130] Next, processor 21 determines whether to start a series of games (step S4). Specifically, processor 21 determines whether a start instruction to start a series of games has been received from the server. The server receives the request transmitted in step S1 from each main unit 2 and performs matching. If matching is established, the server transmits an instruction to start a series of games to each main unit 2. Note that a main unit 2 corresponding to any one of the matched players may be set as the host terminal.

[0131] If it is not determined that a series of games should be started (step S4: NO), the processor executes the process of step S3 again. The process of step S3 is executed repeatedly at predetermined frame time intervals (for example, 1 / 60 second intervals). As a result, before the series of games starts, a game is executed in which the player object runs freely on the field.

[0132] On the other hand, if it is determined that a series of games is to be started (step S4: YES), the processor executes a voting process (step S5). The voting process will be described in detail later.

[0133] After the voting process in step S5, processor 21 executes a racing game process (step S6). Here, a racing game is played using the course determined in the voting process. The racing game process will be described in detail later.

[0134] When the racing game processing ends, processor 21 determines whether or not to end the series of games (step S7). For example, processor 21 determines whether or not an instruction to end the series of games has been given by the player. Note that the series of games may end when the racing game processing has been performed a predetermined number of times.

[0135] If it is determined that the series of games should not be ended (step S7: NO), processor 21 executes the process of step S5 again.

[0136] On the other hand, if it is determined that the series of games is to end (step S7: YES), processor 21 ends the main processing shown in FIG.

[0137] When a series of games is played in offline multi-play mode using multiple main units 2, the processing of steps S1 to S4 may be omitted and the process may start from step S5. The same applies when a series of games is played in single-play mode.

[0138] (Voting process) Next, the voting process for voting on the next course described above will be explained. Fig. 12 is a flowchart showing an example of the voting process in step S5. The voting process shown in Fig. 12 is a process for generating the voting screen described above and determining the course to be used in the next racing game. The process shown in Fig. 12 is executed after the racing game process for the previous racing game (Fig. 14, which will be described later) has ended. The process shown in Fig. 12 is also executed before the racing game process for the first racing game in a series of games is started.

[0139] In this embodiment, the processor 21 of the main unit 2 executes the game program using a memory (e.g., DRAM 27) to perform the processing of each step shown in FIG. 12. Note that the processor 21 of the main unit 2 may execute some of the processing of each step, and another processor (e.g., a dedicated circuit) provided in the main unit 2 may execute other processing. Also, some of the processing of each step shown in FIG. 12 may be performed on a server on the Internet. Also, the processing of each step is merely an example, and the processing order of each step may be reversed, or another process may be performed in addition to (or instead of) the processing of each step, as long as similar results are obtained.

[0140] As shown in FIG. 12, processor 21 first sets a starting area (step S11). Here, for example, when the previous racing game using a first type of course with a first base area as the finish point has ended, processor 21 sets the first base area as the starting area. Also, for example, when the previous racing game using a second type of course that makes multiple laps around the first base area has ended, processor 21 sets the first base area as the starting area. Also, when processor 21 is set as the host terminal, before the first racing game in the series of games is started, processor 21 sets the base area closest to the position of the player object corresponding to the player device as the starting area. Also, the host terminal transmits starting area information regarding the set starting area to other main device 2 via the server. When processor 21 is not set as the host terminal, before the first racing game in the series of games is started, processor 21 receives starting area information and sets the starting area based on the information. As a result, each player object is placed in the same base area. The server may set the base area that is closest to the position of the player object corresponding to the host terminal as the starting area, and transmit starting area information to multiple main devices 2.

[0141] Next, processor 21 performs a first candidate extraction process (step S12). Here, base areas connected from the starting point area by inter-base route R are extracted as first-type candidates. Specifically, processor 21 determines the number of first-type candidates to be extracted in the first candidate extraction process by random lottery. The maximum number to be determined is "3." Processor 21 determines whether or not the icon ICY was displayed on the previous voting screen based on the previous extraction data, and if the icon ICY was displayed on the previous voting screen, determines the number of first-type candidates to be extracted in the first candidate extraction process to be "3." Furthermore, if the course used in the previous racing game was not a second-type course (i.e., if it was a first-type course), the maximum number of first-type candidates extracted in the first candidate extraction process will be "2" with a certain probability. Next, processor 21 refers to the history data and, among the base areas connected from the starting point area by inter-base route R, excludes the base areas used in a predetermined number of recent races, and extracts a determined number of base areas from the remaining base areas by random lottery. Information about the base areas extracted here is saved as candidate data.

[0142] Next, processor 21 performs a second candidate extraction process (step S13). Here, base areas that are relatively far away from the origin area and are not connected by inter-base route R are extracted as second-type candidates. Details of the second candidate extraction process will be described below. Figure 13 is a flowchart showing an example of the second candidate extraction process in step S13.

[0143] As shown in FIG. 13, processor 21 calculates an evaluation value based on Equation 1 for any base area set on the field (step S21). Specifically, processor 21 first calculates an evaluation value based on vector "u n Then, processor 21 calculates an evaluation value for one base area set on the field using Equation 1. Note that base areas that have been used in a predetermined number of recent races are excluded from the calculation of the evaluation value.

[0144] Next, processor 21 determines whether or not evaluation values ​​have been calculated for all base areas that are the subject of calculation (step S22). Specifically, processor 21 determines whether or not evaluation values ​​have been calculated for all base areas set on the field, excluding base areas that have been used in a predetermined number of recent races. If evaluation values ​​have been calculated for all base areas that are the subject of calculation (step S22: YES), processor 21 then performs the process of step S23. If evaluation values ​​have not been calculated for all base areas that are the subject of calculation (step S22: NO), processor 21 performs the process of step S21 again to calculate evaluation values ​​for base areas that have not yet been calculated.

[0145] Next, in step S23, processor 21 extracts one base area as a second type candidate based on the calculated evaluation value of each base area. For example, processor 21 randomly selects one of the top four base areas with the highest evaluations (specifically, the four base areas with the smallest calculated evaluation values). Specifically, processor 21 performs a lottery so that the higher the evaluation (the smaller the evaluation value) of the base area, the higher the probability of it being selected. Information about the base area extracted here is saved as candidate data.

[0146] When the process of step S23 is executed, the processor 21 ends the process shown in FIG. 13 and returns the process to FIG.

[0147] 12, processor 21 determines whether or not four candidates have been extracted (step S14). If four candidates have not been extracted (step S14: NO), processor 21 performs the process of step S13 again.

[0148] If four candidates have been extracted (step S14: YES), processor 21 displays a voting screen including the four candidates (step S15). For example, if one base area is extracted in the second candidate extraction process, processor 21 displays a voting screen including an icon ICP indicating a player object, three icons ICX specifying the three base areas extracted in the first candidate extraction process, and an icon ICZ that does not specify the one base area extracted in the second candidate extraction process (FIG. 5). Also, for example, if two base areas are extracted in the second candidate extraction process, processor 21 displays a voting screen including an icon ICP indicating a player object, two icons ICX specifying the two base areas extracted in the first candidate extraction process, one icon ICY specifying one of the two base areas extracted in the second candidate extraction process, and an icon ICZ that does not specify the other of the two base areas extracted in the second candidate extraction process (FIG. 7).

[0149] Next, processor 21 accepts votes from players (step S16). Here, processor 21 determines, based on operation data from the controller, whether or not any of the multiple candidates (icons) has been selected by the player. Note that after the player has voted for any candidate, processor 21 skips the processing of step S16.

[0150] Next, processor 21 transmits and receives the voting results (step S17). Specifically, when a player casts a vote in step S16, processor 21 transmits the voting results to a server on the Internet. Processor 21 also receives the voting results of other players from other main units 2 via the server.

[0151] Next, processor 21 displays the progress of the voting (step S18). Here, whether or not each player has cast a vote and which candidate each player has voted for are displayed in real time. Note that which candidate other players have voted for may be specifically displayed, or only whether or not other players have voted may be displayed without specifically displaying which candidate other players have voted for.

[0152] Next, processor 21 determines whether or not all players have cast their votes (step S19).

[0153] If all players have not voted (step S19: NO), processor 21 executes the process of step S16 again. Note that if a predetermined period of time has elapsed since the voting screen was displayed, processor 21 may determine YES in step S19.

[0154] If all players have voted (step S19: YES), processor 21 determines the course to be used in the next racing game (step S20). For example, one of the multiple main units 2 (e.g., the host terminal) playing the game in online multiplay mode may determine one of the four candidates as the course to be used in the next racing game based on the voting results of each player. Alternatively, the server may determine one of the four candidates as the course to be used in the next racing game based on the voting results of each player. The host terminal or server transmits information indicating the determined course to each main unit 2. Then, in step S20, processor 21 of each main unit 2 may set (determine) the course to be used in the next racing game based on the information received from the host terminal or server.

[0155] After performing the process of step S20, processor 21 ends the process shown in Fig. 12. Information on the four candidates extracted in the current voting process is stored as previous candidate data.

[0156] When the voting process shown in Fig. 12 is performed, the racing game process shown in Fig. 14 is then performed. Fig. 14 is a flowchart showing an example of the racing game process in step S6.

[0157] (Racing game processing) Processor 21 first performs a setting process for starting a racing game (step S31). Here, processor 21 sets the determined course on a field and places each player object at a starting point of the set course. Then, processor 21 starts a racing game using the set course.

[0158] When the racing game starts, processor 21 acquires operation data (step S32). Specifically, processor 21 acquires operation data from controllers 3 and 4. Thereafter, processor 21 repeatedly executes the processes of steps S32 to S36 at predetermined frame time intervals (for example, 1 / 60 second intervals).

[0159] Next, processor 21 executes a player object control process (step S33). Here, processor 21 updates information related to the player object based on the operation data. For example, processor 21 updates the position, posture, speed, etc. of the player object, and causes the player object to perform a predetermined action. Processor 21 also updates the position of the virtual camera in response to the update of the position of the player object. Processor 21 also transmits the updated information related to the player object to another main unit 2 (either via a server or not).

[0160] Next, processor 21 executes other object control processing (step S34). Here, processing is performed on other objects corresponding to other players who play the racing game together with the player object. Specifically, processor 21 receives information on the multiple other objects from multiple other main units 2 (either via a server or not), and updates the position, posture, speed, etc. of each of the multiple other objects based on the received information. Furthermore, processor 21 causes each of the multiple other objects to perform a predetermined action based on the received information.

[0161] Next, processor 21 performs a drawing process (step S35). In the drawing process, processor 21 generates a game image based on a virtual camera corresponding to the player object, and outputs the generated game image to display 12 or an external display device.

[0162] Next, processor 21 determines whether or not the goal has been reached (step S36). Specifically, processor 21 determines whether or not all moving objects, including the player object and other objects, have reached the goal point set on the course. If all moving objects have not reached the goal (step S36: NO), processor 21 executes the process of step S32 again.

[0163] If all the moving objects have reached the goal (step S36: YES), processor 21 displays the results of the current racing game (step S37) and saves information about the course used in the current racing game as history data (step S38). The history data saved here is used when generating course candidates for the next and subsequent racing games. Then, processor 21 ends the racing game processing for the current racing game.

[0164] As described above, in the game of this embodiment, multiple base areas are set on the field, and an intra-base route CA is set in each base area. In addition, an inter-base route R connecting each base area is set on the field. A first type of course is set that runs from one base area to another base area via the inter-base route R, and a racing game can be played on that course with multiple moving objects. In addition, a second type of course is set that runs multiple laps around the intra-base route, and a racing game can be played on that course with multiple moving objects.

[0165] In this embodiment, after the previous racing game ends, a voting screen presents to the player a plurality of candidates for the next racing game course, including a first type of candidate corresponding to a first type of course and a second type of candidate corresponding to a second type of course. Specifically, the first type of candidates are presented as candidates for courses that start from a base area where the finish point of the previous racing game course was set, and that reach another base area via an inter-base route from the starting area. Furthermore, the second type of candidates are presented as candidates for courses that include an intra-base route in a base area different from the starting area. This allows the player to play a racing game presented with a variety of candidate courses, and also allows the player to play a racing game using a large field.

[0166] Additionally, as second-type candidates, base areas that are located in a direction different from the direction from the starting point area to the first-type candidates are presented. Additionally, as second-type candidates, base areas that are neither too close nor too far from the starting point area are presented. This makes it possible to present base areas in different locations on the field, allowing the player to play the racing game using various locations on the field.

[0167] In this embodiment, when generating the second type of candidates, an evaluation is performed based on a condition related to direction and a condition related to distance, and one of the candidates with the highest evaluation is randomly selected. This allows the player to play the racing game in various locations on the field without bias.

[0168] As described above, in this embodiment, after the end of the previous racing game on a course whose finish point is set in a first base area (for example, base area A5), multiple course candidates are generated and presented to the player as candidates for the next racing game, including first type candidates (IC2, IC4 in Figure 7) corresponding to a first type of course including an inter-base route R from the first base area to another second base area (for example, base areas A2, A4), and second type candidates (ICX, IC7 in Figure 7) corresponding to a second type of course including an intra-base route in a third base area different from the first base area.

[0169] This allows the player to select a course from the first base area to the second base area connected by the base route R, giving the player the feeling of moving continuously across a wide field. Also, by presenting a third base area different from the first base area as a second type candidate, the player can move to a third base area far from the first base area, for example, to play a racing game, making use of the wide field. Also, a variety of courses can be set for the next racing game.

[0170] The first type of candidates may be a plurality of course candidates including inter-base routes from a first base area to each of a plurality of second base areas, allowing the player to select one from the plurality of first type candidates and to continuously move the player object on the field along various routes.

[0171] The first type of course may be a course in which an inter-base route connecting a first base area and a second base area is followed by an intra-base route in the second base area, and the second type of course may be a course in which the intra-base route in a third base area is circled multiple times. This allows the player to make the player object travel along the intra-base route regardless of which type of candidate the player selects.

[0172] Furthermore, the third base area is set from among a plurality of base areas on the field based on a first condition (for example, the first term in formula 1) related to the direction on the field from the first base area and a second condition (for example, the second term in formula 1) related to the distance from the first base area. Specifically, for a plurality of base areas on the field, an evaluation is calculated that increases the further the direction on the field from the first base area is from the direction from the first base area to the second base area, and that increases the closer the distance from the first base area is to a predetermined distance, and the third base area is set from the base area with the highest evaluation.

[0173] This allows a base area that is in a direction different from the direction from the first base area to the second base area to be presented as the third base area. Also, a base area that is a predetermined distance from the first base area can be presented as the third base area. This prevents the racing game from being played in a biased position on the field, and allows the player object to move over a wide area on the field.

[0174] Furthermore, the second base area and the third base area are set from among a plurality of base areas on the field other than the base areas that the player object has reached or passed through in a predetermined number of most recent racing games, thereby preventing a racing game from being played using the same base area as the base area that the player object passed through or reached in the most recent race.

[0175] Furthermore, a candidate presentation UI (for example, a voting screen) is displayed that includes information specifying the base area for the first type of candidate (for example, icon ICX) and information not specifying the base area for the second type of candidate (for example, icon ICZ). This allows the player to select a candidate that indicates the desired base area. Furthermore, the player can move the player object away from the current base area to a base area with an unknown destination, and play the racing game.

[0176] In addition, as a candidate course for the next race, the starting point is set in a fourth base area (for example, base area A7) different from the first base area, and a third type of candidate corresponding to a third type of course including an intra-base route in the fourth base area is generated, and a candidate presentation UI (Figure 7) is displayed that further includes information identifying the fourth base area for the third type candidate (for example, icon ICY).

[0177] This allows the player to move the player object away from the base area where the player is currently located to a base area where the destination is known, and play the racing game. Also, even if the predetermined number of first type candidates cannot be presented, the remaining number can be presented as third type candidates.

[0178] In addition, in this embodiment, before the start of a race, the control object is run on a field, and before the start of the first race, multiple course candidates are generated as candidates for the course of the first race, including at least a first type of candidate corresponding to a first type of course in which the starting point is set in a fifth base area among the base areas that is closest to the position of the control object, and which includes an inter-base route from the fifth base area to another sixth base area, and a second type of candidate corresponding to a second type of course in which the starting point is set in a seventh base area different from the fifth base area, and which includes an intra-base route in the seventh base area.

[0179] This allows the player to select either the first type of candidate or the second type of candidate for the first race as well.

[0180] In this embodiment, the course for the next race can be determined to be the course corresponding to the candidate selected based on the operation input, thereby allowing the candidate selected by the player to be the course for the next race.

[0181] In this embodiment, a racing game is played by multiple players based on communication, and the course of the next race is determined to be one of the candidates selected by each of the multiple players. This allows the course of the next race to be determined by selection by the multiple players in a racing game played by multiple players.

[0182] (Variation) Although the present embodiment has been described above, the above embodiment is merely an example, and the following modifications may be made, for example.

[0183] For example, in the above embodiment, the first type of course is a course that travels from a first base area via the inter-base route R, enters a second base area, and makes one lap around the intra-base route in the second base area. The first type of course may be any course that includes the inter-base route R between the first base area and the second base area. For example, the first type of course may be a course that travels around the first base area a predetermined number of times (or without traveling around), travels along the inter-base route R, enters a second base area, and reaches a goal point set in the second base area without traveling around the second base area. Alternatively, the first type of course may be a course that travels around the first base area a predetermined number of times (or without traveling around), travels along the inter-base route R, enters a second base area, travels around the second base area a predetermined number of times (or without traveling around), travels along another inter-base route R, enters another base area, and reaches the goal. Such candidates for the first type of course may be presented to the player on the voting screen.

[0184] In the above embodiment, the second type of course is a course that involves multiple laps around an intra-base route set in a base area and reaching a goal point set on the intra-base route. The second type of course may also be a course that involves multiple laps around an intra-base route set in a base area and then reaching another base area via an inter-base route R. Candidates for such second type of course may be presented to the player on the voting screen.

[0185] In the above embodiment, a course that involves multiple laps around a base route in a third base area that is located some distance away from the first base area where the player object is located is presented as a candidate for the second type of course. The third base area may be a base area that is relatively close to the first base area, or may be a base area that is far from the first base area, as long as it is a base area different from the first base area.

[0186] In the above embodiment, multiple base areas are evaluated using Formula 1, and highly evaluated second type candidates are extracted. In other embodiments, multiple base areas may be evaluated using a formula different from Formula 1.

[0187] In the above embodiment, one "recommended course" is always displayed on the voting screen. In other embodiments, the "recommended course" may not be displayed, or multiple "recommended courses" may be displayed.

[0188] In the above embodiment, the "automatic course" is displayed on the voting screen in a manner that prevents the player from specifying the base area. In other embodiments, the "automatic course" may be displayed in a manner that allows the player to specify the base area.

[0189] In the above embodiment, the voting screen (candidate presentation UI) is displayed to each of the multiple players, and each of the multiple players votes for the course candidates presented on the voting screen. The candidate presentation UI (user interface) may also be displayed when the racing game is played in single-play mode. In this case, a player selects one of the multiple candidates presented in the candidate presentation UI, and the selected candidate is determined as the course for the next race. Also, even when the racing game is played in multi-play mode, the candidate presentation UI may be displayed on the screen of one player, and the single player, representing the multiple players, may select one of the multiple candidates presented in the candidate presentation UI, and the selected candidate may be determined as the course for the next race.

[0190] The above-described processing may be executed not only by the main device 2 but also by any other information processing device such as a smartphone or a tablet terminal. The above-described processing may also be executed in an information processing system including multiple devices connected via a network (for example, a LAN, the Internet, etc.).

[0191] For example, in the above embodiment, the main unit 2 executes the processing shown in Fig. 12, but at least a part of the processing shown in Fig. 12 may be executed by a server. For example, the first candidate extraction processing and the second candidate extraction processing may be executed by a server. Furthermore, the server may collect voting results of multiple players from multiple main units 2 and determine the course for the next racing game based on the voting results. An information processing system including multiple main units 2 and a server may execute each of the processing shown in Figs. 12 to 14.

[0192] Furthermore, the configurations according to the above-described embodiments and their modifications can be combined in any manner as long as they are not inconsistent with each other. Furthermore, the above is merely an example of the present invention, and various other improvements and modifications may be made thereto. [Explanation of symbols]

[0193] 1. Game System 21 processors Base Area A CA base route R Route between bases

Claims

1. The computer of the information processing device Based on the operation input, a control object is caused to run on a field in a virtual space; A plurality of base areas are set in the field, When an instruction to start a race between the operation object and at least one other moving object is given based on an operation input, a course corresponding to the determined race, the course including at least one of an intra-base route which is a route set within the base area and an inter-base route which is set as a route connecting the base areas, the course having a finish point set within one of the base areas, is set on the field, and the race is started; In the race, the control object and the moving object are caused to run along the set course on the field; After a first race on a course whose finish point is set in a first base area is completed, a plurality of course candidates for a subsequent second race are generated, the candidates including at least a first type of candidate corresponding to a first type of course in which a start point is set in the first base area and which includes an inter-base route from the first base area to another second base area, and a second type of candidate corresponding to a second type of course in which a start point is set in a third base area different from the first base area and which includes an intra-base route in the third base area; selecting one of the plurality of candidate courses based on an operation input, and determining the course of the second race based on the selection; and setting the determined course on the field and starting the second race.

2. The game program according to claim 1 , wherein the first type of course is a plurality of courses including the inter-base routes from the first base area to each of the plurality of second base areas.

3. the first type of course is a course in which the inter-base route from the first base area to the second base area is set followed by the intra-base route in the second base area, The game program according to claim 1 , wherein the second type of course is a course that circumnavigates the base route in the third base area a plurality of times.

4. 2. The game program according to claim 1, wherein the third base area is set from among a plurality of base areas on the field based on a first condition related to a direction on the field from the first base area.

5. The game program according to claim 1 , wherein the third base area is set from among the base areas on the field based on a second condition related to a distance from the first base area.

6. 2. The game program according to claim 1, wherein the third base area is set from among the plurality of base areas on the field starting from the base area with the highest evaluation based on an evaluation that increases the farther a direction on the field from the first base area is from a direction from the first base area to the second base area, and that increases the closer the distance from the first base area is to a predetermined distance.

7. 2. The game program according to claim 1, wherein the second base area and the third base area are set from among the base areas on the field other than the base areas that have been reached or passed through in a predetermined number of most recent races.

8. The computer further comprises: After the first race is completed, Information specifying the second base area for the first type candidate; The game program according to claim 1 , further comprising displaying a candidate presentation UI including, for the second type of candidate, information that does not specify the third base area.

9. The computer further comprises: a starting point is set in a fourth base area different from the first base area as a candidate course for the second race, and a third type of candidate is generated that corresponds to a third type of course including an intra-base route in the fourth base area; The game program according to claim 8 , wherein the candidate presentation UI for the third type of candidate further includes information specifying the fourth base area.

10. The computer further comprises: before the start of the race, causing the control object to run on the field; 8. The game program of claim 1, wherein before the start of a third race, which is the first race, a plurality of course candidates for the third race are generated, including at least a first type candidate having a starting point set in a fifth base area among the base areas that is closest to the position of the control object, and corresponding to the first type of course including the inter-base route from the fifth base area to another sixth base area, and a second type candidate having a starting point set in a seventh base area different from the fifth base area, and corresponding to the second type of course including an intra-base route in the seventh base area.

11. The computer, 8. The game program according to claim 1, wherein the course of the second race is determined to be a course corresponding to the candidate selected based on an operational input.

12. The computer, A race is conducted by multiple players based on communication; 8. The game program according to claim 1, wherein the course of the second race is determined by one of candidates selected by each player.

13. An information processing system comprising at least one processor, the processor comprising: Based on the operation input, a control object is caused to run on a field in a virtual space; A plurality of base areas are set in the field, When an instruction to start a race between the operation object and at least one other moving object is given based on an operation input, a course corresponding to the determined race, the course including at least one of an intra-base route which is a route set within the base area and an inter-base route which is set as a route connecting the base areas, the course having a finish point set within one of the base areas, is set on the field, and the race is started; In the race, the control object and the moving object are caused to run along the set course on the field; After a first race on a course whose finish point is set in a first base area is completed, a plurality of course candidates for a subsequent second race are generated, including at least a first type of candidate corresponding to a first type of course in which the start point is set in the first base area and includes an inter-base route from the first base area to another second base area, and a second type of candidate corresponding to a second type of course in which the start point is set in a third base area different from the first base area and includes an intra-base route in the third base area; selecting one of the plurality of candidate courses based on an operation input, and determining the course of the second race based on the selection; An information processing system that sets the determined course on the field and starts the second race.

14. The information processing system according to claim 13 , wherein the first type of course is a plurality of courses including the inter-base route from the first base area to each of the plurality of second base areas.

15. the first type of course is a course in which the inter-base route from the first base area to the second base area is set followed by the intra-base route in the second base area, The information processing system according to claim 13 , wherein the second type of course is a course that circumnavigates the intra-base route in the third base area a plurality of times.

16. 14. The information processing system according to claim 13, wherein the third base area is set from among the plurality of base areas on the field based on a first condition related to a direction on the field from the first base area.

17. The information processing system according to claim 13 , wherein the third base area is set from among the base areas on the field based on a second condition related to a distance from the first base area.

18. 14. The information processing system according to claim 13, wherein the third base area is set from among the plurality of base areas on the field starting from the base area with the highest evaluation based on an evaluation that increases the farther a direction on the field from the first base area is from a direction from the first base area to the second base area, and that increases the closer the distance from the first base area is to a predetermined distance.

19. 14. The information processing system according to claim 13, wherein the second base area and the third base area are set from among the base areas on the field other than the base areas that have been reached or passed through in a predetermined number of most recent races.

20. The processor further comprises: After the first race is completed, Information specifying the second base area for the first type candidate; The information processing system according to claim 13 , further comprising: a candidate presentation UI for the second type of candidate that includes at least information that does not specify the third base area;

21. The processor further comprises: a starting point is set in a fourth base area different from the first base area as a candidate course for the second race, and a third type of candidate is generated that corresponds to a third type of course including an intra-base route in the fourth base area; The information processing system according to claim 20 , wherein the candidate presentation UI further includes information specifying the fourth base area for the third type of candidate, and the candidate presentation UI further includes information specifying the fourth base area for the third type of candidate.

22. The processor further comprises: before the start of the race, causing the control object to run on the field; 20. The information processing system of claim 13, wherein before a first race starts, a plurality of course candidates for the first race are generated, the candidate courses including at least a first type candidate in which a starting point is set in a fifth base area among the base areas that is closest to the position of the operation object, and which corresponds to the first type of course including the inter-base route from the fifth base area to another sixth base area, and a second type candidate in which a starting point is set in a seventh base area different from the fifth base area, and which corresponds to the second type of course including an intra-base route in the seventh base area.

23. The processor:

20. The information processing system according to claim 13, wherein the course of the second race is determined to be the course corresponding to the candidate selected based on an operational input.

24. The processor: A race is conducted by multiple players based on communication; 20. The information processing system according to claim 13, wherein the course of the second race is determined to be one of the candidates selected by each player.

25. An information processing method for playing a racing game, running an operation object on a field in a virtual space based on an operation input; A plurality of base areas are set in the field, When an instruction to start a race between the operation object and at least one other moving object is given based on an operation input, setting a course on the field that corresponds to the determined race, the course including at least one of an intra-base route that is a route set within the base area and an inter-base route that is set as a route connecting the base areas, with a finish point set within one of the base areas, and starting the race; running the control object and the mobile object along the set course on the field in the race; After a first race on a course whose finish point is set in a first base area is completed, a plurality of course candidates for a subsequent second race are generated, including at least a first type of candidate corresponding to a first type of course in which a start point is set in the first base area and which includes an inter-base route from the first base area to another second base area, and a second type of candidate corresponding to a second type of course in which a start point is set in a third base area different from the first base area and which includes an intra-base route in the third base area; selecting one of the plurality of candidate courses based on an operation input, and determining the course of the second race based on the selection; setting the determined course on the field and starting the second race.

26. The information processing method according to claim 25 , wherein the first type of course is a plurality of courses including the inter-base route from the first base area to each of the plurality of second base areas.

27. the first type of course is a course in which the inter-base route from the first base area to the second base area is set followed by the intra-base route in the second base area, The information processing method according to claim 25 , wherein the second type of course is a course that circumnavigates the intra-base route in the third base area a plurality of times.

28. 26. The information processing method according to claim 25, wherein the third base area is set from among the plurality of base areas on the field based on a first condition related to a direction on the field from the first base area.

29. 26. The information processing method according to claim 25, wherein the third base area is set from among the base areas on the field based on a second condition related to a distance from the first base area.

30. 26. The information processing method according to claim 25, wherein the third base area is set from among the plurality of base areas on the field starting from the base area with the highest evaluation based on an evaluation that increases the farther a direction on the field from the first base area is from a direction from the first base area to the second base area, and that increases the closer the distance from the first base area is to a predetermined distance.

31. 26. The information processing method according to claim 25, wherein the second base area and the third base area are set from among the base areas on the field other than the base areas that have been reached or passed through in a predetermined number of most recent races.

32. After the first race is completed, Information specifying the second base area for the first type candidate; 32. The information processing method according to claim 25, further comprising: displaying, on a display device, a candidate presentation UI including at least information that does not specify the third base area for the second type of candidate.

33. generating a third type of candidate course for the second race, the candidate course corresponding to a third type of course including a route within a base in a fourth base area different from the first base area, and the fourth type of candidate course including a route within the base in the fourth base area; The information processing method according to claim 32 , further comprising: displaying, on a display device, the candidate presentation UI for the third type of candidate, the candidate presentation UI further including information specifying the fourth base area.

34. causing the control object to run on the field before the start of the race; 32. The information processing method of claim 25, further comprising generating, before a first race starts, a plurality of course candidates for the first race, including at least a first type candidate in which a starting point is set in a fifth base area among the base areas that is closest to a position of the operation object, and corresponding to the first type of course that includes the inter-base route from the fifth base area to a sixth base area, and a second type candidate in which a starting point is set in a seventh base area different from the fifth base area, and corresponding to the second type of course that includes an intra-base route in the seventh base area.

35. 32. The information processing method according to claim 25, further comprising determining, as the course of the second race, a course corresponding to the candidate selected based on an operational input.

36. Conducting a race between multiple players based on communication; 32. The information processing method according to claim 25, further comprising determining the course of the second race to be one of the candidates selected by each player.

37. An information processing device comprising at least one processor, the processor comprising: Based on the operation input, a control object is caused to run on a field in a virtual space; A plurality of base areas are set in the field, When an instruction to start a race between the operation object and at least one other moving object is given based on an operation input, a course corresponding to the determined race, the course including at least one of an intra-base route which is a route set within the base area and an inter-base route which is set as a route connecting the base areas, the course having a finish point set within one of the base areas, is set on the field, and the race is started; In the race, the control object and the moving object are caused to run along the set course on the field; After a first race on a course whose finish point is set in a first base area is completed, a plurality of course candidates for a subsequent second race are generated, including at least a first type of candidate corresponding to a first type of course in which the start point is set in the first base area and includes an inter-base route from the first base area to another second base area, and a second type of candidate corresponding to a second type of course in which the start point is set in a third base area different from the first base area and includes an intra-base route in the third base area; selecting one of the plurality of candidate courses based on an operation input, and determining the course of the second race based on the selection; an information processing device that sets the determined course on the field and starts the second race;

Images