JP2015089413A - Game machine - Google Patents

Abstract

PROBLEM TO BE SOLVED: To suppress increase of a processing load and a table capacitance in a main control circuit.SOLUTION: A game machine includes a main control arithmetic part. The main control arithmetic part includes: reference address storage means that stores a reference address in a predetermined stack area when an error occurs; address calculation means which acquires relative positional information corresponding to an error class by referring to an error registration table and calculates an address of a storage area of an error registration processing program corresponding to the error class on the basis of the acquired relative positional information and the reference address stored in the predetermined stack area; jump processing means that jumps processing to the address of the storage area of the error registration processing program calculated by the address calculation means; and error registration processing means which executes the error registration processing program at the destination to which the processing is jumped by the jump processing means, and registers information about the corresponding error class.

Description

  The present invention relates to a gaming machine.

  Conventionally, a game called pachi-slot, comprising a plurality of reels each having a plurality of symbols provided on the surface, a start switch, a stop switch, a stepping motor provided for each reel, and a control unit. The machine is known. The start switch detects that the start lever has been operated by the player (hereinafter also referred to as “start operation”) after a game medium such as a medal or coin has been inserted into the gaming machine, and the rotation of all reels is detected. Outputs a signal requesting start. The stop switch detects that a stop button provided for each reel has been pressed by the player (hereinafter also referred to as “stop operation”), and outputs a signal requesting the rotation of the corresponding reel to stop. To do. The stepping motor transmits the driving force to the corresponding reel. Further, the control unit controls the operation of the stepping motor based on the signals output from the start switch and the stop switch, and performs the rotation operation and stop operation of each reel.

  In such a gaming machine, when a start operation is detected, lottery processing using random numbers (hereinafter referred to as “internal lottery processing”) is performed on the program, and the result of the lottery (hereinafter referred to as “internal winning combination”). And the rotation of the reel is stopped based on the timing of the stop operation. Then, when the rotation of all the reels is stopped and the symbol combination related to the winning is displayed, a privilege corresponding to the symbol combination is given to the player. As an example of a privilege granted to a player, a replay (hereinafter also referred to as “replay”) in which an internal lottery process is performed again without paying out game media (medals, etc.) or consuming the game media. An operation of a bonus game in which a game medium payout opportunity increases can be cited.

  By the way, the above-described gaming machine is usually mounted with a circuit (main control circuit) for controlling the main gaming operation of the gaming machine such as determination of an internal winning combination, rotation and stop of each reel, determination of presence / absence of winning a prize, etc. A main control board, and a sub control board on which a circuit (sub control circuit) that mainly controls a rendering operation by displaying an image or the like is mounted. Conventionally, a CPU equipped with a security function based on the Z80 CPU architecture has been adopted as a CPU for gaming machines installed in the main control circuit (see, for example, Patent Document 1). In addition, in such a gaming machine, the capacity of programs and constant tables that can be stored in the ROM of the main control circuit is defined by the rules of customs law (the laws on customs business etc. and laws on the optimization of business). ing.

JP 2006-289111 A

  By the way, in recent years, in the field of gaming machines, the types of internal winning combinations and winning combinations have increased remarkably, and the amount of use of tables in the main control circuit tends to increase due to the addition of control processing for reel effects called lock effects. is there. Further, conventionally, also in the error data setting (registration) processing of the main control circuit, error data is set with reference to the error table registered in the table area. Therefore, in such a gaming machine, there is a problem that processing load and table capacity such as gaming operation, lock effect and error setting in the main control circuit become very large.

  The present invention has been made to solve such problems, and an object of the present invention is to provide a gaming machine capable of suppressing an increase in processing load and table capacity in a main control circuit. is there.

  In order to solve the above problems, the present invention provides a gaming machine having the following configuration.

Main control means (for example, a main control circuit 41 to be described later) including a main control arithmetic unit (for example, a microcomputer 50 to be described later) that performs control associated with the game operation;
A loading operation detecting means (for example, a medal sensor 35S described later) for detecting a gaming medium loading operation;
Start operation detecting means (for example, a start switch 16S described later) for detecting a start operation by the player based on detection of the input operation by the input operation detecting means;
Internal winning combination determining means (for example, internal lottery processing described later) for determining an internal winning combination with a predetermined probability based on detection of the start operation by the start operation detecting means;
Fluctuation display means (for example, three reels 3L, 3C, 3R, which will be described later) includes a plurality of display lines and variably displays symbols provided in each display line based on detection of the start operation by the start operation detection means. Three stepping motors 61L, 61C, 61R),
A stop operation detecting means (for example, a stop switch 17S described later) for detecting a stop operation by the player;
Stop control means (for example, reel stop control process described later) for stopping the change display of the symbol based on the determination result of the internal winning combination determining means and detection of the stop operation by the stop operation detecting means;
Main control transmission means (for example, a start command transmission process described later) for transmitting command data related to the gaming operation;
Sub-control means (for example, a sub-control circuit 42 described later) that receives the command data transmitted from the main control transmission means and controls a predetermined effect operation based on the received command data. ,
The main control arithmetic unit is
A main control calculation unit (for example, a main CPU 51 described later) for controlling the gaming operation;
A first storage unit (for example, a main ROM 52 described later) in which programs and tables necessary for control processing executed by the main control calculation unit are stored;
A second storage unit (for example, a main RAM 53 described later) that temporarily stores information necessary for control processing executed by the main control calculation unit,
The first storage unit
A plurality of error registration processing programs (for example, a RAM error registration processing program described later) provided for each error type,
Relative position information (for example, a relative position described later) of the storage area of each error registration processing program with respect to a reference address set in advance in the first storage unit, and information on the error type (for example, an error code described later), And an error registration table (for example, a relative position table for error registration processing) that defines the correspondence relationship of
The main control operation unit is
Reference address storage means (for example, S331 in error registration processing described later) for storing the reference address in a predetermined stack area provided in the second storage unit when an error occurs,
The relative position information corresponding to the error type is acquired with reference to the error registration table, and the error type is determined based on the acquired relative position information and the reference address stored in the predetermined stack area. Address calculating means for calculating the address of the storage area of the corresponding error registration processing program (for example, S343 of table jump processing described later);
Jump processing means (for example, S344 of table jump processing described later) for jumping the processing to the address of the storage area of the error registration processing program calculated by the address calculating means;
The error registration processing unit (for example, executing the error registration processing program jumped by the jump processing unit, and storing information on the error type corresponding to the error registration processing program in a predetermined area in the second storage unit (for example, And the like (to be described later, table jump processing S345, etc.).

  In the gaming machine of the present invention, the reference address may be a head address of a storage area of the error registration table in the first storage unit.

  Furthermore, in the gaming machine of the present invention, the main control arithmetic unit may have a security function for preventing falsification and reading of a program.

  According to the gaming machine of the present invention configured as described above, an increase in processing load and table capacity in the main control means (main control circuit) can be suppressed.

It is a figure for demonstrating the function flow of the game machine in one Embodiment of this invention. It is a perspective view which shows the external appearance structure of the game machine in one Embodiment of this invention. It is a figure which shows the internal structure of the game machine in one Embodiment of this invention. It is a block diagram which shows the whole circuit structure with which the game machine of one Embodiment of this invention is provided. It is a figure which shows the structure of the various data storage area provided in the main RAM area of the game machine in one Embodiment of this invention. It is a block diagram which shows the internal structure of the microcomputer of the main control circuit in one Embodiment of this invention. It is a figure for demonstrating the outline | summary of the storing operation | movement of the internal random number in one Embodiment of this invention. It is a block diagram which shows the internal structure of the sub control circuit in one Embodiment of this invention. It is a figure which shows an example of the symbol arrangement | positioning table in one Embodiment of this invention. It is a figure which shows an example of the symbol combination table (the 1) in one Embodiment of this invention. It is a figure which shows an example of the symbol combination table (the 2) in one Embodiment of this invention. It is a figure which shows an example of the symbol combination table (the 3) in one Embodiment of this invention. It is a figure which shows an example of the symbol combination table (the 4) in one Embodiment of this invention. It is a figure which shows an example of the symbol combination table (the 5) in one Embodiment of this invention. It is a figure which shows an example of the table at the time of the bonus action | operation in one Embodiment of this invention. It is a figure which shows an example of RT transition table in one Embodiment of this invention. It is a figure which shows an example of the internal lottery table determination table in one Embodiment of this invention. It is a figure which shows an example of the internal lottery table for general game states (the 1) in one Embodiment of this invention. It is a figure which shows an example of the internal lottery table (the 2) for general gaming states in one Embodiment of this invention. It is a figure which shows an example of the internal lottery table for RT1 gaming state in one Embodiment of this invention. It is a figure which shows an example of the internal lottery table for RT2 gaming state in one Embodiment of this invention. It is a figure which shows an example of the internal lottery table for RT3 game states in one Embodiment of this invention. It is a figure which shows an example of the internal lottery table for RB1 game states in one Embodiment of this invention. It is a figure which shows an example of the internal lottery table for RB2 game states in one Embodiment of this invention. It is a figure which shows an example of the internal lottery table for RB3 game states in one Embodiment of this invention. It is a figure which shows an example of the internal winning combination determination table for bonuses in one Embodiment of this invention. It is a figure which shows an example of the internal winning combination determination table for the small combination and replay (the 1) in one Embodiment of this invention. It is a figure which shows an example of the internal winning combination determination table (the 2) for a small combination and replay in one Embodiment of this invention. It is a figure which shows an example of the internal winning combination determination table for the small combination and replay (the 3) in one Embodiment of this invention. It is a figure which shows an example of the internal winning combination determination table (the 4) for a small combination and replay in one Embodiment of this invention. It is a figure which shows an example of the internal winning combination determination table for the small combination and replay (the 5) in one Embodiment of this invention. It is a figure which shows an example of the correspondence table | surface (No. 1) of the data combination for a small combination and replay and display combination in one Embodiment of this invention. It is a figure which shows an example of the correspondence table | surface (part 2) with the data pointer for a small combination and replay and display combination in one Embodiment of this invention. It is a figure which shows an example of the number selection table for spinning cylinder stop in one Embodiment of this invention. It is a figure which shows an example of the reel stop initial setting table in one Embodiment of this invention. It is a figure which shows an example of the stop table for the 1st stop at the time of forward pressing in one Embodiment of this invention. It is a figure which shows an example of the control change table at the time of a forward press in one Embodiment of this invention. It is a figure which shows an example of the stop table for 2nd and 3rd stop at the time of forward pressing in one Embodiment of this invention. It is a figure which shows an example of the stop table at the time of an irregular pressing in one Embodiment of this invention. It is a figure which shows an example of the drawing priority order table selection table in one Embodiment of this invention. It is a figure which shows an example of the drawing priority order table in one Embodiment of this invention. It is a figure which shows an example of the search order table in one Embodiment of this invention. It is a figure which shows an example of the game lock lottery table A in one Embodiment of this invention. It is a figure which shows an example of the game lock lottery table B in one Embodiment of this invention. It is a figure which shows an example of the game lock lottery table C in one Embodiment of this invention. It is a figure which shows an example of the output condition table in one Embodiment of this invention. It is a figure which shows an example of the subtraction condition table in one Embodiment of this invention. It is a figure which shows an example of the symbol corresponding winning action flag data table in one Embodiment of this invention. It is a figure which shows an example of the relative position table for error registration processing in one Embodiment of this invention. It is a figure which shows the relationship between the head address of the relative position table for error registration processing in the main ROM of one Embodiment of this invention, and the head address of various error registration processing programs. It is a figure which shows an example of the display combination storage area in one Embodiment of this invention. It is a figure which shows an example of the game state flag storage area in one Embodiment of this invention. It is a figure which shows an example of the operation stop button storage area | region in one Embodiment of this invention. It is a figure which shows an example of the pressing order storage area | region in one Embodiment of this invention. It is a figure which shows an example of the symbol code storage area in one Embodiment of this invention. It is a figure which shows an example of the drawing priority order data storage area in one Embodiment of this invention. It is a figure which shows an example of the game lock flag storage area | region in one Embodiment of this invention. It is the transition flow figure of RT state of the gaming machine in one execution form of this invention. It is a figure which shows the correspondence table of the winning combination and stop order in one Embodiment of this invention. It is a figure which shows the correspondence table of the winning combination, stop order, and RT transfer form in one Embodiment of this invention. It is a transition flow figure of the sub game state of the gaming machine in one embodiment of the present invention. It is a figure which shows an example of the special flag lottery table in one Embodiment of this invention. It is a figure which shows an example of the lottery flag A-1 lottery table in one Embodiment of this invention. It is a figure which shows an example of the lottery flag A-2 lottery table in one Embodiment of this invention. It is a figure which shows an example of the lottery flag A-3 lottery table in one Embodiment of this invention. It is a figure which shows an example of the lottery flag B-1 lottery table in one Embodiment of this invention. It is a figure which shows an example of the lottery flag B-2 lottery table in one Embodiment of this invention. It is a figure which shows an example of the lottery flag B-3 lottery table in one Embodiment of this invention. It is a figure which shows an example of the lottery flag D lottery table in one Embodiment of this invention. It is a figure which shows an example of the lottery flag G lottery table in one Embodiment of this invention. It is a figure which shows an example of the lottery flag H lottery table in one Embodiment of this invention. It is a figure which shows an example of the lottery flag I-1 lottery table in one Embodiment of this invention. It is a figure which shows an example of the lottery flag I-2 lottery table in one Embodiment of this invention. It is a figure which shows an example of the lottery flag J lottery table in one Embodiment of this invention. It is a figure which shows an example of the lottery flag K lottery table in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 1) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 2) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 3) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 4) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 5) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 6) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 7) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 8) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 9) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 10) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 11) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 12) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 13) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 14) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 15) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 16) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 17) in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 18) in one Embodiment of this invention. It is a figure which shows an example of the general and CZ ART stock area distribution lottery table (the 1) in one Embodiment of this invention. It is a figure which shows an example of the general and CZ ART stock area distribution lottery table (the 2) in one Embodiment of this invention. It is a figure which shows an example of the table number determination table at the time of the stock in the general and CZ in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 1) at the time of a confirmed combination in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 2) at the fixed combination in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 3) at the fixed combination in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 4) at the time of a confirmed combination in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 5) at the time of a confirmed combination in one Embodiment of this invention. It is a figure which shows an example of the table number determination table at the time of the stock at the time of fixed combination in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 1) in B_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 2) in B_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 3) in B_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 4) in B_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 5) in B_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 6) in B_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 7) in B_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 8) in B_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 9) in B_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 10) in B_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 11) in B_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 12) in B_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 1) in D_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 2) in D_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 3) in D_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 4) in D_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 5) in D_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 6) in D_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 7) in D_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 8) in D_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 9) in D_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 10) in D_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 11) in D_ART in one Embodiment of this invention. It is a figure which shows an example of ART lottery table (the 12) in D_ART in one Embodiment of this invention. It is a figure which shows an example of the table number determination table at the time of stock in B_ART and D_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 1) in G_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 2) in G_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 3) in G_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 4) in G_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 5) in G_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 6) in G_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 1) in R_ART in one Embodiment of this invention. It is a figure which shows an example of the ART lottery table (the 2) in R_ART in one Embodiment of this invention. It is a figure which shows an example of the table number determination table at the time of stock in G_ART and R_ART in one Embodiment of this invention. It is a figure which shows an example of the ART stock area distribution lottery table (the 1) in one Embodiment of this invention. It is a figure which shows an example of the ART stock area distribution lottery table (the 2) in one Embodiment of this invention. It is a figure which shows an example of the ART stock area distribution lottery table (the 3) in ART in one Embodiment of this invention. It is a figure which shows an example of the ART stock area distribution lottery table (the 4) in one Embodiment of this invention. It is a figure which shows an example of ART bonus lottery table (the 1) in one Embodiment of this invention. It is a figure which shows an example of ART bonus lottery table (the 2) in one Embodiment of this invention. It is a figure which shows an example of the table number determination table at the time of stock in bonus in one Embodiment of this invention. It is a figure which shows an example of the special ART lottery table (the 1) in one Embodiment of this invention. It is a figure which shows an example of the special ART lottery table (the 2) in one Embodiment of this invention. It is a figure which shows an example of the table number determination table at the time of special ART in one Embodiment of this invention. It is a figure which shows an example of the ART stock non-consumption lottery table (the 1) in one Embodiment of this invention. It is a figure which shows an example of the ART stock non-consumption lottery table (the 2) in one Embodiment of this invention. It is a figure which shows an example of the stock content determination table of the ART lottery result in one Embodiment of this invention. It is a figure which shows an example of the lottery table of billy touch correct answer / wrong answer at the time of VR lock in one embodiment of the present invention. It is a figure which shows an example of the billy touch lottery table (the 1) in VR in one Embodiment of this invention. It is a figure which shows an example of VR billy touch lottery table (the 2) in one Embodiment of this invention. It is a figure which shows an example of VR billy touch lottery table (the 3) in one Embodiment of this invention. It is a figure which shows an example of the billy touch lottery table (the 4) in VR in one Embodiment of this invention. It is a figure which shows an example of the VR revolution revolution lottery table (the 1) in one Embodiment of this invention. It is a figure which shows an example of the VR revolution revolution lottery table (the 2) in one Embodiment of this invention. It is a figure which shows an example of the VR revolution revolution lottery table (the 3) in one Embodiment of this invention. It is a figure which shows an example of VR revolution revolution lottery table (the 4) in one Embodiment of this invention. It is a figure which shows an example of the VR revolution revolution lottery table (the 5) in one Embodiment of this invention. It is a figure which shows an example of the VR revolution revolution lottery table (the 6) in one Embodiment of this invention. It is a figure which shows an example of the VR revolution revolution lottery table (the 7) in one Embodiment of this invention. It is a figure which shows an example of VR revolution revolution lottery table (the 8) in one Embodiment of this invention. It is a figure which shows an example of the VR revolution revolution lottery table (the 9) in one Embodiment of this invention. It is a figure which shows an example of the VR revolution revolution lottery table (the 10) in one Embodiment of this invention. It is a figure which shows an example of the VR revolution revolution lottery table (the 11) in one Embodiment of this invention. It is a figure which shows an example of VR revolution revolution lottery table (the 12) in one Embodiment of this invention. It is a figure which shows an example of the VR revolution revolution lottery table (the 13) in one Embodiment of this invention. It is a figure which shows an example of the VR revolution revolution lottery table (the 14) in one Embodiment of this invention. It is a figure which shows an example of the VR revolution revolution lottery table (the 15) in one Embodiment of this invention. It is a figure which shows an example of the ART precursor game number lottery table (the 1) in one Embodiment of this invention. It is a figure which shows an example of the ART precursor game number lottery table (the 2) in one Embodiment of this invention. It is a figure which shows an example of the ART precursor game number lottery table (the 3) in one Embodiment of this invention. It is a figure which shows an example of the ART early warning game number lottery table (the 1) in one Embodiment of this invention. It is a figure which shows an example of the ART early warning game number lottery table (the 2) in one Embodiment of this invention. It is a figure which shows an example of the ART early warning game number lottery table (the 3) in one Embodiment of this invention. It is a figure which shows an example of the title lottery table for the development effects 1 in one Embodiment of this invention. It is a figure which shows an example of the production number determination table (the 1) for development effect 1 in one Embodiment of this invention. It is a figure which shows an example of the production | presentation number determination table (the 2) for development effect 1 in one Embodiment of this invention. It is a figure which shows an example of the effect determination table for the development effects 1 in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 1) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 2) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 3) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 4) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 5) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 6) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 7) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 8) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 9) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 10) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 11) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 12) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 13) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 14) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 15) in one Embodiment of this invention. It is a figure which shows an example of the scenario rewriting lottery table (the 16) in one Embodiment of this invention. It is a figure which shows an example of the title lottery table for the development effects 2 in one Embodiment of this invention. It is a figure which shows an example of the map lottery table (the 1) for development effect 2 in one Embodiment of this invention. It is a figure which shows an example of the map lottery table (the 2) for development effect 2 in one Embodiment of this invention. It is a figure which shows an example of the effect lottery table number determination table in one Embodiment of this invention. It is a figure which shows an example of the effect number lottery table for table number 1 in the one embodiment of the present invention (part 1). It is a figure which shows an example of the effect lottery table for table number 1 (the 2) in one Embodiment of this invention. It is a figure which shows an example of the effect lottery table for table number 2 (the 1) in one Embodiment of this invention. It is a figure which shows an example of the effect lottery table for table numbers 2 (the 2) in one Embodiment of this invention. It is a figure which shows an example of the production lottery table (the 1) for table number 24 in one Embodiment of this invention. It is a figure which shows an example of the effect lottery table for table number 24 (the 2) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 1) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 2) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 3) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 4) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 5) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 6) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 7) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 8) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 9) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 10) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 11) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 12) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 13) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 14) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 15) in one Embodiment of this invention. It is a figure which shows an example of the map rewriting lottery table (the 16) in one Embodiment of this invention. It is a figure which shows an example of the production rewriting condition table in one Embodiment of this invention. It is a figure which shows an example of the sub storage area in one Embodiment of this invention. It is a figure which shows the correspondence table of the table number and various states in one Embodiment of this invention. It is a figure which shows the correspondence table of the loop mode data and loop mode in one Embodiment of this invention. It is a main flowchart which shows the process example of the main control circuit of the game machine in one Embodiment of this invention. It is a flowchart which shows an example of the electric power interruption reset process in one Embodiment of this invention. It is a flowchart which shows an example of a medal reception and start check process in one Embodiment of this invention. It is a flowchart which shows an example of the random number acquisition process in one Embodiment of this invention. It is a flowchart which shows an example of the internal lottery process in one Embodiment of this invention. It is a flowchart which shows an example of the lottery value change process in one embodiment of this invention. It is a flowchart which shows an example of the game lock lottery process in one Embodiment of this invention. It is a flowchart which shows an example of the reel stop initial setting process in one Embodiment of this invention. It is a flowchart which shows an example of the lock process at the time of the game start in one Embodiment of this invention. It is a flowchart which shows an example of the drawing priority order storage process in one Embodiment of this invention. It is a flowchart which shows an example of the drawing priority order table selection process in one Embodiment of this invention. It is a flowchart which shows an example of the symbol code storage process in one Embodiment of this invention. It is a flowchart which shows an example of the reel stop control process in one Embodiment of this invention. It is a flowchart which shows an example of the stop button detection process in one Embodiment of this invention. It is a flowchart which shows an example of the sliding piece number determination process in one Embodiment of this invention. It is a flowchart which shows an example of the 2nd and 3rd stop process in one Embodiment of this invention. It is a flowchart which shows an example of the line change bit check process in one Embodiment of this invention. It is a flowchart which shows an example of the line mask data change process in one Embodiment of this invention. It is a flowchart which shows an example of the priority attraction | suction control process in one Embodiment of this invention. It is a flowchart which shows an example of the control change process in one Embodiment of this invention. It is a flowchart which shows an example of the control change process after the 2nd stop in one Embodiment of this invention. It is a flowchart which shows an example of the medal payout process in one Embodiment of this invention. It is a flowchart which shows an example of the error registration process in one Embodiment of this invention. It is a flowchart which shows an example of the table jump process in one Embodiment of this invention. It is a flowchart which shows an example of the table jump process in one Embodiment of this invention. It is a flowchart which shows an example of RT control processing in one Embodiment of this invention. It is a flowchart which shows an example of the game end effect control process in one Embodiment of this invention. It is a flowchart which shows an example of the bonus end check process in one Embodiment of this invention. It is a flowchart which shows an example of the initialization process in one Embodiment of this invention. It is a flowchart which shows an example of the bonus operation | movement check process in one Embodiment of this invention. It is a flowchart which shows an example of the interruption process by control of main CPU in one Embodiment of this invention. It is a flowchart which shows an example of the electric power interruption detection process in one Embodiment of this invention. It is a flowchart which shows an example of the main board | substrate communication task performed by sub CPU in one Embodiment of this invention. It is a flowchart which shows an example of the production registration task performed by sub CPU in one Embodiment of this invention. It is a flowchart which shows an example of the production content determination process in one Embodiment of this invention. It is a flowchart which shows an example of the process at the time of start command reception in one Embodiment of this invention. It is a flowchart which shows an example of the lottery flag determination process in one Embodiment of this invention. It is a flowchart which shows an example of the ART lottery process in one Embodiment of this invention. It is a flowchart which shows an example of the process in ART in one Embodiment of this invention. It is a flowchart which shows an example of the VR related process in one Embodiment of this invention. It is a flowchart which shows an example of the production | presentation determination process in one Embodiment of this invention. It is a flowchart which shows an example of the production rewriting process in one Embodiment of this invention. It is a flowchart which shows an example of the process at the time of the display combination command reception in one Embodiment of this invention. It is a flowchart which shows an example of the count process in one Embodiment of this invention. It is a flowchart which shows an example of the precursor check process in one Embodiment of this invention. It is a flowchart which shows an example of the process at the time of VR related display in one Embodiment of this invention. It is a flowchart which shows an example of the process at the time of the no-operation command reception in one Embodiment of this invention.

  Hereinafter, a pachislot machine will be exemplified as a gaming machine showing an embodiment of the present invention, and the configuration and operation thereof will be described with reference to the drawings. In the present embodiment, the winning probability of replay is displayed when an assist time (hereinafter referred to as “AT”) that is a function of navigating the establishment of a specific small role with a lamp or the like and a specific symbol combination is displayed. A pachislot machine having a function for operating a game state higher than normal, that is, a function for assist replay time (hereinafter referred to as “ART”) simultaneously operating with a function for replay time (hereinafter referred to as “RT”) will be described. .

<Function flow>
First, the functional flow of the pachislot will be described with reference to FIG. In the pachislot machine of this embodiment, medals are used as game media for playing games. In addition to the medals, coins, game balls, game point data, tokens, or the like can be applied as game media.

  When a player inserts a medal and operates the start lever, one value (hereinafter, random number value) is extracted from random numbers in a predetermined numerical range (for example, 0 to 65535).

  The internal lottery means performs lottery based on the extracted random number value and determines an internal winning combination. This internal lottery means is one of various processing means (processing functions) provided in a main control circuit described later. By determining the internal winning combination, a combination of symbols that permits display along an after-mentioned effective line (winning determination line) is determined. Note that the types of symbol combinations include those related to “winning” in which benefits such as payout of medals, replay (replay) operation, bonus operation, etc. are given to the player, and other so-called “losing” Such a thing is provided.

  Further, when the start lever is operated, a plurality of reels are rotated. Thereafter, when the player presses the stop button corresponding to the predetermined reel, the reel stop control means performs control to stop the rotation of the corresponding reel based on the internal winning combination and the timing when the stop button is pressed. Do. This reel stop control means is one of various processing means (processing functions) provided in a main control circuit described later.

  In the pachi-slot, basically, control for stopping the rotation of the corresponding reel is performed within a specified time (190 msec) from when the stop button is pressed. In the present embodiment, the number of symbols that move with the rotation of the reel within the specified time is referred to as “the number of sliding symbols”. In this embodiment, the maximum number of sliding symbols is set to 4 symbols.

  The reel stop control means, when the internal winning combination permitting the symbol combination display related to the winning is determined, normally, the symbol combination is placed on the active line within a specified time of 190 msec (four symbols). The rotation of the reel is stopped so as to display as much as possible. In addition, the reel stop control means uses various specified times corresponding to the gaming state to stop the rotation of the reels so that combinations of symbols that are not permitted to be displayed by the internal winning combination are not displayed along the active line. Let

  Thus, when the rotation of the plurality of reels is all stopped, the winning determination means determines whether or not the combination of symbols displayed along the active line relates to winning. This winning determination means is also one of various processing means (processing functions) provided in the main control circuit described later. Then, when it is determined by the winning determination means that the displayed symbol combination is related to winning a prize, a reward such as a medal payout is given to the player. In the pachislot, a series of flows as described above is performed as one game (unit game).

  Also, in the pachislot, in the above-described series of gaming operations, video display performed by a display device such as a liquid crystal display device, light output performed by various lamps, sound output performed by a speaker, or a combination thereof is performed. Various effects are performed using it.

  Specifically, when the start lever is operated, an effect random number value (hereinafter referred to as effect random number value) is extracted in addition to the random value used for determining the internal winning combination described above. When the effect random number is extracted, the effect content determination means determines the effect to be executed this time from lots of effects related to the internal winning combination. This effect content determination means is one of various processing means (processing functions) provided in a sub-control circuit described later.

  Next, when the content of the effect is determined by the effect content determination means, the effect execution means responds in conjunction with each opportunity such as when the rotation of the reel starts, when the rotation of each reel stops, or when the presence or absence of a prize is determined. Execute. In this way, in the pachislot machine, the player has the opportunity to know or predict the determined internal winning combination (in other words, the combination of symbols to be aimed at) by executing the production contents associated with the internal winning combination. It is possible to improve the player's interest.

<Pachislot structure>
Next, the structure of the pachislot machine according to the present embodiment will be described with reference to FIGS.

[Appearance structure]
FIG. 2 is a perspective view showing the external structure of the pachi-slot 1.

  As shown in FIG. 2, the pachi-slot 1 includes an exterior body 2. The exterior body 2 includes a cabinet 2a that houses a reel, a circuit board, and the like, and a front door 2b that is attached to the cabinet 2a so as to be opened and closed.

  Handles 7 are provided on both side surfaces of the cabinet 2a (only the handle 7 on one side surface is shown in FIG. 2). The handle 7 is formed of a concave member, and an operator's hand is put on the handle 7 when carrying the pachislot 1.

  Inside the cabinet 2a, three reels 3L, 3C, 3R (variable display means) are provided, and the three reels 3L, 3C, 3R are arranged in a row in the horizontal direction (direction perpendicular to the rotation direction of the reels). Is done. Hereinafter, the reels 3L, 3C, and 3R are referred to as a left reel 3L, a middle reel 3C, and a right reel 3R, respectively. Each reel (display row) has a reel body formed in a cylindrical shape, and a translucent sheet material mounted on the peripheral surface of the reel body. On the surface of the sheet material, a plurality of (for example, 21) symbols are drawn along the circumferential direction (reel rotation direction), and the symbols adjacent to each other along the symbol arrangement direction are arranged at predetermined intervals. The

  The front door 2 b includes a door body 9, a front panel 10, and a liquid crystal display device 11. The door body 9 is attached to the cabinet 2a so as to be openable and closable using a hinge (not shown). The hinge is provided at the left side end of the door body 9 when the door body 9 is viewed from the front side (player side) of the pachi-slot 1.

  The liquid crystal display device 11 is attached to the upper part of the door body 9 and executes an effect by displaying an image. The liquid crystal display device 11 includes a display unit (display screen) 11a including a display window 4 for displaying symbols drawn on the left reel 3L, the middle reel 3C, and the right reel 3R. In the present embodiment, the entire display unit 11a including the display window 4 is used to display an image and execute an effect.

  The display window 4 is formed of a transparent member such as an acrylic plate. The display window 4 is provided at a position overlapping the arrangement area of the three reels when viewed from the front (player side), and is provided at a position closer to the player (player side) than the three reels. Therefore, the player can visually recognize the three reels provided behind the display window 4 through the display window 4.

  In the present embodiment, when the rotation of the corresponding reel provided behind the display window 4 stops, the display window 4 is continuously arranged among a plurality of symbols drawn (arranged) on each reel. It is set to a size that can display two symbols. Therefore, within the frame of the display window 4, there are provided upper, middle and lower symbol display areas (hereinafter referred to as upper, middle and lower areas, respectively) for each reel, one for each symbol display area. Is displayed. That is, the display window 4 displays symbols in a 3 × 3 array form. In this embodiment, a line (center line) connecting the middle stage area of the left reel 3L, the middle stage area of the middle reel 3C, and the middle stage area of the right reel 3R is defined as an effective line for determining whether or not a prize is won. To do.

  The front panel 10 is attached so as to cover the peripheral portion of the display screen (display unit 11a) of the liquid crystal display device 11 at the upper part of the door main body 9, and is disposed so as to overlap the front side surface of the display unit 11a. The The front panel 10 includes a decorative frame 101 in which three panel openings 101a, 101b, and 101c are formed to expose a necessary display screen area in the display unit 11a of the liquid crystal display device 11, and three panel openings of the decorative frame 101. And a transparent protective cover (not shown) that covers 101a, 101b, and 101c.

  The decorative frame 101 further includes a partition piece 112 that partitions the panel opening 101a and the panel opening 101b, and a partition piece 113 that partitions the panel opening 101b and the panel opening 101c. That is, the three panel openings 101a, 101b, and 101c are arranged so as to be lined up and down by the partition pieces 112 and 113. In the present embodiment, as shown in FIG. 2, the upper area of the display unit 11a of the liquid crystal display device 11 is exposed in the panel opening 101a of the decorative frame 101, and the lower part of the display unit 11a is exposed in the panel opening 101c. Partition pieces 112 and 113 are arranged in the panel opening 101b so that the central region of the display unit 11a and the display window 4 of the three reels are exposed in the panel opening 101b.

  Two character decoration portions 22L and 22R (hereinafter also referred to as a left character decoration portion 22L and a right character decoration portion 22R) are provided in the vicinity of both corners at the upper end of the decoration frame 101. In the present embodiment, a character called “Billy” is formed in a three-dimensional shape on the surface of each character decoration portion.

  Although not shown in FIG. 2, two touch sensors 23L and 23R (hereinafter also referred to as a left touch sensor 23L and a right touch sensor 23R) are provided on the two character decoration portions 22L and 22R, respectively (see FIG. 2). 4 and FIG. 8). The left touch sensor 23L detects that the player's hand has touched (or approached) the left character decoration portion 22L, and the detection result is sent to a sub-control circuit 42 (see FIGS. 4 and 8) described later. Send. On the other hand, the right touch sensor 23R detects that the player's hand has touched (or approached) the right character decoration portion 22R, and transmits the detection result to a sub-control circuit 42 described later.

  Furthermore, the decorative frame 101 is provided with various lamps (lamp group 21) and a movable decorative unit 121 (see FIGS. 4 and 8). The lamp group 21 includes LEDs (Light Emitting Diodes) and the like, and turns on and off the light in a pattern corresponding to the effect contents.

  The movable decorative unit 121 is disposed on the back side of the decorative frame 101 (opposite to the player side), and is hidden behind the decorative frame 101 during normal times (when a specific performance is not performed). The When a specific effect is performed, the movable decorative unit 121 moves to the front side of the display unit 11 a and becomes visible from the panel opening 101 a of the decorative frame 101.

  A pedestal 12 is provided in the center of the door body 9. The pedestal portion 12 is provided with various devices (medal insertion slot 13, MAX bet button 14, 1 BET button 15, start lever 16, three stop buttons 17L, 17C, 17R, etc.) to be operated by the player.

  The medal slot 13 is provided for receiving a medal dropped on the pachislot 1 from the outside by the player. The medals received from the medal slot 13 are used in one game with a preset number (for example, three) as the upper limit, and the number of medals exceeding the preset number are stored inside the pachislot 1. (So-called credit function).

  The MAX bet button 14 and the 1BET button 15 are provided for determining the number of coins used for one game from medals deposited inside the pachislot 1. Although not shown in FIG. 2, the base unit 12 is provided with a settlement button. This checkout button is provided to pull out (discharge) medals deposited inside the pachi-slot 1 to the outside.

  The start lever 16 is provided to start rotation of all reels (3L, 3C, 3R). The stop buttons 17L, 17C, and 17R are provided in association with the left reel 3L, the middle reel 3C, and the right reel 3R, respectively, and each stop button is provided to stop the rotation of the corresponding reel. Hereinafter, the stop buttons 17L, 17C, and 17R are referred to as a left stop button 17L, a middle stop button 17C, and a right stop button 17R, respectively.

  Although not shown in FIG. 2, the pedestal 12 is provided with a 7-segment display 6 (see FIG. 4) made up of 7-segment LEDs (Light Emitting Diodes). The 7-segment display 6 has information such as the number of medals to be paid out to the player as a privilege (hereinafter referred to as the number of payouts), the number of medals deposited inside the pachislot 1 (hereinafter referred to as the number of credits), and the like. Is digitally displayed.

  At the lower part of the door body 9, a medal payout port 18, a medal tray 19, two speakers 20L, 20R, and the like are provided. The medal payout port 18 guides medals discharged by driving a medal payout device 33 described later to the outside. The medal tray 19 stores medals discharged from the medal payout opening 18. The two speakers 20L and 20R output sound such as sound effects and music corresponding to the contents of the performance.

[Internal structure]
Next, the internal structure of the pachislo 1 will be described with reference to FIG. FIG. 3 is a view for explaining the internal structure of the pachi-slot 1, and is a view showing a state when the front door 2b is opened with respect to the cabinet 2a.

  The cabinet 2a is configured by a substantially rectangular parallelepiped box-shaped member having one surface on the front side (front door 2b side) opened.

  Near the upper end in the cabinet 2a, a main board 31 on which a main control circuit 41 (see FIG. 4) described later is mounted is provided. The main control circuit 41 is a circuit that controls the main operation of the game in the pachislot machine 1 and the flow between the operations, such as determination of an internal winning combination, rotation and stop of each reel, determination of the presence / absence of a prize, and the like. The specific configuration of the main control circuit 41 will be described in detail later.

  A reel unit including a left reel 3L, a middle reel 3C, and a right reel 3R is provided near the center of the cabinet 2a. Although not shown in FIG. 3, each reel is connected to a corresponding stepping motor described later (any of stepping motors 61L, 61C, 61R in FIG. 4) via a gear having a predetermined reduction ratio. .

  Near the lower end in the cabinet 2a, a medal payout device 33 (hereinafter referred to as a hopper 33) having a structure capable of storing a large amount of medals and discharging them one by one is provided. Further, in the vicinity of the lower end in the cabinet 2a, a power supply device 34 that supplies necessary power to each device of the pachislot 1 is provided on one side of the hopper 33 (left side in the example shown in FIG. 3). It is done.

  A sub-board 32 on which a sub-control circuit 42 (see FIG. 4 and FIG. 8), which will be described later, is mounted is provided in the vicinity of the upper end of the back side of the front door 2b (the side opposite to the display screen). The sub-control circuit 42 is a circuit that controls the execution of effects by displaying images. The specific configuration of the sub control circuit 42 will be described in detail later.

  Further, a selector 35 is provided in the vicinity of the substantially central portion on the back surface side of the front door 2b. The selector 35 is a device for selecting whether or not the material or shape of the medal inserted from the outside through the medal insertion slot 13 (see FIG. 2) is appropriate. To guide. Although not shown in FIG. 3, a medal sensor 35 </ b> S (see FIG. 4) that detects that an appropriate medal has passed is provided on the path through which the medal passes in the selector 35.

<Configuration of circuits provided in pachislot>
Next, a configuration of a circuit included in the pachislo 1 will be described with reference to FIGS. FIG. 4 is a block configuration diagram of the entire circuit provided in the pachislot 1. FIG. 5 is a schematic configuration diagram (memory map image diagram) of various data storage areas provided in the main RAM included in the main control circuit. FIG. 6 is a block diagram showing the internal configuration of the microcomputer provided in the main control circuit. FIG. 7 is a diagram illustrating an outline of various random value storage operations in the present embodiment. FIG. 8 is a block diagram showing the internal configuration of the sub control circuit.

  As shown in FIG. 4, the pachi-slot 1 includes a main control circuit 41 (main control means), a sub control circuit 42 (sub control means), and peripheral devices (actuators) electrically connected to these circuits. .

[Main control circuit]
The main control circuit 41 is mainly configured by a microcomputer 50 (main control arithmetic unit) mounted on a circuit board (main board 31). As other components, the main control circuit 41 includes a clock pulse generation circuit 54, a frequency divider 55, an external random number generator 56 (external random number generation unit), a sampling circuit 57, a display unit drive circuit 64, and a hopper drive circuit 65. , And a payout completion signal circuit 66.

  The microcomputer 50 is composed of an 8-bit microprocessor for gaming machines, and this 8-bit microprocessor for gaming machines has a security function that prevents falsification, reading, etc. of user programs.

  As shown in FIG. 4, the microcomputer 50 includes a main CPU (Central Processing Unit) 51 (main control arithmetic unit), a main ROM (Read Only Memory) 52 (first storage unit), and a main RAM (Random Access Memory). ) 53 (second storage unit). In the present embodiment, the main CPU 51 is composed of an NC80EX CPU that is an extension of the Z80 CPU instruction set.

  Furthermore, in this embodiment, although not shown in FIG. 4, the microcomputer 50 includes two internal random number generators (see FIG. 6 described later). Details of the internal configuration of the microcomputer 50 will be described later with reference to the drawings. Further, in this specification, a random number generated by an internal random number generator (internal random number generator) provided inside the microcomputer 50 is referred to as an “internal random number (or internal random number value)” and is external to the microcomputer 50. The random number generated from the external random number generator 56 provided in is referred to as “external random number (or external random value)”.

  The main ROM 52 stores a control program for various processes executed by the main CPU 51, a data table such as an internal lottery table, data for transmitting various control commands (commands) to the sub control circuit 42, and the like.

  The main RAM 53 is provided with a storage area for temporarily storing various data such as an internal winning combination determined by execution of the control program. Each of the various data is stored in a storage area of a predetermined address in the main RAM area. Specifically, as shown in FIG. 5, each data such as a checksum value, various setting values, various random values, and a power interruption occurrence flag is stored in a storage area of a predetermined address in the main RAM area. In order to simplify the description, FIG. 5 only shows a storage form example of various data used in various characteristic processes of the main CPU 51 to be described later, and is stored in another storage area in the main RAM area. Illustration of various data is omitted. Further, in the description of FIG. 5, the address of the storage area described at a higher level is the head address (smaller address value).

  Connected to the main CPU 51 are a clock pulse generation circuit 54, a frequency divider 55, an external random number generator 56 and a sampling circuit 57. The clock pulse generation circuit 54 and the frequency divider 55 generate (generate) a clock pulse. The main CPU 51 executes various control programs based on the generated clock pulse. The external random number generator 56 generates an external random number (for example, 0 to 65535) within a predetermined range. Then, the sampling circuit 57 extracts one value from the generated external random number.

  The external random number generator 56 is a random number generator capable of generating one channel of a 16-bit (2-byte) external random number value. The generated external random number value is provided in the external random number generator 56. Latched (held) in an external latch random number register (not shown). When the main CPU 51 reads (acquires) the external random number value latched in the external latch random number register, the latch operation of the external latch random number register is automatically released. In the present embodiment, the external random number value generated by the external random number generator 56 is used as a random value for internal winning combination lottery.

  Various switches and various sensors are connected to the input port of the microcomputer 50. The main CPU 51 receives input signals from various switches and controls the operation of peripheral devices such as stepping motors 61L, 61C, 61R.

  The stop switch 17S (stop operation detecting means) detects that each of the left stop button 17L, the middle stop button 17C, and the right stop button 17R is pressed (stop operation) by the player. The start switch 16S (start operation detecting means) detects that the start lever 16 has been operated by the player (start operation). The settlement switch 14S detects that the settlement button has been pressed by the player. The bet switch 12S detects that the player has pressed the bet button (MAX bet button 14 or 1BET button 15).

  The medal sensor 35S (insertion operation detecting means) detects that a medal inserted into the medal insertion slot 13 has passed through the selector 35.

  Peripheral devices whose operations are controlled by the microcomputer 50 include three stepping motors 61L, 61C, 61R (variation display means), a 7-segment display 6, and a hopper 33. A drive circuit for controlling the operation of each peripheral device is connected to the output port of the microcomputer 50. Specifically, the motor drive circuit 62, the display unit drive circuit 64 and the hopper drive circuit 65 are connected to the output port of the microcomputer 50.

  The motor drive circuit 62 controls the drive of the three stepping motors 61L, 61C, 61R provided corresponding to the left reel 3L, the middle reel 3C, and the right reel 3R, respectively. The reel position detection circuit 63 detects, for each reel, a reel index indicating that the reel has made one rotation by an optical sensor having a light emitting unit and a light receiving unit. The reel position detection circuit 63 is connected to an input port of the microcomputer 50 and outputs a detection result to the microcomputer 50.

  Each of the three stepping motors 61L, 61C, 61R has a configuration in which the momentum is proportional to the number of output pulses, and the rotation axis can be stopped at a specified angle. The driving force of each stepping motor is transmitted to the corresponding reel via a gear having a predetermined reduction ratio. Each time one pulse is output to each stepping motor, the corresponding reel rotates at a constant angle.

  The main CPU 51 detects the reel index of each reel and then counts the number of times a pulse is output to the corresponding stepping motor, thereby determining the rotation angle of each reel (specifically, how many reels the number of symbols is). Only managed).

  Here, a method for managing the rotation angle of each reel will be specifically described. The number of pulses output to each stepping motor is counted by a pulse counter (not shown) provided in the main RAM 53. Each time the output of a predetermined number of pulses (for example, 16 times) necessary for the rotation of one symbol is counted by the pulse counter, the value of the symbol counter (not shown) provided in the main RAM 53 is set to “1”. "Is added. A symbol counter is provided for each reel. The value of the symbol counter is cleared when the reel index is detected by the reel position detection circuit 63.

  In other words, in the present embodiment, by managing the value of the symbol counter, it is managed how many symbols have been rotated since the reel index was detected. Therefore, the position of each symbol on each reel is detected with reference to the position where the reel index is detected.

  The display unit drive circuit 64 controls the operation of the 7-segment display 6. The hopper drive circuit 65 controls the operation of the hopper 33. The payout completion signal circuit 66 manages the detection of medals performed by the medal detection unit 33S provided in the hopper 33, and checks whether or not medals discharged from the hopper 33 have reached a predetermined payout number. To do. The payout completion signal circuit 66 is connected to the input port of the microcomputer 50 and outputs the check result to the microcomputer 50.

  Further, an external terminal board 18S is connected to the main control circuit 41. The main control circuit 41 is connected to the external hall computer / calling device 100 via the external terminal board 18S. The main control circuit 41 transmits a jackpot signal “3” to be described later to the hall computer / calling device 100 when a predetermined internal winning combination is won and a predetermined stop operation sequence is detected.

[Microcomputer configuration]
Next, the internal configuration of the microcomputer 50 will be described with reference to FIG.

  The microcomputer 50 includes not only the main CPU 51, the main ROM 52, and the main RAM 53, but also a 16-bit internal random number generator 58 (first internal random number generator) and an 8-bit internal random number generator 59 (connected to the main CPU 51). A second internal random number generator). Although not shown in FIG. 6, the microcomputer 50 includes various circuits such as a counter circuit, a serial communication circuit, an input / output port, and a WDT (watchdog timer).

  The 16-bit internal random number generator 58 is a random number generator capable of generating four channels (“ch. 0” to “ch. 3”) of 16-bit (first bit number) internal random values. The 8-bit internal random number generator 59 is a random number generator that can generate 8 channels (second bit number) of internal random numbers in four channels (“ch. 0” to “ch. 3”). .

  Each internal random number generator is provided with an internal latch random number register (random number register unit) for latching (holding) an internal random number value for each channel (see FIG. 7 to be described later). The numeric value is latched into the corresponding internal latch random number register. In this embodiment, when the main CPU 51 reads (acquires) the internal random number value latched in the internal latch random number register, the latch operation of the internal latch random number register is automatically released for each channel. In the present embodiment, the various internal random number values generated by the internal random number generators are lottery values (descriptions described later) that are controlled by the main CPU 51, for example, when determining the content of a reel effect such as a game lock described later. Used as a lottery value 1 and a lottery value 2) for production. However, the present invention is not limited, and one of various internal random number values may be used as the random number value for the internal winning combination lottery.

  That is, in the present embodiment, when a plurality of random numbers are required in the control process of the main CPU 51, a plurality of high-speed agitation is performed without generating a soft random number by processing an external random number (hard random number) as in the prior art. A plurality of random number values (hard random numbers) are acquired using a random number generator. Therefore, in this embodiment, the bias of each random number value can be further reduced. In the present embodiment, random numbers are acquired from separate channels for lottery of internal winning combination or production (game lock, etc.), so that the probability of occurrence of each lottery result is easily reproduced as designed. Become.

  Furthermore, in the present embodiment, a program for generating a soft random number is not necessary, and therefore compression of the program area (ROM) is also suppressed. Further, in this case, programs such as other effects can be stored in the program area as much as the amount of the program that is not required, and the game performance can be improved.

  In this embodiment, the example using the microcomputer 50 equipped with two internal random number generators has been described. However, the present invention is not limited to this, and one or three or more internal random number generators are installed. A configured microcomputer may be used. In the present embodiment, the example in which the number of bits of the internal random number value generated by each of the two internal random number generators is different from each other has been described. However, the present invention is not limited to this, and the two internal random number generators The generated internal random number values may have the same number of bits. Furthermore, in this embodiment, for example, when there is a margin in the capacity of the program area and the processing capacity of the main CPU 51, the obtained external random number value or internal random number value is processed on software to generate a soft random number separately. A function may be provided.

<Characteristic processing functions of the main CPU>
Here, various characteristic processing functions included in the main CPU 51 (microcomputer 50) of the present embodiment will be described.

[Internal random number batch acquisition function (LDIRS command)]
In the present embodiment, the main CPU 51 uses a plurality of internal random number values generated in the channels of the 16-bit internal random number generator 58 and the 8-bit internal random number generator 59 mounted on the microcomputer 50 as one predetermined execution command. (Hereinafter referred to as “LDIRS instruction”) can be collectively stored in the random value storage area in the main RAM 53. FIG. 7 shows how the internal random number is acquired and stored in the present embodiment.

  In FIG. 7, for simplification of explanation, an internal latch random number register of each channel provided in each internal random number generator and an internal random number value latched by the internal latch random number register are stored. Only the relationship with the corresponding storage area in the numerical value storage area (main RAM 53) is shown, but in the random value storage area, a storage area (not shown) for storing the external random number value generated by the external random number generator 56 is shown. ) Is also provided.

  Further, in the present embodiment, the plurality of internal latch random number registers are arranged so that the addresses are continuous. In the description of FIG. 7, the internal latch random number register described in a higher level is the same as the plurality of internal latch random number registers. It is assumed that the address is located at the head address in the address range (smaller address value). Furthermore, in this embodiment, the addresses of the internal random number storage areas in the random value storage area are continuous. In the description of FIG. In the address range of the internal random number storage area, it is located at the head address.

  In the present embodiment, each internal random number generator is provided with an internal latch random number register for latching an internal random value for each channel. Note that two 8-bit internal latch random number registers are provided in a channel in which a 16-bit internal random number value is generated, and an 8-bit internal latch random number register is 1 in a channel in which an 8-bit internal random number value is generated. Are provided. That is, in this embodiment, for a 16-bit internal random number value, one 8-bit internal latch random number register constitutes one random number register unit, and for an 8-bit internal random number value, 1 One 8-bit internal latch random number register constitutes one random number register unit. A plurality of internal random number values generated in a plurality of channels of each internal random number generator are latched in a plurality of corresponding random number register units. At this time, each internal random number value is sequentially latched sequentially (in the order of addresses) in the corresponding random number register unit (each internal random value is separately latched separately).

  Specifically, the “internal latch random number register L0L” and the “internal latch random number register L0H” in the 16-bit internal random number generator 58 in FIG. The generated 16-bit internal random number value (“random number value Y”) is latched, and “ch.1” of the 16-bit internal random number generator 58 is stored in the “internal latch random number register L1L” and the “internal latch random number register L1H”. The 16-bit internal random number value ("random number value Z") generated by "is latched. Also, the “internal latch random number register L2L” and the “internal latch random number register L2H” in the 16-bit internal random number generator 58 in FIG. A 16-bit internal random number value (“random number N”) is latched, and “internal latch random number register L3L” and “internal latch random number register L3H” are generated by “ch.3” of 16-bit internal random number generator 58. The 16-bit internal random number value ("random number value O") is latched. At this time, in the 16-bit internal random number generator 58 of the present embodiment, for example, “random number value Y”, “random number value Z”, “random number value N”, and “random number value O” are successively separated in this order. Thus, the corresponding random number register unit is latch controlled.

  In the “internal latch random number register S0” in the 8-bit internal random number generator 59 in FIG. 7, an 8-bit internal random number value (“random number value” generated by “ch. 0” of the 8-bit internal random number generator 59 is stored. P ”) is latched, and the 8-bit internal random number value (“ random number Q ”) generated by“ ch.1 ”of the 8-bit internal random number generator 59 is latched in the“ internal latch random number register S1 ”. The In addition, the “internal latch random number register S2” in the 8-bit internal random number generator 59 in FIG. 7 stores an 8-bit internal random number value (“ Random number R ”) is latched, and the 8-bit internal random number value (“ random number S ”) generated by“ ch.3 ”of the 8-bit internal random number generator 59 is stored in the“ internal latch random number register S3 ”. Latched. At this time, in the 8-bit internal random number generator 59 of the present embodiment, for example, “random number value P”, “random number value Q”, “random number value R”, and “random number value S” are successively separated in this order. Thus, the corresponding random number register unit is latch controlled.

  In addition, the address of the storage area in the random number value storage area in which the internal random number value generated in each channel of the 16-bit internal random number generator 58 and the 8-bit internal random number generator 59 is stored is set in advance. The internal random number value is stored in a corresponding storage area of a predetermined address.

  In the present embodiment, when the LDIRS instruction is executed by the main CPU 51, a predetermined number of internal random number values are latched in the internal latch random number register in a predetermined address range, and the predetermined number of internal random number values are disturbed. Stored together (collectively) in the storage area of the corresponding specific address range in the numerical value storage area. Next, after the internal random number value is read, the latch operation of each internal latch random number register is also released at once.

  When executing the LDIRS instruction, the address of the internal latch random number register (transfer start address) located at the beginning of a predetermined address range and the start of a specific address range within the random value storage area The address of the storage area (transfer start address) and the number of internal random numbers to be extracted (stored) are set (set) as execution parameters of the LDIRS instruction.

  For example, when extracting and storing a plurality of internal random number values latched in the address range of “internal latch random number register L0L” to “internal latch random number register S3”, that is, 16-bit internal random number generator 58 and 8-bit internal When the internal random number values are extracted and stored from all the channels of the random number generator 59, the address of the “internal latch random number register L0L” is set as the start address (first set address) of the transfer source, and the transfer destination The address of the storage area of “random number Y” in the random number storage area is set as the start address (second setting address), and “8” is set as the number of internal random numbers to be extracted. When the LDIRS instruction is executed by the main CPU 51 with such instruction execution parameters set, as shown in FIG. 7, all channels of the 16-bit internal random number generator 58 and the 8-bit internal random number generator 59 are used. The internal random number values are latched, and each of the latched eight internal random number values is collectively stored in the corresponding eight storage areas in the random number storage area.

  Further, for example, when two 16-bit internal random values (effect random number 1 and effect random value 2) are extracted and stored as in this embodiment, “internal” Set the address of the latch random number register L0L (the start address of “ch.0”), set the address of the storage area of the “random number Y” in the random number storage area as the start address of the transfer destination, and extract the internal “2” is set as the number of random values. When the LDIRS instruction is executed by the main CPU 51 with such instruction execution parameters set, the internal random number values are latched by “ch.0” and “ch.1” of the 16-bit internal random number generator 58, respectively. , The internal random value latched by “ch.0” and the internal random value latched by “ch.1” are stored in the corresponding “random number value Y” and “random number value Z” in the random value storage area, respectively. Stored in the area collectively.

  Furthermore, for example, when extracting and storing a 16-bit internal random value and an 8-bit internal random value one by one, the address of the “internal latch random number register L3L” (16-bit internal Of the random number generator 58 is set, and the address of the storage area of the random number value O in the random value storage area is set as the transfer destination start address, and the internal random value to be extracted is set. Set “2” as the number. When the LDIRS instruction is executed by the main CPU 51 with such instruction execution parameters set, “ch.3” of the 16-bit internal random number generator 58 and “ch.0” of the 8-bit internal random number generator 59 are set. The internal random number value is latched by “ch.3” of the 16-bit internal random number generator 58 and the internal random value value latched by “ch.0” of the 8-bit internal random number generator 59. Are collectively stored in the corresponding “random value O” and “random number P” storage areas in the random value storage area.

  When one 16-bit internal random value and one 8-bit internal random value are extracted and stored, for example, these internal random values may be extracted as follows. First, the address of the “internal latch random number register L0L” (the start address of “ch.0” of the 16-bit internal random number generator 58) is set as the start address of the transfer source, and the random value storage area as the start address of the transfer destination The address of the storage area of “random number Y” is set, and “5” is set as the number of internal random numbers to be extracted. Next, the LDIRS instruction is executed by the main CPU 51 with such instruction execution parameters set. In this case, the four 16-bit internal random values latched by “ch. 0” to “ch. 3” of the 16-bit internal random number generator 58 are respectively the corresponding “random value Y” in the random value storage area. ~ The 8-bit internal random value stored in the random number value O storage area and latched by "ch.0" of the 8-bit internal random number generator 59 corresponds to the corresponding "random number value storage area" It is stored in the storage area for the random value P ”. Of the five stored internal random numbers, for example, a 16-bit internal random value stored in the storage area of “random number Y” and an 8-bit stored in the storage area of “random number P” The internal random number value is used as a random number value for lottery, and the remaining three internal random number values are not used as dummy.

  As described above, in this embodiment, a series of operations of generating and latching an internal random number value in each channel of the internal random number generator, reading and storing the internal random number value, and releasing the latch of the internal latch random number register are performed. Instead of sequentially performing each channel, it can be performed collectively by executing one instruction.

  With the internal random number acquisition function of the present embodiment described above, even if the number of random values to be used changes due to, for example, a difference in the type of gaming machine, the number of internal random values extracted when the LDIRS instruction is executed is changed. Just can cope. Also, regardless of the number of internal random number extractions, random numbers can be acquired in one batch by executing one instruction, so even if the number of internal random number extractions changes, the capacity of the execution program does not increase. The effect that the processing time does not change is obtained. Therefore, the above-described internal random number acquisition function of the pachislot machine 1 of the present embodiment is particularly effective for models with many types of effects controlled by the main CPU 51. More specific processing contents of the internal random number acquisition function (LDIRS instruction) described above will be described with reference to various flowcharts described later.

[Data clear and address update batch processing function (PUSH instruction)]
In the present embodiment, the main CPU 51 performs a clear process for data stored in the main RAM 53, for example, in an initialization process described later with reference to FIG. In the initialization process, the main CPU 51 normally clears data sequentially from the storage area of the trailing address toward the head address in the storage area of a predetermined range in the main RAM 53 (sets the clear value “0000H”). At this time, the main CPU 51 sequentially updates the address information of the storage area to be executed for each clear process from the tail address of the predetermined range toward the head address.

  The main CPU 51 of the present embodiment has a function of simultaneously performing such data clear processing (initial value writing processing) and address updating processing by one predetermined execution instruction (hereinafter referred to as “PUSH instruction”). Have. Therefore, in this embodiment, when data clear processing is performed on the main RAM 53, it is not necessary to separately execute an address update processing instruction.

  In the present embodiment, by executing the PUSH instruction, a return address is set in a register called a stack pointer (SP), and then a 2-byte data clear process is performed and an address for 2 bytes. An update process (a process of subtracting “2” from the address) is performed. Therefore, by using this PUSH instruction function, for example, by performing processing such as initialization processing of the main RAM 53 (data clear processing and address update processing), the processing time can be further shortened.

  For example, in a gaming machine that performs data initialization processing in units of 1 byte as in the prior art, for a data capacity that requires 1 msec of processing time for initialization processing (for example, initialization processing at the time of setting change), When the initialization process of the embodiment is applied, the initialization process can be performed with a processing time of about 0.6 msec (40% reduction). That is, in the pachislot machine 1 of this embodiment, the processing time of the initialization process can be shortened to about half of the conventional time. Further, in the present embodiment, the data clear process and the address update process in the main RAM 53 can be executed with one instruction, so that the program capacity of, for example, several bytes can be reduced.

  Since the main program capacity of the pachislot machine 1 is small and the specifications of the main CPU 51 are low due to the restrictions on the rules of the law of law (regulations on customs business and business optimization), the main control circuit 41 The processing capacity is not so high. Therefore, the performance of the gaming machine can be improved even when the processing time of the initialization process and the program capacity are reduced as described above. More specific processing contents of the data clear and address update batch processing function (PUSH instruction) described above will be described with reference to various flowcharts described later.

[Batch processing function for data acquisition and address update (POP instruction)]
In the present embodiment, the main CPU 51 performs a sum check process of the main RAM 53 in a process such as a power interruption recovery process described later with reference to FIG. In the sum check process, the main CPU 51 normally obtains data stored in a predetermined range of storage area in the main RAM 53 and calculates the sum value. At this time, for each data acquisition process, the main CPU 51 sequentially updates the address information of the storage area that is the execution target of the process from the head address to the tail address in the predetermined range.

  The main CPU 51 of the present embodiment has a function of simultaneously performing such data acquisition processing and address update processing by one predetermined execution instruction (hereinafter referred to as “POP instruction”). Therefore, in this embodiment, when data acquisition processing is performed on the main RAM 53, it is not necessary to separately execute an address update processing instruction.

  In the present embodiment, by executing the POP instruction, data acquisition processing for 2 bytes is performed from the address of the storage area set in the stack pointer (SP), and at the address set in the stack pointer (SP). On the other hand, an address update process for 2 bytes (a process of adding “2” to the address) is performed. Therefore, by using this POP command function, for example, by performing processing such as sum check processing of the main RAM 53 (data acquisition processing and address update processing), the processing time is reduced in the same manner as the initialization processing described above. It can be shortened more.

  In the present embodiment, the data acquisition process and the address update process in the main RAM 53 can be executed with a single instruction. Therefore, for example, a program capacity of about several bytes can be obtained as in the initialization process described above. Can be reduced. Therefore, the data acquisition and address update batch processing function (POP instruction) of the present embodiment can improve the performance of the gaming machine as in the case of the initialization process (PUSH instruction). More specific processing contents of the batch processing function (POP instruction) for data acquisition and address update described above will be described with reference to various flowcharts described later.

[Error registration processing function using table jump processing]
In the present embodiment, when an error relating to the hopper 33, an error relating to inserted medals, a RAM error, or an illegal hit error occurs, the main CPU 51 displays an error code corresponding to the error content in the storage area for error registration (not specified) in the main RAM 53. (Registered). Then, the error content information registered as an error is displayed on, for example, the 7-segment display 6 or the like.

  During the error registration process, the main CPU 51 refers to, for example, an error registration process relative position table described later with reference to FIG. 49, and relates to the start address of the corresponding error registration process program in the main ROM 52 based on the error code. Get information (relative position information). Then, the main CPU 51 calculates the start address of the corresponding error registration processing program based on the acquired relative position information, jumps the process to the start address (executes the table jump process), and sets the jump destination. Execute error registration processing.

  In the present embodiment, the start address of the error registration processing program in the main ROM 52 is a relative position (described later) defined in the error registration processing relative position table as the calculation reference position (reference address) of a preset address. (See FIG. 49). Further, in the present embodiment, the head address of the relative position table for error registration processing described later with reference to FIG. 49 is set as the address of the calculation reference position. More specific contents of the error registration process using the table jump process described above will be described with reference to various flowcharts described later.

  In the error registration processing function using the table jump processing described above, the type of error registration processing is not determined by branch processing, and various error registration processing is not executed in parallel, so that the processing amount can be reduced. Time can be shortened.

  Further, in the error registration process of the present embodiment described above, the relative position information of the head address of the error registration process program is defined by a table. In this case, as described later, the relative position information can be defined by 1-byte information. On the other hand, when the information of the start address of the error registration processing program is directly defined by a table, a capacity of 2 bytes is usually required. Therefore, in the error registration process according to the present embodiment, the usage amount of the table area and the program area in the main ROM 52 can be saved. That is, in the pachi-slot 1 of the present embodiment, an increase in processing load and table capacity in the main control circuit 41 can be suppressed by the error registration processing function using the table jump processing described above.

[Left stop button priority stop processing function]
In the present embodiment, when the left stop button 17L and the other stop buttons are pressed at the same time in the first stop operation of the reel, the main CPU 51 validates the pressing of the left stop button 17L and sets the other stop buttons. Disables pressing. Therefore, in this case, the main CPU 51 preferentially executes the stop control of the left reel 3L.

  In this specification, “when a plurality of stop buttons are pressed simultaneously” is not only a case where the pressing timings of the plurality of stop buttons completely coincide with each other, but also a predetermined that the main CPU 51 can recognize as “simultaneous”. This includes the case where a plurality of stop buttons are sequentially pressed within the period (for example, about 2 msec). The predetermined period during which the main CPU 51 can recognize “simultaneous” is appropriately set according to the model of the gaming machine, for example.

  As described above, in the first reel stop operation, when the left stop button 17L and the other stop buttons are pressed at the same time, the player mistakenly controls the stop by giving priority to the left reel 3L ( Even if a plurality of stop buttons are pressed (unintentionally), no penalty or re-pressing operation occurs, and the delay of the game can be suppressed. As a result, it is possible to prevent the player from being disadvantaged such as an improper penalty, and to reduce troubles between the player and the game store.

  In the present embodiment, in the pachislot machine 1 in which the pressing order in which the left stop button 17L is first pressed (that is, “forward pressing” described later) is permitted, the player mistakenly performs the left stop in the first stop operation. Although not only the button 17L but also another stop button is pressed, the above-described priority stop processing function of the left stop button 17L is provided in order to prevent the disadvantage of the pressing error, but the present invention is not limited to this.

  For example, also in the pachislot machine 1 in which the pressing order in which a predetermined stop button other than the left stop button 17L is first pressed (that is, “anomalous pressing” described later) is permitted, the above-described stop button priority stop function is similarly applied. Can be applied. In this case, if the player mistakenly presses not only the predetermined stop button other than the left stop button 17L but also other stop buttons in the first stop operation, it corresponds to the permitted predetermined stop button. The reel is controlled with priority.

  Moreover, although this embodiment demonstrated the example which applies the priority stop function of the stop button mentioned above at the time of 1st stop operation, this invention is not limited to this. When the reel to be stopped at the time of the second and third stop operations is determined, the same function as the priority stop function of the stop button described above may be applied also at the time of the second and third stop operations.

[Sub control circuit]
As shown in FIGS. 4 and 8, the sub control circuit 42 is electrically connected to the main control circuit 41 and performs processing such as determination and execution of effect contents based on a command transmitted from the main control circuit 41. . As shown in FIG. 8, the sub control circuit 42 basically includes a sub CPU 81, a sub ROM 82, a sub RAM 83 (sub storage means), a rendering processor 84, a drawing RAM 85, and a driver 86. Further, the sub control circuit 42 includes a DSP (Digital Signal Processor) 90, an audio RAM 91, an A / D (Analog to Digital) converter 92, an amplifier 93, and a movable decoration unit drive circuit 96.

  The sub CPU 81 performs video, sound, and light output control according to the control program stored in the sub ROM 82 based on the command transmitted from the main control circuit 41. The sub ROM 82 basically has a program storage area and a data storage area.

  Various control programs executed by the sub CPU 81 are stored in the program storage area. The control program stored in the program storage area includes, for example, a main board communication task for controlling communication with the main control circuit 41, a production random number value, and determination of production contents (production data). An effect registration task for performing registration, a drawing control task for controlling display of an image by the liquid crystal display device 11 based on the determined content of the effect, a lamp control task for controlling light output by the lamp group 21, and a speaker A program such as a voice control task for controlling sound output by 20L and 20R is included.

  The data storage area includes, for example, a storage area for storing various data tables, a storage area for storing effect data constituting various effects, a storage area for storing animation data related to video creation, and BGM (Back-Ground Music) And various storage areas such as a storage area for storing sound data relating to sound effects and a storage area for storing lamp data relating to light on / off patterns.

  The sub RAM 83 has a storage area for registering the determined contents of the effect, the effect data, and the like, a storage area for storing various data such as an internal winning combination transmitted from the main control circuit 41, and the like.

  Further, as shown in FIG. 8, peripheral devices such as the liquid crystal display device 11, the speakers 20L and 20R, the lamp group 21, the touch sensors 23L and 23R, and the movable decoration unit 121 are connected to the sub control circuit 42. . That is, the operations of these peripheral devices are controlled by the sub control circuit 42.

  In the present embodiment, the sub CPU 81, the rendering processor 84, the drawing RAM 85 (including the frame buffer), and the driver 86 create a video according to the animation data designated by the contents of the presentation, and the created video is generated by the liquid crystal display device 11. Is displayed.

  The sub CPU 81, the DSP 90, the audio RAM 91, the A / D converter 92, and the amplifier 93 output sounds such as BGM from the speakers 20L and 20R according to the sound data specified by the production contents. Further, the sub CPU 81 turns on and off the lamp group 21 according to the lamp data designated by the contents of the effect.

  Further, the sub CPU 81 and the movable decoration unit drive circuit 96 drive the movable decoration unit 121 according to the movable decoration unit drive data designated by the contents of the effect. That is, the movable decorative unit 121 is driven when a special effect is performed, and is exposed to the panel opening 101 a of the front panel 10.

  The touch sensors 23L and 23R detect that the player's hand has touched (touched) the left character decoration portion 22L or the right character decoration portion 22R, and the detection result is sent to the sub-control circuit 42 described later. Send.

<Configuration of data table stored in main ROM>
Next, the configuration of various data tables stored in the main ROM 52 will be described with reference to FIGS.

[Design arrangement table]
First, the symbol arrangement table will be described with reference to FIG. The symbol arrangement table is data (hereinafter referred to as symbol code (in FIG. 9) that specifies the position of each symbol in the rotation direction of each of the left reel 3L, the middle reel 3C, and the right reel 3R and the type of symbol arranged at each position. )))).

  In the symbol arrangement table, the position of the symbol located in the middle area of each reel within the frame of the display window 4 is defined as “0” when the reel index is detected. In each reel, the symbol counter value “0” corresponds to the value of the symbol counter in the order of advance in the reel rotation direction (from the symbol position “20” in FIG. 9 toward the symbol position “0”). “0” to “20” are assigned to the symbols as symbol positions.

  That is, by referring to the symbol counter values (“0” to “20”) and the symbol arrangement table, they are displayed in the upper, middle, and lower regions of each reel within the frame of the display window 4. The type of design can be specified. For example, when the value of the symbol counter corresponding to the left reel 3L is “7”, each of the upper region, the middle region, and the lower region of the left reel 3L within the frame of the display window 4 has the symbol position “8”. The symbol “Lip 2”, the symbol “Billy BAR” at the symbol position “7”, and the symbol “Rip 1” at the symbol position “6” are displayed.

[Design combination table]
Next, the symbol combination table (Nos. 1 to 5) will be described with reference to FIGS. The symbol combination table defines a correspondence relationship between a symbol combination predetermined according to the type of privilege, a display combination (storage area), and a payout number.

  In the present embodiment, when the symbol combination displayed by the left reel 3L, the middle reel 3C and the right reel 3R along the effective line (center line) matches the symbol combination specified in the symbol combination table. It is determined that the prize is won. When it is determined that a prize is won, the player is given benefits such as medal payout and replay operation. If the symbol combination displayed along the active line does not match any of the symbol combinations defined in the symbol combination table, it is a so-called “lost”. That is, in this embodiment, the symbol combination corresponding to “losing” is not defined in the symbol combination table, thereby defining the symbol combination “losing”. Note that the present invention is not limited to this, and the item “losing” may be provided in the symbol combination table to directly define “losing”.

  Various data described in the display combination column in the symbol combination table is data for identifying a symbol combination displayed along the active line. “Data” in the display combination column is represented by 1-byte data, and a unique symbol combination (content of display combination) is assigned to each bit in the data.

  The “storage area” data in the display combination column is data for designating a later-described display combination storage area (see FIG. 51 described later) in which the corresponding display combination is stored. In the present embodiment, 29 display combination storage areas are provided. In the present embodiment, display combinations having the same bit pattern (1-byte data pattern) and having different contents are managed as different display combinations depending on the “storage area”.

  The numerical value described in the payout number column in the symbol combination table represents the number of medals to be paid out to the player. In the combination of symbols to which a numerical value of 1 or more is given as the “paid-out number” data, the same number of medals are paid out.

  For example, in the present embodiment, when the number of inserted medals is 3, and any one of “C_C bell” to “C_B bell 24” is determined as the display combination, 12 medals are paid out. Performed (see FIGS. 11 and 12). Further, for example, when the number of inserted medals is one and one of “C_C bell” to “C_B bell 24” is determined as the display combination, 15 medals are paid out ( 11 and 12). Further, for example, in the present embodiment, when any one of “C_control bell 1” to “C_control bell 12” is determined as the display combination, even if the number of inserted medals is 1, Even if it is one sheet, one medal is paid out (see FIG. 12).

  In the present embodiment, for example, a display combination related to replay (any of combinations of symbols related to “C_C Lip 1” to “C_Billy Lip 18” shown in FIGS. 10 and 11) is determined as the display combination. When replaying, replay is activated.

  The display combinations related to “R_Bell Transition 2-1” to “R_Bell Transition 3-21” shown in the symbol combination table (No. 5) in FIG. 14 are “C_B Bell” (“C_B Bell 1” to “ This is a combination displayed when the symbol combination relating to “C_B bell 24”) cannot be stopped and displayed on the effective line (hereinafter, “bell bell spill”). As will be described later, the display combinations related to these “R_Bell transition 2-1” to “R_Bell transition 3-21” are display combinations that trigger the transition from the RT gaming state to the RT1 gaming state ( Transitional role). That is, when the symbol combination corresponding to any of “R_Bell Transition 2-1” to “R_Bell Transition 3-21” is stopped on the active line, the RT gaming state is RT1 described later. Transition to gaming state.

[Bonus operating table]
Next, the bonus operation time table will be described with reference to FIG. The bonus operation time table is stored in a game state flag storage area (see FIG. 52), a bonus end number counter, a game possible number counter, and a winning possible number counter provided in the main RAM 53 when the bonus is operated. Define the data.

  The game state flag is data for identifying the type of bonus game that is in operation. In this embodiment, as a bonus game type, a big bonus (hereinafter referred to as “BB”) and a regular bonus (hereinafter referred to as “RB”) are provided. “RB” is a so-called first type special combination. “BB” is referred to as an accessory continuous operation device related to the first type special accessory, and “RB” is operated continuously. Therefore, when “BB” is activated, “RB” is also activated.

  In the present embodiment, three types of “BB” (“BB1”, “BB2”, and “BB3”) are provided. Further, in the present embodiment, three types of “RB” (“RB1”, “RB2”, and “RB3”) are provided. When “BB1”, “BB2”, and “BB3” are in operation, “RB1”, “RB2”, and “RB3” are continuously operated, respectively.

  The bonus end number counter is a counter (data) for managing whether or not the number of medals paid out exceeds a specified number that triggers the end of the bonus game. In the present embodiment, when the symbol combination (see FIG. 10) corresponding to “C_don BB” or “C_red 7” is stopped and displayed on the active line, “BB1” is activated, and thereafter, the specified number “263” "BB1" is terminated when a medal exceeding "is paid out. In addition, when a symbol combination corresponding to “C_BAR” (see FIG. 10) is stopped and displayed on the active line, “BB2” is activated, and thereafter, medals exceeding the prescribed number “60” are paid out. Finally, “BB2” is terminated. Furthermore, when the symbol combination (see FIG. 10) corresponding to “C_Billy” is stopped and displayed on the active line, “BB3” is activated, and thereafter, medals exceeding the prescribed number “14” are paid out. In this case, “BB3” is terminated.

  In the operation of each “BB” described above, first, at the start of the bonus, a numerical value (specified number) defined in the bonus operation time table is stored in the bonus end number counter. Next, every time a medal is paid out during the bonus operation, the value of the bonus end number counter is subtracted. When the value of the bonus end number counter is updated to a value less than “0”, the active bonus is ended. In the present embodiment, “BB” started when the symbol combination related to “C_Don BB” is displayed, and “BB” started when the symbol combination related to “C_Red 7” is displayed. Both are set to “BB1”, and both are managed by the same game state flag. However, the present invention is not limited to this, and “BB” started when the symbol combination related to “C_Don BB” is displayed and “C_Red 7” started when the symbol combination is displayed “ BB "may be managed by different game state flags.

  The game possible number counter is a counter (data) for managing the number of remaining games that can be played at the time of “RB” operation, that is, the so-called game possible number. The winning possible number counter is a counter (data) for managing the number of remaining games that can display a combination of symbols related to winning at the time of “RB” operation, so-called winning possible number.

[RT transition table]
Next, the RT transition table will be described with reference to FIG. The RT transition table defines the correspondence relationship between the RT gaming state transition conditions and the transition source and destination RT gaming states.

  In this embodiment, four types of states, RT0 gaming state to RT3 gaming state, are provided as the RT gaming state, which are different from each other in the type of internal winning combination of replay and the winning probability. In the present embodiment, as shown in FIG. 16, the fact that a predetermined internal winning combination has been won, or that a combination of symbols related to a specific internal winning combination has been stopped and displayed on the active line, etc. It becomes a transition condition between states.

  Specifically, when an internal winning combination of "C_Don BB", "C_Red 7" or "C_BAR", that is, a combination related to "BB1" or "BB2" is won, the RT gaming state is Transition to the RT3 gaming state. In this case, the RT gaming state of the transition source (before transition) is any one of the RT0 gaming state to the RT2 gaming state.

  In addition, when the combination related to “C_Billy”, that is, the combination related to “BB3” is won as an internal winning combination, the RT gaming state shifts to the RT0 gaming state. In this case, the RT gaming state of the transition source (before transition) is any one of the RT0 gaming state to the RT2 gaming state. Furthermore, when the operation of any one of “BB1” to “BB3” is completed, the RT gaming state shifts to the RT0 gaming state. The internal winning combination “C_Don BB” is a specific example of a specific internal winning combination according to the present invention, and the internal winning combination “C_Billy” is a specific example of a special internal winning combination according to the present invention. It is.

  When any symbol combination of “C_RT0 Lip 1” to “C_RT0 Lip 10” and “C_Control Bell 1” to “C_Control Bell 4” is stopped and displayed, the RT gaming state is RT3. A transition from the RT gaming state other than the RT0 gaming state carrying over the bonus combination (“BB3”) relating to the gaming state and “C_Billy” to the RT0 gaming state is made.

  In addition, the symbol combination of any one of “C_Bell transition 2-1” to “C_Bell transition 2-6” and “C_Bell transition 3-1” to “C_Bell transition 3-21” When the stop display is made, that is, when the bell is spilled, the RT gaming state is the RT1 gaming state from the RT gaming state other than the RT0 gaming state carrying over the RT3 gaming state and the bonus combination (“BB3”) related to “C_Billy”. Migrate to

  When any symbol combination of “C_RT2 Lip 1” to “C_RT2 Lip 12” is stopped and displayed, the RT gaming state is the RT3 gaming state and the bonus combination related to “C_Billy” (“BB3”). Transition from the RT gaming state other than the RT0 gaming state carrying over to the RT2 gaming state.

  In the pachislot machine 1 of the present embodiment, the main control circuit 41 (main CPU 51) refers to the RT transition table to control the transition of the RT gaming state described above. Details of the transition flow of the RT gaming state are as follows. Will be described more specifically with reference to FIG. 58 described later.

[Internal lottery table determination table]
Next, the internal lottery table determination table will be described with reference to FIG. The internal lottery table determination table defines a correspondence relationship between each game state and the number of inserted medals, the internal lottery table, and the number of lotteries set in each game state.

  Specifically, in the general gaming state (the number of inserted medals is “3”), the internal lottery table for the general gaming state is used, and “54” is set as the number of lotteries. In the RB1 gaming state (the number of inserted medals is “3”), the internal lottery table for the RB1 gaming state is used, and “8” is set as the number of lotteries. In the RB2 gaming state (the number of inserted medals is “3”), the internal lottery table for the RB2 gaming state is used, and “8” is set as the number of lotteries. In the RB3 gaming state (the number of inserted medals is “1”), the internal lottery table for RB3 gaming state is used, and “6” is set as the number of lotteries.

[Internal lottery table]
Next, the internal lottery table will be described with reference to FIGS. The internal lottery table defines the correspondence between the data pointer associated with the winning number and the lottery value when each winning number is determined in each RT gaming state and each RB gaming state.

  The data pointer is data acquired as a result of lottery performed with reference to the internal lottery table, and is used for designating an internal symbol combination specified by an internal symbol combination determination table (see FIGS. 26 to 31) described later. It is data. In this embodiment, a small role / replay data pointer and a bonus data pointer are provided as data pointers.

  In addition, the lottery value is defined for each setting (settings 1 to 6) for adjusting the expected value of internal winnings such as bonuses and small roles set in advance. This setting is changed using, for example, a reset switch (not shown) and a setting key switch (not shown).

  In the internal lottery process according to the present embodiment, first, a random number value (external random value) extracted from a predetermined numerical range (for example, 0 to 65535) is determined according to each winning number. Subtract sequentially. Next, it is determined (internal lottery) whether the result of the subtraction has become negative (whether a so-called “digit” has occurred). When the result of subtraction becomes negative (a “digit” occurs) at a predetermined winning number, it means that the winning number is won, and the data point assigned to the corresponding winning number is acquired.

  Therefore, in the internal lottery process according to the present embodiment, the larger the number specified as the lottery value, the higher the probability that assigned data (that is, the data pointer) is determined. The winning probability of each winning number can be expressed by “the lottery value specified for each winning number / the number of all random numbers that may be extracted (random denominator: 65536)”.

(1) General gaming state internal lottery table (RT0)
18 and 19 are diagrams showing the structure of the general gaming state internal lottery table (RT0). This internal gaming state internal lottery table is referred to when the RT gaming state is the RT0 gaming state (non-bonus gaming state). The internal lottery table for the general gaming state defines the relationship between the data pointers associated with the winning numbers “1” to “54” and the lottery values.

  For example, in the RT0 gaming state (general gaming state), referring to the setting 6 in the internal lottery table for general gaming state, the probability that the winning number “2” (abbreviation “F_don BB + F_weak ice”) is won is “22 / 65536 ". When the winning number “2” is won, “10” is acquired as the small role / replay data pointer, and “1” is acquired as the bonus data pointer.

  The small role / replay data pointer “10” corresponds to the abbreviation “F_weak ice”, and the bonus data pointer “1” corresponds to the abbreviation “F_don BB”. Therefore, the abbreviation corresponding to the winning number “2” from which the small role / replay data pointer “10” and the bonus data pointer “1” are acquired is “F_don BB + F_weak ice” as shown in FIG. It becomes.

  In the internal lottery table for the general gaming state, for example, the lottery value of the winning number “37” (abbreviated “F_RT2 transition lip 213”) to the winning number “40” (abbreviated “F_RT2 transition lip 321”) is “0”. Yes (see FIG. 19). Therefore, when referring to the internal lottery table for the general gaming state, the winning numbers “37” to “40” are not won.

  As shown in the small winning combination / replay internal winning combination determining tables of FIGS. 27 and 28 described later, when the winning numbers “37” to “40” are won, the data pointer for small winning combination / replay is “ 5 ”to“ 8 ”are acquired, and the internal winning combination relating to“ C_RT2 Lip 1 ”to“ C_RT2 Lip 12 ”is determined. That is, when the RT gaming state is the RT0 gaming state, the internal winning combination relating to “C_RT2 Lip 1” to “C_RT2 Lip 12” is not determined, and the RT gaming state is changed from the RT0 gaming state to the RT2 gaming state. There is no transition to.

(2) RT1 gaming state internal lottery table FIG. 20 is a diagram showing a configuration of an RT1 gaming state internal lottery table. The RT1 gaming state internal lottery table is a table that is referred to when the RT gaming state is the RT1 gaming state (non-bonus gaming state). In the internal lottery table for RT1 gaming state, the relationship between the lottery value and the data pointer in the winning numbers “33” to “41” is defined.

  When the RT gaming state is the RT1 gaming state, the lottery values defined in the columns of the winning numbers “33” to “41” in the internal lottery table for general gaming state (see FIGS. 18 and 19) are RT1 gaming. The lottery value is changed to a lottery value defined in the column of winning numbers “33” to “41” in the internal lottery table for state. At this time, the lottery values of the winning numbers other than the winning numbers “33” to “41” in the internal lottery table for the general gaming state are not changed and the same lottery value is used.

  In the RT1 gaming state internal lottery table, as shown in FIG. 20, the lottery values of the winning numbers “37” to “40” are “2240”, respectively. As described above, when any of the winning numbers “37” to “40” is won and any of the small combination / replay data pointers “5” to “8” is acquired, Internal winning combinations relating to “C_RT2 Lip 1” to “C_RT2 Lip 12” are determined. Therefore, when the RT gaming state is the RT1 gaming state, the internal winning combination related to “C_RT2 Lip 1” to “C_RT2 Lip 12” may be determined, and the RT gaming state is changed from the RT1 gaming state to the RT2 gaming state. It may transition to a state.

(3) RT2 gaming state internal lottery table FIG. 21 is a diagram showing a configuration of an RT2 gaming state internal lottery table. The RT2 gaming state internal lottery table is a table that is referred to when the RT gaming state is the RT2 gaming state (non-bonus gaming state). In the RT2 gaming state internal lottery table, the relationship between the lottery value and the data pointer in the winning numbers “33” to “41” is defined.

  When the RT gaming state is the RT2 gaming state, the lottery values defined in the fields of the winning numbers “33” to “41” in the internal lottery table for general gaming state (see FIGS. 18 and 19) are RT2 gaming. The lottery value is changed to a lottery value defined in the column of winning numbers “33” to “41” in the internal lottery table for state. At this time, the lottery values of the winning numbers other than the winning numbers “33” to “41” in the internal lottery table for the general gaming state are not changed and the same lottery value is used.

  In the RT2 gaming state internal lottery table, as shown in FIG. 21, the lottery values of the winning numbers “34” to “36” are “3500”, respectively. When any of the winning numbers “34” to “36” wins and any of the small role / replay data pointers “2” to “4” is acquired, “C_RT0 Lip 1” to “C_RT0 Lip 1” The internal winning combination relating to “C_RT0 Lip 10” is determined. Therefore, when the RT gaming state is the RT2 gaming state, the internal winning combination related to “C_RT0 Lip 1” to “C_RT0 Lip 10” may be determined, and the RT gaming state is changed from the RT2 gaming state to the RT0 gaming. It may transition to a state.

(4) RT3 gaming state internal lottery table FIG. 22 is a diagram showing a configuration of an RT3 gaming state internal lottery table. The RT3 gaming state internal lottery table is a table that is referred to when the RT gaming state is the RT3 gaming state (non-bonus gaming state). In the internal lottery table for RT3 gaming state, the relationship between the lottery value and the data pointer in the winning numbers “33” to “41” is defined.

  When the RT gaming state is the RT3 gaming state, the lottery values defined in the fields of the winning numbers “33” to “41” in the internal lottery table for general gaming state (see FIGS. 18 and 19) are RT3 gaming. The lottery value is changed to a lottery value defined in the column of winning numbers “33” to “41” in the internal lottery table for state. At this time, the lottery values of the winning numbers other than the winning numbers “33” to “41” in the internal lottery table for the general gaming state are not changed and the same lottery value is used.

  In the RT3 gaming state internal lottery table, as shown in FIG. 22, the lottery values of the winning numbers “34” to “40” are “200”, respectively. When any of the winning numbers “34” to “36” wins and any of the small role / replay data pointers “2” to “4” is acquired, “C_RT0 Lip 1” to “C_RT0 Lip 1” The internal winning combination relating to “C_RT0 Lip 10” is determined. When any of the winning numbers “37” to “40” is won and any of the small role / replay data pointers “5” to “8” is acquired, “C_RT2 Lip 1” is used as the internal winning combination. ”To“ C_RT2 Lip 12 ”, the internal winning combination is determined.

  As described above, when the RT gaming state is the RT3 gaming state, the internal winnings related to any of “C_RT0 Lip 1” to “C_RT0 Lip 10” and “C_RT2 Lip 1” to “C_RT2 Lip 12” The role may be determined. However, in the present embodiment, as described in the RT transition table of FIG. 16, when the RT gaming state is the RT3 gaming state, “C_RT0 Lip 1” to “C_RT0 Lip 10” and “C_RT2 Lip 1” ”To“ C_RT2 Lip 12 ”Even if the symbol combination corresponding to the internal winning combination is stopped and displayed on the active line, the RT gaming state is changed from the RT3 gaming state to the RT0 gaming state or the RT2 gaming state. Does not migrate.

(5) RB1 gaming state internal lottery table FIG. 23 is a diagram showing a configuration of the RB1 gaming state internal lottery table. The internal lottery table for RB1 gaming state is a table that is referred to when the gaming state is the RB1 gaming state (BB1 gaming state). In the RB1 gaming state internal lottery table, the relationship between the data pointers associated with the winning numbers “1” to “8” and the lottery values is defined. In the present embodiment, the lottery value of each winning number defined in the RB1 gaming state internal lottery table shown in FIG. 23 is commonly used for the settings 1-6.

  For example, in the RB1 gaming state (BB1 gaming state), referring to the internal lottery table for the RB1 gaming state, the probability that the winning number “1” (abbreviation “F_BB all bells”) is won is “42300/65536”. . When the winning number “1” is won, “25” is acquired as the small role / replay data pointer. In the RB1 gaming state internal lottery table of the present embodiment, the total lottery value defined for each of the winning numbers “1” to “8” is “65536”. That is, in the RB1 gaming state, the internal winning combination relating to the bell is always won.

(6) RB2 gaming state internal lottery table FIG. 24 is a diagram showing a configuration of the RB2 gaming state internal lottery table. The internal lottery table for RB2 gaming state is a table that is referred to when the gaming state is the RB2 gaming state (BB2 gaming state). In the RB2 gaming state internal lottery table, the relationship between the data pointer associated with each of the winning numbers “1” to “8” and the lottery value is defined. In the present embodiment, the lottery value of each winning number defined in the RB2 gaming state internal lottery table shown in FIG. 24 is commonly used for the settings 1-6.

  For example, in the RB2 gaming state (BB2 gaming state), referring to the internal lottery table for the RB2 gaming state, the probability that the winning number “1” (abbreviation “F_BB all bells”) is won is “65536/65536”. . When the winning number “1” is won, “25” is acquired as the small role / replay data pointer. That is, in the present embodiment, in the RB2 gaming state, the winning number “1” is always won and the small role / replay data pointer “25” is acquired.

(7) RB3 gaming state internal lottery table FIG. 25 is a diagram showing a configuration of the RB3 gaming state internal lottery table. The internal lottery table for RB3 gaming state is a table that is referred to when the gaming state is the RB3 gaming state (BB3 gaming state). In the RB3 gaming state internal lottery table, the relationship between the data pointer associated with each of the winning numbers “1” to “6” and the lottery value is defined. In the present embodiment, the lottery value of each winning number defined in the RB3 gaming state internal lottery table shown in FIG. 25 is commonly used for the settings 1-6.

  For example, in the RB3 gaming state (BB3 gaming state), referring to the internal lottery table for the RB3 gaming state, the probability that the winning number “1” (abbreviation “F_Billy S Bell”) is won is “15930/65536”. is there. When the winning number “1” is won, “33” is acquired as the small role / replay data pointer.

  In the RB3 gaming state internal lottery table of the present embodiment, the total lottery value defined for each of the winning numbers “1” to “6” is “64512”. That is, in the RB3 gaming state, the internal winning combination relating to the bell is won with a probability of “64512/65536” and becomes “lost” with a probability of “1024/65536”.

[Internal winning combination determination table]
Next, an internal winning combination determination table will be described with reference to FIGS. The internal winning combination determination table defines the correspondence between the data pointer and the internal winning combination. That is, when the small combination / replay data pointer and the bonus data pointer are determined, the internal winning combination is uniquely acquired.

  The “internal winning combination” in the internal winning combination determination table is data for identifying a combination of symbols on the left reel 3L, the middle reel 3C, and the right reel 3R that is permitted to be displayed along the active line. The “internal winning combination” is represented by 1-byte data in the same way as the “display combination” in the symbol combination table shown in FIGS. 10 to 14, and is a unique symbol for each bit in the 1-byte data. Are assigned.

  In the internal winning combination determination table, “◯” indicates an internal winning combination to be won in the acquired data pointer. In addition, when the data pointer for small combination / replay and the data pointer for bonus are “0”, the content of “internal winning combination” is “losing”, which is the symbol combination table shown in FIG. 10 to FIG. Indicates that display of all symbol combinations specified by is not permitted.

(1) Bonus internal winning combination determination table FIG. 26 is a diagram showing a configuration of the bonus internal winning combination determination table. The bonus internal winning combination determination table defines internal winning combinations related to the operation of the bonus game with respect to bonus data pointers “1” to “4”. That is, the bonus internal winning combination determination table defines the correspondence between the bonus data pointer and the internal winning combination related to the operation of the bonus game.

  In the present embodiment, as shown in FIG. 26, for example, when “2” is acquired as the bonus data pointer, the internal winning combination related to “C_Red 7” (“BB1”) is used as the internal winning combination. Will win.

(2) Small winning combination / replay internal winning combination determining table FIGS. 27 to 31 are diagrams showing the structure of the small winning combination / replay internal winning combination determining table. The small winning combination / replay internal winning combination determination table defines internal winning combinations related to small winning combination and replay (replay) with respect to “1” to “38” of the small winning combination / replay data pointer. That is, the small winning combination / replay internal winning combination determination table defines the correspondence between the small winning combination / replay data pointer and the internal winning combination related to the payout of medals or the internal winning combination related to the operation of the replay.

  Here, it is determined in correspondence with each small role / replay data pointer and each small role / replay data pointer defined in the internal winning combination determination table for small roles / replay shown in FIGS. A table summarizing the correspondence with the internal winning combination is shown in FIGS. 32 and 33. FIG. In this correspondence table, the correspondence between the small role / replay data pointer, its abbreviation, and the determined internal winning combination is defined.

  In the present embodiment, for example, when “2” is acquired as the small combination / replay data pointer, “C_C Lip 1” to “C_C Lip 12”, “C_T Lip 1” to “ “C_T Lip 8”, “C_CU Lip 1” to “C_CU Lip 8” and “C_RT0 Lip 1” to “C_RT0 Lip 10” are duplicated.

  Further, for example, when “21” is acquired as the data pointer for the small role / replay, “C_C bell”, “C_B bell 5”, “C_B bell 14”, “C_B bell 21” are used as the internal winning combination. , “C_Control Bell 1” to “C_Control Bell 12”, “R_Bell Transition 2-1” to “R_Bell Transition 2-6” and “R_Bell Transition 3-1” to “R_Bell Transition” “3-21” will be duplicated.

[Cylinder stop number selection table]
Next, with reference to FIG. 34, the rotating cylinder stop number selection table will be described. The rotation stop number selection table defines the correspondence between the small role / replay data pointer and the rotation stop number. The rotation stop number is data used when acquiring various data required in a reel stop initial setting process described later (see FIG. 233 described later).

  The rotation stop number selection table of the present embodiment defines a different rotation stop number for each small role / replay data pointer. For example, when the data pointer for the small role / replay is “3”, the spinning stop number “3” is selected.

  In addition, although the number selection table for rotation stop of this embodiment prescribes | regulates a different rotation stop number for every data pointer for small roles and replays, this invention is not limited to this. In the spinning stop number selection table according to the present invention, the same spinning stop number may be defined for different small role / replay data pointers to reduce data.

[Reel stop initial setting table]
Next, the reel stop initial setting table will be described with reference to FIG. The reel stop initial setting table defines a correspondence relationship between the rotation stop number and various data used in a pull-in priority table selection process described later and a number of sliding pieces determination process of each reel described later. Specifically, the reel stop initial setting table includes the rotation stop number, the pull-in priority table selection table number, the pull-in priority table number, the forward push table selection data, the forward push table change data, and the forward push push It defines the correspondence between the table change initial data and the table selection data when anomaly is pressed.

  The pull-in priority table selection table number and the pull-in priority table number are data used for the pull-in priority table selection process. For example, in the reel stop initial setting table, if a drawing priority table number corresponding to the number for turning stop is defined, a drawing priority table defined in a drawing priority table (see FIG. 41 described later) described later. Data relating to the priority order of the display combination corresponding to the number can be acquired.

  In addition, in the reel stop initial setting table, if a drawing priority table number corresponding to the number for turning stop is not defined, a drawing priority table selection table (see FIG. 40 to be described later) will be referred to. The pull-in priority table number corresponding to the priority table selection table number is determined.

  The forward selection table selection data, the forward push table change data, and the forward push table change initial data designate a stop table (see FIGS. 36 to 38 described later) to be referred to when the forward push is performed. It is data for. In this specification, the “forward push” is a stop operation when the first stop operation (first stop operation) is performed on the left reel 3L. Corresponds to the pressing order of “middle left” and “middle left”.

  The irregular pressing table selection data is data for designating a stop table (see FIG. 39 to be described later) to be referred to when irregular pressing is performed. In this specification, “anomalous push” is a stop operation when the first stop operation is performed on the middle reel 3C or the right reel 3R, and “middle left / right”, “middle right / left”, “ It corresponds to the order of pressing “middle right” and “middle right”.

  In the present embodiment, as described above, basically, after the stop operation is detected by the stop switch 17S, the rotation of the corresponding reel is stopped at a predetermined position within 190 msec. In this reel stop operation, one of the number of sliding symbols “0” to “4” is added to the value of the symbol counter of the reel when the stop operation is detected. Then, the symbol position corresponding to the value obtained by the addition is determined as the symbol position at which the rotation of the reel is stopped (this is referred to as “scheduled stop position”). The symbol position corresponding to the value of the symbol counter of the reel when the stop operation is detected is the symbol position at which the rotation of the reel starts to be stopped, and this is referred to as “stop start position”.

  That is, the number of sliding pieces is the rotation amount of the predetermined reel from when the stop operation for the predetermined reel is detected by the stop switch 17S until the rotation of the predetermined reel is stopped. In other words, the number of symbols passing through the middle area of the predetermined reel of the display window 4 in the period from when the stop operation to the predetermined reel is detected by the stop switch 17S until the rotation of the predetermined reel stops. is there. This is grasped by the value of the symbol counter updated after the stop operation by the stop switch 17S is detected.

  Referring to a stop table described later, the number of sliding pieces is acquired according to the stop start position of each reel. In the present embodiment, the number of sliding pieces is acquired based on the stop table, but this is temporary, and the planned stop position of the reel is not immediately determined by the acquired number of sliding pieces.

  Further, in the present embodiment, when there is an appropriate number of sliding pieces than the number of sliding pieces (hereinafter referred to as “sliding piece number determination data”) acquired based on a stop table described later (see FIG. 36 described later). Then, the number of sliding frames is changed with reference to a drawing priority order table (see FIG. 41 described later). The sliding piece number determination data is used to determine the search order when the priorities are compared for each of the symbols from the stop start position to the four symbol positions that are the maximum number of sliding symbols.

  In the present embodiment, different stop tables are used according to the pressing order of stop buttons for forward pressing and irregular pressing. Specifically, in the case of a forward push, a first stop stop table (described later with reference to FIG. 36) and a second and third stop stop table (described later with reference to FIG. Reference). On the other hand, in the case of irregular pressing, a later-described irregular pressing stop table (see FIG. 39 described later) is referred to.

[Stop table for first stop when pushing forward]
Next, with reference to FIG. 36, the first stop table for forward pressing will be described. Note that the first stop table for forward pressing shown in FIG. 36 is a stop table that is referred to when the table selection data for forward pressing is “01”. The first stop table at the time of forward pressing defines the correspondence relationship between the stop start positions “0” to “20” of the left reel 3L, the number of sliding pieces determination data, and the change status.

  For example, if the stop start position of the left reel 3L is “15”, the number-of-sliding piece determination data is “0”, and the change status is “1”. The change status is used when referring to a forward push control change table (see FIG. 37 described later).

[Control change table when pressing forward]
Next, with reference to FIG. 37, the forward change control change table will be described. The forward pressing control change table shown in FIG. 37 is a change table that is referred to when the forward pressing table change data is “00”. The forward pressing control change table defines the correspondence between the change target position (scheduled stop position of the left reel 3L), the change status, the change status, and the second and third stop table numbers for forward pressing.

  For example, if the change status acquired based on the first stop table (see FIG. 36) at the time of the forward press is “1” and the planned stop position of the left reel 3L is “15”, the change status is “ The stop table number for the second and third stops is “12” at the time of forward pressing. In the forward push control change table, if the change status and the second and third stop stop table numbers for forward push are not registered in the target position, the stop table number is not changed.

[Stop table for 2nd and 3rd stop when pushing forward and stop table when pushing irregularly]
Next, with reference to FIGS. 38 and 39, the second and third stop tables for forward pressing and the stop table for irregular pressing will be described. The stop table for the second and third stops and the stop table for irregularity when pushing forward define 1-byte stop data according to each of the symbol positions “0” to “20”.

  Note that the second- and third-stop stop tables for forward pressing shown in FIG. 38 are referred to when the stop-table number for the second and third stops for forward pressing is “08”. Also, the irregular pressing stop table shown in FIG. 39 is referred to when the irregular pressing table selection data is “07”.

  In the stop data specified by the stop tables of the second and third stop tables at the time of forward pressing and the stop table at the time of irregularity, is the symbol position associated with the stop data appropriate as the position at which the rotation of the reel is stopped? Has information on whether or not. The stop data includes information indicating whether or not the corresponding symbol position is appropriate as a position to stop the rotation of the reel, the bit corresponding to the “A line” column and the “B line” column in each stop table. Assign to the bit corresponding to. The stop data is defined by assigning information about which of these two types of information should be adopted to the bit corresponding to the “line change” column in each stop table.

  In other words, the second and third stop tables for stoppages and the stop table for anomalies at the time of forward pressing define a plurality of methods for determining the position at which the rotation of the reels is stopped. Therefore, even if the stop start position is the same symbol position, the position where the reel rotation is stopped can be varied based on the stop position at the time of the first stop. By adopting such a configuration, it is possible to compress information.

  The determination of the number of sliding piece determination data is performed as follows. First, it is specified which of the eight bit strings (the data in the leftmost column in the figure corresponds to bit 1) constituting the stop data is referred to according to the type of the stop button in which the stop operation is detected. For example, when the middle stop button 17C is pressed, the column of “middle reel A line data” of bit 4 is designated.

  Then, referring to the designated bit string, a search is sequentially performed as to whether or not “1” is defined as the corresponding data for each symbol position from the stop start position to the range of the maximum number of sliding symbols. As a result of this search, the difference from the stop start position to the symbol position where “1” is defined as the corresponding data is calculated, and this difference is used as the number of sliding piece determination data.

  Whether or not the bit string to be referred to is changed from the “A line” column to the “B line” column refers to the “line change” column and “1” is defined in the data corresponding to the stop start position. It is determined by whether or not. When it is determined that the line is to be changed, the column “B line” is designated thereafter, and the above search is performed.

[Pull-in priority table selection table]
Next, the pull-in priority table selection table will be described with reference to FIG. The pull-in priority table selection table defines the correspondence between the pull-in priority table selection table number and stop button pressing order, and the pull-in priority table number in each combination. The pull-in priority table number is data for acquiring information related to the priority order of display combinations defined in a pull-in priority table (see FIG. 41 described later).

  When the left reel 3L is stopped for the first time, the data in the “left reel first stop” column in the pull-in priority table selection table is referred to. For example, when the left reel 3L is stopped for the first time and the drawing priority table selection table number is “1”, the drawing priority table number “00” is acquired. Thereafter, when the stop button of the middle reel 3C is pressed in the second stop, the drawing priority table number is changed from “00” to “05”. On the other hand, when the left reel 3L is stopped for the first time and the pull-in priority table selection table number is “1”, when the stop button of the right reel 3R is pressed in the second stop, the pull-in priority table number is set to “ “00” is changed to “06”.

  Further, in the pull-in priority table selection table, when the pull-in priority table number is not registered at the target position, the number shown in the right column of the right reel first stop column is the pull-in priority table number. Get as. For example, when the left reel 3L is stopped first and the pull-in priority table selection table number is “0”, when the stop button of the right reel 3R is pressed in the second stop, the pull-in priority table is displayed at the target position. The number is not registered. Therefore, in this case, the right column of the first reel first stop column corresponding to the drawing priority table selection table number “0” is referred to, and “03” is acquired as the drawing priority table number.

[Pull-in priority table]
Next, the drawing priority table will be described with reference to FIG. The pull-in priority table defines the correspondence between the pull-in data for each storage area type and the predetermined priority in each of the pull-in priority table numbers “00” to “06”.

  The pull-in priority order table is used for searching whether there is a more appropriate number of sliding pieces in addition to the number of sliding pieces obtained based on the stop table. The priority order is data that defines the order of priority stop display (drawn) between the types of symbol combinations related to winning. Each pull-in data is similar to the “internal winning combination” in the internal winning combination determination table shown in FIGS. 26 to 31 and the “display combination” in the symbol combination table shown in FIGS. It is represented by byte data, and a unique symbol combination is assigned to each bit in the one-byte data.

  In the present embodiment, first, the number of sliding pieces is acquired based on the above-described first stop table for forward stop (see FIG. 36). However, when there is a more appropriate number of sliding pieces in addition to the number of sliding pieces, the number is changed to the appropriate number of sliding pieces. In other words, in the present embodiment, a more appropriate number of sliding symbols is determined based on the priority of the combination of symbols that allow the stop display by the internal winning combination regardless of the number of sliding symbols acquired from the stop table.

  In the present embodiment, in the drawing priority table, the stop display (pulling in) of the symbol combination corresponding to the internal winning combination having the higher priority is displayed in the combination display of the symbol combination corresponding to the internal winning combination having the lower priority. Prioritized over stop display.

  Further, in the present embodiment, as shown in FIG. 41, not only the priority order of the internal winning combination differs depending on the pull-in priority order table number, but also the number of priority divisions differs. Specifically, when the pull-in priority table numbers are “00”, “01”, and “04”, the priority number is set to 4, and the pull-in priority table numbers are “02” and “05”. In this case, the number of priority divisions is set to 3. When the pull-in priority table numbers are “03” and “06”, the number of priority sections is set to 1.

  Here, in order to simplify the description, the priority when the pull-in priority table number is “00” will be described, and description of priorities in other pull-in priority table numbers will be omitted. The priority order “1” when the pull-in priority table number is “00” includes “C_Confirmed Cherry 3”, “C_Confirmed Cherry 4”, “C_Confirmed Cherry 7” to “C_Confirmed Cherry 10”, “ Pull-in data corresponding to “C_T Bell 1” to “C_T Bell 18”, “C_CU Bell 1” to “C_CU Bell 12”, “C_C Bell”, and “C_Billy Lip 1” to “C_Billy Lip 18” are defined. .

  The priority “2” when the pull-in priority table number is “00” includes “C_CD ice 1” to “C_CD ice 8”, “C_CU ice 1” to “C_CU ice 2”, and “C_C ice 1”. -"C_C ice 4", "C_ finalized cherry 1"-"C_ finalized cherry 12", "C_T bell 1"-"C_T bell 8", "C_CU bell 1"-"C_CU bell 12", "C_C bell" “C_Billilip 1” to “C_Billilip 18”, “C_CU Lip 1” to “C_CU Lip 8”, “C_T Lip 1” to “C_T Lip 6”, and “C_C Lip 1” to “C_C Lip 12” Corresponding pull-in data is defined.

The priority “3” when the pull-in priority table number is “00” includes “C_special role 1” to “C_special role 2”, “C_CD ice 1” to “C_CD ice 8”, “C_CU ice”. 1 ”to“ C_CU ice 2 ”,“ C_B ice 1 ”to“ C_B ice 2 ”,“ C_C ice 1 ”to“ C_C ice 4 ”,
“C_determined cherry 1” to “C_determined cherry 12”, “C_strong cherry 1” to “C_strong cherry 12”, “C_weak cherry 1” to “C_weak cherry 4”, “C_T bell 1” to “C_T” "Bell 8", "C_CU Bell 1" to "C_CU Bell 12", "C_C Bell", "C_ Billy Lip 1" to "C_ Billy Lip 18", "C_CU Lip 1" to "C_CU Lip 8", "C_T Lip 1" To “C_T Lip 8” and “C_C Lip 1” to “C_C Lip 12” are defined.

  The priority “4” when the pull-in priority table number is “00” includes “C_Billie Lip 1” to “C_Billy Lip 18”, “C_T Lip 1” to “C_T Lip 8”, “C_C Lip 1”. -Pull-in data corresponding to “C_C Lip 12”, “C_Billy”, “C_BAR”, “C_Red 7”, and “C_Don BB” is defined.

  In the present embodiment, for example, “C_determined cherry 3”, “C_determined cherry 4”, and “C_determined cherry 7” are given to the priority “1” when the pull-in priority table number is “00”. “C_determined cherry 10” is defined, and “C_determined cherry 1” to “C_determined cherry 12” are defined in the priority order “2”. That is, some internal winning combinations are defined in both the priority “1” and the priority “2”. As described above, the internal winning combination defined in both the priority “1” and the priority “2” has a higher priority than the internal winning combination defined only in the priority “1”. Thereby, the number of priorities can be reduced.

[Search order table]
Next, the search order table will be described with reference to FIG. The search order table preferentially applies from a range of numerical values predetermined as the number of sliding frames (“0” to “4” when the maximum number of sliding frames is 4) (hereinafter referred to as “search order”). )).

  The search order table defines the sliding piece number determination data obtained based on the stop table and the search order. That is, in this embodiment, the order of numerical values to be preferentially applied is determined based on the sliding piece number determination data. In addition, the search order table is provided assuming that there are a plurality of sliding frames having the same priority, and the search order table is applied in a higher order.

  In this embodiment, as described in the priority attraction-in control process in FIG. 244 described later, each numerical value is sequentially searched from the search order “5” in the lower order of the search order table to correspond to the search order “1”. The number of sliding frames is preferentially applied from the numerical value to be used.

[Game lock lottery table]
(1) Outline of Game Lock First, before describing the game lock lottery table, the contents of the game lock performed in the pachi-slot 1 of the present embodiment will be described.

  In the present embodiment, in the general game state or the RT1 to RT3 game states, a game lock is generated when a predetermined operation is performed during the game. While the game lock is occurring, even if a closing operation or a stopping operation is performed, the detection is treated as invalid or delayed.

  In the present embodiment, nine types of game locks “game lock 1” to “game lock 9” are prepared as game locks. “Game lock 1” is implemented when the start lever 16 is operated (lever on), and a game lock of 49000 msec is generated. “Game lock 2” is implemented in response to the first stop operation, and a game lock of 51000 msec is generated. “Game lock 3” is triggered by the second stop operation, and a game lock of 51000 msec is generated. “Game lock 4” is implemented in response to the third stop operation, and a game lock of 51000 msec is generated.

  The “game lock 5” is performed at the start of rotation of the reels 3L, 3C, 3R, and a game lock of 3000 msec is generated. Then, during the occurrence of “game lock 5”, the first reel effect using the reels 3L, 3C, 3R is executed.

  In the first reel effect, first, all the reels 3L, 3C, 3R are vibrated for 1000 msec, and then the right reel 3R is rotated forward for 1000 msec at a rotation speed slower than the rotation speed during normal operation. Next, all the reels 3L, 3C, 3R are vibrated for 1000 msec, and the first reel effect is completed. When the first reel effect is finished, the reels 3L, 3C, 3R rotate forward at the rotation speed during normal operation. The “vibration” of the reels 3L, 3C, 3R means that the reels 3L, 3C, 3R vibrate by periodically repeating the forward and reverse rotations of the reels 3L, 3C, 3R at high speed. It is an action to show.

  “Game lock 6” is performed at the start of rotation of the reels 3L, 3C, 3R, and a game lock of 5000 msec is generated. Then, during the occurrence of “game lock 6”, a second reel effect using the reels 3L, 3C, 3R is executed.

  In the second reel effect, first, the same reel effect as the first reel effect is executed. Next, the middle reel 3C and the right reel 3R are rotated forward for 1000 msec at a rotation speed slower than the rotation speed during normal operation. Thereafter, all the reels 3L, 3C, 3R are vibrated for 1000 msec, and the second reel effect is completed. When the second reel effect ends, the reels 3L, 3C, 3R rotate forward at the rotation speed during normal operation.

  “Game lock 7” is performed at the start of rotation of the reels 3L, 3C, 3R, and a game lock of 7000 msec is generated. During the occurrence of “game lock 7”, a third reel effect using the reels 3L, 3C, 3R is executed.

  In the third reel effect, first, the same reel effect as the second reel effect is executed. Next, all the reels 3L, 3C, 3R are rotated forward for 1000 msec at a rotation speed slower than the rotation speed during normal operation. Thereafter, all the reels 3L, 3C, 3R are vibrated for 1000 msec, and the third reel effect is completed. When the third reel effect ends, the reels 3L, 3C, 3R rotate forward at the rotation speed during normal operation.

  “Game lock 8” is performed at the start of rotation of the reels 3L, 3C, 3R, and a game lock of 10000 msec is generated. While the “game lock 8” is generated, the fourth reel effect using the reels 3L, 3C, 3R is executed.

  In the fourth reel effect, first, the same reel effect as the third reel effect is executed. Next, all the reels 3L, 3C, 3R are reversely rotated for 3000 msec at the rotation speed during normal operation, and the fourth reel effect is completed. When the fourth reel effect is finished, the reels 3L, 3C, 3R rotate forward at the rotation speed during normal operation.

  “Game lock 9” is implemented when the start lever 16 is operated (lever on), and a game lock of 6000 msec is generated. During the occurrence of “game lock 9”, the fifth reel effect using the reels 3L, 3C, 3R is executed. In the fifth reel effect, all the reels 3L, 3C, 3R are vibrated for 6000 msec.

The types of the various game locks described above are selected by lottery processing using various game lock lottery tables described later. Specifically, in the game lock lottery process according to the present embodiment, basically, a random number for performance extracted from a predetermined numerical range “0 to 65535” (the random number for performance 1, which will be described later, the random number denominator). = 65536) is sequentially subtracted by lottery values defined in accordance with each game lock type in various game lock lottery tables described later. Then, lottery is performed by determining whether or not the result of the subtraction is negative (whether or not a so-called “digit” has occurred).
That is, the type of game lock when the subtraction result is less than 0 is the type of game lock won.

(2) Structure of game lock lottery table Next, the game lock lottery table will be described with reference to FIGS. 43 to 45. In the present embodiment, three types of lottery tables (game lock lottery tables A, B, and C) are provided as game lock lottery tables. Each game lock lottery table is a lottery of game lock type (game lock type) to be won according to the winning number determined by the internal lottery during a predetermined RT game state (in the general game state or RT1 to RT3 game state). Specify the value.

  FIG. 43 is a diagram showing a configuration of the game lock lottery table A. As shown in FIG. The game lock lottery table A defines the lottery value of “game lock 9” when the winning number is “33” (abbreviation “F_normal lip”). In the present embodiment, when the winning number is “33” and a lottery for determining whether or not to execute “game lock 9” is performed, “game lock 9” is displayed as shown in FIG. , Winning (executed) with the probability of “64/65536”.

  FIG. 44 is a diagram showing the configuration of the game lock lottery table B. As shown in FIG. The game lock lottery table B defines lottery values of “game lock 1” to “game lock 4” when the winning number is “8” (abbreviation “F_don BB + F_special role 1”). For example, when the winning number is “8”, as shown in FIG. 44, “game lock 1” is won with a probability of “739/65536”.

  FIG. 45 is a diagram showing the configuration of the game lock lottery table C. As shown in FIG. The game lock lottery table C defines lottery values of “game lock 4” to “game lock 8” corresponding to each winning number. For example, when the winning number is “1” (abbreviation “F_Don BB”), as shown in FIG. 45, “Game Lock 5” is won with a probability of “6144/65536”.

  When the winning number is “0” (losing), the random number denominator is changed to “4294967296 (the second power of 65536)” in a game lock lottery process (see FIG. 232 described later). Therefore, when the winning number is “0” (losing), as shown in FIG. 45, “game lock 4” wins with a probability of “13742/429294967296”.

[Output condition table]
Next, the output condition table will be described with reference to FIG. The output condition table includes the output conditions such as when BB (“BB1”, “BB2”) and “RB” (“BB3”) are activated and ended, and the jackpot signal “1” to jackpot signal “3”. Specifies the correspondence with the on / off state.

  In the present embodiment, as shown in FIG. 46, when “BB” (“BB1”, “BB2”) is operated, the big hit signal “1” is turned on. As a result, the jackpot signal “1” is transmitted to the external hall computer / calling apparatus 100. At the end of “BB” (“BB1”, “BB2”), the big hit signal “1” is turned off.

  In the present embodiment, the big hit signal “2” is turned on when “RB” (“BB3”) is activated. As a result, the jackpot signal “2” is transmitted to the external hall computer / calling apparatus 100. At the end of “RB” (“BB3”), the big hit signal “2” is turned off. Further, when the big hit signal “3” is in the ON state, the big hit signal “3” is set in the OFF state. The big hit signal “3” is turned on when the value of an output counter (see FIG. 47) described later becomes “0”.

[Subtraction condition table]
Next, the subtraction condition table will be described with reference to FIG. The subtraction condition table defines the correspondence between the stop order and the determination result as to whether or not the subtraction condition is satisfied for each value of the output counter. Note that the mark “◯” in the subtraction condition table indicates that the subtraction condition is satisfied.

  In this embodiment, referring to the subtraction condition table, when it is determined that the subtraction condition is satisfied, the value of the output counter is decremented by “1”. Basically, when the RT gaming state shifts to the RT2 gaming state, “3” is set in the output counter.

  For example, when the value of the output counter is “3”, if the stop order is “middle right”, it is determined that the subtraction condition is satisfied. As a result, the value of the output counter is subtracted from “3” by “1”. On the other hand, when the value of the output counter is “3”, if the stop order is other than “middle right”, the subtraction condition is not satisfied, so the value of the output counter is not changed from “3”.

[Pattern winning action flag data table]
Next, the symbol corresponding winning action flag data table will be described with reference to FIG. The symbol corresponding winning action flag data table defines the correspondence between the reel type and the internal winning combination data that can be displayed according to the symbol of each reel displayed on the active line. That is, by referring to the symbol corresponding winning action flag data table, the internal winning combination that can be displayed at that time can be determined. The symbol corresponding winning action flag data table is provided corresponding to the symbol combination table (see FIGS. 10 to 14).

  For example, when the symbol “don” is stopped and displayed on the effective line of the left reel 3L, it can be displayed in the storage areas 1 to 29 corresponding to the symbol code “00000001” (don) in the reel type “left”. “1” is stored in the bit corresponding to the internal winning combination. Data defined in the symbol corresponding winning action flag data table is logically AND stored with data stored in a symbol code storage area described later (see FIG. 55 described later).

[Relative position table for error registration processing]
Next, an error registration processing relative position table (error registration table) will be described with reference to FIG. The relative position table for error registration processing is referred to when various error registration processing is executed in table jump processing (see FIGS. 249 and 250 described later).

  The error registration processing relative position table defines the relationship between the error code ("1" to "8") and the corresponding relative position information ("relative position 1" to "relative position 8").

  In the error registration relative position table, the error code “1” relating to the RAM error and the error codes “2” (hopper empty error) and “3” (hopper jam error) relating to the error of the hopper 33 are included as error codes. ) And “7” (auxiliary full error). Further, in the error registration processing relative position table, error codes “4” (inserted medal passage check error), “5” (inserted medal passage time error), and “6” (inserted) are included as error codes. An error code “8” relating to a medal backward error) and an illegal hit error is defined.

  The relative position information defined in the error registration processing relative position table is 1-byte information, and is information on the head address of the error registration processing program corresponding to the error code in the main ROM 52. Specifically, the relative position information is information for calculating the start address of the error registration processing program, and is the relative position of the start address of the error registration processing program with respect to a preset address calculation reference position (reference address). It is information which shows. Therefore, the head address of the error registration processing program in the main ROM 52 can be calculated by adding the relative position information to the address calculation reference position.

  In this embodiment, the head address of the error registration processing relative position table in the main ROM 52 is adopted as the address calculation reference position. However, the present invention is not limited to this. For example, the address calculation reference position can be arbitrarily set according to the configuration of the storage area of the main ROM 52, the model of the gaming machine, and the like.

  Here, in FIG. 50, when the head address of the error registration processing relative position table is set as the address calculation reference position, the head address of the error registration processing relative position table in the main ROM 52 and the error corresponding to each error code are shown. The relationship with the head address of a registration processing program is typically shown.

  When the top address of the error registration processing relative position table is used as the address calculation reference position, for example, the top address of the hopper jam error registration processing program corresponding to the error code “3” is the top address of the error registration processing relative position table. This is an address obtained by adding “relative position 3” to (address calculation reference position). More specifically, for example, if the head address of the relative position table for error registration processing is “1000H” and “relative position 3” is “1AH”, the head address of the hopper jam error registration processing program is “101AH”. It becomes. In the table jump process, the main CPU 51 jumps to the calculated start address (executes the table jump process), and executes an error registration process for the jump destination.

  As shown in the above example, in this embodiment, the start address of the error registration processing program is represented by 2 bytes, but the relative position information defined in the relative position table for error registration processing may be 1 byte. Therefore, when table jump processing and error registration processing are performed using the above-described error registration processing relative position table, it is possible to save the amount of use of the table area and program area in the main ROM 52.

<Configuration of storage area provided in main RAM>
Next, the configuration of various storage areas provided in the main RAM 53 will be described with reference to FIGS. Although not described here (not shown), the main RAM 53 is also provided with storage areas for various control data, various flags, various counters and the like used for the various reel effects (various game locks) described above.

[Display combination storage area]
First, the configuration of the display combination storing area will be described with reference to FIG. In the present embodiment, the display combination storage area includes display combination storage areas 1 to 29 each represented by 1-byte data.

  In each of the display combination storage areas 1 to 29, when “1” stands for a predetermined bit (when stored), a combination of symbols corresponding to the predetermined bit is displayed on the active line. Indicates. On the other hand, when all the bits are “0”, it indicates that the symbol combination related to winning and the symbol combination that triggers the transition to the RT gaming state are not displayed on the active line.

  The main RAM 53 is provided with an internal winning combination storing area (not shown). The internal winning combination storing area is configured similarly to the display winning combination storing area shown in FIG. In the internal winning combination storing areas 1 to 29, when “1” stands for a plurality of bits, display of a combination of symbols corresponding to each bit is permitted. When all the bits are “0”, the content of the internal winning combination is “lost”.

  The main RAM 53 is provided with a carryover combination storage area (not shown). Further, the carryover combination storage area is composed of the storage area 1 of the display combination storage area shown in FIG. As a result of the internal lottery, when one of “C_Don BB”, “C_Red 7”, “C_BAR” and “C_Billy” is determined as the internal winning combination, the internal winning combination is stored as the carryover combination. Stored in the area. The carryover combination stored in the carryover combination storage area is not cleared until the corresponding symbol combination (for example, “Don”-“Don”-“Don” of “C_Don BB”) is displayed on the active line. Retained. Further, while the carryover combination is stored in the carryover combination storage area, the carryover combination is stored in the internal winning combination storage area in addition to the internal winning combination determined by the internal lottery.

[Game state flag storage area]
Next, with reference to FIG. 52, the configuration of the game state flag storage area will be described. The gaming state flag storage area is composed of gaming state flag storage areas 1 and 2 each represented by 1-byte data. In the present embodiment, in the gaming state flag, a unique bonus type or RT type is assigned to each bit of the gaming state flag storage areas 1 and 2.

  In each of the game state flag storage areas 1 and 2, when “1” is stored (standing) in a predetermined bit, the bonus game or RT corresponding to the predetermined bit is being operated. Indicates. For example, when “1” is stored in bit 0 of the gaming state flag storage area 1, the operation of “BB1” (“C_don BB” or “C_red 7”) is performed, and the gaming state is It shows that it is a BB1 game state.

[Operation stop button storage area]
Next, the configuration of the operation stop button storage area will be described with reference to FIG. The operation stop button storage area stores an operation stop button flag consisting of 1 byte. In the operation stop button flag, the operation state of the stop button is assigned to each bit.

  For example, if the left stop button 17L is a stop button that has been pressed this time, that is, an operation stop button, “1” is stored in bit 0 of the operation stop button storage area. Also, for example, if the left stop button 17L is a stop button that has not yet been pressed, that is, an effective stop button, “1” is stored in bit 4. Based on the data stored in the operation stop button storage area, the main CPU 51 identifies the stop button that has been pressed this time and the stop button that has not yet been pressed.

[Push order storage area]
Next, the configuration of the pressing order storage area will be described with reference to FIG. The pressing order storage area stores a pressing order flag consisting of 1 byte. In the pressing order flag, the type of stop button pressing order is assigned to each bit. For example, when the pressing order of the stop button is “left middle right”, “1” is stored in bit 0 of the pressing order storage area.

[Design code storage area]
Next, the configuration of the symbol code storage area will be described with reference to FIG. The symbol code storage area stores, for each active line, the symbol code (symbol code storage region 1) of the symbol of the reel that was most recently stopped and the displayable symbols (symbol code storage regions 2 to 29). The After all the reels are stopped, the symbol codes corresponding to the display combination are stored in the symbol code storage areas 2 to 29.

  In this embodiment, when the stop control position is determined, the winning operation flag data corresponding to the symbol (code) of the stop control position is read from the symbol corresponding winning operation flag data table (see FIG. 48), and the winning operation flag is read. The data is ANDed with the data already stored in the symbol code storage area. Then, the ANDed data is stored in the symbol code storage area shown in FIG. When a plurality of effective lines are provided, the same number of symbol code storage areas as the number of effective lines are provided.

[Retrieve priority data storage area]
Next, the configuration of the pull-in priority data storage area will be described with reference to FIG. The pull-in priority data storage area includes a left reel pull-in priority data storage area, a middle reel pull-in priority data storage area, and a right reel pull-in priority data storage area. That is, in the pull-in priority data storage area, a priority data storage area is provided for each reel type.

  Each drawing priority data storage area stores drawing priority data determined in accordance with each symbol position “0” to “20” of the corresponding reel. In the present embodiment, by referring to the pull-in priority data storage area, it is searched whether there is a more appropriate number of sliding symbols in addition to the number of sliding symbols determined based on the stop table described above.

  The contents of the priority order pull-in data stored in the pull-in priority data storage area differ depending on the type of the pull-in priority table number in the pull-in priority table (see FIG. 41) referred to when determining the pull-in priority data. . The pull-in priority data indicates that the higher the value, the higher the priority.

  By referring to the drawing priority data, it is possible to relatively evaluate the priority among the symbols arranged on the peripheral surface of the reel. That is, the symbol for which the largest value is determined as the pull-in priority data becomes the symbol with the highest priority. Therefore, it can be said that the pull-in priority data indicates the rank between the symbols arranged on the peripheral surface of the reel. When there are a plurality of symbols having the same value of the pull-in priority data, one symbol is determined according to the search order defined by the above-described search order table (see FIG. 42).

[Game lock flag storage area]
Next, the configuration of the game lock flag storage area will be described with reference to FIG. The game lock flag storage area includes game lock flag storage areas 1 and 2 each represented by 1-byte data. In the present embodiment, in the game lock flag, a unique lock number is assigned to each bit of the game lock flag storage areas 1 and 2.

  In the present embodiment, when a game lock type is determined with reference to the game lock lottery table (see FIGS. 43 to 45), a lock number corresponding to the game lock type is stored in the game lock flag storage area. . For example, when the determined game lock type is “game lock 1”, “1” is stored in bit 0 of the game lock flag storage area 1.

<Various gaming states>
[Game state transition flow]
Next, with reference to FIG. 58, the transition flow of the gaming state between “RT0 gaming state” to “RT3 gaming state” and “BB gaming state” controlled by the main CPU 51 will be described.

  As described above, in the pachislot machine 1 of this embodiment, four types of game states of “RT0 game state (general game state)” to “RT3 game state” are provided as the RT game state. Then, the main control circuit 41 (main CPU 51) refers to the RT transition table (see FIG. 16) and controls transitions between “RT0 gaming state” to “RT3 gaming state” and “BB gaming state”.

  First, when the pachislot 1 is shipped or at the end of “BB”, the gaming state becomes “RT0 gaming state”. Next, in the “RT0 gaming state”, when the symbol combination related to “Bell spill” is displayed on the active line, the gaming state shifts from the “RT0 gaming state” to the “RT1 gaming state”. Note that the symbol combinations related to “bell bell spill” in the present embodiment are “R_Bell transition 2-1” to “R_Bell transition 2-6” and “R_Bell transition 3-1” shown in FIG. It is a combination (display combination) of symbols according to any one of “R_Bell Transition 3-21”.

  In the “RT1 gaming state”, a combination of symbols related to “RT2 Lip” (any one of “C_RT2 Lip 1” to “C_RT2 Lip 12” in FIGS. 10 and 11) is displayed on the active line. The gaming state shifts from the “RT1 gaming state” to the “RT2 gaming state”. Then, in the “RT1 gaming state”, when a combination of symbols related to “failed bell” (any one of “C_control bell 1” to “C_control bell 4” in FIG. 12) is displayed on the active line The gaming state shifts from “RT1 gaming state” to “RT0 gaming state”.

  In the “RT2 gaming state (ART state)”, when the symbol combination related to “failed bell” is displayed on the active line, the gaming state shifts from “RT2 gaming state” to “RT0 gaming state”. Further, in the “RT2 gaming state”, when the symbol combination related to “Bell spill” is displayed on the active line, the gaming state shifts from “RT2 gaming state” to “RT1 gaming state”.

  When the internal winning combination relating to the operation of “BB” (any one of “C_Don BB”, “C_Red 7” and “C_BAR”) is being carried over in “RT0 gaming state” to “RT2 gaming state” The gaming state shifts from the current gaming state to the “RT3 gaming state”. When the symbol combination related to the operation of “BB” is displayed on the activated line, the gaming state becomes “BB gaming state”. Thereafter, when the operation of “BB” ends, the gaming state transitions from “BB gaming state” to “RT0 gaming state”.

  When “BB” (“BB3”) related to “C_Billy” among the internal winning combinations related to the operation of “BB” is being carried over, the gaming state is changed from the current gaming state to the “RT0 gaming state”. ”. When the symbol combination related to “C_Billy” is displayed on the activated line, the gaming state shifts to “BB gaming state”. Thereafter, when the operation of “C_Billy” ends, the gaming state transitions from “BB gaming state” to “RT0 gaming state”.

  In this embodiment, in the “RT0 gaming state (general gaming state)”, when the execution of ART is determined, the combination of symbols related to “Bell” such as “C_C Bell” is displayed on the active line. By not notifying the stop order (display auxiliary information), the system automatically waits for the combination of symbols related to “bell spill” to be displayed on the active line. When the symbol combination related to “Bell Spill” is displayed on the activated line, the gaming state shifts from “RT0 gaming state” to “RT1 gaming state”. In the present embodiment, in the “RT0 gaming state”, when the execution of ART is determined, the stop order (display auxiliary information) for displaying the symbol combination related to “bell spill” on the active line May be displayed (notified) on the liquid crystal display device 11.

  Further, in this embodiment, in the “RT1 gaming state”, when the execution of ART is determined, the stop order for displaying the combination of symbols related to “RT2 lip” on the active line (display auxiliary information) Is displayed on the liquid crystal display device 11. When the symbol combination related to “RT2 Lip” is displayed on the activated line, the gaming state shifts from “RT1 gaming state” to “RT2 gaming state”.

  In the present embodiment, the winning probability of the combination relating to the replay in the “RT0 gaming state” and the “RT1 gaming state” is lower than that in the “RT2 gaming state”. Therefore, in this embodiment, “RT0 gaming state” and “RT1 gaming state” are low RT gaming states, and “RT2 gaming state” is high RT gaming states.

  Further, in the present embodiment, as shown in FIG. 58, the gaming state directly shifts from “RT1 gaming state” to “RT2 gaming state”, but directly from “RT0 gaming state” to “RT2 gaming state” The gaming state does not transition. In order for the gaming state to transition from “RT0 gaming state” to “RT2 gaming state”, the gaming state first transitions from “RT0 gaming state” to “RT1 gaming state”, and then the gaming state changes to “RT1 gaming state”. To “RT2 gaming state”. That is, the transition path from the low RT gaming state to the high RT gaming state according to the present invention includes a direct transition path and an indirect (stepping through a predetermined stage) transition path.

[Correspondence table between internal winning combination and stop order]
Next, the correspondence between the internal winning combination and the stop order will be described with reference to FIG. FIG. 59 is a correspondence table between the internal winning combination (small combination / replay data pointer) and the stop order, and the display combination corresponding to the combination of the internal winning combination (small combination / replay data pointer) and the stop order. Indicates the type.

  “RT0 transition lip” described in FIG. 59 is a display combination (transition combination: “C_RT0 lip 1” to “C_RT0 lip 10”) in which the transition of the gaming state to “RT0 gaming state” (general gaming state) is determined. ). “RT2 transition lip” indicates a display combination (“C_RT2 lip 1” to “C_RT2 lip 12”) in which the transition of the gaming state to the “RT2 gaming state (ART state)” is determined. Furthermore, “normal lip” indicates a display combination related to re-playing regardless of the transition of “RT0 gaming state” and “RT2 gaming state”.

  In addition, the “C_CU bell” shown in FIG. 59 has a symbol “bell” along the cross-up line (a line connecting the lower region of the left reel 3L, the middle region of the middle reel 3C, and the upper region of the right reel 3R). Display combinations ("C_CU bell 1" to "C_CU bell 12") to be stopped are displayed. Furthermore, “C_C bell” indicates a display combination (“C_C bell”) in which the symbol “bell” is stopped and displayed along the center line (effective line).

  Further, “C_control bell 1-4” described in FIG. 59 indicates a display combination (“C_control bell 1” to “C_control bell 4”) having a payout number of “1”. The “C_B bell” is a display combination in which the symbol “bell” is stopped and displayed along the bottom line (a line connecting the lower region of the left reel 3L, the lower region of the middle reel 3C, and the lower region of the right reel 3R). "C_B bell 1" to "C_B bell 24"). Furthermore, “C_B Bell / R_Bell Transition 2” and “C_B Bell / R_Bell Transition 2” are displayed when “C_B Bell” cannot be stopped (missed) (“R_B Bell”). Bell transition 2-1 "to" R_Bell transition 2-6 "and" R_Bell transition 3-1 "to" R_Bell transition 3-21 ").

  In the present embodiment, the push order is different for the stop display of various symbol combinations related to “RT0 transition lip” and “RT2 transition lip” and the success or failure of stop display of various symbol combinations related to “Bell”. Is set.

  For example, when the small role / replay data pointer is “2”, “C_C Lip 1” to “C_C Lip 12”, “C_T Lip 1” to “C_T Lip 8”, “C_CU Lip” are used as internal winning combinations. “1” to “C_CU Lip 8” and “C_RT0 Lip 1” to “C_RT0 Lip 10” are won. In this case, “normal lip” (“C_C lip 1” to “C_C lip 10”, “C_T lip”, provided that the stop order by pressing the stop button is “left middle right” or “right and left middle”. 1 ”to“ C_T Lip 8 ”and“ C_CU Lip 1 ”to“ C_CU Lip 8 ”) are stopped and displayed. On the other hand, when the stop order is “middle left / right”, “middle right / left”, “middle right / left” or “middle right / left”, “RT0 transition lip” (from “C_RT0 lip 1” to “C_RT0 lip 10”). The combination of symbols according to any one is stopped and displayed.

  When the small combination / replay data pointer is “5”, “C_C Lip 1” to “C_C Lip 12”, “C_T Lip 1” to “C_T Lip 8”, “C_CU Lip” are used as internal winning combinations. “1” to “C_CU Lip 8” and “C_RT2 Lip 1” to “C_RT2 Lip 12” are won. In this case, the combination of symbols related to “RT2 transition lip” (any one of “C_RT2 lip 1” to “C_RT2 lip 12”), provided that the stop order by pressing the stop button is “middle left and right”. Is stopped. On the other hand, when the stop order is “left middle right”, “left / right middle”, “middle right / left”, “right left middle” or “right middle left”, “normal lip” (“C_C lip 1” to “C_C”). The combination of symbols relating to “Lip 10”, “C_T Lip 1” to “C_T Lip 8”, “C_CU Lip 1” to “C_CU Lip 8”) is stopped and displayed.

  That is, a game advantageous to the player by the player executing the stop sequence surrounded by the thick solid line in FIG. 59 set in each of the small role / replay data pointers “2” to “8”. It becomes possible to shift to the state. Note that the term “transition to an advantageous gaming state” herein includes all cases where the gaming state finally transitions to the “RT2 gaming state” (ART state). In the present embodiment, as shown in the RT transition table of FIG. 16, in order to shift the gaming state from “RT0 gaming state” to “RT2 gaming state”, it is necessary to go through “RT1 gaming state”. This “RT1 gaming state” is a low RT (the probability that an internal winning combination related to re-game is won) is not included in the “advantageous gaming state”, similarly to the “RT0 gaming state”.

  When the small combination / replay data pointer is “21”, “C_C bell”, “C_B bell 5”, “C_B bell 14”, “C_B bell 21”, “C_control bell” are used as internal winning combinations. 1 ”to“ C_Control Bell 12 ”,“ R_Bell Transition 2-1 ”to“ R_Bell Transition 2-6 ”and“ R_Bell Transition 3-1 ”to“ R_Bell Transition 3-21 ” I will win. In this case, the combination of symbols related to “C_C bell” is stopped and displayed on condition that the stop order by pressing the stop button is “middle left and right” or “middle right and left” (first stop order). . Thereby, 12 (predetermined number) medals are paid out. The “C_C bell” indicates a specific example of the first predetermined combination according to the present invention.

  On the other hand, in the above case, if the stop order is “left middle right” or “left and right middle” (second stop order), if the stop button press timing for the rotating reel is a predetermined timing (correct answer), The combination of symbols relating to “C_B bell” (any one of “C_B bell 5”, “C_B bell 14”, and “C_B bell 21”) is stopped and displayed. “C_B bell” (any one of “C_B bell 5”, “C_B bell 14”, and “C_B bell 21”) represents a specific example of the second predetermined combination according to the present invention. However, if the timing of pressing the stop button on the rotating reel is other than a predetermined timing (incorrect answer), “R_Bell Transition 2” or “R_Bell Transition 3” (“R_Bell Transition 2-1”). Symbol combinations related to “R_Bell Transition 2-6” and “R_Bell Transition 3-1” to “R_Bell Transition 3-21”) are stopped and displayed.

  Therefore, when the stop order is “left middle right” or “left and right middle” (second stop order), if the stop button is pressed at a predetermined timing (correct answer), 12 (predetermined number) medals Will be paid out. If the stop button is pressed at a timing other than the predetermined timing (incorrect answer), the medal is not paid out.

  Further, in the above case, when the stop order is “right middle left” or “right middle left” (third stop order), “C_control bell 1-4” (“C_control bell 1” to “C_control bell”). 4 ”) is stopped and displayed. Thereby, one medal (specific number) of medals smaller than the predetermined number (12) is paid out. Note that “C_control bell 1-4” indicates a specific example of the specific role according to the present invention.

  As described above, when the small role / replay data pointer is “21”, in the present embodiment, according to the first stop order in which a predetermined number (12) of medals are paid out and the stop button pressing timing. Thus, a second stop order in which a predetermined number of medals are not paid out and a third stop order in which only a specific number (one) of medals less than the predetermined number (12) are paid out are set. In the stop order (push order) set in this way, it is preferable to recommend the second stop order.

  Even if the plurality of reels are stopped in the first stop order or the third stop order that is not recommended, the probability that the small combination for paying out a predetermined number (12) medals will be stopped is improved. Only one (one) medal may be paid out. That is, when stopping a plurality of reels in a stop order that is not recommended, only a specific number (one) of medals is paid out with a probability of 1/2. Therefore, it is possible to make the player recognize that the game should be performed in the second stop order in which a predetermined number of medals are paid out in accordance with the pressing timing of the stop button. When the player plays the game in the recommended second stop order, it is possible to suppress an increase in the payout of medals in the normal game, and improve the payout probability of medals in the AT. be able to.

[Correspondence table of internal winning combination, stop order and RT transition]
Next, with reference to FIG. 60, the correspondence relationship between the internal winning combination, the stop order, and the RT transition will be described. FIG. 60 is a correspondence table of an internal winning combination (small combination / replay data pointer), stop order, and RT transition, and corresponds to a combination of an internal winning combination (small combination / replay data pointer) and stop order. Indicates the transition destination of the RT gaming state.

  For example, when the small role / replay data pointer is “2”, as described in FIG. 59, “normal rep” is provided on the condition that the stop order is “left middle right” or “left and right middle”. The combination of symbols related to is stopped and displayed. Therefore, in this case, the symbol combination related to “RT0 transition lip” is not stopped and displayed, and the transition from the RT gaming state to the RT0 gaming state is avoided (corresponding to “no transition” in FIG. 60). .

  Also, when the small role / replay data pointer is “5”, as described in FIG. 59, the combination of symbols related to “RT2 transition lip” on condition that the stop order is “middle left and right”. Is stopped. Therefore, in this case, the RT gaming state shifts to the RT2 gaming state (corresponding to “RT2 transition” in FIG. 60).

  Further, when the small role / replay data pointer is “21”, the stop order is “middle left / right” or “middle right / left” (first stop order) as described in FIG. The combination of symbols related to “C_C bell” is stopped and displayed. Therefore, in this case, there is no transition of the RT gaming state (corresponding to “no transition” in FIG. 60).

  When the small role / replay data pointer is “21” and the stop order is “left middle right” or “left / right middle” (second stop order), the stop button is pressed at a predetermined timing ( If the answer is correct, the symbol combination related to “C_B bell” is stopped and displayed. If the stop button is pressed at a timing other than the predetermined timing (incorrect answer), “R_Bell transition 2” or “R_Bell transition” is displayed. The combination of symbols relating to “eye 2” is stopped and displayed. Therefore, when the stop button press timing is a predetermined timing (correct answer), there is no transition of the RT gaming state, and when the stop button press timing is other than the predetermined timing (incorrect answer), RT The gaming state transitions to the RT1 gaming state (corresponding to “no transition / RT1 transition” in FIG. 60).

  Further, when the small role / replay data pointer is “21” and the stop order is “middle right / left” or “middle right / left” (third stop order), “C_control bell 1” to “C_control” The combination of symbols related to “Bell 4” is stopped and displayed. Therefore, in this case, the RT gaming state shifts to the RT0 gaming state (corresponding to “RT0 transition” in FIG. 60).

  As described above, in the present embodiment, when the small role / replay data pointer is “21”, the second stop order (“left middle right” or “inside left and right”) is recommended as the pressing order. However, ignoring the second stop order recommended by the player, the plurality of reels were stopped in the first or third stop order (the player does not know which is the first stop order). In this case, it is possible to ensure the payout of at least one medal. However, as described above, when a plurality of reels are stopped in the third stop order, not only the payout of medals becomes one but also the gaming state shifts to an unfavorable gaming state (RT0 gaming state). To do.

  That is, if a plurality of reels are stopped in the first or third stop order that is not recommended, there is a possibility that the situation may be disadvantageous for the player. Therefore, in the normal game other than the assist time (AT), the player can be stopped in the second stop order that recommends a plurality of reels.

[Billy Bonus]
Here, the contents of “Billy Bonus” (“BB3”) will be described. For “Billy Bonus”, “C_Billy” is determined as an internal winning combination, and a symbol combination corresponding to “C_Billy” (“Billy BAR”-“Billy BAR”-“Billy BAR”) is displayed along the active line. Activates when

  In the present embodiment, during the operation of “Billy Bonus” (during the Billy Bonus), it is notified that there is a possibility that “Don”-“Don”-“Don”, which is a combination of specific symbols, may be stopped and displayed. ("Don"-"Don"-"Don" is instructed to aim for a stop display). Thus, the player can recognize that there is a possibility that the combination of specific symbols (“don”-“don”-“don”) may be stopped and displayed during the billy bonus.

  The gaming state in which the “Billy bonus” is activated is the BB3 gaming state (see FIG. 15). Note that during the operation period of “BB3”, the operation of “RB3” is continuously performed, and the BB3 gaming state is also in the RB3 gaming state. Therefore, during the billy bonus, an internal winning combination is determined with reference to the internal lottery table for RB3 gaming state (see FIG. 25).

  In the present embodiment, when referring to the internal lottery table for RB3 gaming state (see FIG. 25), one of the winning numbers “1” to “6” or “losing” is determined. When any of the winning numbers “1” to “6” is determined, any one of “33” to “38” is acquired as the small role / replay data pointer.

  In the internal lottery with reference to the internal lottery table for the RB3 gaming state, for example, when a winning number “3” (abbreviation “F_Billy S Donbell”) is won, “35” is acquired as the data pointer for small role / replay. When “35” is acquired as the data pointer for the small part / replay, “C_Billy medium part 1”, “C_Billy medium part 2”, “C_Billy medium part 5” and “C_C” are used as the internal winning combination. "Bell" or the like is determined (see FIG. 33).

  If the symbol combination (“Bell”-“Don”-“Bell”) corresponding to “C_Billy Medium 1” is displayed along the active line during the billy bonus, 15 medals will be paid out. Then (see FIG. 14), the “Billy Bonus” ends. In addition, when the symbol combination corresponding to “C_Billy Medium 1” is displayed along the active line, if the timing of pressing the stop button is a predetermined timing, the combination of specific symbols (“don” − “ Don "-" Don ") is displayed along the cross-down line (invalid line). The cross-down line is a line connecting the upper area of the left reel 3L, the middle area of the middle reel 3C, and the lower area of the right reel 3R within the frame of the display window 4.

  If the symbol combination ("Bell"-"Don"-"Lip 1") corresponding to "C_Billy Medium 2" is displayed along the active line during the billy bonus, 15 medals will be paid It is issued (see FIG. 14), and the “Billy bonus” ends. In addition, when the symbol combination corresponding to “C_Billy Medium 2” is displayed along the active line, the combination of specific symbols (“Don” − “ Don "-" Don ") is displayed along the cross-up line (invalid line). The cross-up line is a line connecting the lower area of the left reel 3L, the middle area of the middle reel 3C, and the upper area of the right reel 3R within the frame of the display window 4.

  Further, when the symbol combination (“bell”-“bell”-“lip 1”) corresponding to “C_Billy protagonist 5” is displayed along the active line during the billy bonus, 15 medals are displayed. Is paid out (see FIG. 14), and the “Billy bonus” ends. Further, when the symbol combination corresponding to “C_Billy Medium 5” is displayed along the active line, if the stop button is pressed at a predetermined timing, the combination of specific symbols (“don” − “ "Don"-"Don") is displayed along the top line (invalid line). The top line is a line connecting the upper area of the left reel 3L, the upper area of the middle reel 3C, and the upper area of the right reel 3R within the frame of the display window 4.

  As described above, the player recognizes by notification that the combination of specific symbols (“don”-“don”-“don”) may be stopped and displayed during the billy bonus. Then, when the player performs a stop operation such that a combination of specific symbols (“don”-“don”-“don”) is stopped and displayed, the above-described stop button pressing timing tends to be a predetermined timing. .

  “C_Billy medium combination 1”, “C_Billy medium combination 2”, and “C_Billy medium combination 5” in the present embodiment are specific examples of the first internal winning combination. That is, the first internal winning combination has a specified number (15) of medals that exceeds the specified number (14) that triggers the end of the bonus game when the corresponding symbol combination is displayed along the active line. Is an internal winning combination to be paid out. Further, the first internal winning combination is a combination of specific symbols ("don"-"don"-"don") displayed along a straight line (invalid line) other than the active line in the frame of the display window. It is an internal winning combination that can be made.

  On the other hand, when the symbol combination (“bell”-“bell”-“bell”) corresponding to “C_C bell” is displayed along the active line during the billy bonus, 15 medals are paid out. (See FIG. 11), “Billy Bonus” ends. When the symbol combination corresponding to “C_C bell” is displayed along the active line, the timing of “don”-“don”-“don” is whatever the stop button is pressed. The symbol combination is not displayed along the invalid line.

  “C_C bell” or the like in the present embodiment indicates a specific example of the second internal winning combination. In other words, when the corresponding symbol combination is displayed along the active line, the second internal winning combination has a designated number (15) exceeding the specified number (14) that triggers the end of the bonus game. It is an internal winning combination where medals are paid out. Further, the second internal winning combination is a combination of specific symbols ("don"-"don"-"don") displayed along a straight line (invalid line) other than the active line within the frame of the display window. It is an internal winning role that is not done.

  In the present embodiment, when “33” to “37” are acquired as the small combination / replay data pointer, the first internal winning combination and the second internal winning combination are won (see FIG. 33). . When “33” or “34” is acquired as the data pointer for the small combination / replay, the display of the symbol combination corresponding to the second internal winning combination is the symbol corresponding to the first internal winning combination. The symbol combination corresponding to the second internal winning combination is displayed over the display of the combination. Therefore, in this case, in the current unit game, the combination of specific symbols is not displayed within the frame of the display window, and the “Billy bonus” ends.

  On the other hand, when “35” to “37” are acquired as the small combination / replay data pointer, the display of the symbol combination corresponding to the first internal winning combination is the symbol corresponding to the second internal winning combination. The symbol combination corresponding to the first internal winning combination can be displayed with priority over the display of the combination. Therefore, in this case, in the current unit game, if the stop button is pressed at a predetermined timing, the combination of specific symbols is displayed in the frame of the display window, and the “Billy bonus” ends.

  In the present embodiment, when “35” to “37” are acquired as the small role / replay data pointer during the billy bonus, that is, when a combination of specific symbols can be displayed along the invalid line. In addition, a lottery value in a bonus ART lottery table (see FIGS. 141 and 142 described later) is set so as to always win any “ART” in the ART lottery. That is, when the combination of specific symbols can be displayed along the invalid line during the billy bonus, a privilege advantageous to the player is given.

  By the way, in the internal lottery with reference to the internal lottery table for the RB3 gaming state, when the winning number “6” (abbreviation “F_Billy Chance Bell”) is won, “38” is acquired as the data pointer for the small role / replay. Then, when “38” is acquired as the data pointer for the small combination / replay, “C_Billy medium combination 3”, “C_Billy medium combination 4”, “C_control bell 1”, etc. are determined as the internal winning combination. (See FIG. 33).

  When the symbol combination (“Bell”-“Don”-“Yamabuki”) corresponding to “C_Billy Medium 3” is displayed along the active line during the billy bonus, one medal is paid out. (See FIG. 14). In addition, when the symbol combination corresponding to “C_Billy Medium 3” is displayed along the active line, the combination of specific symbols (“Don” − “Don” − “Don”) is not displayed along the invalid line.

  When the symbol combination (“Bell”-“Don”-“Snow Mountain”) corresponding to “C_Billy Medium 4” is displayed along the active line during the billy bonus, one medal is paid out. (See FIG. 14). Further, when the symbol combination corresponding to “C_Billy Medium 4” is displayed along the active line, the combination of specific symbols (“don” − “ "Don"-"Don") is not displayed along the invalid line.

  Further, when the symbol combination corresponding to “C_Control Bell 1” (“Bell”-“Rip 1”-“Yamabuki”) is displayed along the active line during the billy bonus, one medal is awarded. It is paid out (see FIG. 12). When the symbol combination corresponding to “C_Control Bell 1” is displayed along the active line, the combination of specific symbols (“don” − “ "Don"-"Don") is not displayed along the invalid line.

  “C_Billy medium combination 3”, “C_Billy medium combination 4”, “C_control bell 1”, and the like in the present embodiment are specific examples of the third internal winning combination. That is, the third internal winning combination is the number of medals equal to or less than the prescribed number (14) that triggers the end of the bonus game when the corresponding symbol combination is displayed along the active line. Is an internal winning combination to be paid out. Further, the third internal winning combination is an internal winning combination in which the combination of specific symbols is not displayed along a straight line (invalid line) other than the active line within the frame of the display window.

  In the internal lottery with reference to the RB3 gaming state internal lottery table, for example, when “losing” is determined, priority is given to the display of the “don” symbol along the active line in this embodiment. The reel stop control is performed. Note that the reel stop control according to the present invention includes stop control based on a table that defines the number of sliding pieces (so-called table control), stop control that preferentially stops and displays a symbol combination corresponding to any winning combination (so-called so-called table control). , Control control), and stop control that serves both of these.

  As shown in FIG. 10, during the billy bonus where the number of inserted medals is defined as one, an internal winning combination corresponding to a specific symbol combination (“don”-“don”-“don”) is defined. Not. Therefore, even if a combination of specific symbols (“Don”-“Don”-“Don”) is displayed along the active line during the billy bonus, the operation of “C_Don BB” (“BB1”) is not started.

  In this embodiment, when “losing” is determined during the billy bonus, that is, when a combination of specific symbols is displayed along the active line, it is ensured that any “ART” is won in the ART lottery. A lottery value is set in a bonus ART lottery table (see FIGS. 141 and 142 described later). That is, when the combination of specific symbols is displayed along the active line during the billy bonus, a privilege advantageous to the player is given.

  As described above, in the present embodiment, when the first internal winning combination or the second internal winning combination is determined as the internal winning combination during the billy bonus, the “billy bonus” is set in the unit game (one game). finish. When “33” or “34” is acquired as the small role / replay data pointer in the unit game (one game), it is not possible to obtain a privilege advantageous to the player. Therefore, the player plays the game during the billy bonus with a sense of tension, and the interest of the game can be improved.

  In addition, when the third internal winning combination is determined as the internal winning combination during the billy bonus, the combination of specific symbols (“Don”-“Don”-“Don”) is not displayed along the invalid line. The bonus game is continued unless a prescribed number (14) of medals that trigger the end of the bonus game has been paid out. As a result, a combination of specific symbols can be displayed in subsequent games, so that the player's expectation of obtaining an advantageous privilege is maintained, and the interest of the game can be enhanced.

  Furthermore, when the result of the internal lottery in the billy bonus is “losing”, a combination of specific symbols is displayed along the active line, and no medal is paid out. Therefore, a bonus advantageous to the player can be obtained, the bonus game can be continued, and the interest of the game can be enhanced.

  Further, in the present embodiment, the symbol of the left reel 3L constituting the symbol combination corresponding to “C_Billy middle role 1” to “C_Billy middle role 4” is “bell”, and the symbol of the middle reel 3C is “Don”. That is, the symbols of the left reel 3L and the middle reel 3C constituting the symbol combination corresponding to the first internal winning combination “C_Billy Medium 1” and “C_Billy Medium 2” are the third internal symbol combination. It is the same as that of “C_Billy Medium 3” and “C_Billy Medium 4”.

  Therefore, when the third internal winning combination is determined as the internal winning combination and the third stop operation is performed on the right reel 3R, the first internal winning combination is displayed until the symbol of the right reel 3R is stopped and displayed. A player can have a sense of expectation that a symbol combination corresponding to a combination is displayed. As a result, the interest of the game can be enhanced.

  Further, in the present embodiment, when a combination that can display a combination of specific symbols (“don”-“don”-“don”) along an invalid line is determined (as a data pointer for a small role / replay) In the case where “35” to “37” are acquired, a privilege (ART winning) advantageous to the player is given. That is, if a combination that can display a combination of specific symbols ("Don"-"Don"-"Don") along an invalid line is determined, a combination of specific symbols ("Don"-"Don"- Even if "Don") is not displayed along the invalid line, a privilege (ART winning) advantageous to the player is given. However, in this embodiment, when a combination of specific symbols (“Don”-“Don”-“Don”) is displayed along the invalid line, a privilege (ART winning) advantageous to the player is given. It may be configured.

<Description of sub game state>
Next, with reference to FIG. 61, various sub game states provided in the present embodiment, transition conditions between sub game states, and the like will be described. In the present embodiment, various game states related to effects controlled by the sub control circuit 42 (sub CPU 81) are referred to as “sub game states”.

  In the present embodiment, as shown in FIG. 61, the sub game state includes “general state”, “chance zone (CZ)”, “D_ART”, “B_ART”, “G_ART (G zone)”, “R_ART (rocket). Zone) ”and“ Viking Rush (VR) ”are provided.

  The “general state” and “chance zone” are sub game states in which ART does not operate. On the other hand, “D_ART”, “B_ART”, “G_ART”, “R_ART” and “Viking Rush” are sub gaming states (specific gaming states) in which the ART operates.

  In the present embodiment, as described above, five types of states are provided as sub gaming states in which the ART operates, but there are three types of ART that operate in these sub gaming states. The first ART (first assist state) is an ART that operates at “D_ART”, and the second ART (second assist state) is an ART that operates at “B_ART”, and a third ART (first assist state). (3 assist state) is an ART that operates in “G_ART (G zone)”. The ART that operates by “R_ART” is basically the same type of ART as that of “G_ART”, and the difference between the two is the termination condition of ART. The “Viking Rush” (predetermined specific gaming state) is a sub gaming state executed during “D_ART”, “B_ART”, “G_ART”, or “R_ART”, and operates in “Viking Rush”. The ART to do becomes the same kind of ART as that of the sub-gaming state in which it is executed.

[General status]
The “general state” is a sub gaming state that is executed during the RT0 gaming state and the RT1 gaming state. In the “general state”, whether or not the ART wins is basically determined for each game (unit game) with reference to the “general state” ART lottery table shown in FIGS. A lottery (ART lottery) is performed.

  When an ART is won in the ART lottery in the “general state”, at least one of “D_ART” and “B_ART” is won. When the ART is won by the ART lottery, a lottery is performed for determining the number of precursor games (hereinafter referred to as “art precursor game number”) until the winning ART is shifted to. That is, when the ART is won during the “general state”, the sub game state shifts from the “general state” to “D_ART” or “B_ART” after the game of the number of ART precursors is exhausted.

  Further, in the “general state”, a lottery is performed as to whether or not the sub gaming state shifts to the “chance zone (CZ)” with reference to a chance zone transition lottery table (not shown) for each game. When the lottery is won and the transition to the “chance zone (CZ)” is determined, the number of precursor games until the sub gaming state transitions to the “chance zone” (hereinafter referred to as “the number of CZ precursor games”). ), Lottery for determining the number of stay zone games (hereinafter referred to as “the number of CZ games”) and the like is performed.

  In the pachi-slot 1 of the present embodiment, the number of CZ precursor games and the chance zone until the transition to the “chance zone” is performed simultaneously with the lottery processing for determining whether or not the sub gaming state shifts to the “chance zone (CZ)”. The number of CZ games and the like may be lottery using a chance zone transfer lottery table (not shown). That is, whether or not to shift to the “chance zone” and the number of CZ precursor games and the number of CZ games when shifting to the “chance zone” may be determined by one lottery process.

[Chance zone]
The “chance zone” is a sub gaming state that is executed during the RT0 gaming state and the RT1 gaming state. When the transition to the “chance zone” is determined in the “general state” and the number of CZ precursor games is exhausted, the sub gaming state shifts from the “general state” to the “chance zone”. Then, after the transition to the “chance zone”, when the number of CZ games (the number of staying games) has been consumed, the “chance zone” ends.

  In the pachi-slot 1 of the present embodiment, without determining the number of CZ games, for example, when a predetermined internal winning combination is determined or when a predetermined display combination is stopped and displayed, a predetermined condition is triggered. The end of the “chance zone” may be determined.

  In the “chance zone”, the ART lottery is basically performed for each game (unit game) with reference to the “chance zone” ART lottery table shown in FIG. 77, FIG. The ART winning probability in the ART lottery in the “chance zone” is higher than that in the ART lottery in the “general state”. When the ART is won in the ART lottery in the “chance zone”, at least one of “D_ART” and “B_ART” is won as in the “general state”. In other words, when the ART is won during the “chance zone”, after the number of ART precursor games is consumed, the sub gaming state shifts from the “chance zone” to “D_ART” or “B_ART”.

[D_ART]
“D_ART” is a sub gaming state executed during the RT 2 gaming state. For example, “D_ART” is started after “D_ART” is won by the ART lottery during the “general state” or “chance zone”, and the number of ART precursor games determined by the lottery is digested. . In the present embodiment, “D_ART” is a sub-storage area (information “D_ART” winning information) indicating that “D_ART” has been won when “D_ART” or “B_ART” ends It is also started when it is stored in the ART stock area.

  When the sub game state shifts to “D_ART”, the number of stay games of “D_ART” (hereinafter referred to as “ART start G (game) number”) is determined by referring to the ART game number random determination table (not shown). . Next, the “ART start G number” determined by the lottery is set in the ART game number counter. The value of the ART game number counter is decremented by “1” every time a unit game is executed in “D_ART”. Then, when the value of the ART game number counter becomes “0”, “D_ART” ends.

  In “D_ART”, a continuous stock lottery table (not shown) is referenced for each game, and a lottery (continuous stock lottery) is performed to determine whether or not the continuous stock is won. “1” is added to the counter.

  If you win the continuation stock during "D_ART", after the game of "ART start G number" is digested in "D_ART", a new "ART start G number" is set in the ART game number counter and "D_ART" continues (Looped). Specifically, when the “ART start G number” game is consumed, if the value of the continuous stock counter is “1” or more, the value of the continuous stock counter is decremented by “1”. An “ART start G number” is newly determined with reference to an ART game number lottery table (not shown). Then, the newly determined “ART start G number” is set in the ART game number counter, and “D_ART” is continued.

  Therefore, in the present embodiment, the game “D_ART” is repeated until the value of the continuous stock counter becomes “0”. In the present embodiment, as the number of winnings of the continuation stock in “D_ART” increases, the value of the continuation stock counter increases, and the number of continuations of “D_ART” increases. Can last long.

  Also, during “D_ART”, ART lottery is basically performed for each game with reference to the “D_ART” ART lottery table shown in FIGS. When a predetermined ART is won by an ART lottery in “D_ART”, information on the predetermined ART that has been won is stored in a sub-storage area (ART stock area) described later.

[B_ART]
“B_ART” is a sub gaming state executed during the RT2 gaming state. For example, “B_ART” is started after “B_ART” is won by ART lottery during the “general state” or “chance zone”, and the number of ART precursor games determined by the lottery is digested. . In the present embodiment, when “D_ART” or “B_ART” is ended, “B_ART” is also stored even if the winning information of “B_ART” is stored in a sub storage area (ART stock area) described later. Be started.

  When the sub game state shifts to “B_ART”, the “ART start G number” of “B_ART” is determined by referring to the ART game number determination table (not shown). Next, the “ART start G number” determined by the lottery is set in the ART game number counter. The value of the ART game number counter is decremented by “1” every time a unit game is executed in “B_ART”. Then, when the value of the ART game number counter becomes “0”, “B_ART” ends.

  In “B_ART”, a lottery table (additional game number lottery) is added for each game with reference to a game number addition lottery table (not shown), and the determined number of additional games is added to the ART game number counter. To do. Therefore, in this embodiment, the number of ART games increases as the number of additional games determined in “B_ART” increases, and the “B_ART” game that is advantageous to the player can be continued for a long time.

  Also, during “B_ART”, ART lottery is basically performed with reference to an ART lottery table for “B_ART” shown in FIGS. 103 to 114 and the like described later for each game. When a predetermined ART is won by the ART lottery in “B_ART”, information on the predetermined ART that has been won is stored in a sub-storage area (ART stock area) described later.

[G_ART]
“G_ART” is a sub gaming state executed during the RT2 gaming state. “G_ART” is started when the winning information of “G_ART” is stored in the sub-storage area (ART stock area) during “D_ART” or “B_ART”. That is, when the winning information of “G_ART” is stored in the sub storage area, the game of “D_ART” or “B_ART” is interrupted and “G_ART” is started. Note that “G_ART” according to the present embodiment is started after the number of precursor games determined by lottery (hereinafter referred to as “number of combined precursor games”) is digested.

  When “G_ART” is started, the number of combined games (the number of staying games) is determined with reference to a combined game number lottery table (not shown). Next, the determined combined game number is set in the combined game number counter. Then, when the value of the combined game number counter becomes “0”, “G_ART” ends.

  During “G_ART”, ART lottery is basically performed for each game with reference to the “G_ART” ART lottery table shown in FIGS. 128 to 133 described later. Further, when a predetermined ART is won by an ART lottery in “G_ART”, information on the determined predetermined ART is stored in a sub storage area (ART stock area) described later. In the present embodiment, the probability that each ART wins by the ART lottery in “G_ART” is higher than that in “D_ART” or “B_ART”.

  Further, during “G_ART”, the value of the ART game number counter set in “D_ART” or “B_ART”, which is the sub gaming state before the transition to “G_ART”, is not subtracted. When “G_ART” ends, the sub gaming state before the transition to “G_ART”, that is, “D_ART” or “B_ART” returns.

[R_ART]
“R_ART” is a sub gaming state executed during the RT2 gaming state. “R_ART” interrupts the game of “D_ART” or “B_ART” when the winning information of “R_ART” is stored in the sub-storage area (ART stock area) during “D_ART” or “B_ART” And start. In this case, after the number of precursor games determined by lottery (hereinafter referred to as “the number of rocket precursor games”) is consumed, “R_ART” is started.

  In this embodiment, when the winning information of “R_ART” is stored in the sub-storage area (ART stock area) during “G_ART”, “R_ART” is started even after the “G_ART” is finished. . When the winning information of “R_ART” is stored in the sub-storage area during “G_ART”, after the “G_ART” is finished, the rocket precursor game that is performed over one or more games is not performed. That is, in this case, when “G_ART” ends, the sub gaming state directly shifts from “G_ART” to “R_ART”.

  In this embodiment, the winning information of “R_ART” is stored in the sub-storage area during “G_ART”, and even when “G_ART” is ended, after the game of the number of rocket precursors is digested, “R_ART” May be started. In this case, first, when “G_ART” ends, the sub gaming state before the transition to “G_ART”, that is, “D_ART” or “B_ART” returns. Then, after “D_ART” or “B_ART” after returning, the number of rocket precursor games has been consumed, and then “R_ART” is started.

  In the present embodiment, when the internal winning combination related to “C_Don BB”, “C_Red 7”, or “C_BAR” is won, “R_ART” ends. That is, “R_ART” ends when an internal winning combination related to the bonus game (“BB1” or “BB2”) is determined. In the present embodiment, when the combination of symbols related to “C_Don BB”, “C_Red 7” or “C_BAR” is stopped and displayed (the bonus combination (“BB1” or “BB2”)) If determined, “R_ART” may be terminated.

  In the present embodiment, even if the internal winning combination (“C_Billy”) related to the operation of “BB3” is determined, “R_ART” is not terminated. When an internal winning combination (“C_Billy”) related to the operation of “BB3” is determined during “R_ART”, information indicating that the internal winning combination “C_Billy” has been won is notified, and the internal winning combination “ An effect of prompting stop display of a combination of symbols corresponding to “C_Billy” (“Billy BAR” − “Billy BAR” − “Billy BAR”) is performed.

  When the symbol combination corresponding to the internal winning combination “C_Billy” is stopped and displayed, “BB3” is activated. In this case, first, “R_ART” is interrupted, and the sub gaming state shifts to the “general state” (or “chance zone”). After that, when the operation of “BB3” is finished, the sub game state returns to the sub game state before the transition to the “general state” (or “chance zone”), that is, “R_ART”.

  During “R_ART”, ART lottery is basically performed for each game with reference to the “R_ART” ART lottery table shown in FIGS. 134 and 135 to be described later. Further, when a predetermined ART is won by an ART lottery in “R_ART”, information on the determined predetermined ART is stored in a sub storage area (ART stock area) described later. In this embodiment, the probability that each ART wins by the ART lottery in “R_ART” is higher than that in “D_ART” or “B_ART”.

[Viking Rush]
“Viking rush (VR)” indicates a specific example of a predetermined specific gaming state in which an alternative effect according to the present invention is performed.

  “Viking Rush” is a sub-gaming state related to an effect in which the addition (addition) of the number of ART games is expected, and is executed during “D_ART”, “B_ART”, “G_ART”, or “R_ART” The Whether or not to execute this “Viking Rush” is determined for each game during “D_ART”, “B_ART”, “G_ART”, and “R_ART”. The “Viking Rush” is started when the player selects a question whether to execute the “Viking Rush” and then correctly answers an alternative question (an alternative effect at the time of VR lock described later).

  In the “Viking Rush”, an alternative effect is executed over at least five games. Specifically, an effect (touch challenge) is performed in which the player selects and touches one of the left character decoration portion 22L and the right character decoration portion 22R (see FIG. 2) of the pachislot 1. As described above, the left character decoration unit 22L and the right character decoration unit 22R are provided with the left touch sensor 23L and the right touch sensor 23R, respectively. Therefore, when the player's hand touches one of the character decoration parts, the touch sensor of the touched character decoration part transmits an input signal to the sub-control circuit 42.

  In the “Viking Rush”, for each game, for example, one of the left character decoration unit 22L and the right character decoration unit 22R is set to the correct answer and the other is set to the incorrect answer. And it is discriminate | determined whether the character decoration part which the player selected is correct. In the present embodiment, the number of ART games to be added (hereinafter referred to as “VR added game number”) according to the number of correct answers in an alternative production (“Viking Rush”) executed over five games is calculated. It is determined. This “VR added game number” indicates a specific example of the number of added games according to the present invention.

In this embodiment, when the number of correct answers is “n”, the initial value of the VR added game number is “d”, and the coefficient is “f”, the VR added game number “m” is calculated by the following formula. The
m = d × f ⁿ⁻¹

Therefore, the VR additional game number determined in the “Viking Rush” is multiplied by “f” every time the answer is correct. In this embodiment, the initial value “d” is set to “20”, and the coefficient “f” is set to “2”. Thereby, the VR added game number “m” is calculated by the following calculation formula.
m = 20 × 2 ⁿ⁻¹

  In other words, when the number of correct answers is one in five alternative effects (touch challenge), the VR added game number “m” is “20”, and when the number of correct answers is two The VR added game number “m” is “40”. When the number of correct answers is 3, the VR added game number “m” is “80”, and when the number of correct answers is 4, the VR added game number “m” is “160”. It becomes. When the number of correct answers is 5 (all correct answers for 5 alternative effects), the VR added game number “m” is “320”.

  In the present embodiment, when there are one or more incorrect answers in the five alternative productions, the “Viking Rush” is finished together with the end of the fifth alternative production. On the other hand, if all of the five alternative choices are correct, then the alternative choice (“Viking Rush”) is extended until an incorrect answer is obtained. In the present embodiment, the sixth and subsequent alternative effects are referred to as “Viking Rush (VR) Extra”.

  In the present embodiment, in “Viking Rush Extra”, “320” is added to the number of VR additional games determined by the fifth time each time a correct answer is made. For example, in the “Viking Rush Extra”, the first alternative (the sixth alternative after the “Viking Rush” has started) is the correct answer, and the second alternative ( In the case where the “7th alternative production” since the start of “Viking Rush” is incorrect, the VR added game number “m” becomes “640”. In addition, if the answer is correct up to the second alternative production of “Viking Rush Extra” and the third alternative production is incorrect, the VR added game number “m” becomes “960”. .

  Further, in the present embodiment, in the case of “Viking Rush” in “D_ART” or “B_ART”, when an additional number of games (VR added game number) is determined, the “D_ART” or “B_ART” The determined VR additional game number is added to the ART game number counter. On the other hand, in the case of “Viking Rush” in “G_ART” or “R_ART”, if the number of games to be added (number of VR added games) is determined, the sub game before the transition to “G_ART” or “R_ART” The number of VR extra games is added to the state, that is, the ART game number counter in “D_ART” or “B_ART”.

  As described above, in the “Viking Rush (VR)”, since the “VR added game number” is determined based on the player's selection result, the “VR added game number” in “AT (ART)”, that is, “ The player's interest in the game of “Viking Rush (VR)” can be attracted. As a result, it is possible to improve the fun of games related to “AT (ART)”.

<Configuration of data table stored in sub-ROM>
Next, the configuration of various data tables stored in the sub ROM 82 will be described.

[Special flag lottery table]
First, the configuration of the special flag lottery table will be described with reference to FIG. The special flag lottery table defines the data pointer (bonus data pointer and small role / replay data pointer) and the changed small role / replay data pointer to be changed according to the game lock flag.

  For example, if the bonus data pointer is “1”, the small role / replay data pointer is “16”, and the game lock flag is “0”, the changed small role / replay “40” is determined as the data pointer. Note that the game lock flag is “0” when it is not any of “1” to “9”.

  Further, for example, when the bonus data pointer is “1” and the game lock flag is any one of “1” to “4”, regardless of the value of the small role / replay data pointer, “42” is determined as the data pointer for the small role / replay.

[Lottery flag lottery table]
Next, the structure of various lottery flag lottery tables will be described with reference to FIGS. Each lottery flag lottery table defines the values of lottery flags set in correspondence with the bonus data pointer, the small role / replay data pointer, and the game lock flag.

  In this embodiment, with reference to various lottery flag tables, lottery flags A-1, A-2, A-3, lottery flags B-1, B-2, B-3, lottery flags D, lottery flags Fourteen types of lottery flags are determined: G, lottery flag H, lottery flags I-1, I-2, lottery flag J, and lottery flag K. These lottery flags are used in an effect determination process described later (see FIG. 266 described later) and the like.

  FIG. 63 shows the structure of the lottery flag A-1 lottery table. The lottery flag A-1 lottery table defines the value of the lottery flag A-1 set corresponding to the data pointer and the game lock flag. For example, in the lottery flag A-1 lottery table, when the small role / replay data pointer is “0” or “18”, the lottery flag is irrespective of the value of the bonus data pointer and the value of the game lock flag. As A-1, “0” is determined.

  FIG. 64 is a diagram showing a configuration of a lottery flag A-2 lottery table. The lottery flag A-2 lottery table defines the value of the lottery flag A-2 set corresponding to the data pointer and the game lock flag. For example, in the lottery flag A-2 lottery table, when the bonus data pointer is “0” and the small role / replay data pointer is “42” or “43”, it relates to the value of the game lock flag. Instead, “0” is determined as the lottery flag A-2.

  FIG. 65 shows the structure of the lottery flag A-3 lottery table. The lottery flag A-3 lottery table defines the value of the lottery flag A-3 set corresponding to the data pointer and the game lock flag. For example, in the lottery flag A-3 lottery table, when the small role / replay data pointer is “0” or “18”, the lottery flag is irrespective of the value of the bonus data pointer and the value of the game lock flag. “0” is determined as A-3.

  FIG. 66 shows the structure of the lottery flag B-1 lottery table. The lottery flag B-1 lottery table defines the value of the lottery flag B-1 set corresponding to the data pointer and the game lock flag. For example, in the lottery flag B-1 lottery table, when the small role / replay data pointer is “0”, the lottery flag B-1 is used regardless of the value of the bonus data pointer and the value of the game lock flag. , “1” is determined.

  FIG. 67 shows the structure of the lottery flag B-2 lottery table. The lottery flag B-2 lottery table defines the value of the lottery flag B-2 set corresponding to the data pointer and the game lock flag. For example, in the lottery flag B-2 lottery table, when the small role / replay data pointer is “25”, the lottery flag B-2 is used regardless of the value of the bonus data pointer and the value of the game lock flag. , “0” is determined.

  FIG. 68 is a diagram showing the structure of a lottery flag B-3 lottery table. The lottery flag B-3 lottery table defines the value of the lottery flag B-3 set corresponding to the data pointer and the game lock flag. For example, in the lottery flag B-3 lottery table, when the small role / replay data pointer is “0” or “18”, the lottery flag is irrespective of the value of the bonus data pointer and the value of the game lock flag. “0” is determined as B-3.

  FIG. 69 is a diagram showing a configuration of a lottery flag D lottery table. The lottery flag D lottery table defines the value of the lottery flag D set corresponding to the data pointer and the game lock flag. For example, in the lottery flag D lottery table, when the small role / replay data pointer is “9”, the lottery flag D is “1” regardless of the value of the bonus data pointer and the value of the game lock flag. Is determined.

  FIG. 70 is a diagram showing a configuration of a lottery flag G lottery table. The lottery flag G lottery table defines the value of the lottery flag G set corresponding to the data pointer and the game lock flag. For example, in the lottery flag G lottery table, when the small role / replay data pointer is “0” or “18”, the lottery flag G is used regardless of the value of the bonus data pointer and the value of the game lock flag. , “0” is determined.

  FIG. 71 is a diagram showing a configuration of a lottery flag H lottery table. The lottery flag H lottery table defines the value of the lottery flag H set corresponding to the data pointer and the game lock flag. For example, in the lottery flag H lottery table, when the small role / replay data pointer is “0” or “18”, the lottery flag H is used regardless of the value of the bonus data pointer and the value of the game lock flag. , “0” is determined.

  Further, for example, in the lottery flag H lottery table, when the small role / replay data pointer is “1”, the lottery flag H is set to “1” regardless of the value of the bonus data pointer and the value of the game lock flag. 2 "is determined. However, in this embodiment, even if the small role / replay data pointer is “1”, a jackpot signal “3” to be described later is transmitted to the hall computer / calling device 100 via the external terminal board 18S. If the generation condition of the navigation is satisfied, the lottery flag H is changed from “2” to “3”.

  FIG. 72 is a diagram showing the structure of the lottery flag I-1 lottery table. The lottery flag I-1 lottery table defines the value of the lottery flag I-1 set corresponding to the data pointer and the game lock flag. For example, in the lottery flag I-1 lottery table, when the small role / replay data pointer is “0” or “18”, the lottery flag is irrespective of the value of the bonus data pointer and the value of the game lock flag. “0” is determined as I-1.

  FIG. 73 is a diagram showing a configuration of a lottery flag I-2 lottery table. The lottery flag I-2 lottery table defines the value of the lottery flag I-2 set corresponding to the data pointer and the game lock flag. For example, in the lottery flag I-2 lottery table, when the small role / replay data pointer is “0” or “18”, the lottery flag is irrespective of the value of the bonus data pointer and the value of the game lock flag. “0” is determined as I-2.

  FIG. 74 is a diagram showing a configuration of a lottery flag J lottery table. The lottery flag J lottery table defines the value of the lottery flag J set corresponding to the data pointer and the game lock flag. For example, in the lottery flag J lottery table, when the small role / replay data pointer is “41”, the lottery flag J is “1” regardless of the value of the bonus data pointer and the value of the game lock flag. Is determined.

  FIG. 75 is a diagram showing a configuration of a lottery flag K lottery table. The lottery flag K lottery table defines the value of the lottery flag K set corresponding to the data pointer and the game lock flag. For example, in the lottery flag K lottery table, when the small role / replay data pointer is “10” or “12”, the lottery flag K is used regardless of the value of the bonus data pointer and the value of the game lock flag. , “1” is determined.

[ART lottery table]
Next, various ART lottery tables will be described with reference to FIGS. 76 to 93. Each ART lottery table is referred to when performing an ART lottery in a non-ART and non-bonus game. Each ART lottery table shows the correspondence between the lottery result values ("0" to "7") corresponding to the ART winning contents and the lottery values set according to the value of the lottery flag A-1.

  In the ART lottery using the ART lottery table, first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in the present embodiment) is used as the lottery result value of the ART lottery table. It subtracts sequentially with the lottery value specified every time. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the value of the lottery result at that time is won. The ART lottery referring to various ART lottery tables is performed in an ART lottery process described later (see FIG. 263 described later).

  FIG. 76 is a diagram showing the configuration of the ART lottery table (No. 1). The ART lottery table (part 1) is referred to when the sub gaming state is “general state”, the setting is “setting 1”, and the gaming state is “between non-flags”.

  Here, the gaming state “between flags” and “between non-flags” will be described. In this embodiment, when a winning combination related to any of “C_Don BB”, “C_Red 7”, “C_BAR”, and “C_Billy” is determined as an internal winning combination, the internal winning combination is carried over as a carryover combination. Stored in the role storage area. Specifically, when an internal winning combination relating to any of “C_Don BB”, “C_Red 7”, “C_BAR”, and “C_Billy” is determined, bits 0 to 3 of the carryover combination storage area 1 Among these, “1” is stored in the corresponding bit area.

  “Between flags” is a period in which “1” is stored in any of bits 0 to 3 of the carryover combination storage area 1, and “C_Don BB” and “C_Red 7” are used as internal winning combinations. , “C_BAR” and “C_Billy”, the period in which the combination is carried over. “Between non-flags” is a period in which “0” is stored in all the bits 0 to 3 of the carryover combination storage area 1, and “C_Don BB” and “C_Red 7” are used as internal winning combinations. , “C_BAR” and “C_Billy” are not carried over.

  In the present embodiment, a game (unit game) in which the roles related to “C_Don BB”, “C_Red 7”, “C_BAR” and “C_Billy” are determined as the internal winning combination is “between flags” and It is not included in “between non-flags” and is called “flag establishment”.

  Also, in the ART lottery table (part 1) shown in FIG. 76, “0” is assigned as the value of the first lottery table type. The first lottery table type is used when determining a table number with reference to a later-described general and CZ stock number table number determination table (see FIG. 96 described later).

  As shown in FIG. 76, when performing an ART lottery with reference to the ART lottery table (No. 1), there is a high probability that the value of the lottery result will be “0 (out)”. For example, in the ART lottery table (No. 1), even if the lottery flag A-1 is “7 (strong ice)” or “9 (strong cherry)”, the value of the lottery result is always “0 (missed)”. become.

  FIG. 77 is a diagram showing the configuration of the ART lottery table (No. 2). The ART lottery table (No. 2) is referred to when the sub gaming state is “CZ (chance zone) in progress”, the setting is “setting 1”, and the gaming state is “between non-flags”. . In the ART lottery table (No. 2), “1” is assigned as the value of the first lottery table type.

  As is clear from the comparison between FIG. 77 and FIG. 76, when the ART lottery is performed with reference to the ART lottery table (No. 2), the ART lottery is referred to with reference to the ART lottery table (No. 1). In addition, the probability that “1 (B_ART winning)” or “2 (D_ART winning)” is determined as the value of the lottery result is increased. That is, the winning probability of ART in the “chance zone” is higher than that in the “general state”.

  In the ART lottery table (part 2), as shown in FIG. 77, for example, when the lottery flag A-1 is “6 (weak ice)” or “7 (strong ice)”, the lottery result is The value “2 (D_ART winning)” is determined, but “1 (B_ART winning)” is not determined. At this time, when the lottery flag A-1 is “6 (weak ice)”, “2 (D_ART winning)” is determined as the value of the lottery result with a probability of about 1/3. When the lottery flag A-1 is “7 (strong ice)”, “2 (D_ART winning)” is determined as the lottery result value with a probability of about 2/3.

  Furthermore, in the ART lottery table (part 2), as shown in FIG. 77, for example, when the lottery flag A-1 is “8 (weak cherry)” or “9 (strong cherry)”, the lottery result is The value “1 (B_ART winning)” is determined, but “2 (D_ART winning)” is not determined. At this time, if the lottery flag A-1 is “8 (weak cherry)”, “1 (B_ART winning)” is determined as the value of the lottery result with a probability of about ¼. When the lottery flag A-1 is “9 (strong cherry)”, “1 (B_ART winning)” is determined as the lottery result value with a probability of 1/2.

  In the ART lottery table (No. 2) of the present embodiment, the internal winnings related to “weak ice” (small role / replay data pointer “10”) and “strong ice” (small role / replay data pointer “11”). The role indicates a specific example of the “first special role” according to the present invention. The internal winning combination relating to “weak cherry” (small role / replay data pointer “12”) and “strong cherry” (small role / replay data pointer “13”, “14”) A specific example of “2 special roles” is shown. Furthermore, “D_ART” indicates a specific example of the “first assist state” according to the present invention, and “B_ART” indicates a specific example of the “second assist state” according to the present invention. is there.

  Therefore, in this embodiment, when “first special combination” is determined as an internal winning combination during “non-ART”, the probability that the first assist state wins more than the second assist state in the ART lottery of the game. Is expensive. On the other hand, when “second special combination” is determined as an internal winning combination during “non-ART”, the probability that the second assist state wins in the ART lottery of the game is higher than that in the first assist state.

  FIG. 78 is a diagram showing the configuration of the ART lottery table (No. 3). The ART lottery table (part 3) is referred to when the gaming state is “with base ART information”, the setting is “setting 1”, and the gaming state is “between non-flags”. In the ART lottery table (No. 3), “2” is assigned as the value of the first lottery table type.

  Here, “base ART information” will be described. The “base ART information” is information stored in a sub storage area (see FIG. 223 described later) described later when there is an ART to be started or restored next. In the present embodiment, the winning ART is started after one or a plurality of precursor games after winning various ARTs. Accordingly, during one or more precursor games played in the “general state” and the “chance zone”, it is determined that the “base ART information exists” state. Specifically, the gaming state in which the winning information of “D_ART” or “B_ART” is stored in “ART stock area A” or “ART stock area B” of a sub storage area (see FIG. 223 described later) is , “Base ART information exists” is entered.

  When performing ART lottery with reference to the ART lottery table (No. 3), as shown in FIG. 78, “7 (G_ART winning)” may be determined as the lottery result value. For example, when the lottery flag A-1 is “7 (strong ice)” or “9 (strong cherry)”, “7 (G_ART winning)” is determined as the lottery result value with a probability of about 1/3. Is done.

  FIG. 79 is a diagram showing the structure of the ART lottery table (No. 4). The ART lottery table (No. 4) is referred to when the sub gaming state is “general state”, the setting is “setting 1”, and the gaming state is “flag established”. Further, “3” is assigned to the ART lottery table (part 4) as the value of the first lottery table type.

  When performing an ART lottery with reference to the ART lottery table (No. 4), as shown in FIG.

  FIG. 80 is a diagram showing a configuration of an ART lottery table (No. 5). The ART lottery table (No. 5) is referred to when the sub gaming state is “CZ (chance zone)”, the setting is “setting 1”, and the gaming state is “flag established”. Further, “4” is assigned to the ART lottery table (No. 5) as the value of the first lottery table type.

  As is clear from the comparison between FIG. 80 and FIG. 79, when the ART lottery is performed with reference to the ART lottery table (No. 5), the ART lottery is referred to with reference to the ART lottery table (No. 4). In addition, the probability that “1 (B_ART winning)” or “2 (D_ART winning)” is determined as the value of the lottery result is increased.

  FIG. 81 is a diagram showing the structure of the ART lottery table (No. 6). The ART lottery table (No. 6) is referred to when the gaming state is “with base ART information”, the setting is “setting 1”, and the gaming state is “flag established”. Also, “5” is assigned to the ART lottery table (No. 6) as the value of the first lottery table type.

  When the ART lottery is performed with reference to the ART lottery table (No. 6), “7 (G_ART winning)” may be determined as the lottery result value as shown in FIG.

  In the present embodiment, ART lottery is not performed for “between flags”. Therefore, in the “between flags”, the internal winning combination related to the replay is more easily determined than the normal state (RT0 gaming state or RT1 gaming state) without intentionally stopping and displaying the symbol combination related to the operation of the bonus. Even if you continue the RT3 gaming state, you will not win the ART.

  However, ART lottery is performed in a game in which a combination related to “C_Don BB”, “C_Red 7”, “C_BAR”, and “C_Billy” is determined as an internal winning combination, that is, a game with “flag established”. In the “flag establishment”, a small winning combination with a low winning probability may be determined as an internal winning combination simultaneously with the internal winning combination related to the bonus. When a small combination having a low winning probability is determined as an internal winning combination, the probability of winning an ART increases.

  For this reason, an ART lottery is performed in a “flag established” game in which a small winning combination with a low winning probability may be determined as an internal winning combination. In this embodiment, the ART lottery table that is referred to when “flag is established” is provided separately from the ART lottery table that is referred to when “between non-flags”.

  82 to 87 are diagrams showing the configurations of the ART lottery table (No. 7) to the ART lottery table (No. 12), respectively. The ART lottery table (part 7) to the ART lottery table (part 12) are referred to when the setting is “setting 6”.

  88 to 93 are diagrams showing the configurations of the ART lottery table (No. 13) to the ART lottery table (No. 18), respectively. The ART lottery table (No. 13) to the ART lottery table (No. 18) is referred to when there is a “penalty” (common to all settings).

  In the present embodiment, for example, “10” is given as a “penalty addition point” when a stop operation is performed in a non-recommended pressing order (stop order). Then, when the total number of “penalty addition points” is “1” or more, ART lottery is performed using a penalty-use ART lottery table (not shown). The “penalty addition point” is decremented by “1” every time the unit game is executed.

  When the sub gaming state is “CZ (chance zone) in progress”, “penalty” is present, and the gaming state is “between non-flags”, as shown in FIG. There is a high probability of becoming “0”. For example, even if the lottery flag A-1 is “7 (strong ice)” or “9 (strong cherry)”, the value of the lottery result is always “0 (out)”.

[General and CZ ART stock area sorting lottery table]
Next, with reference to FIG. 94 and FIG. 95, various general and CZ ART stock area sorting lottery tables will be described. General and CZ ART stock area sorting lottery table is referenced when determining the stock area for storing the winning information in the ART lottery during non-ART and non-bonus when “D_ART” or “B_ART” is won. Is done.

  Each general and CZ ART stock area sorting lottery table includes a lottery result value (“0” or “1”) corresponding to the ART stock area, and a lottery value set according to the value of the lottery flag A-1. The correspondence relationship is shown.

  In the stock area sorting lottery using each general and CZ ART stock area sorting lottery table, first, random numbers extracted from a predetermined numerical range (0 to 32767, random number denominator = 32768 in this embodiment). The numerical value is sequentially subtracted by a lottery value defined for each lottery result value. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won. The stock area sorting lottery described above is performed in an ART lottery process described later (see FIG. 263 described later).

  FIG. 94 is a diagram showing a configuration of a general and CZ ART stock area sorting lottery table (part 1). The general and CZ ART stock area sorting lottery table (part 1) is referred to when “B_ART” is won. As shown in FIG. 94, when “B_ART” is won by the ART lottery in the “general state” and “chance zone (CZ)”, the value of the lottery result is always “0 (ART stock area A)”. It is determined.

  FIG. 95 is a diagram showing the configuration of a general and CZ ART stock area sorting lottery table (No. 2). The general and CZ ART stock area sorting lottery table (part 2) is referred to when “D_ART” is won. As shown in FIG. 95, when “D_ART” is won by ART lottery in the “general state” and “chance zone (CZ)”, the value of the lottery result is always “0 (ART stock area A)”. It is determined. That is, in this embodiment, regardless of which “D_ART” or “B_ART” wins in the “general state” and “chance zone (CZ)”, the winning information is stored in the ART stock area A. The

  In the present embodiment, two ART stock areas (ART stock area A and ART stock area B) are provided in the sub storage area. The ART stock area A is an area in which winning information of “D_ART” or “B_ART” scheduled to display (notify) that “ART” has been won is stored. On the other hand, the ART stock area B is an area in which winning information of “D_ART” or “B_ART” scheduled to hide (not notify) that an ART has been won is stored.

  At the time of ART lottery in the “general state” and “chance zone (CZ)”, ART winning information is not stored in the ART stock area. In this embodiment, winning an ART in a state where no ART winning information is stored in the ART stock area is referred to as “ART first hit”.

  In the present embodiment, when the ART of “D_ART” or “B_ART” is won by the ART lottery in the “general state” and “chance zone (CZ)”, that is, when “ART first hit” occurs. 94 and FIG. 95, as described in the general and CZ ART stock area allocation lottery table, regardless of which “D_ART” or “B_ART” is won, the ART winning information is stored in the ART in the sub storage area. It is stored in the stock area A. That is, when “ART first hit” occurs, it is always displayed (notified) that “D_ART” or “B_ART” is won.

  In this embodiment, when the “D_ART” ART is won at the “first hit of ART”, a symbol (for example, the character “Don-chan”) corresponding to “D_ART” is displayed on the liquid crystal display device 11. . On the other hand, if the “B_ART” ART is won at the “ART first hit”, a symbol (for example, the character “Billy”) corresponding to “B_ART” is displayed on the liquid crystal display device 11. In addition, when “D_ART” and “B_ART” are overlapped at the “ART first hit”, a symbol corresponding to “D_ART” and a symbol corresponding to “B_ART” are simultaneously displayed on the liquid crystal display device. 11 is displayed.

  The display of the symbol corresponding to “D_ART” or “B_ART” is performed, for example, in a unit game (game) that wins “D_ART” or “B_ART”. However, the present invention is not limited to this, and symbols corresponding to “D_ART” and “B_ART” may be displayed at an arbitrary timing (trigger) due to the winning of “D_ART” or “B_ART”. In this case, in this embodiment, the timing resulting from winning of “D_ART” or “B_ART” is a predetermined number of unit games (several times) from the unit game (game) won for “D_ART” or “B_ART”. Within the timing.

  Thus, in this embodiment, since the symbol corresponding to the winning “ART” is displayed on the liquid crystal display device 11, the player can recognize the type of the winning “ART”. As a result, the player can be aware of the type of “ART” to be executed later, and when “ART” is executed (at the start), the type of “ART” is not known and the gameability is ambiguous. Will not be.

  Further, the pachi-slot 1 of the present embodiment has a configuration in which “D_ART” and “B_ART” can be won in duplicate. Therefore, in the configuration of the present embodiment, the relevance of these two types of “ART” is increased, and the interest of the game can be enhanced. Furthermore, when “D_ART” and “B_ART” are overlapped, a symbol corresponding to “D_ART” and a symbol corresponding to “B_ART” are displayed at the same time, so “D_ART” and “B_ART” It is possible to clearly notify the player that the player has won in duplicate.

[Table number determination table for general and CZ stock]
Next, with reference to FIG. 96, a table number determination table for general and CZ stock will be described. The table number determination table for general and CZ stock is determined when “D_ART” or “B_ART” is won in the ART lottery during non-ART and non-bonus, and the table number which is a part of the winning information is determined. To be referenced.

  The table number determination table at the time of general and CZ stock specifies the table number set according to the value of the first lottery table type ("0" to "5") and the value of the lottery flag A-1. . In this embodiment, as shown in FIG. 96, when referring to the table number determination table for general and CZ stock, “0” is always determined as the table number.

[ART lottery table when finalizing]
Next, with reference to FIG. 97 to FIG. 101, various determined combination ART lottery tables will be described. Each determined lottery ART lottery table is referred to when performing an ART lottery during a confirmed combination. Each of the determined lottery ART lottery tables shows the correspondence between the lottery result values ("0" to "12") corresponding to the contents of winning the ART and the lottery values set according to the value of the lottery flag A-2. Indicates.

  In the present embodiment, “at the time of a final winning combination” refers to a game in which an internal winning combination that is sure to win any ART is determined. Therefore, when the ART lottery is performed using the determined lottery ART lottery table, a value other than “0 (out)” is determined as the lottery result value.

  In the ART lottery using the determined lottery table, a random value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) is first calculated for each lottery result value. Subtract sequentially with the lottery value specified in. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 97 is a diagram showing a configuration of the determined combination ART lottery table (part 1). The determined lottery ART lottery table (part 1) is referred to when the sub game state is the “general state”. In addition, “0” is assigned as the value of the second lottery table type to the determined lottery ART lottery table (part 1). The second lottery table type is used when determining a table number with reference to a table number determination table (see FIG. 102, which will be described later), which will be described later, at the time of a stock for a fixed combination.

  When performing an ART lottery with reference to the determined lottery table (part 1), for example, if the lottery flag A-2 is “2 (Billy bonus)”, the value of the lottery result is “1 (B_ART winning). ) ”Is always determined.

  FIG. 98 is a diagram showing a configuration of the determined combination ART lottery table (No. 2). The determined lottery ART lottery table (part 2) is referred to when the sub gaming state is “chance zone (CZ)”. In addition, “1” is assigned as the value of the second lottery table type to the ART lottery table (part 2) at the confirmed combination.

  When performing the ART lottery with reference to the final lottery table (part 2), for example, if the lottery flag A-2 is “2 (Billy Bonus)”, the value of the lottery result is “4 (B_ART & G_ART winning). ) ”Is always determined.

  FIG. 99 is a diagram showing the structure of the determined combination ART lottery table (No. 3). The determined lottery ART lottery table (No. 3) is referred to when the sub game state is “general state” or “chance zone (CZ)” and the game period is “art warning”. In addition, “2” is assigned as the value of the second lottery table type in the ART lottery table (part 3) at the confirmed combination. Here, “ART precursor” is a period from when “ART” is won until the game of the number of ART precursor games determined by lottery is consumed.

  When performing the ART lottery with reference to the final lottery table (part 3), for example, if the lottery flag A-2 is “2 (Billy Bonus)”, the value of the lottery result is “7 (G_ART winning). ) ”Is always determined.

  FIG. 100 is a diagram illustrating a configuration of the determined combination ART lottery table (part 4). In the final lottery table (part 4), the sub game state is “ART”, the sub game state is “general state” or “chance zone”, and the game period is “ART ready”. Referenced in some cases. In addition, “3” is assigned as the value of the second lottery table type in the ART lottery table (No. 4) at the confirmed combination.

  Here, “ART ready” means one or a plurality of game periods from the end of “ART precursor” to the start of “ART”. For example, if the RT gaming state is the RT0 gaming state or the RT1 gaming state in the state where the “ART precursor” has ended, the RT gaming state is shifted to the RT2 gaming state in order to start “ART”. There is a need. Therefore, if the RT gaming state is the RT0 gaming state or the RT1 gaming state when the “art warning” is finished, in the “ART ready” game, The symbol combination (display combination) related to “RT2 transition lip” is stopped and displayed, and the RT gaming state is shifted to the RT2 gaming state.

  In the present embodiment, the “ART” game may be started without going through “ART preparation” after the “ART precursor” game ends. In that case, the stop order for stopping and displaying the symbol combination (display combination) related to “RT2 transition lip” is notified to “RT sign”, and the RT gaming state is surely shifted to the RT2 gaming state. To do. By performing such an operation, the game “in preparation for ART” is omitted.

  When performing the ART lottery with reference to the final lottery table (part 4), for example, if the lottery flag A-2 is “2 (Billy Bonus)”, the value of the lottery result is “7 (G_ART winning). ) ”Is always determined.

  FIG. 101 is a diagram showing a configuration of the determined combination ART lottery table (No. 5). Refer to the ART lottery table (No. 5) for the confirmed combination when the sub game state is "ART" and when the sub game state is "ART" and "Viking Rush (VR)" is executed. Is done. In addition, “4” is assigned as the value of the second lottery table type to the ART lottery table (No. 5) at the determined combination.

  When performing the ART lottery with reference to the final lottery table (No. 5), for example, if the lottery flag A-2 is “1 (freeze + don)”, the value of the lottery result is “12 (B_ART & D_ART & G_ART). “Win & VR Win)” is always decided.

  In the present embodiment, when “12 (B_ART & D_ART & G_ART winning & VR winning)” is determined as the value of the lottery result, the game lock is determined. When the determined game lock occurs, the liquid crystal display device 11 corresponds to the symbol corresponding to “B_ART”, the symbol corresponding to “D_ART”, the symbol corresponding to “G_ART”, and “VR”. The symbols are displayed at the same time. Thereby, the player can recognize that “B_ART”, “D_ART”, “G_ART”, and “VR” are won in duplicate.

[Table number determination table at the time of stock at the final position]
Next, with reference to FIG. 102, a table number determination table at the time of stock at the fixed combination will be described. The table number determination table at the time of the stock at the time of the final winning combination is referred to when determining the table number which is a part of the winning information by winning various “ART” in the ART lottery at the time of “final winning”.

  The table number determination table at the time of the stock at the time of a fixed combination defines the table number set according to the value of the second lottery table type (“0” to “4”) and the value of the lottery flag A-2. In the present embodiment, as shown in FIG. 102, when the value of the lottery flag A-2 is “2 (Billy bonus)” and the value of the second table type is “4 (in VR)”, “1” is determined as the table number. If the value of the lottery flag A-2 is “2 (Billy Bonus)” and the value of the ART lottery table type is “0 (general)”, “3” is determined as the table number. The

[B_ART ART lottery table]
Next, the various B_ART ART lottery tables will be described with reference to FIGS. Each B_ART ART lottery table is referred to when performing ART lottery in “B_ART”. Each B_ART ART lottery table is set according to the lottery result values (“0” to “8” and “13” to “16”) corresponding to the winning content of the ART and the value of the lottery flag A-3. The correspondence with lottery values is shown.

  In the ART lottery that refers to the ART lottery table during B_ART, first, a random number value extracted from a predetermined numerical range (in this embodiment, 0-32767, random number denominator = 32768) is determined for each lottery result value. Subtract sequentially with the specified lottery value. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 103 is a diagram showing a configuration of an ART lottery table (part 1) during B_ART. In the B_ART ART lottery table (part 1), the setting is “setting 1”, the ART mode is “ART mode 0” to “ART mode 1”, the gaming state is “between non-flags”, and This is referred to when the current game is “a game for which the ART start G number has been determined” or the number of ART games is “more than the last (remaining) 5G”. In addition, “0” is assigned as the value of the third lottery table type to the ART lottery table during B_ART (part 1). The third lottery table type is used when determining a table number with reference to a table number determination table (see FIG. 127 described later) during stocking during B_ART and D_ART described later.

  In the present embodiment, when the sub gaming state is “B_ART” or “D_ART”, four “ART modes” (“ART mode 0”, “ART mode 1”, “ART mode 2”, and “ART mode 3”). )). The ART lottery table during B_ART is provided corresponding to each “ART mode”. Therefore, even if the games are in the same “B_ART”, for example, the probability of winning “G_ART” can be made different because the “ART mode” is different.

  The “game for which the ART start G (game) number has been determined” is a game in which “ART” is started. In this embodiment, in the game where “ART” is started, the ART start G number is determined, and the determined ART start G number is set in the ART game number counter. Therefore, the subtraction operation of the ART game number counter is started from the game next to the game for which the ART start G number is determined. Therefore, in the present embodiment, an ART lottery table during B_ART that is referred to in the “game in which the ART start G number has been determined”, which is a game in which “B_ART” is started, is defined.

  FIG. 104 is a diagram showing a configuration of an ART lottery table (part 2) during B_ART. In the B_ART ART lottery table (part 2), the setting is “setting 1”, the ART mode is “ART mode 2”, the gaming state is “non-flagged”, and the current game is “ART” It is referred to when the game is “the game with the starting G number determined” or the ART game number is “greater than the last (remaining) 5G”. In addition, “1” is assigned as the value of the third lottery table type in the ART lottery table during B_ART (part 2).

  FIG. 105 is a diagram showing a configuration of an ART lottery table (part 3) during B_ART. The ART lottery table during B_ART (part 3) is set to “setting 1”, the ART mode is “ART mode 3”, the gaming state is “non-flagged”, and the current game is “ART” It is referred to when the game is “the game with the starting G number determined” or the ART game number is “greater than the last (remaining) 5G”. In addition, “2” is assigned as the value of the third lottery table type to the ART lottery table during B_ART (part 3).

  FIG. 106 is a diagram showing a configuration of an ART lottery table (part 4) during B_ART. In the B_ART ART lottery table (part 4), the setting is “setting 1”, the ART mode is “ART mode 0” to “ART mode 3”, the gaming state is “between non-flags”, and Referenced when the number of ART games is “last (remaining) 5G or less”. In addition, “3” is assigned as the value of the third lottery table type to the ART lottery table during B_ART (part 4).

  In the present embodiment, when the number of ART games of “B_ART” becomes “last (remaining) 5G or less”, even if the “ART mode” is different, a common B_ART ART lottery table is referred to. In the present embodiment, when the number of ART games of “B_ART” is “last (remaining) 5G or less”, the player wins “ART” more than when the number of ART games is “greater than (last) 5G”. The lottery value is set so that the probability is low.

  Therefore, in the state where the number of ART games of “B_ART” is “last (remaining) 5G or less”, after this “B_ART” is finished, it is a continuous effect that notifies whether or not the next “ART” is started. In the case of performing, it is possible to reduce the probability of winning “ART” during the continuous production. As a result, it is possible to reduce the chance of notifying the winning of “ART” in the middle of the continuous production in “B_ART”, and it is possible to prevent a continuous production with an uncomfortable feeling from being executed.

  FIG. 107 is a diagram showing a configuration of an ART lottery table (No. 5) during B_ART. In the B_ART ART lottery table (part 5), the setting is “setting 1”, the ART mode is “ART mode 0” to “ART mode 3”, and the gaming state is “flag established (BB, RB established)”. And the current game is “a game for which the ART start G number has been determined” or the ART game number is “more than the last (remaining) 5G”. Also, “4” is assigned as the value of the third lottery table type in the ART lottery table (No. 5) during B_ART.

  FIG. 108 is a diagram showing a configuration of an ART lottery table (No. 6) during B_ART. In the B_ART ART lottery table (No. 6), the setting is “setting 1”, the ART mode is “ART mode 0” to “ART mode 3”, and the gaming state is “flag established (BB, RB established)”. And the number of ART games is “last (remaining) 5G or less”. In addition, “5” is assigned as the value of the third lottery table type to the ART lottery table (No. 6) during B_ART.

  109 to 114 are diagrams showing the configurations of the ART lottery table during B_ART (No. 7) to the ART lottery table during B_ART (No. 12), respectively. The B_ART ART lottery table (No. 7) to the B_ART ART lottery table (No. 12) is referred to when the setting is “setting 6”.

  As shown in the various B_ART ART lottery tables in FIGS. 103 to 114 described above, when performing ART lottery using the B_ART ART lottery table, the lottery flag A-3 is set to “6 (weak ice)” or “7 ( Strong ice) ", there is a possibility that" 7 (G_ART winning) "is determined as the value of the lottery result. For example, when referring to the ART lottery table (No. 1) during B_ART shown in FIG. 103, if the lottery flag A-3 is “7 (strong ice)”, the value of the lottery result has a probability of 1/2. “7 (G_ART winning)” is determined.

  As described above, the internal winning combination relating to “weak ice” (small role / replay data pointer “10”) and “strong ice” (small role / replay data pointer “11”) is “ A specific example of “first special role” is shown. The internal winning combination relating to “weak cherry” (small role / replay data pointer “12”) and “strong cherry” (small role / replay data pointer “13”, “14”) A specific example of “2 special roles” is shown. Therefore, when “first special combination” is determined as an internal winning combination during “B_ART” in the second assist state, the ART lottery of the game is determined more than when “second special combination” is determined. The probability of winning the “G_ART” in the third assist state is high.

  Further, in the present embodiment, when the “second special combination” is determined as the internal winning combination during “B_ART” in the second assist state, compared to the case where the “first special combination” is determined. There is a high probability that the number of extra games will be determined in the extra game number lottery. That is, when the “second special combination” is determined as the internal winning combination during “B_ART”, the addition of the number of ART games is expected more than when the “first special combination” is determined.

[ART lottery table during D_ART]
Next, various D_ART ART lottery tables will be described with reference to FIGS. Each D_ART ART lottery table is referred to when performing ART lottery in “D_ART”. Each D_ART ART lottery table is set according to the lottery result values ("0" to "8" and "13" to "16") corresponding to the winning contents of the ART and the value of the lottery flag A-3. The correspondence with lottery values is shown.

  An ART lottery table during D_ART is provided for each ART mode. Therefore, even in the same “D_ART”, since the “ART mode” is different, for example, the probability of winning “G_ART” can be made different.

  In the ART lottery that refers to the ART lottery table during D_ART, first, a random value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) is calculated for each lottery result value. Subtract sequentially with the specified lottery value. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 115 is a diagram illustrating a configuration of an ART lottery table (part 1) during D_ART. In the D_ART ART lottery table (part 1), the setting is “setting 1”, the ART mode is “ART mode 1” to “ART mode 0”, the gaming state is “between non-flags”, and This is referred to when the current game is “a game for which the ART start G number has been determined” or the number of ART games is “more than the last (remaining) 5G”. In addition, “6” is assigned as the value of the third lottery table type in the ART lottery table (part 1) during D_ART.

  FIG. 116 is a diagram showing a configuration of an ART lottery table (part 2) during D_ART. In the D_ART ART lottery table (part 2), the setting is “setting 1”, the ART mode is “ART mode 2”, the gaming state is “non-flagged”, and the current game is “ART” It is referred to when the game is “the game with the starting G number determined” or the ART game number is “greater than the last (remaining) 5G”. Also, “7” is assigned as the value of the third lottery table type in the ART lottery table during D_ART (part 2).

  FIG. 117 is a diagram illustrating a configuration of an ART lottery table (part 3) during D_ART. In the D_ART ART lottery table (part 3), the setting is “setting 1”, the ART mode is “ART mode 3”, the gaming state is “non-flagged”, and the current game is “ART” It is referred to when the game is “the game with the starting G number determined” or the ART game number is “greater than the last (remaining) 5G”. In addition, “8” is assigned as the value of the third lottery table type in the ART lottery table during D_ART (part 3).

  FIG. 118 is a diagram showing a configuration of an ART lottery table (part 4) during D_ART. In the D_ART ART lottery table (part 4), the setting is “setting 1”, the ART mode is “ART mode 0” to “ART mode 3”, the gaming state is “between non-flags”, and Referenced when the number of ART games is “last (remaining) 5G or less”. In addition, “9” is assigned as the value of the third lottery table type in the ART lottery table (No. 4) during D_ART.

  In the present embodiment, when the number of ART games of “D_ART” becomes “last (remaining) 5G or less”, even if the “ART mode” is different, the common ART lottery table during D_ART is referred to. In this embodiment, when the number of ART games of “D_ART” is “last (remaining) 5G or less”, the player wins “ART” more than when the number of ART games is “greater than last (remaining) 5G”. The lottery value is set so as to reduce the probability. Therefore, the chance of notifying that “ART” is won during the continuous production in “D_ART” is reduced, and the continuous production with a sense of incongruity can be prevented from being executed.

  FIG. 119 is a diagram illustrating a configuration of an ART lottery table (part 5) during D_ART. In the D_ART ART lottery table (part 5), the setting is “setting 1”, the ART mode is “ART mode 0” to “ART mode 3”, and the gaming state is “flag established (BB, RB established)”. And the current game is “a game for which the ART start G number has been determined” or the ART game number is “more than the last (remaining) 5G”. In addition, “10” is assigned as the value of the third lottery table type to the ART lottery table (No. 5) during D_ART.

  FIG. 120 is a diagram showing a configuration of an ART lottery table (No. 6) during D_ART. In the D_ART ART lottery table (No. 6), the setting is “setting 1”, the ART mode is “ART mode 0” to “ART mode 3”, and the gaming state is “flag established (BB, RB established)”. And the number of ART games is “last (remaining) 5G or less”. Also, “11” is assigned as the value of the third lottery table type to the ART lottery table during D_ART (No. 6).

  121 to 126 are diagrams showing the configurations of the ART lottery table during D_ART (No. 7) to the ART lottery table during D_ART (No. 12), respectively. The D_ART ART lottery table (No. 7) to the D_ART ART lottery table (No. 12) is referred to when the setting is “setting 6”.

  When the ART lottery is performed using the ART lottery table during D_ART as shown in the various D_ART ART lottery tables of FIGS. 115 to 126 described above, the lottery flag A-3 is set to “8 (weak cherry)” or “9 ( If it is “strong cherry”, “7 (G_ART winning)” may be determined as the value of the lottery result. For example, when referring to the ART lottery table (No. 1) during D_ART shown in FIG. 115, if the lottery flag A-3 is “9 (strong cherry)”, the value of the lottery result has a probability of 1/4. “7 (G_ART winning)” is determined.

  As described above, the internal winning combination relating to “weak cherry” (small role / replay data pointer “12”) or “strong cherry” (small role / replay data pointer “13”, “14”) A specific example of the “second special role” according to the invention is shown. The internal winning combination relating to “weak ice” (small role / replay data pointer “10”) and “strong ice” (small role / replay data pointer “11”) is the “first special role” according to the present invention. One specific example is shown. Therefore, when the “second special combination” is determined as the internal winning combination during “D_ART” in the first assist state, the ART lottery of the game is determined more than when the “first special combination” is determined. The probability of winning the “G_ART” in the third assist state is high.

  Further, in the present embodiment, when “first special combination” is determined as an internal winning combination during “D_ART” in the first assist state, than when “second special combination” is determined, In the continuous stock lottery, there is a high probability that the continuous stock will win. That is, when “first special role” is determined as an internal winning combination during “D_ART”, execution of the next set of “D_ART” is expected more than when “second special role” is determined. Is done.

[Table number determination table for stock during B_ART and D_ART]
Next, with reference to FIG. 127, a table number determination table for stock during B_ART and during D_ART will be described. The table number determination table at the time of stock during B_ART and D_ART is determined when various “ART” are won in the ART lottery during “B_ART” or “D_ART” and the table number which is a part of the winning information is determined. Referenced.

  The table number determination table for stock during B_ART and D_ART specifies the table number set according to the value of the third lottery table type ("0" to "11") and the value of the lottery flag A-3. To do. In the present embodiment, as shown in FIG. 127, when referring to the table number determination table at the time of stock during B_ART and D_ART, “1” is always determined as the table number.

[ART lottery table during G_ART]
Next, various G_ART ART lottery tables will be described with reference to FIGS. 128 to 133. Each G_ART ART lottery table is referred to when performing ART lottery in “G_ART”. Each G_ART ART lottery table is set according to the lottery result values ("0" to "6", "8" and "16") corresponding to the contents of the winning ART and the value of the lottery flag A-3. The correspondence with lottery values is shown.

  In the ART lottery that refers to the ART lottery table during G_ART, first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) is determined for each lottery result value. Subtract sequentially with the specified lottery value. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 128 is a diagram showing a configuration of an ART lottery table (part 1) during G_ART. The ART lottery table during G_ART (part 1) is referred to when the coalescing mode is “merging mode 0” and the gaming state is “between non-flags”. In addition, “0” is assigned as the value of the fourth lottery table type to the ART lottery table during G_ART (part 1). The fourth lottery table type is used when determining a table number with reference to a table number determination table (see FIG. 136 described later) during stock during G_ART and R_ART described later.

  In this embodiment, when the sub gaming state is “G_ART” or “R_ART”, three “merging modes” (“merging mode 0”, “merging mode 1”, and “merging mode 2”) are provided. Therefore, even in the same “G_ART”, since the “merging mode” is different, for example, the probability of winning “B_ART” or “D_ART” can be made different.

  FIG. 129 is a diagram illustrating a configuration of an ART lottery table (part 2) during G_ART. The ART lottery table during G_ART (part 2) is referred to when the coalescing mode is “merging mode 1” and the gaming state is “between non-flags”. In addition, “1” is assigned as the value of the fourth lottery table type in the ART lottery table (part 2) during G_ART.

  FIG. 130 is a diagram illustrating a configuration of an ART lottery table (part 3) during G_ART. The G_ART ART lottery table (part 3) is referred to when the coalescing mode is “merging mode 2” and the gaming state is “between non-flags”. In addition, “2” is assigned as the value of the fourth lottery table type in the ART lottery table during G_ART (part 3).

  FIG. 131 is a diagram showing a configuration of an ART lottery table (part 4) during G_ART. The ART_lottery table during G_ART (part 4) is referred to when the coalescing mode is “merging mode 0” and the gaming state is “flag established (BB, RB established)”. In addition, “3” is assigned as the value of the fourth lottery table type in the ART lottery table (part 4) during G_ART.

  FIG. 132 is a diagram showing a configuration of an ART lottery table (No. 5) during G_ART. The G_ART ART lottery table (No. 5) is referred to when the coalescing mode is “merging mode 1” and the gaming state is “flag established (BB, RB established)”. In addition, “4” is assigned as the value of the fourth lottery table type in the ART lottery table (No. 5) during G_ART.

  FIG. 133 is a diagram illustrating a configuration of an ART lottery table (part 6) during G_ART. The G_ART ART lottery table (No. 6) is referred to when the coalescing mode is “merging mode 2” and the gaming state is “flag established (BB, RB established)”. In addition, “5” is assigned as the value of the fourth lottery table type in the ART lottery table (No. 6) during G_ART.

  As shown in the various G_ART ART lottery tables in FIGS. 128 to 133 described above, when performing ART lottery with reference to the G_ART ART lottery table, the lottery flag A-3 is “6 (weak ice)” or “7 If it is (strong ice), “2 (D_ART winning)” may be determined as the value of the lottery result. For example, when referring to the ART lottery table (part 1) during G_ART shown in FIG. 128, if the lottery flag A-3 is “7 (strong ice)”, the value of the lottery result is a probability of 32256/32768. “2 (D_ART winning)” is determined.

  As described above, the internal winning combination relating to “weak ice” (small role / replay data pointer “10”) and “strong ice” (small role / replay data pointer “11”) is “ A specific example of “first special role” is shown. The internal winning combination relating to “weak cherry” (small role / replay data pointer “12”) and “strong cherry” (small role / replay data pointer “13”, “14”) A specific example of “2 special roles” is shown. Therefore, when “first special combination” is determined as the internal winning combination during “G_ART” in the third assist state, the ART lottery of the game is determined more than when “second special combination” is determined. The probability of winning the “D_ART” in the first assist state is high.

  Further, when performing ART lottery using the ART lottery table during G_ART, if the lottery flag A-3 is “8 (weak cherry)” or “9 (strong cherry)”, the lottery result value is “1 (B_ART There is a possibility that it will be decided. For example, when referring to the ART lottery table during G_ART (No. 1) shown in FIG. 128, if the lottery flag A-3 is “9 (strong cherry)”, the value of the lottery result has a probability of 32512/32768. “1 (B_ART winning)” is determined.

  Accordingly, when the “second special combination” is determined as the internal winning combination during “G_ART” in the third assist state, the ART lottery of the game is determined more than when the “first special combination” is determined. The probability of winning the “B_ART” in the second assist state is high.

[ART lottery table during R_ART]
Next, with reference to FIG. 134 and FIG. 135, various R_ART ART lottery tables will be described. Each R_ART ART lottery table is referred to when performing ART lottery in “R_ART”. Each R_ART ART lottery table is set according to the lottery result values ("0" to "6", "8" and "16") corresponding to the contents of the winning ART and the value of the lottery flag A-3. The correspondence with lottery values is shown.

  In the ART lottery that refers to the ART lottery table during R_ART, first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) is determined for each lottery result value. Subtract sequentially with the specified lottery value. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 134 is a diagram showing a configuration of an ART lottery table (part 1) during R_ART. The R_ART ART lottery table (part 1) is referred to when the gaming state is “between non-flags”. In addition, “6” is assigned as the value of the fourth lottery table type in the ART lottery table during R_ART (part 1).

  FIG. 135 is a diagram showing a configuration of an ART lottery table (part 2) during R_ART. The R_ART ART lottery table (part 2) is referred to when the gaming state is “flag established (BB, RB established)”. In addition, “7” is assigned as the value of the fourth lottery table type in the ART lottery table (No. 2) during R_ART.

  As shown in the various R_ART ART lottery tables in FIGS. 134 and 135 described above, when performing ART lottery with reference to the R_ART ART lottery table, the lottery flag A-3 is set to “6 (weak ice)” or “7 If it is (strong ice), “2 (D_ART winning)” may be determined as the value of the lottery result. For example, when referring to the ART lottery table during G_ART (part 1) shown in FIG. 134, if the lottery flag A-3 is “7 (strong ice)”, the lottery result value is “2 (D_ART winning). Is always determined.

  As described above, the internal winning combination relating to “weak ice” (small role / replay data pointer “10”) and “strong ice” (small role / replay data pointer “11”) is “ A specific example of “first special role” is shown. The internal winning combination relating to “weak cherry” (small role / replay data pointer “12”) and “strong cherry” (small role / replay data pointer “13”, “14”) A specific example of “2 special roles” is shown. Therefore, when the “first special combination” is determined as the internal winning combination during “R_ART”, the first assist state is determined in the ART lottery of the game, compared with the case where the “second special combination” is determined. The probability of winning “D_ART” is high.

  Further, when performing ART lottery with reference to the ART lottery table during R_ART, if the lottery flag A-3 is “8 (weak cherry)” or “9 (strong cherry)”, the lottery result value is “1 ( B_ART winning) ”may be determined. For example, when referring to the ART lottery table (No. 1) during R_ART shown in FIG. 134, if the lottery flag A-3 is “9 (strong cherry)”, the lottery result value is “1 (B_ART winning). Is always determined.

  Therefore, when the “second special combination” is determined as the internal winning combination during “R_ART”, the second assist state is determined in the ART lottery of the game, compared to the case where the “first special combination” is determined. There is a high probability of winning “B_ART”.

[Table number determination table for stock during G_ART and R_ART]
Next, with reference to FIG. 136, a table number determination table for stock during G_ART and R_ART will be described. The table number determination table at the time of stock during G_ART and R_ART is determined when various “ART” is won in the ART lottery during “G_ART” or “R_ART” and the table number which is a part of the winning information is determined. Referenced.

  The table number determination table at the time of stock during G_ART and R_ART specifies the table number set according to the value of the fourth lottery table type (“0” to “7”) and the value of the lottery flag A-3. To do. In the present embodiment, as shown in FIG. 136, when the table number determination table during G_ART and R_ART stock is referred to, “1” is always determined as the table number.

[ART stock area sorting lottery table during ART]
Next, with reference to FIGS. 137 to 140, the ART stock area allocation lottery table during various ARTs will be described. The ART stock area allocation lottery table during various ARTs is referred to when “D_ART” or “B_ART” is won in the ART lottery during various ARTs and a stock area for storing the information is determined.

  Each ART stock area allocation lottery table includes a lottery result value ("0" or "1") corresponding to the type of ART stock area, and a lottery value set according to the value of the lottery flag A-3. The correspondence relationship is shown.

  In the stock area sorting lottery using the ART stock area sorting lottery table during ART, first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) A lottery value defined for each lottery result value is sequentially subtracted. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won. The stock area sorting lottery described above is performed in an ART lottery process described later (see FIG. 263 described later).

  FIG. 137 is a diagram showing a configuration of an ART stock area sorting lottery table (part 1) during ART. The ART stock area allocation lottery table (Part 1) is referred to when the ART of “B_ART” is won in the gaming state of “All ART except for the union mode 2 during G_ART” and “All in preparation”. The

  In the present embodiment, as shown in FIG. 137, when the ART of “B_ART” is won by the ART lottery in the above-mentioned ART, if the lottery flag A-3 is “6 (weak ice)”, As the value of the lottery result, “1 (ART stock area B)” is determined with a probability of approximately 1/5.

  FIG. 138 is a diagram showing a configuration of an ART stock area sorting lottery table (part 2) during ART. The ART stock area allocation lottery table (Part 2) is referred to when the ART of “D_ART” is won in the game state of “All ART except the coalescing mode 2 in G_ART” and “All in preparation”. The

  In this embodiment, as shown in FIG. 138, when the ART of “D_ART” is won by the ART lottery in the above-mentioned ART, if the lottery flag A-3 is “6 (weak ice)”, As the value of the lottery result, “1 (ART stock area B)” is determined with a probability of approximately 1/5.

  FIG. 139 is a diagram illustrating a configuration of an ART stock area sorting lottery table (part 3) during ART. The ART stock area sorting lottery table (No. 3) is referred to when the ART of “B_ART” is won in the gaming state of “Under the ART in the coalescing mode 2 during G_ART (not included in preparation)”.

  In this embodiment, as shown in FIG. 139, when “B_ART” is won by the ART lottery in the above-mentioned ART, if the lottery flag A-3 is “6 (weak ice)”, the lottery result The value “0 (ART stock area A)” is always determined.

  FIG. 140 is a diagram showing a configuration of the ART stock area allocation lottery table (part 4) during ART. The ART stock area sorting lottery table (No. 4) is referred to when the ART of “D_ART” is won in the gaming state of “Under the ART in the merge mode 2 during G_ART (not included in preparation)”.

  In this embodiment, as shown in FIG. 140, when “D_ART” is won by the ART lottery in the above-mentioned ART, if the lottery flag A-3 is “6 (weak ice)”, the lottery result The value “0 (ART stock area A)” is always determined.

  In the present embodiment, the winning information of “D_ART” or “B_ART” stored in “ART stock area A” is reported in principle. However, the winning information “D_ART” or “B_ART” stored in the “ART stock area A” may not be displayed (notified). This is because whether or not to display (notify) the winning information stored in the “ART stock area A” is determined based on an effect lottery process described later for each game. Note that the winning information of “D_ART” or “B_ART” stored in the “ART stock area B” is not necessarily displayed (notified).

[ART lottery table during bonus (BB, Billy bonus)]
Next, the ART lottery table during various bonuses (BB, Billy bonus) will be described with reference to FIGS. 141 and 142. The ART lottery table during each bonus (BB, Billy bonus) is referred to when performing ART lottery in the bonus. In each bonus (BB, billy bonus), the ART lottery table is a lottery set in accordance with the value of the lottery result ("0" to "14") corresponding to the winning content of the ART and the value of the lottery flag B-1. Indicates the correspondence with the value.

  In the ART lottery referring to the ART lottery table during the bonus (BB, billy bonus), first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) A lottery value defined for each lottery result value is sequentially subtracted. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 141 is a diagram showing a configuration of an ART lottery table (No. 1) during a bonus (BB, billy bonus). The ART lottery table (No. 1) during the bonus (BB, Billy bonus) is referred to when “the base ART is not set”. In addition, “0” is assigned as the value of the fifth lottery table type to the ART lottery table (part 1) during the bonus (BB, billy bonus). Note that the fifth lottery table type is used when determining a table number with reference to a table number determination table (see FIG. 143, which will be described later) for bonus stock during the following.

  FIG. 142 is a diagram showing a configuration of the ART lottery table (No. 2) during the bonus (BB, billy bonus). The ART lottery table (No. 2) during the bonus (BB, Billy bonus) is referred to when “base ART is set”. In addition, “1” is assigned as the value of the fifth lottery table type in the ART lottery table (No. 2) during the bonus (BB, billy bonus).

  Here, “the base ART is not set” means that the sub game state before the bonus is activated is not “ART”. That is, when “base ART is not set”, when the bonus operation ends, the sub gaming state shifts to “general state” or “chance zone”.

  On the other hand, “base ART is set” means that the sub gaming state before the bonus is activated was any “ART”. That is, when “base ART is set”, when the bonus operation ends, the sub gaming state returns to “ART”. During the bonus operation, the sub gaming state shifts to “bonus”.

  Specifically, if “0” is stored in “ART identification data storage area” in a sub storage area (see FIG. 223 described later) described later (unless “1” or “2” is stored). , “Base ART is not set” is determined. If “1” or “2” is stored in the “ART identification data storage area”, it is determined that “base ART is set”. If “1” is stored in the “ART identification data storage area”, “Base ART” is “D_ART”, and “2” is stored in the “ART identification data storage area”. , “Base ART” is “B_ART”.

[Table number determination table for stock during bonus]
Next, with reference to FIG. 143, a table number determination table at the time of stock during bonus will be described. The table number determination table at the time of stock during bonus is referred to when various “ART” is won in the ART lottery in which the bonus is operating and the table number which is a part of the winning information is determined.

  The table number determination table at the time of stock during bonus defines the table number set according to the value of the fifth lottery table type (“0” or “1”) and the value of the lottery flag B-1. In the present embodiment, as shown in FIG. 143, when the table number determination table at the time of stock during bonus is referred to, if the value of the lottery flag B-1 is “2 (BB_JAC)”, the fifth lottery table Regardless of the type value, “3” is determined as the table number.

[Special ART lottery table]
Next, various special ART lottery tables will be described with reference to FIGS. 144 and 145. Each special ART lottery table includes a lottery value (“0” to “14”) corresponding to the winning content of the ART, and lottery values set according to the presence / absence (set / not set) of “base ART”. The correspondence relationship is shown.

  In the ART lottery referring to the special ART lottery table, first, a random value extracted from a predetermined numerical range (0 to 32767, random number denominator = 32768 in the present embodiment) is defined for each lottery result value. Subtract sequentially with the lottery values. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 144 is a diagram showing a configuration of the special ART lottery table (part 1). The special ART lottery table (part 1) is referred to when the gaming state is “when bonus is completed (during billy bonus)”. In the special ART lottery table (part 1), “0” is assigned as the value of the sixth lottery table type. It is used when determining a table number with reference to a table number determination table (see FIG. 146 described later) for special ART described later.

  Here, “when bonus is completed” means that during the operation of the billy bonus (BB3 gaming state), the combination of symbols corresponding to the internal winning combination with “1” medal payout is displayed 15 times, This is when the bonus ends. Therefore, when the combination of symbols corresponding to the internal winning combination where the payout of medals is “15” is displayed and the billy bonus is ended, it does not correspond to “when bonus is completed”.

  In the present embodiment, as shown in FIG. 144, when the gaming state is “when bonus is completed”, “5 (D_ART & G_ART winning)” is always determined as the value of the lottery result. That is, at the time of “bonus completion”, “ART” is always won.

  FIG. 145 is a diagram illustrating a configuration of a special ART lottery table (part 2). The special ART lottery table (part 2) is referred to when the gaming state is “at the ceiling”. Further, “1” is assigned to the special ART lottery table (part 1) as the value of the sixth lottery table type. Here, “at the ceiling” means that a predetermined number of games have been consumed after the bonus is over.

  In the present embodiment, as shown in FIG. 145, when the gaming state is “at ceiling”, “6 (B_ART & D_ART & G_ART winning)” is always determined as the value of the lottery result. That is, when “at the ceiling”, the player always wins “ART”.

[Table number determination table for special ART]
Next, a table number determination table at the time of special ART will be described with reference to FIG. The table number determination table at the time of special ART is referred to when various “ARTs” are won in the “BONUS COMPLETION” and “Ceiling” ART lottery and the table number which is a part of the winning information is determined. .

  The table number determination table at the time of special ART is a table number set according to the value of the sixth lottery table type (“0” or “1”) and the presence / absence (set / not set) of “base ART”. Stipulate. In the present embodiment, as shown in FIG. 146, when the table number determination table at the time of the special ART is referred to, “base ART is not set” and the value of the sixth lottery table type is “0 (bonus complete run). "5)" is determined as the table number.

[ART stock non-consumption lottery table]
Next, various ART stock non-consumed lottery tables will be described with reference to FIGS. 147 and 148. Each ART stock non-consumable lottery table shows the correspondence between the lottery result value ("0" or "1") corresponding to "consumption" and "non-consumption" and the lottery value set according to the table number. Show.

  In the present embodiment, every time “D_ART” or “B_ART” stored in “ART stock area A” or “ART stock area B” is started, the ART stock non-consumption lottery is performed. In this ART stock non-consumption lottery, whether or not the winning information of “D_ART” or “B_ART” to be started is deleted (consumed) from “ART stock area A” or “ART stock area B” is determined. The lottery is performed with reference to the stock non-consumed lottery table.

  That is, in this embodiment, when “non-consumption” is won in the ART stock non-consumption lottery, “D_ART” or “B_ART” stored in “ART stock area A” or “ART stock area B” Don't delete winning information. As a result, two “ARTs” are started using the winning information of one “ART”.

  As described above, in this embodiment, every time “D_ART” or “B_ART” stored in “ART stock area A” or “ART stock area B” is started, an ART stock non-consumption lottery is performed. Therefore, when “NO CONSUMPTION” continues to be won in the ART stock non-consumption lottery, “ART” is started multiple times using the same “ART” winning information.

  In an ART stock non-consumable lottery that refers to an ART stock non-consumable lottery table, first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) is used as a lottery result. The lottery value specified for each value is sequentially subtracted. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 147 is a diagram showing a configuration of an ART stock non-consumable lottery table (part 1). The ART stock non-consumption lottery table (part 1) is referred to when the setting is “setting 1”.

  In the present embodiment, for example, when the ART stock non-consumption lottery table (part 1) is referred to, if the table number in the winning information of “ART” to be started is “0”, 256/32768. As a result of lottery, “1 (non-consumption)” is determined.

  FIG. 148 is a diagram showing a configuration of an ART stock non-consumable lottery table (part 2). The ART stock non-consumption lottery table (part 2) is referred to when the setting is “setting 6”.

  In this embodiment, for example, when the ART stock non-consumed lottery table (part 2) is referred to, if the table number in the winning information of “ART” to be started is “0”, 384/32768 As a result of lottery, “1 (non-consumption)” is determined.

[ART lottery result stock content determination table]
Next, an ART lottery result stock content determination table will be described with reference to FIG. The ART lottery result stock content determination table shows the correspondence between the lottery result values ("0" to "16") corresponding to the ART winning content and the stock contents of various "ART" and "VR".

  In this embodiment, as shown in FIG. 149, when “6” is determined as a lottery result value by any ART lottery, “B_ART” winning information, “D_ART” winning information, and , “G_ART” winning information is stored in a sub-storage area described later (see FIG. 223 described later).

[Bill touch correct / incorrect lottery table when VR is locked]
Next, with reference to FIG. 150, the VR lock billy touch correct / incorrect answer lottery table will be described. The billy touch correct / incorrect answer lottery table at the time of VR lock is referred to when the billy touch correct answer / incorrect answer lottery is performed at the time of VR lock.

  In the present embodiment, when the VR lock (game lock 9) is determined during various “ART”, “VR (Viking Rush)” is won (see FIGS. 99 to 101). When “VR” is won, a billy touch correct / incorrect answer lottery is performed to determine a correct / incorrect answer to the player's touch operation on the left character (billy) decoration 22L and the right character decoration 22R.

  Thereafter, VR lock (game lock 9) is executed, and information to that effect is notified to the player so that either the left character decoration portion 22L or the right character decoration portion 22R is selected and touched. That is, when VR is locked, an alternative effect is performed as in “VR (Viking Rush)”. If the character decoration touched by the player is correct, “VR” is started.

  The VR-locked billy touch correct / incorrect answer lottery table includes the lottery result values (“0” to “6”) corresponding to the correct / incorrect answer determination details of the touch on the left character decoration unit 22L and the right character decoration unit 22R. ) And a lottery value set according to the type of the sub gaming state.

  In the billy touch correct answer / incorrect answer lottery referring to the VR lock billy touch correct answer / incorrect answer lottery table, first, from a predetermined numerical range (0 to 32767 in this embodiment, random number denominator = 32768). The extracted random numbers are sequentially subtracted by lottery values defined for each lottery result value. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  In the lottery table of the billy touch correct / incorrect answer at the time of VR lock, the content corresponding to the value “0” of the lottery result is when the right character decoration portion 22R is touched, or the left character decoration portion 22L and the right character The case where there is no touch with respect to the decoration part 22R is made correct. The content corresponding to the value “1” of the lottery result is a case where the right character decoration portion 22R is touched correctly, and the case where there is no touch on the left character decoration portion 22L and the right character decoration portion 22R. Incorrect.

  The content corresponding to the value “2” of the lottery result is correct when there is a touch on the left character decoration unit 22L or when there is no touch on the left character decoration unit 22L and the right character decoration unit 22R. . The content corresponding to the value “3” of the lottery result is a case where the left character decoration portion 22L is touched correctly, and the case where there is no touch on the left character decoration portion 22L and right character decoration portion 22R. Incorrect.

  Furthermore, the content corresponding to the value “4” of the lottery result is a correct answer (both correct answers) regardless of which of the left character decoration part 22L and the right character decoration part 22R is touched, and the left character decoration part 22L and the right Even if there is no touch on the character decoration portion 22R, the answer is correct. Further, the content corresponding to the lottery result value “5” is an incorrect answer (both incorrect answers) even if either the left character decoration portion 22L or the right character decoration portion 22R is touched, and the left character decoration portion. Even if there is no touch on 22L and the right character decoration 22R, the answer is incorrect.

  In the present embodiment, as shown in FIG. 150, the lottery value set for the lottery result value “5” is “0” regardless of the type of the sub gaming state. “5” is not determined. That is, in the present embodiment, when the VR lock (game lock 9) is executed, a touch on at least one of the left character decoration portion 22L and the right character decoration portion 22R is correct.

  In the present embodiment, as shown in FIG. 150, the sub gaming state when the billy touch correct / incorrect answer lottery is performed is “general (RT2 at the end of ART)”, “B_ART”, or “D_ART”. In this case, any one of “0” to “3” is won as the lottery result value. Each of the lottery result values “0” to “3” has a winning probability of 8192/32768 (1/4).

  Therefore, when the VR lock (game lock 9) is executed in “general (RT2 at the end of ART)”, “B_ART”, or “D_ART”, the left character decoration unit 22L and the right character decoration unit 22R If either one is touched, the answer is correct with a probability of 1/2. In this case, even if neither the left character decoration portion 22L nor the right character decoration portion 22R is touched (even if it does not participate in the effect), the answer is correct with a probability of 1/2.

  On the other hand, when the sub gaming state when performing the billy touch correct / incorrect lottery is “G_ART”, “R_ART”, or “in VR”, “4” is always won as the value of the lottery result. That is, when the VR lock (game lock 9) is executed in “G_ART”, “R_ART”, or “in VR”, “VR (Viking Rush)” is always started.

[VR billy touch lottery table]
Next, various VR billy touch lottery tables will be described with reference to FIGS. 151 to 154. Each VR billy touch lottery table is referred to when the billy touch correct answer / wrong answer lottery is performed during “VR (Viking Rush)”. The VR billy touch lottery table includes a lottery result value (“0” to “6”) corresponding to the correct / incorrect touch determination contents of the left character decoration unit 22L and the right character decoration unit 22R, and a “lottery flag”. A correspondence relationship with the value of “A-3” or the lottery value set according to the type of bonus established.

  In the billy touch correct / incorrect lottery referring to the VR billy touch lottery table, first, a random value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) is used. Then, the lottery value specified for each lottery result value is sequentially subtracted. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 151 is a diagram illustrating a configuration of a VR billy touch lottery table (part 1). The VR billy touch lottery table (part 1) is referred to when the gaming state is “between non-flags”.

  When referring to the VR billy touch lottery table (part 1), as shown in FIG. 151, when the value of the lottery flag A-3 is “1” to “5”, the left character decoration unit 22L and the right If one of the character decoration portions 22R is touched, the answer is correct with a probability of 1/2. Further, in this case, the answer is correct with a probability of ½, even if neither the left character decoration portion 22L nor the right character decoration portion 22R is touched (even if it does not participate in the effect).

  FIG. 152 is a diagram illustrating a configuration of the VR billy touch lottery table (part 2). The VR billy touch lottery table (part 2) is referred to when the gaming state is “during Viking Rush Extra” and “between non-flags”.

  When referring to the VR billy touch lottery table (No. 2), as shown in FIG. 152, if the value of the lottery flag A-3 is “1” to “5”, the left character decoration unit 22L and the right Whether one of the character decoration portions 22R is touched or not touched, the answer is correct with a probability of 1/2.

  FIG. 153 is a diagram illustrating a configuration of the VR billy touch lottery table (part 3). The VR billy touch lottery table (part 3) is referred to when the gaming state is “when bonus is established”. FIG. 154 is a diagram showing a configuration of the VR billy touch lottery table (part 4). The VR billy touch lottery table (part 4) is referred to when the gaming state is “in Viking Rush Extra” and “when bonus is established”.

  When a bonus is established during “VR”, as shown in FIGS. 153 and 154, “4” is always won as the value of the lottery result in the billy touch lottery. That is, in this case, the answer is always correct regardless of whether one of the left character decoration portion 22L and the right character decoration portion 22R is touched or not.

[VR revolution lottery table]
Next, various VR revolution lottery tables will be described with reference to FIGS. 155 to 169. Each VR revolution lottery table is referred to when a revolution lottery in “VR (Viking Rush)” is performed. The revolution lottery is performed for each touch challenge (touch effect) in “VR”.

  Each VR revolution revolution lottery table corresponds to the value of the lottery result (“0” or “1”) corresponding to the presence or absence of “revolution activation”, the value of “lottery flag A-3” or the type of bonus established. The correspondence with the set lottery value is shown. In “Revolution lottery”, when “Revolution activation” is won, all the results of the previous touch challenge (touch production) are rewritten to the correct answer.

  In the revolution lottery that refers to the VR mid-revolution lottery table, first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) is determined for each lottery result value. Subtract sequentially with the specified lottery value. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 155 is a diagram illustrating a configuration of the VR mid-revolution lottery table (part 1). The VR revolution revolution lottery table (part 1) is referred to when the setting is “setting 1”, the gaming state is “between non-flags”, and the number of touch challenges is the first. FIG. 156 is a diagram showing the configuration of the VR mid-revolution lottery table (part 2). The VR revolution revolution lottery table (part 2) is referred to when the setting is “setting 1”, the gaming state is “between non-flags”, and the number of touch challenges is the second.

  If you win "Revolution Trigger", all the results of the previous touch challenge will be correct, so players want to win "Revolution Trigger" when they have as many "Touch Challenges" as possible. Therefore, in this embodiment, as shown in FIGS. 155 and 156, “revolution activation” is not won in the revolution lottery performed after “the first touch challenge count” and “the second touch challenge count”.

  FIG. 157 is a diagram showing a configuration of the VR mid-revolution lottery table (part 3). The VR revolution revolution lottery table (part 3) is referred to when the setting is “setting 1”, the gaming state is “between non-flags”, and the number of touch challenges is the third. FIG. 158 is a diagram showing the configuration of the VR mid-revolution lottery table (part 4). The VR revolution revolution lottery table (part 4) is referred to when the setting is “setting 1”, the gaming state is “between non-flags”, and the number of touch challenges is the fourth. FIG. 159 is a diagram showing the configuration of the VR mid-revolution lottery table (No. 5). The VR revolution revolution lottery table (No. 5) is referred to when the setting is “setting 1”, the gaming state is “between non-flags”, and the number of touch challenges is the fifth.

  160 to 164 are diagrams showing the configurations of the VR revolution revolution lottery table (No. 6) to the VR revolution revolution lottery table (No. 10), respectively. The VR revolution revolution lottery table (No. 6) to the VR revolution revolution lottery table (No. 10) has a setting of “setting 6”, a gaming state of “between non-flags”, and a first touch challenge count. It is referred to when it is the fifth time.

  FIG. 165 is a diagram showing the configuration of the VR mid-revolution lottery table (No. 11). The VR revolution revolution lottery table (11) is referred to when the setting is “all settings”, the gaming state is “when bonus is established”, and the number of touch challenges is the first. FIG. 166 is a diagram showing the configuration of the VR mid-revolution lottery table (No. 12). The VR revolution lottery table (No. 12) is referred to when the setting is “all settings”, the gaming state is “when bonus is established”, and the number of touch challenges is the second.

  FIG. 167 is a diagram showing the configuration of the VR mid-revolution lottery table (No. 13). The VR revolution revolution lottery table (No. 13) is referred to when the setting is “all settings”, the gaming state is “when bonus is established”, and the number of touch challenges is the third. FIG. 168 is a diagram showing the configuration of the VR mid-revolution lottery table (No. 14). The VR revolution revolution lottery table (No. 14) is referred to when the setting is “all settings”, the gaming state is “when bonus is established”, and the number of touch challenges is the fourth. FIG. 169 is a diagram showing the configuration of the VR mid-revolution lottery table (No. 15). The VR revolution revolution lottery table (No. 15) is referred to when the setting is “all settings”, the gaming state is “when bonus is established”, and the number of touch challenges is the fifth.

[ART precursor game number lottery table]
Next, various ART precursor game number lottery tables will be described with reference to FIGS. 170 to 172.

  Each ART precursor game number lottery table is referred to when determining the “art precursor game number” during non-ART or non-bonus. Each ART precursor game number lottery table indicates a correspondence relationship between the number of precursor games and the lottery value set according to the value of the stock ART type. Here, the “stock ART type” is the type of “ART” to be started next in the “ART” winning information stored in the sub storage area.

  In this embodiment, “D_ART” or “B_ART” is often determined by “first hit of ART”. In this case, the lottery value defined in the “D_ART” column and the “B_ART” column in the “stock ART type” is referred to.

  Note that the lottery value defined in the “G_ART & R_ART” column in the “stock ART type” is “D_ART” or / and “B_ART” and “G_ART” or / and “R_ART” depending on “first hit of ART”. Referenced when winning simultaneously. At this time, after the unit game of the number of ART precursor games is exhausted, the game of “G_ART” or “R_ART” is started at the start of ART (start game or first game after start).

  In the ART omen game number lottery table referring to the ART omen game number lottery table, first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) is used as a lottery result. The lottery value specified for each value is sequentially subtracted. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 170 is a diagram showing a configuration of an ART precursor game number random determination table (No. 1). The ART precursor game number lottery table (part 1) is referred to when the sub game state is the “general state”.

  FIG. 171 is a diagram illustrating a configuration of the ART precursor game number random determination table (part 2). The ART precursor game number lottery table (part 2) is referred to when the sub gaming state is “CZ (chance zone)”.

  FIG. 172 is a diagram showing a configuration of an ART precursor game number random determination table (No. 3). The ART precursor game number lottery table (part 3) is referred to when the sub gaming state is “general state” or “CZ (chance zone)” and the gaming state is “when bonus ends”.

[ART lottery game number lottery table]
Next, with reference to FIGS. 173 to 175, various ART early warning game number lottery tables will be described. Each ART predictor game number lottery table is referred to when determining the “union predictor game number” or “VR predictor game number” during ART. Each ART pre-sign game number lottery table indicates the correspondence between the “pre-game number” and lottery values set in accordance with the transition to various sub game states.

  In the sign game number lottery referring to the ART sign game number lottery table, first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) is used as a lottery result. The lottery value specified for each value is sequentially subtracted. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 173 is a diagram illustrating a configuration of the ART early warning game number random determination table (part 1). The pre-art game number lottery table (part 1) indicates that the game state is “when the ART start G number is determined”, “art game remaining 11G or more (before lever operation)” or “G_ART, during R_ART” Referenced.

  FIG. 174 is a diagram showing a configuration of the ART early warning game number random determination table (No. 2). The ART sign game number lottery table (part 2) is referred to when the game state is "art remaining game number 7G or more and 10G or less (before lever operation)" and "other than G_ART or R_ART". The

  FIG. 175 is a diagram showing a configuration of the ART early warning game number random determination table (No. 3). The pre-articulation game number lottery table (No. 3) is referred to when the gaming state is “art remaining game number 6G or less (before lever operation)” and “other than G_ART or R_ART”.

[Title lottery table for development performance 1]
Next, the development effect 1 title lottery table will be described with reference to FIG. The title lottery table for the development effect 1 is referred to when the title of the “development effect 1” is determined.

  In the “development effect 1” of the present embodiment, a game that displays the title of the “development effect 1” on the liquid crystal display device 11 (hereinafter referred to as “title display game”), and at least one game thereafter, a maximum of 6 And a game of effects played continuously over a number of games. In the present embodiment, the number of games continued after the “title display game” is referred to as the “number of continued games”.

  In other words, the case where “Development effect 1” is the shortest is the case where “Number of continuing games” is “1”. In this case, one game of “Title display game” and “Number of continuing games” are “Development effect 1” is executed over the two games.

  The development effect 1 title lottery table indicates the correspondence between the “title No.” values (“1” to “6”) corresponding to the types of titles and the lottery values set in accordance with various game states. . Note that (normal), (gorgeous), and (gorgeous fireworks) in the title column of the title drawing for development effect 1 change the display mode (color or pattern) of the title “Bocco” or “Gorme”. Show.

  In the title lottery referring to the development effect 1 title lottery table, first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) is used as the lottery result value. It subtracts sequentially with the lottery value specified every time. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  For example, “F” in the gaming state “CZ Precursor_F_4G” described in the title lottery table for development effect 1 means fake. Therefore, for example, when the game state is “CZ precursor_F_4G”, the “chance zone (CZ)” is not started after the end, and the number of CZ precursor games is “4”. Represents. Further, for example, when the gaming state is “CZ precursor 4G or more”, it is a “CZ precursor game” in which “chance zone (CZ)” is started after the end, and the number of CZ precursor games is “4” or more. Represents the case.

  In the present embodiment, as shown in FIG. 176, if the game state when performing the title lottery referring to the development effect 1 title lottery table is, for example, “CZ precursor_F_4G”, “title No.” “1 (Bocco (Normal))” is determined with a probability of 28963/32768. For example, if the gaming state is “CZ precursor 4G or more”, “1 (Bocco (Normal))” is determined as the “Title No.” with a probability of 27939/32768.

[Production number determination table for development effect 1]
Next, various development effect 1 effect number determination tables will be described with reference to FIGS. 177 and 178. The development effect 1 effect number determination table is referred to when the “development effect 1 effect number” is determined based on the “scenario No.” determined by lottery. The production number determination table for the development effect 1 is based on the value of “scenario No.” (“1” to “93”) corresponding to the scenario content and the number of continuous games (“1” to “6”). The “production number for development effect 1” is defined.

  FIG. 177 is a diagram showing a configuration of the effect number determination table for development effect 1 (part 1). The effect number determination table for development effect 1 (part 1) is referred to when the title for development effect 1 is “Bocco”, and “development effect 1” corresponding to “1” to “44” of “scenario No.”. "Direction number".

  FIG. 178 is a diagram showing the structure of the effect number determination table for development effect 1 (part 2). The development number 1 production number determination table (part 2) is referred to when the development production 1 title is “Bocco” and corresponds to “scenario No.” “45” to “93” “development production 1”. "Direction number".

[Direction determination table for development effect 1]
Next, with reference to FIG. 179, an effect determination table for development effect 1 will be described. The development determination table for development effect 1 defines a correspondence relationship between “production number for development effect 1”, “production name”, and “production content”. That is, when the “production number for development effect 1” is determined, data relating to “production name” and “production content” are uniquely obtained.

  For example, when “9” is determined as the “production number for development effect 1”, “Bocco-Weak-Win” is determined as “Production name”, and “Lever ON: Confrontation-Bocco” as “Production content”. “1on: Weak avoidance-Bocco, 3on: Stop Bocco, 3off: Win-Bocco, Next BET: Go to WIN screen” is determined.

  In the production corresponding to “Lever ON: Confrontation-Bocco”, an image of the main character “Don-chan” confronting the first character “Bocco” on the liquid crystal display device 11 when the start lever 16 is operated. Is displayed. In the production corresponding to “1on: weak avoidance-Bocco”, an image avoiding the weak attack of “Bocco” by “Don-chan” is displayed on the liquid crystal display device 11 when the stop button is pressed in the first stop operation. .

  In an effect corresponding to “3on: Todome Bocco”, an image in which “Don-chan” performs a lasting attack on “Bocco” is displayed on the liquid crystal display device 11 when the stop button is pressed in the third stop operation. In the production corresponding to “3off: Win-Bocco”, an image of “Don-chan” winning the battle with “Bocco” is displayed on the liquid crystal display device 11 when the press on the stop button in the third stop operation ends. . Then, in the effect corresponding to “next BET: WIN screen”, a video notifying the victory of “Don-chan” is displayed on the liquid crystal display device 11 when the MAX bet button 14 or the 1BET button 15 is pressed.

[Scenario rewriting lottery table]
Next, various scenario rewriting lottery tables will be described with reference to FIGS. 180 to 195. Each scenario rewriting lottery table defines the correspondence between the value of “scenario No.” and the lottery value set according to the value of “rewriting destination”.

  In the present embodiment, in “Development effect 1”, first, “Title” and “Scenario No.” are determined. When the start lever 16 is operated to start the game in which the “enhancement effect 1” is executed, a scenario rewriting lottery is performed in which the determined “scenario No.” is rewritten according to the sub game state and the like.

  In the scenario rewriting lottery with reference to the scenario rewriting lottery table, first, a random number value extracted from a predetermined numerical range (0 to 32767, random number denominator = 32768 in this embodiment) is calculated for each lottery result value. Subtract sequentially with the specified lottery value. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 180 is a diagram showing a configuration of the scenario rewriting lottery table (part 1). The scenario rewriting lottery table (part 1) is referred to when the continuous game of “Development effect 1” is “1G (game)”, the sub game state is “general state”, and “others”. The Here, the “other” case is a case where none of the various scenario rewriting lottery tables described later is selected.

  In the present embodiment, when the continuous game of “Development effect 1” is “1G”, the sub game state is “General state”, and “Other”, as shown in FIG. Since the lottery value of “rewrite destination” is “0” regardless of the value of “scenario No.”, rewriting of “scenario No.” is not performed. That is, in this case, “Development Effect 1” is executed in accordance with “Scenario No.” determined before the start lever 16 is operated.

  FIG. 181 is a diagram illustrating a configuration of the scenario rewriting lottery table (part 2). The scenario rewriting lottery table (part 2) is referred to when the continuous game of “Development effect 1” is “1G”, the sub game state is “General state”, and “CZ precursor 4G”. . Here, the case of “CZ precursor 4G” is a case where the value of the CZ precursor counter is “4”. That is, when the remaining four games (not including the current game) are digested, the “CZ (chance zone)” is started.

  In this embodiment, when the continuation game is “1G” and “CZ precursor 4G”, “scenario No.” may be rewritten as shown in FIG. More specifically, when “Scenario No.” is “Scenario No. (“ 72 ”to“ 75 ”)” in which “Bocco” with the value “6” of “Continuation Game” is defeated (continuous hit revival-failure) These “Scenario Nos. (“ 72 ”to“ 75 ”)” always lose “Bocco” with the value “5” of “Continued game number” (Resurrection-Failure), “Scenario No. (“ 68 ” To “71”) ”.

  Therefore, when the continuous game is “1G” and “CZ Precursor 4G” and “72” to “75” are determined as “Scenario No.”, “Scenario No.” 68 ”to“ 71 ”. In this case, the “development effect 1” ends in the “5G” continuation game. In addition, the “5G” continuation game results in “CZ precursor 0G”. That is, it is possible to match the end of “Development effect 1” with the end of “CZ precursor game”.

  If “scenario No. (“ 72 ”to“ 75 ”)” is not rewritten, “development effect 1” ends in the next game after the CZ precursor game ends. For this reason, it is impossible to notify that the “CZ (chance zone)” starts at an appropriate timing.

  FIG. 182 is a diagram showing a configuration of the scenario rewriting lottery table (part 3). The scenario rewriting lottery table (No. 3) is referred to when the continuous game of “Development effect 1” is “1G”, the sub game state is “General state”, and “CZ precursor 3G”. . FIG. 183 is a diagram illustrating a configuration of the scenario rewriting lottery table (part 4). The scenario rewriting lottery table (part 4) is referred to when the continuous game of “Development effect 1” is “1G”, the sub game state is “General state”, and “CZ precursor 2G”. .

  FIG. 184 is a diagram showing the configuration of the scenario rewriting lottery table (No. 5). The scenario rewriting lottery table (No. 5) is referred to when the continuous game of “Development effect 1” is “1G”, the sub game state is “General state”, and “CZ precursor 1G”. . FIG. 185 is a diagram showing a configuration of the scenario rewriting lottery table (No. 6). The scenario rewriting lottery table (No. 6) is referred to when the continuous game of “Development effect 1” is “1G”, the sub game state is “General state”, and “CZ precursor 0G”. .

  FIG. 186 is a diagram illustrating a configuration of the scenario rewriting lottery table (part 7). The scenario rewriting lottery table (No. 7) is referred to when the continuous game of “Development effect 1” is “1G” and “D, B, G, R_ART precursor 6G”. Here, the case of “D, B, G, R_ART precursor 6G” is a case where the value of the ART precursor counter is “6”. That is, when the remaining 6 games (not including the current game) are digested, various “ARTs” are started.

  In the present embodiment, when the continuous game of “Development effect 1” is “1G” and “D, B, G, R_ART precursor 6G”, as shown in FIG. 186, “Scenario No. Since the lottery value of “rewrite destination” is “0” regardless of the value of “”, the “scenario No.” is not rewritten. That is, in this case, “Development Effect 1” is executed in accordance with “Scenario No.” determined before the start lever 16 is operated.

  FIG. 187 is a diagram showing the configuration of the scenario rewriting lottery table (No. 8). The scenario rewriting lottery table (No. 8) is referred to when the continuous game of “Development effect 1” is “1G” and “D, B, G, R_ART precursor 5G”.

  In this embodiment, when the continuation game is “1G” and “D, B, G, R_ART precursor 5G”, “scenario No.” may be rewritten as shown in FIG. 187. . For example, when “Scenario No.” is “Scenario No. (“ 1 ”to“ 18 ”)” in which “Bocco” of “1” to “5” values of “Number of continuing games” is lost, these “scenarios” “No. (“ 1 ”to“ 18 ”)” is always rewritten to “Scenario No. (“ 51 ”to“ 54 ”)” in which “Bocco” with the value “6” of “Number of continuing games” is restored. .

  Therefore, in this case, even if “1” to “18” are determined as “scenario No.”, “scenario No.” is rewritten to any of “51” to “54”. The “development effect 1” ends in the “6G” continuation game. In addition, the “6G” continuation game results in “ART precursor 0G”. In other words, in this case, the end of “Development effect 1” and the end of “ART precursor game” can be matched.

  Also, in this case, “development production 1” in which “Bocco Loss (continuous strike revival-failure)” is displayed in the last continuous game, and “Bocco win (Bocco-revival)” is displayed in the last continuation game. The displayed “Development effect 1” is changed. As a result, “ART” is started from the next game after the end of “Development effect 1” in which “Bocco wins (Bocco-Resurrection)” is displayed, and the start of “ART” is uncomfortable. You can avoid it.

  FIG. 188 is a diagram showing the configuration of the scenario rewriting lottery table (No. 9). The scenario rewriting lottery table (No. 9) is referred to when the continuous game of “Development effect 1” is “1G” and “D, B, G, R_ART precursor 4G”. FIG. 189 is a diagram showing the configuration of the scenario rewriting lottery table (No. 10). The scenario rewriting lottery table (No. 10) is referred to when the continuous game of “Development effect 1” is “1G” and “D, B, G, R_ART precursor 3G”.

  FIG. 190 is a diagram showing the configuration of the scenario rewriting lottery table (No. 11). The scenario rewriting lottery table (No. 11) is referred to when the continuous game of “Development effect 1” is “1G” and “D, B, G, R_ART precursor 2G”. FIG. 191 is a diagram showing the configuration of the scenario rewriting lottery table (No. 12). The scenario rewriting lottery table (No. 12) is referred to when the continuous game of “Development effect 1” is “1G” and “D, B, G, R_ART precursor 1G”.

  FIG. 192 is a diagram showing the structure of the scenario rewriting lottery table (No. 13). The scenario rewriting lottery table (No. 13) is referred to when the continuous game of “Development effect 1” is “1G” and “D, B, G, R_ART precursor 0G”.

  FIG. 193 is a diagram showing a configuration of the scenario rewriting lottery table (No. 14). The scenario rewriting lottery table (No. 14) is referred to when the continuous game of “Development effect 1” is “1G” and “Main a (reel action, rare role)”. Here, in the case of “main a (reel action, rare role)”, a reel action (production using reels 3L, 3C, 3R) and a rare role (small role with a low winning probability) are determined as internal winning roles. This is the case.

  FIG. 194 is a diagram showing the configuration of the scenario rewriting lottery table (No. 15). The scenario rewriting lottery table (No. 15) is referred to when the continuous game of “Development effect 1” is “1G” and the gaming state is “between RB flags”. FIG. 195 shows the structure of the scenario rewriting lottery table (No. 16). The scenario rewriting lottery table (No. 16) is referred to when the continuous game of “Development effect 1” is “1G” and the gaming state is “between BB flags”.

  Although not shown here, in the present embodiment, the continuous game of “Development effect 1” is “2G”, “3G”, “4G”, “5G”, and “6G”. A scenario rewriting lottery table to be referred to is also provided separately.

[Title lottery table for development production 2]
Next, the development effect 2 title lottery table will be described with reference to FIG. The development effect 2 title lottery table is referred to when determining the “title” of “development effect 2”.

  The “development effect 2” of the present embodiment includes a game that displays the “title” of the “development effect 2” on the liquid crystal display device 11 (“title display game”), and at least one game thereafter, and a maximum of seven games. It is comprised with the game of the effect performed continuously over this game. In the present embodiment, the number of games continued after the “title display game” is referred to as the “number of continued games”.

  The development effect 2 title lottery table indicates the correspondence between the “title No.” values (“1” to “9”) corresponding to the types of titles and the lottery values set in accordance with various game states. . Note that (Normal), (Gorgeous) and (Gorgeous fireworks) listed in the title column of the title lottery table for development effect 2 are the display modes (colors) of the titles “Gorum”, “Bocco” or “Norn”. Or pattern).

  In the title lottery referring to the development effect 2 title lottery table, first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) is used as the lottery result value. It subtracts sequentially with the lottery value specified every time. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  In the present embodiment, as shown in FIG. 196, if the game state when performing the title lottery with reference to the development effect 2 title lottery table is “CZ precursor_F_4G”, for example, “Title No. "1 (Golm (Normal))" is determined with a probability of 23229/32768. Also, for example, if the gaming state is “CZ precursor 4G or more”, “1 (Golm (Normal))” is determined as “Title No.” with a probability of 22205/32768.

[Development production 2 map lottery table]
Next, the development lottery 2 map lottery table will be described with reference to FIGS. 197 and 198. The development effect 2 map lottery table is referred to when “map No.” related to “development effect 2” is determined. The development lottery 2 map lottery table includes “map No.” values (“1” to “60”) corresponding to “map contents” and lottery values set in accordance with various precursor states. The correspondence is shown.

  In the map lottery referring to the development effect 2 map lottery table, first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in the present embodiment) is used as a lottery result value. It subtracts sequentially with the lottery value specified every time. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 197 is a diagram showing the structure of the development effect 2 map lottery table (part 1). FIG. 198 is a diagram showing the structure of a map lottery table for development effect 2 (part 2). The development effect 2 map lottery table (part 1) and the development effect 2 map lottery table (part 2) are referred to when the “title” of “development effect 2” is “golm (normal)”.

  For example, when the map lottery state with reference to the development effect 2 map lottery table is “CZ precursor_F_4G”, “3 (weak 3G (3G in total))” as “map No.” Is determined with a probability of 9993/32768 (see FIG. 197). For example, when the map lottery state is “CZ precursor 4G or higher”, “3 (weak 3G (3G in total))” is determined with a probability of 9737/32768 as “map No.” (See FIG. 197).

[Production lottery table number determination table]
Next, the effect lottery table number determination table will be described with reference to FIG. The effect lottery table number determination table is referred to when determining the “effect lottery table number” based on the “map No.” determined by lottery. The effect lottery table number determination table is set according to the “map No.” value (“1” to “60”) corresponding to the map contents and the number of continuing games (“1” to “7”). “Direction lottery table number” is defined.

  Note that the effect lottery table number determination table shown in FIG. 199 is referred to when “Title” of “Development Effect 2” is “Gorme”. In this case, as shown in FIG. 199, for example, when “Map No.” is “1” and the number of continuing games is “1”, “1” is set as the “effect lottery table number”. It is determined. Further, for example, when “Map No.” is “7” and the number of continuing games is “3”, “2” is determined as “Production lottery table number”.

[Direction lottery table]
Next, various effect lottery tables will be described with reference to FIGS. Each effect lottery table is referred to when performing an effect lottery for determining an effect number for development effect 2. Each effect lottery table indicates a correspondence relationship between the value of “effect number for development effect 2” corresponding to the effect contents and the lottery values set in accordance with various sign states.

  In the effect lottery referring to the effect lottery table, first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) is defined for each lottery result value. Subtract sequentially by lottery value. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 200 is a diagram showing a configuration of the table number 1 effect lottery table (part 1). FIG. 201 is a diagram showing the configuration of the table number 1 effect lottery table (No. 2). When these table number 1 effect lottery tables are referred to, for example, when the state of various precursors is “CZ precursor 4G” (see FIG. 200), “development effect 2 effect number” is “ 13 (VS Gorm-Gorm Small Attack-Loss) is won with a probability of 4096/32768.

  FIG. 202 is a diagram showing a configuration of the table number 2 effect lottery table (part 1). FIG. 203 is a diagram showing the structure of the effect lottery table for table number 2 (part 2). When these table number 2 effect lottery tables are referred to, for example, when the state of various precursors is “CZ precursor 4G” (see FIG. 202), the “development effect 2 effect number” is “ 148 (Viking Battle> VS Golm-Gorm Small Attack-Lose-2G) "is won with a probability of 4096/32768.

  FIG. 204 is a diagram showing the structure of the effect number lottery table for table number 24 (part 1). FIG. 205 is a diagram showing the configuration of the effect lottery table for table number 24 (No. 2). When referring to the effect lottery table for table number 24, for example, when the state of various precursors is “CZ precursor 4G” (see FIG. 204), “effect number for development effect 2” is “ "54 (Viking Battle> Resurrection of consecutive hits-Failure)" will definitely win.

[Map rewriting lottery table]
Next, various map rewriting lottery tables will be described with reference to FIGS. 206 to 221. Each map rewriting lottery table defines the correspondence between “map No.” and lottery values set according to “rewriting destination”.

  In the present embodiment, in “Development effect 2”, first, “Title” and “Map No.” are determined. Then, in order to start the game in “Development effect 2”, a map rewriting lottery is performed in which when the start lever 16 is operated, the determined “Map No.” is rewritten in accordance with various signs and the like.

  In the map rewriting lottery that refers to the map rewriting lottery table, first, a random number value extracted from a predetermined numerical range (0 to 32767 and random number denominator = 32768 in this embodiment) is calculated for each lottery result value. Subtract sequentially with the specified lottery value. Next, it is determined whether or not the result of subtraction has become negative (whether or not a so-called “digit” has occurred). When the subtraction result becomes negative (“digit” occurs), the lottery result at that time is won.

  FIG. 206 shows the structure of the map rewriting lottery table (No. 1). The map rewriting lottery table (No. 1) is referred to when the continuous game of “Development effect 2” is “1G (game) eyes”, the sub game state is “general state”, and “others”. The Here, the case of “others” is a case where none of various map rewriting lottery tables to be described later is selected.

  When the continuous game of “Development effect 2” is “1G”, the sub game state is “General state”, and “Other”, as shown in FIG. 206, “Map No.” Since the lottery value of “rewrite destination” is “0” regardless of the value of “Map No.”, the “Map No.” is not rewritten. That is, in this case, “Development Effect 2” is executed in accordance with “Map No.” determined before the start lever 16 is operated.

  FIG. 207 is a diagram showing the structure of the map rewriting lottery table (No. 2). The map rewriting lottery table (part 2) is referred to when the continuous game of “Development effect 2” is “1G”, the sub game state is “General state”, and “CZ precursor 4G”. . Here, the case of “CZ precursor 4G” is a case where the value of the CZ precursor counter is “4”. That is, when the remaining four games (not including the current game) are digested, the “CZ (chance zone)” is started.

  In the present embodiment, as shown in FIG. 207, when the continuation game is “1G” and “CZ precursor 4G”, “map No.” may be rewritten. Specifically, the “Map No.” is “Map No. (12, 18, 21, 24, 54, 56, 57, 59, 60)” with the value “6” or “7” of the “number of continuing games”. "Map No." is rewritten to "Map No. (11, 17, 20, 23, 53, 55, 58)" of the value "5" of the "number of continuing games".

  Therefore, when the continuation game is “1G” and “CZ Precursor 4G”, “12”, “18”, “21”, “24”, “54”, “Map No.” When “56”, “57”, “59”, and “60” are determined, “Map No.” is “11”, “17”, “20”, “23”, “53”, It is rewritten as “55”, “55”, “58”, “58”. In this case, the “development effect 2” ends with the “5G” continuation game. In addition, the “5G” continuation game results in “CZ precursor 0G”. That is, the end of “Development effect 2” and the end of “CZ precursor game” can be matched.

  When “12”, “18”, “21”, “24”, “54”, “56”, “57”, “59”, “60” has been determined as “Map No.” If “Map No.” is not rewritten, “Development Effect 2” ends at the next game after the CZ precursor game ends. For this reason, it is impossible to notify that the “CZ (chance zone)” starts at an appropriate timing.

  FIG. 208 shows the structure of the map rewriting lottery table (No. 3). The map rewriting lottery table (No. 3) is referred to when the continuous game of “Development effect 2” is “1G”, the sub game state is “General state”, and “CZ precursor 3G”. . FIG. 209 is a diagram showing the structure of the map rewriting lottery table (No. 4). The map rewriting lottery table (No. 4) is referred to when the continuous game of “Development effect 2” is “1G”, the sub game state is “General state”, and “CZ precursor 2G”. .

  FIG. 210 is a diagram showing the configuration of the map rewriting lottery table (No. 5). The map rewriting lottery table (No. 5) is referred to when the continuous game of “Development effect 2” is “1G”, the sub game state is “General state”, and “CZ precursor 1G”. . FIG. 211 is a diagram showing the configuration of the map rewriting lottery table (No. 6). The map rewriting lottery table (No. 6) is referred to when the continuous game of “Development effect 2” is “1G”, the sub game state is “General state”, and “CZ precursor 0G”. .

  FIG. 212 shows the structure of the map rewriting lottery table (No. 7). The map rewriting lottery table (No. 7) is referred to when the continuous game of “Development effect 2” is “1G” and “D, B, G, R_ART precursor 6G”. Here, “D, B, G, R_ART precursor 6G” means that the value of the ART precursor counter is “6”. That is, when the remaining 6 games (not including the current game) are digested, various “ARTs” are started.

  In the present embodiment, as shown in FIG. 212, when the continuous game of “Development effect 2” is “1G” and “D, B, G, R_ART precursor 6G”, “Map No. May be rewritten. For example, when “Map No.” is “1” to “24”, “49” to “60”, these “Map No.” are rewritten to “48”.

  Therefore, when the continuous game of “Development effect 2” is “1G” and “D, B, G, R_ART precursor 6G”, “Map No.” is “1” to “24”, “ When “49” to “60” are determined, these “Map No.” are rewritten to “48”, and the number of continuing games becomes “7”. As a result, the “development effect 2” is completed in the “7G” continuation game, and the state becomes “ART precursor 0G”. That is, it is possible to match the end of “Development effect 2” with the end of “ART precursor game”.

  FIG. 213 shows the structure of the map rewriting lottery table (No. 8). The map rewriting lottery table (No. 8) is referred to when the continuous game of “Development effect 2” is “1G” and “D, B, G, R_ART precursor 5G”. FIG. 214 shows the structure of the map rewriting lottery table (No. 9). The map rewriting lottery table (No. 9) is referred to when the continuous game of “Development effect 2” is “1G” and “D, B, G, R_ART precursor 4G”.

  FIG. 215 is a diagram showing the structure of the map rewriting lottery table (No. 10). The map rewriting lottery table (No. 10) is referred to when the continuous game of “Development effect 2” is “1G” and “D, B, G, R_ART precursor 3G”. FIG. 216 is a diagram showing the structure of the map rewriting lottery table (No. 11). The map rewriting lottery table (part 11) is referred to when the continuous game of “Development effect 2” is “1G” and “D, B, G, R_ART precursor 2G”.

  FIG. 217 is a diagram showing the structure of the map rewriting lottery table (No. 12). The map rewriting lottery table (No. 12) is referred to when the continuous game of “Development effect 2” is “1G” and “D, B, G, R_ART precursor 1G”. FIG. 218 is a diagram showing the structure of the map rewriting lottery table (No. 13). The map rewriting lottery table (No. 13) is referred to when the continuous game of “Development effect 2” is “1G” and “D, B, G, R_ART precursor 0G”.

  FIG. 219 shows the structure of the map rewriting lottery table (No. 14). The map rewriting lottery table (No. 14) is referred to when the continuous game of “Development effect 2” is “1G” and “Main a (reel action, rare role)”. Here, in the case of “main a (reel action, rare role)”, a reel action (production using reels 3L, 3C, 3R) and a rare role (small role with a low winning probability) are determined as internal winning roles. This is the case.

  FIG. 220 shows the structure of the map rewriting lottery table (No. 15). The map rewriting lottery table (No. 15) is referred to when the continuous game of “Development effect 2” is “1G” and the gaming state is “between RB flags”. FIG. 221 shows the structure of the map rewriting lottery table (No. 16). The map rewriting lottery table (No. 16) is referred to when the continuous game of “Development effect 2” is “1G” and the game state is “between BB flags”.

  Although not shown here, in this embodiment, the continuous game of “Development effect 2” is “2G”, “3G”, “4G”, “5G”, “6G” and “7G” The map rewriting lottery table to be referred to in the case of

[Direction rewriting condition table]
Next, the effect rewriting condition table will be described with reference to FIG. The effect rewriting condition table includes “end effect number for development effect 1” and “effect number for development effect 2” and the end of the development effect set according to the value of the lottery flag K (“0” to “4”). Stipulated in the correspondence relationship.

  The “○” mark in the effect rewriting condition table indicates “development effect 1” in which the corresponding “development effect 1 effect number” is determined or “development effect 2” in which “development effect 2 effect number” is determined. Indicates end.

  The productions corresponding to “18” of “production number for development effect 1” and “54”, “55”, and “25” of “production number for development production 2” are the main characters of pachislot 1 of the present embodiment. “Don-chan” will be revived. In the game before “Don-chan” is revived, the result of the battle (win / loss) is once derived (displayed on the liquid crystal display device 11).

  In other words, in the game before “Don-chan” revives, it appears that the battle (development effect) will end, so the development effect is contrary to the originally determined “scenario No.” or “map No.” effect. End. At this time, the player may determine whether the development was originally without the revival of “Don-chan” or the development that had been scheduled to revive “Don-chan” but was forcibly terminated. Because it is not possible, even if such a performance is performed, the player does not feel discomfort.

  In the production corresponding to “54” of “production effect 2 for development effect 2”, “Don-chan” is revived, but a display notifying the loss (failure) is performed. In other words, the effect corresponding to “54” of “Development effect 2 effect number” is merely an effect that is additionally performed to give the player a sense of expectation, and is not necessarily required.

  Therefore, in this embodiment, when it is a time when there is no problem even if the development effect (continuous effect) is forcibly terminated, for example, when a rare role with a high expectation level where “ART” or “bonus” is won is won. , Cancel the development production (continuous production) that was scheduled to be executed. Then, the effect when the development effect is not performed is determined by lottery and executed.

  In addition, when it is a time when there is no problem even if the development effect (continuous effect) is forcibly terminated, it is scheduled to be executed if a reel action or freeze (game lock) or the like that does not match the execution time in the normal effect occurs. Canceled the development direction (continuous production). Then, the effect when the development effect is not performed is determined by lottery and executed.

  In addition, in the production corresponding to “18” of the “production number for development effect 1” and “55” and “25” of the “production number for development production 2”, “Don-chan” is revived and won (success). Is displayed. The display for notifying the winner (success) is an announcement of “ART” winning (may be a bonus winning).

  Therefore, if the development effect (continuous effect) is forcibly terminated, the winning of “ART” will not be announced, so the procedure of starting “ART” after the winning notification of “ART” It becomes impossible to carry out. As a result, there is a possibility that the gameability may be unclear, or that the effect of expectation will not be meaningful.

  Therefore, in the production corresponding to “18” of “production number for development effect 1” and “55” and “25” of “production number for development production 2” “54” of “production number for development production 2” Unlike the production corresponding to, it is not preferable to forcibly end the production. However, when a freeze (game lock) occurs, the winning of “ART” is confirmed, and the freezing itself corresponds to the winning notification of “ART”.

  Therefore, in the present embodiment, when a freeze occurs in the production corresponding to “18” of “production number for development effect 1” and “55” and “25” of “production number for development production 2” (that is, The development effect (continuous effect) is forcibly ended only when “ART” is won and the player can recognize that. Then, an effect based on “freeze” is determined by lottery and executed.

<Configuration of storage area provided in sub-RAM>
[Sub storage area]
Next, the configuration of a sub storage area provided in the sub RAM 83 will be described with reference to FIG. Although not described here (not shown), the sub-RAM 83 stores the above-described various effect contents and effect numbers, and the internal area transmitted from the main control circuit 41 (see FIG. 4). A storage area for storing various data such as a winning combination is also provided.

  The sub storage area includes “ART stock area A”, “ART stock area B”, “G_ART stock area”, and “rocket flag storage area”. “ART stock area A” indicates a specific example of the notification storage area according to the present invention, and “ART stock area B” indicates a specific example of the non-notification storage area according to the present invention.

In “ART stock area A”, winning information of “D_ART” or “B_ART” scheduled to be displayed (notified) is stored. In this “ART stock area A”, 256 pieces of winning information can be stored. In addition, in “ART stock area B”, winning information of “D_ART” or “B_ART” scheduled to hide (not notify) the winning is stored. In this “ART stock area B”, 256 pieces of winning information can be stored.

  “ART” winning information stored in “ART stock area A” or “ART stock area B” includes identification information of “ART” (“0” to “2”) and identification of the table number of the stock opportunity Data (“0” to “9”) is included. When the winning “ART” is “B_ART”, the identification data of “ART” is “1”, and when the winning “ART” is “D_ART”, the identification data of “ART” is It becomes “2”. The table number of the stock opportunity is determined with reference to the above-described various table number determination tables (see FIGS. 96, 102, 127, 136, 143, and 146).

  In the present embodiment, execution is performed preferentially from “ART” corresponding to the “ART” winning information stored in “ART stock area A”. When all the “ART” corresponding to the “ART” winning information stored in the “ART stock area A” is executed, the “ART” winning information stored in the “ART stock area B” is handled. It is executed in the order in which “ART” is stored.

  That is, in the present embodiment, “ART” informed of winning is preferentially executed, and thereafter “ART” not informed of winning is executed. As a result, it is possible to make it impossible to easily guess the timing and trigger when the winning of “ART” for which the winning is not notified is determined. Further, in this case, after all of the “ART” that is notified of winning is executed, the player expects whether or not “ART” will be executed each time “ART” ends. Can increase the interest of the game.

  In “G_stock area”, winning information of “G_ART” is stored. In this “G_ART stock area”, 64 pieces of winning information can be stored. The winning information of “G_ART” includes the identification data (“0” to “9”) of the table number of the stock opportunity, and the ART mode (“0” to “3”) at the time of stock. When “R_ART” is won, “1” is stored in the “rocket flag storage area”.

  In addition, the sub storage area includes a “VR stock counter”, a “continuation stock counter”, a “CZ precursor counter”, an “ART precursor counter”, a “union precursor counter”, a “rocket precursor counter”, and a “VR precursor counter”. .

  The value of “VR stock counter” is incremented by “1” every time “Viking rush (VR)” is won, and is decremented by “1” when “VR” is started. The value of the “continuous stock counter” is incremented by “1” every time the continuous stock is won during “D_ART”, and is decremented by “1” every time “D_ART” is continued.

  The “CZ precursor game number” is set in the “CZ precursor game counter”, and the value of the “CZ precursor game counter” is decremented by “1” each time the CZ precursor game is consumed. The “ART predictor counter” is set with “ART predictor number”, and the value of the “ART predictor counter” is decremented by “1” every time the ART predictor game is consumed once.

  In the “union omen counter”, the “number of union omen games” is set, and the value of the “union omen counter” is decremented by “1” every time the union omen game is consumed. In the “rocket precursor counter”, “number of rocket precursor games” is set, and the value of the “rocket precursor counter” is decremented by “1” every time the rocket precursor game is consumed once. In the “VR precursor counter”, “the number of VR precursor games” is set, and the value of the “VR precursor counter” is decremented by “1” every time the VR precursor game is consumed once.

  Further, the sub storage area includes an “ART mode” storage area, a “loop mode” storage area, a “merging mode” storage area, a “next latent management flag” storage area, and an “ART identification data” storage area.

  The “ART mode” is provided in “B_ART” and “D_ART”, and is a mode related to lottery (winning probability) of “G_ART”. The “loop mode” is a mode related to lottery (winning probability) of continuous stock in “D_ART”. The “merging mode” is a mode related to an ART lottery (winning probability) in “G_ART”.

  The “next latent control flag” is a flag indicating whether or not a precursor game is played between “ART”. “ART identification data” is data for identifying “B_ART” and “D_ART”. When the currently activated “ART” is “B_ART”, “ART identification data” is “1”, and when it is “D_ART”, “ART identification data” is “2”. .

  Further, the sub storage area includes an “ART game number counter”, a “combination game number counter”, a “combination identification data” storage area, a “rocket identification data” storage area, and a “VR identification data” storage area.

  The “ART game number counter” is provided to manage the number of remaining games of “B_ART” and “D_ART”. In this “ART game number counter”, “ART start G number” is set. Then, the value of the “ART game number counter” is decremented by “1” every time the game in “B_ART” or “D_ART” is digested once.

  The “merged game number counter” is provided for managing the number of remaining games of “G_ART”. For example, a “number of combined games” is set in the “number of combined games” counter. Then, the value of the “union game number counter” is decremented by “1” every time the game in “G_ART” is consumed once.

  The “union identification data” is data for identifying “G_ART”. When the currently activated “ART” is “G_ART”, the value of the “union identification data” is “1”. Become. “Rocket identification data” is data for identifying “R_ART”. When the currently activated “ART” is “R_ART”, the value of “rocket identification data” is set to “1”. Become. The “VR identification data” is data for identifying “VR”. When “VR (Viking Rush)” is activated, the value of “VR identification data” is “1”.

  Further, the sub storage area includes a “touch operation identification data” storage area, a “VR revolution revolution flag” storage area, a “CZ game number counter”, a “CZ identification data” storage area, a “touch correspondence data” storage area, and a “VR” It has a storage area for “medium correct / incorrect identification flag”.

  The “touch operation identification data” is data for identifying a touch operation on the left character decoration unit 22L and the right character decoration unit 22R. When a touch operation is performed on the left character decoration unit 22L, the value of “touch operation identification data” is “1”. When the touch operation is performed on the right character decoration portion 22R, the value of “touch operation identification data” is “2”.

  The “VR revolution flag” is a flag for managing whether or not “revolution activation” has been won. When “revolution activation” is won, “1” is stored in the “VR revolution flag” storage area.

  The “CZ game number counter” is provided to manage the number of remaining games of “CZ (chance zone)”. In this “CZ game number counter”, “CZ game number” is set. The value of the “CZ game number counter” is decremented by “1” every time the game in “CZ (chance zone)” is consumed once. “CZ identification data” is data for managing whether or not “CZ (chance zone)” is in place, and when “CZ (chance zone)” is in place, the value of “CZ identification data” is It becomes “1”.

  The “touch correspondence data” is data for identifying the contents of correct / incorrect answers (touch correspondence) in “Viking Rush (VR)”. For example, when the right character decoration portion 22R is correct and the right character decoration portion 22L and the right character decoration portion 22R are not touched correctly, the value of “touch correspondence data” is “0”. become. The “VR correct / incorrect identification flag” is data for identifying correct / incorrect of five touch challenges in “VR”.

[Table number and correspondence table]
Next, with reference to FIG. 224, the correspondence between table numbers and various states will be described. FIG. 224 shows a correspondence table between table numbers and various states.

  For example, a value “0” of “table number” indicates that the state is “general state” or “CZ (chance zone)”. Therefore, when “0” is stored as the value of “table number” in various ART stock areas, it indicates that “ART” is won in “general state” or “CZ (chance zone)”.

[Correspondence table between loop mode data and loop mode]
Next, a correspondence relationship between loop mode data and loop modes will be described with reference to FIG. FIG. 225 is a correspondence table between the loop mode data and the loop mode, and shows various loop modes corresponding to the loop mode data.

  For example, when the value of “loop mode data” is “1”, it indicates that “loop mode 1” is set. In addition, when “Loop Mode 1” is set in “D_ART”, the result of continuous stock lottery performed for each game until the game (game) related to one set of “D_ART” is completed. Win a continuation stock with a probability of 33%.

<Description of main control circuit operation>
Next, contents of various processes executed by the main CPU 51 of the main control circuit 41 using a program will be described with reference to FIGS. 226 to 257.

[Main operation processing of pachislot by control of main CPU]
First, a procedure of main operation processing (processing after power-on) of the pachislot 1 performed by control of the main CPU 51 will be described with reference to a main flowchart (hereinafter referred to as main flow) shown in FIG.

  First, when power is turned on to the pachi-slot 1, the main CPU 51 performs a power interruption recovery process (S1). In this process, the main CPU 51 determines whether or not the result of the RAM check process at power-on is normal and whether or not the power failure detection process is normally performed, and an error registration is performed according to the determination result. Processing and initialization processing are performed. Details of the power interruption recovery process will be described later with reference to FIG. 227 described later.

  Next, the main CPU 51 performs an initialization process at the end of one game (S2). In this initialization process, the data in the designated storage area in the main RAM 53 is cleared. The designated storage area here is a storage area that needs to be erased for each unit game (game) such as an internal winning combination storage area or a display combination storage area.

  Specifically, the range of the area of the main RAM 53 that is cleared by the initialization process of S2 is from the last address (tail address) in the main RAM area shown in FIG. 5 to the “one game end” address (first address). It becomes the range. Therefore, in the process of S2, the “one game end” address (see FIG. 5) indicating the start address of the range in which the initialization process in the main RAM 53 is performed is transferred from the main flow process program to the initialization process program. Argument address). The details of the initialization process will be described later with reference to FIG.

  Next, the main CPU 51 performs medal acceptance / start check processing (S3). In this processing, input checks of the medal sensor 35S and the start switch 16S are performed. The details of the medal acceptance / start check process will be described later with reference to FIG.

  Next, the main CPU 51 performs a random number acquisition process (S4). In this process, the main CPU 51 extracts the external random number value (0 to 65535) for the internal winning combination lottery and the internal random number value (0 to 65535) used for the lottery processing of the type of “game lock”. These random numbers are stored in a random value storage area (see FIG. 5) provided in the main RAM 53. At this time, in the present embodiment, at least two types of internal random values (effect random number 1 and effect random value 2 described later) are extracted. Details of the random number acquisition process will be described later with reference to FIG.

  When the extracted various random number values are stored in the random value storage area, the main CPU 51 performs an internal lottery process (S5). In this process, the internal winning combination is determined by lottery based on the external random value extracted in S4. Details of the internal lottery process will be described later with reference to FIG. 230 described later.

  Next, the main CPU 51 performs a game lock lottery process (S6). In this process, the type of “game lock” is determined by lottery based on the various internal random numbers extracted in S4. The details of the game lock lottery process will be described later with reference to FIG.

  Next, the main CPU 51 performs a reel stop initial setting process (S7). Details of the reel stop initial setting process will be described later with reference to FIG.

  Next, the main CPU 51 performs a start command transmission process (S8). Specifically, the main CPU 51 transmits a start command to the sub control circuit 42. Note that the start command includes a parameter for specifying an internal winning combination.

  Next, the main CPU 51 performs a game start lock process (S9). In this process, mainly the lock (reel effect) at the start of the game corresponding to the type of “game lock” determined in the process of S6 is performed. Details of the game start lock process will be described later with reference to FIG.

  Next, the main CPU 51 performs a wait process (S10). In this process, when the predetermined time (for example, 4.1 seconds) has not elapsed since the start of the previous game, the main CPU 51 digests the waiting time until the predetermined time elapses.

  Next, the main CPU 51 performs a reel rotation start process (S11). In this process, the main CPU 51 requests the start of rotation of all reels. When the start of rotation of all reels is requested, driving of the three stepping motors 61L, 61C, 61R is performed by an interrupt process (see FIG. 256, which will be described later) executed at a constant cycle (1.1172 msec). Is controlled, and rotation of the left reel 3L, the middle reel 3C, and the right reel 3R is started. At this time, each reel is subjected to acceleration control until the rotation speed reaches a constant speed, and then controlled so as to maintain the constant speed.

  Next, the main CPU 51 performs a pull-in priority storage process (S12). In this process, the main CPU 51 acquires the pull-in priority data and stores it in the pull-in priority data storage area. The details of the pull-in priority storage process will be described later with reference to FIG.

  Next, the main CPU 51 performs a reel stop control process (S13). In this process, the rotation of the corresponding reel is stopped based on the timing when the left stop button 17L, the middle stop button 17C, and the right stop button 17R are respectively pressed and the internal winning combination. The details of the reel stop control process will be described later with reference to FIG. 238 described later.

  Next, the main CPU 51 performs a winning search process (S14). In this process, the main CPU 51 stores the data in the symbol code storage area (after symbol code storage area 2 in FIG. 55) in the display combination storage area (see FIG. 51). In this process, the combination of symbols displayed on the effective line (winning determination line) after all of the left reel 3L, the middle reel 3C and the right reel 3R are stopped, and the symbol combination table (see FIGS. 10 to 14), Is matched. Then, the main CPU 51 determines whether or not a display combination is displayed on the active line, and stores the determination result in the display combination storage area.

  Further, in the process of S14, the main CPU 51 also performs a process for determining whether there is an illegal hit error. Specifically, when the display combination is other than “losing”, the main CPU 51 matches the display combination displayed on the active line with the internal winning combination included in the winning number determined in the internal lottery process of S5. It is determined whether or not to do so. If the two do not match, the main CPU 51 determines that an illegal hit error has occurred, performs error registration processing (see FIGS. 248 to 250 described later), and invalidates the winning combination (display combination). To do. In the error registration process performed at this time, the error code “8” (see FIG. 49) corresponding to the illegal hit error is passed as an argument from the winning search process program to the error registration process program.

  Next, the main CPU 51 performs medal payout processing (S15). In this process, the hopper 33 is driven and the number of credits is updated based on the payout number of the display combination determined in S14, and medals are paid out. At this time, in the present embodiment, as shown in the symbol combination table (see FIGS. 10 to 14), the number of inserted medals is one or three, and the number of paid out medals varies depending on the display combination. The maximum payout number (payout upper limit) is 15. Details of the medal payout process will be described later with reference to FIG. 247 described later.

  Next, the main CPU 51 performs RT control processing (S16). In this process, the main CPU 51 manages the RT gaming state. Details of the RT control process will be described later with reference to FIG.

  Next, the main CPU 51 performs a game end effect control process (S17). In this process, the output of the jackpot signal is controlled according to a predetermined condition. Details of the game end effect control process will be described later with reference to FIG.

  Next, the main CPU 51 performs a payout end command transmission process (S18). Specifically, the main CPU 51 transmits a payout end command to the sub control circuit 42.

  Next, the main CPU 51 performs a bonus end check process (S19). In this process, the main CPU 51 refers to various counters for managing the end timing of the bonus game and checks whether or not the operation of the bonus game is to end. The details of the bonus end check process will be described later with reference to FIG.

  Next, the main CPU 51 performs a bonus operation check process (S20). In this process, the main CPU 51 checks whether or not to start the operation of the bonus game and whether or not to replay. Details of the bonus operation check process will be described later with reference to FIG. When the bonus operation check process ends, the main CPU 51 returns the process to S2, and repeats the processes after S2.

  As described above, the main command start command transmission process (S8) of the main flow of the present embodiment is executed by the main control circuit 41. In this embodiment, in addition to the start command, a predetermined command (for example, a reel stop command, a display command, a payout end command, a bonus start command, a bonus end command, etc., which will be described later) is used as a secondary command at various triggers of the game operation. Transmission processing of these command data is transmitted to the control circuit 42 and is also executed by the main control circuit 41. That is, in the present embodiment, the main control circuit 41 also serves as means (main control transmission means) for transmitting command data relating to gaming operations.

[Power failure recovery processing]
Next, with reference to FIG. 227, the power interruption recovery process performed in S1 in the main flow (see FIG. 226) will be described.

  First, the main CPU 51 sets the check start address of the sum check process in the stack pointer (SP: start address storage unit) (S31).

  In the sum check process performed in the power interruption recovery process of the present embodiment, the range indicated by the broken line arrow in the main RAM area shown in FIG. That is, from the address (start address) of the storage area next to the storage area for the checksum value (2 bytes) in the main RAM area to the address (tail address) of the storage area for the power interruption occurrence flag (1 byte) The range of is the calculation range of the sum value. In the process of S31, the main CPU 51 sets the start address of the sum value calculation range, that is, the address of the storage area next to the check sum value storage area, as the check start address. In the sum check process of this embodiment, the data acquisition process and the address update (addition) process by the execution of the POP instruction are repeated from the check start address to the tail address.

  Next, the main CPU 51 sets a predetermined value (initial value) in the check counter (S32). The check counter is a counter that counts the number of executions of the POP instruction (the number of executions of data acquisition processing in S33 described later) and is provided in the main RAM 53. In the present embodiment, as described above, two bytes of data are acquired and two bytes of address update processing are performed by executing a single POP instruction. Therefore, in the process of S32, the main CPU 51 sets a value that is ½ of the number of bytes in the calculation range of the sum value as an initial value of the check counter.

  Next, the main CPU 51 executes the POP instruction to acquire 2 bytes of data (data stored in the main RAM 53) from the address (check start address or updated address) set in the stack pointer (S33). ). At this time, the address set in the stack pointer is also updated by execution of the POP instruction. Specifically, an address update process for 2 bytes (a process of adding “2” to the address) is performed.

  Next, the main CPU 51 performs a sum calculation using the 2-byte data acquired in S33 (S34). In this process, the main CPU 51 sequentially adds the data acquired this time to the sum value calculated in the previous process of S34. In the first sum calculation, the sum value of the 2-byte data acquired in S33 is calculated. Next, the main CPU 51 updates the value of the check counter (“1” subtraction) (S35).

  Next, the main CPU 51 determines whether or not the value of the check counter is “0” (S36). In S36, when the main CPU 51 determines that the value of the check counter is not “0” (when S36 is NO), the main CPU 51 returns the process to S33 and repeats the processes after S33.

  On the other hand, when the main CPU 51 determines in S36 that the value of the check counter is “0” (in the case of YES determination in S36), the main CPU 51 determines that the sum value calculated by the repetitive processing of S33 to S36 described above. Then, it is determined whether or not it matches the checksum sum value (S37).

  In S37, when the main CPU 51 determines that the calculated sum value does not match the check sum sum value (when S37 is NO), the main CPU 51 performs the process of S39 described later. On the other hand, when the main CPU 51 determines in S37 that the calculated sum value matches the checksum sum value (when S37 is YES), the main CPU 51 determines whether the power interruption occurrence flag is on. It is determined whether or not (S38).

  The power interruption occurrence flag is a flag for determining whether or not a power interruption has occurred, and is stored in a predetermined area of the main RAM 53 (in the example shown in FIG. 5, the storage area of the address immediately before the stack area). Is done. In the present embodiment, the presence or absence of occurrence of power interruption is detected by a power interruption detection circuit (not shown) provided in the pachislot 1. When the power supply voltage drops below a predetermined voltage, it is determined that power interruption has occurred. Then, when a power interruption occurs, a power interruption detection process (see FIG. 257 described later) described later is performed, and the power interruption occurrence flag is set to an on state during the process. When the power interruption occurrence flag is in an off state (in a state where it is not set), power is interrupted for the first time immediately after the manufacture of the pachislot machine 1 or due to an illegal act, and the power supply described later. This corresponds to the case where the power interruption recovery process is performed without performing the power interruption detection process (see FIG. 257 described later). In these cases, it is necessary to change the set values (settings 1 to 6) of the pachi-slot 1.

  In S38, when the main CPU 51 determines that the power interruption occurrence flag is in the ON state (when S38 is YES), the main CPU 51 performs a process of S44 described later. On the other hand, when the main CPU 51 determines in S38 that the power interruption occurrence flag is not in the ON state (when S38 is NO), the main CPU 51 performs the process of S39 described later.

  When S37 or S38 is NO, that is, when the result of the RAM check is abnormal or when the power failure detection is not normally performed, the main CPU 51 performs an error registration process (S39). In the error registration process performed at this time, the error code “1” (see FIG. 49) corresponding to the RAM abnormality (RAM error) is passed as an argument from the power interruption recovery process program to the error registration process program. Details of the error registration process will be described later with reference to FIGS. 248 to 250 described later.

  After the process of S39, the main CPU 51 determines whether or not the setting key is turned on (S40). The setting key (not shown) is an operation key for operating the setting value of the pachislot 1. When the setting value is operated, the setting key is turned on. In S40, when the main CPU 51 determines that the setting key is not turned on (when S40 is NO), the main CPU 51 repeats the determination process of S40 until the setting key is turned on.

  On the other hand, when the main CPU 51 determines in S40 that the setting key is turned on (in the case of YES determination in S40), the main CPU 51 performs initialization processing at the time of setting change (S41).

  The area of the main RAM 53 that is cleared by the initialization process of S41 is a range from the last address (tail address) to the “setting change” address (start address) in the main RAM area shown in FIG. Therefore, in the process of S41, the “setting change” address (see FIG. 5) indicating the start address of the range in which the initialization process is performed in the main RAM 53 is changed from the power interruption recovery process program to the initialization process program. Argument address). The details of the initialization process will be described later with reference to FIG.

  After the process of S41, the main CPU 51 performs a setting change process (S42). In this process, the main CPU 51 detects a setting change operation executed by, for example, a hall clerk, and changes the setting values (settings 1 to 6) of the pachislot machine 1 as appropriate according to the detected contents. Next, the main CPU 51 determines whether or not the setting key is turned off (S43).

  In S43, when the main CPU 51 determines that the setting key is not turned off (when S43 is NO), the main CPU 51 repeats the determination process of S43 until the setting key is turned off. On the other hand, when the main CPU 51 determines in S43 that the setting key is turned off (when S43 is YES), the main CPU 51 performs the process of S44 described later.

  When S38 or S43 is YES, the main CPU 51 clears the power interruption occurrence flag (S44). Then, after the process of S44, the main CPU 51 ends the power interruption recovery process, and moves the process to S2 of the main flow (see FIG. 226).

  As described above, in S33 of the power interruption recovery process of the present embodiment, 2-byte information stored in the main RAM 53 is acquired by executing one predetermined instruction (POP instruction), and the information The start address of the acquisition process is updated by 2 bytes. This process is executed by the main CPU 51. That is, in the present embodiment, the main CPU 51 executes means for acquiring information for 2 bytes stored in the main RAM 53 and processing for updating addresses for 2 bytes by one predetermined command (information acquisition processing means). ).

  In S <b> 34 of the power interruption recovery process described above, the sum calculation is performed using the acquired information for 2 bytes, and this process is executed by the main CPU 51. In other words, in the present embodiment, the main CPU 51 also serves as a means (sum calculating means) for performing a sum calculation using information of 2 bytes.

  Further, in S33 to S36 of the power interruption recovery process described above, the information acquisition process for 2 bytes and the address update process for 2 bytes are performed from the head address of the predetermined address range in the main RAM 53 toward the tail address. This is repeated, whereby the sum value of the information in the predetermined address range is calculated. This process is executed by the main CPU 51. In other words, in the present embodiment, the main CPU 51 also serves as means (repetition processing means) that repeats the acquisition process of information for 2 bytes stored in the main RAM 53 and the update process of addresses for 2 bytes.

[Medal reception / start check processing]
Next, with reference to FIG. 228, the medal acceptance / start check process performed in S3 in the main flow (see FIG. 226) will be described.

  First, the main CPU 51 determines whether or not there is an automatic insertion request (S51). The determination of whether or not there is an automatic input request is performed by determining whether or not the automatic input counter is “0”. That is, the main CPU 51 determines that there is no automatic input request when the automatic input counter is “0”, and determines that there is an automatic input request when the automatic input counter is “1” or more.

  The automatic insertion counter is data for identifying whether or not a display combination related to replay (replay) has been established in the previous unit game. When the display combination related to the re-game is established, the medals for the number of coins inserted in the previous unit game are automatically inserted into the automatic insertion counter.

  When the main CPU 51 determines in S51 that there is an automatic loading request (when S51 is YES), the main CPU 51 performs an automatic loading process (S52). In this process, the value of the automatic insertion counter is copied to the insertion number counter, and then the value of the automatic insertion counter is cleared. Thereafter, the main CPU 51 performs a process of S62 described later.

  On the other hand, when the main CPU 51 determines in S51 that there is no automatic insertion request (when S51 is NO), the main CPU 51 permits medal acceptance (S53). In this process, the solenoid of the selector 35 (see FIG. 3) is driven, and medals inserted from the medal insertion slot 13 are accepted. The received medals are counted and guided to the hopper 33.

  Next, the main CPU 51 sets the maximum number of inserted sheets according to the gaming state (S54). Specifically, in the BB3 (RB3) game state, the maximum value of the inserted number is set to “1”, and in the other game states (BB1, BB2 game state and general game state), the maximum value of the inserted number is set to “3”. To "".

  Next, the main CPU 51 determines whether or not the medal acceptance is permitted (S55). In S55, when the main CPU 51 determines that the medal acceptance is not permitted (when S55 is NO), the main CPU 51 performs a process of S62 described later.

  On the other hand, when the main CPU 51 determines in S55 that the medal acceptance is permitted (S55 is YES), the main CPU 51 performs a medal insertion check process (S56). In this process, the main CPU 51 determines whether or not a medal has been inserted, and adds “1” to the inserted number counter when a medal is inserted.

  Next, the main CPU 51 determines whether or not an error relating to medal insertion has occurred (S57). In this process, the main CPU 51 determines whether or not any inserted medal passage check error, inserted medal passage time error, or inserted medal retrograde error has occurred. The presence / absence of these errors is determined based on detection signals from, for example, a dedicated sensor (not shown) provided in the pachislot machine 1.

  When the main CPU 51 determines in S57 that an error relating to medal insertion has occurred (when S57 is YES), the main CPU 51 sets an error code corresponding to the error content (S58). Specifically, the main CPU 51 sets one of error codes “4”, “5”, and “6” (see FIG. 49).

  After the process of S58, the main CPU 51 performs an error registration process (S59). In the error registration processing performed at this time, the error codes (“4”, “5”, and “6”) corresponding to the error contents related to medal insertion are transferred from the medal acceptance / start check processing program to the error registration processing program. Either) is passed as an argument. Details of the error registration process will be described later with reference to FIGS. 248 to 250 described later. After the process of S59, the main CPU 51 returns the process to S56 and repeats the processes after S56.

  On the other hand, when the main CPU 51 determines in S57 that an error relating to medal insertion has not occurred (when S57 is NO), the main CPU 51 transmits a medal insertion command to the sub-control circuit 42 (S60). The medal insertion command includes a parameter for specifying the number of inserted coins.

  Next, the main CPU 51 determines whether or not the inserted number is a game start possible number (S61). When the main CPU 51 determines in S61 that the inserted number is not the game start possible number (when S61 is NO), the main CPU 51 returns the process to S55 and repeats the processes after S55. On the other hand, when the main CPU 51 determines in S61 that the inserted number is the number of games that can be started (when S61 is YES), the main CPU 51 performs a process of S62 described later. In the present embodiment, the number of games that can be started in the BB3 (RB3) gaming state is “1”, and the number of games that can be started in the other gaming states (BB1, BB2 gaming state and general gaming state) is “3”. Yes (see FIG. 17).

  After S52, when S55 is NO or when S61 is YES, the main CPU 51 determines whether or not the start switch is on (S62). In S62, when the main CPU 51 determines that the start switch is not on (when S62 is NO), the main CPU 51 returns the process to S55 and repeats the processes after S55.

  On the other hand, when the main CPU 51 determines in S62 that the start switch is on (when S62 is YES), the main CPU 51 performs a medal acceptance prohibition process (S63). By this process, the solenoid of the selector 35 (see FIG. 3) is not driven, and the inserted medal is discharged from the medal payout opening 18. When this process ends, the main CPU 51 ends the medal acceptance / start check process, and moves the process to S4 of the main flow (see FIG. 226).

[Random number acquisition processing]
Next, the random number acquisition process performed in S4 in the main flow (see FIG. 226) will be described with reference to FIG.

  First, the main CPU 51 controls the external random number generator 56 to cause the external latch random number register to latch an external random number value for internal winning combination lottery (S71). Next, the main CPU 51 extracts (reads) the latched external random number value and stores the extracted external random number value in a predetermined area in the random value storage area (S72). In the following, the external random number value stored in S72 is referred to as “role random number value for role lottery”.

  Next, the main CPU 51 first sets the address of the internal latch random number register (the start address of the extraction range) located at the beginning of a predetermined address range corresponding to the extraction range of the internal random value extracted in a batch from the internal random number generator. It is set as a setting address (S73). Next, the main CPU 51 sets the start address of the storage area in the specific address range in the random number storage area in which the extracted internal random number values are stored collectively as the second setting address (S74). Further, the main CPU 51 sets the number of extracted internal random numbers (S75). In addition, the process order of S73-S75 is not limited to this example, You may perform in another order and you may perform these processes in parallel.

  Next, the main CPU 51 executes the LDIRS instruction based on the instruction execution parameters (the first setting address, the second setting address, and the extracted number of the internal random value) set in the processes of S73 to S75, and the necessary internal disturbance. A numerical value is extracted from the internal random number generator, and the extracted internal random value is collectively stored in a storage area of a specific address range in the random value storage area (S76). In this embodiment, by this process, two types of 16-bit internal random values (hereinafter referred to as “effect random number 1” and “effect random number 2”) used for lottery processing of the “game lock” type are used. ) Are extracted and stored in a storage area of a specific address range in the random value storage area.

  Then, after the process of S76, the main CPU 51 ends the random number acquisition process, and moves the process to S5 of the main flow (see FIG. 226).

  As described above, in S76 of the random number acquisition process of the present embodiment, a plurality of latches respectively latched by a plurality of internal latch random number registers arranged in a predetermined address range by execution of one predetermined instruction (LDIRS instruction). The internal random number values are collectively stored in a plurality of storage areas in a corresponding continuous specific address range in the random value storage area. This process is executed by the main CPU 51. In other words, in the present embodiment, the main CPU 51 also serves as means for storing a plurality of internal lottery values in a corresponding storage area (internal random value storage means) by executing one predetermined instruction. In this embodiment, the example in which all the plurality of internal random number values generated by the internal random number generator are used as effect random numbers for determining the content of the reel effect (game lock) has been described. However, the present invention is not limited to this, and one of a plurality of internal random values generated by the internal random number generator may be used as the random number value for role lottery.

[Internal lottery processing]
Next, with reference to FIG. 230, the internal lottery process performed in S5 in the main flow (see FIG. 226) will be described.

  First, the main CPU 51 sets an internal lottery table corresponding to the gaming state (S81). That is, the main CPU 51 grasps the current gaming state with reference to the gaming state flag storage area (see FIG. 52), and determines the type and number of lottery of the internal lottery table based on the internal lottery table determination table (see FIG. 17). decide. The number of lotteries indicates the number of times of lottery value subtraction and determination of whether or not a digit has occurred for each winning number defined by the internal lottery table.

  Next, the main CPU 51 performs lottery value change processing (S82). In this process, the lottery value of the winning number related to the re-game is changed according to the game state. The details of the lottery value changing process will be described later with reference to FIG.

  Next, the main CPU 51 acquires the random number value for role lottery (external random value) stored in the random value storage area (S83). Then, the main CPU 51 sets “1” as the initial value of the winning number.

  Next, the main CPU 51 acquires a lottery value corresponding to the winning number with reference to the internal lottery table, and subtracts the lottery value from the random number value for winning lottery (S84).

  Next, the main CPU 51 determines whether or not the calculation result in S84 is less than “0” (negative value) (S85).

  In S85, when the main CPU 51 determines that the calculation result is not less than “0” (when S85 is NO), the main CPU 51 updates the random number value for winning lottery and the winning number (S86). Specifically, the value of the calculation result is set as a random number value for role lottery, and the winning number is incremented by “1”.

  Next, the main CPU 51 determines whether or not all winning numbers have been checked (S87). When it is determined in S87 that the main CPU 51 has not checked all the winning numbers (when S87 is NO), the main CPU 51 returns the process to S84 and repeats the processes after S84.

  On the other hand, when it is determined in S87 that the main CPU 51 has checked all the winning numbers (when S87 is YES), the main CPU 51 sets “0” as the data pointer (S88). That is, the main CPU 51 sets “0” as the small role / replay data pointer and the bonus data pointer.

  Here, returning to the description of the processing of S85 again, when the main CPU 51 determines in S85 that the calculation result is less than “0” (negative value) (when S85 is YES), the main CPU 51 Then, according to the current winning number, the small role / replay data pointer and the bonus data pointer are acquired (S89).

  After the processing of S88 or S89, the main CPU 51 refers to the small winning combination / replay internal winning combination determination table (see FIGS. 27 to 31) and acquires the internal winning combination based on the small winning combination / replay data pointer. (S90).

  Next, the main CPU 51 stores the acquired internal winning combination in the internal winning combination storing area (S91).

  Next, the main CPU 51 determines whether or not the data stored in the carryover combination storage area is “00000000” (S92). In S92, when the main CPU 51 determines that the data stored in the carryover combination storage area is not “00000000” (when S92 is NO), the main CPU 51 performs the process of S97 described later.

  On the other hand, when the main CPU 51 determines in S92 that the data stored in the carryover combination storage area is “00000000” (when S92 is YES), the main CPU 51 determines the internal winning combination determination table for bonus ( Referring to FIG. 26), an internal winning combination is acquired based on the bonus data pointer (S93).

  Next, the main CPU 51 stores the acquired internal winning combination in the carryover combination storing area (S94).

  Next, the main CPU 51 determines whether or not any of bits 0 to 2 of the carryover combination storage area 1 is “1” (S95). In S95, when the main CPU 51 determines that any of bits 0 to 2 in the carryover combination storage area 1 is not “1” (when S95 is NO), the main CPU 51 performs the process of S97 described later.

  On the other hand, when the main CPU 51 determines in S95 that any of the bits 0 to 2 in the carryover combination storage area 1 is “1” (when S95 is YES), the main CPU 51 sets the RT3 gaming state flag. The game state flag storage area is updated by setting (S96). Specifically, “1” is stored (set) in bit 3 of the game state flag storage area 2 (see FIG. 52).

  After the process of S96 or when S92 or S95 is NO, the main CPU 51 updates the internal symbol combination storing area based on the internal symbol combination stored in the carryover combination storing area (S97). Thereafter, the main CPU 51 ends the internal lottery process, and moves the process to S6 of the main flow (see FIG. 226).

  As described above, the internal lottery process of the present embodiment is executed by the main control circuit 41. That is, in the present embodiment, the main control circuit 41 also serves as means for executing an internal winning combination determining process (internal winning combination determining means).

[Lottery value change processing]
Next, with reference to FIG. 231, the lottery value changing process performed in S82 in the flowchart of the internal lottery process (see FIG. 230) will be described.

  First, the main CPU 51 refers to the gaming state flag storage area (see FIG. 52) to determine whether or not the RT gaming state flag is on (S101). Specifically, the main CPU 51 determines whether or not “1” is set in any of the bits 0 to 3 in the gaming state flag storage area 2 (see FIG. 52). In S101, when the main CPU 51 determines that the RT gaming state flag is not on (when S101 is NO), the main CPU 51 ends the lottery value changing process, and the process is an internal lottery process (see FIG. 230). ) To S83.

  On the other hand, in S101, when the main CPU 51 determines that the RT gaming state flag is on (when S101 is YES), the main CPU 51 determines that the RT internal lottery table corresponding to the RT gaming state that is on. , The lottery value of the winning number (“33” to “41”) related to the re-game in the internal lottery table for general gaming state (see FIG. 19) is changed (S102). Thereafter, the main CPU 51 ends the lottery value changing process, and moves the process to S83 of the internal lottery process (see FIG. 230).

[Game lock lottery processing]
Next, with reference to FIG. 232, the game lock lottery process performed in S6 in the main flow (see FIG. 226) will be described.

  First, the main CPU 51 determines whether or not the data stored in the carryover combination storage area is “00000000” (S111). In S111, when the main CPU 51 determines that the data stored in the carryover combination storage area is not “00000000” (when S111 is NO), the main CPU 51 performs the process of S113 described later.

  On the other hand, when the main CPU 51 determines in S111 that the data stored in the carryover combination storage area is “00000000” (when S111 is YES), the main CPU 51 determines that the current game is a bonus winning game. It is determined whether or not there is (S112). Here, the bonus winning game is a unit game in which the bonus is won in a state where the bonus is not carried over.

  In S112, when the main CPU 51 determines that the current game is not a bonus winning game (when S112 is NO), the main CPU 51 wins the game lock flag corresponding to the winning game lock. The lock period value corresponding to the game lock is set in the lock timer. Then, the main CPU 51 ends the game lock lottery process, and moves the process to S7 of the main flow (see FIG. 226).

  On the other hand, when the main CPU 51 determines in S112 that the current game is a bonus winning game (when S112 is YES), or when S111 is NO, the main CPU 51 determines that the RT gaming state is RT2 gaming. It is determined whether or not the winning number is “33” (S113). In S113, when the main CPU 51 determines that the RT gaming state is the RT2 gaming state and the winning number is “33” (when S113 is YES), the main CPU 51 determines that the game lock lottery table A ( Referring to FIG. 43), game lock lottery is performed based on the production random number value 1 (internal random value) stored in the random value storage area (S114).

  In S114, when the game lock ("game lock 9") is won, the game lock flag corresponding to the won game lock and the value of the lock period (6000 msec) corresponding to the won game lock are set in the lock timer. . Then, after the process of S114, the main CPU 51 ends the game lock lottery process, and moves the process to S7 of the main flow (see FIG. 226).

  That is, in this embodiment, the game lock lottery referring to the game lock lottery table A (see FIG. 43) is performed when the RT game state is the RT2 game state and the winning number is “33”. Therefore, “game lock 9” is won when a game in the RT2 game state, that is, “ART” is executed.

  On the other hand, when the main CPU 51 determines in S113 that the condition that the RT gaming state is the RT2 gaming state and the winning number is “33” is not satisfied (when S113 is NO), the main CPU 51 Then, it is determined whether or not the winning number is “8” (S115). When the main CPU 51 determines in S115 that the winning number is not “8” (when S115 is NO), the main CPU 51 performs the process of S118 described later.

  On the other hand, when the main CPU 51 determines in S115 that the winning number is “8” (in the case where S115 is YES), the main CPU 51 refers to the game lock lottery table B (see FIG. 44) for the production. Based on the random value 1, game lock lottery is performed (S116). Next, the main CPU 51 determines whether or not any of “game lock 1” to “game lock 4” is won in the game lock lottery with reference to the game lock lottery table B (see FIG. 44) (S117). .

  In S117, when it is determined that the main CPU 51 has won any of “game lock 1” to “game lock 4” (when S117 is YES), the main CPU 51 determines the game lock corresponding to the won game lock. The flag and the value of the lock period (49000 msec or 51000 msec) corresponding to the winning game lock are set in the lock timer. Then, after the process of S117, the main CPU 51 ends the game lock lottery process, and moves the process to S7 of the main flow (see FIG. 226).

  On the other hand, when it is determined in S117 that the main CPU 51 has not won the game lock (when S117 is NO), or when S115 is NO, the main CPU 51 has the winning number “0”. Whether or not (S118). In S118, when the main CPU 51 determines that the winning number is not “0” (when S118 is NO), the main CPU 51 performs the process of S120 described later.

  On the other hand, when the main CPU 51 determines that the winning number is “0” in S118 (when S118 is YES), the main CPU 51 uses the effect random number value 1 stored in the random value storage area. The random number 2 (internal random value) is integrated, and the integrated value is stored in the random number storage area of the main RAM 53 as a production random number 1 (S119). Thus, only when the winning number is “0 (lost)”, the random number denominator can be substantially made to be the square of 65536.

  After the processing of S119 or when S118 is NO, the main CPU 51 refers to the game lock lottery table C (see FIG. 45) and performs game lock lottery based on the random number value 1 for performance (S120). In S120, when any of “game lock 4” to “game lock 8” is won, the main CPU 51 determines the game lock flag corresponding to the won game lock and the value of the lock period corresponding to the won game lock ( 51000 msec, 3000 msec, 5000 msec, 7000 msec or 10000 msec) is set in the lock timer. Then, after the process of S120, the main CPU 51 ends the game lock lottery process, and moves the process to S7 of the main flow (see FIG. 226).

  As described above, in the present embodiment, when the winning number is “0”, the integrated value of the production random number 1 and the production random value 2 is set to the production random value 1. That is, in this embodiment, in the game lock lottery with reference to the game lock lottery table C, the game lock lottery table A (see FIG. 43) or the game lock lottery table B (see FIG. 44) is referred to. It was set as the structure which uses the random number value 1 for production used when performing. However, the present invention is not limited to this. For example, in the game lock lottery with reference to the game lock lottery table C performed when the effect random number value 3 is newly provided (extracted) and the winning number is “0”, the effect random number value 2 and the effect random number value The integrated value with 3 may be used as a random number value for production.

[Reel stop initial setting process]
Next, the reel stop initial setting process performed in S7 in the main flow (see FIG. 226) will be described with reference to FIG.

  First, the main CPU 51 refers to the spinning cylinder stop number selection table (see FIG. 34), and acquires the spinning cylinder stop number based on the internal winning combination acquired in the internal lottery process of S5 in FIG. (S131).

  Next, the main CPU 51 refers to the reel stop initial setting table (see FIG. 35), and acquires various information corresponding to the rotation stop number based on the acquired rotation stop number (S132). Specifically, the main CPU 51, corresponding to the acquired rotation stop number, pull-in priority table selection table number, pull-in priority table number, forward push table selection data, forward push table change data, forward push Time table change initial data and irregular pressing time table selection data are acquired.

  Next, the main CPU 51 stores the rotating identifier “0FFH (11111111B)” in the entire symbol code storage area (see FIG. 55) (S133).

  Next, the main CPU 51 stores “3” in the stop button non-operating counter provided in the main RAM 53 (S134). Thereafter, the main CPU 51 ends the reel stop initial setting process, and moves the process to S8 of the main flow (see FIG. 226). The stop button non-operating counter is a counter for managing the number of stop buttons for which a stop operation has not been detected.

[Lock process at game start]
Next, with reference to FIG. 234, the game start time locking process performed in S9 in the main flow (see FIG. 226) will be described.

  First, the main CPU 51 sets a reel effect pattern according to the game lock flag (S141). Specifically, any of the first to fifth reel effects described above is set as the reel effect pattern.

  Next, the main CPU 51 determines whether or not the value of the lock timer is “0” (S142). In S142, when the main CPU 51 determines that the value of the lock timer is not “0” (when S142 is NO), the main CPU 51 repeats the process of S142 until the value of the lock timer becomes “0”. stand by.

  On the other hand, when the main CPU 51 determines that the value of the lock timer is “0” in S142 (when S142 is YES), the main CPU 51 ends the game start lock process, and the process proceeds to the main flow ( The process proceeds to S10 in FIG.

[Retrieve priority storage processing]
Next, with reference to FIG. 235, a description will be given of the pull-in priority storage process performed in S12 in the main flow (see FIG. 226).

  First, the main CPU 51 stores the stop button non-operating counter in the main RAM 53 as the number of searches (S151). Next, the main CPU 51 performs a search target reel determination process (S152). In this process, for example, the main CPU 51 selects a predetermined reel from the rotating reels and determines the selected reel as a search target reel.

  For example, in S152, when all (three) reels are rotated, the left reel 3L is first determined as the search target reel. Thereafter, various processes up to S161 described later are performed on the left reel 3L. When the process returns to S152 again, next, the middle reel 3C is determined as a search target reel. Then, various processes up to S161 described later are performed on the middle reel 3C, and when returning to S152 again, the right reel 3R is next determined as a search target reel.

  Next, the main CPU 51 performs a pull-in priority table selection process (S153). In this process, the pull-in priority table is selected based on the internal winning combination (the small combination / replay data pointer) and the operation stop button. The details of the pull-in priority table selection process will be described later with reference to FIG. 236 described later.

  Next, the main CPU 51 sets “0” as the symbol position data and sets “21” as the symbol check count (S154). Then, the main CPU 51 performs a symbol code storing process (S155). In this process, the symbol code corresponding to the current symbol position data located on the effective line of the search target reel is stored in the symbol code storage area. At this time, symbol codes for the number of valid lines are stored. Details of the symbol code storing process will be described later with reference to FIG. 237 described later.

  Next, the main CPU 51 updates the display combination storage area (see FIG. 51) based on the symbol code acquired in S155 and the data in the symbol code storage area (see FIG. 55) (S156). At this time, regardless of whether the internal winning combination is won or not, a combination of symbols that can be displayed (a displayable combination) is stored in the display combination storing area based on the stopped symbol.

  In this embodiment, the symbol code storage area information (symbol code and displayable role corresponding thereto) is updated for each reel to be stopped. At this time, the displayable combination may be obtained from data prepared in advance that defines the correspondence between the stopped reel symbol and the corresponding displayable combination, or the stopped reel symbol. And the symbol combination table (see FIGS. 10 to 14) may be acquired by collating them. When the former method is used, the correspondence relationship between the symbol and the displayable combination changes for each reel.

  Next, the main CPU 51 performs a drawing priority order acquisition process (S157). In this process, the main CPU 51 uses the drawing priority for the combination whose bit is “1” in the display combination storage area (see FIG. 51) and whose bit is “1” in the internal winning combination storage area. With reference to the ranking table (see FIG. 41), pull-in priority data is acquired.

  In addition, when a symbol of a winning combination (for example, a role relating to “Cherry”: see FIG. 12) is displayed on some reels, the drawing priority order of the winning combination is given to the reel that is “ANY”. Do not get data. Further, if there is a possibility that a winning combination that has not been won is confirmed in the reel for which winning is confirmed, the drawing priority data is set to “stop prohibited (all bits 0)”.

  Next, the main CPU 51 stores the acquired pull-in priority data in the pull-in priority data storage area (see FIG. 56) (S158). At this time, the pull-in priority data is stored in the pull-in priority data storage area so that each priority value corresponds to a bit in the storage area. Next, the main CPU 51 adds “1” to the symbol position data and subtracts “1” from the number of symbol checks (S159).

  Next, the main CPU 51 determines whether or not the number of symbol checks is “0” (S160). In S160, when the main CPU 51 determines that the number of symbol checks is not “0” (when S160 is NO), the main CPU 51 returns the process to S155 and repeats the processes after S155.

  On the other hand, when the main CPU 51 determines in S160 that the number of symbol checks is “0” (in the case where S160 is YES), the main CPU 51 determines whether or not the search has been performed for the number of searches (S161).

  In S161, when it is determined that the main CPU 51 has not searched for the number of times of search (when S161 is NO), the main CPU 51 returns the process to S152 and repeats the processes after S152. On the other hand, when it is determined in S161 that the main CPU 51 has searched as many times as the number of searches (when S161 is YES), the main CPU 51 ends the pull-in priority storage process, and the process is S13 of the main flow (see FIG. 226). Move to.

[Pull-in priority table selection processing]
Next, with reference to FIG. 236, the pull-in priority table selection process performed in S153 in the flowchart of the pull-in priority order storing process (see FIG. 235) will be described.

  First, the main CPU 51 determines whether or not the drawing priority table number is set, that is, whether or not the drawing priority table number is stored directly in the reel stop initial setting process (S7) (S171). ). When the main CPU 51 determines in S171 that the pull-in priority table number has been set (if YES in S171), the main CPU 51 ends the pull-in priority table selection process and stores the pull-in priority order. The process proceeds to S154 of the process (see FIG. 235).

  On the other hand, when the main CPU 51 determines in S171 that the pull-in priority table number is not set (when S171 is NO), the main CPU 51 stores the pressing order storage area (see FIG. 54) and the operation stop button. Referring to the area (see FIG. 53), the corresponding pull-in priority table number is set (S172). Thereafter, the main CPU 51 ends the pull-in priority order table selection process, and moves the process to S154 of the pull-in priority order storing process (see FIG. 235).

  In S172, first, the main CPU 51 refers to the pressing order storage area and the operation stop button storage area, and acquires the data of the pressing order and the operation stop button. Next, the main CPU 51 refers to the drawing priority table selection table corresponding to the drawing priority table selection data, and acquires the drawing priority table number based on the pressing order and the operation stop button. Thereafter, the main CPU 51 sets the acquired pull-in priority table number.

[Design code storage processing]
Next, with reference to FIG. 237, the symbol code storing process performed in S155 in the flowchart of the drawing priority order storing process (see FIG. 235) will be described.

  First, the main CPU 51 sets valid line data (S181). In the present embodiment, the effective line is provided with one line (center line) as described above. Next, the main CPU 51 sets the symbol position data for checking the search target reel based on the search symbol position and the effective line data (S182). For example, when the search target reel is the left reel 3L, since it is desired to acquire information on the middle stage of the search target reel, the check symbol position data indicating the middle stage is set.

  Next, the main CPU 51 obtains a symbol code of the symbol position data for checking (S183). The main CPU 51 stores the acquired symbol code in the symbol code storage area, then ends the symbol code storage process, and moves the process to S156 of the pull-in priority storage process (see FIG. 235).

[Reel stop control process]
Next, with reference to FIG. 238, the reel stop control process performed in S13 in the main flow (see FIG. 226) will be described.

  First, the main CPU 51 performs a stop button detection process (S191). In this process, the main CPU 51 determines whether or not a valid stop button has been pressed, and determines whether or not the left stop button has been pressed in the first stop operation. The details of the stop button detection process will be described later with reference to FIG. 239 described later.

  Next, the main CPU 51 determines the pressing order storage area (see FIG. 54) and the operation stop button storage area (see FIG. 53) based on the detection result of the stop button detection process in S191 (the determination result of the stop button that has been effectively pressed). Is updated (S192). Next, the main CPU 51 subtracts “1” from the stop button non-operating counter (S193).

  Next, the main CPU 51 determines a search target reel from the operation stop button (S194). Then, the main CPU 51 stores the stop start position in the main RAM 53 based on the symbol counter (S195).

  Next, the main CPU 51 performs a sliding piece number determination process (S196). The details of the sliding piece number determination process will be described later with reference to FIG. 240 described later. Next, the main CPU 51 transmits a reel stop command to the sub control circuit 42 (S197). The reel stop command transmitted in this process includes information such as the type of reel to be stopped, the number of sliding pieces, and the ON / OFF edge of the stop switch. Note that the ON / OFF edge information of the stop switch may be monitored by an interrupt process described later, and the information may be transmitted to the sub-control circuit 42.

  Next, the main CPU 51 determines a planned stop position based on the stop start position and the number of sliding pieces determined in S196, and stores the determined planned stop position in the main RAM 53 (S198). In this process, the main CPU 51 adds the number of sliding frames to the stop start position, and sets the result as the planned stop position.

  Next, the main CPU 51 sets the planned stop position determined in S198 as a search symbol position (S199). Next, the main CPU 51 performs the symbol code storing process described with reference to FIG. 237 (S200). Thereafter, the main CPU 51 updates the symbol code storage area (see FIG. 55) using the symbol code acquired in S200 (S201).

  Next, the main CPU 51 performs a control change process (S202). The details of the control change process will be described later with reference to FIG. 245 described later. Next, the main CPU 51 determines whether or not the pressed stop button has been released (S203). In S203, when the main CPU 51 determines that the pressed stop button has not been released (when S203 is NO), the main CPU 51 repeats the processing of S203 and waits until the pressed stop button is released. To do.

  On the other hand, when the main CPU 51 determines in S203 that the pressed stop button has been released (when S203 is YES), the main CPU 51 performs reel stop command transmission processing (S204). In this process, the main CPU 51 transmits a reel stop command to the sub control circuit 42. At this time, the data structure of the reel stop command to be transmitted is the same as that of the reel stop command transmitted in S197. However, the ON edge / OFF edge information included in the reel stop command transmitted in S204 is different from the ON edge / OFF edge information included in the reel stop command transmitted in S197.

  Next, the main CPU 51 determines whether or not the stop button non-operation counter is “0” (S205). When the main CPU 51 determines in S205 that the inoperative counter is not “0” (in the case where S205 is NO), the main CPU 51 performs the pull-in priority storage process described with reference to FIG. 235 (S206). . Thereafter, the main CPU 51 returns the process to S191 and repeats the processes after S191.

  On the other hand, when the main CPU 51 determines in S205 that the inoperative counter is “0” (in the case where S205 is YES), the main CPU 51 ends the reel stop control process, and the process proceeds to the main flow (FIG. 226). (Refer to S14).

  As described above, the reel stop control process of the present embodiment is executed by the main control circuit 41. That is, in this embodiment, the main control circuit 41 also serves as means (stop control means) for executing stop control of reel rotation (design variation display).

[Stop button detection processing]
Next, the stop button detection process performed in S191 in the flowchart of the reel stop control process (see FIG. 238) will be described with reference to FIG.

  First, the main CPU 51 determines whether or not there is a pressed stop button (S211). In S211, when the main CPU 51 determines that there is no pressed stop button (when S211 is NO), the main CPU 51 ends the stop button detection process and the process is a reel stop control process (see FIG. 238). To S192.

  On the other hand, when the main CPU 51 determines that there is a pressed stop button in S211 (when S211 is YES), the main CPU 51 determines whether or not the stop button stop operation is the first stop operation. (S212). In S212, when the main CPU 51 determines that the stop button stop operation is not the first stop operation (NO in S212), the main CPU 51 performs the process of S215 described later.

  On the other hand, when the main CPU 51 determines in S212 that the stop button stop operation is the first stop operation (YES in S212), the main CPU 51 determines whether or not the left stop button 17L is pressed. (S213). In this process, if there is one stop button pressed in the first stop operation, the main CPU 51 determines whether or not the pressed stop button is the left stop button 17L. In this process, when there are a plurality of stop buttons pressed by the first stop operation, the main CPU 51 determines whether or not the left stop button 17L is included in the plurality of pressed stop buttons. Determine.

  In S213, when the main CPU 51 determines that the left stop button 17L is not pressed (when S213 is NO), the main CPU 51 performs the process of S215 described later. On the other hand, when the main CPU 51 determines in S213 that the left stop button 17L has been pressed (in the case where S213 is YES), the main CPU 51 sets the left stop button 17L as a stop button that has been effectively pressed (S214). . After the process of S214, the main CPU 51 ends the stop button detection process, and moves the process to S192 of the reel stop control process (see FIG. 238).

  When S212 or S213 is NO, the main CPU 51 determines whether or not a plurality of stop buttons have been pressed (S215). In S215, when the main CPU 51 determines that a plurality of stop buttons have been pressed (in the case where S215 is YES), the main CPU 51 ends the stop button detection process and the process is a reel stop control process (see FIG. 238). To S192. That is, when a plurality of stop buttons are pressed in a stop operation other than the first stop operation, or when the stop button pressed in the first stop operation does not include a left stop button, The pressing operation is treated as an invalid operation.

  On the other hand, when the main CPU 51 determines in S215 that the plurality of stop buttons have not been pressed (when S215 is NO), the main CPU 51 is the stop button for the reel that is rotating. Whether or not (S216). In S216, when the main CPU 51 determines that the pressed stop button is not a rotating reel stop button (when S216 is NO), the main CPU 51 ends the stop button detection process and stops the process. Control proceeds to S192 of the control process (see FIG. 238). That is, when the pressed stop button is a stop button corresponding to a stopped reel, the pressing operation of the stop button is treated as an invalid operation.

  On the other hand, when the main CPU 51 determines in S216 that the pressed stop button is the rotating reel stop button (when S216 is YES), the main CPU 51 effectively presses the pressed stop button. The stop button is set (S217). After the process of S217, the main CPU 51 ends the stop button detection process, and moves the process to S192 of the reel stop control process (see FIG. 238).

  As described above, in S211 to S214 of the stop button detection process of the present embodiment, when a plurality of stop buttons including the left stop button 17L are simultaneously pressed in the first reel stop operation, the left stop button 17L is pressed. Is enabled, and other stop button presses are disabled. This process is executed by the main CPU 51. That is, in the present embodiment, the main CPU 51 determines that the pressing operation of the left stop button 17L is an effective pressing operation when a plurality of stop buttons including the left stop button 17L are simultaneously pressed in the first reel stopping operation. It also serves as a means (stop operation determination means).

[Sliding piece number determination processing]
Next, with reference to FIG. 240, the slip piece number determination process performed in S196 in the flowchart of the reel stop control process (see FIG. 238) will be described.

  First, the main CPU 51 selects line mask data corresponding to the operation stop button based on a line mask data table (not shown) (S221). In this process, for example, when the left stop button 17L is pressed, the main CPU 51 sets “10000000” in which the bit 7 corresponding to the “left reel A line” of the stop data is set as line mask data. Select. For example, when the middle stop button 17C is pressed, the main CPU 51 selects “00010000” in which bit 4 corresponding to “middle reel A line” of the stop data is set as line mask data. To do. Further, for example, when the right stop button 17R is pressed, the main CPU 51 selects “00000010” in which bit 1 corresponding to “right reel A line” of the stop data is set as line mask data. To do.

  Next, the main CPU 51 determines whether or not it is the first stop (the stop button non-operation counter is “2”) (S222). When the main CPU 51 determines that it is not the first stop in S222 (when S222 is NO), the main CPU 51 performs the second and third stop processing (S223). The details of the second and third stop processes will be described later with reference to FIG. Thereafter, the main CPU 51 performs a process of S231 described later.

  On the other hand, when it is determined in S222 that the main CPU 51 is the first stop (when S222 is YES), the main CPU 51 determines whether or not the operation stop button is a left stop button (S224).

  In S224, when the main CPU 51 determines that the operation stop button is the left stop button (when S224 is YES), the main CPU 51 obtains the table selection data and the symbol counter at the time of forward pressing (S225). In this process, the forward-pressed table selection data is acquired with reference to the reel stop initial setting table (see FIG. 35). Next, the main CPU 51 refers to the first press stop table corresponding to the forward press table selection data, and acquires the sliding piece number determination data and the change status based on the symbol counter (S226). Thereafter, the main CPU 51 performs a process of S231 described later.

  On the other hand, when the main CPU 51 determines in S224 that the operation stop button is not the left stop button (when S224 is NO), the main CPU 51 obtains the table selection data for irregular pressing and selects the table for irregular pressing. An irregular pressing stop table corresponding to the data is set (S227). In this process, the irregularly pressed table selection data is acquired with reference to the reel stop initial setting table (see FIG. 35).

  Next, the main CPU 51 performs a line change bit check process (S228). Details of the line change bit check process will be described later with reference to FIG. Next, the main CPU 51 performs a line mask data change process (S229). Details of the line mask data changing process will be described later with reference to FIG. 243 described later. Thereafter, the main CPU 51 refers to the set stop table at the time of irregular pressing, and acquires the sliding piece number determination data based on the line mask data and the stop start position (S230).

  After the process of S223, S226, or S230, the main CPU 51 performs a priority pull-in control process (S231). In this process, the drawing priority order data corresponding to each symbol position in the range from the stop start position to the maximum number of sliding symbols “4” is compared, and the most appropriate number of sliding symbols is determined. The details of the priority pull-in control process will be described later with reference to FIG. Thereafter, the main CPU 51 ends the sliding piece number determination process, and moves the process to S197 of the reel stop control process (see FIG. 238).

[Second and third stop processing]
Next, with reference to FIG. 241, the second and third stop processing performed in S223 in the flowchart (see FIG. 240) of the sliding piece number determination processing will be described.

  First, the main CPU 51 determines whether or not it is during the second stop operation (S241). In S241, when the main CPU 51 determines that it is not during the second stop operation (when S241 is NO), the main CPU 51 performs a process of S244 described later.

  On the other hand, when it is determined in S241 that the main CPU 51 is in the second stop operation (when S241 is YES), the main CPU 51 presses the stop buttons in the order of pressing (the first stop is the left reel 3L). It is determined whether or not (S242). In S242, when the main CPU 51 determines that it is not a forward press (when S242 is NO), the main CPU 51 performs a process of S244 described later.

  On the other hand, when it is determined in S242 that the main CPU 51 is a forward press (when S242 is YES), the main CPU 51 performs a line change bit check process (S243). Details of the line change bit check process will be described later with reference to FIG.

  After the process of S243, or when S241 or S242 is NO, the main CPU 51 performs a line mask data change process (S244). Details of the line mask data changing process will be described later with reference to FIG. 243 described later. Next, the main CPU 51 performs a sliding piece number search process (S245). In this process, with reference to the stop table (FIGS. 36, 38 and 39), the number of pieces of sliding symbols is determined based on the stop start position.

  For example, when the line mask data is “00010000” corresponding to “middle reel A line”, the main CPU 51 refers to the column of “middle reel A line” of bit 4. Then, a search is sequentially performed as to whether or not the corresponding data is “1” for each symbol position within the range of the maximum number of sliding symbols from the stop start position. Next, the main CPU 51 calculates the difference from the symbol position where the corresponding data is “1” to the stop start position, and determines the calculated value as the number of sliding pieces determination data. Then, after the process of S245, the main CPU 51 ends the second and third stop processes, and moves the process to S231 of the number of sliding pieces determination process (see FIG. 240).

[Line change bit check processing]
Next, referring to FIG. 242, the line change bit performed in S228 in the flowchart of the number of sliding pieces determination process (see FIG. 240) and in S243 in the flowchart of the second and third stop processes (see FIG. 241). The check process will be described.

  First, the main CPU 51 determines whether or not the change status is “1” or “2” (S251). In S251, when the main CPU 51 determines that the change status is “1” or “2” (when S251 is YES), the main CPU 51 sets the corresponding line status (S252). In this process, in this embodiment, when the change status is “1”, the A line status is set, and when the change status is “2”, the B line status is set. Then, after the processing of S252, the main CPU 51 ends the line change bit check processing, and the processing is S229 of the slip piece number determination processing (see FIG. 240) or the flowchart of the second and third stop processing (see FIG. 241). ) In S244.

  On the other hand, when the main CPU 51 determines in S251 that the change status is not “1” or “2” (when S251 is NO), the main CPU 51 determines whether or not the line change bit is on. (S253). In this process, the main CPU 51 refers to the column corresponding to “middle reel line change bit” or “right reel line change bit” in the stop table (see FIGS. 38 and 39), and the data corresponding to the stop start position is stored. It is determined whether or not “1”. In S253, when the main CPU 51 determines that the data corresponding to the stop start position is not “1”, that is, the line change bit is not ON (when S253 is NO), the main CPU 51 sets the line change bit. The check process is terminated, and the process proceeds to S229 in the sliding piece number determination process (see FIG. 240) or S244 in the flowchart of the second and third stop processes (see FIG. 241).

  On the other hand, when the main CPU 51 determines in S253 that the data corresponding to the stop start position is “1”, that is, the line change bit is ON (when S253 is YES), the main CPU 51 The line status is set (S254). The B line status is data used for changing the line mask data. Then, after the processing of S254, the main CPU 51 ends the line change bit check processing, and the processing is S229 of the slip piece number determination processing (see FIG. 240) or the flowchart of the second and third stop processing (see FIG. 241). ) In S244.

[Line mask data change processing]
Next, referring to FIG. 243, the line mask data to be executed in S229 in the flowchart of the sliding piece number determining process (see FIG. 240) and in S244 in the flowchart of the second and third stop processes (see FIG. 241). The change process will be described.

  First, the main CPU 51 determines whether or not the C line status is set (S261). Note that the setting of the C line status is performed in the case of forward pressing in the second post-stop control change process (see FIG. 246) described later.

  In S261, when the main CPU 51 determines that the C line status is set (when S261 is YES), the main CPU 51 determines whether or not the operation stop button at the second stop is the middle stop button. A determination is made (S262).

  In S262, when the main CPU 51 determines that the operation stop button at the second stop is the middle stop button (when S262 is YES), the main CPU 51 rotates the line mask data to the right twice (S263). ). If it is a forward press and the operation stop button at the second stop is a middle stop button, the operation stop button at the third stop is a right stop button. Therefore, the line mask data is changed from “00000010” to “10000000” by the process of S263. As a result, the column of bit 7 corresponding to the “right reel C line data” of the stop table for second and third stops (see FIG. 38) at the time of forward pressing is referred. After the process of S263, the main CPU 51 ends the line mask data change process, and the process is S230 of the slip piece number determination process (see FIG. 240) or the flowchart of the second and third stop processes (see FIG. 241). ) In S245.

  On the other hand, when the main CPU 51 determines in S262 that the operation stop button at the time of the second stop is not the middle stop button (when S262 is NO), the main CPU 51 rotates the line mask data twice to the left ( S264). If it is a forward press and the operation stop button at the second stop is not the middle stop button, the operation stop button at the third stop becomes the middle stop button. Therefore, the line mask data is changed from “00010000” to “01000000” by the process of S264. As a result, the column of bit 6 corresponding to the “middle reel C line data” of the stop table for the second and third stops at the time of forward pressing is referred. Then, after the process of S264, the main CPU 51 ends the line mask data change process, and the process is S230 of the slip piece number determination process (see FIG. 240) or the flowchart of the second and third stop processes (see FIG. 241). ) In S245.

  Here, returning to the description of the processing of S261 again, in S261, when the main CPU 51 determines that the C line status is not set (when S261 is NO), the main CPU 51 sets the B line status. It is determined whether or not it has been performed (S265). In S265, when the main CPU 51 determines that the B line status is not set (when S265 is NO), the main CPU 51 ends the line mask data changing process, and the process is determined as the number of sliding frames determination process (FIG. 240) or the process of S245 in the flowchart of the second and third stop processing (see FIG. 241).

On the other hand, when the main CPU 51 determines that the B line status is set in S265 (when S265 is YES), the main CPU 51 rotates the line mask data once to the right (S266). By this processing, for example, when the line mask data is “00000010”, it is changed to “00000001”.
As a result, the column corresponding to “B line data” in the stop table (see FIGS. 38 and 39) is referred to. After the process of S266, the main CPU 51 ends the line mask data change process, and the process is S230 of the slip piece number determination process (see FIG. 240) or the flowchart of the second and third stop processes (see FIG. 241). ) In S245.

[Priority pull-in control processing]
Next, with reference to FIG. 244, the priority pull-in control process performed in S231 in the flowchart (see FIG. 240) of the sliding piece number determination process will be described.

  First, the main CPU 51 sets a search order table (see FIG. 42) according to the gaming state (S271). Next, the main CPU 51 sets initial values for the search order counter and the number of checks (S272). Specifically, the main CPU 51 sets “1” as an initial value in the search order counter. Further, the main CPU 51 sets the data length of the search order table as an initial value for the number of checks. Specifically, “5” is set as the initial value of the number of checks.

  Next, the main CPU 51 sets the start address of a stop order table (not shown), and adds the address of the search order table based on the sliding piece number determination data (S273).

  Next, the main CPU 51 obtains the number of sliding symbols corresponding to the value of the search order counter (S274). Next, the main CPU 51 adds the acquired number of sliding frames to the expected stop start address, and acquires pull-in priority data (S275).

  Next, the main CPU 51 determines whether or not the pull-in priority data acquired in S275 exceeds the pull-in priority data acquired previously (S276). In S276, when the main CPU 51 determines that the pull-in priority data acquired in S275 does not exceed the pull-in priority data acquired previously (when S276 is NO), the main CPU 51 performs the process of S278 described later. Do.

  On the other hand, in S276, when the main CPU 51 determines that the pull-in priority data acquired in S275 exceeds the pull-in priority data acquired previously (when S276 is YES), the main CPU 51 detects the slip acquired in S274. The number of frames is saved (S277).

  After the processing of S277 or when S276 is NO, the main CPU 51 subtracts “1” from the number of checks and adds “1” to the search order counter (S278).

  Next, the main CPU 51 determines whether or not the number of checks is “0” (S279). When the main CPU 51 determines in S279 that the number of checks is not “0” (when S279 is NO), the main CPU 51 returns the process to S274 and repeats the processes after S274.

  On the other hand, when the main CPU 51 determines that the number of checks is “0” in S279 (when S279 is YES), the main CPU 51 restores the number of sliding symbols that have been retreated (S280). Thereafter, the main CPU 51 ends the priority pull-in control process and also ends the number of sliding pieces determination process (see FIG. 240).

[Control change processing]
Next, the control change process performed in S202 in the flowchart of the reel stop control process (see FIG. 238) will be described with reference to FIG.

  First, the main CPU 51 determines whether or not it is after the third stop (S291). When the main CPU 51 determines in S291 that it is after the third stop (when S291 is YES), the main CPU 51 ends the control change process, and the process is S203 of the reel stop control process (see FIG. 238). Move to.

  On the other hand, when the main CPU 51 determines in S291 that it is not after the third stop (when S291 is NO), the main CPU 51 determines whether or not it is after the second stop (S292). In S292, when the main CPU 51 determines that it is after the second stop (when S292 is YES), the main CPU 51 performs a control process after the second stop (S293). Details of the second post-stop control process will be described later with reference to FIG. Then, after the process of S293, the main CPU 51 ends the control change process, and moves the process to S203 of the reel stop control process (see FIG. 238).

  On the other hand, when it is determined in S292 that the main CPU 51 is not after the second stop (in the case of NO determination in S292), the main CPU 51 determines whether or not it is a forward press (S294). In S294, when the main CPU 51 determines that it is not a forward press (when S294 is NO), the main CPU 51 ends the control change process and moves the process to S203 of the reel stop control process (see FIG. 238).

  On the other hand, when it is determined in S294 that the main CPU 51 is the forward press (when S294 is YES), the main CPU 51 determines the forward push control change table according to the forward push table change data (see FIG. 37). And the number of searches is set (S295).

  Next, the main CPU 51 acquires a scheduled stop position (S296). Then, the main CPU 51 updates the change target position according to the acquired planned stop position (S297).

  Next, the main CPU 51 determines whether or not the change target position updated in S297 matches the planned stop position (S298). When the main CPU 51 determines in S298 that the updated change target position does not match the planned stop position (when S298 is NO), the main CPU 51 determines whether or not the number of searches is “0”. (S299).

  In S299, when the main CPU 51 determines that the number of searches is not “0” (when S299 is NO), the main CPU 51 returns the process to S297 and repeats the processes after S297. On the other hand, in S299, when the main CPU 51 determines that the number of searches is “0” (in the case where S299 is YES), the main CPU 51 sets the second- Obtained as the third stop table number and set the corresponding stop table (S300).

  Next, the main CPU 51 sets “0” to the C line check data (S301). After the process of S301, the main CPU 51 ends the control change process, and moves the process to S203 of the reel stop control process (see FIG. 238).

  In S298, when the main CPU 51 determines that the updated change target position coincides with the planned stop position (when S298 is YES), the main CPU 51 performs the second pressing operation according to the value of the line change status. The third stop table number and C line check data are acquired (S302).

  Next, the main CPU 51 sets a corresponding stop table based on the second and third stop table numbers for forward pressing (S303). After the process of S303, the main CPU 51 ends the control change process, and moves the process to S203 of the reel stop control process (see FIG. 238).

[Control change processing after second stop]
Next, the second post-stop control change process performed in S293 in the flowchart of the control change process (see FIG. 245) will be described with reference to FIG.

  First, the main CPU 51 determines whether or not it is a forward press (S311). When the main CPU 51 determines in S311 that it is not a forward press (when S311 is NO), the main CPU 51 ends the control change process after the second stop and also ends the control change process (see FIG. 245). .

  On the other hand, when it is determined in S311 that the main CPU 51 is a forward press (when S311 is YES), the main CPU 51 determines whether the C line check data is on (change status is “3”) or not. Is determined (S312). The C line check data is acquired by the process of S302 of the control change process (see FIG. 245). In S312, when the main CPU 51 determines that the C line check data is not on (in the case of NO determination in S312), the main CPU 51 ends the control change process after the second stop and the control change process (FIG. 245) also ends.

  On the other hand, when the main CPU 51 determines that the C line check data is on in S312 (when S312 is YES), the main CPU 51 turns on the line change bit corresponding to the stop start position at the second stop. It is determined whether or not (S313). In S313, when the main CPU 51 determines that the line change bit corresponding to the stop start position at the time of the second stop is not ON (when S313 is NO), the main CPU 51 ends the control change process after the second stop. At the same time, the control change process (see FIG. 245) is also terminated.

  On the other hand, when the main CPU 51 determines in S313 that the line change bit corresponding to the stop start position at the time of the second stop is on (when S313 is YES), the main CPU 51 performs the stored forward push. “1” is added to the second and third stop table numbers, and the corresponding stop table is set (S314). Next, the main CPU 51 sets the C line status (S315). After the process of S315, the main CPU 51 ends the second post-stop control change process and also ends the control change process (see FIG. 245).

[Medal payout processing]
Next, with reference to FIG. 247, the medal payout process performed in S15 in the main flow (see FIG. 226) will be described.

  First, the main CPU 51 determines whether or not a medal has been paid out based on the result of the winning search process in S14 (see FIG. 226) (S321). In S321, when the main CPU 51 determines that no medal has been paid out (when S321 is NO), the main CPU 51 ends the medal payout process and moves the process to S16 of the main flow (see FIG. 226).

  On the other hand, when the main CPU 51 determines in S321 that there is a payout of medals (when S321 is YES), the main CPU 51 determines that the number of credited medals is the upper limit of credits (50 in this embodiment). ) Is determined (S322). In S322, when the main CPU 51 determines that the number of credited medals is the upper limit of credit (when S322 is YES), the main CPU 51 performs a process of S325 described later.

  On the other hand, when the main CPU 51 determines in S322 that the number of credited medals is not the upper limit of credit (when S322 is NO), the main CPU 51 performs credit addition update processing (S323). Specifically, the main CPU 51 adds the number of medals paid out in the current game (unit game) to the number of credited medals.

  Next, the main CPU 51 determines whether or not the updated number of credits has exceeded its upper limit (50 in this embodiment) (S324). In S324, when the main CPU 51 determines that the updated number of credits does not exceed the upper limit (when S324 is NO), the main CPU 51 ends the medal payout process, and the process proceeds to the main flow (FIG. 226). (Refer to S16).

  On the other hand, when the main CPU 51 determines in S324 that the updated number of credits has exceeded the upper limit (when S324 is YES), the main CPU 51 performs the process of S325 described later.

  When S322 or S324 is YES, the main CPU 51 performs medal payout processing (S325). In this processing, medals for the amount exceeding the upper limit of the number of credits are paid out.

  Next, the main CPU 51 determines whether or not an error relating to the hopper 33 has occurred (S326). In this process, the main CPU 51 determines whether any of a hopper empty error, a hopper jam error, or an auxiliary storage full error has occurred. The presence / absence of these errors is determined based on detection signals from, for example, a dedicated sensor (not shown) provided in the pachislot machine 1.

  When the main CPU 51 determines in S326 that an error relating to the hopper 33 has occurred (in the case where S326 is YES), the main CPU 51 sets an error code corresponding to the error content (S327). Specifically, the main CPU 51 sets one of the error codes “2”, “3”, and “7” (see FIG. 49).

  After the processing of S327, the main CPU 51 performs error registration processing (S328). In the error registration processing performed at this time, an error code (any one of “2”, “3”, and “7”) corresponding to the error content related to the hopper 33 is an argument from the medal payout processing program to the error registration processing program. Passed as. Details of the error registration process will be described later with reference to FIGS. 248 to 250 described later. After the process of S328, the main CPU 51 returns the process to S325 and repeats the processes after S325.

  On the other hand, when the main CPU 51 determines in S326 that an error relating to the hopper 33 has not occurred (when S326 is NO), the main CPU 51 ends the medal payout process, and the process proceeds to the main flow (see FIG. 226). ) To S16.

[Error registration processing and table jump processing]
Next, referring to FIGS. 248 to 250, S39 in the flowchart of the power interruption recovery process (see FIG. 227), S59 in the flowchart of the medal acceptance / start check process (see FIG. 228), and the medal payout process The error registration process performed in S328 in the flowchart (see FIG. 247) and the table jump process performed in the process will be described. As described above, in this embodiment, the illegal hit error registration process is also performed in the winning search process of S14 in the main flow (see FIG. 226). This error registration process is also described below. The same is done.

  When the error registration process is started, the main CPU 51 performs a table jump process (S331). In this process, when the table jump process is CALLed by the main CPU 51, the return address of the CALL instruction is stored in the stack area. At this time, in this embodiment, the address next to the address in the main ROM 52 where the table jump processing program is arranged is stored in the stack area as a return address.

  In the present embodiment, as described above, the address next to the address in the main ROM 52 in which the table jump processing program is arranged corresponds to the head address of the relative position table for error registration processing (see FIG. 49). . Therefore, when the table jump process is CALLed by the main CPU 51 in the process of S331, the head address of the error registration process relative position table is stored in the stack area as the return address of the CALL instruction.

  In the table jump process of S331, based on the error code (any one of “1” to “8”) acquired as an argument in the error registration process, and the return address stored in the stack area by the CALL instruction Then, an error registration process corresponding to the error code is performed. Here, with reference to FIG. 249 and FIG. 250, the contents of the table jump process will be specifically described.

  When the table jump process is started, first, the main CPU 51 obtains information on the return address (start address of the relative position table for error registration process) stored in the stack area (S341). Next, the main CPU 51 refers to the relative position table for error registration processing (see FIG. 49), and relative position information (any one of “relative position 1” to “relative position 8”) corresponding to the error code (error content). Is acquired (S342).

  Next, the main CPU 51 calculates the address of the jump destination processing program, that is, the address of the error registration processing program corresponding to the error content (type) based on the acquired return destination address and relative position information (S343). Specifically, the main CPU 51 adds the relative position corresponding to the error code to the return address (calculation reference position), and calculates the head address of the error registration processing program corresponding to the error content. Then, the main CPU 51 jumps to the calculated address (S344).

  Note that the start address of the error registration processing program at the jump destination changes according to the error content (error code), so the processing after S344 changes according to the error content (error code).

  For example, when the error content is “RAM error”, that is, when the error registration process shown in FIG. 248 is the process of S39 in the flowchart of the power interruption recovery process (see FIG. 227), the jump destination address is returned. The destination address (start address of the relative position table for error registration processing) + “relative position 1”, which is the start address of the RAM error registration processing program (see FIG. 50). Therefore, in this case, the main CPU 51 jumps the process to the RAM error registration process in S344.

  In the RAM error registration process, the main CPU 51 registers (stores) the error code “1” corresponding to “RAM error” in a predetermined storage area for error registration in the main RAM 53 (S345). At this time, the 7-segment display 6 displays information “rr” (information indicating the occurrence of a RAM error) corresponding to the error code “1”. After the process of S345, the main CPU 51 ends the error registration process and the table jump process, and moves the process to S40 of the power interruption recovery process (see FIG. 227).

  Further, for example, when the error content is “hopper empty error”, that is, when the error registration process shown in FIG. 248 is the process of S328 in the flowchart of the medal payout process (see FIG. 247), the jump destination address is , Return address + “relative position 2”, which is the top address of the hopper empty error registration processing program (see FIG. 50). Therefore, in this case, the main CPU 51 causes the process to jump to the hopper empty error registration process in S344.

  In the hopper empty error registration process, the main CPU 51 registers (stores) the error code “2” corresponding to the “hopper empty error” in a predetermined storage area for error registration in the main RAM 53 (S346). At this time, the 7-segment display 6 displays information “HE” (information indicating the occurrence of a hopper empty error) corresponding to the error code “2”. After the process of S346, the main CPU 51 ends the error registration process and the table jump process, and moves the process to S325 of the medal payout process (see FIG. 247).

  For example, when the error content is “hopper jam error”, that is, when the error registration process shown in FIG. 248 is the process of S328 in the flowchart of the medal payout process (see FIG. 247), the jump destination address is , Return address + “relative position 3”, which becomes the top address of the hopper jam error registration processing program (see FIG. 50). Therefore, in this case, the main CPU 51 causes the process to jump to the hopper jam error registration process in S344.

  In the hopper jam error registration process, the main CPU 51 registers (stores) the error code “3” corresponding to the “hopper jam error” in a predetermined storage area for error registration in the main RAM 53 (S347). At this time, the 7-segment display 6 displays information “HJ” (information indicating the occurrence of a hopper empty error) corresponding to the error code “3”. After the process of S347, the main CPU 51 ends the error registration process and the table jump process, and moves the process to S325 of the medal payout process (see FIG. 247).

  For example, when the error content is “inserted medal passage check error”, that is, when the error registration process shown in FIG. 248 is the process of S59 in the flowchart of medal acceptance / start check process (see FIG. 228), The jump destination address is the return destination address + “relative position 4”, which is the leading address of the inserted medal passage check error registration processing program (see FIG. 50). Therefore, in this case, the main CPU 51 causes the process to jump to the inserted medal passage check error registration process in S344.

  In the inserted medal passage check error registration process, the main CPU 51 registers (stores) the error code “4” corresponding to the “inserted medal passage check error” in a predetermined storage area for error registration in the main RAM 53 (S348). . At this time, the 7-segment display 6 displays information “CJ” (information indicating the occurrence of the inserted medal passage check error) corresponding to the error code “4”. After the process of S348, the main CPU 51 ends the error registration process and the table jump process, and moves the process to S56 of the medal acceptance / start check process (see FIG. 228).

  Further, for example, when the error content is “inserted medal passage time error”, that is, when the error registration process shown in FIG. 248 is the process of S59 in the flowchart of the medal acceptance / start check process (see FIG. 228), The jump destination address is “return destination address +“ relative position 5 ”, which is the leading address of the inserted medal passage time error registration processing program (see FIG. 50). Therefore, in this case, the main CPU 51 causes the process to jump to the inserted medal passage time error registration process in S344.

  In the inserted medal passage time error registration process, the main CPU 51 registers (stores) the error code “5” corresponding to the “inserted medal passage time error” in a predetermined storage area for error registration in the main RAM 53 (S349). . At this time, the 7-segment display 6 displays information “CE” (information indicating the occurrence of the inserted medal passage time error) corresponding to the error code “5”. After the process of S349, the main CPU 51 ends the error registration process and the table jump process, and moves the process to S56 of the medal acceptance / start check process (see FIG. 228).

  Further, for example, when the error content is “inserted medal retrograde error”, that is, when the error registration processing shown in FIG. 248 is the processing of S59 in the flowchart of medal acceptance / start check processing (see FIG. 228), jump The previous address is the return address + “relative position 6”, which is the leading address of the inserted medal retrograde error registration processing program (see FIG. 50). Therefore, in this case, the main CPU 51 causes the process to jump to the inserted medal retrograde error registration process in S344.

  In the inserted medal retrograde error registration process, the main CPU 51 registers (stores) the error code “6” corresponding to the “inserted medal retrograde error” in a predetermined storage area for error registration in the main RAM 53 (S350). At this time, the 7-segment display 6 displays information “Cr” corresponding to the error code “6” (information indicating the occurrence of the inserted medal retrograde error). After the process of S350, the main CPU 51 ends the error registration process and the table jump process, and moves the process to S56 of the medal acceptance / start check process (see FIG. 228).

  For example, when the error content is “auxiliary full error”, that is, when the error registration process shown in FIG. 248 is the process of S328 in the flowchart of the medal payout process (see FIG. 247), the jump destination address Becomes return address + “relative position 7”, which is the start address of the auxiliary storage full error registration processing program (see FIG. 50). Therefore, in this case, the main CPU 51 causes the process to jump to the auxiliary storage full error registration process in S344.

  In the auxiliary cabinet full error registration process, the main CPU 51 registers (stores) the error code “7” corresponding to “auxiliary cabinet full error” in a predetermined storage area for error registration in the main RAM 53 (S351). At this time, the 7-segment display 6 displays information “Co” corresponding to the error code “7” (information indicating the occurrence of an auxiliary storage full error). After the process of S351, the main CPU 51 ends the error registration process and the table jump process, and moves the process to S325 of the medal payout process (see FIG. 247).

  Further, for example, when the error content is “Illegal hit error”, that is, the error registration process (not shown) in which the error registration process shown in FIG. 248 is performed in the winning search process of S14 in the main flow (see FIG. 226). ), The jump destination address is the return address + “relative position 8”, which is the head address of the illegal hit error registration processing program (see FIG. 50). Therefore, in this case, the main CPU 51 causes the process to jump to the illegal hit error registration process in S344.

  In the illegal hit error registration process, the main CPU 51 registers (stores) the error code “8” corresponding to the “illegal hit error” in a predetermined storage area for error registration in the main RAM 53 (S352). At this time, the 7-segment display 6 displays information “EE” (information indicating the occurrence of an illegal hit error) corresponding to the error code “8”. After the process of S352, the main CPU 51 ends the error registration process and the table jump process, and shifts the process to a process performed after the error registration process in the winning search process (see FIG. 226) of S14.

  As described above, when the table jump process is CALLed in S331 of the error registration process of the present embodiment, the return address (reference address) is stored in the stack area in the main RAM 53. This process is executed by the main CPU 51. That is, in the present embodiment, the main CPU 51 also serves as means (reference address storage means) for storing the return address in the stack area when an error occurs.

  In S343 of the table jump process of the present embodiment described above, an error registration process program in the main ROM 52 is based on the return address and the relative position information of the error registration process program defined in the error registration process relative position table. The address of the storage area is calculated. This process is executed by the main CPU 51. That is, in the present embodiment, the main CPU 51 also serves as means (address calculating means) for calculating the address of the storage area for the error registration processing program in the main ROM 52.

  Furthermore, in S344 of the table jump process described above, a process for jumping the process to the address of the storage area of the error registration process program is performed, and this process is executed by the main CPU 51. That is, in the present embodiment, the main CPU 51 also serves as means (jump processing means) for jumping the processing to the address of the error registration processing program.

  In S345 or the like of the table jump process described above, an error code indicating the error content (type) corresponding to the error registration process program is stored in a predetermined area in the main RAM 53 in the process of the error registration process program at the jump destination. Processing is performed. This process is executed by the main CPU 51. That is, in this embodiment, the main CPU 51 also serves as means (error registration processing means) for storing an error code indicating the error content (type) in a predetermined area in the main RAM 53.

[RT control processing]
Next, the RT control process performed in S16 in the main flow (see FIG. 226) will be described with reference to FIG.

  First, the main CPU 51 refers to the RT transition table (see FIG. 16), and checks RT game state transition conditions that can be established in the transition (current) RT game state (S361).

  Next, the main CPU 51 determines whether or not the RT gaming state transition condition is satisfied (S362). In S362, when the main CPU 51 determines that the RT gaming state transition condition is not satisfied (when S362 is NO), the main CPU 51 performs the process of S364 described later.

  On the other hand, when the main CPU 51 determines in S362 that the RT gaming state transition condition is satisfied (when S362 is YES), the main CPU 51 refers to the RT transition table (see FIG. 16) and transitions. Based on the conditions, the destination RT gaming state flag is set to a predetermined bit in the gaming state flag storage area (see FIG. 52), and the gaming state flag storage area is updated (S363).

  After the process of S363 or when S362 is NO, the main CPU 51 performs a display command transmission process (S364). Specifically, the main CPU 51 transmits a display command to the sub control circuit 42. The display command includes parameters that specify a display combination, a payout number, and the like. After the process of S364, the main CPU 51 ends the RT control process, and moves the process to S17 of the main flow (see FIG. 226).

[Game control processing at the end of the game]
Next, with reference to FIG. 252, the game end effect control process performed in S17 in the main flow (see FIG. 226) will be described.

  First, the main CPU 51 refers to the output condition table (see FIG. 46) and outputs a jackpot signal (S371). Next, the main CPU 51 determines whether or not the RT gaming state is the RT2 gaming state (S372). In S372, when the main CPU 51 determines that the RT gaming state is not the RT2 gaming state (when S372 is NO), the main CPU 51 performs the process of S381 described later.

  On the other hand, when the main CPU 51 determines that the RT gaming state is the RT2 gaming state in S372 (when S372 is YES), the main CPU 51 determines whether or not the type of gaming lock is “game locking 9”. Is discriminated (S373). In S373, when the main CPU 51 determines that the type of game lock is “game lock 9” (when S373 is YES), the main CPU 51 ends the effect control process at the end of the game, and the process proceeds to the main flow. The process proceeds to S18 of (see FIG. 226).

  On the other hand, when the main CPU 51 determines in S373 that the type of game lock is not “game lock 9” (when S373 is NO), the main CPU 51 determines whether or not the internal winning combination is “normal lip”. Is discriminated (S374). In S374, when the main CPU 51 determines that the internal winning combination is not “normal lip” (when S374 is NO), the main CPU 51 ends the effect control process at the end of the game, and the process proceeds to the main flow (FIG. 226). (Refer to S18).

  On the other hand, when the main CPU 51 determines in S374 that the internal winning combination is “normal lip” (S374 is YES), the main CPU 51 determines whether or not the value of the output counter is “0”. Is discriminated (S375). In S375, when the main CPU 51 determines that the value of the output counter is not “0” (when S375 is NO), the main CPU 51 performs the process of S377 described later.

  On the other hand, when the main CPU 51 determines that the value of the output counter is “0” in S375 (when S375 is YES), the main CPU 51 sets “3” in the output counter (S376). .

  After the processing of S376 or when S375 is NO, the main CPU 51 refers to the subtraction condition table (see FIG. 47) and determines whether or not the subtraction condition is satisfied (S377). In S377, when the main CPU 51 determines that the subtraction condition is not satisfied (when S377 is NO), the main CPU 51 performs processing of S381 described later.

  On the other hand, when the main CPU 51 determines in S377 that the subtraction condition is satisfied (when S377 is YES), the main CPU 51 subtracts “1” from the value of the output counter (S378).

  Next, the main CPU 51 determines whether or not the value of the output counter is “0” (S379). In S379, when the main CPU 51 determines that the value of the output counter is not “0” (in the case where S379 is NO), the main CPU 51 ends the game end effect control process, and the process proceeds to the main flow (FIG. 226)).

  On the other hand, when it is determined in S379 that the value of the output counter is “0” (S379 is YES), the main CPU 51 turns on the output of the big hit signal “3” (S380). As a result, the jackpot signal “3” is transmitted to the hall computer / calling device 100 (see FIG. 4).

  After the processing of S380, or when S372 or S377 is NO, the main CPU 51 sets “0” to the output counter (S381). After the process of S381, the main CPU 51 ends the game end effect control process, and moves the process to S18 of the main flow (see FIG. 226).

  As described above, in this embodiment, when the RT gaming state is shifted to the RT2 gaming state, “3” is set in the output counter, and the value of the output counter is set to “1” every time the subtraction condition is satisfied. Subtract. When the value of the output counter becomes “0”, the output of the big hit signal “3” is turned on. That is, in the RT2 gaming state, unless the subtraction condition is satisfied three times, the output of the big hit signal “3” is not turned on. As a result, even if the “ART” is not won, such as when the recommended stop operation has not been performed, even if the RT2 gaming state is erroneously entered, the big hit signal “3” is immediately sent to the hall computer / calling device. 100 (see FIG. 4).

[Bonus end check process]
Next, with reference to FIG. 253, the bonus end check process performed in S19 in the main flow (see FIG. 226) will be described.

  First, the main CPU 51 determines whether or not “BB” (“BB1” to “BB3”) is in operation with reference to the gaming state flag storage area (see FIG. 52) (S391). In S391, when the main CPU 51 determines that “BB” is not in operation (in the case where S391 is NO), the main CPU 51 ends the bonus end check process, and the process proceeds to S20 of the main flow (see FIG. 226). Move to.

  On the other hand, when the main CPU 51 determines in S391 that “BB” is in operation (when S391 is YES), the main CPU 51 determines whether or not the value of the bonus end number counter is less than “0”. Is discriminated (S392).

  In S392, when the main CPU 51 determines that the value of the bonus end number counter is less than “0” (S392 is YES), the main CPU 51 performs a bonus end time process (S393). In this process, the main CPU 51 clears the bonus end number counter and turns off the gaming state flag (BB gaming state flag) corresponding to “BB” in operation. If the value of the bonus end number counter is less than “0”, it means that the number of medals paid out exceeds 263 (BB1), 60 (BB2), or 14 (BB3) during the BB gaming state. To do.

  Next, the main CPU 51 performs a bonus end command transmission process (S394). In this process, the main CPU 51 transmits a bonus end command to the sub-control circuit 42. The bonus end command includes information indicating that the bonus game has ended.

  Next, the main CPU 51 performs an initialization process at the end of the bonus (S395). The range of the area of the main RAM 53 that is cleared by this initialization processing is the range from the last address (tail address) in the main RAM area shown in FIG. 5 to the “bonus end” address (start address). Therefore, in the process of S395, the “bonus end” address (see FIG. 5) indicating the start address of the range to be initialized in the main RAM 53 from the bonus end check process program to the initialization process program is an argument (see FIG. 5). Argument address). The details of the initialization process will be described later with reference to FIG. After the process of S395, the main CPU 51 ends the bonus end check process, and moves the process to S20 of the main flow (see FIG. 226).

  On the other hand, when the main CPU 51 determines that the value of the bonus end number counter is not less than “0” in S392 (when S392 is NO), the main CPU 51 sets the respective values of the winning number counter and the possible game number counter. Update (S396). The value of the winning count counter is decremented by “1” when a small role (a medal payout) is displayed, and the value of the possible number of games counter is “1” for one game regardless of the stop symbol. Subtracted.

  Next, the main CPU 51 determines whether or not the value of the winning number counter or the value of the possible game number counter is “0” (S397). In S397, when the main CPU 51 determines that the value of the winning number counter or the value of the possible game number counter is not “0” (when S397 is NO), the main CPU 51 ends the bonus end check process. The process proceeds to S20 of the main flow (see FIG. 226).

  On the other hand, when the main CPU 51 determines in S397 that the value of the winning number counter or the value of the possible game number counter is “0” (when S397 is YES), the main CPU 51 performs processing at the end of RB. (S398). Specifically, processing such as turning off the gaming state flag (RB gaming state flag) corresponding to “RB”, clearing the winning possible number counter and the gaming possible number counter, and the like are performed. Thereafter, the main CPU 51 ends the bonus end check process, and moves the process to S20 of the main flow (see FIG. 226).

[Initialization]
Next, referring to FIG. 254, S2 in the main flow (see FIG. 226), S41 in the flowchart of the power interruption recovery process (see FIG. 227), and the flowchart of the bonus end check process (see FIG. 253) The initialization process performed in S395 will be described.

  First, the main CPU 51 clears based on the initialization address (any one of “one game end” address, “setting change” address and “bonus end” address in the main RAM area shown in FIG. 5) acquired as an argument. The initial value of the counter (counter) is calculated (S401).

  The clear counter is a counter that counts the number of executions of the PUSH instruction (the number of executions of data clear processing in S403 described later), and is provided in the main RAM 53. In the present embodiment, as described above, by executing the PUSH instruction once, the 2-byte data stored in the main RAM 53 is cleared and the 2-byte address update process is performed. Therefore, in the process of S401, the main CPU 51 sets the value of ½ of the number of bytes in the range (clear range) from the last address (tail address) to the initialization address (start address) in FIG. Set as initial value.

  In the present embodiment, an example has been described in which the tail address of the target address range (clear range) of the initialization process in the main RAM 53 is the final address in FIG. 5, but the present invention is not limited to this. The tail address of the storage area in which data used in the program for calling the initialization process is stored may be used as the tail address of the target address range (clear range) of the initialization process. For example, the address immediately before the top address of the stack area may be used as the tail address of the target address range (clear range) of the initialization process. In the present embodiment, the target address range of the initialization process is independent of the type of initialization address (any one of “one game end” address, “setting change” address, and “bonus end” address shown in FIG. 5). Although the example in which the tail address in the (clear range) is the final address in FIG. 5 has been described, the present invention is not limited to this. Depending on the type of the initialization address, the tail address of the target address range (clear range) of the initialization process may be changed as appropriate.

  Next, the main CPU 51 saves the return address of the initialization process in a predetermined register (S402). At this time, as the predetermined register, a register that is not used in the PUSH instruction execution process described later is used. Note that the return address of the initialization process differs depending on the process for calling the initialization process.

  Next, the main CPU 51 executes a PUSH instruction, and data for 2 bytes (data stored in the main RAM 53) from the address (final address or updated address) set in the stack pointer (start address storage unit). Is cleared (S403). At this time, the address set in the stack pointer is also updated by the execution of the PUSH instruction. Specifically, address update processing for 2 bytes (processing for subtracting “2” from the address) is performed.

  Next, the main CPU 51 updates the value of the clear counter (“1” subtraction) (S404). Next, the main CPU 51 determines whether or not the value of the clear counter is “0” (S405).

  In S405, when the main CPU 51 determines that the value of the clear counter is not “0” (when S405 is NO), the main CPU 51 returns the process to S403 and repeats the processes after S403. On the other hand, when the main CPU 51 determines that the counter counter value is “0” in S405 (when S405 is YES), the main CPU 51 sets a predetermined address in the stack area to the stack pointer (SP). (S406).

  Next, the main CPU 51 sets the return address of the initialization process saved in S402 in the stack area of the predetermined address set in the stack pointer in S406 (S407). After the process of S407, the main CPU 51 ends the initialization process, and shifts the process to a process performed after the initialization process in the process flow that called the initialization process.

  As described above, in S403 of the initialization process of the present embodiment, the execution of one predetermined instruction (PUSH instruction) clears the 2-byte information stored in the main RAM 53 and clears the information. The processing start address is updated by 2 bytes. This process is executed by the main CPU 51. That is, in the present embodiment, the main CPU 51 executes means for clearing information for 2 bytes stored in the main RAM 53 and updating the address for 2 bytes by one predetermined instruction (clear processing means). Doubles as

  In S403 to S405 of the initialization process described above, the 2-byte information clearing process and the 2-byte address updating process are repeated from the tail address of the predetermined address range in the main RAM 53 toward the head address. As a result, all information in the predetermined address range is cleared. This process is executed by the main CPU 51. In other words, in the present embodiment, the main CPU 51 also serves as means (repetition processing means) for repeating the clearing process of the information for 2 bytes stored in the main RAM 53 and the update process for the address of 2 bytes.

[Bonus activation check process]
Next, with reference to FIG. 255, the bonus operation check process performed in S20 in the main flow (see FIG. 226) will be described.

  First, the main CPU 51 determines whether or not “BB” (“BB1” to “BB3”) is operating (S411). In S411, when the main CPU 51 determines that “BB” is not in operation (when S411 is NO), the main CPU 51 performs the process of S414 described later.

  On the other hand, when the main CPU 51 determines that “BB” is in operation in S411 (when S411 is YES), the main CPU 51 determines whether “RB” is in operation (S412). ). In S412, when the main CPU 51 determines that “RB” is in operation (in the case where S412 is YES), the main CPU 51 ends the bonus operation check process, and the process of the main flow (see FIG. 226). Move to S2.

  On the other hand, when the main CPU 51 determines that “RB” is not in operation in S 412 (when S 412 is NO), the main CPU 51 performs RB operation processing based on the bonus operation table (see FIG. 15). (S413). Then, after the process of S413, the main CPU 51 ends the bonus operation check process, and moves the process to S2 of the main flow (see FIG. 226).

  If S411 is NO, the main CPU 51 determines whether or not the bonus game is a win (S414). In S414, when the main CPU 51 determines that the bonus game is not a win (when S414 is NO), the main CPU 51 performs a process of S418 described later.

  On the other hand, when the main CPU 51 determines in S414 that the bonus game is a winning game (when S414 is YES), the main CPU 51 determines the winning bonus game based on the bonus operating time table (see FIG. 15). A corresponding bonus activation process is performed (S415). In this embodiment, in this process, the main CPU 51 refers to the bonus operating time table (see FIG. 15), sets “1” to the corresponding bit in the gaming state flag storage area (see FIG. 52), The value of the bonus end number counter is set to a predetermined value (“263” for “BB1”, “60” for “BB2”, “14” for “BB3”). Further, in this process, the RB operation process described in S413 is also performed.

  Next, the main CPU 51 clears the value of the carryover combination storage area (S416). Next, the main CPU 51 performs a bonus start command transmission process (S417). In this process, the main CPU 51 transmits a bonus start command to the sub-control circuit 42. The bonus start command includes information indicating that the bonus game has started. After the process of S417, the main CPU 51 ends the bonus operation check process, and moves the process to S2 of the main flow (see FIG. 226).

  If S414 is NO, the main CPU 51 determines whether or not the winning combination related to replaying is a winning (S418). In S418, when the main CPU 51 determines that the winning part related to the replay is not winning (when S418 is NO), the main CPU 51 ends the bonus operation check process, and the process of the main flow (see FIG. 226). Move to S2.

  On the other hand, when the main CPU 51 determines in S418 that the winning combination related to replaying is a win (when S418 is YES), the main CPU 51 requests automatic insertion of medals (S419). That is, the main CPU 51 copies the insertion number counter to the automatic insertion number counter. After the process of S419, the main CPU 51 ends the bonus operation check process, and moves the process to S2 of the main flow (see FIG. 226).

[Interrupt processing under the control of the main CPU (1.1172 msec)]
Next, with reference to FIG. 256, for example, interrupt processing by control of the main CPU 51 performed in S11 in the main flow (see FIG. 226) will be described.

  First, the main CPU 51 saves the register (S421). Next, the main CPU 51 performs input port check processing (S422). In this process, signals input from various switches such as the stop switch 17S are checked.

  Next, the main CPU 51 performs timer update processing (S423). In this process, for example, the main CPU 51 performs a process of subtracting the value of the lock timer for each interrupt process. Next, the main CPU 51 performs communication data transmission processing (S424). In this processing, various commands are mainly transmitted to the main control circuit 41 and the sub control circuit 42 as appropriate.

  Next, the main CPU 51 performs a reel control process (S425). In this process, the main CPU 51 starts rotation of the left reel 3L, the middle reel 3C, and the right reel 3R when the start of rotation of all the reels is requested, and thereafter, each reel rotates at a constant speed. The three stepping motors 61L, 61C, 61R are driven and controlled. When the number of sliding symbols is determined, the main CPU 51 updates the symbol counter of the corresponding reel by the number of sliding symbols. The main CPU 51 waits for the updated symbol counter to match the value corresponding to the planned stop position (the symbol at the planned stop position reaches the area on the effective line of the display window), and The corresponding stepping motor is driven and controlled so that the rotation is decelerated and stopped. In the present embodiment, in the process of S425, not only the above-described normal acceleration process, constant speed process and stop process, but also a reel effect pattern is set when a reel effect pattern is set during the acceleration process. Reel effect (reel action) and lock control processing are also performed.

  Next, the main CPU 51 performs a lamp and 7-segment driving process (S426). In this process, the main CPU 51 controls the 7-segment display 6 to display the number of payouts and the number of credits. Next, the main CPU 51 performs a register restoration process (S427). After that, the main CPU 51 ends the interrupt process.

[Power failure detection process controlled by main CPU]
Next, with reference to FIG. 257, a power interruption detection process executed by the main CPU 51 as an interrupt process when a power interruption occurs will be described.

  First, the main CPU 51 sets an interruption occurrence flag (1 byte) to an on state (S431). Next, the main CPU 51 sets a check start address in the stack pointer (SP) (S432).

  The calculation range of the sum value performed in the power interruption detection process is the range indicated by the broken line arrow in the main RAM area shown in FIG. 5, as in the power interruption recovery process (see FIG. 227) described above. That is, also in the power failure detection process, the address (head address) of the storage area of the power failure occurrence flag from the address (head address) of the storage area next to the storage area of the checksum sum value (2 bytes) in the main RAM area (tail) The range up to (address) is the sum value calculation range. In the process of S432, the main CPU 51 sets the start address of the sum value calculation range, that is, the address of the storage area next to the check sum value storage area, as the check start address.

  Next, the main CPU 51 sets a predetermined value (initial value) in the check counter (S433). In this process, the main CPU 51 sets a value that is ½ of the number of bytes in the calculation range of the sum value as an initial value of the check counter.

  Next, the main CPU 51 executes the POP instruction to acquire 2 bytes of data (data stored in the main RAM 53) from the address (check start address or updated address) set in the stack pointer (S434). ). At this time, the address set in the stack pointer is also updated by execution of the POP instruction. Specifically, an address update process for 2 bytes (a process of adding “2” to the address) is performed.

  Next, the main CPU 51 performs a sum calculation using the 2-byte data acquired in S434 (S435). In this process, the main CPU 51 sequentially adds the data acquired this time to the sum value calculated in the previous process of S435. In the first sum calculation, the sum value of the 2-byte data acquired in S434 is calculated. Next, the main CPU 51 updates the value of the check counter (“1” subtraction) (S436).

  Next, the main CPU 51 determines whether or not the value of the check counter is “0” (S437). In S437, when the main CPU 51 determines that the value of the check counter is not “0” (when S437 is NO), the main CPU 51 returns the process to S434 and repeats the processes after S434.

  On the other hand, when the main CPU 51 determines in S437 that the value of the check counter is “0” (in the case where S437 is YES), the main CPU 51 uses the sum value calculated by the repetitive processing of S434 to S437. The data is stored in the checksum storage area (see FIG. 5) in the main RAM area (S438).

<Description of operation of sub-control circuit>
Next, the contents of various processes (tasks) executed by the sub CPU 81 of the sub control circuit 42 using a program will be described with reference to FIGS. Various tables necessary for various processes of the sub CPU 81 described below are stored in the sub ROM 82, and various control flags, various control counters, various storage areas and the like are provided in the sub RAM 83 and the like.

[Main board communication task]
First, the main board communication task executed by the sub CPU 81 will be described with reference to FIG.

  First, the sub CPU 81 performs reception check of the command transmitted from the main control circuit 41 (S501). Next, when receiving a command, the sub CPU 81 extracts the type of the received command (S502).

  Next, the sub CPU 81 determines whether or not a command different from the previous command is received (S503). When the sub CPU 81 determines in S503 that the command different from the previous command has not been received (when S503 is NO), the sub CPU 81 returns the process to S501 and repeats the processes after S501.

  On the other hand, when it is determined in S503 that the sub CPU 81 has received a command different from the previous one (when S503 is YES), the sub CPU 81 stores a message in the message queue based on the received command (S504). ). The message queue is a mechanism for exchanging information between processes. Then, after the processing of S504, the sub CPU 81 returns the processing to S501 and repeats the processing after S501.

[Direction registration task]
Next, an effect registration task executed by the sub CPU 81 will be described with reference to FIG.

  First, the sub CPU 81 extracts a message from the message queue (S511). Next, the sub CPU 81 determines whether there is a message in the message queue (S512). In S512, when the sub CPU 81 determines that there is no message in the message queue (when S 512 is NO), the sub CPU 81 performs a process of S515 described later.

  On the other hand, when the sub CPU 81 determines in S512 that there is a message in the message queue (when S512 is YES), the sub CPU 81 copies game information from the message (S513). In this process, for example, various data such as an internal winning combination, a type of reel that has stopped rotating, a display combination, and a game state flag specified by parameters are copied to a storage area (not shown) provided in the sub RAM 83. The

  Next, the sub CPU 81 performs effect content determination processing (S514). In this process, the sub CPU 81 determines the contents of the effect, registers the effect data, and the like according to the type of the received command. Details of the effect content determination process will be described later with reference to FIG. 260 described later.

  Next, the sub CPU 81 registers animation data (S515). Next, the sub CPU 81 registers sound data (S516). Next, the sub CPU 81 registers lamp data (S517). These registration processes are performed based on the effect data registered in the effect content determination process in S514. After the processing of S517, the sub CPU 81 returns the processing to S511, and repeats the processing after S511.

[Production content decision processing]
Next, with reference to FIG. 260, the effect content determination process performed in S514 in the flowchart of the effect registration task (see FIG. 259) will be described.

  First, the sub CPU 81 determines whether or not a start command is received (S521).

  When the sub CPU 81 determines in S521 that the start command is being received (S521 is YES), the sub CPU 81 performs a start command receiving process (S522). In this process, the sub CPU 81 extracts a random number for production, determines the production number by lottery based on the internal winning combination and the like and registers it. Here, the production number is data for designating the content of the production to be executed this time. Details of the start command reception process will be described later with reference to FIG.

  Next, the sub CPU 81 registers start effect data in accordance with the registered effect number (S523). The effect data is data that designates animation data, sound data, and lamp data. Therefore, when the effect data is registered, the corresponding animation data and the like are determined, and effects such as display of video are executed. After the process of S523, the sub CPU 81 ends the effect content determination process, and moves the process to S515 of the effect registration task (see FIG. 259).

  On the other hand, when the sub CPU 81 determines in S521 that the start command is not received (S521 is NO), the sub CPU 81 determines whether or not the reel stop command is received (S524).

  When the sub CPU 81 determines in S524 that the reel stop command is being received (when S524 is YES), the sub CPU 81 determines the stop time according to the registered effect number and the type of the operation stop button. The effect data is registered (S525). Thereafter, the sub CPU 81 ends the effect content determination process, and moves the process to S515 of the effect registration task (see FIG. 259).

  On the other hand, when the sub CPU 81 determines in S524 that the reel stop command is not received (when S524 is NO), the sub CPU 81 determines whether or not the display command is received (S526).

  When the sub CPU 81 determines in S526 that the display command is being received (S526 is YES), the sub CPU 81 performs a display command receiving process (S527). Details of the display command reception process will be described later with reference to FIG. 268 described later.

  Next, the sub CPU 81 registers the effect data at the time of display according to the registered effect number and display combination (S528). Thereafter, the sub CPU 81 ends the effect content determination process, and moves the process to S515 of the effect registration task (see FIG. 259).

  On the other hand, when the sub CPU 81 determines in S526 that the display command is not received (when S526 is NO), the sub CPU 81 determines whether or not it is a payout end command reception (S529). In S529, when the sub CPU 81 determines that it is time to receive a payout end command (when S529 is YES), the sub CPU 81 performs payout end command reception processing (S530). Thereafter, the sub CPU 81 ends the effect content determination process, and moves the process to S515 of the effect registration task (see FIG. 259).

  On the other hand, when the sub CPU 81 determines in S529 that it is not at the time of receiving the payout end command (when S529 is NO), the sub CPU 81 determines whether or not it is at the time of receiving the bonus start command (S531).

  When the sub CPU 81 determines in S531 that the bonus start command is being received (when S531 is YES), the sub CPU 81 registers effect data for starting the bonus (S532). Thereafter, the sub CPU 81 ends the effect content determination process, and moves the process to S515 of the effect registration task (see FIG. 259).

  On the other hand, when the sub CPU 81 determines in S531 that the bonus start command is not received (S531 is NO), the sub CPU 81 determines whether or not the bonus end command is received (S533). When the sub CPU 81 determines in S533 that the bonus end command has been received (YES in S533), the sub CPU 81 registers the bonus end effect data (S534). Thereafter, the sub CPU 81 ends the effect content determination process, and moves the process to S515 of the effect registration task (see FIG. 259).

  On the other hand, when the sub CPU 81 determines in S533 that the bonus end command is not received (when S533 is NO), the sub CPU 81 determines whether or not it is a no-operation command reception (S535). In S535, when the sub CPU 81 determines that it is not a no-operation command reception (when S535 is NO), the sub CPU 81 ends the effect content determination process, and the process of the effect registration task (see FIG. 259). Move to S515.

  On the other hand, when it is determined in S535 that the sub CPU 81 is receiving a no-operation command (when S535 is YES), the sub CPU 81 performs a no-operation command receiving process (S536). The details of the no-operation command reception process will be described later with reference to FIG. After the process of S536, the sub CPU 81 ends the effect content determination process, and moves the process to S515 of the effect registration task (see FIG. 259).

[Start command reception processing]
Next, with reference to FIG. 261, the start command reception process performed in S522 in the flowchart of the effect content determination process (see FIG. 260) will be described. In this embodiment, the start command reception process described below is executed by the sub-control circuit 42.

  First, the sub CPU 81 performs lottery flag determination processing (S541). The details of the lottery flag determination process will be described later with reference to FIG.

  Next, the sub CPU 81 performs a mode lottery process (S542). In the present embodiment, when the sub gaming state is the “general state”, a plurality of modes having different probabilities of winning the “CZ (chance zone)” are provided. In the process of S542, a lottery of a plurality of modes in this “general state” is performed. In this transition lottery, a mode lottery table (not shown) in which lottery values for each mode are set according to the internal winning combination is used.

  Next, the sub CPU 81 performs CZ lottery processing (S543). In this process, a CZ lottery table (not shown) in which a lottery value of “CZ (chance zone)” is set according to the internal winning combination and mode is used.

  Next, the sub CPU 81 performs an ART lottery process (S544). The details of the ART lottery process will be described later with reference to FIG. Next, the sub CPU 81 performs ART processing (S545). The details of the ART processing will be described later with reference to FIG. 264 described later.

  Next, the sub CPU 81 performs a VR lottery process (S546). The details of the VR lottery process will be described later with reference to FIG. Next, the sub CPU 81 performs an effect determination process (S547). The details of the effect determination process will be described later with reference to FIG. Then, after the process of S547, the sub CPU 81 ends the process at the time of receiving the start command, and moves the process to S523 of the effect content determination process (see FIG. 260).

[Lottery flag decision processing]
Next, with reference to FIG. 262, the lottery flag determination process performed in S541 in the flowchart of the start command reception process (see FIG. 261) will be described. In the present embodiment, the lottery flag determination process described below is executed by the sub control circuit 42.

  First, the sub CPU 81 changes the data pointer for small role / replay based on the special flag lottery table (see FIG. 62) (S551). Next, the sub CPU 81 determines whether or not the small role / replay data pointer is “9” (S552).

  When the sub CPU 81 determines that the small role / replay data pointer is “9” in S552 (when S552 is YES), the sub CPU 81 determines based on lottery (winning with a probability of 1/10). The small role / replay data pointer is changed to “40” (S553). After the processing of S553, the sub CPU 81 performs processing of S556 described later.

  On the other hand, when the sub CPU 81 determines that the small role / replay data pointer is not “9” in S552 (when S552 is NO), the sub CPU 81 determines that the small role / replay data pointer is “43”. It is determined whether or not there is (S554). In S554, when the sub CPU 81 determines that the small role / replay data pointer is not “43” (in the case where S554 is NO), the sub CPU 81 performs the process of S556 described later.

  On the other hand, when the sub CPU 81 determines that the small role / replay data pointer is “43” in S554 (when S554 is YES), the sub CPU 81 performs lottery (winning with a probability of 1/2). Based on this, the small role / replay data pointer is changed to “42” (S555).

  After the processing of S553 or S555, or when S554 is NO, the sub CPU 81 determines various lottery flags based on the various lottery flag lottery tables (see FIGS. 63 to 75) and stores them in the sub RAM 83 ( S556). After the process of S556, the sub CPU 81 ends the lottery flag determination process, and moves the process to S542 of the start command reception process (see FIG. 261).

[ART lottery processing]
Next, with reference to FIG. 263, the ART lottery process performed in S544 in the flowchart of the start command reception process (see FIG. 261) will be described.

  First, the sub CPU 81 is based on various ART lottery tables (see FIGS. 76 to 93, FIGS. 97 to 101, FIGS. 103 to 126, FIGS. 128 to 135, FIGS. 141, 142, 144, and 145). Then, ART lottery is performed (S561). Next, the sub CPU 81 determines whether or not the lottery result is “0” (out of line) (S562). In S562, when the sub CPU 81 determines that the lottery result is “0” (when S562 is YES), the sub CPU 81 ends the ART lottery process and starts the process when the start command is received (see FIG. 261). ) To S545.

  On the other hand, when the sub CPU 81 determines that the lottery result is not “0” in S562 (when S562 is NO), the sub CPU 81 determines whether or not the lottery result stock content determination table (see FIG. 149). The winning content is checked (S563).

  Next, the sub CPU 81 determines whether or not “B_ART” or “D_ART” has been won (S564). In S564, when the sub CPU 81 determines that “B_ART” or “D_ART” has not been won (when S564 is NO), the sub CPU 81 performs a process of S566 described later.

  On the other hand, when it is determined in S564 that the sub CPU 81 has won “B_ART” or “D_ART” (YES in S564), the sub CPU 81 determines the ART stock area allocation lottery table (FIGS. 94, 95, FIG. 137 to 140), the ART stock area is determined based on the lottery flag (S565). That is, by this process, one of the ART stock area A and the ART stock area B is determined as the ART stock area for storing the winning information of “B_ART” or “D_ART”.

  After the processing of S565 or when S564 is NO, the sub CPU 81 refers to the table number determination table (see FIGS. 96, 102, 127, 136, 143, and 146), and determines the ART lottery table. A table number is acquired based on the type and lottery flag (S566).

  Next, the sub CPU 81 stores the corresponding winning information in the storage area corresponding to the winning content in the sub storage area (S567). For example, when “B_ART” or “D_ART” is won, the winning information (ART identification information and table number) is stored in the ART stock area A or ART stock area B determined in S565. If “G_ART” is won, the winning information (the table number and the ART mode at the time of stock) is stored in the combined stock area. If “R_ART” is won, “1” is set to the rocket flag. When “VR (Viking Rush)” is won, “1” is added to the VR stock counter.

  Next, the sub CPU 81 determines the number of ART precursor games based on the precursor game number lottery table (see FIGS. 170 to 175), and sets the value in the ART precursor counter (S568). Then, after the processing of S568, the sub CPU 81 ends the ART lottery processing, and moves the processing to S545 of the start command reception processing (see FIG. 261).

[Processing during ART]
Next, with reference to FIG. 264, the ART in-process that is performed in S545 in the flowchart of the start command reception process (see FIG. 261) will be described.

  First, the sub CPU 81 determines whether or not “B_ART” is in operation (S571). In S571, when the sub CPU 81 determines that “B_ART” is in operation (in the case where S571 is YES), the sub CPU 81 performs the number-of-games lottery process (S572). In this process, when the number of added games is determined, the determined number of added games is added to the ART game number counter. After the processing of S572, the sub CPU 81 ends the ART processing, and moves the processing to S546 of the start command reception processing (see FIG. 261).

  On the other hand, when the sub CPU 81 determines that “B_ART” is not operating in S571 (when S571 is NO), the sub CPU 81 determines whether or not “D_ART” is operating (S573). . In S573, when the sub CPU 81 determines that “D_ART” is not in operation (NO in S 573), the sub CPU 81 ends the ART processing, and executes the start command reception processing (see FIG. 261). To S546.

  On the other hand, when the sub CPU 81 determines that “D_ART” is in operation in S573 (when S573 is YES), the sub CPU 81 performs continuous stock lottery processing (S574). In this process, when the continuation stock is determined, “1” is added to the continuation stock counter. After the processing of S574, the sub CPU 81 ends the ART processing, and moves the processing to S546 of the start command reception processing (see FIG. 261).

[VR related processing]
Next, with reference to FIG. 265, the VR related processing performed in S546 in the flowchart of the start command reception processing (see FIG. 261) will be described.

  First, the sub CPU 81 determines whether or not “VR (hiking rush)” is in operation (S581). When the sub CPU 81 determines in S581 that “VR (hiking rush)” is not in operation (in the case where S581 is NO), the sub CPU 81 determines whether or not “game lock 9” is won ( S582). That is, it is determined whether or not the data stored in bit 0 of the game lock flag storage area 2 (see FIG. 57) is “1”.

  In S582, when the sub CPU 81 determines that “game lock 9” is not winning (when S 582 is NO), the sub CPU 81 ends the VR-related processing, and starts the processing when the start command is received (see FIG. 261). ) To S547.

  On the other hand, in S582, when the sub CPU 81 determines that “game lock 9” is a win (when S 582 is YES), the sub CPU 81 determines the VR lock billy touch correct / incorrect answer lottery table (FIG. 150). Based on the reference, touch correspondence (correct answer content or incorrect answer content of touch operation: first selection correspondence information) is determined (S583). Then, after the process of S583, the sub CPU 81 ends the VR related process, and moves the process to S547 of the start command reception process (see FIG. 261).

  Here, returning to the description of the processing of S581 again, in S581, when the sub CPU 81 determines that “VR (hiking rush)” is in operation (in the case where S581 is YES), the sub CPU 81 determines that the VR is VR. Based on the middle revolution lottery table (see FIGS. 155 to 169), whether or not the revolution is activated is determined, and the value of the VR middle revolution flag is set (S584).

  Next, the sub CPU 81 determines touch correspondence (correct content or incorrect content of touch operation: first selection correspondence information) based on the VR billy touch lottery table (see FIGS. 151 to 154) (S585). . Then, after the process of S585, the sub CPU 81 ends the VR related process and moves the process to S547 of the start command reception process (see FIG. 261).

[Direction determination processing]
Next, with reference to FIG. 266, the effect determination process performed in S547 in the flowchart (see FIG. 261) of the start command reception process will be described.

  First, the sub CPU 81 determines whether or not a continuous effect (continuation game) is in operation (S601). In this process, if the value of “Scenario No.” or “Map No.” is other than “0”, the sub CPU 81 determines that the continuous effect (continuous game) is in operation.

  In S601, when the sub CPU 81 determines that the continuous effect (continuous game) is not in operation (when S601 is NO), the sub CPU 81 performs effect lottery processing (S602). In this effect lottery process, the sub CPU 81 refers to an effect lottery table (not shown), determines an “effect No.” (including development effects) based on the lottery flag, the number of precursor games, and the like. “Production No.” is set in the sub-RAM 83. The development effect in the present embodiment includes a title display game and a continuous effect (continuation game) that follows the title display game.

  Next, the sub CPU 81 determines whether or not the “production No.” determined in S602 is an advanced production (S603). In S603, when the sub CPU 81 determines that the “production No.” determined in S602 is not the development effect (in the case where S603 is NO), the sub CPU 81 ends the effect determination process and receives a start command. The processing (see FIG. 261) is also terminated.

  On the other hand, in S603, when the sub CPU 81 determines that the “production No.” determined in S602 is the development effect (when S603 is YES), the sub CPU 81 has the determined “production No.”. Then, it is determined whether or not the “production No.” corresponding to the development production 1 (S604).

  In S604, when the sub CPU 81 determines that the determined “production No.” is the “production No.” corresponding to the development effect 1 (when S604 is YES), the sub CPU 81 determines the development effect 1 The title lottery process is performed with reference to the title lottery table (see FIG. 176) (S605). With this process, the “title No.” for the development effect 1 is determined, and the “title No.” is registered in the sub RAM 83.

  Next, the sub CPU 81 performs scenario lottery processing with reference to a scenario lottery table (not shown) (S606). With this processing, the “scenario No.” for the development effect 1 is determined, and the “scenario No.” is registered in the sub RAM 83. After the process of S606, the sub CPU 81 ends the effect determination process and also ends the start command reception process (see FIG. 261).

  On the other hand, when the sub CPU 81 determines in S604 that the determined “production No.” is not the “production No.” corresponding to the development effect 1 (when S604 is NO), the sub CPU 81 is determined. It is determined whether the “production No.” is the “production No.” corresponding to the development production 2 (S607).

  In S607, when the sub CPU 81 determines that the determined “production No.” is not the “production No.” corresponding to the development effect 2 (when S607 is NO), the sub CPU 81 performs the effect determination process. At the same time, the start command reception process (see FIG. 261) also ends.

  On the other hand, when the sub CPU 81 determines in S607 that the determined “production No.” is the “production No.” corresponding to the development effect 2 (when S607 is YES), the sub CPU 81 develops. With reference to the effect 2 title lottery table (see FIG. 196), a title lottery process is performed (S608). By this process, the “title No.” for the development effect 2 is determined, and the “title No.” is registered in the sub RAM 83.

  Next, the sub CPU 81 performs map lottery processing with reference to the map lottery table for development effect 2 (see FIGS. 197 and 198) (S609). With this processing, the “map No.” for the development effect 2 is determined, and the “map No.” is registered in the sub RAM 83. Then, after the process of S609, the sub CPU 81 ends the effect determination process and also ends the start command reception process (see FIG. 261).

  Here, returning to the description of the processing of S601 again, in S601, when the sub CPU 81 determines that the continuous effect (continuation game) is in operation (when S601 is YES), the sub CPU 81 determines that the continuous game is continued. “1” is added to the number counter (S610). The value of the continuation game number counter is set to “0” when “scenario No.” or “map No.” is cleared. Thereby, the value of the continuation game number counter becomes “1” by adding “1” when the game is started.

  Next, the sub CPU 81 determines whether or not “Scenario No.” is “0” (S611).

  In S611, when the sub CPU 81 determines that the “scenario No.” is not “0” (when S 611 is NO), the sub CPU 81 performs a scenario rewriting lottery process (S612). In the scenario rewriting lottery process, the sub CPU 81 refers to the scenario rewriting lottery table (see FIGS. 180 to 195) and determines whether or not to rewrite the “scenario No.” based on the currently registered “scenario No.”. Is determined by lottery. When it is determined to rewrite “scenario No.”, the sub CPU 81 changes “scenario No.” to the rewriting destination value.

  Next, the sub CPU 81 performs an effect determination process during the scenario (S613). In the effect determination process during the scenario, the sub CPU 81 refers to the effect number determination table for development effect 1 (see FIGS. 177 and 178), and develops based on the current “scenario No.” and the value of the continuous game number counter. An effect number for effect 1 is determined. Then, the sub CPU 81 registers the determined effect number for development effect 1 in the sub RAM 83. Further, in the effect determination process during the scenario, when the development effect 1 effect number corresponding to the final game of the continuous effect (continuation game) is determined, the sub CPU 81 clears the “scenario No.” and the continuous game number counter.

  Next, the sub CPU 81 performs an effect rewriting process (S614). Details of the effect rewriting process will be described later with reference to FIG. Then, after the process of S614, the sub CPU 81 ends the effect determination process and also ends the start command reception process (see FIG. 261).

  Here, returning to the description of the processing of S611 again, in S611, when the sub CPU 81 determines that “scenario No.” is “0” (when S611 is YES), the sub CPU 81 It is determined whether or not “No.” is “0” (S615). In S615, when the sub CPU 81 determines that the “map No.” is “0” (in the case where S615 is YES), the sub CPU 81 ends the effect determination process and the start command reception process (FIG. 261) also ends.

  On the other hand, when the sub CPU 81 determines that “Map No.” is not “0” in S615 (when S615 is NO), the sub CPU 81 performs map rewriting lottery processing (S616). In the map rewriting lottery process, the sub CPU 81 refers to the map rewriting lottery table (see FIGS. 206 to 221) and determines whether or not to rewrite the “map number” based on the currently registered “map number”. Is determined by lottery. When it is determined to rewrite “Map No.”, the sub CPU 81 changes “Map No.” to the rewrite destination value.

  Next, the sub CPU 81 performs a mid-map effect determination process (S617). In the effect determination process during map, first, the sub CPU 81 refers to the effect lottery table number determination table (see FIG. 199), and determines the effect lottery table number based on the current “map No.” and the value of the continuation game number counter. To decide. Next, the sub CPU 81 refers to the effect lottery table (see FIGS. 200 to 205) corresponding to the determined effect lottery table number, and determines the development effect 2 effect number based on the sub gaming state. Then, the sub CPU 81 registers the determined effect number for development effect 2 in the sub RAM 83. Further, in the in-map effect determination process, when the effect number for development effect 2 corresponding to the final game of the continuous effect (continuation game) is determined, the sub CPU 81 clears the “map No.” and the continuing game number counter.

  Next, the sub CPU 81 performs an effect rewriting process (S618). Details of the effect rewriting process will be described later with reference to FIG. Then, after the process of S618, the sub CPU 81 ends the effect determination process and also ends the start command reception process (see FIG. 261).

[Direction rewriting process]
Next, with reference to FIG. 267, the effect rewriting process performed in S614 or S618 in the flowchart of the effect determination process (see FIG. 266) will be described.

  First, the sub CPU 81 refers to the effect rewriting condition table (see FIG. 222) and performs an effect rewriting determination process (S621). In the effect rewriting determination process, the sub CPU 81 determines whether to rewrite the effect based on the lottery flag K and the currently registered effect number for the development effect 1 or the effect number for the development effect 2.

  Next, the sub CPU 81 determines whether or not an effect rewriting condition is satisfied in the effect rewriting determination process of S621 (S622). When the sub CPU 81 determines in S622 that the effect rewriting conditions are not satisfied (when S622 is NO), the sub CPU 81 ends the effect rewriting process and also ends the effect determining process (see FIG. 266).

  On the other hand, when it is determined in S622 that the sub CPU 81 satisfies the effect rewriting condition (when S622 is YES), the sub CPU 81 clears the determined effect number for development effect 1 or effect number for development effect 2 (S623).

  In the present embodiment, when the game progresses without a sense of incongruity by ending the continuous effect (continuation game) in the middle, the continuous effect (continuation game) is forcibly ended. In the process of S623, “scenario No.”, “map No.”, and the continuation game number counter are also cleared.

  Next, the sub CPU 81 performs effect lottery processing (S624). In the effect lottery process, the sub CPU 81 performs the same process as the effect lottery process performed in S602 in the flowchart of the effect determination process (see FIG. 266). That is, in the process of S624, the sub CPU 81 re-determines “effect No.”. Then, after the processing of S624, the sub CPU 81 ends the effect rewriting process and also ends the effect determining process (see FIG. 266).

[Process when receiving display command]
Next, with reference to FIG. 268, a display command reception process performed in S527 in the flowchart of the effect content determination process (see FIG. 260) will be described.

  First, the sub CPU 81 performs a count process (S631). The details of the counting process will be described later with reference to FIG.

  Next, the sub CPU 81 performs a VR related display process (S632). Details of the VR related display processing will be described later with reference to FIG. After the process of S632, the sub CPU 81 ends the display command reception process, and moves the process to S528 of the effect content determination process (see FIG. 260).

[Count processing]
Next, with reference to FIG. 269, the count process performed in S631 in the flowchart (see FIG. 268) of the display command reception process will be described.

  First, the sub CPU 81 determines whether or not “VR (Viking Rush)” or “R_ART” is in operation (S641). In S641, when the sub CPU 81 determines that “VR” or “R_ART” is in operation (when S 641 is YES), the sub CPU 81 performs processing of S659 described later.

  On the other hand, when the sub CPU 81 determines in S641 that “VR” or “R_ART” is not in operation (when S641 is NO), the sub CPU 81 determines whether or not “G_ART” is in operation. A determination is made (S642). When the sub CPU 81 determines that “G_ART” is in operation in S642 (when S642 is YES), the sub CPU 81 subtracts “1” from the combined game number counter (S643).

  Next, the sub CPU 81 determines whether or not the value of the combined game number counter has become “0” (S644). In S644, when the sub CPU 81 determines that the value of the combined game number counter is not “0” (when S 644 is NO), the sub CPU 81 performs the process of S659 described later.

  On the other hand, when the sub CPU 81 determines in S644 that the value of the combined game number counter has become “0” (when S644 is YES), the sub CPU 81 clears the corresponding sub storage area (S645). Specifically, the sub CPU 81 stores “0” in the merge mode storage area and the merge identification data.

  Next, the sub CPU 81 determines whether or not data (winning information) is stored in the G_ART stock area (S646). In S646, when the sub CPU 81 determines that data (winning information) is not stored in the G_ART stock area (when S646 is NO), the sub CPU 81 performs the process of S659 described later.

  On the other hand, when the sub CPU 81 determines that data (winning information) is stored in the G_ART stock area in S646 (when S646 is YES), the sub CPU 81 performs a G_ART start process (S647). Then, after the process of S647, the sub CPU 81 performs a process of S659 described later.

  In the G_ART start process of S647, the sub CPU 81 refers to a combined game number lottery table (not shown) and determines the combined game number based on the table number. Then, the sub CPU 81 sets the determined combined game number in the combined game number counter. Further, the sub CPU 81 refers to a merge mode lottery table (not shown), determines the merge mode based on the table number, and stores the determined merge mode in the sub RAM 83. Further, the sub CPU 81 sets “1” to the value of the merge identification data storage area. Then, the sub CPU 81 clears the reference destination (winning information corresponding to the head address) of the G_ART stock area, and moves up the remaining winning information to the next higher address.

  In the present embodiment, the number of merging precursor games is not determined in the G_ART start process of S647. That is, after “G_ART” ends, “G_ART” corresponding to the winning information of “G_ART” stored in the G_ART stock area is started without going through the precursor game. However, in the present embodiment, after the “G_ART” is ended, the precursor game is played, and then “G_ART” corresponding to the winning information of “G_ART” stored in the G_ART stock area may be started. . In this case, in the G_ART start process of S647, the sub CPU 81 determines the number of combined sign games.

  Here, returning to the description of the processing in S642 again, in S642, when the sub CPU 81 determines that “G_ART” is not in operation (when S642 is NO), the sub CPU 81 determines that “D_ART” or “B_ART”. Is determined to be in operation (S648). When the sub CPU 81 determines that “D_ART” or “B_ART” is in operation in S648 (when S648 is YES), the sub CPU 81 subtracts “1” from the value of the ART game number counter (S649). ).

  Next, the sub CPU 81 determines whether or not the value of the ART game number counter has become “0” (S650). When the sub CPU 81 determines that the value of the ART game number counter is not “0” in S650 (when S650 is NO), the sub CPU 81 performs the process of S659 described later.

  On the other hand, in S650, when the sub CPU 81 determines that the value of the ART game number counter has become “0” (when S650 is YES), the sub CPU 81 indicates that “D_ART” is in operation and continues. It is determined whether or not the value of the stock counter is “1” or more (S651).

  In S651, when the sub CPU 81 determines that “D_ART” is in operation and the value of the continuation stock counter is “1” or more (when S651 is YES), the sub CPU 81 determines that the D_ART is being continued. Processing is performed (S652). Then, after the processing of S652, the sub CPU 81 performs processing of S659 described later.

  In the D_ART continuation process in S652, the sub CPU 81 subtracts “1” from the value of the continuation stock counter. In addition, the sub CPU 81 determines the number of ART games with reference to a continuing ART game number lottery table (not shown). Then, the sub CPU 81 sets the determined ART game number in the ART game number counter. The number of ART games at the time of continuation may be the same as the number of ART games determined at the beginning.

  In this embodiment, in the D_ART continuation process in S652, the sub CPU 81 does not change the continuation loop mode and ART mode. However, in this embodiment, in the D_ART continuation process in S652, the loop mode and ART mode at the time of continuation may be changed by lottery.

  On the other hand, when the sub CPU 81 determines in S651 that “D_ART” is in operation and the condition that the value of the continuous stock counter is “1” or more is not satisfied (when S651 is NO). The sub CPU 81 clears the corresponding sub storage area (S653). Specifically, the sub CPU 81 stores “0” in the ART mode storage area, the loop mode storage area, and the ART identification data storage area.

  Next, the sub CPU 81 determines whether or not data (winning information) is stored in the ART stock area A (S654). When the sub CPU 81 determines that data is stored in the ART stock area A in S654 (when S654 is YES), the sub CPU 81 starts the ART based on the winning information stocked in the ART stock area A. Time processing is performed (S655). Then, after the process of S655, the sub CPU 81 performs a process of S659 described later.

  In the ART start process of S655, the sub CPU 81 refers to the winning information corresponding to the head address of the ART stock area A. Then, the sub CPU 81 refers to an ART game number lottery table (not shown) and determines the number of ART games based on the table number. Next, the sub CPU 81 sets the determined ART game number in the ART game number counter. Further, the sub CPU 81 refers to an ART mode lottery table (not shown), determines the ART mode based on the table number, and stores the determined ART mode in the sub RAM 83.

  Further, in the ART start process of S655, the sub CPU 81 stores “1” or “2” in the ART identification data storage area. That is, if the winning information corresponding to the top address of the ART stock area A is the winning information related to “D_ART”, the sub CPU 81 stores “1” in the ART identification data storage area and the winning information related to “B_ART”. If it is information, the sub CPU 81 stores “2” in the ART identification data storage area.

  Further, in the ART start time process of S655, the sub CPU 81 refers to the ART stock non-consumption lottery table (see FIG. 147 and FIG. 148) and determines consumption / non-consumption. At this time, when non-consumption is determined, the sub CPU 81 does not clear the winning information referred to in the ART stock area A (winning information corresponding to the first address). On the other hand, when the consumption is determined, the sub CPU 81 clears the winning information referred to in the ART stock area A, and moves up the remaining winning information to the address one level higher.

  If the winning information corresponding to the head address of the ART stock area A is the winning information related to “D_ART” in the ART start process in S655, the sub CPU 81 determines a loop mode lottery table (not shown). The loop mode is determined based on the table number, and the determined loop mode is stored in the sub RAM 83.

  On the other hand, when the sub CPU 81 determines in S654 that no data is stored in the ART stock area A (when S654 is NO), the sub CPU 81 stores data (winning information) in the ART stock area B. It is determined whether or not (S656). When the sub CPU 81 determines in S656 that no data is stored in the ART stock area B (when S656 is NO), the sub CPU 81 performs the process of S659 described later.

  On the other hand, when the sub CPU 81 determines in S656 that data is stored in the ART stock area B (when S656 is YES), the sub CPU 81 determines based on the winning information stocked in the ART stock area B. An ART start process is performed (S657). Note that the ART start time process in S657 is the same as the ART start time process in S655. Then, after the process of S657, the sub CPU 81 performs a process of S659 described later.

  Here, returning to the description of the processing of S648 again, in S648, when the sub CPU 81 determines that “D_ART” or “B_ART” is not in operation (when S648 is NO), the sub CPU 81 determines that the ceiling count Processing is performed (S658). In the ceiling counting process, the sub CPU 81 counts the number of games after the end of the bonus, and when the number of games after the end of the bonus reaches a predetermined value (for example, 1400), the special ART lottery table (that 2) Referring to (see FIG. 145), ART lottery is performed.

  After S647, S652, S655, S657, or S658, if S644, S646, S650, or S656 is NO, or if S641 is YES, the sub CPU 81 performs a precursor check process (S659). Details of the warning check process will be described later with reference to FIG. 270 described later. After the process of S659, the sub CPU 81 ends the count process, and moves the process to S632 of the display command reception process (see FIG. 268).

  As described above, in this embodiment, when data (winning information) is stored in the ART stock area A and the ART stock area B, it is activated from “ART” related to the winning information stocked in the ART stock area A. . That is, “ART” that displays (notifies) that it is won or is scheduled to be notified is activated, and then “ART” that does not display (not notify) that “ART” is won is activated.

[Precursor check processing]
Next, with reference to FIG. 270, the warning check process performed in S659 in the flowchart of the count process (see FIG. 269) will be described.

  First, the sub CPU 81 determines whether or not it is a precursor (the precursor game is in operation) (S661). Specifically, the sub CPU 81 determines whether or not the number of precursor games is set in various precursor counters (any of CZ precursor counter, ART precursor counter, coalescence precursor counter, rocket precursor counter, and VR precursor counter). . When the sub CPU 81 determines in S661 that the warning is not in progress (when S661 is NO), the sub CPU 81 ends the warning check process and also ends the count process (see FIG. 269).

  On the other hand, when it is determined in S661 that the sub CPU 81 is a precursor (when S661 is YES), the sub CPU 81 decrements the value of the precursor counter by “1” (S662). Next, the sub CPU 81 determines whether or not the value of the precursor counter is “0” (S663). When the sub CPU 81 determines that the value of the precursor counter is not “0” in S663 (when S663 is NO), the sub CPU 81 ends the precursor check process and also ends the count process (see FIG. 269). To do.

  On the other hand, when the sub CPU 81 determines that the value of the precursor counter is “0” in S663 (when S663 is YES), the sub CPU 81 determines whether or not the CZ (chance zone) starts. (S664). That is, the sub CPU 81 determines whether or not the counter determined to be “0” in S663 is a CZ precursor counter.

  In S664, when the sub CPU 81 determines that the CZ (chance zone) starts (when S664 is YES), the sub CPU 81 performs CZ start processing (S665). Then, after the process of S665, the sub CPU 81 ends the warning check process and also ends the count process (see FIG. 269).

  In the CZ start time process of S665, the sub CPU 81 determines a CZ game number with reference to a CZ game number lottery table (not shown), and sets the determined CZ game number in the CZ game number counter. Further, the sub CPU 81 stores “1” in the CZ identification data storage area.

  On the other hand, when the sub CPU 81 determines in S664 that it is not at the start of CZ (chance zone) (when S664 is NO), the sub CPU 81 determines whether or not it is at the start of ART (S666). That is, the sub CPU 81 determines whether or not the precursor counter determined to be “0” in S663 is an ART precursor counter.

  In S666, when the sub CPU 81 determines that it is the ART start time (when S666 is YES), the sub CPU 81 performs an ART start process based on the winning information stocked in the ART stock area A (S667). ). Note that the ART start time process in S667 is the same as the ART start time process in S655 in the flowchart of the count process (FIG. 269). Then, after the process of S667, the sub CPU 81 ends the warning check process and also ends the count process (see FIG. 269).

  In this embodiment, at the first hit of “ART”, the winning information of “ART” is always stocked in the ART stock area A (see FIGS. 94 and 95). Therefore, the winning information stocked in the ART stock area A is always referred to in the ART start process in S667.

  On the other hand, when it is determined in S666 that the sub CPU 81 is not at the start of ART (when S666 is NO), the sub CPU 81 determines whether or not it is the start of “G_ART” (S668). That is, the sub CPU 81 determines whether or not the precursor counter determined to have become “0” in S663 is a coalescence precursor counter.

  In S668, when the sub CPU 81 determines that it is time to start “G_ART” (when S668 is YES), the sub CPU 81 performs G_ART start time processing (S669). The G_ART start process in S669 is the same as the G_ART start process in S647 in the flowchart of the count process (FIG. 269). Then, after the process of S669, the sub CPU 81 ends the precursor check process and also ends the count process (see FIG. 269).

  On the other hand, when the sub CPU 81 determines in S668 that it is not the time to start “G_ART” (when S668 is NO), the sub CPU 81 determines whether or not it is the time to start “R_ART” (S670). That is, the sub CPU 81 determines whether or not the precursor counter determined to have become “0” in S663 is a rocket precursor counter.

  In S670, when the sub CPU 81 determines that “R_ART” starts (when S670 is YES), the sub CPU 81 performs R_ART start processing (S671). Then, after the process of S671, the sub CPU 81 ends the precursor check process and also ends the count process (see FIG. 269).

  In the R_ART start time process of S671, the sub CPU 81 refers to the merge mode lottery table (not shown), determines the merge mode based on the table number, and stores the determined merge mode in the sub RAM 83. Further, the sub CPU 81 stores “1” in the rocket identification data storage area. Further, the sub CPU 81 stores “0” in the rocket flag storage area.

  On the other hand, when the sub CPU 81 determines in S670 that it is not the time to start “R_ART” (when S670 is NO), the sub CPU 81 determines whether or not it is the time to start “VR” (S672). That is, the sub CPU 81 determines whether or not the precursor counter determined to be “0” in S663 is a VR precursor counter.

  In S672, when the sub CPU 81 determines that it is not the time to start “VR” (when S672 is NO), the sub CPU 81 ends the warning check process and also ends the count process (see FIG. 269).

  On the other hand, in S672, when the sub CPU 81 determines that “VR” starts (when S672 is YES), the sub CPU 81 performs VR start processing (S673). Then, after the process of S673, the sub CPU 81 ends the precursor check process and also ends the count process (see FIG. 269).

  In the VR start process of S673, the sub CPU 81 subtracts “1” from the value of the VR stock counter. Further, the sub CPU 81 stores “1” in the VR identification data storage area. As a result, the sub game state becomes “VR”, and “VR” is started from the next game (game) in which the VR start processing of S673 is performed.

[VR related display processing]
Next, with reference to FIG. 271, the VR related display time process performed in S632 in the flowchart of the display command reception time process (see FIG. 268) will be described.

  First, the sub CPU 81 determines whether or not “VR (Viking Rush)” is in operation (S681). In S681, when the sub CPU 81 determines that “VR” is not in operation (NO in S681), the sub CPU 81 determines whether or not the game lock type is “game lock 9” ( S682).

  In S682, when the sub CPU 81 determines that the type of the game lock is not “game lock 9” (when S 682 is NO), the sub CPU 81 terminates the VR related display time process and also displays the display command. (See FIG. 268).

  On the other hand, when the sub CPU 81 determines that the type of game lock is “game lock 9” in S682 (when S682 is YES), the sub CPU 81 performs a lock correct / incorrect touch determination process (S683). In the lock correct / incorrect touch determination process, the sub CPU 81 refers to the VR lock billy touch correct / incorrect answer lottery table (see FIG. 150), and supports the touch corresponding touch determined when operating the start lever 16 (correct touch operation correct answer). Content or incorrect answer content) and the touch result in the alternative production at the time of VR lock stored in the touch operation identification data storage area, whether the touch challenge is correct (correct (touch successful) / incorrect answer ( Touch failure)).

  Next, the sub CPU 81 determines whether or not the result of the lock correct touch determination process in S683 is a touch success (correct answer) (S684). When the sub CPU 81 determines that the touch is not successful in S684 (when S684 is NO), the sub CPU 81 stores “0” in the VR identification data storage area and ends the VR related display time process. The display command reception process (see FIG. 268) is terminated.

  On the other hand, when the sub CPU 81 determines in S684 that the touch is successful (S684 is YES), the sub CPU 81 performs a VR start process (S685). In the VR start process, the sub CPU 81 subtracts “1” from the value of the VR stock counter. Further, the sub CPU 81 stores “1” in the VR identification data storage area. After the processing of S685, the sub CPU 81 ends the VR related display time processing and ends the display command reception time processing (see FIG. 268).

  Here, returning to the description of the processing of S681 again, in S681, when the sub CPU 81 determines that “VR” is in operation (in the case of S681 being YES), the sub CPU 81 determines whether or not the touch is valid during VR. Processing is performed (S686). In the VR touch correct / incorrect determination process, the sub CPU 81 refers to the VR billy touch lottery table (see FIGS. 151 to 154), and determines the touch response determined when the start lever 16 is operated (the correct or incorrect content of the touch operation). ) And the touch result of the alternative production in “VR” stored in the touch operation identification data storage area, whether the touch challenge is correct (correct (touch success) / incorrect (touch failure)) Determine.

  Next, the sub CPU 81 determines whether or not the game in “VR” is the 6G (game) or later (S687). That is, the sub CPU 81 determines whether or not the number of touch challenges is the sixth or later. In S687, when the sub CPU 81 determines that the game in “VR” is not the 6th game or later (when S687 is NO), the sub CPU 81 performs a VR update process (S688). In the VR update process, the sub CPU 81 stores the result of the VR touch correct / incorrect determination process (touch failure or touch success) in the VR correct / incorrect identification data storage area.

  Next, the sub CPU 81 determines whether or not the touch is successful, and whether or not the VR revolution flag is ON (the value of the VR revolution flag is “1”) (S689). When the sub CPU 81 determines in S689 that this condition is not satisfied (when S689 is NO), the sub CPU 81 performs the process of S691 described later.

  On the other hand, when the sub CPU 81 determines that the touch is successful and the VR revolution flag is on in S689 (when S689 is YES), the sub CPU 81 performs rewriting processing during VR (S690). . In the rewriting process during VR, the sub CPU 81 rewrites all the results of the VR touch correctness determination process up to the present to success.

  After the processing of S690 or when S689 is NO, the sub CPU 81 determines whether or not the game in “VR” is the 5G (game) eye (S691). That is, the sub CPU 81 determines whether or not data (“0” or “1”) is stored in all the VR correct / incorrect identification data storage areas. When the sub CPU 81 determines in S691 that the game in “VR” is not the 5G game (when S691 is NO), the sub CPU 81 ends the VR related display time process and the display command reception time process. (See FIG. 268).

  On the other hand, when the sub CPU 81 determines in S691 that the game “VR” is the 5G game (when S691 is YES), the sub CPU 81 performs addition processing during VR (S692). Then, after the processing of S692, the sub CPU 81 ends the VR related display time processing and ends the display command reception time processing (see FIG. 268).

  Note that, in the VR extra processing in S692, the sub CPU 81 determines the number of additional games based on the value of the VR correct / incorrect identification data storage area, and adds the determined additional number of games to the ART game number counter. If all the touches are not correct, the sub CPU 81 stores “0” in the VR identification data storage area and clears the value of the VR correct / incorrect identification data storage area.

  If all the values in the VR correct / incorrect identification data storage area are “0” (if all are incorrect touches), the sub CPU 81 adds “1” to the value of the VR stock counter. That is, if all of the “VR” is incorrect touch, “VR” is started again.

  Here, returning to the description of the processing of S687 again, in S687, when the sub CPU 81 determines that the game in the “VR” is 6G or later (when S687 is YES), the sub CPU 81 determines that the VR is VR. Extra processing is performed (S693). Then, after the processing of S693, the sub CPU 81 ends the VR related display time processing and ends the display command reception time processing (see FIG. 268).

  In the VR extra process of S693, if the result of the VR touch correct / incorrect determination process is a touch correct answer, the sub CPU 81 adds “320” to the value of the ART game number counter. On the other hand, if the result of the VR touch correct / incorrect determination process is an incorrect touch, the sub CPU 81 stores “0” in the VR identification data storage area and clears the value of the VR correct / incorrect identification data storage area.

[Processing when no operation command is received]
Next, with reference to FIG. 272, the non-operation command reception process performed in S536 in the flowchart of the effect content determination process (see FIG. 260) will be described.

  First, the sub CPU 81 determines whether or not there is a touch input (S701). When the sub CPU 81 determines in S701 that there is no touch input (NO in S701), the sub CPU 81 ends the no-operation command reception process and also ends the effect content determination process (see FIG. 260). To do.

  On the other hand, when the sub CPU 81 determines in S701 that there is a touch input (YES in S701), the sub CPU 81 stores data corresponding to the touch input in the touch operation identification data storage area (S702). And after the process of S702, sub CPU81 complete | finishes the process at the time of no operation command reception, and also complete | finishes an effect content determination process (refer FIG. 260).

  In S702, when the touch operation (input) is performed on the left character decoration unit 22L, the sub CPU 81 stores “1” in the touch operation identification data storage area, and the right character decoration unit 22R. When the touch operation is performed, the sub CPU 81 stores “2” in the touch operation identification data storage area.

  The configuration and operation of the gaming machine according to one embodiment of the present invention have been described above including the effects thereof. However, the present invention is not limited to the above-described embodiments, and various embodiments and modifications are included without departing from the gist of the present invention described in the claims.

  For example, in the above embodiment, when winning information of “G_ART” is stored in the sub storage area, “D_ART” or “B_ART” is interrupted and “G_ART” is started. Is not limited to this. For example, when the winning information of “G_ART” is stored in the sub storage area, “G_ART” may be executed simultaneously with “D_ART” or “B_ART”. In this case, during the operation period of “G_ART”, the continuous stock lottery and the extra game number lottery are performed, and the ART game number is not subtracted. In this case, both the ART lottery of “G_ART” and the ART lottery of “D_ART” or “B_ART” may be performed during the operation period of “G_ART”.

  DESCRIPTION OF SYMBOLS 1 ... Pachislot (game machine), 2 ... Exterior body, 2a ... Cabinet, 2b ... Front door, 3L ... Left reel, 3C ... Middle reel, 3R ... Right reel, 4 ... Display window, 11 ... Liquid crystal display device, 16 ... Start lever, 17L ... Left stop button, 17C ... Middle stop button, 17R ... Right stop button, 21L, 21R ... Character decoration, 23L, 23R ... Touch sensor, 41 ... Main control circuit, 42 ... Sub-control circuit, 50 ... Microcomputer, 51 ... main CPU, 52 ... main ROM, 53 ... main RAM, 56 ... external random number generator, 58 ... 16-bit internal random number generator, 59 ... 8-bit internal random number generator, 81 ... sub CPU

Claims (3)

Main control means including a main control arithmetic unit that performs control associated with a game operation;
An input operation detecting means for detecting an input operation of the game medium;
Start operation detecting means for detecting a start operation by the player based on detection of the input operation by the input operation detecting means;
An internal winning combination determining means for determining an internal winning combination with a predetermined probability based on the detection of the start operation by the start operation detecting means;
Fluctuation display means that includes a plurality of display columns and variably displays symbols provided in each display column based on the detection of the start operation by the start operation detection unit;
A stop operation detecting means for detecting a stop operation by the player;
Based on the determination result of the internal winning combination determining means and the detection of the stop operation by the stop operation detecting means, stop control means for stopping the variation display of the symbol,
Main control transmission means for transmitting command data relating to the gaming operation;
Sub-control means for receiving the command data transmitted from the main control transmission means, and controlling a predetermined effect operation based on the received command data,
The main control arithmetic unit is
A main control calculation unit for controlling the gaming operation;
A first storage unit storing a program and a table necessary for the control process executed by the main control calculation unit;
A second storage unit that temporarily stores information necessary for control processing executed by the main control calculation unit;
The first storage unit
A plurality of error registration processing programs provided for each error type;
An error registration table that defines the correspondence between the relative position information of the storage area of each error registration processing program and the information related to the error type with respect to a reference address set in advance in the first storage unit;
The main control operation unit is
Reference address storage means for storing the reference address in a predetermined stack area provided in the second storage unit when an error occurs;
The relative position information corresponding to the error type is acquired with reference to the error registration table, and the error type is determined based on the acquired relative position information and the reference address stored in the predetermined stack area. Address calculating means for calculating the address of the storage area of the corresponding error registration processing program;
Jump processing means for jumping processing to the address of the storage area of the error registration processing program calculated by the address calculating means;
Error registration processing means for executing the error registration processing program to which the jump is made by the jump processing means, and storing information on the error type corresponding to the error registration processing program in a predetermined area in the second storage unit; A gaming machine characterized by having. The gaming machine according to claim 1, wherein the reference address is a head address of a storage area of the error registration table in the first storage unit. The gaming machine according to claim 1 or 2, wherein the main control arithmetic unit has a security function for preventing falsification and reading of a program.

Images