JP7096024B2 - Pachinko machine - Google Patents

Description

The present invention relates to a gaming machine capable of playing a game.

As a gaming machine, a slot machine in which a predetermined number of bets are set and a variable display of a plurality of types of identification information is performed based on a start operation, or a gaming medium such as a gaming ball is launched into a gaming area by a launching device. There is a pachinko gaming machine or the like in which a plurality of types of identification information are variably displayed when a game medium wins a prize in a starting area such as a winning opening provided in the game area.

Further, in the gaming machine, the expected value of the given gaming value (for example, a medal, a gaming ball, etc.) can be controlled to an advantageous state larger than a predetermined state. In the gaming machine described in Patent Document 1,
The end condition of the advantageous state is satisfied when the expected value given in the advantageous state reaches the upper limit value. Further, the upper limit value includes a first upper limit value and a second upper limit value larger than the first upper limit value (Patent Document 1).

Japanese Unexamined Patent Publication No. 2007-325737

However, in the conventional gaming machine, the amount of data differs between the first upper limit value and the second upper limit value, and there is room for improvement in the processing of the first upper limit value and the second upper limit value.

The present invention has been conceived in view of such circumstances, and an object of the present invention is to provide a gaming machine capable of performing appropriate processing according to any of the first numerical value and the second numerical value.

(1) A gaming machine capable of playing games
Counters (eg AT counters, bonus counters) and
A setting means for setting a numerical value in the counter (for example, setting 100 as an upper limit as shown in FIG. 2) and
An update means for updating the counter value (for example, adding 100 games to 20 AT games as shown in FIG. 3), and
It is provided with a judgment means for making a specific judgment based on the numerical value of the counter (for example, it is judged that the bonus has ended when the bonus counter becomes 0).
Each counter consists of multiple areas that can store data (including, for example, high-order bytes and low-order bytes).
The plurality of regions includes a first region (for example, lower byte) and a second region (for example, upper byte).
The setting means is
The first numerical value represented by the data of both the first region and the second region (for example, "300" which is a value of 256 or more in decimal) and the data of the first region of the first region and the second region. A second numerical value that can be expressed only by (for example, "100" which is a value of 255 or less in decimal) can be set in the counter.
When setting the first numerical value in the counter, arithmetic processing targeting both the first area and the second area (for example, when 300 sheets are set as shown in FIG. 2A-2), the upper byte In the process of setting "00000001B" to the lower byte and setting "00101100B" to the lower byte, and when adding 300 games as shown in FIG. 3 (A-2), add "00000001B" to the upper byte. , Processing to add and set "00101100B" to the lower byte)
When setting the second numerical value in the counter, the arithmetic processing targeting only the first area of the first area and the second area (for example, when 100 sheets are set as shown in FIG. 2A-1). In the process of setting "01100100B" for the lower byte, and in the case of adding and setting 300 games as shown in FIG. 3 (A-2), "01100100B" is added and set for the lower byte). And run
When updating the numerical value of the counter, the updating means performs the updating process after the first numerical value is set by the arithmetic processing targeting both the first region and the second region, and the first region and the second. In any case where the update process is performed after the second numerical value is set by the arithmetic process targeting only the first area of the area, the update process is performed for both the first area and the second area.

According to such a configuration, it is possible to execute the process using the area corresponding to any one of the first numerical value and the second numerical value.

(2) In the gaming machine of (1)
When the setting means executes arithmetic processing for both the first region and the second region, the arithmetic processing for the first region and the arithmetic processing for the second region are performed. No other processing is executed between and (for example, as shown in (a) of FIG. 2 (A-2)).
No other processing is executed while the settings for both the high-order byte and the low-order byte are being executed.)
..

According to such a configuration, in the arithmetic processing for both the first region and the second region,
It is possible to prevent unintended calculation results.

(3) In the gaming machine of (1) or (2)
The first numerical value includes a plurality of values (for example, 101 to 300, which is the number of AT games given when the second condition of FIG. 4 is satisfied), and the plurality of values are the first region and the second region. Among them, a value that can be specified only by the numerical value set in the first area is included (for example, 101 to 3).
Of 00, 101 to 255 can be specified only by the lower byte).

According to such a configuration, when the first numerical value is set in the counter, the first region can be commonly used.

(4) In any of the gaming machines (1) to (3)
The first region and the second region have the same capacity (for example, both the upper byte and the lower byte are composed of 8 bits).

With such a configuration, it is possible to facilitate the handling of the area.

(5) In any of the gaming machines (1) to (4)
When the first numerical value is set in the counter by the setting means, it is determined whether or not the first numerical value is a valid numerical value, and the second numerical value is set in the counter by the setting means. Sometimes it is determined whether the second value is a valid value (eg, FIG. 2).
As shown in (c) of (A-1), when a numerical value is set for the lower byte, it is determined whether or not the numerical value after the setting is a valid numerical value, and FIG. 2 (A) -As shown in (c) of -2), even when a numerical value is set for the upper byte and the lower byte, it is further determined whether or not the set numerical value is a valid numerical value). Be prepared.

It is possible to prevent the numerical value set in the counter from becoming an unintended numerical value.

It is a schematic diagram which shows the whole structure example of a gaming machine. It is a figure which shows the process at the time of a bonus start of 1st Embodiment. It is a figure which shows the process of the AT game addition of 1st Embodiment. It is a figure which shows the processing according to each condition of the AT lottery condition. It is a figure which shows the process at the time of a bonus start of 2nd Embodiment. It is a figure which shows the process of the AT game addition of the 2nd Embodiment.

<First Embodiment>
[overall structure]
FIG. 1 is a schematic diagram showing an overall configuration example of the gaming machine of the first embodiment. FIG. 1A is a schematic diagram showing an example of a main appearance configuration of the gaming machine 1. FIG. 1B is a schematic diagram showing an example of the main internal configuration of the gaming machine 1.

As shown in FIG. 1A, the gaming machine 1 according to the present embodiment includes a liquid crystal display 51 and one or more speakers 53 capable of outputting various sounds as effect means for executing the effect. , One or more lamps 63 capable of emitting light in various embodiments. The liquid crystal display 51 functions as a display means for displaying an image. The speaker 53 functions as a sound output means for outputting sound. The lamp 63 functions as a light emitting means for emitting light. The lamp 63 may include a lamp provided in the housing of the gaming machine 1.

As shown in FIG. 1 (b), inside the gaming machine 1, a gaming control board 40 that controls the progress of the game and outputs various commands according to the progress of the game, and a predetermined effect according to the command. A staging control board 90 or the like for controlling the above is provided. The game control board 40 includes a main control unit 41 that performs processing related to the progress of the game and controls a configuration mounted or connected to the game control board 40. The effect control board 90 includes a sub control unit 91 that receives a command transmitted from the game control board 40 to perform an effect, and controls a configuration mounted or connected to the effect control board 90.

Further, the main control unit 41 includes a CPU (Central Processing Unit) 41a and a ROM (R).
It has an ead only memory) 41b and a RAM (Random access memory) 41c. Further, the sub control unit 91 has a CPU 91a, a ROM 91b, and a RAM 91c.

A player can start a game by betting a game value (for example, a medal) on the game machine 1. The gaming machine 1 includes a variable display unit (for example, a reel) capable of variablely displaying a plurality of types of identification information that can be identified by each, and after variable display of the variable display unit, the variable display of the variable display unit is stopped. This may be a slot machine capable of deriving a display result and generating a prize according to the display result.

When the game machine 1 is a slot machine, credits (the number of medals stored as the player-owned game value that can be used to set the bet number) are used according to the game state within the range. The MAXBET switch that is operated when setting the maximum number of bets (for example, 3) out of the specified number of bets, the start switch that is operated when starting the game, and the rotation of the reels, respectively. A stop switch that is operated when the player stops is provided so as to be operable by the player.

When the start switch is operated while the game can be started, an internal lottery for determining the display result to be derived is executed, and the three reels are rotated to display the symbol in a variable manner. This internal lottery is a process of determining whether or not any winning combination has been won. This internal lottery is also a process of determining a display result that allows derivation. And, in order to win the role, this role must be won by internal winning.

Then, when the three stop switches corresponding to each of the three reels are operated, the rotation of the corresponding reels is stopped, so that the three symbols are derived and displayed as display results in the upper, middle and lower stages of the fluoroscopic window 3. When the combination of winning symbols stops on the winning line and a winning occurs,
A predetermined number of medals are given to the player according to the winning, and the medals are paid out from the medal payout exit 9 when the credit is added or the credit reaches the upper limit number (50).

Further, the gaming machine of the present embodiment can be controlled to a specific state when a predetermined start condition is satisfied. Specific states include bonus states and AT states.

The start condition of the bonus state includes, for example, a condition that is satisfied by winning the bonus and deriving the display result combination corresponding to the selected bonus. The condition for starting the AT state includes a condition that is satisfied by winning the AT in the AT lottery. The condition for executing the AT lottery includes, for example, a condition that is satisfied by winning a predetermined combination (for example, a rare combination).

The end condition of the specific state includes a condition that is satisfied when the amount of the game value given in the specific state reaches the upper limit value. Gaming value includes medals or credits.

The bonus state is a state in which the probability that the derivation of the grant display result accompanied by the grant of the medal is allowed is higher than the non-bonus state which is not the bonus state. Therefore, the bonus state is advantageous to the player in that more medals are awarded than the non-bonus state. Further, the AT state is a state in which an operation mode advantageous to the player is notified. Here, the advantageous operation mode is an operation mode for deriving an advantageous display result that is not derived when the operation mode is different from the advantageous operation mode. The advantageous display result includes a grant display result accompanied by a medal grant and a transition display result for shifting to an advantageous state (for example, an advantageous RT state). Therefore, the AT state is more advantageous than the non-AT (non-AT state) in that an advantageous operation mode is notified. The bonus state of the slot machine of the present embodiment includes a first bonus state and a second bonus state which is more advantageous than the first bonus state.

An address is assigned to the RAM 41c. In this embodiment, the area from the first address to the fourth address, which will be described later, is used as a counter. This counter is composed of a plurality of areas including an AT counter and a bonus counter. The AT counter is a counter that manages (stores) the number of remaining AT games. The bonus counter is a counter that manages (stores) the number of remaining medals to be paid out of the bonus (hereinafter, also simply referred to as "the number of remaining medals to be paid out"). The AT is determined to have ended when it is determined that the number of remaining AT games managed by the AT counter has reached 0. The bonus is determined to have ended when it is determined that the remaining payout number managed by the bonus counter has reached 0.

Further, in the present embodiment, "B" is added at the end of the binary number expression. for example,
When the decimal number "100" is expressed in a binary number, it is "01100100B". For hexadecimal representation, add "H" at the end. For example, the address of the RAM 41c is expressed in hexadecimal, for example, "F300H". In this embodiment, 8-bit data (1 byte data) can be stored for 1 address.

The bonus counter and the AT counter are provided in separate areas. The bonus counter includes high-order bytes and low-order bytes. For example, the 1-byte data stored in the first address is
It is regarded as the upper byte of the bonus counter. The 1-byte data stored in the second address is regarded as the lower byte of the bonus counter. One byte of data stored in the third address is regarded as the upper byte of the AT counter. The 1-byte data stored in the 4th address is regarded as the lower byte of the AT counter. The second address is a value obtained by adding 1 to the first address. The third address is a value obtained by adding 1 to the second address. The fourth address is a value obtained by adding one to the third address. The fifth address is a value obtained by adding one to the fourth address. For example, the first address is F300H, the second address is F301H, the third address is F302H, the fourth address is F303H, and the fifth address is F304H.

As described above, in the present embodiment, both the bonus counter and the AT counter are said to have a larger address value in the lower byte than in the upper byte. As a modification,
At least one of the bonus counter and the AT counter may be configured such that the numerical value of the address is larger in the upper byte than in the lower byte. Further, in the present embodiment,
The bonus counter and the AT counter have a common area, but as a modification, the bonus counter and the AT counter may have different areas. Also, the bonus counter and A
The T counter is also collectively referred to as a counter.

Further, as a process using the counter, a process of setting a numerical value in the counter (for example, FIG. 2).
Processing) and processing for updating the numerical value of the counter (for example, processing in FIG. 3). note that,
The concept of "processing of setting a numerical value in a counter" may include the concept of "processing of updating a numerical value of a counter".

From the time the bonus is won to the time the bonus state starts (for example, when the bonus state starts), the upper limit value (initial value of the remaining payout number) is set in the bonus counter. When the first bonus state is executed, 100 cards are set in the bonus counter as the upper limit value, and when the second bonus state is executed, 300 cards are set in the bonus counter as the upper limit value. As described above, the upper limit value of the second bonus state is larger than that of the first bonus state. Therefore, the second bonus state is advantageous to the player because it can be controlled for a longer period than the first bonus state. Further, in the present embodiment, the maximum value of the upper limit value is predetermined, for example, 300 sheets. Therefore, as the upper limit value, a value of 301 or more is not set. Also, the number of AT games (
The maximum value of the number of AT remaining games) is predetermined, and is, for example, 500 games.

During the bonus, each time a grant display result accompanied by a medal grant is derived, the bonus counter is set so as to subtract the number of medals granted corresponding to the grant display result from the value set in the bonus counter. The value is subtracted and updated. Then, when the value set in the bonus counter reaches the initial value (for example, 0), it is determined that the bonus has ended. The initial value is also called initial data.

Further, during AT, every time a predetermined number of games (for example, one game) is consumed, the number of AT games set in the AT counter is subtracted and updated so as to be subtracted from the number of AT games set in the AT counter. .. Here, in the present embodiment, when a numerical value is not set in the upper byte in the AT counter and a numerical value is set in the lower byte (for example, 100 games are set as the number of remaining AT games in the AT counter). If there is), and if a numerical value is set for both the high-order byte and the low-order byte in the AT counter (if any)
For example, when 300 games are set as the number of remaining AT games in the AT counter)
In spite of any of the above, subtraction update is executed for the upper byte and lower byte. Further, when the decimal number "1" is converted into a binary number, it becomes "00000001B".
Specifically, in the process of subtracting and updating one game from the AT counter, the address (third address) of the upper byte of the AT counter is specified as the subtraction instruction, and "0" is set to the specified address.
This is a process of subtracting and updating "0000001B", designating the address (fourth address) of the lower byte of the AT counter, and subtracting and updating "00000001B" to the specified address. In addition, the upper byte is also updated according to the number of AT remaining games after subtraction.

Then, when the value set in the AT counter reaches the initial value (for example, 0), it is determined that the AT has ended. Further, when the AT is won in the AT lottery (AT addition lottery) executed during the AT, the number of AT games corresponding to the AT winning is added to the AT counter. Further, when the AT game is 0, the addition of the AT game is called "AT first hit".

[Processing related to bonus]
Next, the process related to the bonus will be described with reference to FIG. In the present embodiment, the upper limit corresponding to the bonus is set in the bonus counter at the start of the bonus (for example, when the start switch is operated in the first bonus game). The bonus counter of this embodiment is composed of 2 bytes (16 bits). These two bytes are composed of a high-order byte and a low-order byte. In addition, the information set in the high-order byte and the low-order byte may be referred to as "numerical value" or "data". Further, the counter is composed of a plurality of areas in which data can be stored. The plurality of regions include a first region as a low-order byte and a second region as a high-order byte.

Further, in the present embodiment, the upper limit of the bonus is 100 (the upper limit of the first bonus).
And 300 (the upper limit of the second bonus). Converting "100" to a binary number, "0"
It becomes "1100100B" and can be expressed by 8 bits (7 bits to be exact). That is, "10
A numerical value of 0 or more and 255 or less (hereinafter, also referred to as 0 to 255) including a numerical value such as "0" is 2
When converted to a base byte, it can be represented (represented or specified) only by the lower byte without using the upper byte. Considering the concept that "0000000000B" is set for the high-order byte, it can be said that the numerical value from 0 to 255 can be expressed (represented or specified) by the high-order byte and the low-order byte. In this embodiment, among the numerical values from 0 to 255, "100" is mainly used for explanation.

On the other hand, when "300" is converted into a binary number, it becomes "100101100B", which can be expressed by 9 bits. That is, when a numerical value from 256 or more to 65535 (hereinafter, also referred to as 256 to 65536) including a numerical value such as "300" is converted into a binary number, it can be expressed (represented or represented) by a high-order byte and a low-order byte. Specified). In this embodiment, 256 to
Of the numerical values up to 65536, "300" will be mainly used for explanation.

FIG. 2 (A-1) is a diagram showing a case where the first bonus is started, that is, 100 cards are set in the bonus counter as the upper limit value. This setting process is a process in which a numerical value is set in the lower byte, but a numerical value is not set in the upper byte. This 100 is a decimal number
Is converted into a binary number, and it becomes "01100100B". As described above, 100 sheets is a numerical value in which bits can be set only in the lower byte among the upper byte and the lower byte. Therefore, as shown in (A) of FIG. 2 (A-1), when 100 sheets are set, "0110" is set.
The arithmetic processing in which "0100B" is set is executed for the lower byte, and no arithmetic processing is executed for the upper byte (lower byte update control in FIG. 4 described later). Specifically, in the process of setting 100 cards in the bonus counter, for example, the address (second address) of the lower byte of the bonus counter is designated as a load instruction (LORD instruction or setting instruction), and the specified address is specified. 8-bit data "01100100B" corresponding to "100"
Is the process of setting. In this process, the high-order byte is not set. Further, it can be said that this process is, for example, a process of setting a numerical value in one register (for example, the A register). Further, as shown in (a) of FIG. 2 (A-1), no other processing is executed during this setting (during arithmetic processing).

Further, as shown in (c) of FIG. 2 (A-1), when this setting (arithmetic processing) is completed, whether or not the set value is a valid value (whether it is an abnormal value or not). Judgment processing to determine (whether or not) is executed. This determination process may include a process of determining whether or not 100 sheets are set for the upper byte even though the value is displayed in the lower byte. Further, in this determination process, the set value is the maximum value of the upper limit value (301 in the present embodiment).
Sheet) It may include a process of determining whether or not it is more than or equal to. This determination process may be another process as long as it is determined whether or not the set value is a valid numerical value. If it is determined by this determination process that the numerical value is not valid, for example, error processing may be executed. The error processing is a processing for notifying that an error has occurred, that is, that the set numerical value is not a valid numerical value.

FIG. 2A-2 is a diagram showing a case where the second bonus is started, that is, 300 cards are set as the upper limit value in the bonus counter. This setting process is a process of setting numerical values in the upper byte and the lower byte. When this 300, which is a decimal number, is converted into a binary number, it becomes "100101100B". As described above, 300 sheets is a value at which bits can be set for the high-order byte and the low-order byte. Therefore, when 300 sheets are set, the arithmetic processing in which "00101100B" is set is executed for the lower byte, and "0" is executed.
The arithmetic processing in which "0000001B" is set is executed for the high-order byte (FIG. 4 described later).
Upper / lower byte update control). Therefore, as shown in (A) of FIG. 2 (A-2), both the upper byte and the lower byte are set. Specifically, in the process of setting 300 cards in the bonus counter, the address (first address) of the upper byte of the bonus counter is specified as a load instruction (setting instruction), and "00000001B" is added to the specified address. Set,
This is a process of designating the address (second address) of the lower byte of the bonus counter and setting "00101100B" to the designated address. Further, this process is, for example, H.
It can be said that it is a process of setting a numerical value in the L register.

Further, as shown in (a) of FIG. 2 (A-2), no other processing is executed during this setting (during arithmetic processing). Further, in the present embodiment, the setting to the upper byte and the setting to the lower byte are executed together (for example, at the same time). That is, other processing is not executed during the setting to the upper byte and the lower byte that are executed at the same time.

Further, as shown in (c) of FIG. 2 (A-1), when this setting (arithmetic processing) is completed, a determination process for determining whether or not the set value is a valid numerical value is executed. Will be done. In this determination process, a process of determining whether or not the set value is equal to or greater than the maximum value of the upper limit value (301 sheets in the present embodiment) is executed. If it is determined by this determination process that the numerical value is not valid, for example, error processing may be executed.

Next, the subtraction update during the bonus will be described. During the bonus, every time a medal is given, the number of medals given is subtracted and updated from the upper limit value (remaining number of payouts) set at the start of the bonus. For example, when a small winning combination that pays out eight medals during a bonus wins, a process of subtracting and updating "8" from the value set in the bonus counter is executed. Here, in the present embodiment, a numerical value is not set in the upper byte in the bonus counter, and the value is not set.
And regardless of whether a numerical value is set in the lower byte (for example, when 100 sheets are set as the upper limit) or when a numerical value is set in both the upper byte and the lower byte in the bonus counter. Instead, the subtraction update is executed for the high-order byte and low-order byte. Also, when the decimal number "8 sheets" is converted to a binary number, "000"
It becomes "01000B". Specifically, the process of subtracting and updating 8 cards from the bonus counter is
As a subtraction instruction, specify the address of the upper byte of the bonus counter (first address), subtract and update "0000000000B" to the specified address, and specify the address of the lower byte of the bonus counter (second address). , "0000100" at the specified address
This is a process of subtracting and updating "0B". In addition, the upper byte is also updated according to the remaining number of payouts after subtraction.

FIG. 2B is a diagram for explaining processing when bonuses such as the first bonus and the second bonus are completed. As shown in FIG. 2B, a determination process for determining whether or not both the high-order byte and the low-order byte are set to "0000000000B" is executed, and both the high-order byte and the low-order byte are set to "0000000000B". When it is determined that there is, it is determined that the bonus has ended. Further, this determination process is executed every time the display result is derived. Further, as a modification, this determination process may be executed when the bonus counter is decremented and updated. With such a modification, the execution frequency of the determination process can be reduced as compared with the slot machine that executes the determination process each time the display result is derived, so that the processing amount can be reduced.

In this embodiment, the counter is set to "0000000000B" even when the number of medals awarded exceeds the upper limit. For example, in the second bonus where the upper limit is 300, the number of medals awarded is 296, and when a small winning combination that pays out 8 medals wins, the number of medals awarded is 304, but the counter is , "0000000000B".
[Processing related to AT]
Next, the process related to AT will be described with reference to FIG. “G” in FIG. 3 indicates “the number of games”. In the present embodiment, the number of AT games corresponding to the AT is set in the counter at the start of the AT. Further, in the example of FIG. 3, a case where the added AT game is 100 games and a case where the added AT game is 300 games will be described. Further, in the example of FIG. 3, it is assumed that the number of AT games before being added is 20 games. Number of AT games (
The number of AT remaining games) can be either 0 to 255 games (that is, can be expressed by lower bytes) or 256 games or more (that is, can be expressed by upper bytes and lower bytes). There may be. Therefore, in the present embodiment, as shown for the 20 games on the left side of FIG. 3 (A-1), the number of AT games is managed (stored) by using the upper byte and the lower byte. As a result, the number of AT games (the number of remaining AT games) is 0 to
If it is one of 255 games (that is, if it can be expressed in lower bytes) and 256
It can be managed in common in any case of the game or higher (that is, the case where it can be expressed by the upper byte and the lower byte).

FIG. 3 (A-1) is a diagram showing that when the current AT game is 20 games, 100 AT games are added to the 20 games. When this 100, which is a decimal number, is converted into a binary number, it becomes "01100100B". in this way,
In 100 games, a bit can be set only in the lower byte among the upper byte and the lower byte. Therefore, as shown in (a) of FIG. 3 (A-1), when 100 games are added and added, the arithmetic processing in which "01100100B" is added and set is executed for the lower byte, and the upper byte is subjected to the arithmetic processing. No arithmetic processing is executed. In addition, A after addition
When the number of T games is 255 or more (value expressed by the upper byte and the lower byte), the upper byte is also updated according to the number of AT games after the addition. The addition setting is also referred to as "update". Specifically, in the process of updating the value of the AT counter (20 games) for 100 games, for example, the address (fourth address) of the lower byte of the AT counter is specified as an addition instruction (ADD instruction). This is a process of adding and setting 8-bit data "01100100B" corresponding to "100" to the designated address. In this process, the high-order byte is not added and set.

Further, as shown in (a) of FIG. 3 (A-1), no other processing is executed during this setting (during arithmetic processing). Further, as shown in (c) of FIG. 3 (A-1), this setting (arithmetic processing)
When is completed, a determination process for determining whether or not the set value is a valid numerical value is executed. In this determination process, the value set for addition is the maximum value of the upper limit value (500 in this embodiment).
Game) It may include a process of determining whether or not it is the above. If it is determined by this determination process that the numerical value is not valid, for example, error processing may be executed.

FIG. 3 (A-2) is a diagram showing that when the current AT game is 20 games, 300 AT games are added to the 20 games. When this 300, which is a decimal number, is converted into a binary number, it becomes "100101100B". As described above, in the 300 game, the bit can be set for the high-order byte and the low-order byte.
Therefore, as shown in (a) of FIG. 3 (A-2), when 300 games are added and added, the arithmetic processing in which "00101100B" is added and set is executed for the lower byte, and "00000001B" is displayed. The arithmetic processing to be added is executed for the high-order byte. Therefore, as shown in (A) of FIG. 2 (A-2), addition is set to both the upper byte and the lower byte. Specifically, for 300 games against the value of the AT counter (20 games),
In the process of updating, for example, an address (third address) of the upper byte of the AT counter is designated as an addition instruction (ADD instruction), and "00000001B" is set to the specified address.
Is added, the address (fourth address) of the lower byte of the AT counter is specified, and "00101100B" is added and set to the specified address.

Further, as shown in (a) of FIG. 3 (A-2), no other processing is executed during this setting (during arithmetic processing). Further, as shown in (c) of FIG. 3 (A-2), this setting (arithmetic processing)
When is completed, a determination process for determining whether or not the set value is a valid numerical value is executed. In this determination process, the value set for addition is the maximum value of the upper limit value (500 in this embodiment).
Game) It may include a process of determining whether or not it is the above. If it is determined by this determination process that the numerical value is not valid, for example, error processing may be executed.

FIG. 3B is a diagram for explaining the process when the AT ends. As shown in FIG. 3 (B), as shown in FIG. 3 (B), both the high-order byte and the low-order byte are "000000".
The determination process for determining whether or not it is "00B" is executed, and when it is determined that both the upper byte and the lower byte are "0000000000B", it is determined that the AT has ended.

[Addition setting control executed when an AT game is granted]
Next, the control executed when the AT game is given will be described. The case where the AT game is given includes both the case where the AT game is given by the first hit of the AT and the case where the AT game is given by adding the AT. The AT lottery conditions of the present embodiment include the first condition to the third condition. The first condition is a condition that is established when the first rare combination is won. In the AT lottery when the first condition is satisfied, if the AT is not won (that is, if the given AT game is 0), or if the AT is won, one of 1 to 100 games is an AT game. May be granted.

The second condition is a condition that is established when the second rare combination is won. In the AT lottery when the second condition is satisfied, there is no case where the AT is not won (the AT is always won), and by winning the AT, any one of 101 to 300 games is awarded.

The third condition is a condition that is established when the third rare combination is won. In the AT lottery when the third condition is satisfied, there is no case where the AT is not won (the AT is always won), and by winning the AT, one of 301 games to 400 games is awarded.

The winning probability of each rare role is 1st rare role> 2nd rare role> 3rd rare role. Since the number of AT games given differs depending on the type of the winning rare role, the player's attention can be drawn to the type of the winning rare role. The "lower byte addition setting control" in FIG. 4 is "control in which only the lower byte of the upper byte and the lower byte of the AT counter is added and set". The "upper / lower byte addition setting control" in FIG. 4 is "control in which the upper byte and the lower byte of the AT counter are added and set".

When the first condition is satisfied, if the AT is won, the lower byte addition setting control is executed for the AT counter, so that the addition setting is made only to the lower byte among the upper byte and lower byte of the AT counter. Control is performed. The "when adding 100 games" described with reference to FIG. 3 (A-1) indicates the time when the second condition of FIG. 4 is satisfied.

When the second condition is satisfied, the upper / lower byte addition setting control is executed for the AT counter, so that the control for addition setting to the upper byte and the lower byte of the AT counter is executed. A case where the second condition is satisfied and it is determined that 280 games (256 or more games) will be added will be described. When the decimal number 280 is converted into a binary number, it becomes "1000011000B", and the process of adding "00000001B" to the upper byte and adding "00011000B" to the lower byte is executed.

Next, a case where the second condition is satisfied and it is determined that 200 games (the number of games of 255 or less) will be added will be described. Converting 200, which is a decimal number, to a binary number, "
It becomes "11001000B", and the process of adding "11001000B" to the lower byte and setting the initial value (addition setting) to the upper byte is executed. In this embodiment, the initial value is "0000000000".

In this way, when the second condition is satisfied, the number of AT games granted is 101 to 255.
Regardless of whether it is one of the above or 256 to 300, it is commonly ranked high.
Executes low-order byte update control.

When the third condition is satisfied, the upper / lower byte addition setting control is executed for the AT counter, so that the control for addition setting to the upper byte and the lower byte of the AT counter is executed. In addition, "when adding 300 games" explained in FIG. 3 (A-2).
Indicates when the second condition of FIG. 4 is satisfied.

<Second Embodiment>
Next, the second embodiment will be described. Further, regarding the second embodiment, duplicate explanations may not be repeated for the same processing as that of the first embodiment.

FIG. 5 is a diagram showing the processing related to the bonus of the present embodiment, and FIG. 6 is a diagram showing the processing relating to the AT of the present embodiment.

Comparing FIG. 5 and FIG. 2, when 100 sheets are set as the upper limit value, only the lower byte is set in FIG. 2 as shown in FIG. 2 (A-1) (lower byte update control is performed). On the other hand, in FIG. 5, as shown in FIG. 5 (A-1), the upper byte and the lower byte are set (the upper / lower byte update control is executed). That is, in FIG. 5 (in the second embodiment), numerical values are set for the upper byte and the lower byte in both the case of setting 100 sheets and the case of setting 300 sheets. Also, 1
When setting 00 sheets, an arithmetic process (that is, an initialization process) in which an initial value is set is executed for the upper byte. In this embodiment, the initial value is "0000000000B". Further, when setting 100 sheets, the upper byte process for setting the initial value in the upper byte may be executed first, and then the lower byte process for setting the numerical value in the lower byte may be executed. As a modification, the low-order byte processing may be executed first, and then the high-order byte processing may be executed. Further, as a modification, the high-order byte processing and the low-order byte processing may be executed at the same time. In this way, when setting 100 sheets in the counter, data is set in the lower byte regarding the execution of the arithmetic processing.

Further, comparing FIG. 6 and FIG. 3, when 100 games are added and set as an AT game, in FIG. 3, as shown in FIG. 3 (A-1), only the lower byte is added and set, while the addition is set. In FIG. 6, as shown in FIG. 6 (A-1), addition is set to the upper byte and the lower byte. That is, in FIG. 6 (in the second embodiment), in both the case of setting the addition of 100 games and the case of setting the addition of 300 games, the numerical value is additionally set for the upper byte and the lower byte. .. Further, when 100 games are added and set, an initial value (0000000000B) is set in the upper byte. If the number of AT games after addition is 255 or more (value expressed by upper byte and lower byte),
The high-order byte after the initial value is set is updated according to the number of AT games after the addition.

Further, in the example of FIG. 4, in the first embodiment, when the number of games from 1 to 100 is added, the lower byte update control is executed, and the number of any of 101 games or more is set. It was explained that the upper / lower byte update control is executed when it is added. In the second embodiment, when any number of games of one or more games is added, the upper / lower byte update control is executed regardless of the number of added games.

<Effects of this embodiment>
Next, the effects produced by the first embodiment, the effects produced by the second embodiment, the effects commonly produced by the first embodiment and the second embodiment, and the like will be described.

[Effects produced by the first embodiment]
In the first embodiment, when the first numerical value (for example, 300 sheets or 300 games) is set in the counter, the calculation for the first area (for example, lower byte) and the second area (for example, upper byte). Execute processing (upper / lower byte update control). In the arithmetic processing, when 300 sheets are set as shown in FIG. 2 (A-2), the upper byte is "00".
This is a process of setting "000001B" and setting "00101100B" in the lower byte. Further, in the arithmetic processing, when adding and setting 300 games as shown in FIG. 3 (A-2), "00000001B" is added and set to the upper byte, and "0010110" is added to the lower byte.
This is a process for adding and setting "0B".

On the other hand, when the second numerical value (for example, 100 sheets or 100 games) is set in the counter, the arithmetic processing targeting only the first region of the first region and the second region is executed (lower byte update control). In the arithmetic processing, for example, when 100 sheets are set as shown in FIG. 2 (A-1), "01100100B" is set for the lower byte, and the process is not executed for the upper byte. Further, the arithmetic processing is 100 as shown in FIG. 3 (A-1).
When the game is added and set, "01100100B" is added and set for the lower byte, and the process is not executed for the upper byte.

According to such a configuration, when the first numerical value is set, the arithmetic processing for the first region and the second region is executed, and when the second numerical value is set, the first region and the first region are executed. Arithmetic processing is executed for only the second region out of the two regions. Therefore, since the processing using the area corresponding to either the first numerical value or the second numerical value is executed, the appropriate processing is executed according to either the first numerical value or the second numerical value. Can be done.

Next, when setting the second numerical value in the bonus counter (that is, when the bonus of the upper limit value 100 is started), it is not necessary to execute the arithmetic processing targeting the first region (upper byte) appropriately. , Explain the reason why you can control the bonus without making a mistake in the upper limit. FIG. 2 (B)
As shown in the above, the trigger for determining that the bonus has ended is the trigger that the numerical value is 0 for both the upper byte and the lower byte. Therefore, when the bonus controlled before the bonus of the upper limit value 100 (hereinafter, referred to as “previous bonus”) ends, the numerical value is 0 for both the upper byte and the lower byte. Therefore, this upper limit value 100
Even if the arithmetic processing for the upper byte is not executed when the bonus of is started, the numerical value of the upper byte is "0", so that the upper limit value can be controlled by the bonus without mistake. Can be done.

As a modification, the upper byte and the lower byte of the bonus counter may be initialized when a predetermined initialization condition is satisfied. This initialization condition is, for example, "
It may be the first condition that is satisfied when it is determined that the bonus has ended (see FIG. 2B). According to such a configuration, when it is determined that the bonus has ended, the value of the upper byte and the lower byte of the bonus counter is "0", but just in case, the upper byte and the lower byte are initialized. Will be done. As a result, compared to a slot machine that does not perform initialization at the end of the bonus, "a situation in which the values of the upper byte and the lower byte are set to" 0 "when the bonus ends" is more reliably generated. Can be done.

Further, when the initialization condition is set to the first condition and it is determined that the previous bonus has ended, the values of the upper byte and the lower byte are "0".
Compared to slot machines that do not perform initialization at the end of the bonus, you can manage the bonus more reliably and without mistaken upper limit.

Further, the predetermined initialization condition may include the second condition. The second condition may be, for example, a condition for initializing information that is different from any of the high-order byte and the low-order byte. The different information may include, for example, a bonus flag indicating that the bonus has been won. In the present embodiment, when the bonus is started, the bonus flag is stored in a predetermined area of the RAM. This bonus flag will be carried over until the bonus is won (until the bonus symbols are complete). This bonus flag is cleared by being initialized at the end of the game in which the bonus is won. That is, in the configuration including the second condition as the initialization condition, when the bonus flag is initialized, the upper byte and the lower byte of the bonus counter are also initialized.

Moreover, the initialization condition may include other conditions. The other condition may be, for example, a predetermined condition that is satisfied in at least one of the bonus, AT, and neither the bonus nor the AT state. Further, the predetermined condition may include, for example, a condition that is satisfied by executing a predetermined operation (for example, a third stop operation for stopping the third reel). Further, the predetermined condition may be a condition that is satisfied when the game ends.

[Effects produced by the second embodiment]
In the second embodiment, whether the counter is set to the first numerical value (for example, 300 sheets or 300 games) or the counter is set to the second numerical value (for example, 100 sheets or 100 games). , Executes arithmetic processing for the first area (for example, lower byte) and the second area (for example, upper byte) (upper / lower byte update control).

For example, when setting the first numerical value (300) in the counter, as shown in FIGS. 5 (A-1) and 6 (A-1), "00000001B" is set in the upper byte and the lower byte is set. “00101100B” is set. On the other hand, when setting the second numerical value (100) in the counter, as shown in FIGS. 5 (A-1) and 6 (A-1), "0000000000B" is set as the initial value in the upper byte. Set "01100100B" in the lower byte.

According to such a configuration, since the processing using the data corresponding to either the first numerical value or the second numerical value is executed, it is appropriate according to either the first numerical value or the second numerical value. Processing can be executed. Further, when the first numerical value is set, the initial value is set in the second area, and when the second numerical value is set, the arithmetic processing for the first area and the second area is executed. Therefore, when setting the first numerical value, it is possible to prevent an unintended numerical value, for example, "a numerical value that is set in both the first region and the second region" from being set in the counter. Also, when setting either the first numerical value or the second numerical value in the counter (
Or when updating), the processing can be standardized because the arithmetic processing for the upper byte and the lower byte is executed.

Further, in this second embodiment, a configuration in which the initialization condition is the first condition, that is, "a configuration in which the upper byte and the lower byte of the bonus counter are initialized when it is determined that the bonus has ended" is adopted. You may. In this case, for example, when it is determined that the controlled bonus (previous bonus) has ended before the bonus of the upper limit value 100, both the upper byte and the lower byte are initialized, but the bonus of the upper limit value 100 Is started, the upper byte initialized at the end of the previous bonus is further initialized (initial data is set), so the value of the upper byte is set to "0" more reliably. be able to.

As a further modification, it is not necessary to adopt the configuration in which the initialization condition is the first condition. In the second embodiment, for example, at the start of the bonus of the upper limit value 100, the high-order byte is initialized. Therefore, for the slot machine of the second embodiment that does not adopt the configuration in which the initialization condition is the first condition, the certainty that the value of the upper byte is set to 0 is the same as that of the slot machine of the first embodiment. Can be guaranteed.

[Effects commonly played by the first embodiment and the second embodiment]
(1) Further, as shown in FIGS. 2 (B), 3 (B), 5 (B), and 6 (B), either the first numerical value or the second numerical value is set in the setting area (1). For example, even if it is set to the counter), the end of a specific state (for example, bonus state, AT state, etc.) is terminated based on the numerical value set in the upper byte and the numerical value set in the lower byte. Judge (determine that a specific state has ended). For example, it is determined whether or not both the high-order byte and the low-order byte are "0000000000B". If it is determined that both the high-order byte and the low-order byte are "0000000000B", it is determined that the specific state has ended.

By determining the numerical value of only the high-order byte (for example, the high-order byte is "00000".
If it is judged that the bonus state (specific state) has ended (only by judging that it is 000B), the lower byte may not be 0, and in this case, the upper limit of the bonus has not been reached. Nevertheless, there is a risk that the bonus will end. Also, by determining the numerical value of only the lower byte (for example, the lower byte is "0000000000".
If it is judged that the bonus state (specific state) has ended (only by judging that it is "B"), the upper byte may not be 0, and in this case, the upper limit of the bonus has not been reached. Nevertheless, there is a risk that the bonus will end.

By determining the values of both the high-order byte and the low-order byte as in the present embodiment, it is possible to prevent the above-mentioned irrationality from occurring.

(2) Further, for example, as shown in (a) of FIGS. 2, 3, 5, and 6, for example, no other processing is executed while the numerical value is set in the counter. In particular, as shown in (a) of (A-2) of FIGS. 2, 3, 5, and 6, when the arithmetic processing for the first region and the second region is executed, the first operation is performed. No other processing is executed between the arithmetic processing targeting one area and the arithmetic processing targeting the second area. For example, as shown in (a) of (A-2) of FIGS. 2, 3, 5, and 6, other processing is executed while the setting for both the upper byte and the lower byte is being executed. do not do.

According to such a configuration, it is possible to prevent the calculation result of the calculation process for both the first region and the second region from becoming an unintended calculation result.

(3) Further, the first numerical value includes a plurality of values. In this embodiment, for example, the first numerical value is
Includes 101 to 300, which is the number of AT games given when the second condition of FIG. 4 is satisfied. The plurality of values include values that can be specified only by the numerical values set in the first region of the first region and the second region. For example, this identifiable value is a numerical value from 101 to 255 out of 101 to 300. These 101 to 255 can be specified only by the lower byte. Therefore, regardless of whether the number of AT games to be given is any of 101 to 255 or 256 to 300, the lower byte can be used in common, and the lower byte is set to be increased. can do.

Further, for example, when the second condition of FIG. 4 is satisfied, when any of the 101 to 255 games is given, the control of adding and updating to only the lower byte is executed, and 256 to 300 are executed.
It is also conceivable to execute a control to add and update to the upper byte and the lower byte when any part of the game is given. However, if such a configuration is adopted, the second
When the condition is satisfied, it is necessary to execute a specific process for specifying the number of AT games to be granted. The specific process is, for example, a process of whether the number of AT games to be given is any of 101 to 255 or 256 to 300. When such a specific process is executed, the amount of process may increase.

Therefore, in the present embodiment, when the second condition is satisfied, the number of AT games given is 101 to 2.
Regardless of whether it is any of 55 or 256 to 300, the upper / lower byte update control is executed in common. Therefore, since it is not necessary to execute a specific process, the amount of processing can be reduced.

(4) Further, the first region and the second region have the same capacity. For example, both the high-order byte and the low-order byte are composed of 8 bits.

According to such a configuration, it is possible to facilitate the handling of the area (setting process to the area) as compared with the slot machine having different capacities from the first area and the second area.

(5) Further, when the first numerical value is set in the setting area, it is determined whether or not the first numerical value is a valid numerical value, and when the second numerical value is set in the setting area, the second numerical value is determined. Determine if the number is a valid number. For example, (A) of FIGS. 2, 3, 5, and 6 respectively.
As shown in (c) of -1), when a numerical value is set for the lower byte, it is determined whether or not the numerical value after the setting is a valid numerical value. Further, as shown in (c) of (A-2) of FIGS. 2, 3, 5, and 6, even when the numerical values are set for the upper byte and the lower byte, the values are set after the setting. Determine if the number is a valid number.

Therefore, it is possible to prevent the numerical value set in the setting area from becoming an unintended numerical value regardless of whether the first numerical value is set in the setting area or the second numerical value is set in the setting area. can.

(6) Further, during AT and bonus, subtraction update processing in the counter (A)
In the subtraction update process of the number of remaining AT games in the T counter and the subtraction update process of the number of remaining bonus payouts in the bonus counter), either the first numerical value or the second numerical value is set in the counter (AT counter, bonus counter). Even if it is, the arithmetic processing is performed for the upper byte and the lower byte. Therefore, the subtraction update process can be standardized when the first numerical value is set in the bonus counter and when the second numerical value is set in the bonus counter.

[Modification example]
Although the main embodiments of the present invention have been described above, the present invention is not limited to the above embodiments, and various modifications and applications are possible. Hereinafter, a modified example of the above embodiment applicable to the present invention will be described.

(1) In the present embodiment, a slot machine is exemplified as a gaming machine. however,
The gaming machine does not have to be a slot machine, and may be, for example, a pachinko gaming machine.
In the pachinko gaming machine, a game can be played by launching a game medium, which is a game value used for playing a game, and driving it into a game area. When the gaming machine is a pachinko gaming machine, it is provided with a gaming handle for launching a gaming medium (for example, a pachinko ball) and driving it into the gaming area. Further, the specific state of the pachinko gaming machine is, for example, a big hit state.

The big hit state is a state in which a special area that cannot be passed in a state other than the big hit state can pass through (for example, a state in which an attacker is released). When the game ball passes through the special area, a predetermined amount of game medium is given.

The start condition of the big hit state is, for example, a condition that is satisfied when the game medium passes through a predetermined area, a big hit lottery triggered by the passage is executed, and it is determined that the big hit state is controlled by the big hit lottery. including.

The end condition of the specific state includes a condition that is satisfied when the amount of the game value given in the specific state reaches the upper limit value. The game value is, for example, a pachinko ball.

Further, the jackpot state includes a first jackpot state and a second jackpot state. For example, it is assumed that the upper limit of the first big hit state is 100 and the upper limit of the second big hit state is 300.
In such a configuration, when the first big hit state is started, the upper limit is 1.
When 00 is set in the counter and the second big hit state is started, the upper limit is 300.
Is set in the counter. Even with such a configuration, the same effect as that of the present embodiment can be obtained.

(2) Further, in the present embodiment, it has been described that the first area is 1 byte (lower byte) and the second area is 1 byte (upper byte). However, at least one of the first region and the second region may be another region. For example, in the first area and the second area, the second area may be the upper mbit and the first area may be the lower nbit for one byte (m, n).
Are both integers, and m + n ≦ 8). Further, m = n may be set, and m ≠ n may be set. Further, the capacities of the first region and the second region may be different.

(3) In the present embodiment, when setting numerical values for the upper byte and the lower byte (when executing the upper / lower byte update control), the setting for the upper byte and the setting for the lower byte are combined (when the upper byte update control is executed). For example, it was described as being executed at the same time. However, the first setting process for setting a numerical value in either the upper byte or the lower byte may be executed, and then the second setting process for setting the numerical value in the other may be executed. Even in this case, no other processing is executed during the period from the start of the first setting processing to the end of the second setting processing (corresponding to (a) in FIGS. 2, 3, 5, and 6). ). For example, the other processes are not executed during the first setting process and the second setting process. Further, during the period from the end of the first setting process to the start of the second setting process, another process is not executed and a prohibition process for prohibiting interrupt process is executed. Here, the interrupt processing is a processing that is executed by interrupting at predetermined period intervals. Even with such a configuration, the same effect as that of the present embodiment can be obtained.

(4) In the present embodiment, the upper limit of the bonus counter is set at the start of the bonus, and each time a medal is given, the number of medals given is subtracted and updated, and when the bonus counter becomes 0. , Explained that it is judged that the bonus is over. As for the AT counter, the number of remaining AT games is set at the start of AT, and every time one game in AT is exhausted, one game is subtracted and updated, and when the AT counter becomes 0, AT ends. I explained that it was judged that it was done.

However, at least one of the bonus counter and the AT counter may be incremented and updated. For example, for the bonus counter, an initial value (for example, 0) is set at the start of the bonus, and each time a medal is given during the bonus, the number of medals given is increased and updated, and the bonus counter becomes the upper limit. When it is reached, it may be determined that the bonus is over. As for the AT counter, an initial value (for example, 0) is set at the start of AT, and each time one game is consumed during AT, the AT counter is increased and updated by one game, and when the AT counter reaches the number of remaining AT games. , It may be determined that the AT has ended. Even with such a configuration, the same effect as that of the present embodiment can be obtained.

(5) Further, it has been described that the determination of the end of the specific state (bonus state or the like) is executed based on the value of the counter (bonus counter) as shown in FIG. 2B or the like. However, it may be determined whether or not the bonus state has ended based on the bonus counter and information different from the bonus counter. When it is determined that the bonus state has ended based on the different information, it is determined whether or not both the upper byte and the lower byte of the bonus counter are "0000000000B", and both the upper byte and the lower byte are "00000000B". When it is determined that the value is "0000000B", it may be determined that the bonus state has ended. Further, when it is determined that the bonus state has ended due to the different information, and when it is determined that at least one of the upper byte and the lower byte of the bonus counter is not "0000000000B", the error notification is executed. You may do it. According to such a configuration, it is possible to accurately execute the end determination of the bonus state.

(6) Further, in the present embodiment, the first numerical value is a value of 101 to 400, which is the "number of games to be given" corresponding to the second condition and the third condition of FIG. 4 with respect to the addition of the AT game. be. These 101 to 400 are "101 to 2 that can be specified (expressed) only by the lower byte".
"55" and "256 to 400 that can be specified (expressable) by the upper byte and the lower byte" are included. In this way, the first numerical value is set only in the "numerical value set in the first region (lower byte) and the second region (upper byte)" and the "first region out of the first region and the second region". It may include "a numerical value". That is, the first numerical value is "a numerical value that can be set in the first region and the second region". Further, in this case, regarding the addition of the AT game, the second
The numerical value is 1 to 100. That is, the second numerical value is "a numerical value set only in the first region (lower byte)".

As a modification, the first numerical value does not include the "numerical value set only in the first region among the first region and the second region", but may be a "numerical value set in the first region and the second region". good. 1st
The numerical value may be, for example, "256 to 400 that can be specified (expressable) by the upper byte and the lower byte" with respect to the addition of the AT game. In this case, the first numerical value is "first.
It is a "numerical value set in the first region and the second region" without including the "numerical value set only in the first region among the region and the second region". Further, the second numerical value becomes 1 to 255, and the second numerical value becomes "a numerical value set only in the first region among the first region and the second region".

Further, as a further modification, the second numerical value may include "numerical values set in the first region and the second region". That is, the second numerical value may be "a numerical value that can be set only in the first region of the first region and the second region".

(7) In the present embodiment, the determination as to whether or not the specific state (AT, bonus) has ended is exemplified as the "specific determination performed based on the numerical value of the counter". However, the specific determination may be another determination. For example, it may be "determination of whether or not to start a specific state". Further, the specific determination may be "determination of whether or not to execute the specific control (freeze, predetermined effect)".

It should be considered that the embodiments disclosed this time are exemplary in all respects and not restrictive. The scope of the present invention is shown by the scope of claims rather than the above description, and is intended to include all modifications within the meaning and scope equivalent to the scope of claims.

1 game machine, 40 game control board, 41 main control unit, 51 liquid crystal display, 53 speaker, 90 staging control board, 91 sub control unit.

Claims (1)

It is a gaming machine that can play games,
With a counter
A setting method for setting a numerical value on the counter, and
An update method for updating the counter value,
It is equipped with a judgment means that makes a specific judgment based on the numerical value of the counter.
Each counter is composed of multiple areas that can store data.
The plurality of regions include the first region and the second region.
The setting means is
The counter is set to a first numerical value represented by the data of both the first region and the second region and a second numerical value that can be represented only by the data of the first region among the first region and the second region. Get,
When setting the first numerical value in the counter, the arithmetic processing for both the first area and the second area is executed, and the operation processing is executed.
When setting the second numerical value in the counter, the arithmetic processing targeting only the first region of the first region and the second region is executed.
When updating the numerical value of the counter, the updating means performs the updating process after the first numerical value is set by the arithmetic processing targeting both the first region and the second region, and the first region and the second. In any case where the update process is performed after the second numerical value is set by the arithmetic process targeting only the first area of the area, the update process targeting both the first area and the second area is performed. Game machine.

Images