JP3451064B2 - Game machine using computer and storage medium for realizing the same - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION The present invention provides a suitable way of thinking in order to execute a game to compete for storing power on the computer
The present invention relates to a realized game machine and a storage medium .

[0002]

2. Description of the Related Art Various game machines for playing a battle game (for example, shogi or Othello) between an actual player and a virtual player operated by a computer have been conventionally provided. In those games, the play content of a virtual player is determined according to a predetermined thinking algorithm.

[0003]

By the way, as a game in which players compete for memory, each of a plurality of players is made to select a numerical value within a predetermined number from a numerical value in a predetermined range (for example, 1 to 30) in a predetermined order. A game is considered in which, when a player again selects a value already selected, that player is excluded from the game as a loss, and the last remaining player wins. This kind of game has the advantage that the rules are simple and easy to understand, and various players can play it easily.

However, in order to realize such a game using a computer, it is indispensable to introduce a virtual player controlled by a computer in addition to the actual players in order to increase the number of players. is there.

Therefore, the present invention is a game that realizes a suitable thinking method when a virtual player controlled by a computer selects an option from a predetermined range.
A computer and a storage medium are provided.

[0006]

The present invention will be described below. In addition, in order to facilitate understanding of the present invention, reference numerals in the accompanying drawings are added in parentheses, but the present invention is not limited to the illustrated forms.

According to the present invention, a plurality of players each including one or more real players and virtual players controlled by a computer select any one of a plurality of options included in a predetermined range. However, it is used to realize a game in which whether each player's choice is already selected or not,
A game machine in which the computer (16) determines the options selected by the virtual player, and means (S3, S7) for storing the options selected by each player in association with their selection order; Means for deciding whether or not the option has been selected with a predetermined probability by referring to the contents stored by the storing means , assuming an option specified by a virtual player ( S101, S102), and means for determining the option as the option selected by the virtual player when it is determined that the assumed option is not selected (S1).
04) and, in the means for storing, the option
Select a predetermined number of 2 or more in multiple hierarchies according to the selection order
It is stored separately for each limb.
The error probability is increased so that
The probability that an error will occur is set, and in the means for judging,
Refer to the probability of the error set for each layer.
Therefore, the older the selection order is,
That the probability the feature and be Ruge over beam machine that the Selected whether a determination is made such that the higher solves the problems described above.

According to the present invention, the selected options are stored in association with their selection order, and the options having the older selection order, in other words, the options selected in the past are erroneously determined to be unselected and are again selected. The probability of being selected by a virtual player increases. In this way, as the game progresses, the virtual player forgets the options selected in the past, so that it is possible to reduce the creativity in selecting the options by the computer and enhance the interest of the game.

[0009]

In the game machine of the present invention, the probability that the same error will occur is set for a predetermined number of two or more choices recorded in the same hierarchy. Therefore, it is possible to reduce the amount of processing to be performed by the computer within a reasonable range as compared with the case where the probabilities of the errors are individually set according to the selection order of each of the options. That is, even if the probability that the error occurs is set individually for each option while changing, the change in the probability between a group of options adjacent to each other in the selection order is slight, and the probability is changed individually. There is little real benefit. Further, if the probability change for each numerical value is set to such an extent that it can be felt in the game, there is no choice but to set a certain range in which the probability changes between a pair of adjacent options in the selection order. However, since the probability that an error occurs is finite between 0% and 100%, there is a limit to the range in which the probability changes, and there is a possibility that sufficient differentiation cannot be achieved depending on the number of options. Therefore, by classifying into a hierarchy for each of a predetermined number of two or more choices and setting a probability that an error will occur for each hierarchy, a sufficient range of change in the probability between the hierarchies is secured and the influence of the stochastic operation is obtained. While realizing the above, it is possible to reduce the amount of processing that the computer should perform.

[0011] Oite this onset Ming is the game configured to select the virtual player from a plurality of characters prepared in advance, the ability on the probability that the error occurs set to each character In the means for determining whether or not the character has been selected, the probability of the error set for each layer and the ability set for the character selected as the virtual player are referred to. Then, it may be determined whether or not the assumed option has been selected.

By thus setting the ability for each character and correcting the probability of the error set for each layer according to the ability, a character with excellent memory ability or a character with poor memory ability is virtualized. Can be made to appear in the game as an active player, and the difficulty level of the game can be changed. Which character to select as a virtual player may be determined based on an instruction from an actual player, or may be automatically selected by a game program.

Further, Oite the present onset bright, wherein the character for each capacity is set a plurality of levels, the number of the level is set larger than the number of the hierarchical desirable.
If the number of layers is specified more finely than the number of levels of abilities, even if the probability that the above error occurs is corrected based on the ability of each character, the change in the probability of each layer will appear more clearly in the game. This is because there is a possibility that the individuality regarding each memory ability may not be sufficiently expressed.

The present invention can also be expressed as a computer-readable storage medium recording a program for realizing the above-mentioned game machine .

That is, in the storage medium of the present invention, a plurality of players each including one or more actual players and virtual players controlled by a computer select one from a plurality of options included in a predetermined range. Which is a storage medium used to realize a game in which each option is selected and whether or not each player's selected option is already selected, the virtual player selects an option. A storage medium (1) in which a program for computer determination is recorded
In 5) , the program is the computer.
And means for storing in association with their selection order of the selected options by each player (S3, S7), assuming the option the virtual player to specify the contents stored in said means for storing With reference to the means (S101, S102) for determining whether or not the option has been selected so that an error occurs with a predetermined probability, and when the assumed option is determined to be unselected, Hands that virtual players decide as the choice
A stage (S104) , configured to function as
In the means for storing, the options are duplicated according to the selection order.
It is divided into a number of layers and stored for each of a predetermined number of choices of 2 or more.
The older the selection order is, the higher the probability that the error will occur.
The probability that the above error will occur is set for each layer.
In the means for judging , the setting is made for each layer.
Options with old selection order with reference to the probability of error
It is characterized in that it is judged whether or not the selection has been made so that the probability of erroneously judging as unselected becomes higher .

[0016] Also in the storage medium of the present invention, the game is configured to select the virtual player from a plurality of characters which are prepared Me pre ability on the probability that the error occurs is set in each character In the means for judging whether or not the character has been selected, the probability of the error set for each layer and the ability set for the character selected as the virtual player are referred to. It may be determined whether or not the assumed option has been selected. A plurality of levels may be set for the ability for each character, and the number of levels may be set to be larger than the number of layers.

[0017]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment in which the present invention is applied to a home game machine will be described with reference to FIGS. FIG. 1 is a functional block diagram of a home-use game machine. This home-use game machine executes a predetermined game in accordance with a game program recorded in a CD-ROM 15 as a storage medium. The game system includes a CPU 1 mainly composed of a microprocessor, a ROM 2 and a RAM 3 as a main storage device for the CPU 1, and a CPU.
1. An image processing device 4 and a sound processing device 6 which perform a process suitable for image processing and audio processing based on an instruction from 1.
And buffers 5 and 7 functioning as temporary storage means of these devices 4 and 6, and a CD-ROM reader 8. An operating system as a program necessary for controlling the overall operation of the game machine is written in the ROM 2. The RAM 3 has a CD-ROM as a storage medium.
The game program and data read from 15 are written as necessary. The image processing device 4 receives the image data from the CPU 1, develops the image data corresponding to the game screen on the frame buffer 5, converts the drawn image data into a predetermined video reproduction signal, and monitors it at a predetermined timing. Output to 9. The sound processing device 6 reproduces data such as voice and tone data and sound source data read from the CD-ROM 15 and recorded in the sound buffer 7 and outputs them from the speaker 10. CD
-The ROM reading device 8 follows the C instruction according to the instruction from the CPU 1.
The program or data recorded on the D-ROM 15 is read and a signal corresponding to the read content is output. The CD-ROM 15 stores programs and data necessary for executing the video game according to the present invention.
A home-use television receiver is generally used as the monitor 9, and a built-in speaker of the television receiver is generally used as the speaker 10.

Further, a communication control device 11 is connected to the CPU 1 via a bus 14, and a controller 12 and an auxiliary storage device 13 are detachably connected to the device 11. The controller 12 functions as an input device in the game system, and is provided with an arrow key 12a and a plurality of push button switches 12b used for selecting a direction, for example, as operation members for receiving an operation by the player. Communication control device 1
1 is a fixed cycle (for example, 1/60 second) of the controller 12
Scan the operation state of the
Output to PU1. The CPU 1 determines the operation state of the controller 12 based on the signal. Controller 12
A plurality of auxiliary storage devices 13 can be connected to the communication control device 11 in parallel.

In the above structure, the monitor 9, the speaker 10, the controller 12, the CD-ROM 15 and the other components other than the auxiliary storage device 13 are integrally housed in a predetermined housing to form the game machine main body 16. . The game machine body 16 functions as a computer.

FIG. 2 shows an outline of the game realized by the game program recorded in the CD-ROM 15. This game is played with multiple players participating. FIG. 2 assumes that four players A to D participate. For each player A-D,
As an option, a number for selecting any number from a predetermined range of numerical values (for example, 30 numerical values from 1 to 30) to two at the same time is cycled in a predetermined order. In the following, the act of selecting this numerical value is called a call. However, when calling two numbers, they must be consecutive numbers.

The first round ends when it is the turn to call a numerical value starting from player A to player D. After that, the numbers will be called again from Player A to Player D in order. Thereafter, similarly, each player sequentially calls a numerical value to progress the game.
In the example of FIG. 2, in the first round, player A calls 28, player B is 18, player C is 8, player D is 20, and player A is 16, 1 in the second round.
7, Player B calls 25, 26, Player C calls 6, Player D calls 3, respectively, and Player A 23, 24, Player B 19, Player C in the third round
14 and player D are calling 22 respectively.

The numbers that the player calls are limited to those that no one has yet called. If a player mistakenly calls a number that has already been called, that player loses and is removed from the game. In this way, the number of players gradually decreases, and the last remaining player wins.

In the above game, in addition to the actual player operating the controller 12 to participate in the game, a virtual player controlled by the CPU 1 may participate in the game. In order to determine the numerical value to be called by the virtual player, the CPU 1 stores the called numerical value in a predetermined area of the RAM 3 as shown in FIG. That is, as shown in FIG. 3, the CPU 1 stores the numerical value called by each player by dividing it into 8 levels of depth (hierarchy) according to the order of calling regardless of which player called. Hereinafter, the data created according to the procedure of FIG. 3 is referred to as selection determination data for convenience.

Up to four numerical values are stored in each layer. When a new number is called, it is recorded in the shallowest hierarchy (depth of memory 1). If four numerical values are already recorded in the layer at the time of the recording, the numerical value that is called first among the four numerical values is moved to the next layer. In the same manner, each time the numerical value is called, the stored contents are updated, and the called numerical value is gradually copied to a deeper hierarchy. Although the selection judgment data of FIG. 3 shows an example when all 30 numerical values are called, the first called numerical value 28 and the second called numerical value 18 are the deepest eighth layer. 4 numbers, 8, 20, 16 stored in
17 is stored in the 7th layer, and so on, and the like, and the like, the numbers that have been called up to the shallowest layer are stored.

The memory depth in the selection determination data of FIG. 3 is associated with the degree to which the virtual player forgets whether or not the called numerical value has been called (forgotten degree). That is, the forgetting degree is set in advance for each layer, and the forgetting degree increases as the depth of memory increases. In other words, the deeper the memory depth, the higher the probability of erroneously determining that it has not been called. In other words, the forgetting degree corresponds to the probability that the computer determines that the numerical value that has already been called is not called by mistake.

In this game, a plurality of characters are prepared as virtual players controlled by the computer. Then, in order to express the memory-related individuality of each character, an ability regarding the degree of forgetting is set for each character. Multiple levels of ability are set,
The higher the level, the more the forgetting level is corrected to a relatively small value. In other words, the higher the ability level of a character, the lower the probability of erroneously determining that the called numerical value has not been called.

FIG. 4 is a graph showing an example of the relationship between memory depth and forgetfulness. In this example, 10 levels (ability values) of 1 to 10 are prepared as the ability of the character, and the ability value 10 is the most excellent in memory. However, in the figure, only the forgetting degree when the ability value is 3 and the ability value is 10 is illustrated. The line of the ability value 0 indicates the forgetting degree when the forgetting degree based on the ability value is not corrected. That is, the line with the ability value 0 indicates the forgetting degree set for each memory depth in FIG. However, although the ability value 0 is shown by a curve in FIG. 4, since a certain forgetting degree is actually set for each memory depth,
The graph of the ability value 0 may be drawn as a stepwise line whose value changes each time the memory depth changes.

In the example of FIG. 4, the number of levels of capability (10 in this case) is set to be larger than the number of hierarchies of storage depth (8 in this case). The reason is that if the forgetting degree according to the memory depth is specified more finely than the level number of the ability, even if the forgetting degree is corrected based on the ability of each character, the effect is difficult to appear, and the individuality of each character is sufficiently expressed. This is because there is a risk that it will not be possible.

FIG. 5 shows C for realizing the above-mentioned game.
It is a flow chart which shows the procedure of the game processing which PU1 performs. It should be noted that, for simplicity, this example shows a case where one real player and one virtual player participate in the game. Further, in the process of FIG. 5, the game is started by the actual player as the first strike, but which is the first strike may be selected by lottery at the start of the game.

When an actual player performs a predetermined game start operation on the controller 12, a predetermined initial setting process, for example, a process of initializing the selection determination data of FIG. 3 or a character as a virtual player is performed by the actual player. A selection process is performed based on the instruction from the.
When those processes are finished, the game process of FIG. 5 is started. In the game process, it is first determined whether or not an actual player has called a numerical value (step S1). The actual player call is, for example, 1 to 1 in the selection range.
It is realized by displaying 30 on the monitor 9 and selecting a numerical value to be called from the monitor 9 by operating the controller 12. However, no information is displayed on the monitor 9 as a clue for determining whether each of the numerical values 1 to 30 has been called.

Next, it is judged whether or not the numerical value called in step S1 has been called by referring to the selection judgment data of FIG. 3 (step S2). Separately from the data of FIG. 3, a flag or the like for identifying whether each numerical value has been called may be used to determine whether it has been called, but here, according to the selection determination data of FIG. The explanation will be continued assuming that the call has been completed.

If the call has not been made in step S2, the data relating to the called numeric value is updated to include the numeric value called in step S1 (step S3).
Next, it is judged based on the selection judgment data of FIG. 3 whether or not there is a numerical value not called among the numerical values 1 to 30 (step S4). When there is a numerical value that has not been called, it is the virtual player's turn to call the numerical value, and the numerical value to be called by the virtual player is selected according to a predetermined procedure (step S5).
After that, it is determined in step S whether the selected numerical value has been called.
If the judgment is made in the same manner as 2 (step S6) and it is judged that the call has not been completed, the selection judgment data of FIG. 3 is updated so as to include the numerical value selected in step S5 (step S7). . Next, of the numerical values from 1 to 30,
It is judged based on the selection judgment data of FIG. 3 whether or not there is a numerical value that has not been called (step S8).
If there is a numerical value that has not been called, the process returns to step S1.

According to the above processing, the actual player and the virtual player alternately call the numerical values. Then, when the actual player calls the already-called numerical value, step S2 is affirmed, and in step S10, the actual player is treated as a loser and processing is performed to end the game. On the other hand, if the virtual player calls the already called numerical value, step S6 is affirmed, and step S6
At 11, the virtual player (computer) determines that the game is lost and the process is performed to end the game. 1 because the actual player called a number that was not called
When all the numerical values from 30 to 30 have been called, step S4 is affirmed, and in step S12 the actual player wins and the processing is performed, and the game ends. If all the numerical values 1 to 30 have been called because the virtual player has called a numerical value that has not been called, step S8 is affirmed, and the virtual player (computer) wins in step S13. The process ends and the game ends.

As described above, when it is determined in step S2 and step S6 whether or not a call has been made and in step S4 and step S8 whether or not there is an uncalled numerical value, respectively, The selection determination data of No. 3 is referred to, but the memory depth of each numerical value is not taken into consideration at that time. That is, in steps S2 and S6, if the called numerical value is recorded, it is judged that the called numerical value has been reached regardless of the memory depth, and if the called numerical value is not recorded, it is judged that the numerical value has not been called. . Further, in steps S4 and S8, if two numerical values are recorded in the deepest layer, it is determined that there is no uncalled numerical value, and if not, it is determined that there is an uncalled numerical value.

FIG. 6 is a flow chart showing the procedure of the call numerical value selection processing executed by the CPU 1 as the subroutine processing (corresponding to step S5) of FIG. 5 for selecting the numerical value to be called by the virtual player. In this processing, first, one or two numerical values (however, in the case of two, consecutive numbers) are numerically tentatively selected, for example, at random (step S101), and whether the tentatively selected numerical value has been called. It is determined whether or not an error occurs with a predetermined probability (step S102). That is, whether or not the selected numerical value has been called is determined based on whether or not the same numerical value is recorded in the data of FIG. 3, but the temporarily selected numerical value exists in the data of FIG. In this case, using a predetermined arithmetic expression that takes into account the forgetting degree (see FIG. 4) that is determined by the depth of memory (hierarchy) in which the numerical value is stored and the ability set for the virtual player It is determined whether the numerical value has been called. The arithmetic expression is a probability corresponding to the forgetting degree, that is, if the forgetting degree is 50%, 5
It is configured to determine that the provisionally selected numerical value is not called with a probability of 0%.

If it is determined in step S102 in FIG. 6 that the call has been completed, another new numerical value is temporarily selected in step S103, and the process of step S102 is performed again. Then, if it is determined in step S102 that the call has not been completed, the value is determined as the value to be called by the virtual player in step S104. As a result, the process of FIG. 6 ends, and the process proceeds to step S6 of FIG.

The present invention is not limited to the above embodiment and may be implemented in various forms. For example, in the processing of FIGS. 5 and 6, the case where there is one real player and one virtual player has been described, but it is possible for any player to participate in a plurality. When three or more players participate, the order in which the numerical values are called is determined at the start of the game, and in the number called by the actual player, the processes of steps S1 to S4 are performed, and in the turn called by the virtual player. The processes of steps S5 to S8 may be executed respectively. The player who called the already called number can be excluded from the game, and the last remaining player can win.

In addition, even if the called numerical value is called, the player continues to participate in the game, and when all the numerical values are called, the number of times each player called the called numerical value is compared, and the person who has the smallest number of times May be won. In addition, the score of the game can be determined in various ways as long as the called numerical value is associated with whether or not it has been called. The present invention can be applied to not only home-use game machines but also game machines or game systems of various genres. For example, the present invention can be applied to a game system using an arcade game machine or a network.

In the above embodiment, in the data storing the called numerical values, four numerical values are recorded in one hierarchy, but the number of numerical values recorded in the same hierarchy may be variously changed. The forgetting level may be changed for each of a plurality of numerical values, or may be changed for each one of the numerical values. The number of numerical values recorded in the same layer may be changed according to the number of players so that the number of numerical values recorded in the same layer and the number of players participating in the game always match. In this case, regardless of the number of players, the forgetting degree of the already-called numerical value is changed for each division in which the selection of the numerical value makes one round. The number of numerical values recorded in the same layer may be changed according to the memory depth. For example, the deeper the memory depth, the smaller the number of numerical values recorded in the same layer. The options are not limited to numerical values and can be changed in various ways. For example, 26 letters of the alphabet may be selected. The storage medium is not limited to the CD-ROM, and various media may be used.

[0040]

As described above, according to the present invention, as the game progresses, the virtual player forgets the options selected in the past. , Can enhance the interest of the game.

[Brief description of drawings]

FIG. 1 is a functional block diagram of a home-use game machine to which the present invention is applied.

2 is a diagram showing an outline of a game executed on the game machine of FIG. 1. FIG.

FIG. 3 is a diagram showing how the CPU of FIG. 1 stores selected numerical values.

FIG. 4 is a diagram showing a relationship between memory depth and ability and forgetting degree.

5 is a flowchart showing a game process executed by the CPU of FIG.

FIG. 6 is a flowchart showing a call numerical value selection process executed as a subroutine process of FIG.

[Explanation of symbols]

1 CPU 3 RAM 9 monitors 12 Controller 15 CD-ROM (storage medium) 16 Game console (computer)

Continuation of the front page (56) Reference JP-A-8-323045 (JP, A) C MAZAZINE, Japan, Softbank Corp., April 1, 1992, Volume 4, No. 4, pages 111-115 DOS / V POWER REPORT T'96 April issue appendix, Japan, Impress Co., Ltd., April 1, 1996, p. 53 (58) Fields investigated (Int.Cl. ⁷ , DB name) A63F 13/00- 13/12

Claims (6)

(57) [Claims] 1. A plurality of players each including one or more of an actual player and a virtual player controlled by a computer select any one of a plurality of options included in a predetermined range, A game machine which is used to realize a game in which whether or not the choice selected by each player has been selected is associated with a score, and the computer determines the choice selected by the virtual player. A means for storing the selected options in association with their selection order and an option specified by the virtual player are assumed, and the option is selected by referring to the contents stored by the storing means . means for determining whether as an error occurs at a predetermined probability, was assumed choice is determined that unselected And a means for determining the option as the option selected by the virtual player, wherein the means for storing stores the option according to the selection order.
Stored in multiple hierarchies by dividing each by a predetermined number of 2 or more
The older the selection order, the higher the probability that the error will occur.
In this way, the probability that the error will occur is set for each layer.
In the judgment means , the error set for each layer is
The probability of occurrence of
Features and to Ruge over beam that the Selected whether a determination is made so that the probability to be determined incorrectly selected is high
Machine . 2. The game is configured to select the virtual player from a plurality of characters prepared in advance, and each character is set with an ability relating to the probability of making the error, and whether or not the character has been selected. <br/> by a means for determining the probability that the error which is set for each of the hierarchies is generated,
With reference to the capability set for character selected as the virtual player, according to claim 1, wherein the hypothesized alternatives, characterized in that the selection or not already is determined Game console . 3. The game machine according to claim 2 , wherein a plurality of levels are set for the abilities of each character, and the number of levels is greater than the number of layers. 4. A plurality of players, each including one or more actual players and virtual players controlled by a computer, select any one of a plurality of options included in a predetermined range, A storage medium used to realize a game in which whether or not each player's choice is already selected
In a storage medium in which a program for determining an option selected by the virtual player by the computer is recorded , the program is
Computer, means for storing the options selected by each player in association with their selection order, assuming the options specified by the virtual player, with reference to the contents stored by the storing means , A means for determining whether or not the option has been selected with an error with a predetermined probability, and when the assumed option is determined to be unselected, the option is selected as the option selected by the virtual player. The means for determining is configured to function as the means for determining, and the means for storing stores the options according to a selection order.
Stored in multiple hierarchies by dividing each by a predetermined number of 2 or more
The older the selection order, the higher the probability that the error will occur.
In this way, the probability that the error will occur is set for each layer.
In the judgment means , the error set for each layer is
The probability of occurrence of
A computer-readable storage medium , wherein whether or not the selection has been made is performed so that the probability of being erroneously selected is high . 5. The game is configured to select the virtual player from a plurality of characters prepared in advance, and each character is set with an ability relating to the probability of error, and whether or not the character has been selected. <br/> by a means for determining the probability that the error which is set for each of the hierarchies is generated,
5. The method according to claim 4 , wherein it is determined whether or not the hypothesized option has been selected with reference to the ability set for the character selected as the virtual player. Storage medium. 6. The storage medium according to claim 5 , wherein a plurality of levels are set for the ability for each character, and the number of levels is larger than the number of the layers.