JP5406394B1 - Information processing apparatus and game program - Google Patents

Abstract

An object of the present invention is to provide a fair game without giving a player a sense of incongruity.
An information processing apparatus for controlling a game in which a plurality of teams compete for occupation of a unit area in a game field having a plurality of unit areas, and determining an occupied team for determining a team that occupies the unit area A point granting unit that gives points determined in the unit area to a team that occupies the unit area, a storage unit that stores the earned points for each team, and a score obtained for each team And the comparison unit and the unit area at a position where a team with a small number of acquisition points is more likely to occupy than a team with a large number of acquisition points among the plurality of unit areas according to the compared acquisition points for each team. A special area setting unit for setting a special area to which special points are given.
[Selection] Figure 12

Description

  The present invention relates to an information processing apparatus and a game program.

  In a game in which player characters battle each other, a game in which a third character (NPC) other than the player character appears in a virtual game space and the battle situation is adjusted is known. (For example, patent document 1).

JP2011-056129A

  When adjusting the battle situation in such a game, if the involvement of the NPC directly in the game is increased, it may easily give the player a sense of incongruity that it is controlled by the computer, and the player's interest in the game may be impaired. was there. For example, if the victory or defeat of a match is determined by NPC intervention, the defeated player may feel unfair and may lose the willingness to continue playing the game.

  The present invention has been made in view of such circumstances, and the purpose of the present invention is to provide an impartial feeling without giving the player a sense of incongruity by indirectly interfering with the player's battle situation. The purpose is to provide a sex game.

The main invention of the present invention to solve the above problems is
It has a plurality of unit areas in the game field to have a path between the two unit areas of the plurality of unit areas, to control the game to compete the occupation of the unit area between three or more teams An information processing apparatus, an occupancy team determination unit that determines a team that occupies the unit area, a point grant unit that grants points determined in the unit area to the team that occupies the unit area, A storage unit that stores acquisition points for each team, a comparison unit that compares acquisition points for each team, and a unit area that is occupied by a team in which acquisition points are dominant among the plurality of unit areas , special area where the other two or more teams to the unit area at the advanced position easily via the path, to set up a special area to impart special point Comprising a tough, and it is an information processing apparatus according to claim.
Other features of the present invention will become apparent from the description of the present specification and the accompanying drawings.

  According to the present invention, it is possible to provide a fair game without causing the player to feel uncomfortable.

It is a figure which shows an example of the whole structure of the game system 1 which concerns on this embodiment. It is a block diagram which shows the functional structure of the server apparatus 10 which concerns on this embodiment. It is a block diagram which shows the functional structure of the player terminal 20 which concerns on this embodiment. 3 is a diagram illustrating an example of a data structure of player information stored in a data storage unit 12 of the server device 10. FIG. 3 is a diagram illustrating an example of a data structure of team information stored in a data storage unit 12 of the server device 10. FIG. 3 is a diagram illustrating an example of a data structure of map information stored in a data storage unit 12 of the server device 10. FIG. It is a figure which shows an example of the map screen actually displayed on the terminal display part. 8A to 8C are diagrams illustrating a flow when a battle occurs. It is a figure which shows an example of the map screen in the state which the game progressed to some extent. It is a figure explaining occupation team determination operation. It is a flowchart of the occupation team determination process performed by the occupation team determination part 111. It is a flowchart explaining a special area setting operation | movement. It is a figure which shows the modification of a map screen.

At least the following matters will become apparent from the description of the present specification and the accompanying drawings.
An information processing apparatus that controls a game in which a plurality of teams compete for occupation of the unit area in a game field having a plurality of unit areas, the occupation team determination unit that determines a team that occupies the unit area, A point granting unit for granting points determined in the unit area to a team occupying the unit area, a storage unit for storing the acquired points for each team, and a comparing unit for comparing the acquired points for each team; Depending on the obtained points for each team, a special point is placed in the unit area at a position that is more likely to be occupied by a team having a smaller number of acquired points than a team having a larger number of acquired points among the plurality of unit areas. An information processing apparatus comprising: a special area setting unit that sets a special area to be assigned.
According to such an information processing apparatus, it is possible to provide a fair game without causing the player to feel uncomfortable.

Further, in this information processing apparatus, the game field has a path between two unit areas among the plurality of unit areas, and the number of unit areas in the game field is the number of teams. The number of paths forming the shortest route connecting the unit area occupied by one team at the start of the game and the unit area occupied by another team at the start of the game may be equal. Good.
According to such an information processing apparatus, the game can be made fair by making the conditions of each team the same at the start of the game.

Further, in this information processing apparatus, the number of teams is three or more, a target area is set in any one of the plurality of unit areas, and each of the teams at the start of the game The number of the paths forming the shortest route connecting the unit area to be occupied and the target area may be equal, and the point determined in the target area may be larger than the points determined in the other unit areas.
According to such an information processing apparatus, it is possible to make the game development more thrilling by giving all teams a chance to occupy equally the target area where many points can be obtained. In particular, by competing for the occupation of the unit area by three or more teams, the game becomes more strategic.

In the information processing apparatus, the game field may include a plurality of routes connecting the unit area occupied by a certain team at the start of the game and the unit area occupied by another team at the start of the game. It is good also as the path | pass which passes in common is set.
According to such an information processing apparatus, when performing a battle with another team in the base area occupied at the start of the game, it is possible to concentrate the power on a one-on-one battle, so it is easy to defend the base area. Become.

Further, in this information processing apparatus, the special area setting unit may determine that a team with a small number of acquisition points is a player of the game as a difference in acquisition points between a team with a large number of acquisition points and a team with a small number of acquisition points is large. The special area may be set so that the number of the paths forming the shortest route connecting the unit area occupied at the start and the special area is reduced.
According to such an information processing apparatus, a team with few acquisition points can easily obtain a chance of reversal. Therefore, it is possible to suppress the game from becoming monotonous due to a large difference in the earned points between the teams.

  A game program for causing an information processing apparatus to execute a game for competing between a plurality of teams to occupy the unit area in a game field having a plurality of unit areas, and a process for determining a team that occupies the unit area; , A process of assigning points determined in the unit area to the team occupying the unit area, a process of storing the acquired points for each team, and a process of comparing the acquired points of each team, In accordance with the acquired points for each team, a special point is given to the unit area at a position that is easily occupied by a team with a small number of acquired points than a team with a large number of acquired points among the plurality of unit areas. And a game program for causing the information processing apparatus to execute processing for setting an area. .

=== Embodiment ===
<< About the configuration of the game system 1 >>
FIG. 1 is a diagram illustrating an example of the overall configuration of a game system 1 according to the present embodiment.

  The game system 1 provides various services related to games (such as social games) to a user (hereinafter also referred to as “player”) via the network 2. The game system 1 includes a server device 10 and a plurality of player terminals 20 that are communicably connected to the network 2.

  A player can play a game transmitted via the network 2 by accessing the game system 1 from the player terminal 20. Further, the player can communicate with a plurality of other players by accessing the game system 1.

<Server device 10>
FIG. 2 is a block diagram illustrating a functional configuration of the server apparatus 10. The server device 10 is an information processing device (for example, a workstation or a personal computer) used when a system administrator or the like operates and manages a game service, and receives various commands (requests) from the player terminal 20. A game program operable on the player terminal 20 or a Web page created in a markup language (HTML or the like) that conforms to the standard of the player terminal 20 can be distributed. The server device 10 according to this embodiment includes a control unit 11, a data storage unit 12, an input unit 13, a display unit 14, and a communication unit 15.

  The control unit 11 exchanges data between the units and controls the entire server device 10. The control unit 11 includes an occupied team determination unit 111, a point grant unit 112, a comparison unit 113, a special area setting unit 114, and a screen generation unit 115. Specific operations of each part will be described later.

  The data storage unit 12 includes a ROM (Read Only Memory) that is a read-only storage area in which system programs are stored, and a RAM (Random) that is a rewritable storage area that is used as a work area for arithmetic processing by the control unit 11. For example, a non-volatile storage device such as a flash memory or a hard disk. The data storage unit 12 according to the present embodiment includes player information that is information about a player, team information that is information about a team to which the player belongs, and map information that is information about a map screen (game field) displayed when the game is played. Memorize etc. The data structure of each piece of information will be described later.

  The input unit 13 is used by a system administrator or the like to input various data and settings related to the game (for example, special area setting conditions described later), and is realized by, for example, a keyboard or a mouse.

  The display unit 14 is for displaying an operation screen for a system administrator based on a command from the control unit 11 and is realized by, for example, a liquid crystal display (LCD).

  The communication unit 15 is for communicating with the player terminal 20, functions as a receiving unit that receives various data and signals transmitted from the player terminal 20, and various data according to instructions from the control unit 11. And a function as a transmission unit for transmitting a signal to the player terminal 20. The communication unit 15 is realized by, for example, a NIC (Network Interface Card).

<Player terminal 20>
FIG. 3 is a block diagram illustrating a functional configuration of the player terminal 20. The player terminal 20 is an information processing terminal operated by a player (user) when playing a game. The player terminal 20 is, for example, a mobile phone terminal, a smart phone, a personal computer, a game machine, or the like, and transmits and receives information to and from the server device 10 accessible via the network 2. The player terminal 20 according to the present embodiment includes a terminal control unit 21, a terminal storage unit 22, a terminal input unit 23, a terminal display unit 24, and a terminal communication unit 25.

  The terminal control unit 21 exchanges data between each unit and controls the entire player terminal 20, and is realized by a CPU (Central Processing Unit) executing a program stored in a predetermined memory. Is done. Note that the terminal control unit 21 of the present embodiment also functions as a screen display control unit that controls the display mode of the game screen displayed on the terminal display unit 24.

  The terminal storage unit 22 is connected to the terminal control unit 21 via a bus, and performs processing of referring to, reading, and rewriting data stored in response to a command from the terminal control unit 21. The terminal storage unit 22 is realized by, for example, a flash memory or a hard disk.

  The terminal input unit 23 is for a player to perform various operations (game operation, text input operation, etc.), and is realized by an operation button, a touch panel, or the like, for example.

  The terminal display unit 24 is for displaying a game screen (such as a map screen described later) generated based on the game information in response to a command from the terminal control unit 21. For example, a liquid crystal display (LCD: Liquid Crystal) is displayed. Display) or the like.

  The terminal communication unit 25 is for communicating with the server device 10, and functions as a reception unit that receives various data and signals transmitted from the server device 10 and various commands according to commands from the terminal control unit 21. It has a function as a transmission unit that transmits data and signals to the server device 10. The terminal communication unit 25 is realized by, for example, a NIC (Network Interface Card).

<< About data structure >>
As described above, the data storage unit 12 of the server device 10 stores various data such as player information, team information, and map information.

  FIG. 4 is a diagram illustrating an example of a data structure of player information stored in the data storage unit 12 of the server device 10. The player information includes items such as player ID, team belonging, possession card information, deck information, area position information, and the like. The player ID is identification information for identifying the player. The affiliation team is information indicating the team to which the player currently belongs. The owned card information is information indicating a game card (hereinafter also referred to as an owned card) owned by the player. Each game card has a unique parameter, and the parameter is associated with each game card (game card ID) and stored in the data storage unit 12. The deck information is information related to the deck organized by the player. The deck is information indicating the types and arrangement of a plurality of possessed cards, and players battle each other using each other's decks in the case of a battle described later. The area position information is information indicating a location (unit area described later) where the player is currently on the game field (on the map screen) when the game is progressing.

  FIG. 5 is a diagram illustrating an example of a data structure of team information stored in the data storage unit 12 of the server device 10. In this embodiment, a team is composed of one or more players. The team information includes items such as affiliation player, occupied area, acquired points, and the like. The affiliation player is information indicating all players (player IDs) belonging to the team. The occupied area is information indicating an area occupied by the team among unit areas displayed on the map screen. Details of the unit area occupation will be described later. The acquired points are information indicating the total value of points given when the team occupies the unit area, and the game wins or loses by competing with other teams for the size of the acquired points.

  FIG. 6 is a diagram illustrating an example of a data structure of map information stored in the data storage unit 12 of the server device 10. The map information is information representing a “game field” that is an area (area defined on the program) set in the virtual game space, and a game map screen is generated based on the map information. The map information includes items such as unit area ID, unit area point, unit area path connection information, and special area setting information. The unit area ID is information for identifying a plurality of unit areas arranged on the map. The point of the unit area is information indicating the size of the point determined for each unit area. This point is given to a team that occupies the unit area based on a predetermined condition. The unit area path connection information is information indicating a relationship between unit areas connected by a path, which will be described later, and stores a unit area to be connected and a distance from the unit area. The special area setting information is information indicating an area in which a special area, which is an area to which special points are given, is set.

<< Game outline >>
An outline of the game provided by the game system 1 will be described.

  The game provided in this embodiment is a game in which a plurality of teams composed of one or more players compete to occupy a plurality of unit areas displayed on a game field (map screen). Specifically, each team occupies a unit area, and the game is decided based on the amount of points given when the unit area is occupied.

<About the game field (map screen)>
FIG. 7 is a diagram illustrating an example of a map screen actually displayed on the terminal display unit 24 based on the map information. The game field (map screen) of this embodiment has a plurality of unit areas. In the map screen of the figure, 13 unit areas A to M are provided. And a game progresses when a plurality of teams compete for occupation of these unit areas. In the figure, one or more stars are displayed for each unit area. The number of stars displayed is a measure of the size of the points determined in the unit area, and the larger the number of stars displayed, the more points are determined in the unit area. For example, in FIG. 7, since three stars are displayed in the unit area M located at the center of the map screen, the player occupying the unit area M has the largest point by viewing the number of stars displayed. It can be confirmed that it is acquired (granted).

  Each unit area has at least one path. A path corresponds to a “road” that connects two different unit areas, and is a route that connects a certain unit area to another unit area. For example, the unit area A and the unit area B are connected by one path. A player (a character operated by the player) in the unit area A on the map screen can move to the unit area B by passing through a path connecting the unit area A and the unit area B. There is also a unit area having a plurality of paths. For example, the unit area D has four paths and is connected to the unit areas C, H, L, and M, respectively. In this case, the player in the unit area D can move by selecting a desired destination from the unit areas C, L, H, and M.

  In FIG. 7, 13 unit areas and paths provided in them are displayed. However, the unit areas provided on the game field, the number of paths, and the positional relationship are not limited to this example, and there are various game fields. Have various variations.

<Occupation of unit area>
In the present embodiment, points determined in the unit area are awarded to the team that occupies the unit area. Therefore, in order to acquire many points, a plurality of teams compete for occupation of the unit area. Below, the example which competes for occupation of a unit area by three teams (it is assumed to be team A, B, and 丙) is explained.

  Each team occupies one unit area at the start of the game. In FIG. 7, team A occupies unit area A, team B occupies unit area E, and team occupies unit area I. Thus, the unit area occupied by each team at the start of the game is called the “home area” of the team for convenience. Each home area has only one pass.

  When the game is started, players belonging to each team attempt to move from the home area of the team to the next unit area through a pass. For example, Player A 1 belonging to Team A attempts to move from the home area (unit area A) to unit area B through a path connecting unit area A and unit area B. When the player A1 reaches the unit area B, the area position information of the player A1 becomes the unit area B, and the unit area B is occupied by the team A to which the player A1 belongs. Players belonging to the same team can freely move between unit areas occupied by the team. For example, when the team A occupies the unit areas A, B, and C, the player A 2 belonging to the team A can freely move between the unit area A and the unit area C.

  In this way, the player belonging to each team moves to a new unit area, so that the unit area occupied by the team is expanded. In this embodiment, in order to compete for occupation of a unit area by a plurality of teams, the number of unit areas displayed on the map screen is set to be larger than the number of teams.

  Note that the shortest distances between the home area of one team and the home area of another team are all set to be equal. In other words, the number of paths forming the shortest route connecting a unit area occupied by one team at the start of the game and a unit area occupied by another team at the start of the game is set to be equal. For example, in FIG. 7, the shortest distance between the unit area A, which is the home area of Team A, and the unit area E, which is the home area of Team B, is 7 passes. The shortest distance between the team A's home area (unit area A) and the team's home area (unit area I) is also 7 passes. In addition, the shortest distance between the team B's home area (unit area E) and the team's home area (unit area I) is also 7 passes. That is, the geographical conditions regarding the game field are the same for each team. Thus, the game can be made fair by making the conditions of each team the same at the start of the game.

<About Battle>
In the game of this embodiment, since a plurality of teams occupy each unit area, players belonging to different teams may face each other on the map. In such a case, a battle (battle) between the players occurs. The battle is performed using a deck on which a plurality of cards owned by each player are arranged. Note that the strength of the player's deck is determined by parameters such as attack power and defense power set for each card and the placement of each card.

  The specific flow when competing for the occupation of the unit area by battle will be described. 8A to 8C are diagrams illustrating a flow when a battle occurs. As shown in FIG. 8A, it is assumed that team A occupies unit area H and team B occupies unit area G. Further, the length (distance) of the path connecting the unit area H and the unit area G is assumed to be x. In this state, when player A1 belonging to team A advances from unit area H to unit area G in order to occupy unit area G, a player belonging to team B occupying unit area G (player B) 1) occurs.

  If another player belonging to the same team is in the same unit area, that player can also participate in the battle as a friend. For example, when the player A 2 belonging to the team A is in the unit area H, the player A 2 participates in the battle as a friend of the player A 1. Therefore, the more players who belong to the same team are in the unit area, the more the battle can proceed. Further, the strength of the deck of the player A1 performing the battle may be changed according to the number of players belonging to the team A in the unit area H.

  As a result of the battle, when player A1 gives a predetermined amount of damage Y to player B1, player A1 passes from unit area H to unit area G by a distance corresponding to the magnitude of the damage Y. Can be moved. FIG. 8B shows a case where player A 1 moves from unit area H toward unit area G by y. That is, the player A1 can reach the unit area G by moving the path for the remaining (xy).

  Then, as shown in FIG. 8C, player A1 (or another player who belongs to team A) may repeat the battle and accumulate damage to the opponent, thereby increasing the remaining (xy) distance. When moving to reach the unit area G, the unit area G becomes occupied by the team A to which the player A 1 belongs. Since the team B who previously occupied the unit area G can no longer occupy the unit area G, the player B belonging to the team B who was in the unit area G is forced to change to another unit area. Moved to (other unit areas occupied by Team B).

  Moreover, the battle of this embodiment may generate | occur | produce between the virtual enemy character operated by the server apparatus 10, and a player other than generate | occur | producing between a player and another player. For example, in FIG. 8, when the unit area G is not occupied by any team, the server device 10 arranges the virtual enemy characters in the unit area G. When player A 1 tries to move to unit area G, a battle with a virtual enemy character is generated, and the occupation of the unit area is contested in the same manner as described with reference to FIGS. 8A to 8C. By adjusting the difficulty level when occupying the unit area in this way, the balance of the game can be appropriately maintained.

  In addition, a team occupying a certain unit area may be simultaneously battled by two or more other teams. For example, in FIG. 7, when team A occupies unit area H, team B occupies unit area G, and team 丙 occupies unit area L, team A has the same timing from team B and team 丙. There is a possibility of a battle. In this case, team A must fight against two teams, so the strength (number of players participating in the battle) is likely to be divided. Therefore, there is a high possibility that the unit area H will be occupied by another team after defeating the battle. That is, if a unit area having many paths (for example, unit area H in FIG. 7) is occupied, a battle with two or more teams may occur at the same time, making it difficult to defend the unit area. On the other hand, by setting a large number of points (number of stars displayed on the map screen) that are determined in a unit area with many paths, each team will know that it is difficult to defend and occupy that unit area. You can increase the strategic elements of the game because you are aiming.

  By the way, in the case of FIG. 7, the number of passes provided in the home area of each team is only one. Therefore, even if they are attacked by other teams, in the headquarters area, the team's full strength (players belonging to the team) can be concentrated on the battle with one team without having to battle simultaneously with two or more teams. It is easier to defend. In the case of FIG. 7, since the path from the headquarters area of each team to the unit area of the third pass is a one-way road that does not branch, the team having the headquarters in this section battles with other teams simultaneously Does not occur. Therefore, it can be said that the unit area existing in such a section is easy to defend for a team based in the section and difficult to occupy for other teams. In addition, even if the number of passes provided in the home area of each team is plural, the number of passes provided from one home area to another home area is limited in the middle. Teams with a headquarters area near the leg are easier to defend. For example, even if a path is provided between the unit areas A and C in FIG. 7, the path between the unit areas C and D is limited to a single road. . That is, a path (for example, a path between unit areas CD in FIG. 7) through which a plurality of routes connecting a certain headquarters area and other headquarters areas are set in common is provided. In the unit area (for example, unit area C in FIG. 7), it can be said that it is easy to defend for a team having a base area near the unit area and difficult to occupy other teams.

<About the target area>
The game field (map screen) is provided with a unit area in which a particularly large point is defined as a “target area”. In the case of FIG. 7, the unit area M located in the center of the screen is set as the target area. Since three stars are displayed in the unit area M, as described above, a particularly large number of points are awarded to the team that occupies the unit area M. Therefore, each team will give priority to occupying this target area.

  The position of the target area is set so that the shortest distance from the home area of each team is equal. In other words, the number of paths forming the shortest route connecting the unit area (home area) occupied by a certain team at the start of the game and the target area is set to be equal. This makes it possible to make the game fair by making the conditions of each team the same at the start of the game.

  It is desirable that the number of paths provided in the target area is as large as possible. By providing many passes as described above, it becomes possible to proceed from multiple directions to the target area, so that each team can easily have a chance to occupy the target area. For example, in FIG. 7, the target area (unit area M) has three paths. Therefore, there is a possibility that the unit area M can be battled from the three adjacent unit areas D, H, and L. Even if Team A occupies the target area, if Team B (a player belonging to Team B) and Team A (player belonging to Team A) are set up at the same time, It is difficult to keep occupying. Therefore, the chance to occupy the target area also increases for Team B and Team B, making it easier to reverse the earned points.

  In this way, not only one team occupies the target area, but by giving all teams a chance to occupy the target area, the game development can be made more thrilling and the player's interest can be increased. In particular, it is possible to provide a more strategic game by competing for the occupation of the unit area with three or more teams.

<Special area settings>
FIG. 9 is a diagram illustrating an example of the map screen in a state where the game has progressed to some extent. As the game progresses and occupies the unit area for each team, the difference in the points earned between the teams may increase greatly. In FIG. 9, since Team A occupies more unit areas than Team B and Team IV, the difference between the points acquired by Team A and other teams increases. If the difference in earned points becomes too large, players belonging to the team with few earned points may lose interest in the game or give up winning, and the game may become monotonous.

  Therefore, in the game of the present embodiment, a special area is set in any one of a plurality of unit areas on the map screen at a predetermined timing during the game in order to give a chance of reversal to a team with few points. Then, special points that can advantageously advance the game are given to the team that occupies the unit area set as the special area. For example, a point that is five times the normal point is awarded to a team that occupies the special area, or a team that occupies the special area takes points from a team with many earned points. Therefore, even a team with a low earned point at the present time can obtain a chance to reverse the earned point by occupying the unit area set as a special area.

  The special area is set by the special area setting unit 114 of the control unit 11. In this embodiment, an object is displayed in a unit area set as a special area on the map screen. Although an egg-shaped object is displayed in the unit area F in FIG. 9, other objects such as a magic stone may be displayed. In addition to displaying the object, a method of blinking the unit area or displaying it in red may be used. Details of the special area setting operation will be described later.

<< Operation Example of Game System 1 >>
An example of an operation performed by the game system 1 according to the present embodiment will be specifically described. In the following, the occupation team determination operation for determining the team to be occupied for each unit area on the game field will be described, and then the special area setting operation for giving special points will be described.

<Occupation team decision operation>
FIG. 10 is a diagram for explaining the occupation team determination operation. When the game is started, a player belonging to a certain team requests the server device 10 to occupy a predetermined unit area (referred to as unit area X) via the player terminal 20 (S101). Here, the request to occupy the unit area is synonymous with a request to move from the unit area where the player is present (the base area at the start of the game) to the unit area to be occupied.

  When the server device 10 receives a request from a player, the occupied team determination unit 111 of the control unit 11 performs a process of determining an occupied team for the unit area requested to be occupied (S102). FIG. 11 is a flowchart of the occupied team determination process performed by the occupied team determination unit 111.

  When the occupation request is made for the unit area X, the occupation team determination unit 111 checks whether there is a team that already occupies the unit area X (S121). If there is a team already occupied for the unit area X (Yes in S121), a battle is generated between the player (enemy player) belonging to the occupied team and the player who requested the occupation in S101 (S122). As a result of the battle, if the damage that the player who requested the occupation gives the enemy player is greater than or equal to a predetermined threshold (Yes in S123), it is assumed that the team to which the player who requested the occupation belongs succeeded. The occupied team of the unit area X is changed (S124). On the other hand, if the damage requested by the player who requested the occupation is less than the predetermined threshold (No in S123), it is assumed that the occupation by the team to which the player who requested the occupation belongs did not succeed. The occupied team of the unit area X is not changed (S125).

  When there is no team occupying the unit area X at the time when the occupancy request is made for the unit area X (No in S121), between the virtual enemy player operated by the control unit 11 and the player who requested the occupancy A battle is generated (S126). As a result of the battle, when the damage requested to the virtual enemy player by the player who requested occupancy is equal to or greater than a predetermined threshold (Yes in S127), the player who requested the occupancy succeeded in occupying Then, the team is set as the occupation team of the unit area X (S128). On the other hand, when the damage requested to the virtual enemy player by the player who requested occupancy is less than the predetermined threshold (No in S127), the occupancy by the team to which the player who requested occupancy did not succeed As a result, the occupied team of the unit area X is not changed (S129), and the team that occupies the unit area X does not exist.

  When the team occupying the unit area X is determined, the screen generation unit 115 of the control unit 11 generates map screen data (for example, see FIG. 9) on which the occupancy team of the unit area X is displayed based on the result. (S103). Then, the generated map screen data is transmitted to the player terminal 20, and the map screen is displayed on the terminal display unit 24 (S104).

<Special area setting operation>
FIG. 12 is a flowchart for explaining the special area setting operation. Prior to the setting of the special area, first, the points assigned to the unit area are given to the team occupying the unit area by the point granting unit 112 of the control unit 11 at a predetermined timing during the game (S201). ). Here, the predetermined timing is determined based on the elapsed time from the start of the game, and points determined in the unit area are given to the team that actually occupies the unit area at that time. Alternatively, points may be awarded to all teams that have occupied the unit area up to that point (that is, points will be awarded to teams that do not occupy the unit area at that time). In some cases). Other methods may also be used. In any case, the more teams that occupy the unit area, the more points are awarded.

  The points given to each team are totaled for each team, and are temporarily stored in the data storage unit 12 or the like as acquired point information of each team at that time. The team with the most earned points at the end of the game becomes the winning team.

  Next, the comparison unit 113 of the control unit 11 performs a process of comparing the acquired points for each team (S202). For example, when a game is played among the three teams of Team A, B, and Tsubaki, the difference of the acquired points between each team is calculated, and each team is ranked according to the size of the acquired points at that time.

  Subsequently, the special area setting unit 114 of the control unit 11 determines whether or not special area setting is necessary according to the acquired points for each team compared in the process of S202 (S203). As a specific method for determining whether or not it is necessary to set a special area, for example, there is a method of comparing a difference of acquired points between a team having the most acquired points and a team having the least acquired points with a predetermined threshold. In the case of this method, it is determined that the special area needs to be set when the acquired point difference is equal to or larger than a predetermined threshold. Further, the determination may be made based on the total value of the acquired points of all the teams, or based on the point acquisition status of each team per unit time.

  When it is determined that the special area setting is unnecessary (No in S203), the control unit 11 ends the special area setting operation.

  On the other hand, when it is determined that a special area needs to be set (S203: Yes), the special area setting unit 114 selects one area (although not necessarily one area) from a plurality of unit areas displayed on the map screen. The position where the special area is to be set is determined (S204). In the present embodiment, a unit area that is in a position that can be easily occupied by a team with few acquisition points is more easily set as a special area. That is, it is easy to set a unit area close to the unit area occupied by the team with a small number of acquisition points as a special area. For example, in FIG. 9, Team A occupies many unit areas on the map screen, whereas Team B occupies few unit areas. In this case, a unit area that is close to the unit areas E, F, and G (the area where the path is hatched in FIG. 9) occupied by the team B with a small number of acquisition points is easily set as a special area. Specifically, the unit areas F and G and the unit area H are easily set as special areas. When setting a special area, if there is a unit area nearby that is not occupied by any team, that unit area will be preferentially set as a special area. The unit area occupied by is set as a special area. In the case of FIG. 9, the unit area F occupied by the team B is set as a special area.

  In addition, when the unit area H occupied by the team A having a large number of acquisition points is set as a special area, it seems to work favorably for the team A. However, since many passes are provided in the unit area H as described above, other teams (team B and team 丙) are likely to attack the unit area H (special area). Therefore, when the unit area H is set as a special area, there is a high possibility that it will work against the team A.

  In addition, the larger the point difference between the team with more acquisition points and the team with less acquisition points, the easier it is to set the special area closer to the home area of the team with fewer acquisition points. In other words, the special area is set so that the number of paths that form the shortest route connecting the home area and the special area of the team with a small number of acquisition points is reduced. For example, in FIG. 9, since the unit area F close to the home area (unit area E) of the team B with few points is set as a special area, the team B tends to occupy the unit area F and from other teams. Since it is easy to defend, there is a high probability that special points will be given to team B with few points.

  When the setting position of the special area is determined, it is stored in the data storage unit 12 as special area setting information.

  When any one of the plurality of unit areas is set as a special area, the screen generation unit 115 of the control unit 11 sets an object (eg, an egg shape in the unit area) set as the special area. Map screen data on which the object is displayed is generated (S205). The generated screen data is transmitted to the player terminal 20 and displayed on the terminal display unit 24.

  Then, special points are awarded to the team occupying the unit area set as the special area at a predetermined timing (S206). The special points are given to the team that occupied the special area (unit area) when a predetermined time has elapsed since the special area was set by the special area setting unit 114. In addition, special points are awarded to the team that has occupied the special area for the longest time since the special area was set up until the predetermined time has passed, or to the team that first occupied the special area. May be.

  As special points, points larger than the points determined in the normal unit area are awarded, or points that are taken from a team with many earned points are awarded.

  A lower team with fewer earned points occupies a special area to which special points are given, thereby making it easier to obtain an opportunity to reduce the difference in earned points with the higher team. As a result, the game tends to be close and the player can expect more interesting development.

  Further, in the game of the present embodiment, the server device 10 does not directly intervene in the game progress. For example, a special point is not unconditionally given to a lower team in order to reduce the difference in earned points between teams. On the other hand, if a special area is set up so that the lower team is advantageous, and if the lower team can take advantage of the opportunity to occupy the special area, it will acquire special points and reduce the point difference with the higher team. Can do. That is, in the game of the present embodiment, indirect intervention is performed by the server device 10 and the game balance is adjusted. Therefore, it is possible to provide a fair game without giving the player a sense of incongruity.

<Modification of map screen>
FIG. 13 is a diagram showing a modification of the map screen. As described above, in the game field (map screen) of the game of the present embodiment, a target area to which a larger point than other unit areas is given is set. Then, it has been explained that the target area is provided so as to be equidistant from the home area of each team, that is, the number of passes between the home area and the target area is equal. In the case of FIG. 7, the home area of each team is provided so as to surround the target area (unit area M), and the target area is located at the center of the map screen. Therefore, the target area was positioned as if it were the final destination. However, the position of the target area need only be equidistant from the home area of each team and does not necessarily have to be the final destination.

  In the map screen of FIG. 13, each team can proceed to the unit areas N, O, and P after reaching the target area from the home area. That is, the unit area P functions as a second target area. In this case, the strategic element of the game can be further increased. For example, if Team A first occupies the target area (Unit Area M), Team A is dedicated to defending Unit Area M from the attack of Team B and Team B, or the second target area You will be forced to choose whether you want to continue to aim at (unit area P). Team B and Team IV can also expand the range of game development by collaborating to attack the unit area M or attacking the weakened enemy base.

  Thus, the interest of the game can be enhanced by appropriately setting the position of the target area according to the shape of the game field (arrangement of unit areas, paths to be set, etc.). The setting of the target area may be determined in advance by the system administrator, or may be determined at random from unit areas that are equidistant from the home area of each team.

=== Other Embodiments ===

  The above-described embodiments are for facilitating the understanding of the present invention, and are not intended to limit the present invention. The present invention can be changed and improved without departing from the gist thereof, and it is needless to say that the present invention includes equivalents thereof. The embodiments described below are also included in the present invention.

<When two or more special areas are set simultaneously>
In the above-described embodiment, an example in which one special area to which special points are given is set on the game field (map screen) has been described. However, the present invention is not limited to this, and two or more special areas are set on the game field. May be. Also in this case, each special area is set by the special area setting unit 114 at a position that can be easily occupied by a team with a small number of acquisition points according to the difference in points acquired between a team with a large number of acquisition points and a team with a small number of acquisition points. .

<About object functions>
In the above-described embodiment, the example in which the object is displayed for the unit area in which the special area is set has been described. However, the displayed object may have various functions. For example, different rarities may be set according to the type of the object, and the special points given when the object occupies the set unit area may be different. In this case, the special area setting unit 114 determines the type of object to be displayed according to the difference in the acquisition points for each team, and the higher the difference in the acquisition points between the teams, the higher the rarity object is displayed. Make it easier for big teams to get big special points.

  Further, in addition to the unit area where the object is set, the special point granting condition is to further occupy a predetermined unit area different from the unit area, or the special unit given by further occupying the predetermined unit area. You may make it increase a point.

  In addition, when the displayed object is an egg shape, a special point given by the egg hatching after a predetermined time may be changed. For example, a dragon or other monster appears when the egg hatches, and bonus points are awarded to the team that occupied the special area when the egg hatched, or the hatched dragon becomes a friend in subsequent battles You may make it participate for a certain period.

<Parameters for determining the setting position of the special area>
In the above-described embodiment, the example in which the location (unit area position) where the special area is set is determined by the special area setting unit 114 according to the difference in the acquired points between the teams has been described. The place to be set may be set in advance as a parameter. For example, the game field is graded for each area, and parameters are set so that the grade is higher in the unit area that is far from the home area of each team (the number of passes is large). Then, when setting the special area, the special area setting unit 114 sets the special area in the unit area existing within the range set for the predetermined grade according to the difference in the acquired points between the teams. It may be.

<Increase / decrease in unit area and path>
In the above-described embodiment, the unit area and the path displayed on the game field (map screen) are determined based on the map information, but these may be increased or decreased depending on the development of the game. For example, when a predetermined time has elapsed from the start of the game, a new pass may be provided in the home area of the lower team with a small number of acquisition points, and a new unit area connected to the pass may be provided. Since the newly provided area is likely to be occupied by the lower team, points are easily given to the lower team, and the game tends to be close.

  In addition, a new pass may be provided from a unit area close to the home area of the team having many points to be easily attacked by other teams. For example, in FIG. 9, a path connecting the unit area L and the unit area C appears, and similarly, a path connecting the unit area H and the unit area C appears. By increasing the number of passes in the unit area C close to the home area of the team A that occupies many unit areas, the unit area C is likely to be attacked by the team B and the team 丙, so the game tends to be close. Conversely, the number of passes in the unit area close to the home area of the team with few earned points may be reduced.

  In addition, if the game field information (map screen) is changed by increasing / decreasing the unit area and the path in this way, and a special area is appropriately set on the changed game field, the strategic element of the game Can be further increased, and the game performance can be further increased.

<Information processing device>
In the above-described embodiment, the game system 1 including one server device 10 is described as an example of the information processing device. However, the present invention is not limited thereto, and a plurality of server devices 10 are provided as information processing devices. The game system 1 may be used. That is, a plurality of server devices 10 may be connected via the network 2 and each server device 10 may perform various processes in a distributed manner.

  Moreover, it is good also as a structure which the player terminal 20 bears a part of function as an information processing apparatus. In this case, the server device 10 and the player terminal 20 constitute an information processing device.

<Game program>
In the game system 1 in the above-described embodiment, an example has been described in which the server device 10 and the player terminal 20 cooperate to set a special area at a predetermined position on the game field and indirectly intervene in the game progress. However, the present invention includes a game program for executing these processes. That is, the server device 10 or the player terminal 20 as the information processing device may execute the above-described processes based on the game program.

1 game system,
2 network,
10 Server device (information processing device),
11 Control unit,
111 occupancy team determination unit, 112 point grant unit, 113 comparison unit,
114 special area setting unit, 115 screen generation unit,
12 data storage unit, 13 input unit, 14 display unit, 15 communication unit,
20 player terminal (information processing terminal),
21 terminal control unit, 22 terminal storage unit, 23 terminal input unit, 24 terminal display unit,
25 Terminal Communication Department

Claims (6)

It has a plurality of unit areas in the game field to have a path between the two unit areas of the plurality of unit areas, to control the game to compete the occupation of the unit area between three or more teams An information processing apparatus,
An occupancy team determination unit for determining a team occupying the unit area;
A point granting unit for granting points determined in the unit area to the team occupying the unit area;
A storage unit for storing acquisition points for each team;
A comparison unit for comparing the obtained points for each team;
Among the plurality of unit areas , a special point is given to a unit area that is occupied by a team having a dominant acquisition point, and in which the other two or more teams are likely to proceed through the pass. A special area setting section for setting a special area to be granted,
An information processing apparatus comprising: The information processing apparatus according to claim 1,
The number of unit areas in the game field is greater than the number of teams,
The number of the paths forming the shortest route connecting the unit area occupied by one team at the start of the game and the unit area occupied by another team at the start of the game is equal. Processing equipment. An information processing apparatus according to claim 2,
A target area is set in any of the plurality of unit areas,
The number of the paths that form the shortest route connecting the unit area and the target area that each of the teams occupies at the start of the game are all equal,
The information processing apparatus according to claim 1, wherein a point determined in the target area is larger than a point determined in another unit area. The information processing apparatus according to claim 2 or 3,
In the game field, a path through which a plurality of routes connecting the unit area occupied by one team at the start of the game and the unit area occupied by another team at the start of the game is set in common is set. An information processing apparatus characterized by that. An information processing apparatus according to any one of claims 2 to 4,
The special area setting unit increases the difference between the acquisition points of the team with a large number of acquisition points and the team with a small number of acquisition points, and the unit area and the special area occupied by the team with a small number of acquisition points at the start of the game. An information processing apparatus, wherein the special area is set so that the number of the paths forming the shortest route connecting the areas is reduced. Have a plurality of unit areas, the information processing apparatus a game to compete the occupation of the unit area between three or more teams in a game field which have a path between the two unit areas of the plurality of unit areas A game program to be realized ,
A function of determining a team occupying the unit area by an occupancy team determination unit of the information processing apparatus ;
A function of giving points determined in the unit area to the team occupying the unit area by the point granting unit of the information processing apparatus ;
A function of storing the acquired points for each team by the storage unit of the information processing apparatus ;
A function of comparing the acquired points for each team by the comparison unit of the information processing apparatus ;
Among the plurality of unit areas, a special area that gives special points to a unit area that is occupied by a team having a dominant acquisition point and is easily attacked by two or more other teams. A function set by the special area setting unit of the information processing apparatus ;
A game program for causing the information processing apparatus to realize the above.

Images