WO2012165315A1

WO2012165315A1 - Computer game program, computer game system

Info

Publication number: WO2012165315A1
Application number: PCT/JP2012/063440
Authority: WO
Inventors: 盛正佐藤; 曜百渓
Original assignee: 株式会社セガ
Priority date: 2011-06-01
Filing date: 2012-05-25
Publication date: 2012-12-06
Also published as: JP2012249770A

Abstract

Provided is a program for allowing a computer game system to perform functions comprising: a durability value acquisition means for acquiring a durability value, the value indicating the degree of durability of an object that is arranged in a virtual space, the object being the target of attack by the attacking side, and the object of defense by the defending side, the durability value being changed by the attack from the attacking side; condition determination means for determining whether the change in the durability value accompanying the progress of a battle game has exceeded a first reference value, and whether the progress situation of the battle game has satisfied a first condition; a play time calculation means for setting an initial value of the play time of the battle game, sequentially counting down the play time in accompaniment with the progress of the battle game, and adding a predetermined time to the current play time when the condition determination means determines that the first condition has been satisfied; and victory determination means for determining that the attacking side has won if the condition determination means has determined that the change in the durability value has reached the first reference value, and for determining that the defending side has won if the countdown by a play time setting means has ended without the change in the durability value reaching the first reference value.

Description

Computer game program, computer game system

The present invention relates to a computer game program that causes a computer game system to execute a battle game in which a plurality of players are divided into one and the other, and a computer game system that executes the computer game program.

For example, in an amusement facility, a game device for a plurality of players to play a battle game is provided. In the amusement facility, a plurality of game devices are connected via a LAN or the like, and also connected to other amusement facility game devices through a network such as the Internet, and a large number of people (for example, about 20 people) participate in the same game. Network fighting games that can be played are also popular.

In the competitive game, for example, as disclosed in Patent Document 1, a plurality of players are divided into two teams, and both teams use the weapons such as firearms in the game space (virtual space), and both teams play each other's player characters. When a base is attacked and eventually all the player characters that make up the team become incapable of fighting or the base is destroyed, the team loses.

JP 2010-35908 A

However, the conventional battle game has the following problems. First, in order to avoid aggressively attacking and damaging the opponents, both teams focus on defense and are reluctant to attack. , Lack of excitement, the best part of the fighting game may not be demonstrated.

In addition, in a network battle game in which a large number of people (for example, about 20 people) can participate (when 20 people can participate, a battle game of 10 to 10 people) is expected to have many battles in the game space. However, even if it is a battle between a large number of people, if the player characters are dispersed in the game space, each battle will be a small scale between a small number of people at multiple points in the game space. , Large-scale battles between large numbers of people are not carried out, which may lead to a situation in which the game is lacking in excitement.

Therefore, an object of the present invention is to provide a computer game program for causing a computer game system to execute a highly interesting battle game in which attacks are actively performed, and a computer game system for executing the computer game program.

In order to achieve the above object, a computer game program of the present invention is a program that can be executed in a computer system in which a plurality of players are divided into an attacker side and a defense side and operate a character in a virtual space to play a battle game. , A durability value acquisition means for acquiring a durability value that is disposed in the virtual space and indicates a durability level of an object that is an attack target on the attack side and a defense target on the defense side, and that varies depending on the attack on the attack side; Condition determining means for determining whether or not the fluctuation of the durability value accompanying the progress of the battle game exceeds the first reference value, and whether or not the progress status of the battle game satisfies the first condition, An initial value of the play time is set, the play time is sequentially counted down as the battle game progresses, and the first condition is determined by the condition determining means. When it is determined that it has been satisfied, a play time calculation means for adding a predetermined time to the current play time, and when the condition determination means determines that the variation in the durability value has reached the first reference value, Victory determining means for determining that the attacking side has won, and for determining that the defense side has won when the countdown by the play time setting means has ended without the change in the durability value reaching the first reference value. , A program for operating a computer system.

The computer game system of the present invention is a computer game system in which a plurality of players are divided into an attack side and a defense side and operate a character in the virtual space to play a battle game. And a durability value acquisition means for acquiring an endurance value of an object that is a defense target on the defense side, the endurance value acquiring means changing according to the attack on the attack side, and a change in the endurance value as the battle game progresses Condition determination means for determining whether or not the first reference value has been exceeded and whether or not the progress of the battle game satisfies the first condition, and an initial value of the play time of the battle game are set, and the battle game As the game progresses, the play time is sequentially counted down, and if it is determined by the condition determination means that the first condition is satisfied, the current play time When the play time calculation means for adding a predetermined time and the condition determination means determine that the variation of the durability value has reached the first reference value, it is determined that the attacking side has won, and the durability value When the countdown by the play time setting means is terminated without the fluctuation of the first reference value being reached, a victory determination means for determining that the defense side has won is provided.

According to the present invention, the battle team is divided into the attack side and the defense side, and the play time extension condition is given while the game is in progress, so that an aggressive and quick attack in the battle game is promoted, quick development and high-density battle. A highly entertaining game that can be played.

It is a figure which shows the structural example of the game system in this Embodiment. It is a figure which shows the structural example of a game device. It is a figure which shows the structural example of a server apparatus. It is a plane schematic diagram of the game space of the battle game in the present embodiment. It is a figure which shows the top view of the example of game space as an example. FIG. 6 is a flowchart for explaining a time extension process of a battle game in the present embodiment. It is a plane schematic diagram of the game space for explaining the occupation of the base P. It is a figure which shows the example of a screen of the game device on which an occupation rate gauge is displayed. It is a figure which shows the example of a change of an occupation rate gauge. FIG. 5 is a flowchart for explaining a win / loss determination process of a competitive game in the present embodiment.

Hereinafter, embodiments of the present invention will be described with reference to the drawings. The embodiments are for understanding the present invention, and the technical scope of the present invention is not limited thereto.

FIG. 1 is a diagram showing a configuration example of a computer game system in the present embodiment. FIG. 2 is a diagram illustrating a configuration example of the game apparatus. A plurality of game apparatuses 12 capable of executing a network battle game are installed in amusement facilities 10 located throughout the country. Each game device 12 in the amusement facility 10 is connected via a LAN 20 and can communicate with other game devices 12 in the amusement facility. Each game device 12 in the amusement facility 10 is connected to the router 14 and is connected to the Internet 22 via the router 14. Accordingly, each game device 12 in a certain amusement facility 10 can communicate with the game devices 12 in other amusement facilities 10 via the Internet.

In the configuration example of the game device 12 in FIG. 2, the program / data storage device 221 stores game programs and data (including video / audio data). This may be, for example, a magnetic recording device, an optical disk drive for driving a recording medium such as an external DVD-ROM for storing game programs and data.

The CPU 222 as a control means performs game program execution, overall system control, coordinate calculation for image display, and the like. The system memory 223 is a buffer memory that stores programs and data necessary for the CPU 222 to perform processing. Furthermore, the BOOTROM 224 stores a program and data for starting the game apparatus 12.

The program / data storage device 221, the CPU 222, the system memory 223, and the BOOTROM 224 are connected to the bus arbiter 225. The bus arbiter 225 controls the flow of data with each block of the game device and devices connected to the outside.

A rendering processor 226 and a sound processor 228 are further connected to the bus arbiter 225. The image data read from the game program / data storage device 221, the operation by the player, and the image to be generated according to the progress of the game are generated by the rendering processor 226 and displayed on the display 230. Graphic data and the like necessary for the rendering processor 226 to generate an image are stored in the graphic memory 227.

The music data read from the game program / data storage device 221 and sound effects and sounds to be generated according to player operations and game progress are generated by the sound processor 228 and output from the speaker 232 as sound. Sound data necessary for the sound processor 228 to generate sound effects and sounds are stored in the sound memory 229.

Furthermore, a peripheral IF (interface) 234, an IC card IF 236, and a communication IF 238 are connected to the bus arbiter 225. An input device 235 for inputting a player's operation is connected to the peripheral IF. In response to the operation of the input device 234 by the player, the peripheral IF 234 generates a game operation signal. The game operation signal is sent to the CPU 222, the rendering processor 226, and the sound processor 228 via the bus arbiter 225.

The IC card IF 236 is connected to an IC card reader / writer that reads from and writes to an IC card that stores identification information for identifying a player. The communication IF 238 is connected to a LAN line and an Internet line for connection to other game devices 12 in the same amusement facility, and each game device 12 is connected to the game device and server system of another amusement facility via the Internet line. 30 is communicably connected. Various communication means such as telephone lines, optical fiber communication, and wireless communication can be used as the communication means.

Returning to FIG. 1, the server 30 is connected to the Internet 11, and the server system 30 includes a game server 31, a matching server 32, a database server 33, and an access server 34. The game server 31, the matching server 32, the database server 33, and the access server 34 may be separate server devices or may be integrated server devices.

FIG. 3 is a diagram illustrating a configuration example of the server device. The server device has a hardware configuration of a general computer device, and a CPU 312, a ROM 313, a RAM 314, a network interface 315, an input device 316, an output device 317, and an external storage device 318 are connected to the bus 311.

The CPU 312 performs processing or calculation of data and controls various components connected via the bus 311. The ROM 313 stores a control procedure (computer program) of the CPU 312 in advance, and the server device is activated when the CPU 312 executes the computer program. The external storage device 318 is an optical disk medium such as a hard disk storage device or a CD-ROM, and stores a computer game program for executing a battle game. The computer game program is copied to the RAM 314 and executed. The CPU 312 executes the computer game program to execute game processing in the present embodiment to be described later. The RAM 314 is used as a work memory for data input / output, transmission / reception, and temporary storage for control of each component.

The network interface 315 is an interface for connecting to the Internet as a network. The input device 316 is, for example, a keyboard, a mouse or the like, and can perform various designations or inputs. The output device 317 is a display, a speaker, or the like.

The game server 31 prepares a plurality of virtual game spaces as game processing functions, and a player who requests participation is assigned to one of the virtual game spaces (hereinafter sometimes referred to as a game room), and the same game room The same network battle game is played among the players assigned to. The game server 31 transmits a game operation signal from a game device operated by a player in the same game room to other game devices in the same game room, and the game device receives from the server system 30 in the same game room. A network battle game is executed by a game operation signal from another game device and a game operation signal of the game device itself.

Then, the game server 31 executes characteristic time extension processing and winning / losing determination processing in the network battle game according to the present embodiment, as will be described later.

The matching server 32 performs control for assigning the player who requested participation to the room of the game server 31. The matching server 32 prepares a virtual standby space (hereinafter sometimes referred to as a lobby) for grouping players assigned to the same room among a plurality of players requested to participate, and each player who requested participation belongs. The team identification information of the team and the group identification information of the group including the team to which each player who requested the participation belongs is acquired from the database server 33, and the player having the same team identification information is different from the player having the same team identification information but the same A player having group information is assigned to the same lobby, and a player assigned to the same lobby is assigned to the same room. Further, the matching server 32 distributes the players assigned in the same room to either an attack team or a defense team described later.

The database server 33 is a database server that stores player information, and stores and manages various information related to the player and the group to which the player belongs.

The access server 34 provides a predetermined site related to the network battle game to an information terminal such as a computer device (PC) or a mobile phone, through which new member registration, creation of various groups, subscription, and Perform various registration processes, including changes. Details of a specific registration processing example are described in Japanese Patent Application No. 2010-200303.

Next, an outline of the battle game of this embodiment executed by the above-described computer game system will be described.

FIG. 4 is a schematic plan view of the game space of the battle game according to the present embodiment. In the battle game in this embodiment, the battle is divided into an attack team and a defense team. A plurality of players are divided into two teams, and characters (a white circle in the figure represents a defense team character and a black circle represents an attack team character) are engaged in a game space using weapons such as firearms. This is the same as the conventional battle game, but only the attack team can attack the home base B1 of the defense team, and the defense team attacks the home base B2 of the attack team. Rather than fighting, attack the attacking team in order to defend their home base B1. A plan view of an example game space is shown in FIG.

In FIG. 4, bases P1, P2, and P3 in the middle between the two bases B1 and B2 in the game space represent facilities that are the front lines of the defense team, as will be described later. The base B1 of the defense team has an object (sometimes referred to as a “core”) as an attack target from the attack team, and a predetermined durability value is set for the core. As the durability value, when a predetermined attack is received from the attack team, a value corresponding to the degree of the attack is subtracted.

In the battle game according to the present embodiment, since the defending team does not have the victory conditions for attacking the base of the opponent team (attack team) in the first place, the attacking team does not attack the defending team within the given play time. If the durability value of the core of the home base B1 is zero, that is, if the core is destroyed, the attack team wins. On the contrary, the attack team zeroes the durability value of the core of the defense base B1 within the play time. If it fails, that is, if the core cannot be destroyed, the defense team wins. The endurance value is indicated by a numerical value from 0 (zero) to 100, for example, 100 is a numerical value in a state where it is not destroyed at all, and 0 (zero) is completely destroyed and occupied by the attacking team. The numerical value of the state. The initial value of the endurance value, the winning / losing decision value, etc. are values that can be selected as appropriate. Further, the durability value may be a numerical value added according to the attack received, and may be determined to be the destruction of the core when reaching a predetermined value.

In this way, if one team is a team that only attacks, and the attack team is not actively attacked, the attack team will be defeated, so it will not be possible to adopt a strategy that focuses on defense. As a result, many battles will be held, and the game will be exciting, making it a highly interesting fighting game. Further, the attack team does not need to defend the home base of the own team, and can concentrate on the attack for the purpose of destroying or capturing the defense target of the home base of the defense team, and can attack more aggressively. On the other hand, the defense team can also conduct battles with high motivation for the clear purpose of protecting its home base from attacks from the attack team.

In the battle game divided into the attack team and the defense team, the following game processing is executed in the present embodiment.

(1) The winning / losing judgment is divided into two stages, “Overwhelming victory” and “Normal victory”. The conditions of “Overwhelming victory” and “Normal victory” of the attack team and the defense team are as follows.

Attack team “Overwhelming victory”: When the home base of the defense team is occupied while the remaining play time is longer than a predetermined time (for example, 200 seconds).
“Normal victory”: When the home base of the defense team is occupied while the remaining play time is less than a predetermined time (for example, 200 seconds).

Defense team “Overwhelming”: When the endurance value of the core of the defense team's base remains at a predetermined value (for example, 50) or more in a state where the play time has expired
“Normal victory”: When the endurance value of the core of the defense team's base is less than a predetermined value (for example, 50) in a state where the play time has expired.

The winning / losing determination conditions are not limited to the above example, and the time and numerical values can be changed as appropriate. In addition, the criterion for determination of victory is not limited to two levels, and may be three or more levels.

“Overwhelming victory” is a special victory that has a higher rank than “Normal victory”. Both the attack team and the defense team are “Overwhelming victory”. More benefits are given to the player. For example, the benefits to be given are a privilege that provokes motivation for the player to aim for “overwhelming”, such as the provision of points with monetary value and the provision of titles and items obtained only by “overwhelming”.

(2) A base P (hereinafter sometimes referred to as a plant) in the middle of the game space between the two teams' bases starts a battle in a state occupied by the defense teams, and the attack teams are the bases of the defense teams. By occupying the base in the middle of B1, additional play time is given and play time is extended.

For example, the play time given at the start of the game (hereinafter referred to as the start play time) is 300 seconds, and the play time for the additional play time set by the following formula is added each time the base is occupied. . A plurality of bases are set in advance in the game space map, and when the attack team occupies all of them, the play time is extended to a maximum of 600 seconds. In other words, when the maximum play time (600 seconds) and the start play time (300 seconds) are set in advance, the additional play time given for each occupation of the base is:
Addition play time = (maximum play time−start play time) ÷ number of bases. For example, when the number of bases is 4, (600−300) ÷ 4 = 75, and when the attack team occupies one base, the additional play time is 75 seconds. Similarly, when the number of bases is 3, (600−300) ÷ 3 = 100, and the additional play time is 100 seconds. There may be a plurality of types of maps serving as battlefields in each game space, or only the position coordinates of the home base may be changed in the same virtual space, or a plurality of types of locations and locations of bases may be set.

The attack team can attack the base of the defense team directly without occupying the base in the middle, but attack the base of the defense team by making the time taken to occupy the base shorter than the additional play time You can increase your time and increase your chances of winning.

Further, the occupation of the base is determined by the fact that the occupation ratio of the base changes depending on the number of player characters in a certain surrounding range (predetermined coordinate space in the virtual space) and the occupation ratio reaches a predetermined threshold. It is determined that the team was occupied. It is determined whether or not the coordinates of a predetermined part of at least one player character are included in the coordinate space corresponding to a certain peripheral range of the base, and if it is determined that it is included, it is included in the coordinate space Occupancy rate changes to the side that is determined to be occupied (either attacking side or defending side). In this embodiment, when it is determined that the base is occupied by the attacking team player character, the occupation rate does not change thereafter, and the occupation rate does not change even if the defense team character enters the coordinate space thereafter. However, it may be configured such that the defense team character can occupy the base once occupied.

(3) Only the front-line base can attack the attack team. The forefront base is the base closest to the attack team's home base among the bases not occupied by the attack team. That is, when there are a plurality of bases, the order of the bases that can be attacked is determined, and one base can be attacked at a time. This is to prevent the dispersion of battles. By narrowing down the attackable base to one, the battle is performed only around the base, and in a multiplayer battle game, small battles between small groups are distributed across the game space. Rather, a large-scale and intense battle between many people will be developed, and the real thrill of a battle between many people will be obtained.

For example, in FIG. 4, the order of the bases that the attack team can attack is P1, P2, and P3 in order from the base B2 of the attack team. The order does not have to be close to the attack team's headquarters B2, and may be a pre-specified order regardless of the distance.

Specific time extension processing of play time and winning / losing determination processing of a battle game for realizing the above-described game processing (1) to (3) will be described below with reference to FIGS. The time extension process and the win / loss determination process are realized by the CPU of the game server 31 of the server 30 executing the game program. Hereinafter, the process of the game server 31 will be described.

FIG. 6 is a flowchart for explaining the time extension process of the battle game in the present embodiment. The game server 31 sets, as an attack target base, the identification information of the base closest to the attack team's base B2 as an initial value of the base where the attack team can attack. In addition, the game server 31 has order information of the attack target bases and position information (coordinates) of a predetermined surrounding range used for the occupation determination of each base.

The game server 31 calculates the difference between the number of player characters of the attacking team and the number of player characters of the defense team within the predetermined surrounding range of the attack target base (S101), and the number of player characters of one team is that of the other team. It is determined whether the number of player characters has been exceeded (S102). If not exceeded (including the case where the player characters of both teams are 0 (zero)), the process returns to S101 and the calculation of the difference in the number of persons is continued. If it exceeds, it is determined that the occupying action is being carried out by the attacking team or the defense team, and the occupation ratio of the camp side performing the occupying action is increased. As a result of the occupation rate change, it is assumed that the attack team on the attacking team side has occupied the relevant base, and a predetermined additional time is added to the current play time (S103) to extend the time I do. Furthermore, the game server 31 sets the attack target base as the next base according to the order information of the attack target base (S104, S105). Note that the player character is damaged by an attack from the opponent, and disappears from the game space when the degree of damage exceeds a predetermined value.

6, every time an attack team occupies a base on the way, a predetermined additional time is added to the play time and the play time is extended.

FIG. 7 is a schematic plan view of the game space for explaining the occupation of the base P1. The occupation behavior state of the base P is determined according to the difference between the number of player characters (white circles) of the defense team around the base P1 (range surrounded by the dotted line) and the number of player characters (black circles) of the attack team. In FIG. 7A, since the number of player characters (white circles) of the defense team in the predetermined peripheral range of the base P1 is larger than the number of player characters (black circles) of the attack team in the predetermined peripheral range of the base P1, FIG. 7B shows a state where the number of player characters of the attack team in the predetermined surrounding range of the base P1 is the attack team in the predetermined peripheral range of the base P1. Since the number of player characters has been exceeded, the occupying action is carried out by the attack team.

Also, the defense team cannot recapture the base once occupied by the attack team. However, until the attack team occupies the base (the occupation ratio reaches the occupation threshold on the attack team side), the defense team has a larger number of player characters than the opponent team in the area around the base. The occupation rate can be changed to the defense team by intruding into the defense team, and the occupation rate by the defense team can be maintained by pushing back the occupation rate gauge.

Occupancy rate gauges representing the occupation rate in the predetermined surrounding range of the base P1 are displayed on the screen of each game device.

FIG. 8 is a diagram showing a screen example of the game apparatus on which the occupation rate gauge is displayed, and FIG. 9 is a diagram showing a change example of the occupation rate gauge.

The occupation ratio of each base changes as the character of any team faction enters the predetermined surrounding area of each base as described above. Each base changes to one of three types of states: an attack team side state, a defense team side state, and a neutral state according to the change in the occupation ratio. Only the attack team side can use the base in the attack team side state, only the defense team side can use the base in the defense team side state, and any team can use the base in the neutral state. The use here is to participate in a battle game from the base in the virtual space.

The change in the occupation rate will be described with reference to FIG. In this game, since the base P is completely occupied by the defense team at the beginning of the game, and no player character of any team is located in the predetermined peripheral range of the base P, FIG. ), The occupation rate gauge is at a position of −100, which indicates that the base is occupied by the defense team. The center line is a line indicating + -0 (zero), and as shown in FIGS. 9B to 9D, the player character of the attacking team enters the predetermined peripheral range of the base P, and maintains the entered state. By continuing to do so, the occupancy rate gauge approaches the center. Until reaching the position of +100, which is the occupied state by the attacker, as shown in FIG. 9D, the occupancy rate gauge is pushed back as the number of player characters of the defense team reappears. In this case, the base is on the defense team side until it reaches the position of + -0 (zero), which is the central line.

However, by finally maintaining the state where the number of player characters of the attack team within the predetermined peripheral range of the base P exceeds the number of player characters of the defense team within the predetermined peripheral range of the base P, FIG. As shown in FIG. 4, when the occupation rate gauge exceeds the central line, the base P becomes neutral at that time.

Finally, as shown in FIG. 9F, when the occupation rate gauge reaches the position of +100, the base P is occupied by the attack team, and the base P changes its state to the attack team side state.

In this embodiment, the defense team occupation state is set to −100 and the attack team occupation state is set to +100. However, the occupation threshold may be increased or decreased for each camp.

The occupation rate changes from the state occupied by any team to the neutral state when it crosses the central line, and is assumed to be neutral until occupied by any team. It is not limited, and it may be changed to a state occupied by either team when the center line is exceeded.

In addition, the base once occupied by the attack team side is set not to be re-occupied by the defense team side, but the predetermined conditions (the bases set in the following order are occupied by the defense team side, the attack team side) When the character on the side is defeated a predetermined number of times), the occupation rate may be regained on the defense team side.

Subsequently, FIG. 10 is a flowchart for explaining the win / loss determination process of the competitive game in the present embodiment. The durability value of the core in the defense team's base B1 is set in advance. By receiving the attacking action from the player character of the attack team, the durability value is gradually subtracted, and the game server 31 acquires the core durability value that changes with the progress of the game from the game device. Furthermore, the game server 31 executes the winning / losing determination process based on the core durability value and the remaining play time.

The game server 31 determines whether the durability value of the core is zero (S201). If it is zero, it is determined whether or not the remaining play time when the durability value becomes zero is longer than a predetermined reference time (S202). The game server 31 counts down the play time. When the remaining play time is longer than the predetermined reference time, the game server 31 determines that the attack team wins (S205). (S206). On the other hand, if the endurance value of the core is not zero in S201, the presence / absence of remaining play time is determined (S203), and if there is remaining play time, the process returns to S201. If there is no remaining play time, it is determined whether the durability value is greater than a predetermined reference value (S204). If it is larger than the predetermined reference value, it is determined that the defense team wins (S207), and if it is less than the predetermined reference value, it is determined that the defense team is a normal victory (S208).

As described above, the competitive game in the present embodiment provides a higher-level victory (“overwhelming victory”) in which more profits can be enjoyed in addition to the normal victory. Then, by associating the time extension process of play time with these two-stage victory criteria, the roles (duties) given to both teams in this battle game in which the attack team and the defense team play separately are performed. Motivation can be further increased, more aggressive battles are promoted, and the game is highly excited.

In other words, the defense team can increase the chances of obtaining a “overwhelming victory” by increasing the durability of the core at the time of time-up as much as possible. In other words, by preventing the time extension and raising the time as soon as possible, it is possible to prevent a decrease in the durability value and to obtain a “winning victory”.

For defense teams, an effective way to prevent the core core durability from falling is to time up as soon as possible. If the time is not extended (or not the maximum number of times), the play time will be relatively short, so that the chances of attacking the base are reduced, and the durability value is less likely to be reduced. The time can be increased while maintaining the durability value higher, and the possibility that the defense team will “win” is increased. Therefore, the defense team will make efforts to prevent the base from being extended as much as possible.

On the other hand, the attacking team can increase the possibility of obtaining “overwhelming victory” by setting the core durability value of the defense team to zero as soon as possible. In other words, by gaining as much play time as possible, the attack opportunity increases, and a “wow” can be obtained. For attacking teams, an effective means of increasing attack opportunities and earning remaining play time is to extend play time. If the time is not extended (or not the maximum number of times), the above-mentioned merit for the defense team becomes a demerit for the attack team, that is, the play time becomes relatively short. The number of attack opportunities decreases, and even when the core durability value is set to zero, the remaining play time at that time is also relatively shortened, and the possibility that the attack team will “win” is reduced. Therefore, the attack team will desperately attack so as to extend the time as much as possible and further reduce the durability value as soon as possible.

In this way, even when a battle is divided into a team that performs only an attack and a team that performs only a defense, high motivation can be given to the players of both teams in performing each mission (attack or defense). , The aggressive and quick attack in the battle game is encouraged, and it becomes a highly interesting battle game in which quick development and high-density battle can be performed.

Also, in recent years, a game charging system (time charging system) has been adopted instead of the conventional charging system that charges a fixed fee (for example, 100 yen) per game as a game charging system. There is something that has been. For example, a unit fee (for example, 1 yen) is charged for a unit play time (for example, 1 second). The playable time is stored as a game point in the above-described IC card (for example, a playable time for one game point is a unit play time of 1 second). The game device subtracts a predetermined number of game points stored in the IC card every unit play time, and when a game point remaining on the IC card of a player becomes zero, the player is in progress of the game. However, the game is disengaged from the ongoing game (the game proceeds as it is, but the presence of the player character of the player disappears from the game space).

The game device performs a predetermined alert display before the game point reaches zero, and the player adds a monetary value, thereby performing game point addition processing on the IC card.

In a game adopting such a time charging system, it may be preferred to advance the game quickly in a shorter time in order to save points.

In the competitive game of the present embodiment, the initially set play time (for example, 300 seconds) is about half of the normal play time (600 seconds), and as described above, all the bases on the way are occupied. , It is set to get normal play time.

For attacking teams, in addition to the strategy of occupying a base in the middle to extend the play time and gain time to attack the home of the defense team, the base is occupied in order to make the game proceed quickly. It is possible to adopt a strategy to attack the home of the defense team directly without doing so. Therefore, the time extension process of the battle game in the present embodiment can be selected not to extend the play time in accordance with the player's strategy, and corresponds to the player's need to advance the game quickly in a shorter time. It becomes possible.

In addition, the attack team is encouraged to speed up the progress of the game by setting the game so as to obtain a “high victory” that is a higher-ranking victory by leaving more play time and winning. For the defense team, the possibility of winning is increased by preventing the extension of the play time and shortening the attack time received by the headquarters.

As another aspect of the battle game of the present embodiment, for example, in addition to the time extension process by the occupation of the base, the time reduction process by a predetermined condition may be executed. For example, each time the player character of the defense team defeats one (or more) player characters of the attack team, a predetermined time may be subtracted from the current play time.

In this embodiment, the game processing in the computer system in which the server and the game apparatus are connected via the network has been described. However, the present invention can be applied to other forms of the computer system. For example, when a plurality of game devices are connected via a network in a master-slave relationship, the master game device may perform the game processing of the present invention. The present invention can also be applied to a case where a plurality of controllers are connected to one game device, and players who operate each controller are divided into an attack team and a defense team, and in that case, the computer system is It takes the form of a single game device.

12: Game device, 14: Router, 22: Internet, 30: Server, 31: Database server, 32: Matching server, 33: Game server, 34: Access server

Claims

A program that can be executed in a computer game system in which a plurality of players are divided into an attack side and a defense side and operate a character in a virtual space to play a battle game,
A durability value acquisition means for acquiring a durability value that is arranged in the virtual space and indicates a durability level of an object that is an attack target on the attack side and a defense target on the defense side, and varies depending on the attack on the attack side;
Condition determining means for determining whether or not the variation of the durability value accompanying the progress of the battle game exceeds the first reference value, and further whether or not the progress status of the battle game satisfies the first condition;
The initial value of the play time of the battle game is set, the play time is sequentially counted down as the battle game progresses, and if it is determined by the condition determination means that the first condition is satisfied, Play time calculation means for adding a predetermined time to the time,
If it is determined by the condition determining means that the variation in the durability value has reached the first reference value, it is determined that the attacker has won, and the variation in the durability value has not reached the first reference value. Victory determination means for determining that the defense side has won when the countdown by the play time setting means is completed,
As a program for functioning a computer game system.
The program according to claim 1,
In the case where the play time countdown ends without the variation in the durability value reaching the first reference value, the victory determination means has a variation in the durability value at the end that is less than the first reference value and When it is equal to or greater than a second reference value smaller than the first reference value, it is determined that the defense side is a normal victory, and when the endurance value variation at the end is less than the second reference value, A program characterized by a special victory on the defense side.
The program according to claim 1 or 2,
In the case where it is determined that the variation of the durability value has reached the first reference value, the victory determination means has a remaining play time that is less than the first reference time when the first reference value is reached. If there is, it is determined that the attack is a normal victory, and if the remaining play time when the first reference value is reached is greater than or equal to the first reference time, it is determined that the attack is a special victory. A featured program.
A program according to any one of claims 1 to 3,
The first condition is that a numerical value relating to the superiority or inferiority of the attacker and the defense in a predetermined area in the virtual space is a predetermined value indicating that the attacker is superior to the defense A program characterized by being.
A program according to claim 4, wherein
If a plurality of areas are set, the condition determination means determines the first condition in a predetermined first area and determines that the first condition in the first area is satisfied. Then, a program for determining the first condition in a predetermined next area.
A program according to claim 5, wherein
In the virtual space, the attacking base coordinates are set in advance,
The area is set in ascending order of distance from the attacking base coordinates.
A program according to any one of claims 1 to 4,
The condition determining means determines whether or not the progress of the battle game satisfies the second condition;
The play time calculating means subtracts a predetermined time from the current play time when the condition determining means determines that the second condition is satisfied.
The program according to claim 7, wherein
The program according to claim 2, wherein the second condition is a state in which the defending character defeats the attacking character a predetermined number of times in the virtual space.
In a computer game system in which a plurality of players are divided into an attack side and a defense side and operate a character in a virtual space to play a battle game,
Endurance value acquisition means for acquiring a durability value that is arranged in a virtual space and indicates a durability level of an object that is an attack target on the attack side and a defense target on the defense side, and varies depending on the attack on the attack side;
Condition determining means for determining whether or not the variation of the durability value accompanying the progress of the battle game exceeds the first reference value, and further whether or not the progress status of the battle game satisfies the first condition;
The initial value of the play time of the battle game is set, the play time is sequentially counted down as the battle game progresses, and if it is determined by the condition determination means that the first condition is satisfied, Play time calculation means for adding a predetermined time to the time;
If it is determined by the condition determining means that the variation in the durability value has reached the first reference value, it is determined that the attacker has won, and the variation in the durability value has not reached the first reference value. And a victory determination means for determining that the defense side has won when the countdown by the play time setting means is completed.