JP6857623B2 - Game machine - Google Patents

Description

The present invention relates to a gaming machine that plays a game.

As a gaming machine, a gaming medium such as a gaming ball is launched into the gaming area by a launching device, and when the gaming medium wins a prize in a starting winning area such as a winning opening provided in the gaming area, a variable display of a plurality of types of identification information is displayed. There are pachinko gaming machines in which a predetermined number of bets are stored, and slot machines in which a plurality of types of identification information (for example, symbols) are variably displayed when a start operation is performed. In a game machine configured to be able to execute variable display of identification information in this way, when the display result of variable display of identification information becomes a predetermined display result in the variable display unit, a predetermined game value (for example, a jackpot) Some are configured to give the player a transition to a state, etc.).

As such a game machine, there is known a game machine that initializes a plurality of storage areas by sequentially storing clear data having a fixed value in the storage area while updating the address of the storage area (). For example, Patent Document 1).

Japanese Unexamined Patent Publication No. 2016-154726

By the way, in the gaming machine of Patent Document 1, a plurality of storage areas are initialized by repeating the same process while updating the address, but for some reason, data different from the original data is read out as clear data. In that case, the storage area may be initialized by unintended data.

The present invention has been made by paying attention to such a problem, and an object of the present invention is to provide a gaming machine capable of preventing unintended data from being stored in a storage area and initializing the storage area. ..

In order to solve the above problems, the gaming machine of the present invention
A gaming machine (for example, gaming machine 1) that plays a predetermined game.
Storage means for storing data relating to control a plurality of storage area (e.g., RAM),
When a predetermined condition is satisfied, and initializing means for initializing to said plurality of storage area corresponding to the established predetermined condition is a common initial data (e.g., RAM clearing process shown in FIG. 2), the Prepare,
The initialization means
In initializing one of the plurality of storage areas, the initial data is created, and the one storage area is initialized using the initial data (for example, the processes of Sa6 and Sa7 in FIG. 2). The part to do),
In initializing continue another storage area of the plurality of storage areas in said first storage area, to create the initial data again, thus initializing the other storage area by using the initial data ( For example, the portion where the processing of Sa6 and Sa7 in FIG. 2 is performed).
According to this configuration, it is possible to prevent unintended data from being stored in the storage area and initializing the storage area.

A first instruction executing means for executing a first instruction for storing data stored by using an argument in a storage area indicated by a predetermined address, and a first instruction executing means.
It is provided with a second instruction executing means for executing a second instruction for storing data of a specific register in a storage area indicated by a predetermined address.
The program capacity used to execute the second instruction is smaller than that used to execute the first instruction.
The initialization means stores the initial data created when initializing the storage area in the specific register by executing the second instruction, and initializes the storage area using the initial data stored in the specific register. According to this, the program capacity for initializing a plurality of storage areas can be reduced.

When the storage area is initialized by executing the second instruction, the initialization means re-stores the initial data in the specific register each time the storage area is initialized by executing the second instruction, and stores the initial data in the specific register. Initialize the storage area using the re-initialized data (for example, the part where the processing of Sa6 in FIG. 2 is performed).
According to this configuration, it is possible to prevent unintended data from being stored in the storage area and initializing the storage area.

Initialization means
A plurality of storage areas in which a plurality of data of the first type are stored are initialized at the first trigger in the progress of the game, and a plurality of data of the second type are stored at the second trigger in the progress of the game. Initialize the storage area
A plurality of storage areas are initialized by performing a common process between the first trigger and the second trigger (for example, the RAM clear process shown in FIG. 2).
According to this configuration, the program capacity for initializing a plurality of storage areas can be reduced.

The initialization means includes an address specifying means for specifying the address of the storage area to be initialized while updating the address of the read location in the address storage table that stores the addresses of the plurality of storage areas (for example, the process of Sa2 in FIG. 2). The part to do).
According to this configuration, a process for initializing a plurality of storage areas can be preferably executed.

The address specifying means first initializes the memory by starting the update of the address (for example, Nn) from the address immediately before the address (for example, N) which is the first read location in the address storage table. The address of the area is specified (for example, the part where the processing of Sa2 in FIG. 2 is performed).
According to this configuration, the iterative treatment can be preferably diverted.

It is a figure which shows the game machine which concerns on this embodiment. It is a flowchart of RAM clear processing executed by a game machine. It is explanatory drawing of the address used for storing clear data and control data other than clear data when a bonus is won. It is explanatory drawing which shows an example of the address map in RAM.

[Game machine configuration]
FIG. 1 is a diagram showing a game machine 1 according to the present embodiment. As shown in FIG. 1, the game machine 1 according to the present embodiment includes a liquid crystal display 51 for displaying an image and speakers 53 and 54 for outputting sounds such as music and production sounds.

The game machine 1 includes a game control microcomputer. The game control microcomputer includes a CPU that performs control operations according to a program, a ROM that stores a game progress control program, and a RAM as a storage means that is used as a work memory.

[About RAM]
The RAM is provided with a plurality of storage areas for storing various control data such as data related to game control, and is used as a work area when executing game control. When the power supply is stopped, the RAM can back up data related to control indicating the game state before the power supply is stopped.

[About RAM clear processing (initialization processing)]
The RAM clear process (initialization process) is executed when a predetermined condition is satisfied. The predetermined conditions are, for example, that the clear switch has been turned on, that the power has been turned on, that an error has occurred, that the advantageous state has started, that the advantageous state has ended, that the unit game has ended, and the like. .. The RAM clearing process is a process of initializing a plurality of storage areas in the RAM according to a predetermined condition to be returned to the initial value state. A plurality of storage areas are provided in the RAM, and addresses are assigned to each of the storage areas. The address indicates the location of one storage area in the RAM. The addresses allocated to the plurality of storage areas are stored in the address storage table stored in the RAM. In the RAM clear process, a plurality of storage areas are stored by storing common clear data (00H) which is an initial value (fixed value) in each of a plurality of addresses (storage areas) to be initialized. To return to the initial value state. The process of storing the clear data (00H), which is the initial value, in the address in this way is called initialization. In this embodiment, the storage area may be referred to as an address. At the time of initialization, instead of clear data (00H), data other than the initial value that is not used in normal games may be stored in the address.

In the RAM clear process, when initializing a plurality of storage areas so that they become common clear data (00h), clear data is used when initializing the storage area (one address) of one of the plurality of addresses. (00h) is created, the created clear data (00h) is stored in one address, one address is initialized, and another storage area (one address) is initialized in succession to one address. The clear data (00h) is created again, the created clear data (00h) is stored in an address different from that address, and another address is initialized. As a result, clear data (00H) common to the plurality of storage areas is sequentially stored, and each storage area is sequentially initialized. In the RAM clearing process of the present embodiment, in addition to storing clear data (00H) at a plurality of addresses in the RAM, control data other than the clear data is stored in a predetermined storage area according to a predetermined condition that is satisfied. There is.

When initializing multiple addresses in sequence as described above, the process of creating clear data is not performed, and the same process of reading the clear data originally created and storing it in the address is passed each time. With such a configuration, if the clear data having an initial value different from the clear data that should be originally stored is read for some reason, the address may be initialized by the unintended clear data. However, as described above, by creating clear data and storing the clear data at one address, and then recreating and storing the same clear data when storing the clear data at another address, It is possible to prevent unintended clear data from being stored at the initialized address.

Here, one of the plurality of storage areas and the other storage area have an order relationship of an Nth address (N is an integer) and an N + nth address (n is an integer). The storage area of one of the plurality of storage areas and the other storage areas may be in a continuous order or a discontinuous order. For example, when one storage area is the first address, the other storage area may be the second address, and when one storage area is the first address, the other storage area is 5. It may be related to the second address. Further, as for one storage area and the other storage area of a plurality of storage areas, an area in which a plurality of addresses are grouped is regarded as one storage area, and another area in which a plurality of addresses are grouped is regarded as another storage area. It may be a relationship. Specifically, when one storage area has the first to third addresses, the other storage areas may have the fourth to sixth addresses. Further, when one storage area has the first to third addresses, the other storage areas may have a relationship of the seventh to ninth addresses. It should be noted that one storage area includes a plurality of areas and the other storage area is one area, or one storage area is one area and the other storage area includes a plurality of areas. You may.

[About RAM clear processing]
Next, the RAM clearing process of the present embodiment will be described with reference to FIG. The CPU executes the RAM clear process when a predetermined condition is satisfied.

As shown in FIG. 2, in the RAM clearing process, the CPU first sets the number of initializations for initializing the address according to a predetermined condition that holds, and registers the number of data settings, which is the number of times the control data is stored. Set to (Sa1). The number of data settings is the total number of times the clear data is stored in the address (that is, the number of initializations) and the number of times control data other than the clear data is stored in the predetermined address according to the established predetermined conditions. is there.

Next, the read address is specified by updating the address (“read address” in the figure) to be the read location in the address storage table (Sa2). Specifically, N + n is set in N. When the address is initialized for the first time, the address Nn immediately before the first address is set in N, so the update is started from the address Nn immediately before the first address and N + n in N. When is set, the first address N is specified at first. As a result, the iterative treatment can be preferably diverted.

Next, the read address specified from the address storage table is set in the register as the write address of the control data (Sa3). Next, it is determined whether or not the number of initializations of the address set in the processing of Sa1 has reached "0" (Sa4).

If the number of address initializations is not "0", the number of address initializations is subtracted "1" (Sa5). Then, the fixed value clear data (00H) is stored in the specific register (A register) (Sa6). Next, the control data stored in the specific register (A register) is stored in the write register (Sa7). Specifically, the clear data (00H) stored in the specific register (A register) is stored in the write register set in Sa3.

On the other hand, when the number of times the address is initialized becomes "0", the read address is specified by updating the read address in the address storage table (Sa10). Then, the control data is read from the specified read address, and the read control data is stored in the specific register (A register) (Sa11). Next, the control data stored in the specific register (A register) is stored in the write register (Sa7). Specifically, the control data stored in the specific register (A register) in Sa11 is stored in the write register set in Sa3. That is, after the number of times the address is initialized becomes "0", the control data stored in the address different from the write address is read, and the process for storing this in the write address is performed. For example, a process is performed in which the control data stored in the fifth write address is read from the sixth read address and stored in the fifth write address.

When the processing of Sa7 is completed, the number of data setting times set in Sa1 is subtracted "1" times (Sa8). Next, it is determined whether or not the number of times of data setting has reached "0" (Sa9). If the number of data settings is not "0", the process returns to the Sa2 step. When the number of data settings reaches "0", the process ends.

Here, the game machine 1 has a first instruction for storing data stored by an argument (1 byte numerical value, 0h) at an address indicated by a predetermined address, and a specific register (A register) at the address indicated by the predetermined address. It is possible to execute a second instruction for storing the data of. Since no argument is required, the program capacity of the program used for executing the second instruction is smaller than that of the program used for executing the first instruction. Therefore, in the RAM clear processing of the present embodiment, the plurality of addresses are initialized by storing the clear data (00h) in the plurality of addresses by executing the second instruction. As a result, the program capacity for initializing a plurality of addresses can be reduced.

Further, in the RAM clear processing of the present embodiment, by performing the processing of Sa6 in FIG. 2, the data of the specific register (A register) is cleared every time the address is initialized by executing the second instruction (00h). Restore in and initialize multiple storage areas. This makes it possible to prevent unintended data from being stored in the address and initializing the address.

Further, in the RAM clear processing of the present embodiment, a plurality of addresses in which a plurality of data of the first type are stored are initialized at the first trigger in the progress of the game, and the second type is initialized at the second trigger in the progress of the game. The plurality of addresses in which the plurality of data are stored are initialized, and the plurality of addresses are initialized by performing the common RAM clearing process shown in FIG. 2 at the first trigger and the second trigger. As a result, the program capacity for initializing a plurality of storage areas can be reduced. The first and second triggers are, for example, when the advantageous state starts, when the advantageous state ends, and when the unit game ends.

[Specific examples when performing RAM clear processing]
Next, a specific example of performing the RAM clearing process will be described with reference to FIGS. 3 and 4. 3 and 4 show an example in which the game machine 1 is assumed to be a slot machine and the RAM clear processing is executed when a bonus is won.

FIG. 3 shows an address used to store clear data (00h) and control data other than clear data when a bonus is won. In addition, "1" to "7" indicate the order specified as a reading place. FIG. 4 shows an example of an address map of addresses used when a bonus is won in RAM.

When the bonus is won, the storage address of the number of inter-bonus games (upper) and the storage address of the number of inter-bonus games (lower) in which control data that can specify the number of games between bonuses is stored, ART (assist replay time) The storage address of the ART entry flag that stores the control data that can be specified to be controlled, the storage address of the next main state that stores the control data that can specify the game state of the next game, and the game state of the next game are bonuses The address where the specified value in the bonus, which is the control data that can be specified to exist, is stored, and the control data that can specify the number of times the prize has occurred in the RB (regular bonus) is stored. The address and the address in which the initial value of the number of winnings in RB, which is control data capable of specifying the initial value of the number of times winning in RB is stored, are used. In addition, below

Then, as shown in FIG. 4, for example, a storage address of the number of inter-bonus games (upper) is assigned to the area of the address F010H. A storage address for the number of inter-bonus games (lower) is assigned to the area of the address F020H. The storage address of the ART entry flag is assigned to the area of the address F035H. The storage address of the next main state is assigned to the area of the address F045H. An address in which the specified value during the bonus is stored is assigned to the area of the address F046H. The storage address of the winning number counter during RB is assigned to the area of the address F060H. An address in which the initial value of the number of winnings during RB is stored is assigned to the area of the address F061H.

When the RAM clearing process of FIG. 2 is executed at the time of winning a bonus in the configurations of FIGS. 3 and 4, first, the number of initializations is set to 3 and the number of data settings is set to 5 (see Sa1 of FIG. 2). Specifically, the addresses shown in "1" to "3" in FIG. 3 are initialized, the control data shown in "5" is stored in the address shown in "4", and "6" is stored in the address shown in "6". The control data shown in "7" is stored. Then, when the addresses shown in "1" to "3" are sequentially initialized, the number of initializations becomes three, so the number of initializations is set to three. Further, when the control data to the addresses shown in "4" and "6" are sequentially stored in this, the number of times of data setting becomes 2, and the number of times of data setting is 5 times by adding the number of initializations of 3 times. Is set to.

Next, the read address is updated in the address storage table, and the address F010H of the read location is specified (see Sa2 in FIG. 2). Further, the specified address is set as the write address (see Sa3 in FIG. 2). Then, the number of initializations is subtracted once (see Sa5 in FIG. 2), and fixed value clear data (00H) is created and stored in a specific register (A register) (see Sa6 in FIG. 2). The clear data (00H) stored in the specific register (A register) is stored in the storage address of the number of inter-bonus games (upper) at the address F010H (see Sa7 in FIG. 2). Then, the number of times the data is set is subtracted once (see Sa9 in FIG. 2). When the initialization of the storage address of the number of games (upper) between bonuses of the address F010H is completed, the remaining number of initializations is 2, and the remaining number of data settings is 4.

Next, the read address is updated in the address storage table, and the address F020H of the read location is specified (see Sa2 in FIG. 2). Further, the specified address is set as the write address (see Sa3 in FIG. 2). Then, the number of initializations is subtracted once (see Sa5 in FIG. 2), and the fixed value clear data (00H) is recreated and stored in the specific register (A register) (see Sa6 in FIG. 2). The clear data (00H) stored in the specific register (A register) is stored in the storage address of the number of inter-bonus games (lower) of the address F020H (see Sa7 in FIG. 2). Then, the number of times the data is set is subtracted once (see Sa9 in FIG. 2). When the initialization of the storage address of the number of games (lower) between bonuses of the address F020H is completed, the remaining number of initializations is 1, and the remaining number of data settings is 3.

Next, the read address is updated in the address storage table, and the address F035H of the read location is specified (see Sa2 in FIG. 2). Further, the specified address is set as the write address (see Sa3 in FIG. 2). Then, the number of initializations is subtracted once (see Sa5 in FIG. 2), and the fixed value clear data (00H) is recreated and stored in the specific register (A register) (see Sa6 in FIG. 2). The clear data (00H) stored in the specific register (A register) is stored in the storage address of the ART entry flag at address F035H (see Sa7 in FIG. 2). Then, the number of times the data is set is subtracted once (see Sa9 in FIG. 2). When the initialization of the storage address of the ART entry flag of the address F035H is completed, the remaining number of initializations is 0, and the remaining number of data settings is 2.

By the above processing, the initialization of the storage address of the number of inter-bonus games (upper) of the address F010H, the storage address of the number of inter-bonus games (lower) of the address F020H, and the storage address of the ART entry flag in the area of the address F035H is completed. To do.

Next, the read address is updated in the address storage table, and the address F045H of the read location is specified (see Sa2 in FIG. 2). Further, the specified address is set as the write address (see Sa3 in FIG. 2). Then, the read address is further updated in the address storage table, and the address F046H of the read location is specified (see Sa10 in FIG. 2). After that, the specified value in the bonus stored in the address F046H is stored in the specific register (A register) (see Sa11 in FIG. 2). The specified value in the bonus stored in the specific register (A register) is stored in the storage address of the next main state of the address F045H set as the write address (see Sa7 in FIG. 2). Then, the number of times the data is set is subtracted once (see Sa9 in FIG. 2). When the process for storing the specified value in the bonus of the address F046H at the storage address in the next main state of the address F045H is completed, the remaining number of data setting times becomes one.

Next, the read address is updated in the address storage table, and the address F060H of the read location is specified (see Sa2 in FIG. 2). Further, the specified address is set as the write address (see Sa3 in FIG. 2). Then, the read address is further updated in the address storage table, and the address F061H of the read location is specified (see Sa10 in FIG. 2). After that, the initial value of the number of winnings in RB at the address F061H is stored in the specific register (A register) (see Sa11 in FIG. 2). The initial value of the number of winnings in RB stored in the specific register (A register) is stored in the storage address of the number of winnings in RB counter set as the write address at the address F060H (see Sa7 in FIG. 2). Then, the number of times the data is set is subtracted once (see Sa9 in FIG. 2). When the process for storing the initial value of the RB winning count of the address F061H is completed in the storage address of the RB winning count counter of the address F060H, the remaining number of data setting times becomes 0.

As a result, the address initialization process and the control data storage process at the time of bonus winning are completed.

[Effect of this embodiment]
In the present embodiment, a plurality of addresses are initialized to be common clear data (00h), and when initializing one of the plurality of addresses, clear data (00h) is created and the clear data is created. When initializing the one address using the data (00h) and initializing the other addresses in succession to the one address, the clear data (00h) is recreated and the clear data (00h) is used. Initialize the address (in this example, the part where the processing of Sa6 and Sa7 in FIG. 2 is performed).
Therefore, it is possible to prevent unintended data from being stored in the address and initializing the address.

In the present embodiment, the first instruction for storing the data stored by using the argument at the address indicated by the predetermined address and the second instruction for storing the data of the specific register at the address indicated by the predetermined address can be executed. The program used to execute the second instruction has a smaller program capacity than the program used to execute the first instruction, and the clear data (00h) created when initializing the address is stored in the specific register by executing the second instruction. The address is initialized using the clear data (00h) stored in the specific register.
Therefore, the program capacity for initializing a plurality of addresses can be reduced.

In the present embodiment, when the address is initialized by executing the second instruction, the clear data (00h) is re-stored in the specific register each time the address is initialized by executing the second instruction, and is stored in the specific register. The address is initialized using the cleared clear data (00h) (in this example, the part where the processing of Sa6 in FIG. 2 is performed).
Therefore, it is possible to prevent unintended data from being stored in the address and initializing the address.

In the present embodiment, a plurality of addresses in which a plurality of data of the first type are stored are initialized at the first trigger in the progress of the game (in this example, at the time of winning a bonus), and the second trigger in the progress of the game. (In this example, at the end of the unit game), a plurality of addresses in which a plurality of data of the second type are stored are initialized, and processing common to the first and second triggers (in this example, the RAM of FIG. 2). Initialize multiple addresses by performing clear processing).
Therefore, the program capacity for initializing a plurality of addresses can be reduced.

In the present embodiment, in the address storage table that stores a plurality of addresses, the address to be initialized while updating the address of the read location is specified (in this example, the portion that performs the processing of Sa2 in FIG. 2).
Therefore, it is possible to preferably execute the process for initializing a plurality of addresses.

In the present embodiment, the address to be initialized first is specified by starting the update of the address from the address immediately before the address to be the first read location in the address storage table (in this example, FIG. 2). The part where the processing of Sa2 is performed).
According to this configuration, the iterative treatment can be preferably diverted.

[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, modifications of the above-described embodiment applicable to the present invention will be described.

[About the game machine]
The game machine 1 described above includes a plurality of variable display units 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 for display. It may be a slot machine capable of deriving a result and generating a prize according to a display result combination which is a combination of display results of a plurality of variable display units. The above-mentioned gaming machine 1 may be a pachinko gaming machine that can be controlled to a jackpot gaming state that is advantageous to the player according to the result of variable display of a plurality of types of identification information that can be identified by each.

[About RAM clear processing]
In the above embodiment, an example in which the RAM clear processing is performed by the game control microcomputer has been described, but the same processing may be executed by the effect control microcomputer provided separately from the game control microcomputer.

1 Game machine, 51 liquid crystal display, 53, 54 speakers

Claims (1)

A game machine that plays a predetermined game
Storage means for storing data relating to control a plurality of storage area,
When a predetermined condition is satisfied, and a initializing means for initializing to said plurality of storage area corresponding to the established predetermined condition as a common initial data,
The initialization means
In initializing one of the plurality of storage areas, the initial data is created, and the initial data is used to initialize the one storage area.
In initializing continue another storage area of the plurality of storage areas in said first storage area, to create the initial data again, to initialize the other storage area by using the initial data A game machine featuring.

Images