JP5768987B2 - Game machine - Google Patents

Description

  The present invention relates to a gaming machine such as a slot machine.

  As a gaming machine that stops after rotating a plurality of reels, for example, there is a slot machine. In the slot machine, a plurality of symbols are given to the outer peripheral portion of each reel, and a part of the symbols given to each reel is visible through the display window. Then, when the player inserts a medal and operates the start lever, the lottery of the winning combination is performed inside the slot machine and each reel starts to rotate. After each reel starts rotating, the stop switch is operated. As a result, the reels are sequentially stopped and one game is completed. At this time, if each reel wins a winning lottery, for example, it is determined from the timing at which the stop switch is operated so that the winning symbol corresponding to the winning combination can stop on a preset active line. Stop control such as stopping after rotating the number of symbols is performed. And when all reels stop rotating, if the winning symbol of each reel stops on the active line, it will be awarded, and a privilege such as a predetermined number of medals will be given to the player, or the gaming state will be a big bonus Or a transition to a bonus game (special game state) advantageous to the player, such as a game or a regular bonus game. Therefore, it is common for a player to watch a changing symbol and operate a stop switch so that the predetermined symbol stops on the active line. In other words, the player can actively participate in the game. This is a feature of slot machines.

  Such slot machines include a slot machine that performs so-called table control as the stop control. The slot machine that performs table control has a stop table that can derive the relationship between the symbol that has reached the effective line when the stop switch is operated and the symbol that is actually stopped on the effective line. , For each winning role. Then, a stop table corresponding to the lottery result is selected, and stop control of each reel is performed based on the selected stop table (see, for example, Patent Document 1).

JP 2003-135666 A

  However, in such a configuration, it is necessary to store a stop table according to the winning combination, and when the configuration is such that the effective line where the winning is established is changed according to the stop result of the previously stopped reel or the operation timing of the stop switch, It is necessary to prepare a stop table for stopping the winning symbol on the active line that establishes the winning. In other words, when diversifying the symbol arrangement (so-called stop appearance) that stops within a visible range from the display window, the number of necessary stop tables increases. Therefore, the amount of data required for reel stop control is enormous, and there is a concern about an increase in storage capacity.

  The above problem is not limited to the slot machine, but also applies to other gaming machines that display a variety of patterns in a variable manner and then end the variable display of a pattern based on the operation of the stop operation means.

  The present invention has been made in view of the above-described circumstances, and an object thereof is to provide a gaming machine capable of avoiding an increase in storage capacity by suppressing an increase in the amount of data related to stop control. To do.

In the invention according to claim 1, while rotating around in the circumferential direction, a plurality of rotating bodies provided with a plurality of types of patterns in the circumferential direction, and a part of the patterns can be visually recognized with respect to each of the rotating bodies. A display window, start operation means operated to start the circulation of each of the revolving bodies, lottery means for performing a lottery of the role based on the operation of the start operation means, and provided for each of the revolving bodies, A driving means for circling each circulating body, a start drive control means for starting and controlling each driving means so as to start the circling of each circulating body based on an operation of the starting operation means, and A plurality of stop operation means that are operated to stop the laps individually, and the corresponding lottery body is stopped based on the operation of each stop operation means, and the lottery of the combination is won and The stop operation means Stop operation control means for stopping and controlling each of the drive means so that the winning pattern corresponding to the winning combination stops at an effective position visible from the display window, In a gaming machine provided with a privilege granting means for granting a privilege as a winning establishment when the winning picture forms a predetermined combination and stops at a position, a plurality of partitioned areas each partitioning the respective circulating bodies in the circumferential direction And correspondence storage means for storing the correspondence relationship between the patterns attached to each partition area, and when the stop operation means is operated to generate a stop command, among the corresponding partition areas of the orbiting body, A reaching section area grasping means for grasping a reaching section area that has reached a predetermined specified position, and when the stop command is generated, a corresponding round is determined based on a grasping result of the reaching section area grasping means. The stop partition area determining means for determining a stop partition area to be stopped at the specified position among the respective partition areas of the body, and stop information used when stopping the circulating body for which the stop partition area has not been determined, Stop information deriving means for deriving based on the determination result of the partition area determining means, and stop information storage means for storing the stop information, wherein the stop drive control means is the stop section determined by the stop partition area determining means The corresponding driving means is controlled to stop driving so that the area stops at the specified position, and the stop information deriving means performs the next stop after the stop command is generated based on the determination result of the stop section area determining means. Before the command is generated, stop information of all the divided areas is derived for each divided area with respect to at least one circulating body in which the stopped divided area is not determined, and the stopped divided area The determining means, when a stop command is generated after the stop information deriving means derives the stop information, causes the reaching position to reach the specified position during a predetermined specified period based on the grasp result of the reaching section area grasping means. Reachable partition area grasping means for grasping the reachable partition area that can be, comparison determination means for comparing and determining all the stop information of the reachable partition area and the reachable partition area stored in the stop information storage means, Based on the determination result of the comparison determination means, the stop section area deriving means for deriving the stop section area, the stop information deriving means, if at least the lottery result of the lottery means is the first result, When the stop operation means is operated in a predetermined operation sequence determined in advance, the stop operation means is arranged so that the first picture corresponding to the first role stops at the effective position. In order to derive the priority, the apparatus includes priority deriving means for deriving a priority for each partition area so that the first pattern does not stop at the effective position when operated in an operation order other than A priority preparation information group in which the priority preparation information is determined for each partition area, and the stop information storage means is provided with a priority storage area for storing priority information indicating the derivation result of the priority derivation means The stop drive control means controls the drive means to stop drive so that the corresponding rotating body stops from when the stop command is generated until a predetermined time period elapses, and the stop information derivation is performed. The means ends the derivation of the stop information during the specified period .

  By suppressing an increase in the amount of data related to stop control, an increase in storage capacity can be avoided.

The front view of the slot machine in 1st Embodiment. The perspective view of a slot machine. The perspective view of the slot machine which shows the state which opened the front door. The rear view of a front door. The front view of a housing | casing. The figure which shows the symbol arrangement | sequence of each reel. Explanatory drawing which shows the relationship between the symbol which can be visually recognized from a display window, and a combination line. Explanatory drawing which shows the relationship between a prize mode and the privilege provided. The block circuit diagram of a slot machine. Explanatory drawing for demonstrating the structure of ROM. Explanatory drawing for demonstrating the structure of RAM. The flowchart which shows a NMI interruption process. The flowchart which shows a timer interruption process. The flowchart which shows the process at the time of a power failure. The flowchart which shows a main process. The flowchart which shows a winning probability setting process. The flowchart which shows a normal process. The flowchart which shows a reel rotation process. The flowchart which shows a lottery process. The figure which shows an example of a lottery table. The figure which shows an example of a slip table. The flowchart which shows the interruption process for starting. The flowchart which shows a reel stop process. The flowchart which shows a 1st stop process. The flowchart which shows the slip number acquisition process for 1st stop. The flowchart which shows the interruption process for a stop. The flowchart which shows the priority order information creation process for 2nd stop and after. (A) Explanatory drawing for demonstrating the priority order information buffer, (b) Explanatory drawing for demonstrating the determination value calculation information buffer. The flowchart which shows the judgment value calculation information creation process. Explanatory drawing for demonstrating the outline of a judgment value calculation information creation process. The flowchart which shows a lead-in bit information setting process. Explanatory drawing for demonstrating the lead-in bit information search buffer. The flowchart which shows a drawing bit table acquisition process. The figure which shows an example of a drawing-in bit table. The flowchart which shows a winning determination process. The flowchart which shows a winning determination process. The flowchart which shows a line determination process. Explanatory drawing for demonstrating a symbol corresponding table. Explanatory drawing for demonstrating a role corresponding | compatible table. Explanatory drawing for demonstrating a kicking corresponding | compatible table. The flowchart which shows the payout number acquisition process. The flowchart which shows a lead-in bit information search process. Explanatory drawing for demonstrating the outline of a winning determination process. The flowchart which shows a 2nd stop process. The flowchart which shows the number-of-sleeves acquisition process for the 2nd stop and after. Explanatory drawing for demonstrating the outline of the number-of-sleeves acquisition process after a 2nd stop. The flowchart which shows a priority line change process. Explanatory drawing for demonstrating the outline of a priority line change process. The flowchart which shows unfair winning prize determination processing. The flowchart which shows a 3rd stop process. The flowchart which shows the priority order priority information creation process for irregular pushing. The flowchart which shows a correction process. Explanatory drawing for demonstrating the outline of the payout number acquisition process at the time of irregular pushing. Explanatory drawing for demonstrating each bit allocated to the buffer for determination value calculation information. Explanatory drawing for demonstrating each bit allocated to the buffer for determination value calculation information. Explanatory drawing for demonstrating each bit allocated to the buffer for determination value calculation information. Explanatory drawing for demonstrating each bit allocated to the buffer for determination value calculation information. The flowchart which shows medal payout processing. The flowchart which shows a bonus game process. The figure which shows the symbol arrangement | sequence of each reel in 2nd Embodiment. Explanatory drawing which shows the relationship between a prize mode and the privilege provided. Explanatory drawing for demonstrating line mask information. Explanatory drawing for demonstrating the determination value calculation information buffer in 3rd Embodiment. The flowchart which shows a winning determination process. The flowchart which shows a winning determination process. Explanatory drawing for demonstrating each bit allocated to the buffer for determination value calculation information. Explanatory drawing for demonstrating the stop control of the reel in another symbol arrangement | sequence. Explanatory drawing for demonstrating the stop control of the reel in another symbol arrangement | sequence. The figure which shows the symbol arrangement | sequence of each reel in 4th Embodiment. Explanatory drawing which shows the relationship between a prize mode and the privilege provided. The figure which shows an example of a lottery table. The figure which shows the various information acquired when a replay 1 group is elected. The figure which shows the various information acquired when a replay 2 group is elected. The figure which shows an example of the table for offset references. The figure which shows the other example of the table for offset references. The flowchart which shows a priority line search process. The flowchart which shows a drawing bit table acquisition process.

  Hereinafter, the gaming machine of the present invention will be described as a means, and will be described while showing effects and the like as necessary. In the following, for easy understanding, the corresponding configuration in the embodiment of the invention is appropriately shown in parentheses, but is not limited to the specific configuration shown in parentheses.

Means 1. A plurality of rotating bodies (reels 32L, 32M, and 32R) that circulate in the circumferential direction and that are provided with a plurality of types of patterns (designs) in the circumferential direction;
Display windows (display windows 26L, 26M, and 26R) that allow a part of the patterns to be visually recognized with respect to each of the circular bodies;
Start operation means (start lever 41) operated to start the circulation of each of the circuit bodies;
Lottery means (lottery processing function of the main control device 101) for lottery of the combination based on the operation of the start operation means;
A driving means (stepping motor provided in the reel unit 31) provided for each of the rotating bodies and configured to rotate each of the rotating bodies;
Start driving control means (starting interrupt processing function of the main control device 101) for starting and controlling the driving means so as to start the circulation of the circulating bodies based on the operation of the starting operation means;
A plurality of stop operating means (stop switches 42 to 44) operated to individually stop the circulation of each of the circulating bodies;
Based on the operation of each of the stop operation means, if the corresponding orbiting body is stopped, and if the winning combination lottery is won and the stop operation means is operated at a predetermined timing, the winning combination is won. Stop drive control means (reel stop processing function of the main control device 101) for stopping and controlling each of the drive means so that the winning pattern corresponding to the winning combination stops at an effective position (effective line) visible from the display window When,
In a gaming machine provided with a privilege granting means (such as a medal payout process of the main control device 101) for granting a privilege as winning establishment when the winning pattern forms a predetermined combination and stops at the effective position,
Correspondence relation storage means (design correspondence table storage area 105g of ROM 105) for storing correspondence relations between a plurality of partition areas (symbol numbers) obtained by partitioning the respective circular bodies in the circumferential direction and the symbols assigned to the respective partition areas. When,
When a stop command is generated due to the operation of the stop operation means, the reaching section area (arrival symbol number) that has reached a predetermined specified position (lower stage) is grasped among the corresponding section areas of the orbiting body Reaching section area grasping means (reaching symbol number acquisition function S1202, S2302 of the main control device 101),
When the stop command is generated, a stop for determining a stop partition area (stop symbol number) to be stopped at the specified position among the respective partition areas of the corresponding circulating body based on the grasp result of the reaching compartment area grasping means Partition area determining means (stop position setting processing function S1205, S1208, S2202, S2602 of the main controller 101),
Stop information deriving means (of the main control device 101) for deriving stop information (priority information) used when stopping the circulating body for which the stop partition area is not determined based on the determination result of the stop partition area determining means (Second stop and subsequent priority information creation processing function),
Stop information storage means (determination value calculation information buffer B) for storing the stop information;
The stop drive control means performs stop drive control of the corresponding drive means so that the stop partition area determined by the stop partition area determination means stops at the specified position,
The stop information deriving means is based on a determination result of the stop partition area determining means, and at least one stop partition area is not determined from when the stop command is generated until the next stop command is generated. When the stop information of all the divided areas is derived for each divided area, and the lottery result of the lottery means is the first result (replay 2-7 group winning), the stop operation means is predetermined. When the operation is performed in a predetermined operation sequence, the stop operation means is configured to perform the predetermined operation sequence so that the first symbol ("replay" symbol) corresponding to the first role (first replay) stops at the effective position. Deriving the stop information so that the first pattern does not stop at the effective position when operated in an operation order other than
The stop section area determining means is
When a stop command is generated after the stop information deriving means derives the stop information, an arrival that can reach the specified position within a predetermined specified period based on the grasping result of the reaching section area grasping means Reachable partition region grasping means for grasping the possible partition region (determination symbol number acquisition processing function S2304 in the main control device 101);
Comparison determination means (comparison determination processing functions S2306 and S2307 of the main controller 101) for comparing and determining all the stop information of the reachable partition area and the reachable partition area stored in the stop information storage means;
A gaming machine comprising: a stop partition area deriving unit (a stop partition area deriving function S2308 of the main control device 101) for deriving the stop partition area based on a determination result of the comparison determination unit.

According to this means, each orbiting body is partitioned into a plurality of partitioned areas, and the correspondence relationship with the pattern attached to each partitioned area is stored. Then, when a stop command is generated, after the reaching partition area that has reached the predetermined specified position is grasped and the stop partition area to be stopped at this specified position is determined among the respective partition areas of the corresponding circulating body Circumstance stop control is performed. Further, for at least one circling body for which the stop partition area has not been determined, the stop partition area determined by the generation of the previous stop command after the stop command is generated and before the next stop command is generated, When the partitioned area reaches the specified position, stop information of all the partitioned areas is derived based on the reaching pattern that reaches the effective position, and the stop information is stored in the stop information storage unit. By adopting such a configuration, when the next stop command is generated, it becomes possible to perform the stop control of the corresponding circulating body using the stop information stored in the stop information storage means, and the stop command is generated. Sometimes, a stop table that can derive the relationship between the pattern that has reached the effective position and the pattern that is actually stopped at the effective position becomes unnecessary. Therefore, it is possible to reduce the amount of data stored in advance regarding the stop control of each circuit body.
In addition, in order to derive stop information of all the partition areas based on the stop partition area determined by the generation of the previous stop command, it is possible to change the stop result of the circulating body to be subsequently stopped according to the determination result of the stop partition area. It becomes possible, and it becomes possible to diversify the stop appearance.

  In addition, since the stop information of all the partitioned areas is derived for the circulating object for which the stop information is derived, the stop information is stored even if a stop command is generated while any of the partitioned areas reaches the specified position. The stop partition area can be determined using the stop information stored in the means. That is, the stop section area can be determined relatively easily regardless of the operation timing of the stop operation means.

  Further, when the lottery result of the lottery means is the first result, the first pattern corresponding to the first combination is stopped at the effective position when the stop operation means is operated in a predetermined operation order. When the stop operation means is operated in an operation order other than the predetermined operation order, stop information is derived so that the first pattern does not stop at the effective position. By adopting such a configuration, it is possible to change the stop appearance according to the operation order of the stop operation means, and it is possible to diversify the stop appearance.

  As a result of the above, it is possible to reduce the processing time required for deriving the stop partition area while avoiding an increase in storage capacity by suppressing an increase in the amount of data related to the stop control of each orbiting body It becomes.

  Further, when a stop command is generated after the stop information is derived, all stop information of the reachable partition area and the reachable partition area is compared and determined, and the stop partition area is derived based on the determination result. By adopting such a configuration, among the partitioned areas that can reach the specified position from the time when the stop command is issued until the specified period elapses, the partitioned area that should be stopped or can be stopped is stopped. It can be derived as a partitioned area. That is, among the patterns that can reach the effective position, it is possible to stop at the effective position a pattern that should or should not be stopped. Therefore, it is possible to diversify the stop appearance. In addition, the stop information is derived before the stop command is generated, and the stop partition area is derived after the stop command is generated, so that the next stop command can be generated after one circulating body stops. It is possible to reduce the time lag that may occur until In addition, since it is not necessary to determine the stop partition area of the orbiting body when deriving the stop information of all the partition areas for the circulating body for which the stop partition area has not been determined, it is possible to increase the processing efficiency. .

  Mean 2. In the above means 1, the stop information deriving means is a priority deriving means for deriving a priority for each of the divided areas when the lottery result of the lottery means is the first result (the pulling bit of the main controller 101 An information retrieval processing function), and the stop information storage means stores a priority storage area (priority bit in the decision value calculation information buffer B, second priority information) for storing priority information indicating the derivation result of the priority derivation means; A gaming machine having a priority line bit).

  According to this means, when at least the lottery result of the lottery means is the first result, the priority is derived for each partition area, and the priority information indicating the derivation result is given to the priority information provided in the stop information storage means. Stored in the storage area. By adopting such a configuration, when a stop command is generated, stop information including priority information derived for the reachable partition area and the reachable partition area may be compared and determined. It can be derived. Further, by deriving the priority for each partition area, it is possible to diversify the stop outcome.

  Means 3. A gaming machine according to claim 2, wherein a priority preparation information group (withdrawal bit table) in which priority preparation information for deriving the priority is determined for each partition area is provided.

  According to this means, by providing the priority preparation information group in which the priority preparation information is determined for each partition area, the priority is derived so as to be the desired stop point of the designer who designs the gaming machine. Is possible. In addition, in the configuration in which priority information for deriving priority is determined for each partition area in this way, priority information for each type of at least a part of the types of designs determined for each partition area This makes it easy to set the priority preparation information group at the design stage of the gaming machine.

  Means 4. In the above means 3, when a plurality of priority preparation information groups are provided for each vehicle, and identification information (drawing bit table number) for identifying each priority preparation information group and the priority are derived. Specific information (drawing bit offset) for specifying the identification information is provided, and the identification information includes identification information of a priority preparation information group corresponding to one of the circulating bodies, and other rounds ID information of priority preparation information group corresponding to the body, and an identification information group consisting of a pull-in bit table number stored in the first area and the second area, and a pull-in bit table stored in the third area and the fourth area Number)).

  According to this means, identification information is provided for each priority preparation information group, and the identification information includes identification information of a priority preparation information group corresponding to one of the circulating bodies, and other information. The identification information group consisting of the identification information of the priority preparation information group corresponding to the circling body is associated. With this configuration, it is possible to reduce the amount of information necessary for specifying the priority preparation information group.

  Means 5. A gaming machine according to claim 4, wherein a plurality of identification information groups are associated with the first specific information used when the lottery result of the lottery means is the first result.

  According to this means, a plurality of identification information groups are associated with the first specific information used when the lottery result of the lottery means is the first result. By adopting such a configuration, the situation corresponds to each situation such as a situation where the stop operation means is operated in a predetermined operation order and a situation where the operation order of the stop operation means does not coincide with the predetermined operation order in the middle. The priority can be derived based on the first specific information of one.

  Means 6. In the means 5, the identification information group storage means (ROM 105) for storing the identification information group and the position (address) where the identification information group is stored when the priority deriving means derives the priority are specified. Position specifying means (address specifying process S3307), and the first specifying information includes a first identification information group (a pull-in bit table number stored in the first area and the second area) and a second identification information group. (The pull-in bit table numbers stored in the third area and the fourth area) are associated, and the identification information group storage means stores first information (offset reference table number) that is uniquely determined from the lottery result of the lottery means. ) Is stored in a position corresponding to the identification information group, the numerical information corresponding to the first specific information is multiplied by a prescribed number (2), and the identification information group has the identification information obtained from the multiplication result. The first identification information group is stored at a first position corresponding to the first numerical information obtained by subtracting the number of information (2), and corresponds to the second numerical information obtained by adding the identification information number to the first numerical information. A gaming machine, wherein the second identification information group is stored at a second position.

  According to this means, the identification information group storage means stores the first identification information group and the second identification information group at positions having a predetermined regularity. With this configuration, it is possible to simplify the processing configuration when the position specifying unit specifies the stored position of the first identification information group or the second identification information group.

  Mean 7 In any one of the means 1 to means 6, when the lottery result of the lottery means is the first result, a plurality of winning combinations including the first winning combination are won. When the lottery result of the lottery means is the first result and the stop operation means is operated in an operation order other than the predetermined operation order, the winning pattern corresponding to the winning combination other than the first combination is A gaming machine, wherein the stop information is derived so as to stop at an effective position.

  According to this means, when the lottery result of the lottery means is the first result, a plurality of winning combinations including the first winning combination are won. When the stop operation means is operated in a predetermined operation order, stop information is derived so that the first pattern stops at the effective position. When the stop operation means is operated out of the predetermined operation order, other than the first role Stop information is derived so that the winning symbol corresponding to the winning combination stops at the effective position. By adopting such a configuration, it is possible to prevent the player from being disadvantaged when the lottery result of the lottery means is operated in an operation order other than the predetermined operation order in a situation where the lottery result is the first result. Become.

  Means 8. In any one of the above means 1 to 7, the stop information deriving means derives the stop information while the stop drive control means performs stop drive control of the corresponding drive means. Machine.

  According to this means, since stop information is derived while the corresponding drive means is under stop drive control, it becomes possible to generate the next stop command after one circulating body stops. It is possible to suitably reduce the time lag that can occur.

  Means 9. In any one of the above-described means 1 to 8, a first process execution means (normal processing function in the main control device 101) that starts when the power is turned on and repeats a series of first processes (normal processing), and periodically Second processing execution means (timer interrupt processing function in the main controller 101) for interrupting the processing by the first processing execution means and performing a series of second processing (timer interrupt processing), the first processing execution means Includes the stop information deriving means, and the second process executing means includes the stop drive control means.

  According to this means, the stop information is derived in the first process that is started and repeated when the power is turned on, and the drive means is included in the second process that is performed periodically by interrupting the first process. Stop drive control is performed. By adopting such a configuration, it is possible to suitably reduce the time lag that may occur after one circulating body stops and before the next stop command can be generated. It is also possible to derive stop information while smoothly stopping the corresponding rotating body. If the stop drive control of the driving means is performed in the first process and the stop information is derived in the second process, the second process is repeated a plurality of times if it takes a long time to derive the stop information. This is because the timing of performing the stop drive control is delayed, and a problem such as a stop of the stop section area deviating from the specified position may occur.

  Means 10. In any one of the above means 1 to 9, the stop drive control means stops the drive means so that the corresponding circulating body stops until a predetermined specified period elapses after the stop command is generated. The gaming machine is characterized in that the stop information derivation means terminates the derivation of the stop information during the specified period.

  According to this means, before the specified period elapses after the stop command is generated, the corresponding circulating body stops and the derivation of the stop information ends. By setting it as this structure, it becomes possible to use effectively the regulation period defined as a period for stopping a circuit body.

  Means 11. The gaming machine according to claim 10, wherein the operation of the stop operation means is invalidated until at least the specified period elapses after the stop command is generated.

  According to this means, the operation of the stop operation means is invalidated at least until the specified period elapses after the stop command is generated. By adopting such a configuration, the timing at which the next stop command can be generated can be made uniform regardless of the time required from when the stop command is generated until the corresponding circulating body stops. it can. Therefore, the timing at which the next stop command can be generated depends on the time required for deriving the stop information, and it is possible to avoid the problem that the player feels uncomfortable.

  Means 12. A gaming machine according to any one of the above means 1 to 11, wherein the stop information storage means is configured in units of bytes in association with each partition area of each of the circulating bodies.

  According to this means, the stop information storage means is configured in units of bytes in correspondence with the respective partitioned areas of each circulating body. For this reason, when the stop information of the reachable partition area and the reachable partition area is compared and determined, each stop information may be compared and determined in units of bytes, and the processing configuration can be simplified.

  Means 13. In any one of the above means 1 to 12, the stop partition area deriving means determines that the determination result of the comparison determination means indicates that there is no difference in all stop information of the reachable partition area and the reachable partition area In the case of the game machine, the reaching section area is derived as the stop section area.

  According to this means, when there is no difference in all stop information of the reachable partition area and the reachable partition area, the reachable partition area is derived as the stop partition area. By applying the configuration of each of the above means to such a configuration, it becomes possible to reduce the chance that no difference occurs in all stop information of the reachable partition area and the reachable partition area, and the corresponding laps after the stop command is generated It can suppress that the stop mode until a body stops is monotonous.

  Means 14. In any one of the means 1 to 13, the stop information deriving means is a processing program stored in a read-only first storage device, and the stop information storage means is provided in a readable / writable second storage device. A game machine characterized by being a storage area.

  According to this means, the processing program for deriving the stop information is stored in the read-only first storage device, and the storage area for storing the stop information is provided in the readable / writable second storage device. With this configuration, it is possible to reduce the amount of data stored in the first storage device for stop control. As a result, for example, data relating to game play can be stored in the first storage device to diversify game play.

  In addition, as a gaming machine to which each of the above means can be applied, “a picture row made up of a plurality of pictures (specifically, a reel to which a picture is attached) is variably displayed (specifically, the reel is rotated). A variable display means (specifically a reel unit) for final stop display of the row is provided, and the variation of the picture is started due to the operation of the start operation means (specifically the start lever), and the stop operation means ( Specifically, when a change in the picture is stopped due to the operation of the stop button), and the final stop picture at the time of the stop is a specific picture, the occurrence of a special gaming state (bonus game etc.) that is advantageous to the player, etc. In addition, there are provided a throwing device for performing a throwing process for taking in a game ball from the ball tray and a payout device for paying out the game ball to the ball tray. Equipped with a throwing device Is the configured as an operation of the starter operation means becomes effective by the gaming machine. "Slot machines and pachinko machines can be mentioned well as fused type gaming machine such.

(First embodiment)
Hereinafter, an embodiment in the case of application to a spinning cylinder type gaming machine, which is a kind of gaming machine, specifically, a slot machine will be described in detail with reference to the drawings. 1 is a front view of the slot machine 10, FIG. 2 is a perspective view of the slot machine 10 with the front door 12 closed, FIG. 3 is a perspective view of the slot machine 10 with the front door 12 opened, and FIG. 5 is a rear view of the door 12, and FIG.

  As shown in FIGS. 1 to 5, the slot machine 10 includes a housing 11 that forms an outer shell thereof. The casing 11 is formed in a box shape having an open front as a whole, and is attached by, for example, driving nails against a so-called island facility when installed in the game hall.

  A front door 12 is attached to the front side of the housing 11 so as to be openable and closable. That is, the housing 11 is provided with a pair of upper and lower support shafts 13a and 13b on the left side when viewed from the front, and the front door 12 has a bearing portion 14a at a position corresponding to each support shaft 13a and 13b. , 14b are provided. When the support shafts 13a and 13b are inserted into the bearing portions 14a and 14b, the front door 12 rotates about an opening / closing axis extending in the vertical direction connecting the support shafts 13a and 13b to the housing 11. The front door 12 can be opened and closed by rotating the front door 12 so as to be movable. Further, the front door 12 is brought into a locked state that cannot be opened by a locking device 20 provided on the back surface thereof. A key cylinder 21 that is integrated with the locking device 20 is provided on the upper right side of the front door 12, and is configured such that the locked state is released by a predetermined key operation on the key cylinder 21.

  A game panel 25 for notifying the player of the game state is provided above the center of the front door 12. The game panel 25 is formed with three vertically long display windows 26L, 26M, and 26R, and the inside of the slot machine 10 is visible through the display windows 26L, 26M, and 26R. The display windows 26L, 26M, and 26R may be combined into a single display window.

  As shown in FIG. 3, the inside of the housing 11 is divided into upper and lower parts by a partition plate 30, and a reel unit 31 constituting variable display means is attached to the upper part of the partition plate 30. The reel unit 31 includes a left reel 32L, a middle reel 32M, and a right reel 32R each formed in a cylindrical shape (annular shape). Each of the reels 32L, 32M, and 32R is rotatably supported so that the central axis thereof is the rotation axis of the reel. The rotation axes of the reels 32L, 32M, and 32R are disposed on the same axis extending in the substantially horizontal direction, and the reels 32L, 32M, and 32R correspond to the display windows 26L, 26M, and 26R on a one-to-one basis. . Accordingly, a part of the surface of each reel 32L, 32M, 32R is visible through the corresponding display windows 26L, 26M, 26R. Further, when the reels 32L, 32M, and 32R are rotated forward, the surfaces of the reels 32L, 32M, and 32R are projected as if moving from top to bottom through the display windows 26L, 26M, and 26R.

  Here, the configuration of the reel unit 31 will be briefly described.

  Each of the reels 32L, 32M, and 32R is connected to a stepping motor, and each reel 32L, 32M, and 32R can be individually rotated, that is, independently driven by the driving of each stepping motor. . For example, the stepping motor is set to rotate once by giving a drive signal of 504 pulses (hereinafter also referred to as an excitation pulse), and the rotation position of the stepping motor, that is, the rotation position of the reel is determined by this excitation pulse. Be controlled. In the reel unit 31, a reel index sensor for detecting that the reel has made one rotation is installed on each of the reels 32L, 32M, and 32R. When the reel index sensor detects that the reel has made one rotation, a detection signal is output to the main controller 101 described later each time the reel is detected. Therefore, main controller 101 determines the angular position of each reel 32L, 32M, 32R for each rotation based on the detection signal of the reel index sensor and the number of excitation pulses output until the detection signal is input. It can be confirmed and corrected.

  On the outer peripheral surface of each reel 32L, 32M, 32R, a plurality of symbols as identification information are drawn in the long side direction (circumferential direction). More specifically, 21 symbols are drawn at equal intervals. Therefore, in order to switch the symbol at a predetermined position to the next symbol, it is necessary to output 24 pulses (= 504 pulses / 21 symbols) of excitation pulses. Further, the main control device 101 grasps the symbols visible from the display windows 26L, 26M, and 26R based on the number of excitation pulses output after the detection signal of the reel index sensor is input, or displays the display window. It is possible to perform control to stop a predetermined symbol at a position where it can be visually recognized from 26L, 26M, and 26R.

  Next, the symbols drawn on the reels 32L, 32M, 32R will be described.

  FIG. 6 shows a symbol arrangement of the left reel 32L, the middle reel 32M, and the right reel 32R. As shown in the figure, 21 symbols are arranged in a row on each of the reels 32L, 32M, and 32R. Further, numbers from 0 to 20 are assigned to the reels 32L, 32M, and 32R. These numbers are symbols that are visible to the main controller 101 from the display windows 26L, 26M, and 26R. Is a number for recognizing and not actually attached to the reels 32L, 32M, 32R. However, in the following description, the number is used for explanation.

  As symbols, “bell” symbol (for example, left reel 20th), “red 7” symbol (for example, left reel 18th), “replay” symbol (for example, left reel 17th), “watermelon” symbol (for example, , Left reel 16th), “bar” design (eg left reel 13th), “cherry” design (eg left reel 11th), “youth” design (eg left reel 10th), “white 7” There are 8 types of symbols (for example, second reel on the left). As shown in FIG. 6, the number and arrangement order of various symbols on the reels 32L, 32M, and 32R are completely different.

  Each of the display windows 26L, 26M, and 26R is formed so that there are three symbols from which the entire symbol can be visually recognized out of the twenty-one symbols attached to the corresponding reel. Therefore, when all the reels 32L, 32M, and 32R are stopped, 3 × 3 = 9 symbols are visible through the display windows 26L, 26M, and 26R.

  In this slot machine 10, a total of five combination lines are set, connecting three positions where these nine symbols become visible, three in parallel in the horizontal direction and two in the diagonal direction. ing. More specifically, as shown in FIG. 7, as a combination line in the horizontal direction, an upper line L1 connecting the upper symbols of each reel 32L, 32M, 32R and a middle symbol of each reel 32L, 32M, 32R are connected. A line L2 and a lower line L3 connecting the lower symbols of the reels 32L, 32M, 32R are set. Further, as a combination line in the oblique direction, a lower right line L4 connecting the upper symbol of the left reel 32L, the middle symbol of the middle reel 32M, the lower symbol of the right reel 32R, the lower symbol of the left reel 32L, and the middle symbol of the middle reel 32M. A right rising line L5 connecting the upper symbol of the symbol and the right reel 32R is set. When the combination line is activated, that is, when the symbols are stopped in a predetermined combination on the effective line, a bonus that a predetermined number of medals as game media are paid out is given or a gaming state is a special game. A privilege to be transferred to a big bonus state (hereinafter referred to as “BB state”) is given. In the slot machine 10, the upper line L1, the lower line L3, the lower right line L4 and the upper right line L5 are activated based on the insertion of medals, and the middle line L2 is related to the number of inserted medals. It is not activated at all. That is, even if the symbols are stopped in a predetermined combination on the middle line L2, the above-described privilege is not given, and the middle line L2 is set as a combination line unrelated to winning. Although details will be described later, it is possible to perform an effect using a symbol stop mode by setting a combination line unrelated to winning in this way. In the following description, the combination lines L1, L3, L4, and L5 that can be validated may be referred to as a main line, and the middle line L2 that is not validated may be referred to as a subline.

  FIG. 8 shows a combination of symbols for winning and a privilege to be given when winning.

  Small prizes for which medals are paid out include a watermelon prize, a bell prize, and a cherry prize. When the “watermelon” symbols on the reels 32L, 32M, and 32R are stopped side by side on the active line, 6 medals are paid out as a watermelon prize, and the “bell” symbols on the reels 32L, 32M, and 32R are aligned on the active line. In the case of stopping at, 8 medals are paid out as a bell prize. When the “cherry” symbol on the left reel 32L stops on the active line, four medals are paid out as a cherry prize. That is, in the case of a cherry winning, any symbol may be stopped on the active line for the middle reel 32M and the right reel 32R. In other words, it can be said that if a combination of any “cherry” symbol on the left reel 32L and any symbol on the middle reel 32M and the right reel 32R is stopped on the active line, a cherry prize is established. Therefore, when the “cherry” symbol stops at a position where the plurality of effective lines of the left reel 32L overlap (specifically, the upper stage or the lower stage), a cherry winning is established on each effective line, and the overlapping effective The medal is paid out by multiplying the number of lines. As a result, in this embodiment, eight medals are paid out.

  There are three types of BB wins, a first BB win, a second BB win, and a third BB win, as the state transfer wins in which the game state shifts. When the “red 7” symbols of the reels 32L, 32M, and 32R stop alongside the active line, the first BB winning is established, and the “white 7” symbols of the reels 32L, 32M, and 32R are aligned along the active line. When stopped, the second BB prize is established, and when the “youth” symbols of the reels 32L, 32M, 32R are stopped on the active line, the third BB prize is established. When any of the first to third BB winnings is established, the gaming state shifts to a BB state that is a special gaming state. However, no medals are paid out regardless of which of these BB winnings is established. In the present slot machine 10, since the state shifts to the same BB state regardless of which of the first to third BB winnings, the first to third BBs may be simply referred to as BB hereinafter.

  As a prize to which a privilege other than medal payout or game state transition is given, there is a re-game prize. When the “replay” symbols on the reels 32L, 32M, and 32R are stopped on the active line, the player does not pay out medals or change the gaming state as a re-game winning prize, but the player does not own the medals owned. It is possible to play the next game without reducing and without inserting medals.

  As other winnings, there is a JAC winning that is awarded only when the gaming state is a regular bonus state (hereinafter referred to as “RB state”) described later. In the RB state, when the “replay” symbol, “replay” symbol, and “bell” symbol are stopped from the left on the active line, 15 medals are paid out as a JAC prize.

  Hereinafter, a combination of symbols corresponding to each winning prize is also referred to as a winning symbol combination. For example, a combination of watermelon symbols is a combination of symbols for winning a watermelon, that is, a combination of a “watermelon” symbol, a “watermelon” symbol, and a “watermelon” symbol. The symbols of the reels 32L, 32M, and 32R corresponding to the winnings are also referred to as winning symbols. For example, the JAC symbol is a “replay” symbol for the left reel 32L and the middle reel 32M, and a “bell” symbol for the right reel 32R.

  On the lower left side of the game panel 25, a start lever 41 that is operated to start rotation of the reels 32L, 32M, and 32R is provided. The start lever 41 constitutes start operation means or start operation means operated to start rotation of the reels 32L, 32M, and 32R, that is, to start variable display of symbols. When the start lever 41 is operated with a predetermined number of medals being inserted, the reels 32L, 32M, and 32R start to rotate.

  On the right side of the start lever 41, button-like stop switches 42 to 44 that are operated to individually stop the rotating reels 32L, 32M, and 32R are provided. Each of the stop switches 42 to 44 is disposed immediately below the display windows 26L, 26M, and 26R corresponding to the reels 32L, 32M, and 32R to be stopped. That is, when the left stop switch 42 is operated, the rotation of the left reel 32L is stopped. When the middle stop switch 43 is operated, the rotation of the middle reel 32M is stopped and the right stop switch 44 is operated. In this case, the rotation of the right reel 32R is stopped. The stop switches 42 to 44 constitute stop operation means operated to stop the variable display of symbols based on the rotation of the reels 32L, 32M, 32R. Each stop switch 42, 43, 44 is provided with a lamp (not shown), and these lamps are lit to notify that the stop operation can be performed after a predetermined time has elapsed after the left reel 32L starts rotating. When the corresponding reel stops rotating, it is turned off.

  On the lower right side of the display windows 26L, 26M, 26R, a medal insertion slot 45 for inserting medals is provided. The medal slot 45 constitutes an input means for inputting game media. If attention is paid to the point that the medal insertion slot 45 is directly inserted by the player, it can be said that it constitutes a direct input means for directly inputting the game medium.

  The medals inserted from the medal insertion slot 45 are guided to either the storage passage 47 or the discharge passage 48 by a selector 46 as passage switching means provided on the back surface of the front door 12. More specifically, the selector 46 is provided with a medal path switching solenoid 46a. When the medal path switching solenoid 46a is not excited, the medal is guided to the discharge path 48, and when the medal path switching solenoid 46a is excited, the medal is selected. Is guided to the storage passage 47 side. The medal guided to the storage passage 47 is guided to the hopper device 51 housed inside the housing 11. On the other hand, the medal guided to the discharge passage 48 is guided to the medal tray 50 from the medal discharge port 49 provided in the lower front portion of the front door 12 and returned to the player.

  The hopper device 51 includes a storage tank 52 that stores medals and a payout device 53 that pays out medals to a player. The payout device 53 rotates a medal payout rotating plate (not shown) to discharge the medal to the opening 48 a provided in the discharge passage 48 and to pay out the medal to the medal tray 50 through the discharge passage 48. It has become. Further, a reserve tank 54 is provided on the right side of the hopper device 51 to avoid storing a predetermined amount or more of medals in the storage tank 52. Inside the storage tank 52 of the hopper device 51, a guide plate 52a for discharging medals from the storage tank 52 to the reserve tank 54 is provided. Therefore, when medals are stored more than the height at which the guide plate 52 a is provided, the medals are stored in the reserve tank 54.

  A button-like return switch 55 is provided below the medal slot 45. When the return switch 55 is operated in a situation where a medal inserted into the medal insertion slot 45 is jammed in the selector 46, the selector 46 is mechanically operated so that the medal jammed in the selector 46 becomes a medal. It is returned from the discharge port 49.

  On the lower left side of the display windows 26L, 26M, 26R, there is provided a first credit insertion switch 56 for inserting three credited virtual medals as game media at a time. Further, a second credit insertion switch 57 and a third credit insertion switch 58 are provided on the left side of the first credit insertion switch 56. The second credit insertion switch 57 is for inserting two virtual medals at a time, and the third credit insertion switch 58 is for inserting one virtual medal. Each of the credit insertion switches 56 to 58 constitutes input means for inputting a game medium together with the medal insertion slot 45. It should be noted that the medal insertion slot 45 is accompanied by an operation of directly inserting a medal by the player, whereas each of the credit insertion switches 56 to 58 is only accompanied by an operation of inserting a virtual medal based on the storage memory. In other words, it can be said to constitute indirect input means for indirectly inputting game media.

  A settlement switch 59 is provided on the left side of the start lever 41. In other words, the slot machine 10 has a credit function for storing and storing surplus inserted medals up to a predetermined maximum value (for 50 medals) and payout medals at the time of winning as virtual medals. When the settlement switch 59 is operated under the stored and stored condition, the virtual medal is paid out from the medal discharge port 49 as an actual medal. In this case, if paying attention to the function of paying out the credited virtual medal as an actual medal, it can be said that the checkout switch 59 constitutes a checkout operation means for actually paying out the stored game media.

  Below the display windows 26L, 26M, and 26R of the game panel 25, a credit display unit 60 that displays the number of virtual medals credited, and a remaining payout number that displays the number of remaining medals to be paid out before the BB state ends. A display unit 61 and a payout number display unit 62 for displaying the number of medals paid out at the time of winning are provided. Although these display parts 60-62 are comprised by the 7 segment display, it is naturally possible to substitute by a liquid crystal display etc. FIG.

  Here, the relationship between the bet number of medals and the activated combination lines will be described with reference to FIG. If a medal is inserted from the medal slot 45 at the start of the game, a bet is placed.

  When the first medal is inserted into the medal insertion slot 45, the number of bets becomes 1, and the three combination lines of the upper line L1, the lower line L3, and the lower right line L4 are activated. When the second medal is inserted into the medal insertion slot 45, the number of bets is 2, and the right-up line L5 is activated in addition to the three combination lines. That is, when the bet number becomes 2, all of the four main lines L1, L3, L4, and L5 are validated. When the third medal is inserted into the medal slot 45, the number of bets is three, and all the four main lines L1, L3, L4, and L5 are activated as in the case of the number of bets 2. .

  When four or more medals are inserted into the medal insertion slot 45, if the number of virtual medals stored and stored at that time is less than 50, the surplus medals exceeding three are stored in the slot machine 10. Then, the number of virtual medals on the credit display unit 60 is added and displayed. On the other hand, when the number of virtual medals is 50 or reaches 50, the selector 46 switches from the storage passage 47 to the discharge passage 48, and the surplus medals are returned from the medal discharge port 49 to the medal tray 50. Is done.

  Further, virtual medals are stored and stored, and when any of the first to third credit insertion switches 56 to 58 is operated at the start of the game, the virtual medals are inserted and a bet is made. When any of the first to third credit insertion switches 56 to 58 is operated, the number of virtual medals displayed on the credit display unit 60 is subtracted by the number of inserted virtual medals. Is the same as the case where a medal is inserted from the medal insertion slot 45, and the description is omitted.

  Incidentally, when any one of the first to third credit insertion switches 56 to 58 is operated and the virtual medal to be inserted is not stored and stored, for example, the first display when the display of the credit display unit 60 is “2”. For example, when the credit insertion switch 56 is operated, all the numerical values in the credit display unit 60 are subtracted to 0, and a bet is made for the amount of virtual medals that can be inserted.

  The upper part of the front door 12 has an upper lamp 63 that lights up or flashes as the game progresses, and a pair of left and right sounds that produce various sound effects as the game progresses and inform the player of the gaming state. Speaker 64 and an auxiliary display unit 65 for giving various information to the player. The auxiliary display unit 65 is for executing various display effects as the game progresses, and it can be considered that the game by the reels 32L, 32M, and 32R is caused by the main display unit. The auxiliary display unit 15 is referred to. A display control device 81 for driving the upper lamp 63, the speaker 64, and the auxiliary display unit 65 is provided on the back surface of the auxiliary display unit 15.

  A power supply box 70 is provided on the left side of the hopper device 51 inside the housing 11. The power supply box 70 accommodates a power supply device 91 therein, and includes a power switch 71, a reset switch 72, a setting key insertion hole 73, and the like. The power switch 71 is a start switch for supplying power to each unit including the main controller 101. The reset switch 72 is a switch for resetting an error state of the slot machine 10. Further, the setting key insertion hole 73 is used by a hole manager or the like to adjust the appearance of medals. That is, the hall manager or the like can set the winning probability of the slot machine 10 by inserting the setting key into the setting key insertion hole 73 and turning it ON. The reset switch 72 is operated not only when the error state is reset but also when the winning probability of the slot machine 10 is changed.

  Above the reel unit 31, a main control device 101 that manages and manages games is attached to the housing 11.

  Next, the electrical configuration of the slot machine 10 will be described based on the block diagram of FIG.

  The main control device 101 is equipped with a microcomputer centering on a CPU 102 which is an arithmetic processing means. In addition to the power supply device 91, a clock circuit 103 that outputs a rectangular wave with a predetermined frequency, an input / output port 104, and the like are connected to the CPU 102 via an internal bus. The main control device 101 functions as a main board built in the slot machine 10.

  On the input side of the main controller 101, a reel unit 31 (more specifically, a reel index sensor that individually detects that each of the reels 32L, 32M, and 32R has made one rotation) and a start detection sensor that detects an operation of the start lever 41 are provided. 41a, stop detection sensors 42a to 44a that individually detect the operation of each of the stop switches 42 to 44, a inserted medal detection sensor 45a that detects a medal inserted from the medal slot 45, and a medal paid out from the hopper device 51. Payout detection sensor 51a, credit insertion detection sensors 56a-58a that individually detect the operation of each credit insertion switch 56-58, settlement detection sensor 59a that detects the operation of the settlement switch 59, and reset detection that detects the operation of the reset switch 72 Sensor 72a, setting key insertion hole 7 Various sensors such as a setting key detection sensor 73a for detecting that the setting key is inserted and turned ON are connected, and signals from these various sensors are output to the CPU 102 via the input / output port 104. It has become.

  A power supply device 91 is connected to the input side of the main control device 101 via an input / output port 104. The power supply device 91 includes a power supply unit 91 a that supplies driving power to the electronic devices of the slot machine 10 including the main control device 101, a power failure monitoring circuit 91 b, and the like.

  The power failure monitoring circuit 91b monitors the power-off state and generates a power failure signal not only at the time of power failure but also when the power switch 71 powers off. For this reason, the power failure monitoring circuit 91b monitors the stabilized drive voltage of 12 VDC in this example output from the power supply unit 91a, and determines that the power supply has been shut off when this drive voltage drops below, for example, 10 volts. Power outage signal is output. The power failure signal is supplied to each of the CPU 102 and the input / output port 104. The CPU 102 recognizes this power failure signal and executes a power failure process described later. The power failure signal is also supplied to the display control device 81.

  The power supply unit 91a is configured to output a stabilized voltage of 5 volts that is used as a drive voltage in a control system such as the main controller 101 even when the output voltage drops below 10 volts. As a time for outputting the stabilization voltage, a time sufficient for executing the power failure process by the main controller 101 is secured.

  On the output side of the main controller 101, a reel unit 31 (more specifically, a stepping motor for rotating the reels 32L, 32M, and 32R), a medal path switching solenoid 46a provided in the selector 46, a hopper device 51, a credit A display unit 60, a remaining payout number display unit 61, a payout number display unit 62, a display control device 81, an external concentration terminal board 121 that can transmit information to a hall management device (not shown), and the like are connected via an input / output port 104. Yes.

  The display control device 81 is a control device for driving the upper lamp 63, the speaker 64, and the auxiliary display unit 65, and includes a substrate on which a CPU, a ROM, a RAM, and the like for driving these are integrated. Then, after receiving a signal from the main controller 101, the display controller 81 independently controls the upper lamp 63, the speaker 64, and the auxiliary display unit 65. Therefore, the display control device 81 is a sub-base for executing auxiliary control in relation to the main control device 101 which is a main base for overall management of games. Various display units 60 to 62 may be configured to be driven and controlled by the display control device 81.

  The CPU 102 described above includes a ROM 105 that stores various control programs executed by the CPU 102 and fixed value data, and a work area that temporarily stores various data when executing the control programs stored in the ROM 105. In addition to the RAM 106 for assuring, as is well known, various processing circuits necessary for the slot machine 10 such as an interrupt circuit, a timer circuit, a data transmission / reception circuit, a credit counter for counting the number of credits, etc. Various counters are built-in. The ROM 105 and the RAM 106 constitute a main memory as storage means, and a program for executing various processes shown in the flowcharts of FIG. 12 and subsequent figures is stored in the ROM 105 described above as a part of the control program. Further, as shown in FIG. 10, the ROM 105 includes a sliding table storage area 105a, a pull-in bit table storage area 105b, an offset reference table storage area 105c, a payout number table storage area 105d, a combination correspondence table storage area 105e, and a kicking correspondence table. A storage area 105f, a symbol correspondence table storage area 105g, a mask information storage area 105h, and the like are stored. In these storage areas 105a to 105h, various data used for executing the various processes are stored. Yes.

  The configuration of the RAM 106 will be described with reference to FIG. In the RAM 106, a winning combination determination buffer 151, a smooth table address buffer 152, a steady rotation information buffer 153, a stop reel specifying buffer 154, and a stop, which are used when the reels 32L, 32M, and 32R are stopped. Position buffer 155, priority line buffer 156, lead-in bit offset buffer 157, stop completion information buffer 158, priority order information buffer 159, target reel information buffer 160, target symbol buffer 161, lead-in bit information search A buffer 162, a pull-in bit table buffer 166, a search line buffer 167, a determination confirmation buffer 168, a formation determination buffer 169, a winning combination type buffer 170, a set slip number buffer 171, a rewrite line buffer 172, 1 confirmation information buffer 173, a storage area for temporarily storing various kinds of information such as a second confirmation information buffer 174 and the like are provided. Details of these buffers will be described later.

  The RAM 106 is provided with a backup area 175. The backup area 175 is an area for storing the value of the stack pointer when the power is shut down due to the occurrence of a power failure or the like (including power shut down by operating the power switch 71; the same applies hereinafter). When the power failure is resolved (including power-on by operating the power switch 71; the same applies hereinafter), the slot machine 10 can be restored to the state before power-off based on the information in the backup area 175. ing. Writing to the backup area 175 is executed when the power is cut off by the power failure process (see FIG. 14), and the restoration of each value written in the backup area 175 is executed in the main process (see FIG. 15) when the power is turned on.

  Further, a power failure signal from the power failure monitoring circuit 91b is input to the NMI terminal (non-maskable interrupt terminal) of the CPU 102 when the power is shut down due to the occurrence of a power failure or the like. When the power is shut off, an NMI interrupt process as a power outage information generation process is immediately executed.

  Next, each control process executed by the CPU 102 of the main control apparatus 101 will be described with reference to the flowcharts of FIGS. The processing of the CPU 102 can be broadly divided into a main processing that is started when the power is turned on, a timer interrupt processing that is started periodically (in a cycle of 1.49 msec in the present embodiment), and a power failure signal to the NMI terminal. NMI interrupt processing that is activated in response to the input of. In the following, for convenience of explanation, NMI interrupt processing and timer interrupt processing will be described first, and then the main processing will be described.

  FIG. 12 is a flowchart showing an example of the NMI interrupt process. When the power supply is shut off due to the occurrence of a power failure or the like, a power failure signal is output from the power failure monitoring circuit 91b of the power supply device 91, and the power failure signal is input to the main controller 101 via the NMI terminal. When a power failure signal is input, main controller 101 immediately executes NMI interrupt processing.

  In the NMI interrupt processing, first, in step S101, information on the used registers provided in the CPU 102 is saved in the backup area 175 provided in the RAM 106. Subsequently, in step S102, the power failure information is stored in a power failure information storage area provided in the RAM 106. Thereafter, the information saved in the backup area 175 of the RAM 106 in step S103 is restored to the use register of the CPU 102, and this process is terminated. If the power failure information can be stored without destroying the information in the used registers of the CPU 102, the saving and restoring processing to the backup area 175 can be omitted.

  FIG. 13 is a flowchart of timer interrupt processing periodically executed by the main control apparatus 101. A timer interrupt is generated, for example, every 1.49 msec by the CPU 102 of the main control apparatus 101.

  First, in the register saving process shown in step S201, the values of all registers in the CPU 102 used in the normal process described later are saved in the backup area 175 of the RAM 106. In step S202, it is confirmed whether or not the power failure information is stored. When the power failure information is stored, the process proceeds to step S203, and a power failure process is executed.

  Here, the power failure process will be described with reference to FIG. Since the power failure process is performed immediately after the register saving process in the timer interrupt process, other interrupt processes can be executed without interruption. Therefore, for example, during the process of sending various commands, during the process of reading the switch state (on / off), the interruption process is not executed and this power failure process is not executed. It is no longer necessary to create a power failure processing program that also takes into account This simplifies the processing program for power failure processing and reduces the program capacity. This also applies to a processing program for power recovery processing described later.

  In step S301, it is determined whether command transmission has been completed. If the transmission has not been completed, the process is terminated and the process returns to the timer interrupt process to terminate the command transmission. If step S301 is YES, that is, if the command transmission has ended, the process proceeds to step S302, and the value of the stack pointer of the CPU 102 is stored in the backup area 175 of the RAM 106. Thereafter, in step S303, a RAM determination value, which will be described later, is cleared as a control stop process, and the output state of the output port in the input / output port 104 is cleared, and all actuators (not shown) are turned off. In step S304, a RAM determination value is calculated and stored in the backup area 175. The RAM determination value is specifically a two's complement of the checksum at the work area address of the RAM 106. By storing the RAM determination value in the backup area 175, the checksum of the RAM 106 becomes zero. By setting the check sum of the RAM 106 to 0, subsequent RAM access is prohibited in step S305. After performing the above processing, an infinite loop is entered in preparation for the case where the power supply is completely shut down and the processing cannot be executed. In consideration of, for example, the case where the power failure information is erroneously set due to noise or the like, it is confirmed whether or not the power failure signal is input until the infinite loop is entered. If no power failure signal is input, the power has been recovered from the power failure state. Therefore, writing to the RAM 106 is permitted, the power failure information is reset, and the process returns to timer interrupt processing. If the power outage signal is continuously output, the infinite loop is entered. Incidentally, it is confirmed whether or not a power failure signal is input even under an infinite loop, and when the power failure signal is not input, the processing shifts to the main processing.

  Returning to the description of the timer interrupt process, if the power failure information is not stored in step S202, various processes after step S204 are performed.

  That is, in step S204, a watchdog timer clearing process for initializing the value of the watchdog timer for monitoring the occurrence of malfunction is performed. In step S205, an interrupt end declaration process is performed to enable the next timer interrupt to be set for the CPU 102 itself. In step S206, in order to rotate each reel 32L, 32M, 32R, a stepping motor control process for driving a stepping motor that is a respective rotating drum driving motor is performed. In step S207, the state of various sensors (see FIG. 9) connected to the input / output port 104 is read, and sensor monitoring processing is performed to monitor whether the read result is normal. In step S208, timer calculation processing for subtracting the value of each counter or timer is performed. In step S209, a counter process for outputting the bet number of medals and the result of counting the number of payouts to the external concentration terminal board 121 is performed.

  In step S210, command transmission processing for transmitting various commands to the display control device 81 is performed. In step S211, segment information setting processing for setting segment information displayed on the credit display unit 60, the remaining payout number display unit 61, and the payout number display unit 62 is performed. In step S212, the segment information set by the segment information setting process is supplied to the display units 60 to 62, and the segment information display process for displaying the corresponding numbers and symbols is performed. In step S213, port output processing for outputting information corresponding to the I / O device from the input / output port 104 is performed. In step S214, the value of each register saved in the backup area 175 in the previous step S201 is restored to the corresponding register of the CPU 102. Thereafter, in step S215, an interrupt permission process for permitting the next timer interrupt is performed, and this series of timer interrupt processes is terminated.

  FIG. 15 is a flowchart showing a main process in the main controller 101 that is executed after the power is turned on. The main process is executed when the power is turned on by recovery from a power failure or by turning on the power switch 71.

  First, in step S401, as an initialization process, the stack pointer value is set in the CPU 102, and an interrupt mode that permits interrupt processing is set. Do.

  When these initialization processes are completed, in step S402, it is determined whether or not the setting key is inserted into the setting key insertion hole 73 and is turned ON, and more specifically whether or not the ON signal is received from the setting key detection sensor 73a. Determine. If the setting key has been turned ON, the process proceeds to step S403, and all the information stored in the RAM 106 is cleared as a forced RAM clear process. In subsequent step S404, a winning probability setting process is performed.

  Here, the winning probability setting process will be described with reference to FIG. The slot machine 10 is prepared in advance with six stages of winning probabilities from “Setting 1” to “Setting 6”, and the winning probability setting process sets which winning probability is used to execute the internal processing. It is a process to do.

  In step S501, it is determined whether or not the setting key is inserted and the ON operation is performed. If the ON operation is not performed, the process is terminated as it is. If it is ON, the next timer interrupt is permitted in step S502. Thereafter, the current set value is read in step S503, and the current set value is displayed on the credit display unit 60 in step S504. However, in the process immediately after the setting key is inserted and turned ON, the information in the RAM 106 is cleared by the previous forced RAM clear process, so the setting value displayed on the credit display unit 60 is “1”. is there.

  In step S505, it is determined whether or not the start lever 41 has been operated. If the start lever 41 has not been operated, set value update processing shown in steps S506 to S507 is performed. In step S506, it is determined whether or not the reset switch 72 has been operated. If the reset switch 72 is not operated, the process directly returns to step S504. If the reset switch 72 is operated, the set value is updated by 1 in step S507, and then the process returns to step S504. That is, in the set value update process, every time the reset switch 72 is operated, the set value is updated by 1, and the updated set value is displayed on the credit display unit 60. If the reset switch 72 is operated when the set value is “6”, the set value is updated to “1”.

  If the start lever 41 is operated in step S505, it is determined in step S508 whether the setting key is continuously turned on. If the ON operation of the setting key is continued, the process waits as it is. If the ON operation is ended, the next timer interruption is prohibited in step S509. Thereafter, the setting value is stored in step S510, information other than the setting value stored in the RAM 106 is cleared in step S511, and the process is terminated.

  Returning to the description of the main process, after performing the winning probability setting process in step S404, a normal process for performing main control relating to the game is executed in step S405.

  On the other hand, when the ON operation is not performed in step S402, the power recovery process shown in and after step S406 is performed. The power recovery process is a process for restoring the state of the slot machine 10 to the state before the power is shut off. Therefore, in the power recovery process, it is necessary to first check whether the information in the RAM 106 is normal.

  Therefore, in step S406, it is determined whether or not the set value is normal. Specifically, when the set value is any one of 1 to 6, it is determined to be normal, and when it is 0 or 7 or more, it is determined to be abnormal. If the set value is normal, it is confirmed in step S407 whether or not the power failure information is stored. If the power failure information is stored, it is further confirmed in step S408 whether or not the RAM determination value is normal. Specifically, the checksum value of the RAM 106 is checked to check whether the value is normal, that is, whether the checksum value including the RAM determination value is 0 or not. If the checksum value including the RAM determination value is 0, it is determined that the information in the RAM 106 is normal.

  If it is determined in step S408 that the RAM determination value is normal, the process proceeds to step S409, where the stack pointer value stored in the backup area 175 is written into the stack pointer of the CPU 102, and the stack state is set before the power is shut off. Return to the state. Next, in step S410, a power recovery command is transmitted to the display control device 81 to notify the execution of power recovery processing. After that, in step S411, the stop and automatic settlement setting storage processing is performed, and in step S412, various sensors such as the start detection sensor 41a are initialized. After the above processing is completed, the power failure information is cleared in step S413, and the processing returns to the address before turning off the power. Specifically, the process returns to the timer interrupt process described above, and the watchdog timer clear process (step S204) is executed.

  On the other hand, if any of step S406 to step S408 is NO, that is, the set value is abnormal, the power failure information of the bag set at the time of power-off is not stored, or the RAM determination value is abnormal, There is a high possibility that the information in the RAM 106 has been destroyed. In such a case, the operation prohibiting process shown in steps S414 to S416 is performed. As the operation prohibition process, first, the next timer interrupt process is prohibited in step S414, and in step S415, all the output ports in the input / output port 104 are cleared, so that all actuators connected to the input / output port 104 are Control to off state. Thereafter, in step S416, an error notification process for notifying the hole manager or the like of the occurrence of an error is performed. This operation prohibition state is maintained until the above-described winning probability setting process is performed.

  Next, normal processing for performing main control related to the game will be described based on the flowchart of FIG.

  First, in step S601, it is determined whether or not a medal is bet. If a medal is bet, an effective line setting process is executed in step S602. In the effective line setting process, an effective line corresponding to the number of bets is set. Since the correspondence between the number of bets and the combination line set as an effective line is as described above, the description thereof is omitted here. Thereafter, in step S603, it is determined whether or not the start lever 41 has been operated. If both step S601 and step S603 are YES, that is, if the start lever 41 is operated in a situation where medals are bet, it is determined that a start command has been issued, and the reel rotation process in step S604, step S605 is performed. The reel stop process, the medal payout process in step S606, and the bonus game process in step S607 are sequentially executed, and the process returns to step S601. On the other hand, if it is determined in step S601 that no medal is bet or the start lever 41 is not operated in step S603, the process returns to step S601.

  Here, the reel rotation processing in step S604 will be described based on the flowchart of FIG. The reel rotation process is a process executed to start the rotation of each reel 32L, 32M, 32R. In step S701, a lottery process is executed.

  In the lottery process, as shown in the flowchart of FIG. 19, first, in step S801, a lottery table for determining success / failure is selected based on the current setting state of the slot machine 10, the number of bets, and the like. Here, the setting state of the slot machine 10 is any one of “Setting 1” to “Setting 6”. When “Setting 1”, the lottery table with the lowest BB winning probability is selected, and when “Setting 6”. The lottery table having the highest BB winning probability is selected. The relationship between the setting state and the selected lottery table is not limited to this, and a lottery table with a higher payout rate (expected value of the ratio of the medal payout number to the medal insertion number) is selected as the set value is larger. Any configuration can be used. The number of bets is any one of 1 to 3, and a lottery table is selected such that the winning probability of winning combination increases as the number of bets increases. For example, the winning probability of a winning combination when 3 bets are higher than the winning probability of winning when winning 1 bet. Note that the relationship between the number of bets and the selected lottery table is not limited to this, and the lottery table having a higher payout rate may be selected as the number of bets increases.

  The lottery table will be briefly described. FIG. 20 is a lottery table that is selected when three bets are placed under the normal gaming state of “Setting 1”. In the lottery table, the same number of index values IV as the number of lotteries is set. In other words, in the normal gaming state, there are eight types of lottery winning combinations, watermelon, bell, first BB, second BB, and third BB, which are selected for re-gaming, cherry, cherry and watermelon. Are set to eight index values IV of 1 to 8. Each index value IV is uniquely associated with a lottery role, and a point value PV is set. In each lottery table in the slot machine 10, the point value PV corresponding to each BB combination is set larger as the lottery table has a higher setting value, and the point value PV is set larger as the bet number increases. .

  In step S802, the index value IV is set to 1, and in the subsequent step S803, a determination value DV used for determining whether or not the winning combination is determined is set. In the determination value setting process, a new determination value DV is set by adding a point value PV corresponding to the current index value IV to the current determination value DV. In the first determination value setting process, the random value latched by the random number counter when the start lever 41 is operated is set as the current determination value DV, and this random value corresponds to the current index value IV “1”. The point value PV to be added is added to obtain a new determination value DV. Here, the random number counter will be briefly described. In this slot machine 10, a random number of “0 to 65535” is generated using two 8-bit shift registers. Each shift register is updated by “1” periodically (for example, every 100 ns), and a value obtained by exchanging the upper and lower bits of each shift register is input to the CPU 102 and the start lever 41 is operated (that is, start detection) The value input when the sensor 41a ON signal is received is latched as a random value. This is a device for making the random value used in the first determination value setting process irregular. For example, even if the value obtained by randomly replacing the bits of each shift register is latched as a random value, Good.

  Thereafter, in step S804, it is determined whether or not the combination corresponding to the index value IV is correct. In the winning / no-going determination of the combination, it is determined whether or not the determination value DV exceeds “65535”. If it exceeds “65535”, the winning information of the combination corresponding to the index value IV at that time is stored in the RAM 106 in step S805. This processing is terminated after the winning combination determining buffer 151 is stored. Here, the winning combination determination buffer 151 is configured in units of 1 byte, and “00000000” is stored as an initial value. In step S805, the combination information corresponding to the winning combination in the current lottery process is stored in the winning combination determination buffer 151 as winning information in the combination information (see FIG. 39) described later. The winning combination determination buffer 151 is composed of 2 bytes or more so that a plurality of winning information can be stored simultaneously.

  Incidentally, when the winning information is the small role winning information or the replay winning information, these winning information is cleared to “0” at the end of the game in which the winning information is stored. On the other hand, when the winning information is any of the first BB winning information to the third BB winning information, the BB winning information is cleared to “0” as one of the conditions that the combination of the corresponding BB symbols is stopped on the active line. Is done. That is, the first to third BB winning information may be valid over a plurality of games. In addition, in the success / failure determination of the winning combination after the next game carrying over the 1st to 3rd BB winning information, the success / failure determination of the small role and the replay is performed, but the success / failure determination regarding the 1st to 3rd BB winnings is not performed.

  If the determination value DV does not exceed 65535 in step S804, it means that the combination corresponding to the index value IV is lost. In such a case, 1 is added to the index value IV in step S806, and in the subsequent step S807, it is determined whether or not there is a role corresponding to the index value IV, that is, whether or not there is a role to be determined. Specifically, it is determined whether or not the index value IV added by 1 exceeds the maximum value of the index values IV set in the lottery table. If there is no combination that should be determined to be true or false, this process is terminated. If there is a winning combination to be judged, the process returns to step S803 and the winning judgment of the winning combination is continued. At this time, in step S803, the point value PV corresponding to the current index value IV is added to the determination value DV (that is, the current determination value DV) used for determining whether or not the previous winning combination is a new determination value DV. In step S804, whether or not a winning combination is determined based on the determination value DV. Note that the lottery process is not limited to the configuration in which the determination value DV is added, but may be a configuration in which the maximum value (“65535”) is set to the determination value DV and then subtracted.

  When the lottery table shown in FIG. 20 is selected, each BB winning probability is about 1/900, and the BB winning probability obtained by collecting them is about 1/300. On the other hand, the replay and small role winning probabilities are set higher than the BB winning probability, the replay winning probability is about 7.3, the bell winning probability is about 7.0, and cherry and watermelon The probability of winning only one of them is 1/256, respectively, and the winning probability of the combined role winning cherry and watermelon is 1/256.

  Returning to the description of the reel rotation process, after the lottery process is performed in step S701, the slip table acquisition process is executed in step S702. The sliding table is a table in which it is determined how much the reel is slid (rotated) and stopped after the stop switch is pressed. That is, the sliding table is a symbol number (hereinafter referred to as “reaching symbol number”) that has reached the base point position (lower stage in the present embodiment) when the stop switch is pressed, and the base point position. This is a stop information group in which a relationship with a symbol number to be actually stopped (hereinafter referred to as “stop symbol number”) is defined.

  The sliding table is stored in the sliding table storage area 105a of the ROM 105, and only the sliding table used for stopping the left reel 32L at the first stop is stored in the sliding table storage area 105a. That is, the sliding table used when stopping the left reel 32L at the second stop or the third stopping is not stored in the ROM 105, and the sliding table used when stopping the middle reel 32M or the right reel 32R is stopped. They are not stored in the ROM 105 regardless of the order. Although details will be described later, when stopping reels in which the slip table to be used is not stored, the priority information created in each priority information creation process such as the priority information creation process for the second and subsequent stops is used. Used as a stop information group.

  The slip table storage area 105a stores a slip table set in correspondence with each winning combination. Further, in the slot machine 10, since the winning combination determination buffer 151 may carry one of the first combination and the third BB winning information, the small combination or replay may be won, so the sliding table storage area 105a Stores a sliding table set in correspondence with each winning combination in each game situation. The gaming machine will be described in more detail. In the slot machine 10, the BB non-winning situation in which none of the first to third BB winning information is stored in the winning combination determining buffer 151, and the winning combination determining buffer 151 include The first BB winning status in which 1BB winning information is stored, the second BB winning status in which the second BB winning information is stored in the winning combination determining buffer 151, and the third BB winning information in which the third BB winning information is stored in the winning combination determining buffer 151 And 3BB winning status. Hereinafter, a situation in which the game situation is any of the first to third BB winning situations is referred to as a BB winning situation.

  Here, the configuration of the sliding table will be described with an example. FIG. 21 is a slide table set in association with a case where no other combination is won in the first BB winning situation.

  As shown in FIG. 21, in the slip table, the number of slips is set in a one-to-one correspondence with each of the 21 symbol numbers. When the left stop switch 42 is operated, the number of slips is stopped when the reaching symbol is stopped as it is ("0" in FIG. 21), and when the reaching symbol is slid by one symbol rather than when the reaching symbol is stopped as it is. (“1” in FIG. 21), when stopping after reaching 2 symbols rather than stopping the reaching symbol as it is (“2” in FIG. 21), slipping by 3 symbols than when stopping the reaching symbol as it is. In the case of stopping after being stopped (“3” in FIG. 21), the five patterns of the case of stopping after slid by 4 symbols (“4” in FIG. 21) than the case of stopping the reaching symbols as they are are the stop modes of the reels. It is prepared as. This is a device for closely associating the timing at which the player operates the left stop switch 42 with the symbol arrangement (hereinafter, referred to as “stop appearance”) that stops within the visible range from the left display window 26L. is there. That is, by stopping the left reel 32L until the specified time (190 msec) has elapsed from the timing at which the left stop switch 42 is operated, the player has the impression that the stop appearance has been determined by the player's operation. It is possible to hold it. In addition, by making it possible to slide up to 4 symbols as compared with the case where the reaching symbol is stopped as it is, the so-called oversight that the symbol or symbol combination corresponding to the winning combination does not stop on the effective line occurs. It is possible to reduce the frequency, and it is possible to avoid the problem that the combination of winning symbols stops on the active line even though the winning combination is not won.

  A symbol with a slip number of “0” is a symbol that actually stops in the lower stage. For example, when the left stop switch 42 is pressed while the “red 7” symbol, which is the 18th symbol of the left reel 32L, has reached the lower stage, the left reel 32L stops without sliding. In addition, a symbol having a number whose slip number is not “0” means that the reel slides by the number of symbols described as compared to the case where the reaching symbol is stopped as it is. For example, when the left stop switch 42 is pressed while the “bar” symbol which is the 13th symbol of the left reel 32L has reached the lower stage, the number of slips is “3”, so the left reel 32L has three symbols. The “watermelon” symbol, which is the 16th symbol, stops at the lower level, and the “red 7” symbol, which is the 18th symbol, stops at the upper level.

  Even when the slip table is acquired, the “red 7” symbol may not stop on the active line depending on the timing when the left stop switch 42 is pressed, and the overwriting may occur. This is because the range that can be slid is predetermined within 190 msec (maximum of 4 symbols) from the timing when the stop switch is pressed, and from the “red 7” symbol that reached the lower row, the “red” that reaches the next lower row 7 ”because the interval where the interval to the symbol is more than 5 symbols is set. In the slot machine 10, in addition to the “Red 7” symbol, a “watermelon” symbol, a “Cherry” symbol, a “Youth” symbol, and a “White 7” symbol are set at intervals of 5 symbols or more. That is, for the watermelon role, the cherry role, and the first to third BB roles, even if a winning is made in the lottery process, an overshoot may occur depending on the timing when the left stop switch 42 is pressed.

  In the sliding table, priority lines and lead-in bit offsets are set in correspondence with 21 symbol numbers on a one-to-one basis. Although details will be described later, each information of the priority line and the lead-in bit offset is acquired in the first stop sliding number acquisition process, and when priority information as a stop information group is generated in each priority information generation process, etc. used.

  In the slip table acquisition process of step S702, by referring to the information stored in the winning combination determination buffer 151 of the RAM 106, it is determined whether or not the gaming status in the current game and the winning combination such as the small combination or replay are won, Among the slip tables stored in the slip table storage area 105a, the address of the slip table corresponding to the determination result is acquired. The acquired address is stored in the smooth table address buffer 152 of the RAM 106. Thereafter, in step S703, start interrupt processing is permitted.

  Here, the start interrupt process will be described with reference to the flowchart of FIG. The start interrupt process is a part of the stepping motor control process in step S206 in the timer interrupt process (see FIG. 13). Then, by executing the processing of step S703 in the reel rotation processing, start interrupt processing is executed as part of a series of processing in the stepping motor control processing. As described above, since the timer interrupt process is started at a cycle of 1.49 msec, the start interrupt process is also started at a cycle of about 1.49 msec while the start interrupt process is permitted.

  In the start interrupt process, first, in step S901, it is determined whether or not steady rotation information is stored in the steady rotation information buffer 153 of the RAM 106. If steady rotation information is not stored, it is determined in step S902 whether acceleration processing is in progress.

  When the acceleration process is not in progress, it means that the reels 32L, 32M, 32R have not started rotating. In such a case, it is further determined in step S903 whether the wait time has elapsed. The wait time is a time set for waiting until a predetermined time (for example, 4.1 seconds) elapses from the time when the reel starts rotating in the previous game. If the wait time has not elapsed, the start interrupt process is terminated as it is. Thereby, even if the player bets a medal and operates the start lever 41, the reels 32L, 32M, and 32R may not immediately start rotating. If the wait time has elapsed, acceleration processing is started in step S904, and rotation of each of the reels 32L, 32M, 32R is started. Note that the process for waiting until the wait time in step S903 elapses may be performed between step S702 and step S703 in the reel rotation process.

  If it is determined in step S902 that the acceleration process is being performed, or if the acceleration process is started in step S904, the process proceeds to step S905, where the acceleration process is completed and each reel 32L, 32M, 32R becomes a steady rotation. It is determined whether or not. If the engine is not in the steady rotation, the start interrupt process is terminated as it is. If the engine is in the steady rotation, the engine is started after the steady rotation information is stored in the steady rotation information buffer 153 of the RAM 106 in step S906. End interrupt processing. Here, the steady rotation information is information indicating that the reels 32L, 32M, and 32R are rotating in a steady manner. For this reason, if steady rotation information is stored in step S901, it means that the acceleration process has already been completed, and therefore the start interrupt process is terminated as it is.

  Returning to the description of the reel rotation process, after permitting the start interrupt process in step S703, the irregular push priority information creating process is executed in step S704. The irregular pressing priority order information creating process assumes a case where the middle reel 32M or the right reel 32R is stopped at the time of the first stop (when so-called irregular pressing is performed). This is a process for creating. The irregular pressing priority order information creation process will be described together with the reel stop process when the reels 32M and 32R other than the left reel 32L are stopped as the first stop for easy understanding.

  In a succeeding step S705, it is determined whether or not the steady rotation information is stored in the steady rotation information buffer 153. If the steady rotation information is not stored, it means that the reels 32L, 32M, 32R are not rotating at regular intervals, and therefore the process of step S705 is repeatedly executed. That is, the process waits in step S705 until the reels 32L, 32M, and 32R rotate at a steady speed. When the reels 32L, 32M, and 32R are in the normal rotation and the normal rotation information is stored in the start interrupt process, an affirmative determination is made in step S705, and the process proceeds to step S706. In step S706, start interrupt processing is prohibited and the steady rotation information stored in the steady rotation information buffer 153 of the RAM 106 is cleared. Thereafter, the reel rotation process is terminated.

  Next, the reel stop process in step S605 will be described based on the flowchart of FIG. In step S1001, whether or not any of the stop switches 42 to 44 is operated to generate a reel stop command, more specifically, an ON signal is output from the stop detection sensors 42a to 44a corresponding to the rotating reel. It is determined whether or not it has been received. If no stop command has been generated, the system waits until a stop command is generated. Here, in the present embodiment, a period from the start of rotation of each reel 32L, 32M, 32R until steady rotation at a predetermined speed is set as an invalid period, and the stop switch 42 is set within this invalid period. Even if .about.44 is operated, the ON signals from the stop detection sensors 42a to 44a are invalidated.

  If a stop command is generated, in step S1002, whether or not the current stop command is the first stop command, that is, when all the three reels 32L, 32M, and 32R are rotating, the stop switches 42 to 44 are turned on. It is determined whether or not a pressing operation has been performed. If it is the first stop command, the process proceeds to step S1003 to execute the first stop process. If it is not the first stop command, it is determined in step S1004 whether or not the current stop command is the second stop command, that is, when one of the three reels 32L, 32M, and 32R is stopped and two are rotating. It is determined whether or not a stop switch corresponding to the rotating reel has been pressed. If it is the second stop command, the process proceeds to step S1005 to execute the second stop process. If it is not the second stop command, the process proceeds to step S1006 to execute a third stop process.

  After these first to third stop processes, it is determined in step S1007 whether or not the rotation of all the reels 32L, 32M, 32R has been stopped. If the rotation of all the reels 32L, 32M, and 32R has not stopped, the process returns to step S1001, and if the rotation has stopped, the payout determination process is performed in the subsequent step S1008, and then the reel stop process is terminated. .

  In the payout determination process, it is determined whether or not the symbol or the combination of symbols corresponding to the winning combination is stopped on the active line. If not, the payout number storage area of the RAM 106 is set. Clear to “0”. When the winning combination is determined, the winning combination determination buffer 151 is referred to, and it is determined whether or not the combination corresponding to the symbol or combination of symbols stopped on the active line matches the winning combination. If they do not match, an error is displayed by the upper lamp 13 and the payout amount storage area is cleared to “0”. If they match, it means that the winning combination for the winning combination has been established, so the number of payouts corresponding to the winning combination is stored in the payout amount storage area. To do. In the payout determination process, it is determined whether or not the symbol or symbol combination corresponding to the symbol that is the subject of the lottery on the active line is stopped using the symbol correspondence information and the symbol correspondence information described later. To do. In the payout determination process, the payout number corresponding to the winning combination is specified using a payout number table to be described later, and the payout number is stored in the payout amount storage area.

  Here, in the slot machine 10, the second stop operation is validated until a predetermined first valid waiting period (for example, 200 msec) elapses after the first stop command is generated based on the first stop operation. No second stop command is generated. And the processing time is set so that the 1st stop process mentioned later may be complete | finished within this 1st effective waiting period. Similarly, the third stop operation is not validated until a predetermined second effective waiting period (for example, 200 msec) elapses after the second stop command is generated based on the second stop operation. The third stop command is not generated. Then, the processing time is set so that the second stop process to be described later ends within the second effective waiting period. By setting the first and second effective standby periods in this way, it is not necessary to start the deceleration process for the next reel before the reel stop corresponding to the stop command is completed. For example, assuming that it is necessary to start the deceleration process for the next reel before the stop of the reel corresponding to the stop command is completed, it becomes necessary to perform the stop process for two reels in parallel, and the process becomes complicated However, in the present slot machine 10, the complexity of the processing can be suppressed. In the slot machine 10, the first valid standby period and the second valid standby period are set as the same period, but the periods may be different.

  Hereinafter, each process of the first to third stop processes will be described. In the present embodiment, the processing mode of each process is different between when the left reel 32L is stopped as the first stop and when the middle reel 32M or the right reel 32R is stopped. In order to facilitate understanding, first, each process when the left reel 32L is stopped as the first stop will be described, and then each process when the middle reel 32M or the right reel 32R is stopped as the first stop. Will be explained. In the following, a case where two or three medals are bet and all the main lines L1, L3, L4, and L5 become effective lines will be described. The case where one bet is placed is the same as the case of two bets or three bets except that the effective line to establish a winning is limited, and thus description thereof is basically omitted.

  First, the first stop process will be described with reference to the flowchart of FIG. In step S1101, first stop sliding number acquisition processing is executed.

  In the first stop slip number acquisition process, as shown in the flowchart of FIG. 25, first, in step S1201, whether or not the stop reel information stored in the stop reel specifying buffer 154 of the RAM 106 is information indicating the left reel 32L. Determine. The stop reel information is stored in the stop reel specifying buffer 154 when detection signals are received from the stop detection sensors 42a to 44a. The stop reel specifying buffer 154 includes a first stop reel specifying buffer, a second stop reel specifying buffer, and a third stop reel specifying buffer, and the stop reel information corresponds to the order of stop commands. Stored in the buffer.

  When the stop reel information is information indicating the left reel 32L, a slip number acquisition process based on the slip table in steps S1202 to S1206 is executed. On the other hand, if the stop reel information is not information indicating the left reel 32L, a slip number acquisition process based on the priority information in steps S1207 to S1208 is executed. In other words, it can be said that the slot machine 10 selects one of the slip number acquisition process based on the slip table and the slip number acquisition process based on the priority order information according to the stop target for the first stop. Since the case where the left reel 32L is stopped as the first stop has been described as described above, an affirmative determination is made in step S1201, and a slip number acquisition process based on the slip table in steps S1202 to S1206 is executed.

  In step S1202, the arrival symbol number that has reached the lower stage of the left display window 26L when the first stop command is received is acquired. In the subsequent step S1203, the smooth table address is obtained from the smooth table address buffer 152 of the RAM. The slip table address is stored in the slip table address buffer 152 in the slip table acquisition process in step S702 described above. Thereafter, in step S1204, the number of threads corresponding to the reaching symbol number acquired in step S1202 is acquired from the threshold table (see FIG. 21) of the address.

  In subsequent step S1205, stop position setting processing is executed. In the stop position setting process, the number of slips acquired in step S1204 is added to the reaching symbol number, and the stop symbol number that is actually stopped at the lower stage of the left display window 26L is calculated. The calculated stop symbol number is stored in the stop position buffer 155 of the RAM 106 as stop position information.

  In the following step S1206, the priority line corresponding to the reaching symbol number is stored as priority line information in the priority line buffer 156 of the RAM 106, and the value of the drawing bit offset corresponding to the reaching symbol number is set as the drawing bit offset information in the RAM 106. Are stored in the buffer 157 for the drawn-in bit offset, and then the first stop sliding number acquisition process is terminated. Specifically, since the priority line and the lead-in bit offset are set in the slip table in a one-to-one correspondence with the symbol number, the priority line and the lead-in bit offset corresponding to the reaching symbol number are acquired, Are stored in the corresponding buffers 156 and 157.

  Here, the priority line is a line that preferentially stops a combination of symbols corresponding to the winning combination among a plurality of active lines L1, L3, L4, and L5. For example, when the priority line is “L4”, the symbol combination corresponding to the winning combination is stopped in preference to the right-downward line L4. The pull-in bit offset is information for specifying a pull-in bit table to be referred to when creating priority information described later.

  Returning to the description of the first stop process, after the first stop slip number acquisition process is executed in step S1101, the stop interrupt process is permitted in step S1102.

  The stop interrupt process will be described with reference to the flowchart of FIG. The stop interrupt process is a part of the stepping motor control process in step S206 in the above-described timer interrupt process (see FIG. 13). Then, by executing the process of step S1102 in the first stop process, a stop interrupt process is executed as part of a series of processes in the stepping motor control process. As described above, since the timer interrupt process is started at a cycle of 1.49 msec, the stop interrupt process is also started at a cycle of about 1.49 msec while the stop interrupt process is permitted.

  In the stop interrupt process, first, in step S1301, it is determined whether stop completion information is stored in the stop completion information buffer 158 of the RAM. If stop completion information is not stored, it is determined in step S1302 whether deceleration processing is in progress. If the deceleration process is not in progress, it means that the reel to be stopped this time is rotating in a steady manner. In such a case, the process proceeds to step S1303, and it is determined whether or not the symbol number that has reached the base point position (lower stage in the present embodiment) matches the stop symbol number set in the previous stop position setting process. . If they match, deceleration processing is started in step S1304. As a result, the symbol of the stop symbol number corresponding to the stop position information stored in the stop position buffer 155 of the RAM 106 stops at the base point position of the first stop target reel.

  If it is determined in step S1302 that deceleration processing is in progress, if it is determined in step S1303 that the stop symbol number has not reached the base point position, or if deceleration processing is started in step S1304, step S1305 is performed. Then, it is determined whether or not the deceleration process is completed and the first stop target reel is stopped. If not stopped, the stop interrupt process is terminated as it is. If stopped, the stop completion information is stored in the stop completion information buffer 158 of the RAM 106 in step S1306, and then the stop interrupt process is performed. finish. Here, the stop completion information is information indicating that the first stop target reel is stopped. For this reason, if stop completion information is stored in step S1301, it means that the deceleration process has already been completed, and therefore the stop interrupt process is ended as it is.

  Returning to the description of the first stop process, after permitting the stop interrupt process in step S1102, the stop reel information stored in the stop reel specifying buffer 154 of the RAM 106 is information indicating the left reel 32L in step S1103. It is determined whether or not. If the stop reel information is not information indicating the left reel 32L, the process proceeds to step S1106 after executing the processing of step S1104 and step S1105. If the stop reel information is information indicating the left reel 32L, the process proceeds to step S1106. . Here, since the case where the left reel 32L is stopped as a first stop is described, an affirmative determination is made in step S1103, and the process directly proceeds to step S1106.

  In step S1106, the second stop and subsequent priority information creation processing is executed, and the process proceeds to step S1107. In step S 1107, it is determined whether stop completion information is stored in the stop completion information buffer 158. If stop completion information is not stored, the process of step S1107 is repeatedly executed. That is, the process waits in step S1107 until stop completion information is stored in the stop interrupt process, that is, until the first stop target reel stops. If stop completion information is stored, the process advances to step S 1108 to prohibit stop interrupt processing and clear the stop completion information from the stop completion information buffer 158 of the RAM 106. Thereafter, the first stop process is terminated.

  Here, the second stop and subsequent priority information generation processing in step S1106 will be described based on the flowchart of FIG. Prior to detailed description, the outline will be described prior to the detailed description. In the ROM 105, a sliding table is prepared assuming that the left reel 32L is stopped at the time of the first stop. No sliding table is prepared assuming that the right reel 32R is stopped. Therefore, in order to stop a reel for which no slide table is prepared, priority order information is created before the reel can be stopped.

  This priority order information is a stop information group for determining the priority order of symbol numbers to be stopped at the base point position (in the lower part of the display window in the present embodiment) with respect to the corresponding reel, and when the stop switch is pressed The slide table in which the relationship between the reaching symbol number that has reached the base point position and the stop symbol number that actually stops at the base point position is different in information properties. Further, the priority order information is created based on the stop position of the reel for which the stop operation has already been performed, the above-described gaming situation of the slot machine 10, the lottery result in the lottery process, and the like. In creating the priority information, each buffer in the RAM 106 is used. Of these buffers, the priority information buffer 159 is particularly important. Therefore, the priority information buffer 159 will be described. FIG. 28 is an explanatory diagram for explaining the priority order information buffer 159.

  As shown in FIG. 28A, the priority order information buffer 159 includes a large number of determination value calculation information buffers B (stop information storage means). The determination value calculation information buffer B is provided in one-to-one correspondence with each symbol number of each reel 32L, 32M, 32R. Further, since symbols are set for the symbol numbers of the reels 32L, 32M, and 32R, it can be said that the determination value calculation information buffer B is provided in one-to-one correspondence with the symbols. Since 21 determination value calculation information buffers B are allocated to each of the reels 32L, 32M, and 32R, the priority order information buffer 159 has a total of 63 determination value calculation information buffers B.

  As shown in FIG. 28B, each determination value calculation information buffer B includes a first buffer B1 as a higher information buffer and a second buffer B2 as a lower information buffer. Each of the first buffer B1 and the second buffer B2 is composed of 1 byte. Therefore, each determination value calculation information buffer B is composed of 2 bytes, and the priority order information buffer 159 is composed of 126 bytes in total.

  Each bit of the first buffer B1 and the second buffer B2 has a function for storing unique determination information individually or in a predetermined combination. Specifically, in the first buffer B1, the highest 7th bit has a function as an unfair winning determination bit for storing the unfair winning determination information, and the sixth bit stores replay information. The 5th bit has a function as a BB role bit for storing BB role information, and the 4th bit as a small role bit for storing small role information. The third to 0th bits have a function as acquired number bits for storing acquired number information.

  In addition, in a configuration having a gaming state other than the BB state as a special gaming state to be transferred based on the establishment of the transition trigger symbol, the BB combination bit may have a function of storing the combination information corresponding to the gaming state. Good. From this point of view, it can be said that the BB combination bit is a special game state combination bit. This configuration will be described more specifically. For example, in a configuration in which the first special game state and the second special game state are set as the special game state, a special game state combination bit consisting of 1 bit is set in the determination value calculation information buffer B, and the first special game state is set. The game state combination information and the second special game state combination information may be stored in the special game state combination bit. Further, in a configuration where there is a situation in which the first special gaming state combination and the second special gaming state combination are won, the special gaming state combination bit is set to each of the first special gaming state combination and the second special gaming state combination. The special game state combination bit corresponding to the special game state combination for which establishment is given priority may be set as a higher-order bit. By the way, as a special game state other than the BB state, an SB (single bonus) state in which only one game is continued can be considered. In addition, so-called RB state, CB state, or CT state can be considered.

  As for the second buffer B2, the most significant seventh bit has a function as a kick determination bit for storing kick determination information, and the sixth bit is a first bit for storing first priority line information. It has a function as a priority line bit, the second to first bits have a function as a pull-in bit for storing pull-in bit information, and the zeroth bit is a second for storing second priority line information. It functions as a priority line bit. Note that the fifth to third bits of the second buffer B2 are blank.

  Based on each bit of the first buffer B1 and the second buffer B2, the total value (priority determination value) of the determination value calculation information buffer B is calculated, and the priority when the total value stops the above-described symbols. It becomes. That is, a symbol number with a higher total value has a higher priority, and a symbol number with a lower total value has a lower priority. Among the above bits, the initial value of the unfair winning determination bit and the kick determination bit is “1”, and the initial value of the other bits is “0”.

  When the left reel 32L is stopped as the first stop, two patterns of the case where the middle reel 32M is stopped as the second stop and the case where the right reel 32R is stopped can be considered. In the information creation process, priority order information for the middle reel 32M and priority order information for the right reel 32R are created. The creation of the priority information will be specifically described based on a flowchart.

  As shown in FIG. 27, in the second stop and subsequent priority information creation processing, first, in step S1401, the number of target reels for which priority information is created in the current second stop and subsequent priority information creation processing (specifically, "2") is stored in the target reel counter of the RAM 106, and information indicating the left reel 32L is stored as target reel information in the target reel information buffer 160 of the RAM 106.

  In the subsequent step S1402, it is determined by referring to the target reel information buffer 160 and the stop reel specifying buffer 154 whether the target reel information is information indicating a reel for which a stop command has already been generated. If it is not information indicating a reel for which a stop command has already been issued, the process proceeds to step S1404 after executing the determination value calculation information creation process in step S1403. On the other hand, if the information indicates a reel for which a stop command has already been issued, the process proceeds to step S1404 without executing the determination value calculation information creation process. Since this time is the case where the left reel 32L is stopped as the first stop, an affirmative determination is made in step S1402, and the process proceeds to step S1404.

  In step S1404, it is determined whether or not the value of the target reel counter is “0”. If it is not “0”, in step S1405, the target reel information stored in the target reel information buffer 160 is updated, the value of the target reel counter is decremented by 1, and the process returns to step S1402. The target reel information is updated when the already stored target reel information is information indicating the left reel 32L, and is updated to the target reel information indicating the middle reel 32M. If the information indicates the reel 32M, the information is updated to target reel information indicating the right reel 32R. When the target reel information is updated to information indicating a reel for which a stop command has not yet been issued, an affirmative determination is made in step S1402, and a determination value calculation information creation process is executed in step S1403.

  The determination value calculation information creation process will be described based on the flowchart of FIG. Prior to detailed description, the outline will be described. In the determination value calculation information creation process, each symbol number is stopped at the base point position (lower stage in the present embodiment) in the reel indicated by the target reel information (hereinafter referred to as the target reel). Assuming the case, a process of storing “0” or “1” information is performed for each bit of the determination value calculation information buffer B corresponding to the assumed target symbol number in consideration of various states. . For example, in a situation where the 18th “red 7” symbol of the left reel 32L is stopped in the lower stage, and the target symbol number is 0 of the middle reel 32M, the situation shown in FIG. 30 (a) is assumed. The information is stored in each bit of the determination value calculation information buffer B. In the determination value calculation information creation process, the target symbol number is updated one by one, and information is stored in each bit of the determination value calculation information buffer B corresponding to each symbol number. Therefore, after information is stored in each bit of the determination value calculation information buffer B corresponding to the symbol number 0 of the middle reel 32M, the target symbol number is No. 1, and the situation shown in FIG. 30 (b) is assumed. Then, information is stored in each bit of the determination value calculation information buffer B corresponding to the first symbol number.

  As shown in FIG. 29, in the determination value calculation information creation process, first, in step S1501, the determination value calculation information buffer address of the target reel is acquired. That is, based on the target reel information stored in the target reel information buffer 160 of the RAM 106, the reel for which priority information is to be created this time is specified, and judgment value calculation information for the number of symbols corresponding to that reel (21 pieces) is calculated. The address of the buffer B is acquired.

  In the subsequent step S1502, the information stored in the target symbol buffer 161 of the RAM 106 is initialized, that is, “0” is cleared. Thereby, No. 0 becomes the target symbol number. Thereafter, information of “0” or “1” is obtained for each bit of the determination value calculation information buffer B of the target symbol number by executing the drawing bit information setting processing in step S1503 and the winning determination processing in step S1504. And determination value calculation information is created.

  In the subsequent step S1505, by updating the information in the target symbol buffer 161, the target symbol number is set to a symbol number one higher than the currently set symbol number. Thereafter, in step S1506, it is determined whether or not all determination value calculation information for the target reel has been created. If not created, the process returns to step S1503. As a result, the processing from step S1503 to step S1505 is repeated until all the determination value calculation information of No. 0 to No. 20 in the target reel is created. Then, when all determination value calculation information is created, an affirmative determination is made in step S1506, and the determination value calculation information creation process is terminated.

  The details of the drawn bit information setting process in step S1503 and the winning determination process in step S1504 will be described in detail.

  First, the lead-in bit information setting process will be described based on the flowchart of FIG. Here, the pull-in bit constitutes a part of the second buffer B2 in the determination value calculation information buffer B as described above. By storing the pull-in bit information in such a pull-in bit, it is possible to diversify the stopping points when no winning is made in the lottery process. In addition, when a winning combination is won in the lottery process, if a so-called miss-out occurs, it is possible to stop corresponding to that. In particular, in the BB winning situation, a so-called reach (refers to a stopout that can teach the BB winning situation. However, even if the BB non-winning situation is avoided, it may appear if an unfair winning prize is avoided). It can appear suitably. As this reach, for example, in any of the combination lines L1 to L5, the “red 7” symbol, the “white 7” symbol, the “young” symbol, and the “bar” symbol are arranged in any order and combination. For example, there is a stop appearance in which a symbol or a combination of symbols corresponding to the combination that is the subject of the lottery on the middle line L2 (ineffective line) stops. In the attraction-in bit information setting process, preparation for acquiring the value of the attraction-in bit in the winning determination process is performed.

  In the drawn-in bit information setting process, as shown in FIG. In the preparatory process for the drawn bit information expansion, first, the drawn bit information search buffer 162 of the RAM 106 is initialized. Here, the pull-in bit information search buffer 162 is a buffer prepared for acquiring the pull-in bit information. As shown in FIG. 32A, the left reel buffer 163, the middle reel buffer 164, And the right reel buffer 165. The reel buffers 163, 164, and 165 respectively have upper buffers 163a, 164a, and 165a, middle buffers 163b, 164b, and 165b, and lower buffers 163c, 164c, and 165c, respectively. Have. That is, the pull-in bit information search buffer 162 includes nine buffers 163a to 163c, 164a to 164c, and 165a to 165c. Each of these nine buffers 163a to 163c, 164a to 164c, and 165a to 165c has a 1-byte configuration. In the state where the pull-in bit information search buffer 162 is initialized, “FF” is stored in each of the buffers 163a to 163c, 164a to 164c, and 165a to 165c, as shown in FIG.

  Thereafter, all the bits of the two buffers not on the priority line are cleared for the reel buffer corresponding to the reel for which a stop command has already been issued. Since a stop command has already been generated for the left reel 32L this time, the buffers 163a to 163c of the left reel buffer 163 are targeted. For example, when the priority line is the right rising line L5, as shown in FIG. 32C, all the bits of the upper buffer 163a and the middle buffer 163b that are not on the right rising line L5 are cleared to "00". Thus, the lower buffer 163c on the right-up line L5 remains “FF”. After executing the preparation process before drawing bit information expansion in the drawing bit information setting process, the drawing bit table acquisition process is executed in step S1602.

  In the pull-in bit table acquisition process, a process of acquiring one pull-in bit table from a large number of pull-in bit tables stored in the pull-in bit table storage area 105b of the ROM 105 is executed based on the pull-in bit offset already acquired.

  Specifically, as shown in FIG. 33, first, in step S1701, an offset reference table acquisition process is executed. In the offset reference table acquisition process, if there is an offset reference table, the offset reference table is acquired based on the game situation in the current game and the presence / absence of a winning combination. The offset reference table is a group of information that is stored in advance in the offset reference table storage area 105c of the ROM 105 and that acquires the pull-in bit table based on the pull-in bit offset that has already been acquired. However, such an offset reference table is not prepared for a situation in which a winning combination that does not cause missing is selected. Withdrawal bit information, as mentioned above, to make a predetermined stoppage when there is no winning in the lottery process, or when a so-called spillover occurs when winning a role in the lottery process Therefore, it is not necessary to store the pull-in bit information in the pull-in bit of the determination value calculation information buffer B for the situation where the winning combination that does not cause the miss-out occurs, and it is also necessary to acquire the pull-in bit table accordingly. Because there is no. In this case, for example, there is a situation where a re-game player is won.

  Here, the offset reference table will be specifically described. Each pull-in bit offset is stored in the offset reference table, and a pull-in bit table number is assigned corresponding to each pull-in bit offset. More specifically, two pull-in bit table numbers from among a large number of pull-in bit table numbers (for example, 100) are assigned to each pull-in bit offset. When the left reel 32L is stopped as the first stop, the number of one pull-in bit table is for the middle reel 32M, and the number of the other pull-in bit table is for the right reel 32R. In this way, by setting the number of the pull-in bit table based on the one pull-in bit offset and the offset reference table, the amount of information stored in the RAM 106 when acquiring the pull-in bit table is obtained. Reduction can be achieved. For example, if the configuration is such that the number of the drawing bit table is directly stored without providing the drawing bit offset, the number of the drawing bit table for the middle reel 32M and the number of the drawing bit table for the right reel 32R are individually stored. It is necessary to keep.

  In the following step S1702, it is determined whether or not there is an offset reference table to be acquired in step S1701. If there is no offset reference table, after clearing the pull-in bit table buffer 166 for storing the pull-in bit table number information in step S1703, the pull-in bit table acquisition process is terminated. On the other hand, if there is an offset reference table, the process advances to step S1704 to determine whether or not the pull-in bit offset stored in the pull-in bit offset buffer 157 of the RAM 106 is “0”.

  In the offset reference table, the number of the pull-in bit table is not set for the zero-th pull-in bit offset. In the slot machine 10, as in the case of a bell, when the left reel 32L is stopped for the first time, no overshoot occurs, but when the middle reel 32M or the right reel 32R is stopped for the first time, the overload may occur. There is a role. That is, in the “bell” symbol forming the bell prize, all symbol intervals are set within the range of the maximum number of reels in the middle reel 32M and the right reel 32R, but in the left reel 32L, “(max. (Number) + (number of symbols to stop in the left reel 32L) −1 ”or less, and a symbol interval exceeding the maximum number of slips is set. For this role, an offset reference table is prepared in advance, but when the left reel 32L is stopped for the first time, the pull-in bit table is acquired by setting the pull-in bit offset to “0”. I do not do it. Here, since the case where the left reel 32L is stopped for the first time has been described, the winning bit offset is “0” when the player wins the bell role in the lottery process.

  If the pull-in bit offset is “0”, a negative determination is made in step S1704, and the pull-in bit table buffer 166 is cleared in step S1703, and then the pull-in bit table acquisition process is terminated. If the pull-in bit offset is not “0”, the process proceeds to step S1705. In step S1705, the acquired bit offset is referred to the offset reference table acquired this time, and the number of the acquired bit table is acquired. Then, information indicating the acquired pull-in bit table number is stored in the pull-in bit table buffer 166. Thereafter, the acquisition bit table acquisition process is terminated.

  Returning to the description of the pull-in bit information setting process, after executing the pull-in bit table acquisition process, the process proceeds to step S1603. In step S1603, it is determined whether or not information indicating the pull-in bit table number is stored in the pull-in bit table buffer 166. If the information indicating the lead-in bit table number is not stored, that is, if “0” is stored, the reel buffer corresponding to the current target reel in the lead-in bit information search buffer 162 in step S1604. After storing “00” in each, the lead-in bit information setting process is terminated. If the information of the pull-in bit table number is stored, the process proceeds to step S1605.

  In step S1605, a pull-in bit information acquisition process is executed. In the pull-in bit information acquisition process, the pull-in bit table is specified based on the information stored in the pull-in bit table buffer 166, and the pull-in bit information of the target symbol number (hereinafter referred to as the pull-in bit information for the lower stage) Retrieval bit information of the symbol number one symbol number higher than the target symbol number (hereinafter referred to as “middle stage pull-in bit information”), and retraction bit information of the symbol number two symbol numbers higher than the target symbol number ( Hereinafter, the upper stage pull-in bit information) is acquired.

  Here, the pull-in bit table will be described. The pull-in bit table is prepared in correspondence with the BB winning status, the winning status of a predetermined small role (a small role that may be missed), and the lottery outage status where no role is won in the lottery process. .

  A pull-in bit table is prepared corresponding to each reel 32L, 32M, 32R. That is, the pull-in bit table is prepared for each reel 32L, 32M, 32R corresponding to each of the above situations. In this case, the left reel 32L is prepared in correspondence with a situation where the left reel 32L is stopped after the second stop. Further, the middle reel 32M and the right reel 32R are prepared corresponding to the case where the left reel 32L is first stopped and the case where the left reel 32L is not first stopped (so-called irregular pressing). . Among these, for the first stop of the left reel 32L, with respect to the BB winning situation and the lottery off situation, a pull-in bit table is prepared corresponding to the stop symbol number of the left reel 32L (this stop symbol number and Is not necessarily one-to-one).

  In the configuration in which a large number of pull-in bit tables are prepared as described above, the pull-in bit tables are not prepared corresponding to the combination lines L1 to L5. This is because various bits other than the pull-in bits are allocated in the determination value calculation information buffer B, and a desired symbol combination is stopped on a predetermined combination line without considering the line in the pull-in bit table. Because you can. On the other hand, in a configuration in which reel control is performed using only the slide table as in the conventional slot machine, it is necessary to prepare the slide table corresponding to each combination line. From this point of view, the information amount for the pull-in bit table in the ROM 105 is smaller than the information amount for the sliding table in the conventional slot machine.

  Furthermore, in a configuration in which reel control is performed only by a slide table as in the conventional slot machine, it is necessary to prepare a slide table corresponding to the winning situation of all the small roles. On the other hand, the draw-in bit table is used to determine the stopping outcome when no winning is established, so it is not necessary to prepare for each winning combination of all small roles. Also from this viewpoint, the information amount for the pull-in bit table in the ROM 105 is smaller than the information amount for the sliding table in the conventional slot machine.

  FIG. 34 shows an example of the pull-in bit table. The pull-in bit table is composed of 6 bytes. The pull-in bit information of symbol numbers 0 to 3 is stored in the first byte. The pull-in bits of symbol numbers 4 to 7 are stored in the second byte. The information is stored, the drawing bit information of the 8th to 11th symbol numbers is stored in the 3rd byte, and the drawing bit information of the 12th to 15th symbol numbers is stored in the 4th byte. The 5th byte stores the 16th to 19th symbol number drawing bit information, and the 6th byte stores the 20th symbol number drawing bit information. The pull-in bit information stored in these pull-in bit tables is any one of “00”, “01”, “10”, and “11” (that is, a plurality of types of pull-in bit information are prepared). "→" 01 "→" 10 "→" 11 "In this order, it is the pull-in bit information having a large value (various pull-in bit information can be distinguished in size). In this case, the pull-in bit table stores the pull-in bit information having a larger value as the symbol number has a higher priority in the corresponding situation.

  For example, with respect to the situation in which reach eyes are made to appear, the drawn bit information of the symbol number that causes a reach eye with a higher priority to appear is higher than the symbol number that makes a reach eye with a lower priority appear. This priority can be set in a plurality of stages because a plurality of types of pull-in bit information are prepared as described above.

  In the acquisition bit information acquisition processing in step S1605, for example, when the target symbol number is 0, the values of the 0th and 1st bits of the first byte are acquired as lower acquisition bit information, and the intermediate acquisition bit information is obtained. The second and third bit values of the first byte are acquired, and the fourth and fifth bit values of the first byte are acquired as upper stage pull-in bit information.

  In the subsequent step S1606, each piece of drawn bit information acquired in the drawn bit information acquisition process is stored in the corresponding reel buffer of the drawn bit information search buffer 162. In the drawing bit information setting process for the middle reel 32M, the lower drawing bit information is stored in the lower buffer 164c of the middle reel buffer 164, the middle drawing bit information is stored in the middle buffer 164b, and the upper buffer 164a. The upper stage pull-in bit information is stored in. For example, when the lower pull-in bit information is “11”, the middle pull-in bit information is “00”, and the upper pull-in bit information is “01”, the pull-in bit information search buffer 162 is It will be in the state shown to 32 (d). Thereafter, the pull-in bit information setting process is terminated.

  Next, the winning determination process of step S1504 will be described based on the flowcharts of FIGS. The outline will be described prior to the detailed description. In the winning determination process, the winning determination of the combination in each active line for the set target symbol number and the combination of the drawn bit information stored in the drawn bit information search buffer 162 are combined. A value determination is executed, and processing for storing information in each bit of the determination value calculation information buffer B is sequentially executed based on the determination result.

  First, in step S1801, initialization processing is executed. In the initialization process, the corresponding determination value calculation information buffer B in the RAM 106 is initialized. In addition, initialization of the search line buffer 167 and the determined confirmation buffer 168 of the RAM 106 is also executed. By initializing the search line buffer 167, the first search target becomes the upper line L1.

  In a succeeding step S1802, a line determination process is executed. The line determination process will be described with reference to the flowchart of FIG.

  In the line determination process, first, in step S1901, the symbol number on the search line is specified for the reel for which the stop command has already been issued, and the symbol correspondence information of the symbol number is grasped. Here, the symbol correspondence information will be described in detail with reference to FIG.

  In the symbol correspondence table storage area 105g of the ROM 105, a symbol correspondence table prepared for each reel 32L, 32M, 32R is stored. Each symbol correspondence table is configured by symbol correspondence information associated with the symbol type attached to the corresponding reel on a one-to-one basis.

  Each symbol correspondence information is composed of first symbol correspondence information and second symbol correspondence information, and each of the first symbol correspondence information and the second symbol correspondence information is composed of 1 byte. That is, each symbol correspondence information is composed of 2 bytes.

  The first symbol correspondence information is information used in making a determination relating to winning, and has a function as utility symbol correspondence information. Specifically, in the combination table storage area 105e of the ROM 105, a combination table composed of combination information corresponding to the combination on a one-to-one basis is stored (see FIG. 39). Each combination correspondence information is composed of 1 byte, and the position of the bit storing “1” is different. That is, in this slot machine 10, eight types of combinations are set when all the gaming states are combined, and the combination of the role correspondence information by changing the positions where “1” is stored in the eight bits. And one-to-one correspondence. The first symbol correspondence information is set to match the combination information of each combination when AND processing is performed on the first symbol association information of each symbol constituting the combination of combinations of combinations.

  For example, the role correspondence information of the first BB role is “00000010” as shown in FIG. In contrast, the first symbol correspondence information of the “red 7” symbol of the left reel 32L is “00000010”, and the first symbol correspondence information of the “red 7” symbol of the middle reel 32M and the right reel 32R is “ 01000010 ". Then, when the first symbol correspondence information of the “red 7” symbol of each reel 32L, 32M, 32R is ANDed, it becomes “00000010”, which matches the role correspondence information of the first BB role. Here, as shown in FIG. 38, in the combination table of the middle reel 32M and the right reel 32R, “1” is stored in the same bit in the first symbol correspondence information of all symbols. The position of this bit corresponds to the position of the bit in which “1” is stored in the first symbol correspondence information of the “cherry” symbol of the left reel 32L, and “1” in the role correspondence information of the cherry role. Corresponds to the position of the stored bit. This is because for the cherry role, if the “cherry” symbol of the left reel 32L stops on the active line when winning, the winning is established, and the stop symbols of the middle reel 32M and the right reel 32R are arbitrary. .

  In addition, unlike the slot machine 10, in a slot machine in which nine or more types of combinations that combine all the gaming states are set, the amount of information of the combination correspondence information is not enough for one byte, and it is necessary to make it more than two bytes. Accordingly, the information amount of the first symbol correspondence information needs to be 2 bytes or more.

  The second symbol correspondence information is information used for making a determination related to kicking off the stop appearance, and has a function as symbol correspondence information for kicking. Specifically, as shown in FIG. 40, a kicking correspondence table storage area 105f of the ROM 105 stores a kicking correspondence table, and the kicking correspondence table is associated with a combination of symbols that can become a kick eye, which will be described later. It is composed of set kicking correspondence information. Each kicking correspondence information is composed of 1 byte, and the position of the bit storing “1” is different. The second symbol correspondence information is set so as to coincide with each kicking correspondence information when AND processing is performed on the second symbol correspondence information of each symbol constituting the symbol combination that can become the above-mentioned kicking eye.

  However, unlike the role correspondence information, the kicking correspondence information is not associated with each symbol combination on a one-to-one basis, and the predetermined kicking correspondence information corresponds to a combination of symbols of a plurality of patterns. For example, for the “red 7” symbol, the “white 7” symbol, the “youth” symbol, and the “bar” symbol, the kicking correspondence information is “00000001” for any combination of patterns. In this way, by setting a combination of symbols of a plurality of patterns for one kicking correspondence information, as compared with a configuration in which kicking correspondence information is set in association with a combination of symbols on a one-to-one basis, storage regarding kicking correspondence information is performed. The capacity is reduced, and as a result, the storage capacity of the ROM 105 is reduced.

  In addition, in the configuration in which the pattern combination that can be kicked is set more than the slot machine 10, the information amount of the kicking correspondence information may not be sufficient for one byte, and may be 2 bytes or more. Accordingly, the information amount of the second symbol correspondence information may need to be 2 bytes or more.

  Returning to the description of the line determination process, the symbol correspondence information grasped in step S1901 is stored in a symbol correspondence information register provided in the CPU. In this case, when there are a plurality (two) of reels for which a stop command has already been issued, each symbol correspondence information is stored. It is also possible to provide a symbol correspondence information buffer in the RAM 106 and store the grasped symbol correspondence information therein.

  In subsequent step S1902, the symbol number on the search line is specified for the current target reel, and the symbol correspondence information of the symbol number is grasped. The grasped symbol correspondence information is also stored in a symbol correspondence information register provided in the CPU 102.

  In the subsequent step S1903, AND processing is performed on the grasped symbol correspondence information. Specifically, each first symbol correspondence information of each grasped symbol correspondence information is ANDed, and each second symbol correspondence information of each grasped symbol correspondence information is ANDed. Then, the result of the AND processing is stored as establishment determination information in the establishment determination buffer 169 of the RAM 106 in step S1904. The establishment determination buffer 169 is set corresponding to each of the first symbol correspondence information and the second symbol correspondence information, and the result of the AND processing of the first symbol correspondence information and the AND processing of the second symbol correspondence information. The information corresponding to the first symbol correspondence information is referred to as the first symbol determination information, and the information corresponding to the second symbol correspondence information is referred to as the second symbol determination information. ). In the slot machine 10, since each of the first symbol correspondence information and the second symbol correspondence information is composed of 1 byte, the establishment determination buffer 169 is composed of 2 bytes. After performing the process of step S1904, the line determination process is terminated.

  Returning to the description of the winning determination process, in step S1803, the target reel information buffer 160 in the RAM 106 is checked to determine whether or not the current target reel is the left reel 32L. If the current reel is the left reel 32L, the process proceeds to step S1805 as it is. If the current reel is not the left reel 32L, the process proceeds to step S1805 after correcting the first establishment determination information in step S1804. The details of the correction process will be described later.

  In step S1805, it is determined by referring to the stop reel specifying buffer 154 in the RAM 106 whether or not there are two reels for which a stop command has been issued. In the two cases, the illegal winning process of steps S1807 to S1810 is executed, and the winning determination process is terminated. If not, the process proceeds to step S1806. Since this time is a winning determination process in the first stop process, there is one reel for which a stop command has been issued, a negative determination is made in step S1805, and the process proceeds to step S1806.

  In step S1806, by confirming the target reel information stored in the target reel information buffer 160, it is determined whether or not the current target reel is the left reel 32L, and is stored in the establishment determination buffer 169 of the RAM 106. Based on the first establishment determination information, it is determined whether or not there is a “cherry” symbol of the left reel 32L on the current search line. If the current target reel is the left reel 32L and the “cherry” symbol of the left reel 32L is on the search line, the illegal winning process of steps S1807 to S1810 is executed, and the winning determination process is terminated. If the current target reel is not the left reel 32L, or if the current target reel is the left reel 32L and there is no “cherry” symbol on the search line, the process proceeds to step S1811. This time is a winning determination process when the left reel 32L is stopped for the first time, and information indicating the left reel 32L is not stored as the current target reel information, so a negative determination is made in step S1806, The process proceeds to step S1811.

  In step S1811, with reference to the winning combination determination buffer 151 of the RAM 106, it is determined whether or not any combination is won. If no winning combination has been won, the process proceeds to step S1825 without performing the processes in steps S1812 to S1824. If any combination is won, the process proceeds to step S1812.

  In step S1812, a winning symbol establishment determination process is executed. In the winning symbol establishment determination process, the first establishment determination information (information relating to the combination) among the establishment determination information stored in the establishment determination buffer 169 of the RAM 106 and the winning information stored in the winning combination determination buffer 151 of the RAM 106. (Correspondence correspondence information) is AND-processed, and the result is stored in an appropriateness determination register provided in the CPU 102 as appropriateness determination information. This success / failure determination register is composed of 1 byte. The RAM 106 may be provided with a success / failure determination buffer, and the determination information may be stored in the buffer. When the first establishment determination information matches the winning information, the success / failure determination information matches the first establishment determination information stored in the establishment determination buffer 169, and the first establishment determination information matches the winning information. If not, “0” is cleared (“00000000” is stored).

  In subsequent step S1813, it is determined whether or not each symbol on the current search line constitutes a combination of symbols corresponding to the winning combination by referring to the register for determining whether or not the CPU 102 is successful. If not configured, the process proceeds to step S1825 without performing the processes in steps S1814 to S1824. If so, the process advances to step S1814. If the search line is not a valid line (at least when the search line is the middle line L2 as a subline), even if the combination of symbols is configured, step S1813 is performed. Make a negative decision at. This is because a line that is not an effective line is not related to winning.

  In step S1814, by referring to the winning combination determination buffer 151 in the RAM 106, it is determined whether or not the re-game is won. If the regame is won, the process proceeds to step S1815. If the regame is not won, the process proceeds to step S1816 without executing the process of step S1815.

  In step S1815, it is determined whether or not the information for determining whether or not the game is correct is stored in the register for determining whether or not the CPU 102 is correct. That is, in this slot machine 10, a re-game win may occur in the BB win situation, so in the re-game win, a combination of symbols composing a BB prize is arranged on the search line, and the winning / non-use determination register corresponds to the BB role May be stored. Therefore, in step S1805, it is determined whether or not the determination information corresponding to the BB combination is stored in the determination table for determination of success.

  When the determination information other than replay is not stored, the process proceeds to step S1816. If the information for determining whether or not the game is other than replay is stored, the process proceeds to step S1825 without performing the processes in steps S1816 to S1824. Specifically, when a re-game win is made in the BB winning situation, and the winning / determining determination information corresponding to the BB combination is stored in the winning / failing determination register, a payout number acquisition process and a determination value calculation information buffer to be described later The process of storing “1” in the BB combination bit of B is not executed. This is for giving the highest priority to the re-game winning in the situation where the re-game is won no matter what the stop order or stop operation timing of the stop switches 42 to 44 is.

  In step S1816, a payout number acquisition process is executed. Here, the payout number acquisition process will be described with reference to FIG.

  In the payout number acquisition process, the success / failure determination information is acquired from the corresponding failure determination register of the CPU 102 in step S2001. In the subsequent step S2002, the type of the information for determining whether or not the game is successful is determined, and “1” is stored in the corresponding bit of the winning combination type buffer 170 of the RAM 106. The winning combination type buffer 170 is composed of 1 byte, and one bit is allocated to each of the replay and the BB combination.

  In the subsequent step S2003, it is determined by referring to the stop reel specifying buffer 154 of the RAM 106 whether or not there is even one reel for which a stop command has been issued. If there is none, the process proceeds to step S2004. If there is one, the process proceeds to step S2005 as it is. Since this time is a winning determination process in the first stop process, there is one reel for which a stop command has been issued, an affirmative determination is made in step S2003, and the process proceeds to step S2005.

  In step S2005, a payout number table is acquired. The payout number table is stored in the payout number table storage area 105d of the ROM 105, and a correspondence relationship (see FIG. 8) between the winning combination and the payout number of medals is set. In step S2006, the number of payouts corresponding to the success / failure determination information is acquired from the payout number table, and the acquired payout number is added as acquired number information to the acquired number bit of the determination value calculation information buffer B. Thereafter, the payout number acquisition process ends.

  Returning to the description of the winning determination process, after the payout number acquisition process is executed, the process proceeds to step S1817, where the determination information of the success / failure stored in the determination register for the success / failure of the CPU 102 is confirmed in the determined confirmation buffer 168 of the RAM 106. Store as business information. The determined confirmation buffer 168 is composed of 1 byte.

  In the subsequent step S1818, the winning combination classification buffer 170 is referred to and it is determined whether or not the winning combination is re-game information. If it is replay information, “1” is stored in the replay bit of the determination value calculation information buffer B in step S1819, and then the process proceeds to step S1823. If it is not replay information, the process proceeds to step S1820.

  In step S1820, the winning combination classification buffer 170 is referenced to determine whether or not the winning combination is BB combination information. If it is BB combination information, “1” is stored in the BB combination bit of the determination value calculation information buffer B in step S1821, and then the process proceeds to step S1823. If it is not the BB combination information, “1” is stored in the small combination bit of the determination value calculation information buffer B in step S1822, and then the process proceeds to step S1823.

  In step S 1823, it is determined whether or not the current search line matches the priority line indicated by the information stored in the priority line buffer 156 of the RAM 106. If they match, “1” is stored in the first priority line bit of the determination value calculation information buffer B in step S1824, and then the process proceeds to step S1825. If they do not match, the process proceeds directly to step S1825.

  In step S1825, by referring to the stop reel specifying buffer 154 in the RAM 106, it is determined whether or not there are two reels for which a stop command has been issued. In the two cases, the kicking process in steps S1827 to S1830 is executed. If not, the process proceeds to step S1826. Since this time is a winning determination process in the first stop process, there is one reel for which a stop command has been issued, a negative determination is made in step S1825, and the process proceeds to step S1826.

  In step S1826, by confirming the target reel information stored in the target reel information buffer 160, it is determined whether or not the current target reel is the left reel 32L, and is stored in the establishment determination buffer 169 of the RAM 106. Based on the first establishment determination information, it is determined whether or not there is a “cherry” symbol of the left reel 32L on the current search line. As a result, when the current target reel is the left reel 32L and there is a “cherry” symbol on the current search line, the kicking process in steps S1827 to S1830 is executed. If the current target reel is not the left reel 32L, or if the current target reel is the left reel 32L and there is no “cherry” symbol on the search line, the process proceeds to step S1831. This time is a winning determination process when the left reel 32L is stopped for the first time, and information on the left reel 32L is not stored as the current target reel information, so a negative determination is made in step S1826, and the step The process proceeds to S1831. In step S1831, a pull-in bit information search process is executed. Here, the lead-in bit information search process will be described.

  In the lead-in bit information search process, as shown in FIG. 42, a composite process of the lead-in bit information search buffer 162 is executed in step S2101. In such composition processing, the drawing bit information of each buffer on the current search line is AND-processed with respect to the reel buffer for which the drawing bit information is set in the drawing bit information setting process described above.

  Specifically, using FIG. 32 (e), when the search line is a downward-sloping line L4, “00”, “00”, and “FF” are from the left. Therefore, when these are ANDed, the pull-in bit information composite value is “00”. On the other hand, when the search line is the lower line L3, “FF”, “11”, and “FF” are displayed from the left. Therefore, when these are ANDed, the combined bit information composite value becomes “11”.

  In the subsequent step S2102, it is determined whether or not the drawn bit information composite value acquired in step S2101 is “00”. If the pull-in bit information composite value is “00”, the pull-in bit information search process is terminated as it is. If the pull-in bit information composite value is not “00”, the process advances to step S2103.

  In step S2103, it is determined whether or not the current pull-in bit information composite value is the same as the previous result. If the result is the same as the previous one, the process proceeds to step S2106 without executing the processes in steps S2104 and S2105. On the other hand, if the result is not the same as the previous one, the process proceeds to step S2104.

  In step S2104, it is determined whether or not the current pull-in bit information composite value is larger than the previous result. If the result is smaller than the previous result, the lead-in bit information search process is terminated as it is. If the result is larger than the previous result, in step S 2105, the drawn bit information composite value is stored in the drawn bits of the determination value calculation information buffer B. Here, the case where the combined value of the pull-in bit information is large may be a case where, for example, the stop line corresponding to the missed line is formed in the current search line and the stop line having a higher priority is configured. It is done. In addition, in the BB winning situation, there may be a case where a reach having a higher priority is configured in the current search line. Thereafter, the process proceeds to step S2106.

  In step S 2106, it is determined whether or not the current search line matches the priority line indicated by the information stored in the priority line buffer 156 of the RAM 106. If they match, “1” is stored in the second priority line bit of the determination value calculation information buffer B in step S2107, and then the lead-in bit information search process ends. If they do not match, the lead-in bit information search process is terminated as it is.

  Returning to the description of the winning determination process, after executing the lead-in bit information search process, the process proceeds to step S1832. In step S1832, the search line buffer 167 is referenced to determine whether or not the processing in steps S1802 to S1831 has been executed for all search lines. Specifically, the processing of steps S1802 to S1831 is executed for all of the combination lines L1 to L5, and the order thereof is the upper line L1, the middle line L2, the lower line L3, the lower right line L4, and the upper right line L5. It has become. Therefore, in step S1832, it is determined whether or not the search line is a right-up line L5. Note that the search order is not limited to the above, and a search may be performed first from the right rising line L5.

  If the search line is a line that rises to the right, the winning determination process ends. If the search line is not the right rising line L5, the process proceeds to step S1833. In step S1833, the search line is updated by updating the information in the search line buffer 167. Thereafter, the processing of steps S1802 to S1831 is executed for the search line.

  By executing the winning determination process, determination value calculation information corresponding to the current target symbol number is created. In this configuration, the slot machine 10 may win a replay or a small role in the BB winning situation. Therefore, depending on the target symbol number, “1” may be stored in the replay bit or the small combination bit in a situation where “1” is stored in the BB combination bit of the determination value calculation information buffer B. In the case where “1” is stored in each of the BB role bit and the small role bit, for example, as shown in FIG. 43A, the “red 7” symbol of No. 18 on the left reel 32L stops in the lower stage. When the symbol of the target symbol number is the 18th “red 7” symbol of the middle reel 32M, “1” is stored in the small role bit when the search line is the right-downward line L4. When the search line is the lower line L3, “1” is stored in the BB combination bit.

  In the payout number acquisition process in step S1816, information on the payout number corresponding to the winning combination determined in each search line is added to the acquired number of bits. For example, in a game selected as a watermelon role, as shown in FIG. 43 (b), when the 14th “watermelon” symbol of the left reel 32L is stopped at the bottom, the symbol of the target symbol number is the middle reel. In the case of the 32M No. 3 “replay” symbol, when the search line is the right-down line L4, information indicating that the payout number is “6” is added to the acquired number bit, and the search line is In the case of the rising line L5, information indicating that the payout number is “6” is added to the acquired number bit. Therefore, the acquired number of bits in the target symbol number stores “12” information as acquired number information.

  As described above, in the determination value calculation information creation process (see FIG. 29), update of the target symbol number is executed to create all determination value calculation information for the target reel. Further, in the second stop and subsequent priority information creation processing (see FIG. 27), the determination value calculation information creation processing is executed for each reel for which a stop command has not yet been issued. That is, in the second stop and subsequent priority information generation process in the first stop process, all determination value calculation information for each reel for which a stop command has not yet been generated is generated. In this configuration, as described above, the priority information generation process for the second stop and after is executed in a situation where the interrupt process for stop is permitted. In other words, the deceleration process for the reels to be stopped and the priority information creation process for reels for which a stop command has not yet been issued are performed in parallel. In addition, the priority information generation process for the second and subsequent stops is processed so that it ends within a specified period from when the stop command is generated until the reel is slid by the maximum number of symbols (4 symbols) and stopped. Is set. Accordingly, priority order information can be created by effectively using the period during which the reel deceleration process is executed.

  The period from the start of the reel deceleration process to the completion of the stop varies depending on how much the reel to be stopped is slid and stopped. For example, the period is longer when the reel is stopped after sliding four symbols than when the reel is stopped without sliding one symbol. Therefore, when the reels are stopped without sliding for one symbol, the stop of the reels to be stopped may be completed before the creation of the priority information is completed. For example, when the reels are stopped, the creation of the priority information is completed before the stop of the reels to be stopped is completed.

  Incidentally, even when the stop of the reels to be stopped is completed before the creation of the priority order information is completed, the predetermined first effective waiting period has elapsed after the first stop command is generated as described above. Since the second stop operation is not validated until the second period has elapsed and the second stop command is not generated, stop control of the next reel is started even though the creation of the priority information is not completed. It is prevented. The same applies to the second stop process.

  Further, in the normal process, only the process related to the creation of the priority information for the second and subsequent stops is performed in parallel with the interrupt process for the stop, so that the processes are performed in parallel as described above. Therefore, the processing load is prevented from being extremely increased.

  Next, the second stop process will be described based on the flowchart of FIG. In the second stop process, first, the second stop and subsequent slip number acquisition process is executed in step S2201.

  In the second stop and subsequent slip number acquisition process, as shown in FIG. 45, first, the reel corresponding to the second stop command is specified by referring to the stop reel specifying buffer 154 in step S2301. In the following step S2302, the reaching symbol number of the reel to be stopped when the second stop command is received is acquired. Thereafter, in step S2303, “0” is stored in the sliding number counter of the RAM 106, and then the process proceeds to step S2304.

  In step S2304, the symbol number for determination is acquired by adding the value of the slip counter to the reaching symbol number. Note that when the value of the slip counter is “0”, the symbol number for determination = the symbol number for reaching. In subsequent step S2305, a determination value calculation information buffer B corresponding to the determination symbol number is acquired. In step S2306, the priority determination value of the acquired determination value calculation information buffer B is calculated.

  Here, the priority order judgment value is a judgment value calculated by converting each bit of the judgment value calculation information buffer B from the upper side and assuming a 16-digit binary number into a hexadecimal number, It is represented by 4 digits by the hexadecimal numbers “0-9” and “A-F” (0 is the smallest and F is the largest). Therefore, the higher the number of “1” s stored in the first buffer B1 than in the second buffer B2, the higher the priority determination value. Furthermore, in each of the first and second buffers B1 and B2, “1” is set in the upper bits. The priority determination value becomes larger as it is stored.

  In the subsequent step S2307, it is determined whether or not the priority order determination value calculated in step S2306 is larger than the previously calculated priority order determination value. If the current time is larger, the current value of the slip number counter is stored in the set slip number buffer 171 of the RAM 106 in step S2308, and then the process proceeds to step S2309. On the other hand, if the previous time is larger or the same, the process proceeds to step S2309 as it is.

  In step S2309, after adding 1 to the sliding number counter, the process proceeds to step S2310. In step S2310, it is determined whether the slip counter is “5”. If the slip counter is not “5”, the process returns to step S2304. On the other hand, if the slip number counter is “5”, the second and subsequent slip number acquisition processing is terminated.

  In other words, in the slip number acquisition process, five priority determination values from the reaching symbol number to the symbol number four symbols higher than the reaching symbol number are calculated and compared, and the highest priority determination value among them is calculated. The number of slides is specified so that the symbol with the larger symbol number becomes the stop symbol at the base position. Here, as described above, the priority determination value from the reaching symbol number to the symbol whose symbol number is four higher than the reaching symbol number can be slid up to four symbols. This is to make it possible to reduce the frequency of so-called spillage that does not stop the symbol or symbol combination corresponding to the winning combination on the active line, and it has not won the winning lottery. Nevertheless, it is possible to avoid the problem that the combination of winning symbols stops on the active line.

  FIG. 46 (a) in which the reaching symbol number is No. 0 in the middle reel 32M, and the priority determination values are “8008”, “800E”, “8008”, “800F”, “A008” in order from the reaching symbol number side. In the case of (), since the priority order determination value is “A008” which is the 4th “watermelon” symbol, the number of slips is specified to be “4”. As a result, when the middle reel 32M is stopped, it is slid by four symbols with respect to the reaching symbol, and as shown in FIG. 46B, the fourth “watermelon” symbol is stopped at the lower stage of the middle reel 32M. To do.

  Returning to the description of the second stop process, after the second stop and subsequent slip number acquisition process is executed, a stop position setting process is executed in step S2202. In the stop position setting process, the number of slips is acquired by referring to the set slip number buffer 171. The stop symbol number is calculated by adding the number of slips to the arrival symbol number, and information indicating the calculated stop symbol number is stored in the stop position buffer 155 of the RAM 106 as stop position information.

  In a succeeding step S2203, stop interruption processing is permitted. The stop interrupt process is as described above, and the reel decelerating process is executed such that the symbol of the stop symbol number of the reel that is the second stop target stops at the base point position. In a succeeding step S2204, a priority line change process is executed.

  In the priority line change process, as shown in FIG. 47, it is first determined in step S2401 by referring to the winning combination determination buffer 151 of the RAM 106 whether or not any combination is won. If no winning combination is won, the priority line changing process is terminated. In other words, if the winning combination is not won, the priority line is not changed. On the other hand, if any combination is won, the process proceeds to step S2402.

  In step S2402, a pull-in bit information setting process is executed. In the pull-in bit information setting process, as already described in the determination value calculation information creation process, the processes in steps S1601 to S1606 in FIG. 31 are executed. However, in the lead-in bit information setting process in the priority line change process, the reel that is the current stop target is handled as the target reel.

  In the preparation processing before drawing bit information expansion in step S1601, after “FF” is stored in all bits of the buffers 163a to 163c, 164a to 164c, and 165a to 165c in the drawing bit information search buffer 162 of the RAM 106, the stop processing is already performed. All the bits of the two buffers that are not on the priority line among the reel buffers corresponding to the reels that have been completed are cleared. Specifically, since this time is the priority line change process in the second stop process, all the bits of the two buffers not on the priority line among the reel buffers corresponding to the reels stopped in the first stop process are displayed. clear.

  Further, in the pull-in bit table acquisition process in step S1602, a pull-in bit table is acquired for the reel to be stopped this time. If there is a pull-in bit table, an affirmative determination is made in step S1603, and a pull-in bit information acquisition process is executed in step S1605.

  In the acquisition bit information acquisition process, the target symbol number, the symbol number one higher than the target symbol number, and the symbol number two higher than the target symbol number from the pull-in bit table acquired in step S1602. Rather than acquiring the pull-in bit information, the stop symbol number stored in the stop position buffer 155, the symbol number one higher than the stop symbol number, and the symbol number two higher than the stop symbol number Get pull-in bit information for.

  In step S1606, the lead-in bit information acquired in the lead-in bit information acquisition process is stored in the reel buffers corresponding to the reels to be stopped this time.

  Returning to the description of the priority line changing process, after executing the lead-in bit information setting process, the search line buffer 167 is initialized in step S2403. By initializing the search line buffer 167, the first search target becomes the upper line L1.

  In a succeeding step S2404, a line determination process is executed. In the line determination process, as already described in the winning determination process, a process of creating establishment determination information is executed (see FIG. 37). However, in the line determination process in the priority line change process, only the reels for which a stop command has already been issued are targeted for determination, and therefore the process of step S1902 is not executed. That is, for the reels for which the stop process has been completed as the first stop target and the reels that are the second stop target, the symbol numbers stopped on the search line are specified, and the symbol correspondence corresponding to each symbol number is specified. AND the information. The result is stored in the establishment determination buffer 169 of the RAM 106.

  Thereafter, in step S2405, a winning symbol establishment determination process is executed. In the winning symbol establishment determination process, as described above, the first establishment determination information among the establishment determination information stored in the establishment determination buffer 169 of the RAM 106 and the winning information stored in the winning combination determination buffer 151 of the RAM 106 Is AND-processed and the result is stored in the register for determining whether or not the CPU 102 is correct.

  In the subsequent step S2406, it is determined whether or not a combination of symbols corresponding to the winning combination is configured by referring to the determination information stored in the determination register of the CPU 102. If not configured, the process proceeds to step S2409 without executing the processes in steps S2407 and S2408. If so, the process advances to step S2407. If the search line is not an active line (at least when the search line is the middle line L2), even if the combination of symbols corresponding to the winning combination is configured, A negative determination is made in step S2406. This is because a line that is not an active line is not related to winning.

  In step S2407, it is determined whether or not the current search line matches the priority line indicated by the information stored in the priority line buffer 156 of the RAM 106. If they match, the process proceeds to step S2420 without executing the processes of steps S2408 to S2419. If they do not match, the process proceeds to step S2408.

  In step S 2408, information indicating the current search line is stored in the rewrite line buffer 172 of the RAM 106, and first confirmation information is stored in the first confirmation information buffer 173 of the RAM 106. The first confirmation information is information for determining whether or not information on a line to be rewritten with respect to winning is stored in the rewrite line buffer 172, and specifically stores a 1-bit flag.

  In a succeeding step S2409, it is determined whether or not the first confirmation information is stored in the first confirmation information buffer 173. If the first confirmation information is stored, the process proceeds to step S2416 without executing the processes of steps S2410 to S2415. If the first confirmation information is not stored, the process proceeds to step S2410. That is, when the combination of symbols corresponding to the winning combination is not configured on the search line (except when the search line is not an effective line), the process proceeds to step S2410.

  In step S 2410, it is determined whether or not the second confirmation information is stored in the second confirmation information buffer 174 of the RAM 106. The second confirmation information is information for determining whether or not the rewritten line buffer 172 stores information on the line to be rewritten with respect to the drawn bit information, and specifically stores a 1-bit flag. . If the second confirmation information is stored, the process proceeds to step S2416 without executing the processes of steps S2411 to S2415. If the second confirmation information is not stored, the process proceeds to step S2411.

  In step S2411, the process of synthesizing the pull-in bit information search buffer 162 is executed. In this synthesis process, the information of each buffer on the current search line is ANDed with respect to the reel buffer in which the drawn bit information is stored in the drawn bit information setting process in step S2402. Since this AND processing is as described above, detailed description thereof is omitted.

  In a succeeding step S2412, it is determined whether or not the drawn bit information composite value acquired in the step S2411 is “00”. If the pull-in bit information composite value is “00”, the process proceeds to step S2416 without executing steps S2413 to S2415. If the pull-in bit information composite value is not “00”, the process proceeds to step S2413.

  In step S 2413, information indicating the current search line is stored in the rewrite line buffer 172 of the RAM 106. In the following step S2414, it is determined whether or not the current search line matches the information of the priority line stored in the priority line buffer 156 of the RAM 106. If they do not match, the process proceeds to step S2416 without executing the processing of step S2415. If they match, the second confirmation information is stored in the second confirmation information buffer 174 of the RAM 106 in step S2415 and then step S2416. Proceed to

  In step S2416, by referring to the search line buffer 167, it is determined whether or not the processing in steps S2404 to S2415 has been executed for all search lines. Specifically, the processing of steps S2404 to S2415 is executed for all of the combination lines L1 to L5, and the order thereof is the upper line L1, the middle line L2, the lower line L3, the lower right line L4, and the upper right line L5. It has become. Therefore, in step S2316, it is determined whether or not the search line is a right-up line L5. Note that the search line may not include the middle line L2. This is because the middle line L2 is not set as an effective line. The search line may not include a combination line that is not an effective line (hereinafter also referred to as “ineffective line”).

  If the search is not completed, the search line is updated in step S2417, and then the process returns to step S2404. As a result, the processes in steps S2404 to S2415 are executed for the updated search line. On the other hand, if the search is complete, the process advances to step S2418.

  In step S2418, by referring to the rewrite line buffer 172 of the RAM 106, it is determined whether there is rewrite line information. If there is no rewrite line information, the process proceeds to step S2420 without executing the process in step S2419. If there is rewrite line information, the information of the rewrite line buffer 172 is stored in the priority line buffer 156 in step S2419. That is, the priority line is changed. Thereafter, the process proceeds to step S2420.

  In step S2420, the rewrite line buffer 172 and the first and second confirmation information buffers 173 and 174 of the RAM 106 are initialized. Thereafter, the priority line change process is terminated. Note that the processing in step S2420 may be executed together in step S2403. In addition, the slot machine 10 has a configuration in which the rewrite line buffer 172 is provided in the RAM 106 and the priority line is changed based on the information stored in the buffer 202 in order to execute the priority line change process. Instead of this, a rewrite line register may be provided in the CPU 102, and the priority line may be changed based on information stored in the register.

  By executing the above priority line changing process, the priority line is changed in accordance with the stoppage of the reel for which the stop command is generated or the stoppage of the scheduled stop. When the priority line is changed, the priority line is not changed if none of the winning combinations is won, as described in the above processes. Further, when there is a possibility that the combination of symbols corresponding to the winning combination is stopped on the already set priority line, the priority line is not changed.

  On the other hand, when there is a possibility that the combination of symbols corresponding to the winning combination is stopped on the active line that is not the priority line that has already been set, the priority line is changed to the active line. Specifically, as shown in FIG. 48 (a), when the already set active line is the right-up line L5 and the watermelon role is selected, the “watermelon” symbol is arranged in the lower row. The priority line is changed from the right rising line L5 to the lower line L3.

  In addition, when there is no possibility that the combination of symbols corresponding to the winning combination will stop on the active line including the priority line, the priority line is changed to a line where the combined bit information composite value does not become “00”. Specifically, as described above, so-called reach eyes appear in the BB winning situation. For example, as a reach eye, there is an aspect in which a “white 7” symbol, a “red 7” symbol, and a “youth” symbol are arranged in a line from the left. In this case, as shown in FIG. 48 (b), when the already set effective line is the lower right line L4, when the “white 7” symbol and the “red 7” symbol are arranged in the upper row, For the middle reel 32M, the middle-stage lead-in bit information is “00”, but the upper-stage lead-in bit information is not “00”. Therefore, the pull-in bit information composite value is “00” for the right-down line L4, whereas the pull-in bit information composite value is not “00” for the upper line L1, so the priority line is the upper line from the right-down line L4. It is changed to L1.

  Returning to the description of the second stop process, after the priority line change process is executed, the second stop and subsequent priority information generation process is executed in step S2205.

  In the second stop and subsequent priority information generation process, as already described in the first stop process, the processes of steps S1401 to S1405 in FIG. 27 are executed. However, in the priority information generation process for the second and subsequent stops in the first stop process, the priority information is generated for the two reels (the middle reel 32M and the right reel 32R), but the second stop in the second stop process. In the subsequent priority order information creation processing, since there is only one reel for which a stop command has not yet been issued, creation of priority order information is executed only for that reel. In addition, in the determination value calculation information creation processing in step S1403, for each of the remaining reels for which a stop command has already been issued, the symbol numbers of the remaining one reel are set to the base position. The determination value calculation information is created for the assumed symbol number. Here, in the winning determination process of step S1504 in the determination value calculation information creation process, a process specific to the second stop process is executed. Such specific processing will be described below based on the flowchart of FIG.

  In the winning determination process in the first stop process, since one reel has issued a stop command, a negative determination is made in step S1805. On the other hand, in the winning determination process in the second stop process, since there are two reels for which a stop command has been issued, an affirmative determination is made in step S1805, and the illegal winning process in steps S1807 to S1810 is executed. .

  An unfair winning prize means that a combination of symbols constituting a winning combination is stopped on the active line even though the winning combination is not won. Then, in the unfair winning process, the determination value calculation information is created so that the priority order determination value is surely smaller for the symbol number where the unreasonable winning occurs than the symbol number where the unreasonable winning is not generated.

  In the unfair prize winning process, first, in step S1807, in order to set information on a combination that is a target of determination as to whether or not the present prize winning process is an unfair winning prize, a mask information setting process for unfair prize is executed. .

  Here, the setting process of the mask information for unfair winning a prize will be described in detail. As described above, the slot machine 10 has a normal gaming state and a BB state as gaming states. In this case, the replay, the BB combination, and the small combination are the combinations that are the targets of the lottery in the normal gaming state, but are not the targets of the lottery in the BB state. Therefore, it is necessary to set the replay, the BB combination and the small combination as information on the combination to be judged whether or not the prize is unfair in the normal gaming state, and whether or not the prize is unfair in the BB state. It is necessary not to set it as information on the combination to be determined. In addition, the JAC combination is a combination that is not a lottery target in the normal gaming state, but is a target that is a lottery target in the BB state. Therefore, it is necessary not to set the JAC combination as information on the combination to be determined whether or not it is an unfair winning prize in the normal gaming state, and to determine whether or not it is an unfair winning prize in the BB state. It is necessary to set as information on the role to be.

  Accordingly, in step S1807, mask information for unfair winning is selected and set so that the combination to be determined as to whether or not it is an unfair winning is in accordance with the gaming state or the like. The mask information is stored in the mask information storage area 105h of the ROM 105, and a plurality of mask information corresponding to the gaming state and the like are stored in the mask information storage area 105h. The mask information is set by storing the current mask information in a mask information register provided in the CPU 102. However, a mask information buffer may be provided in the RAM 106 and stored therein.

  The mask information for unfair winning a prize is composed of 2 bytes corresponding to the establishment determination information. That is, the mask information is composed of first mask information corresponding to the first establishment determination information and second mask information corresponding to the second establishment determination information among the establishment determination information. Among these, in the first mask information, “1” is stored in the bit corresponding to the bit in which “1” is stored in the combination information (see FIG. 39) of the combination to be determined whether or not the prize is unfair. Yes. Specifically, the first mask information of the mask information set in the normal gaming state is associated with the respective role correspondence information of the replay, the first to third BB roles, the watermelon role, the bell role, and the cherry role. “1” is stored in each bit, which is “01111111”. That is, it can be said that the first mask information for unreasonable winnings is information obtained by performing OR processing on the combination information of all the combinations to be determined whether or not they are unreasonable winnings. Note that the second mask information is information used in a kicking process described later, and thus the description thereof is omitted here.

  In step S1808, which is subsequent to the illegal prize winning process, an illegal prize determination process is executed. In the unfair winning determination process, as shown in FIG. 49, first, in step S2501, the mask information stored in the mask information register of the CPU 102 is changed to calculation information. Specifically, each bit of the winning information stored in the winning combination determination buffer 151 of the RAM 106 is inverted and ANDed with the first mask information of the mask information stored in the mask information register. Change to information. This calculation information is composed of 2 bytes like the mask information, and the first mask information in the original mask information is changed, but the second mask information remains as it is.

  In the subsequent step S2502, processing for creating avoidance information is performed. Specifically, the establishment determination information stored in the establishment determination buffer 169 of the RAM 106 is acquired, and the calculation information is ANDed with the acquired establishment determination information to create avoidance information. Specifically, the avoidance information is created by ANDing the corresponding bits of the establishment determination information and the calculation information each composed of 2 bytes. Therefore, the avoidance information is composed of 2 bytes, and includes first avoidance information and second avoidance information.

  When an unfair prize is generated, “1” is stored in any bit of the first avoidance information among the avoidance information created as described above. With respect to the first BB combination in the normal gaming state, this will be described by exemplifying a case where no illegal prize is generated and a case where an illegal prize is generated.

  First, a case where no unfair prize is generated will be described. The first mask information of the mask information set in the normal gaming state is “01111111” as described above. Further, when the first BB combination is won in the normal gaming state, the winning information is “00000010”. The first calculation information in this case becomes “01111101” by performing AND processing on “01111111” of the first mask information and “11111101” which is the inversion of the winning information. Further, when the combination of winning symbols of the first BB combination is stopped on the search line, the first establishment determination information of the establishment determination information is “00000010”. Accordingly, the first avoidance information of the avoidance information in this case becomes “00000000” by performing AND processing on “01111101” and “00000010”.

  Next, a case where an unfair prize is generated will be described. The first mask information of the mask information set in the normal gaming state is “01111111” as described above. In addition, when no combination is won in the normal gaming state, the winning information is “00000000”. The first calculation information in this case becomes “0111111111” by performing AND processing on “01111111” of the first mask information and “11111111” which is the inversion of the winning information. Further, when the combination of winning symbols for the first BB combination is stopped on the search line, the first establishment determination information of the establishment determination information is “00000010” as described above. Therefore, the first avoidance information of the avoidance information in this case becomes “00000010” by performing AND processing on “01111111” and “00000010”.

  Returning to the description of FIG. 35, in step S1809, an unfair winning is generated by determining whether or not “1” is stored in any bit of the first avoidance information created in the unfair winning determination process. It is determined whether or not to do. However, when the search line is an ineffective line, it is determined that an unfair prize is not generated even if “1” is stored in any bit of the first avoidance information. This is because an ineffective line is a line unrelated to winning.

  If an unfair prize is not generated, the process proceeds to step S1811 as it is, and the processes after step S1811 are executed. On the other hand, if an unfair win occurs, after clearing all the bits of the determination value calculation information buffer B at the current symbol number “0” in step S1810, the winning determination process is terminated.

  Here, as described above, the unsuccessful prize determination bit in the determination value calculation information buffer B stores “1” as an initial value. On the other hand, when it is determined that an unreasonable winning will occur, all bits including the unreasonable winning determination bit are cleared to “0”. Therefore, it is possible to reduce the priority determination value of the target symbol number for which an unfair winning will occur with respect to the priority determination value of the target symbol number that does not generate an unfair winning, resulting in an unfair winning in the reel. It is possible to prevent the symbol number from stopping at the base point position and to prevent the occurrence of an unfair winning prize.

  In the winning determination process in the first stop process, since there is one reel that has issued a stop command, a negative determination is made in step S1825. On the other hand, in the winning determination process in the second stop process, since there are two reels for which a stop command has been issued, an affirmative determination is made in step S1825, and the kicking process in steps S1827 to S1830 is executed.

  The kicking process is a process for avoiding the appearance of kicking eyes. Kick-off eyes are stop outcomes that do not constitute unfair winnings (combination of symbols or symbol stop mode), but a stop that may confuse the player if it appears in relation to the winning status of the role or the gaming state It means a dice. Specifically, in the slot machine 10, there are reach eyes in the BB non-winning situation, and alternative eyes that appear when the watermelon role (that is, the possibility of being missed) is missed. It is set as a kicking eye.

  Here, specifically about the above reach eyes, any combination of “red 7” symbol, “white 7” symbol, “youth” symbol, “bar” symbol, on any line (active line and ineffective) (Both lines) corresponds to the case of stopping (hereinafter, the reach is also referred to as a general reach). Moreover, the case where the combination of the symbol corresponding to the combination which is the object of the lottery stops on the ineffective line (including at least the middle line L2) is applicable. Specifically, as shown in FIG. 40, the above-mentioned alternative item includes a case where a combination of a predetermined pattern of a “bar” symbol and a “watermelon” symbol stops on any line, a “watermelon” symbol, This applies to the case where the “Youth” symbol and “Youth” symbol stop on any line in this order.

  In addition to the above, as the kick-off eyes, reach eyes and alternative eyes that appear in conjunction with the winning of a combination that has no possibility of being missed, such as replaying, are set. Furthermore, a case where a combination of symbols corresponding to a combination that is not a lottery target is stopped on the active line is set as a kicking eye. In addition, it is good also as a structure which sets not the case where the combination of the symbol corresponding to the combination which is not the object of a lottery on an active line is set as an unsuccessful winning prize.

  In the kicking process, first, in step S1827, a kicking mask information setting process is executed in order to set information on a stop event that is a determination target of whether or not the kicking eye is the current kicking process.

  Here, the setting process of the mask information for kicking will be described in detail. The kicking mask information is stored in the mask information storage area 105h of the ROM 105, and is composed of 2 bytes composed of the first mask information and the second mask information, like the mask information for unfair winning.

  Among these, when the combination of symbols corresponding to the combination that is the subject of the lottery stops on the ineffective line, the combination of symbols corresponding to the combination that is not the subject of the lottery is valid The case where the vehicle stops on the line is set as information on a stop event that is a target for determination as to whether or not it is a kicking eye. This is because, as described above, the first mask information corresponds to the first establishment determination information related to winning among the establishment determination information.

  The first mask information will be specifically described taking an example of a normal gaming state. In the BB non-winning situation, when the current search line is an ineffective line, information on the combination of symbols corresponding to the winning combination is set in the first mask information. That is, in the first mask information, “1” is stored in each bit in association with each role correspondence information of the replay, the first to third BB roles, the watermelon role, the bell role, and the cherry role, and “01111111” " Further, when the current search line is an active line, information on a combination of symbols corresponding to a combination that is not a lottery target is set in the first mask information. In other words, since the JAC combination is a combination that is not a lottery target in the normal gaming state, “1” is stored in the bit corresponding to the bit storing “1” in the combination correspondence information of the JAC combination. , “10000000”.

  Incidentally, the mask information in which the first mask information is “01111111” and the mask information in which “10000000” is set are also set as mask information for unfair prize winning as described above. That is, the mask information for unfair prize winning is also used as the mask information for kicking, and the storage capacity for the mask information in the ROM 105 is reduced. In addition, it is not essential that the mask information for unfair winning prizes is also used as the mask information for kicking, and each mask information may be provided separately.

  On the other hand, in the BB winning situation, when the current search line is an invalid line, the first mask information is “00000000” unlike the BB non-winning situation. On the other hand, when the current search line is an active line, the first mask information is “10000000” as in the case of the BB non-winning situation. This is because, as described above, the combination of symbols corresponding to the combination that is not a lottery target is not a reach eye but a kick eye.

  In addition, when the general reach eye or the alternative eye is established on any line by the second mask information, it is set as information on a stop outcome that is a target for determination as to whether or not it is a kick eye. This is because, as described above, the second mask information corresponds to the second establishment determination information regarding kicking in the establishment determination information.

  The second mask information will be specifically described taking an example of a normal gaming state. When neither the BB winning status nor the watermelon winning status is set, information on both general reach and alternative eyes is set in the second mask information. That is, in the second mask information, “1” is stored in each bit in association with all kicking correspondence information shown in FIG. 40, and is “00001111”. In addition, when it is a watermelon winning situation instead of a BB winning situation, “1” is stored in each bit in association with the kicking correspondence information of the general reach among the kicking correspondence information shown in FIG. “00000001”. When the BB winning status is not the watermelon winning status, “1” is stored in each bit in association with the alternative kicking correspondence information in the kicking correspondence information shown in FIG. " Furthermore, in the case of a BB winning situation and a watermelon winning situation, “00000000” is set.

  In step S1827, the current kicking mask information is selected from the mask information storage area 105h of the ROM 105 and set based on the gaming state, winning combination status, and current search line information. This setting is performed by storing the current mask information in the mask information register provided in the CPU 102 as in the case of the unfair prize winning process. However, the mask information buffer is provided in the RAM 106 and stored therein. A configuration may be adopted.

  In step S1828 following the kicking process, a kicked eye appearance determination process is executed. In the kicking eye appearance determination process, the establishment determination information stored in the establishment determination buffer 169 of the RAM 106 is acquired, and the mask information stored in the mask information register is ANDed with respect to the acquired establishment determination information to avoid the occurrence. Create information. That is, only the process of step S2502 in the above-described unfair prize determination process (see FIG. 49) is performed to create avoidance information.

  When a kicked eye appears, “1” is stored in one of the first avoidance information and the second avoidance information in the avoidance information created as described above. As a specific example, a case where a kicked eye does not appear and a case where a kicked eye appears when the search line is an active line in the normal gaming state and no winning combination is won will be described. In this case, the first mask information is “10000000” as described above, and the second mask information is “00001111” as described above.

  First, a case where no kicked-off eye appears will be described. For example, when the “replay” symbol, the “watermelon” symbol, and the “red 7” symbol are arranged in this order on the search line, the establishment determination information includes both the first establishment determination information and the second establishment determination information. Is “00000000”. Accordingly, the avoidance information in this case is “00000000” for both the first avoidance information and the second avoidance information.

  Next, a case where a kicked eye appears will be described. For example, when the “replay” symbol, the “replay” symbol, and the “bell” symbol are arranged in this order on the search line, the first establishment determination information becomes “10000000” as the establishment determination information. Becomes “00000000”. Therefore, in the avoidance information in this case, the first avoidance information is “10000000” and the second avoidance information is “00000000”. Further, for example, when the “red 7” symbol, the “white 7” symbol, and the “youth” symbol are arranged in this order on the search line, the establishment determination information is “000000000000” as the first establishment determination information. The establishment determination information is “00000001”. Therefore, in the avoidance information in this case, the first avoidance information is “00000000” and the second avoidance information is “00000001”.

  In step S1829 that continues in the kicking process, it is determined whether or not a kicked eye appears by determining whether or not “1” is stored in any bit of the avoidance information created in the kicking eye appearance determining process. Determine whether. If the kicked-off eye does not appear, a lead-in bit information search process is executed in step S1831, and the process proceeds to step S1832. On the other hand, when a kicked eye appears, after clearing the kick determination bit of the determination value calculation information buffer B for the target symbol number “0” in step S1830, the retrieval bit information search process of step S1831 is executed. Then, the process proceeds to step S1832. That is, for the target symbol number where the kicked eye appears, the kicking determination bit is “0”, and the pull-in bit and the second priority line bit are also “0”.

  Here, as described above, the kick determination bit of the determination value calculation information buffer B stores “1” as an initial value. On the other hand, if it is determined in step S1829 that a kicked eye will appear, the kick determination bit is cleared to “0”. Therefore, for a target symbol number having the same form of the first buffer B1 of the determination value calculation information buffer B, a target in which a kicked eye appears with respect to a priority determination value of a target symbol number in which the kicked eye does not appear The symbol number priority order determination value can be reduced, and it is avoided as much as possible that the symbol number where the kicked eye appears on the reel stops at the base point position, and the appearance of the kicked eye can be avoided as much as possible.

  Returning to the description of the second stop process, after executing the second stop and subsequent priority information generation process in step S2205, the process proceeds to step S2206, and the stop completion information is stored in the stop completion information buffer 158 of the RAM 106. It is determined whether or not. If stop completion information is stored, since the stop of the reel that is the second stop target has been completed, the process proceeds to step S2207. If stop completion information is not stored, the process of step S2206 is repeatedly executed. In such a case, the stop completion information is then stored in the stop interrupt process, so that an affirmative determination is made in step S2206 and the process proceeds to step S2207. In step S 2207, stop interrupt processing is prohibited, and stop completion information is cleared from the stop completion information buffer 158. Thereafter, the second stop process is terminated.

  Next, the third stop process will be described based on the flowchart of FIG.

  In the third stop process, first, a second stop and subsequent slip number acquisition process is executed in step S2601. The details of the second stop and subsequent slip number acquisition processing are the same as described above, and will be omitted. Through this second stop and subsequent slip number acquisition process, the reel slip number corresponding to the third stop command is acquired.

  In a succeeding step S2602, a stop position setting process is executed. In the stop position setting process, a stop symbol number is calculated based on the number of slips acquired in step S2601, and the calculated stop symbol number is stored in the stop position buffer 155 of the RAM 106.

  In a succeeding step S2603, stop interruption processing is permitted. The stop interrupt processing is as described above, and the reel deceleration processing is executed so that the symbol of the stop symbol number in the reel that is the third stop target stops at the base point position by such processing.

  Thereafter, in step S2604, it is determined whether or not stop completion information is stored in the stop completion information buffer 158 of the RAM. If stop completion information is stored, the reel that is the third stop target has been stopped, and the process advances to step S2605. If stop completion information is not stored, the process of step S2604 is repeatedly executed. In such a case, the stop completion information is then stored in the stop interrupt process, so that an affirmative determination is made in step S2604 and the process proceeds to step S2605. In step S 2605, stop interrupt processing is prohibited, and stop completion information is cleared from the stop completion information buffer 158. Thereafter, the third stop process is terminated.

  Next, first to third stop processing when stopping reels other than the left reel 32L as the first stop will be described. However, in the following description, differences from the case where the left reel 32L is stopped as the first stop will be described.

  Prior to the description of each of the stop processes, first, differences in the reel rotation process will be described. As described above, in the reel rotation processing (see FIG. 18), irregular pressing priority order information creation processing is executed in step S704. The irregular pressing priority order information creation process is a process for creating a stop information group in advance for each of the reels 32M and 32R assuming that the middle reel 32M or the right reel 32R is stopped at the time of the first stop. .

  The irregular pushing priority order information creation processing will be described with reference to the flowchart of FIG. In the irregular pressing priority order information creation processing, first, in step S2701, information indicating the middle reel 32M is stored as target reel information in the target reel information buffer 160 of the RAM. In subsequent step S2702, information on the preset pull-in bit offset is stored in the pull-in bit offset buffer 157 of the RAM 106, and information on the pre-set priority line is stored in the priority line buffer 156 in the RAM 106.

  The pull-in bit offset and priority line at the time of irregular pressing are set for each of the middle reel 32M and the right reel 32R. In addition, the pull-in bit offset and priority line at the time of irregular pressing are set in accordance with the gaming situation of the slot machine 10, and further set in correspondence with each combination in each gaming situation. However, regarding re-games, the upper line L1 is set as a priority line when an irregular pressing is performed, regardless of whether the gaming situation is a BB winning situation or a BB non-winning situation. In step S2702, each information of the current target reel, the gaming situation, and the lead-in bit offset and priority line corresponding to the winning combination is stored in the corresponding buffers 156 and 157.

  Regarding the pull-in bit offset at the time of irregular pressing, for the pull-in bit offset set when the middle reel 32M is stopped for the first time, the left reel is selected from a number of pull-in bit tables (for example, 100). The number of the drawing bit table for 32L and the number of the drawing bit table for the right reel 32R are assigned. Further, for the pull-in bit offset set when the right reel 32R is stopped for the first time, the pull-in bit table number for the left reel 32L and the pull-in for the middle reel 32M are selected from a number of pull-in bit table numbers. A bit table number is assigned.

  In a succeeding step S2703, a determination value calculation information creation process is executed. In step S2704, the target reel information buffer 160 is referenced to determine whether the target reel is the right reel 32R. If the target reel is not the right reel 32R, a negative determination is made in step S2704, information on the right reel 32R is stored as target reel information in the target reel information buffer 160 in step S2705, and then the process returns to step S2702. And after performing the process of step S2702 and step S2703 about the right reel 32R, by making an affirmative determination in step S2704, the priority order information generation process for irregular pushing is ended.

  The determination value calculation information creation process in the irregular pushing priority order information creation process will be described. In the determination value calculation information creation processing, the processing of steps S1501 to S1506 in FIG. 29 is executed in the same manner as the determination value calculation information creation processing in the second and subsequent priority information creation processing. However, since there is no reel for which a stop command has already been issued, it is assumed that each symbol number has stopped at the base point position for only the target reel, and determination value calculation information is created for the assumed target symbol number.

  With respect to the drawn bit information setting process (see FIG. 31) in step S1503 in the determination value calculation information creation process, only the initialization of the drawn bit information search buffer 162 is executed in the drawn bit information expansion preparation process in step S1601. Then, by the processing in steps S1602 to S1605, the lead-in bit information is stored in the lead-in bit information search buffer 162 of the target reel.

  In the winning determination process (see FIG. 35) in step S1504 in the current determination value calculation information creation process, if the target reel is not the left reel 32L, a negative determination is made in step S1803, and a correction process is executed in step S1804.

  In the correction process, as shown in the flowchart of FIG. 52, it is determined in step S2801 whether the left reel 32L has already stopped. If the left reel 32L is stopped, the present process is terminated without executing the correction process. If the left reel 32L is not stopped, the process advances to step S2802 to determine whether line mask information is designated. The line mask information is stored in the mask information storage area 105h of the ROM 105 in the same manner as the mask information described above, and the line mask information corresponding to each model of the slot machine 10 is stored in the mask information storage area 105h. ing. In this embodiment, since line mask information is not designated, a negative determination is made in step S2802, and the flow proceeds to step S2803. In step S2803, general-purpose line mask information is acquired, and the general-purpose line mask information is stored in a line mask information register provided in the CPU. The RAM 106 may be provided with a line mask information buffer and the line mask information may be stored therein.

  The general-purpose line mask information is composed of 1 byte corresponding to the first establishment determination information in the establishment determination information, and “0” is stored in the bit storing “1” in the cherry role combination information. "1" is stored in the bits of. That is, the general-purpose line mask information is “10111111”.

  In step S2804, the first establishment determination information is corrected. Specifically, the general-purpose line mask information and the first establishment determination information are AND-processed, and the result is stored in the establishment determination buffer 169 of the RAM 106 as new first establishment determination information. By executing such processing, the value of the bit storing “1” in the cherry role combination information is changed to “0” in each bit of the first establishment determination information. This process is executed for the following reason.

  That is, as described above, if the “Cherry” symbol of the left reel 32L stops on the active line when winning, the winning is established and the stop symbols of the middle reel 32M and the right reel 32R are arbitrary. For the middle reel 32M and the right reel 32R, “1” is stored in the bit corresponding to the cherry role in the first symbol correspondence information of all symbols (see FIG. 38). In such a configuration, when no stop command is issued to the left reel 32L and the left reel 32L is not the target reel, the first establishment determination information always constitutes a symbol combination corresponding to the cherry combination. Information will be included. Then, in step S1813, it is determined that there is always a possibility of winning the cherry role, and the determination value calculation information cannot be created accurately. On the other hand, the occurrence of such inconvenience can be prevented by executing the correction process of the first establishment determination information as described above.

  Further, in the payout number acquisition process (see FIG. 41) in step S1816 in the current winning determination process, the following unique process is executed. That is, in the situation where the irregular pushing priority information creation process is being executed, no stop command has been issued for any reel, so a negative determination is made in step S2003, and the flow proceeds to step S2004. In step S2004, AND processing is performed on information obtained by inverting each bit of the determined confirmation buffer 168 in the RAM 106 with respect to the validity determination information acquired in step S2001. By executing such processing, when the determination information for winning / failure matches the winning determination information, all the bits for the determination information for determining success / failure are cleared to “0”. Therefore, in the payout number acquisition process in the irregular pushing priority order information creation process, the addition of the payout number is not executed for the same determination information as the determined confirmation information.

  This is due to the following reason. That is, if the target reel is the middle reel 32M and the symbol of the target symbol number is the first “white 7” symbol in the situation where the bell role is won, as shown in FIG. 53, the middle reel 32M The “bell” symbol will stop at the middle stage. In this case, assuming that the process of step S2004 is not executed, when the search line is a right-down line L4, information on the number of payouts corresponding to the bell combination is obtained as the acquired number of bits in the determination value calculation information buffer B. In addition, when the search line is the right-up line L5, information on the number of payouts corresponding to the bell combination is added again to the acquired number of bits. That is, the acquired number information that is twice the actual payout number information with respect to the acquired number of bits is stored.

  Then, even if the priority line is set to the upper line L1 because the acquired number of bits is set higher than the first priority line bit in the determination value calculation information buffer B, the “bell” symbol is in the middle stage. The priority determination value when stopping at the time is larger than the priority determination value when the “bell” symbol stops at the upper stage, and the priority line is substantially limited to the right-down line L4 or the right-up line L5. Will end up.

  On the other hand, by executing the processing of step S2004, it is possible to prevent the acquired number information obtained by doubling the actual payout number information with respect to the acquired number of bits, and to make the stop output monotonous. Can be prevented.

  By executing the irregular pushing priority order information creation process, a stop information group for each reel 32M, 32R used for stopping the middle reel 32M or the right reel 32R at the time of the first stop is created in advance. In such a configuration, as described above, the irregular pushing priority information creation processing is executed in a situation where the start interrupt processing is permitted. That is, the reel acceleration process and the irregularity pushing priority information creation process are performed in parallel. In addition, the processing time is set so that the irregular pressing priority information creation processing ends within the acceleration period from the start of the acceleration processing of the reels 32L, 32M, and 32R to the steady rotation. This makes it possible to create priority information for irregular pushing by effectively using the period during which the reel acceleration process is executed. Further, the stop operation of each of the stop switches 42 to 44 is invalidated until the acceleration period elapses, so that the reel stop is performed even though the creation of the priority information for pushing the irregularity is not completed. Control is prevented from starting. Furthermore, in the normal process, only the process related to the creation of the priority information for pushing irregularities is performed in parallel with the start interrupt process. Therefore, in the configuration in which the processes are performed in parallel as described above. The processing load is prevented from increasing extremely.

  Next, differences in the reel stop process will be described.

  In the first stop slip number acquisition process of step S1101 in the first stop process (see FIG. 24), since the stop reel information stored in the stop reel specifying buffer 154 of the RAM 106 is not information indicating the left reel 32L, step S1201 is performed. The negative determination is made at step S1207 to S1208 (see FIG. 25).

  In step S1207, the second stop and subsequent slip number acquisition processing is executed. Since this process has already been described, the description thereof is omitted here. In step S1208, stop position setting processing is executed. In the stop position setting process, a stop symbol number is calculated based on the number of slips acquired in the second stop and subsequent slip number acquisition process in step S1207, and the stop position of the RAM 106 is set using the calculated stop symbol number as stop position information. Stored in the buffer 155.

  In step S1103 in the first stop process, a negative determination is made because the stop reel information stored in the stop reel specifying buffer 154 of the RAM 106 is not information indicating the left reel 32L. Thereby, the process of step S1104 and step S1105 is performed.

  In step S1104, priority line change processing is executed to change the priority line. When the first stop target is the left reel 32L, the priority line change process is not executed in the first stop process, whereas when the first stop target is other than the left reel 32L, the first stop process has priority. In the former case, the line change process is executed because the priority line is acquired in correspondence with the stop symbol number of the reel to be stopped first in the first stop sliding number acquisition process in step S1101. In the latter case, the priority line is acquired in the irregular push priority order information creation process in the reel rotation process, and the priority line does not correspond to the stop symbol number of the first stop target reel.

  In step S <b> 1105, information on the pull-in bit offset used in the priority information generation process for second and subsequent stops to be executed in the future is stored in the pull-in bit offset buffer 157 of the RAM 106. The pull-in bit offset is set in correspondence with the reel that is the first stop target when the irregular push is performed. Further, the lead-in bit offset is set in correspondence with the gaming situation of the slot machine 10, and is further set in correspondence with each combination in each gaming situation.

  In step S1106, the second stop and subsequent priority information creation processing is executed. Here, in the priority information generation process for the second and subsequent stops at the time of irregular pressing, the left reel 32L may be the target reel because the left reel 32L exists as a reel for which a stop command has not yet been issued. When the left reel 32L is the target reel, in the winning determination process (see FIG. 35) in step S1504 in the determination value calculation information creation process, the illegal winning process in steps S1807 to S1810 and the steps S1827 to S1830 are performed. A process specific to the kicking process is executed. Therefore, each of these unique processes will be described.

  First, the unfair winning process will be described. When the target reel is the left reel 32L, there may be a “cherry” symbol of the left reel 32L on the current search line. In such a case, an affirmative determination is made in step S1806, and the illegal winning process in steps S1807 to S1810 is executed. This unreasonable winning process is as described above. In such a situation, the unreasonable winning of the cherry role is prevented by executing the unreasonable winning process.

  As described above, even if the number of stop commands issued has not reached two, if the target reel is the left reel 32L and the “cherry” symbol of the left reel 32L is on the search line, an unfair winning prize The processing is executed because the cherry winning is established only by stopping the “cherry” symbol of the left reel 32L on the active line and is not related to the stopping appearance of the other reels 32M and 32R.

  Next, the kicking process will be described. When the target reel is the left reel 32L, there may be a “cherry” symbol of the left reel 32L on the current search line. In such a case, an affirmative determination is made in step S1826, and the kicking process in steps S1827 to S1830 is executed. The kicking process is as described above.

  Even if the number of reels for which the stop command has been issued has not reached two, the target reel is the left reel 32L, and the kicking process is executed when the “cherry” symbol of the left reel 32L is on the search line. The reason is as follows. That is, when the cherry combination is set as the lottery combination, the cherry winning is established only by stopping the “cherry” symbol of the left reel 32L on the active line. In this case, for example, the “cherry” symbol of the left reel 32L is prevented from stopping on the active line as much as possible in a situation where the cherry combination is not set as the winning combination as in the BB state. This is because if the “Cherry” symbol of the left reel 32L is stopped on the active line but the Cherry winning is not established, the player will be confused. Moreover, it is set as the appearance of a reach eye that the combination of the symbol corresponding to the combination which is the object of the lottery stops on the ineffective line (including at least the middle line L2). In this case, if the “cherry” symbol of the left reel 32L stops on the ineffective line in the BB non-winning situation, it means that a reach eye appears.

  In the first stop process, the same process as that in the case of stopping the left reel 32L as the first stop is executed except for the above differences. Also, in the second stop process and the third stop process, the same process as when the left reel 32L is stopped as the first stop is executed. That is, in the second stop process, the number of slips is acquired based on the priority information created in the first stop process, the stop position of the second stop target reel is set, and a stop command has not yet been issued. Create priority information for reels. In the third stop process, the number of slips is acquired based on the priority information created in the second stop process, and the stop position of the third stop target reel is set. Therefore, when the reels other than the left reel 32L are stopped as the first stop, all the reels 32L, 32M, and 32R acquire the number of slides based on the priority order information and set the stop position.

  As described above, in the slot machine 10, priority order information basically created after the start of rotation of the reels 32L, 32M, and 32R except for the left reel 32L when the left reel 32L is stopped as the first stop. Based on this, the stop position of each reel is set. In such a configuration, a plurality of types of bits are set in each determination value calculation information buffer B constituting the priority order information as described above (see FIG. 28B). Each of these multiple types of bits has a characteristic function, and the allocation order of the multiple types of bits within 2 bytes is also characteristic. Therefore, each bit assigned to the determination value calculation information buffer B will be described below.

  The determination value calculation information buffer B has a first buffer B1 as an upper information buffer and a second buffer B2 as a lower information buffer. The priority determination value becomes larger as “1” is stored in the first buffer B1 than in the second buffer B2. Further, when the first and second buffers B1 and B2 are viewed individually, the priority determination value becomes larger as “1” is stored in the upper bits in the buffers B1 and B2.

  In such a configuration, the first buffer B1 is assigned with a wrong winning determination bit, a replay bit, a BB combination bit, a small combination bit, and an acquired number of bits, as viewed from the upper side. In addition, a kick determination bit, a first priority line bit, a pull-in bit, and a second priority line bit are assigned to the second buffer B2 when viewed from the upper side.

  By assigning the unreasonable winning determination bit to the top, the priority determination value of the symbol in which the unreasonable winning is generated can be set to the minimum value with respect to the other symbols. That is, as described above, “1” is stored as the initial value in the unfair winning determination bit, and at least the unfair winning determining bit is cleared for the target symbol number where the unfair winning occurs. Therefore, in the determination value calculation information buffer B for the symbol number where an unfair win occurs, at least the highest value is “0”, and the priority determination value is the minimum for the symbol number where no unfair winning occurs. Thereby, when the number of slips is acquired, it is possible to avoid stopping the symbol number in which an unreasonable prize is generated and to reliably prevent an unreasonable prize.

  The replay bit, the BB role bit, and the small role bit (hereinafter also referred to as “winning role bit”) corresponding to the winning combination are allocated next to the unfair winning determination bit, that is, the winning combination bit is determined to be unfair winning determination. By assigning the highest number except for the bits, the symbol number where a winning occurs and the priority determination value of the symbol number constituting the winning can be made larger than other symbol numbers. Thereby, in the reel stop control in the slot machine 10, the generation of a winning is surely given priority, and the player's profit is secured.

  In the winning combination bit, a bit is individually assigned to each of the replay, the BB combination, and the small combination. As a result, the symbol number where the re-game prize is generated, the symbol number where the BB prize is generated, and the symbol number where the small role prize is generated have different priority determination values, and a plurality of roles are simultaneously selected. The symbol can be stopped corresponding to each winning combination.

  The winning combination bits are assigned in the order of a replay bit, a BB combination bit, and a small combination bit as viewed from the upper side. Therefore, for example, when the re-game and the BB combination are won at the same time, the re-game winning is given priority, and when the BB combination and the small combination are simultaneously won, the BB winning is given priority. Specifically, if a watermelon role is won in the BB winning situation, if the BB winning can be established, the establishment of the BB winning is given priority even if the watermelon winning is possible. The On the other hand, if a BB prize cannot be established and a watermelon prize can be established, a watermelon prize is established.

  By assigning the acquired number of bits, if a plurality of small roles are selected at the same time, the priority order judgment value of the symbol number that generates a small role winning with a large number of payouts will be a small role winning with a small number of payouts. It becomes larger than the priority order judgment value of the generated symbol number. Therefore, a small role winning with a large number of payouts is given priority and the player's profit is secured.

  In addition, each time a symbol number where a winning combination is generated is detected in the winning determination process, information on the number of payouts corresponding to the winning combination is added to the winning number bit. Is done. Therefore, priority is given to a stoppage that is advantageous to the player.

  Specifically, for example, in the situation where a watermelon role is won, as shown in FIG. 54A, when the 14th “watermelon” symbol of the left reel 32L stops at the lower stage, the left reel 32L The “watermelon” symbol stops at the upper and lower stages. In such a situation, the acquired number information of the No. 12 symbol that will stop the “watermelon” symbol of the middle reel 32M in the middle row shown in FIG. 54 (b) is the “watermelon” symbol in the lower row shown in FIG. 54 (c). Becomes larger than the acquired number information of the 13th symbol that will stop. That is, the former has a higher priority determination value than the latter. Therefore, the stop event shown in FIG. 54 (b) has priority over the stop event shown in FIG. 54 (c). In this case, even if the “watermelon” symbol stops at either the upper stage or the lower stage when the right reel 32R is stopped, a watermelon winning will occur, so that it is difficult for the watermelon role to be missed. In other words, priority will be given to the stoppage that is advantageous to the player.

  By assigning an unfair winning decision bit and a kick determination bit, the symbol number priority determination value when a kicked eye appears is larger than the symbol number when an unfair winning event occurs. can do. Thereby, when either the occurrence of an unfair winning prize or the appearance of a kicked eye cannot be avoided, the appearance of the kicked eye can be prioritized.

  Specifically, in a situation where neither of the roles has been won, the middle reel 32M and the right reel 32R are stopped, and as shown in FIG. 55 (a), the “youth” symbol is displayed on the lower right line L4. The case where two are arranged is assumed. In this case, when the left stop switch 42 is stopped at the timing when the eighth “bell” symbol of the left reel 32L reaches the lower stage in the third stop, FIGS. 55 (b) to 55 (f). The stop mode is assumed.

  In such a situation, in FIG. 55 (b), three “youth” symbols are arranged on the right-downward line L4. In FIG. 55 (c), the “cherry” symbol of the left reel 32L stops on the upper line L1 and the lower right line L4. In FIG. 55 (d), the “cherry” symbol of the left reel 32 </ b> L stops on the middle line L <b> 2, so that a kicked eye appears in the slot machine 10. In FIG. 55 (e), the “cherry” symbol of the left reel 32L stops on the lower line L3 and the right-up line L5, resulting in an unfair win. In FIG. 55 (f), since the “watermelon” symbol, the “young man” symbol, and the “young man” symbol are arranged on the right-down line L 4, the kicked eye appears in the slot machine 10.

  In this case, if the priority determination value of the symbol number when an unfair winning is generated and the priority determination value of the symbol number when a kicked eye appears are the same, FIG. 55 (b) to FIG. All of (f) have the same priority determination value. And in this slot machine 10, when the priority determination value is the same, since the symbol with a small number of slips is stopped with priority, it becomes the stop result of FIG. turn into.

  On the other hand, in this configuration in which the unfair prize determination bit and the kick determination bit are assigned separately, the priority of the symbol number when the kicked eye appears is higher than the symbol number when the illegal prize occurs. The rank judgment value increases. Therefore, the stop appearance in the cases of FIGS. 55 (d) and (f) is prioritized over the cases of FIGS. 55 (b), (c), and (e), and the occurrence of unfair winnings can be prevented.

  The kick determination bit is as already described. The kick determination bit is assigned to be lower than the acquired number bit. Thereby, when a plurality of small combinations are won at the same time, it is possible to prevent a small combination winning with a small number of payouts from occurring in order to avoid the appearance of kicked eyes.

  Specifically, in a situation where a combination of a cherry role and a watermelon role is won, the middle reel 32M and the right reel 32R stop when the irregular push is performed, and as shown in FIG. It is assumed that “Red 7” symbol and “Youth” symbol are arranged in the middle row. In this case, when the left stop switch 42 is stopped at the timing when the “watermelon” symbol 0 of the left reel 32L reaches the lower stage in the third stop, as shown in FIG. 56 (b). A watermelon can be won, and a cherry can be won as shown in FIG. 56 (c). When a watermelon prize is established, the number of payouts is six. On the other hand, when the cherry prize is established, the prize is established in each of the upper line L1 and the lower right line L4, so that the payout number is 8.

  In such a situation, as shown in FIG. 56 (c), when the cherry win is established, the “white 7” symbol, the “red 7” symbol, and the “youth” symbol are arranged on the middle line L2, and a kicked eye appears. . In this case, assuming that the kick determination bit is assigned to be higher than the acquired number of bits, the “watermelon” design of the number 0 on the left reel 32L is more than the “replay” design of the number 1 Since the priority determination value becomes large, the watermelon winning is given priority. In this case, since 6 medals are given priority over 8 medals, the profit that should have been originally obtained for the player has been lost. On the other hand, in the present configuration in which the kick determination bit is assigned to be lower than the acquired number of bits, the first “replay” symbol on the left reel 32L has priority over the zero “watermelon” symbol. The ranking judgment value increases, and the cherry prize is given priority. Thus, the player's profit is secured.

  By assigning the first priority line bit, when any of the winning combinations is won, the stop of the symbol corresponding to the winning combination on the priority line is given priority. In addition, since the first priority line bit is assigned so as to be lower than the acquired number of bits, the effect of assigning the acquired number of bits can be reliably achieved. In other words, assuming that the first priority line bit is assigned to be higher than the acquired number of bits, when the priority line is the lower line L3 in the situation shown in FIG. 54, FIG. The stop event shown in FIG. 5 is prioritized over the stop event shown in FIG. This is because the double tempering of the “watermelon” symbol does not occur and the above-described effects cannot be achieved.

  Since the first priority line bit is assigned to be lower than the kick determination bit, it is possible to prevent a kick eye from appearing when a cherry winning is established in the BB non-winning situation. .

  Specifically, in the case where the cherry role is won in the BB non-winning situation, as shown in FIG. 57 (a), the middle reel 32M and the right reel 32R are stopped and placed on the middle line L2 which is an ineffective line. "Bell" designs may be displayed. In this case, when the left stop switch 42 is stopped at the timing when the first “replay” symbol of the left reel 32L reaches the lower stage in the third stop, as shown in FIG. 57 (b). When the “cherry” symbol of the left reel 32L stops at the upper stage and a cherry winning is achieved, as shown in FIG. 57 (c), the “cherry” symbol of the left reel 32L stops at the lower stage and the cherry winning is achieved. A case may be considered.

  In this situation, when the priority line is the right rising line L5, “1” is stored in the first priority line bit of the third symbol where the “cherry” symbol stops at the lower stage, and the “cherry” symbol is at the upper stage. “1” is not stored in the first priority line bit of the first symbol that stops at the time. However, when the 3rd symbol stops at the lower stage, as shown in FIG. 57 (c), the “bell” symbols are aligned on the middle line L2, and the kicking eyes appear in the slot machine 10. Therefore, the kick determination bit of the third symbol is cleared.

  In this case, assuming that the first priority line bit is assigned to be higher than the skip determination bit, the priority determination value of the third symbol is higher than the priority determination value of the first symbol. The stop appearance shown in FIG. 57 (c) is given priority. Then, kicked eyes will appear. On the other hand, in the present configuration in which the first priority line bit is assigned to be lower than the skip determination bit, the priority determination value of the first symbol is higher than the priority determination value of the third symbol. Therefore, the stop event shown in FIG. 57 (b) is given priority. Thereby, the appearance of kicking eyes can be prevented.

  The pull-in bit is as already described. In addition, since the pull-in bit is assigned lower than the first priority line bit, the priority determination value of the symbol related to the winning combination winning can be made larger than the priority determination value of the symbol not related to the winning winning combination. , You can give priority to winning the winning combination. In addition, since the second priority line bit is assigned, when a predetermined symbol combination such as a reach eye is stopped, priority can be given to the stop of the symbol combination on the priority line.

  Here, in the slot machine 10, out of the reach eyes, the stop output in which the symbol or the combination of symbols corresponding to the combination that is the subject of the lottery stops on the middle line L 2 that is an ineffective line is positively Can appear. Therefore, this configuration will be specifically described by taking as an example a case where the combination of symbols corresponding to the bell combination is positively stopped on the middle line L2.

  As already described, when the left reel 32L is first stopped, the stop symbol number to be stopped at the base point position is determined based on the slip table, and the priority line is also determined based on the slip table. In this case, for example, in the situation where the second BB winning status is not won for another role, the “white 7” symbol corresponding to the second BB role cannot be stopped on the active line. The “bell” symbol is set to stop on the middle line L2, and the priority line is set on the lower line L3.

  In the configuration in which the slip table is set as described above, the pull-in bit table of the middle reel 32M and the right reel 32R is assigned the “bell” symbol when the second BB is won and no other role is won. The drawn bit information of the symbol number that is smaller by “1” than the symbol number that has been set is set larger than the symbol number that does not contribute to the formation of the reach. As a result, in the lead-in bit information search process (see FIG. 42), a symbol number that is smaller by “1” than the symbol number with the “bell” symbol is placed on the priority line for the middle reel 32M and the right reel 32R. The drawn bit information combined value when stopping is larger than the drawn bit information combined value when the symbol number that does not contribute to the formation of reach is stopped on the priority line. Since the priority line is set to the lower line L3 in the sliding table, the symbol number “1” smaller than the symbol number to which the “bell” symbol is attached stops when the symbol number stops on the lower line L3. “1” is stored in the 2 priority line bits.

  With the above configuration, in the second BB winning situation, the symbol that the “Bell” symbol stops on the middle line L2 except for the symbol number constituting the second BB prize and the symbol number forming another reach. The number priority determination value can be increased. Therefore, it is possible to positively appear as reach eyes when the symbol or the symbol combination corresponding to the combination that is the subject of the lottery stops on the middle line L2, which is an ineffective line.

  In addition, the said structure is only an illustration, For example, the same thing can be performed also in the 1BB winning situation or the 3BB winning situation. Further, even if the combination constituting the reach on the middle line L2 is other than the bell combination (that is, the replay, the cherry combination or the watermelon combination), it can be similarly performed.

  In the drawing bit table, the symbol number that is set larger than the symbol number for which the drawing bit information does not contribute to the formation of the reach is set to “1” for the symbol number to be positively stopped on the middle line L2. The symbol number is not limited to a small symbol number, and may be a symbol number that is “1” larger than the symbol number to be positively stopped on the middle line L2. However, in this case, it is necessary to set the priority line to the upper line L1.

  Further, the middle line L2 can be set as a priority line, and the drawing bit information of the symbol number that is to be positively stopped on the middle line L2 in the drawing bit table has a symbol number that does not contribute to the formation of the reach. It may be larger than the pull-in bit information.

  Next, the medal payout process in step S606 in the normal process (see FIG. 17) will be described based on the flowchart in FIG.

  In the medal payout process, first, it is determined whether or not the payout number counted by the payout number counter in step S2901 matches the planned payout number stored in the payout planned number storage area. If the number of payouts does not match the planned payout number, it is determined in step S2902 whether the count value of the credit counter has reached the upper limit (the number of stored medals is 50). If the upper limit has not been reached, 1 is added to each of the count value of the credit counter and the number of payouts in steps S2903 and S2905. Thereafter, in step S2906, display unit change processing is performed in which the credit display unit 60 and the payout number display unit 62 are each incremented by one.

  On the other hand, when the count value of the credit counter reaches the upper limit in step S2902, the medal payout rotating plate is driven in step S2904 to pay the medal from the hopper device 51 to the medal tray 50 through the medal discharge port 49. put out. In subsequent step S2905, 1 is added to the number of payouts according to the medal detection signal of the payout detection sensor 51a attached to the hopper device 51. Thereafter, in step S2906, display unit change processing for adding 1 to the number of payout number display unit 62 is performed. After performing a display part change process in step S2906, it returns to step S2901 again. If the number of payouts matches the number of payouts in step S2901, it is determined in step S2907 whether the current bonus game is in progress (BB state). If it is not a bonus game, the process proceeds to step S2909, and after the payout end process is performed, this process ends. In the payout end process, the payout amount storage area and the payout counter value are cleared to “0”. Note that the value in the payout number display portion 62 is cleared when a medal is bet to start the next game. If the bonus game is currently being played, in step S2908, the payout number is subtracted from the count value of a remaining acquisition number counter described later, and the number of remaining payout number display unit 61 is subtracted. Thereafter, a payout end process is performed in step S2909, and this process ends. Note that the process of subtracting the number of the remaining payout number display unit 61 may be performed in the display unit changing process in step S2906.

  Next, the bonus game process of step S607 in the normal process (see FIG. 17) will be described based on the flowchart of FIG.

  Prior to the description of the bonus game process, the bonus game will be described. The BB state is composed of a plurality of RB states. The RB state consists of 12 JAC games. A JAC game is a game that has a very high probability that a combination of JAC symbols is aligned on an active line, that is, a probability that a JAC winning will be established. When a JAC winning is established in the RB state, the maximum number (15 in this case) of medals is paid out. When the JAC winning is established 8 times, the RB state is ended even before the JAC game is played 12 times. Further, the BB state ends when the number of medals paid out reaches a predetermined number (specifically, 400). When the medal payout number reaches a predetermined number in the middle of the RB state, not only the BB state but also the RB state ends. This is a contrivance for suppressing the player's euphoria by giving an upper limit to the number of medals paid out during the BB state, and ensuring the soundness of the game. Further, in the present embodiment, the combination of symbols that shift to the RB state is not set, and the configuration shifts to the RB state immediately after the transition to the BB state and immediately after the RB state ends. Therefore, it can be said that the BB state is a game that continuously shifts to the RB state until a predetermined number of medals are paid out.

  In the bonus game process, first, in step S3001, it is determined whether or not a bonus game is in progress. When it is not during the bonus game, bonus symbol determination processing shown in steps S3002 to S3005 is performed.

  In this bonus symbol determination process, first, in step S3002, it is determined whether or not there is any BB winning information by referring to the winning combination determination buffer 151. If there is no BB winning information, this process is terminated. When there is BB winning information, the process proceeds to step S3003, where it is determined whether or not the combination of BB symbols corresponding to the BB winning information has been stopped on the current effective line. finish. On the other hand, when the combination of BB symbols on the current effective line stops, BB start processing is performed in step S3004. In the BB start process, the BB winning information is cleared and the BB setting information is stored, and the gaming state is set to the BB state which is a kind of bonus game. In addition, 400 is stored in the remaining acquisition number counter for counting the number of remaining medals that can be paid out in the BB state, and 400 is displayed on the remaining payout number display unit 61. Incidentally, whether or not a bonus game is being performed in step S3001 or the like is determined based on the presence or absence of BB setting information. In the subsequent step S3005, an RB start process is performed, and then this process ends. In the RB start process, 8 is stored in the remaining JAC winning counter for counting the number of possible JAC winnings, and 12 is stored in the remaining JAC game counter for counting the remaining number of JAC games.

  If it is determined in step S3001 that the bonus game is being played, the process advances to step S3006 to determine whether or not the combination of JAC symbols has stopped on the active line. When the combination of JAC symbols stops on the active line, the value of the remaining JAC winning counter is decremented by 1 in step S3007. After that, or when the combination of JAC symbols does not stop on the active line in step S3006, one JAC game has been consumed, so that the value of the remaining JAC game counter is decremented by 1 in step S3008. Subsequently, in step S3009, it is determined whether either the remaining JAC winning counter or the remaining JAC game counter has become zero. If any of them is 0, that is, if the JAC winning is established 8 times or the JAC game is consumed 12 times, it means that the RB state end condition is established, and therefore, in step S3010, the remaining JAC winning is won. RB end processing is performed to clear the counter and the remaining JAC game counter values. In a succeeding step S3011, it is confirmed whether or not the count value of the remaining acquisition number counter is zero. If it is not 0, it means that the number of medals paid out during the BB state has not reached the predetermined number and the end condition for the BB state is not satisfied, so the process proceeds to step S3012 and the RB start described above is started. After performing the processing, the present processing is terminated.

  If neither the remaining JAC winning counter or the remaining JAC game counter is 0 in step S3009, that is, if the JAC winning is not yet established 8 times and the JAC game is not consumed 12 times, step In step S3013, it is confirmed whether the count value of the remaining acquisition number counter is zero. If it is not 0, it means that the number of medals paid out during the BB state has not reached the predetermined number and the end condition for the BB state is not satisfied. On the other hand, when the count value of the remaining acquisition number counter is 0, it means that the BB state end condition is satisfied, so the special game state end process shown in steps S3014 to S3015 is performed. In the special game state end process, first, in step S3014, the above-described RB end process is performed. After that, in step S3015, a BB end process for appropriately clearing the BB setting information and various counters and performing an ending process is performed, and this process ends. In addition, even when the count value of the remaining acquisition number counter is 0 in step S3011, it means that the BB state end condition is satisfied, so the BB end process is performed in step S3015 and the process ends. To do.

  According to the embodiment described in detail above, the following excellent effects are obtained.

  A priority order information buffer 159 is provided in the RAM 106 of the main controller 101. At least in the first stop process and the second stop process, all symbols (all symbols) assigned to the reels for which a stop command has not yet been issued. No.) judgment value calculation information was created. At least in the second stop process and the third stop process, the number of symbol slips (that is, the stop symbol number) is determined based on the determination value calculation information created in the stop process prior to the stop process. I made it. This eliminates the need for a slide table for at least the reels subject to the second stop command and the third stop command, and reduces the amount of data stored in the ROM 105 in advance for stop control of the reels 32L, 32M, 32R. It becomes possible.

  Further, the determination value calculation information is created based on the stop symbol number of a reel for which a stop command has already been issued. As a result, it becomes possible to change the stop output of the reel to be subsequently stopped by the stop output of the reel that has been stopped first, and eliminates the need for a slip table for the reels that are subject to the second stop command and the third stop command. In the configuration described above, it is possible to diversify the stopping outcome.

  Further, the determination value calculation information is created for all symbols attached to the reels regarding the reels for which a stop command has not yet been issued. Thereby, even if the reaching symbol number is any symbol number, the stop symbol number can be determined using the determination value calculation information. That is, the stop symbol number can be determined based on the determination value calculation information regardless of the operation timing of the stop switch.

  Further, in the configuration having three reels 32L, 32M, and 32R as in the slot machine 10, even if a stop command is generated for one reel, a stop command is not generated for a plurality of reels. Although a situation arises, the stop symbol number can be determined using the determination value calculation information even if a stop command is issued for any of the reels for which a stop command has not yet been issued. That is, the stop symbol number can be determined based on the determination value calculation information regardless of the operation order of the stop switches 42 to 44.

  The priority information creation process for the second stop and subsequent priority information creation process (see FIG. 27) for creating each determination value calculation information of the reel that is the target of the second stop command or the third stop command is executed. This is executed in a situation where a stop interrupt process (see FIG. 26) for the reel to be stopped in the stop process is permitted. In other words, the creation of each determination value calculation information and the deceleration process of the reel to be stopped are performed in parallel. Accordingly, each determination calculation information can be created by effectively using the time required for the reel to be stopped to stop, and the next stop command is enabled after one reel stops. It is possible to reduce the time lag until.

  In addition, the processing time of the priority information generation process for the second and subsequent stops is set to end within a specified period from when the stop command is generated until the reel is slid for the maximum number of symbols and then stopped. For example, assuming that the processing time exceeds a specified period, it is necessary to ensure a long period from when one stop command is generated to when the next stop command becomes valid. In such a case, for the player, since the period from the time when one stop operation is performed until the next stop operation is validated becomes longer, the game may be delayed. On the other hand, according to the configuration of the present embodiment, such inconvenience does not occur.

  In addition, in the normal process (see FIG. 17), which is started when the power is turned on and the predetermined series of processes is repeatedly executed, the priority information generation process for the second stop and after is executed, and the normal process is periodically performed. In the timer interrupt process (see FIG. 13), a process of decelerating the reels 32L, 32M, and 32R is executed. Each of the reels 32L, 32M, and 32R is connected to a stepping motor, and each reel 32L, 32M, and 32R makes one rotation by giving a driving signal of a predetermined number of pulses (504 pulses) to the stepping motor. It is like that. In order to stabilize the behavior during rotation of the reels 32L, 32M, and 32R, the timing at which these drive signals are given is determined in advance. In this configuration, for example, assuming a configuration in which processing for decelerating the reels 32L, 32M, and 32R is performed in normal processing, and priority information generation processing for second stop and later is performed in timer interrupt processing, one drive signal is generated. It is necessary to finish the priority information generation process for the second and subsequent stops from the time of application to the timing of supplying the next drive signal, and the processing time allocated to the priority information generation process is shortened. Also, in such a case, if it takes a long time for the priority information generation process for the second and subsequent stops, it is assumed that the next timer interrupt process will be started when the previous timer interrupt process has not been completed. In this case, the timer interrupt process is continuously performed a plurality of times. If it does so, the timing which gives a drive signal will be overdue, and the behavior of reel 32L, 32M, 32R will become unstable. On the other hand, according to the configuration of the present embodiment, these problems do not occur.

  Between the start of rotation of all the reels 32L, 32M and 32R and before the operation of the stop switches 42 to 44 is validated, the middle reel 32M and the right reel 32R are for the first stop (for irregular pressing) Each judgment value calculation information was created. In addition, determination value calculation information is created for reels that can be the target of the second stop command and the third stop command. That is, the slide table is not required for the middle reel 32M and the right reel 32R, and it is possible to reduce the amount of data stored in the ROM 105 in advance for stop control of the reels 32L, 32M, 32R.

  An irregular push priority order information creation process (see FIG. 51) for creating judgment value calculation information for each of the right reels 32M and 32R for the first stop, and a start interrupt process in the reel rotation process (see FIG. 18). This is executed in a situation where (see FIG. 22) is permitted. That is, the creation of each determination value calculation information for each reel 32M, 32R for the first stop and the acceleration process for the reels 32L, 32M, 32R are performed in parallel. This makes it possible to create each determination value calculation information for each reel 32L, 32M, 32R for the first stop by effectively using the time required for the acceleration of the reels 32L, 32M, 32R to be completed. It is possible to reduce a time lag from when the acceleration of the reels 32L, 32M, and 32R is completed until the first stop command is validated.

  In addition, in the normal process (see FIG. 17), which starts when the power is turned on and a predetermined series of processes is repeatedly executed, the irregular pushing priority information creation process is executed, and the normal process is periodically interrupted. In the timer interruption process (see FIG. 13) in which a predetermined series of processes is executed, the process of accelerating the reels 32L, 32M, and 32R is executed. For example, assuming a configuration in which processing for accelerating the reels 32L, 32M, and 32R is performed in normal processing, and irregular push priority information creation processing is performed in timer interrupt processing, the next driving is performed after one driving signal is given. It is necessary to finish the irregular pressing priority information generation process by the timing of giving a signal, and the processing time allocated to the priority information generation process is shortened. Also, in such a case, if it takes a long time for the priority pushing priority information creation process, it is assumed that the next timer interrupt process will start in the situation where the previous timer interrupt process has not ended, in this case, Timer interrupt processing is performed continuously several times. If it does so, the timing which gives a drive signal will be overdue, and the behavior of reel 32L, 32M, 32R will become unstable. On the other hand, according to the configuration of the present embodiment, these problems do not occur.

  Further, the processing time of the irregular pushing priority information creation processing is set so as to end within the acceleration period from the start of the acceleration processing of the reels 32L, 32M, and 32R to the steady rotation. For example, assuming that the processing time exceeds the acceleration period, it is necessary to ensure a long period from when the acceleration process is started until the stop command becomes valid. In such a case, for the player, since the period from when the start lever 41 is operated to when the stop operation is validated becomes longer, the game may be extended. On the other hand, according to the configuration of the present embodiment, such inconvenience does not occur.

  In each priority order information creation process, each judgment value calculation information is only created by storing “0” or “1” in each bit of each judgment value calculation information buffer B. The calculation and the calculation of each sliding number for each symbol number are performed after a corresponding reel stop command is issued. For example, in the priority order information creation process, not only each judgment value calculation information is created, but each priority order judgment value is calculated and each number of threads is calculated for each symbol number. In this case, however, the processing time required for the priority information creation process becomes extremely long, and accordingly, the time from when one stop command is issued until the next stop command becomes valid is extremely long. There is a risk. On the other hand, according to this configuration, it is possible to shorten the processing time required for the priority order information creation process as much as possible, and to create each judgment value calculation information before the corresponding reel stop command is generated. In the above configuration, it is possible to reduce the time lag from when one reel stops to when the next stop command becomes valid.

  In particular, since the priority order judgment value is calculated after the corresponding reel stop command is generated, the reaching symbol number and the symbols within the range from the reaching symbol number to the maximum number of slips (four symbols) are included. It is only necessary to calculate each priority order determination value for the number, and it is not necessary to calculate priority order determination values for all symbol numbers. Thereby, it is possible to shorten the processing time for the calculation of the priority order determination value.

  The RAM 106 of the main control device 101 is provided with a judgment value calculation information buffer B that has a one-to-one correspondence with the symbol numbers of the reels 32L, 32M, and 32R. In the judgment value calculation information creation process (see FIG. 29). “0” or “1” is stored in each bit of each determination value calculation information buffer B. Then, the priority order determination value is calculated based on the determination value calculation information buffer B in which “0” or “1” is stored in each bit. That is, by storing “0” or “1” in the determination value calculation information buffer B in the determination value calculation information generation process, the determination value calculation information is generated, and the priority determination value is calculated based on the determination value calculation information. Thereby, it is possible to satisfactorily perform creation of determination value calculation information and calculation of priority determination values in consideration of various situations.

  Each determination value calculation information buffer B is configured in units of 2 bytes. Thereby, each priority order judgment value can be calculated by a predetermined specific process, and the processing configuration can be simplified. In addition, the processing load can be reduced as compared with the configuration in which the priority order is determined in bit units.

  An unfair prize determination of the determination value calculation information buffer B corresponding to a symbol number that will cause an illegal prize when an illegal prize determination bit is assigned to each judgment value calculation information buffer B and actually stopped at a specified position. “0” is stored in the bit, and “1” is stored in the unfair winning determination bit of the determination value calculation information buffer B corresponding to the symbol number in which no unfair winning occurs. As a result, the priority determination value of the symbol number in which the unfair winning is generated becomes smaller than the priority determination value of the symbol number in which the unfair winning does not occur, and the occurrence of the unfair winning can be avoided.

  In particular, an unfavorable winning determination bit is assigned to the most significant bit in each determination value calculation information buffer B, and the higher the bit is stored in each determination value calculation information buffer B, the higher the priority order determination. Increased the value. This makes it possible to minimize the priority order determination value of the symbol number at which an unfair winning occurs, and to reliably prevent the unfair winning from occurring.

  In the unfair winning determination bit, “1” is stored in the initial state. As a result, in the determination value calculation information creation process, it is only necessary to clear the illegal prize determination bit of the symbol number where the illegal prize is generated with respect to the illegal prize determination bit. Since there are fewer cases where it is determined that an unreasonable prize will occur than when it is determined that no unreasonable prize will occur, storing “1” in the initial state will cause an unreasonable prize in the determination value calculation information creation process. The processing time related to the determination bit can be shortened.

  In the winning determination process (see FIG. 35) of the determination value calculation information creation process, the process related to the unfair winning determination bit is executed at an early stage, and the subsequent winning determining process is executed for the symbol number determined that the illegal winning occurs. I tried not to. Thereby, in the determination value calculation information creation processing, it is possible to shorten the processing time related to the unfair winning determination bit.

  Corresponding to a symbol number that causes a kicking eye (for example, reach eye in BB non-winning situation) to appear when a kicking judgment bit is assigned to each judgment value calculation information buffer B and actually stopped at a specified position “0” is stored in the kick determination bit of the determination value calculation information buffer B, and “1” is stored in the kick determination bit of the determination value calculation information buffer B corresponding to the symbol number where the kicked eye does not appear. did. Thereby, the priority determination value of the symbol number where the kicked eye appears is smaller than the priority determination value of the symbol number where the kicked eye does not appear, and the appearance of the kicked eye can be avoided.

  In particular, in the slot machine 10, the middle line L2 is set as a sub-line not related to winning, and as a reach, the symbol or symbol combination corresponding to the winning combination is stopped on the middle line L2. In this case, if the symbol or the combination of symbols corresponding to the role on the middle line L2 stops in the BB non-winning situation, it is not in the BB winning situation and is used on the combination line visible from the display windows 26L, 26M, 26R. The player may misunderstand that a benefit such as a payout of medals is not provided even though the symbol or symbol combination corresponding to is stopped. On the other hand, since the kick determination bit is assigned to the determination value calculation information buffer B and the stop outcome is avoided in the BB non-winning situation, the occurrence of the misunderstanding can be suppressed.

  In the kick determination bit, “1” is stored in the initial state. Thereby, in the determination value calculation information creation process, the kick determination bit of the symbol number where the kick eye appears may be cleared with respect to the kick determination bit. Since there are fewer cases where it is determined that a kicked eye appears than when it is determined that a kicked eye does not appear, storing “1” in the initial state makes it possible to perform a kicking determination in the determination value calculation information creation process. The processing time related to bits can be shortened.

  An incorrect winning determination bit is assigned to each determination value calculation information buffer B and a kick determination bit is assigned. Thereby, it is possible to make a difference between the priority determination value of the symbol number that causes an unfair win and the priority determination value of the symbol number that causes a kick eye to appear.

  In particular, assigning an unfairly winning determination bit to the higher kicking determination bit and storing “1” in these determination bits in the initial state to deal with a case where an illegal winning occurs or a kicking eye appears. Since the determination bit is cleared, the priority determination value of the symbol number at which the kicked eye appears can be made larger than the priority determination value of the symbol number at which the unfair winning occurs. Thereby, when either the occurrence of an unfair winning prize or the appearance of a kicked eye cannot be avoided, the appearance of the kicked eye can be prioritized. Therefore, it is possible to reliably prevent an unfair prize from occurring.

  In the winning determination process of the determination value calculation information creation process, the processing related to the unfair winning determination bit and the kick determining bit is performed on the reels for which no stop command has been issued, except to avoid the illegal winning of the cherry role or the kicking eye related to the cherry role. It was made to execute in one case. Accordingly, it is possible to shorten the processing time relating to the unfair winning determination bit and the kick determination bit in each determination value calculation information creation processing, and it is possible to suppress the monotonization of the stop appearance. In other words, in a situation where there are a plurality of reels for which no stop command has been issued, in order to create determination value calculation information for all the symbol numbers of these reels, processing for the unfair winning determination bit and kick determination bit is executed. This leads to an increase in length. In addition, when the process related to the unfair winning determination bit and the kick determination bit is executed in the above situation, it is avoided that two symbols corresponding to the winning combination not on the active line are lined up, and the stopping appearance is significantly limited. Because it will end up.

  In addition, when the processing related to the unfair winning determination bit and the kicking determination bit is avoided in the case of avoiding the unreasonable winning of the cherry role or the kicking eye related to the cherry role, a “cherry” pattern that forms the cherry role winning is added. Executed only for reels. Thereby, in each determination value calculation information creation process, it is possible to shorten the processing time relating to the unfair winning determination bit and the kick determination bit.

  In the processing related to the unfair winning determination bit and the kicking determination bit, the symbol correspondence information and the mask information are used in determining whether or not it corresponds to the unfair winning prize and determining whether or not it corresponds to the kicking eye. did. Among these, the symbol correspondence information is used in the process related to the winning combination bit and also used in the payout determination process of the reel stop process (see FIG. 23). In this way, in the configuration in which each of these processes is performed by performing processing related to the unfair winning determination bit and the kick determination bit using general-purpose information that is also used in other processes, each reel 32L, 32M , 32R can be stored in advance, and the amount of data stored in advance can be reduced. Further, the mask information is provided in correspondence with the gaming state and the gaming situation. As a result, in the configuration in which the amount of data is reduced, it is possible to perform processing related to the unfair winning determination bit and the kick determination bit in correspondence with the gaming state and the gaming situation.

  A winning combination bit is assigned to each determination value calculation information buffer B, and when it is actually stopped at a specified position, a winning is generated or a possibility of winning is determined in the determination value calculation information buffer B corresponding to the symbol number. “1” is stored in the winning combination bit. As a result, information on whether or not a winning has occurred is reflected in the priority order judgment value, and the process for grasping the winning combination after the stop command is generated and the symbol corresponding to the winning combination is stopped on the active line to win There is no need to perform a separate process for establishing the above. In other words, in the process of stopping the reel corresponding to the stop command, it is only necessary to compare the priority order judgment value regardless of the result of the lottery process, and the winning combination is established by stopping the symbol corresponding to the winning combination on the active line. Even if it is necessary to make it stop, the stop symbol number can be calculated in a relatively short time.

  In each determination value calculation information buffer B, the winning combination bit is assigned to the most significant bit excluding the unfair winning determination bit, and “1” is stored in the higher-order bits in each determination value calculation information buffer B. The priority judgment value was made larger as it was. Thereby, the priority determination value corresponding to the symbol number that causes a winning or a possibility of winning can be increased with respect to other symbol numbers. Therefore, in the stop control of the reels 32L, 32M, and 32R in the slot machine 10, the establishment of the winning is certainly prioritized and the player's profit is secured.

  In the winning combination bit, a bit is individually assigned to each of the replay, the BB combination, and the small combination. Accordingly, the priority determination value of the symbol number that causes the re-game winning or causes the possibility of winning, the priority determination value of the symbol number that causes the BB winning or causes the possibility of winning, and the small role winning Control of the reels 32L, 32M, and 32R corresponding to each winning combination in a situation where a plurality of winning combinations are simultaneously won in the situation where the priority order judgment values of the symbol numbers that cause the winning or the possibility of winning are different. It can be performed.

  Corresponds to the number of symbols to be paid out for symbol numbers that cause a medal payout or a medal payout possibility when an acquisition number bit is assigned to each judgment value calculation information buffer B and actually stopped at a specified position. The stored information is stored in the acquired number of bits. Thereby, when a plurality of small combinations are won at the same time, it is possible to increase the priority number judgment value of the symbol number that causes the winning of the small combination with a large number of payouts or causes the possibility of the winning. Therefore, the winning of a small role with a large number of payouts is given priority and the player's profit is secured. Incidentally, the information corresponding to the payout number is essential information in the slot machine 10 for executing the payout of medals. By storing the information corresponding to the payout number in the acquired number bit, the main controller It is possible to reduce the amount of data stored in advance in the ROM 105 of 101.

  In addition, the acquired number of bits corresponds to each time a medal payout occurrence or a medal payout possibility is detected while searching for each active line in the winning determination process (see FIG. 35). Added information on the number of payouts. As a result, for example, when a winning combination is won, it is possible to calculate the stop symbol number so that there is a possibility that a winning will be established on a plurality of active lines. Therefore, it is possible to reduce the chances of missing a prize that is not established despite winning the lottery, and it is possible to secure the player's superiority.

  On the other hand, in the winning determination process in the irregular pushing priority information creation process (see FIG. 51), even if the possibility of winning is detected for the same winning combination while searching for each active line, the number of payouts The information of was not added. Even in such a case, assuming that the information on the number of payouts is added, the acquired number of bits is assigned higher than the priority line bits in each determination value calculation information buffer B. For example, The priority order judgment value of the symbol number that the symbol corresponding to the winning combination will stop at the position where the effective line overlaps becomes large, and the priority line is substantially limited to the effective line passing through the position where the effective line overlaps Will be done. On the other hand, according to the configuration of the present embodiment, the occurrence of such inconvenience can be suppressed.

  When the first priority line bit is assigned to each judgment value calculation information buffer B and the symbol number corresponding to the winning combination is stopped on the priority line when actually stopped at the specified position, “1” is stored in the first priority line bit of the determination calculation information buffer B. As a result, information on whether or not the symbol corresponding to the winning combination stops on the priority line can be reflected in the priority judgment value, and the process for grasping the set priority line and its priority There is no need to separately perform processing for stopping the symbol corresponding to the winning combination on the line after the stop command is generated. In other words, in the process of stopping the reel corresponding to the stop command, it is only necessary to compare the priority order determination values regardless of the priority line, and the stop symbol number is calculated in a relatively short time regardless of the setting state of the priority line. be able to.

  A pull-in bit is assigned to each decision value calculation information buffer B to allow appearance of reach eyes in the BB winning situation. In other words, the priority determination value is calculated not only for the symbol number that establishes a winning or the symbol number that generates an unfair winning prize, but also for the symbol number that does not generate any of them, the priority determining value is calculated, Each of these symbol numbers has a difference in the priority determination value. Therefore, it is possible to diversify the stop appearance. In addition, by reflecting the information of the pull-in bit for each judgment value calculation information, it is not necessary to separately perform a process for causing reach eyes to appear after the stop command is generated, and the stop symbol number can be set in a relatively short time. Can be calculated.

  In addition, even if no winning combination is won in the lottery process, the drawn bit information composite value is stored in the drawn bits of each determination value calculation information buffer B. Thereby, it becomes possible to diversify the stop appearances under such circumstances, and to suppress the monotonization of the game. The pull-in bit information composite value is calculated based on a pull-in bit table stored in advance in the ROM 105 of the main controller 101. By adopting such a configuration, it is possible to make the stop line desired by the designer who designs the slot machine 10 appear.

  In the configuration in which the pull-in bit is allocated to each determination value calculation information buffer B, the second priority line bit is further allocated to each determination value calculation information buffer B. As a result, it is not necessary to prepare a pull-in bit table corresponding to each of the effective lines L1, L3, L4, and L5, and the pull-in in the ROM 105 can be performed while allowing a stop line corresponding to the priority line to appear. It is possible to reduce the amount of data related to the bit table.

  A pull-in bit table is not prepared for situations where a winning combination is won. This makes it possible to reduce the amount of data related to the pull-in bit table in the ROM 105.

(Second Embodiment)
Next, a description will be given of another embodiment in which the combination of the symbols arranged on the reels 32L, 32M, and 32R is different from the symbols that are awarded, and all the combination lines L1 to L5 are set as valid lines. To do. The description of the same configuration as that of the first embodiment is basically omitted.

  FIG. 60 is a diagram showing a symbol arrangement of the left reel 32L, the middle reel 32M, and the right reel 32R. FIG. 61 shows a correspondence relationship between a combination of symbols for winning and a privilege given when winning FIG.

  In addition to the above-mentioned watermelon prize, bell prize, and cherry prize, the small prize winning in which medals are paid out includes the first small prize winning, the second small prize winning, and the third small prize winning. When stopped alongside the “Bell” symbol, “Bell” symbol, and “Red 7” symbol from the left on the active line, 10 medals will be paid out as the first small role prize, and the “Bell” symbol from the left on the active line , “Bell” symbol, “White 7” symbol, when stopped alongside, the 10th medal payout as the second small role winning, “Bell” symbol, “Bell” symbol, “Bar” symbol from the left on the active line When stopped in parallel, 10 medals are paid out as a third small role winning.

  There are three types of BB wins, a first BB win, a second BB win, and a third BB win, as the state transfer wins in which the game state shifts. If you stop alongside the “Red 7” symbol, “Red 7” symbol, and “Red 7” symbol from the left on the active line, the first BB prize will be established, and “Red 7” symbol, “Red” from the left on the active line. When stopped alongside the “7” symbol and “White 7” symbol, the 2nd BB win is established, and when stopped alongside the “Red 7” symbol, “Red 7” symbol, and “Youth” symbol from the left on the active line The third BB prize is established. When any of the first to third BB winnings is established, the gaming state shifts to a BB state that is a special gaming state. However, no medals are paid out regardless of which of these BB winnings is established.

  As a prize to which a privilege other than medal payout or game state transition is given, there is a re-game prize. When the “replay” symbols on the reels 32L, 32M, and 32R are stopped on the active line, the player does not pay out medals or change the gaming state as a re-game winning prize, but the player does not own the medals owned. It is possible to play the next game without reducing and without inserting medals.

  As other winnings, there is a JAC winning that is awarded only when the gaming state is a regular bonus state (hereinafter referred to as “RB state”) described later. In the RB state, when the “replay” symbol, “replay” symbol, and “bell” symbol are stopped from the left on the active line, 15 medals are paid out as a JAC prize.

  Thus, in the present embodiment, 11 types of combinations are set when all game states are combined. For this reason, in the present embodiment, the first symbol correspondence information and the like that are used when performing the determination relating to the combination information and winning are composed of 2 bytes.

  Next, differences between the control processes executed by the CPU 102 of the main control apparatus 101 and the first embodiment will be described. In the present embodiment, processing unique to the correction processing is executed.

  In the winning determination process (see FIG. 35), if the target reel is not the left reel 32L, a negative determination is made in step S1803, and a correction process is executed in step S1804.

  In the correction process, as shown in the flowchart of FIG. 52, it is determined in step S2801 whether the left reel 32L has already stopped. If the left reel 32L is stopped, the present process is terminated without executing the correction process. If the left reel 32L is not stopped, that is, if none of the reels 32L, 32M, and 32R is stopped, or if the other reels 32M and 32R are stopped before the left reel 32L, the process proceeds to step S2802. It is determined whether or not line mask information is specified. The ROM 105 in this embodiment stores line mask designation information set for irregular pressing, and the line mask designation information is set according to the gaming situation of the slot machine 10, and It is set corresponding to each combination in each game situation. More specifically, in the line mask designation information corresponding to the bell role when the game situation is the BB winning status (situation where one of the first to third BB roles is won), the designation of the line mask information is included. Line mask information is not specified in the line mask designation information corresponding to the other combination in the case of the BB winning situation and the other combination in the case of other gaming situations. Information indicating that is set.

  In the mask information storage area 105h of the ROM 105, general-purpose line mask information, upper line mask information, middle line mask information, lower line mask information, lower right line mask information, and upper right line as line mask information. Line mask information is stored. That is, the mask information storage area 105h of the ROM 105 stores line mask information that does not correspond to the combination lines and line mask information that corresponds to the combination lines L1 to L5. As shown in FIG. 62, the line mask information is composed of 2 bytes each corresponding to the first establishment determination information in the establishment determination information. In the upper line mask information and the lower right line mask information, “1” is stored in the cherry role combination information and “1” is stored in the bell role combination information. “0” and “1” are stored in other bits. That is, the line mask information is “1111111110011111”, respectively. In other line mask information including general-purpose line mask information, “0” is stored in the bit storing “1” and “1” is stored in the other bits in the role correspondence information of the cherry role. That is, the line mask information is “1111111110111111”, respectively.

  If it is determined in step S2802 that the line mask information is not specified, general-purpose line mask information is acquired in step S2803, and the general-purpose line mask information is stored in a line mask information register provided in the CPU 102. On the other hand, if it is determined that the line mask information is designated, line mask information corresponding to the current search line is acquired in step S2805, and the general-purpose line mask information is stored in the line mask information register provided in the CPU 102. Remember me.

  After the line mask information is acquired in step S2803 or step S2805, in step S2804, the first establishment determination information is corrected. Specifically, the acquired line mask information and the first establishment determination information are ANDed, and the result is stored in the establishment determination buffer 169 of the RAM 106 as new first establishment determination information.

  By executing such processing, the value of the bit storing “1” in the cherry role combination information is changed to “0” in each bit of the first establishment determination information. The reason for making this change is as described in the first embodiment. In addition, when the BB winning status is won and the current search line is the upper line L1 or the lower right line L4, in addition to the bit storing “1” in the cherry role combination information. The value of the bit in which “1” is stored in the role combination information of the bell role is also changed to “0”.

  When the correction process is executed in a situation where the left reel 32L is not stopped, the search line is selected when the bell role is won in the BB winning situation and the current search line is the upper line L1 or the lower right line L4. Even if the “bell” symbol is stopped or two “bell” symbols are stopped side by side, a negative determination is made in step S1813 of the winning determination process. That is, in such a case, even if there is a possibility that a winning corresponding to the winning combination is established, it is determined that there is no possibility that a winning is achieved. Then, the process proceeds to step S1825 without performing the processes of steps S1814 to S1824, that is, without performing the process of storing information in the winning combination bit or the acquired number of bits. This is because the value of the bit storing “1” in the combination information corresponding to the bell role among the bits of the first establishment determination information is changed to “0” by the correction process, so that the winning symbol in step S1812 This is because “0000000000000000000” is stored as the success / failure determination information in the establishment determination process.

  When the BB winning status is won and the current search line is the upper line L1 or the lower right line L4, “1” is stored in the bell role corresponding information in each bit of the first establishment determination information. The value of the bit being changed is changed to “0” for the following reason.

  On the left reel 32L, “cherry” symbols are arranged at positions 4 and 16, and “bell” symbols are located at positions 6 and 18 separated by 1 symbol upstream from the “cherry” symbols. Is arranged. For this reason, in a situation where the player has won the bell role, for example, the “bell” symbol is stopped before the middle reel 32M is stopped or the left reel 32L is stopped so that the “bell” symbol stops in the upper stage at the first stop. When the middle reel 32M and the right reel 32R are stopped so as to line up with the upper line L1 or the lower right line L4, the player operates the left stop switch 42 at a timing at which the player can establish a bell winning. Nevertheless, there may be a chance that the Bell prize will not be established. As a specific example, the left stop switch 42 at the timing when the “bell” symbol of the middle reel 32M and the right reel 32R stops side by side on the upper line L1, and the second “replay” symbol of the left reel 32L reaches the lower stage. The situation where was operated will be described. In such a situation, if the left reel 32L is slid by two symbols and then stopped, the 6th “bell” symbol of the left reel 32L stops at the upper line L1 and a bell win is established. Since the 32L No. 4 “Cherry” symbol stops at the lower stage, a cherry winning that is not won in the lottery of the winning combination will be established at the same time. Since it is necessary to avoid an unfair winning prize, if the left reel 32L is stopped with a number of slips other than two symbols, the “bell” symbol of the left reel 32L cannot be stopped on the upper line L1, and the bell You will miss the prize. This leads to a player's disadvantage and needs to be avoided. On the other hand, when the correction process is performed, the winning combination bit of the determination value calculation information buffer B corresponding to the symbol number at which the “bell” symbol stops on the upper line L1 or the lower right line L4. Since no information is stored in the acquired number of bits, the symbol number priority determination value may be made smaller than the symbol number priority determination value at which the “bell” symbol stops at a position other than the combination line. it can. As a result, the “bell” symbols can be stopped on the combination lines L2, L3, and L5 other than the upper line L1 and the lower right line L4, and the player can be prevented from being disadvantaged.

  As in this embodiment, line mask information corresponding to each combination line L1 to L5 is stored in the mask information storage area 105h of the ROM 105, and the line mask information is used in a situation where a predetermined combination is won. With the configuration in which the correction process is executed, it is possible to reduce the design load when designing the slot machine 10 and to suppress an increase in the number of debugging steps.

  Here, the case where the correction process is not performed will be considered as an example in which the bell role is won in the third BB winning situation.

  On the right reel 32R, the “BB” symbol which is the third BB symbol is arranged at the 14th position, and at the 12th and 16th positions separated from the “bar” symbol by 1 symbol upstream and downstream. "Bell" design is arranged. In such a case, when the right stop switch 44 is first stopped at the timing when the symbol attached to any of Nos. 8 to 12 reaches the lower stage, the “bar” symbol stops at the upper stage and the “bell” "No. 12 priority ranking determination value that will cause the symbol to stop in the lower stage is the largest, so the" No. 12 "symbol in the No. 12 position stops in the lower stage. In addition, when the right stop switch 44 is first stopped at the timing when the symbol attached to any of Nos. 13 to 14 reaches the lower stage, the “bell” symbol stops at the upper stage and “bar” Since the 14th priority order determination value that causes the symbol to stop at the lower stage is the largest, the 14th “bar” symbol stops at the lower stage. In other words, if the right stop switch 44 is stopped for the first time at the timing at which the “Bar” symbol can be stopped on the active line in the third BB winning situation, the “Bell” symbol is There are cases of stopping at the upper stage and cases of stopping at the upper stage.

  First, consider the case where the 12th “bell” symbol stops at the bottom and the 14th “bar” symbol stops at the top.

  In such a case, it is necessary to change the priority line to an effective line other than the right-down line L4 in the priority line change process (see FIG. 47). When the priority line is the lower right line L4, the priority order judgment value of the symbol number that causes the “bell” symbol to stop in the middle stage in the middle reel 32M is the symbol number that causes the “bell” symbol to stop in the lower stage. This is because “1” is stored in the priority line bit as compared to the priority order determination value of “1”.

  In the priority line change processing, if the “bar” symbol or the “bell” symbol is stopped on the priority line indicated by the information stored in the priority line buffer 156 in the irregular pushing priority order information creation processing, the priority line is changed. If the respective symbols are not stopped on the priority line without being changed, the priority line is changed to an active line in which the “bar” symbol or the “bell” symbol is stopped. Therefore, the ROM 105 assumes a situation in which the 12th “bell” symbol stops in the lower row and the 14th “bar” symbol stops in the upper row, and the priority line buffer is generated in the irregular pushing priority information creation processing. It is necessary to store information indicating the middle line L2 or the lower line L3 as information to be stored in 156. When the information indicating the upper line L1 is stored, the priority line is not changed because the “bar” symbol is stopped in the upper stage. This is because, in the middle reel 32M, the symbol number priority determination value that causes the “bell” symbol to stop in the middle stage and the symbol number priority determination value that causes the “bell” symbol to stop in the lower stage are: In this configuration in which the minimum number of slips is acquired when the priority order determination values are equal, when the middle stop switch 42 is operated for the second stop, the “bell” symbol of the middle reel 32M stops in the middle stage, This is because the “bell” symbols stop side by side on the right-down line L4. Even when information indicating the right-down line L4 or the right-up line L5 is stored, the priority line is not changed because the “bar” symbol or the “bell” symbol is stopped on the priority line. In such a case, in the middle reel 32M, the priority determination value of the symbol number that causes the “bell” symbol to stop in the middle stage is compared with the priority determination value of the symbol number that causes the “bell” symbol to stop in the lower stage. As a result, “1” is stored in the priority line bit. Therefore, when the middle stop switch 42 is subjected to the second stop operation, the “bell” symbols are stopped side by side on the lower right line L4.

  When the information indicating the lower line L3 is stored, the priority line is not changed because the “bell” symbol is stopped at the lower stage, and the “bell” symbol is stopped at the lower stage in the middle reel 32M. The priority determination value of the symbol number becomes larger as “1” is stored in the priority line bit than the priority determination value of the symbol number that causes the “bell” symbol to stop in the middle stage. . Therefore, when the middle stop switch 42 is subjected to the second stop operation, the “bell” symbols are stopped side by side on the lower line L3, so that it is possible to prevent the occurrence of missing due to avoiding an unfair winning prize.

  When information indicating the middle line L2 is stored, the priority line is changed in the priority line change process. Here, the search is performed in the order of the upper line L1, the middle line L2, the lower line L3, the lower right line L4, and the upper right line L5, and when it is determined that there is a winning in an effective line other than the priority line (YES in step S2406) In this configuration in which the rewrite line is updated when S2407 is NO), since the “bar” symbol is stopped at the upper stage, the priority line is changed to the right-up line L5 as the final search line. As in the case where the information indicating the right-up line L5 is stored in the ROM 105 described above, when the second stop operation is performed on the middle stop switch 42, the “bell” symbols are stopped side by side on the right-down line L4. Resulting in. For this reason, when the information indicating the middle line L2 is stored, it is necessary to change the search order of the effective lines from the above order, and the search order is set so that the final search line becomes the lower line L3. There must be.

  Next, consider the case where the 14th “bar” symbol stops at the bottom and the 16th “bell” symbol stops at the top.

  In such a case, it is necessary to change the priority line to an effective line other than the upper line L1 in the priority line change process (see FIG. 47). When the priority line is the upper line L1, the priority order judgment value of the symbol number that causes the “bell” symbol to stop in the upper stage in the middle reel 32M is the symbol number that causes the “bell” symbol to stop in the middle stage. This is because “1” is stored in the priority line bit as compared with the priority determination value, and becomes larger.

  In the ROM 105, assuming that the 14th “bar” symbol stops in the lower row and the 16th “bell” symbol stops in the upper row, the priority line buffer 156 is stored in the irregular push priority information creation processing. It is necessary to store information indicating valid lines other than the upper line L1 and the lower line L3 as information to be stored. When information indicating the lower line L3 is stored, the priority line is not changed because the “bar” symbol is stopped in the lower stage. This is because, in the middle reel 32M, the symbol number priority determination value that causes the “bell” symbol to stop in the upper stage and the symbol number priority determination value that causes the “bell” symbol to stop in the middle stage are: In the present configuration in which the minimum number of slips is acquired when the priority order determination values are equal, when the middle stop switch 42 is operated for the second stop, the “bell” symbol of the middle reel 32M stops in the upper stage, This is because the “bell” symbols stop side by side on the upper line L1.

  When information indicating the middle line L2 is stored, the priority line is changed in the priority line change process. Here, the search is performed in the order of the upper line L1, the middle line L2, the lower line L3, the lower right line L4, and the upper right line L5, and when it is determined that there is a winning in an effective line other than the priority line (YES in step S2406) In this configuration in which the rewrite line is updated when S2407 is NO), since the “bell” symbol is stopped at the upper stage, the priority line is changed to the right-up line L5 as the final search line. Therefore, it is possible to prevent a failure due to avoiding an unfair winning prize.

  When information indicating the right-down line L4 or the right-up line L5 is stored, the priority line is not changed because the “bar” symbol or the “bell” symbol is stopped on the priority line. In such a case, in the middle reel 32M, the priority determination value of the symbol number that causes the “bell” symbol to stop in the middle stage is compared with the priority determination value of the symbol number that causes the “bell” symbol to stop in the upper stage. As a result, “1” is stored in the priority line bit. Therefore, when the middle stop switch 42 is operated for the second stop, the “bell” symbols are stopped side by side on the right-up line L5, so that it is possible to prevent overshooting based on avoiding an unfair winning prize.

  Here, since whether the 14th “bar” symbol of the right reel 32R stops in the upper stage or the lower stage depends on the operation timing of the right stop switch 42, in order to avoid missing out based on avoiding an unfair winning prize, Both the case where the “bar” symbol stops at the upper stage and the case where the “bar” symbol stops at the lower stage must be preliminarily stored in the ROM 105 in the information indicating the middle line L2. In addition to this, the search order of the effective lines is set so that the final search line is the lower line L3, or the search order is set so as to be the search order when winning the bell role at least in the third BB winning situation. The determined search line table needs to be stored in the ROM 105 separately.

  As described above, in the configuration in which the correction process is not performed, an unfair winning prize is assumed assuming the relationship between the priority line stored in advance in the ROM 105 and the priority line set as a result of executing the priority line change process as described above. It is necessary to set the effective line search order to prevent the occurrence of miss-out due to avoidance, or to determine the priority line stored in the ROM 105 in advance, which increases the design load and the debugging man-hours. Will increase. This becomes more conspicuous in a configuration in which there are a plurality of winning situations in which a combination based on avoiding an unfair winning prize can occur.

  On the other hand, in the configuration for performing the correction process as in the present embodiment, the ROM 105 stores the line mask information corresponding to the effective line that may be missed based on avoiding an unfair prize winning, thereby preventing the miss out based on avoiding an unfair prize winning. It is possible to make a difference between the priority order information of the symbol numbers that can be generated and the priority order information of the symbol numbers that are not missed due to avoiding an unfair winning prize. The line mask information to be stored in the ROM 105 can be easily confirmed by confirming the symbol arrangement of the left reel 32L, more specifically, the symbols arranged at positions within two symbols upstream and downstream from the “cherry” symbol. I can grasp it. Therefore, it is possible to reduce the design load when designing the slot machine 10 and to suppress an increase in the number of debugging steps.

  By executing the correction process in the winning determination process, the “Bell” symbol is stopped on the search line when the BB winning status is won and the current search line is the upper line L1 or the lower right line L4. Even if two “Bell” symbols are stopped side by side, it can be determined that there is no possibility of winning. As a result, it is possible to omit the process of storing information in the winning combination bits and the acquired number of bits for symbol numbers that may be missed based on avoiding unfair winnings, and shorten the processing time required to create judgment value calculation information Can be achieved.

  It is possible to suppress a reduction in the degree of freedom of the symbol arrangement and the setting of the effective line in each reel 32L, 32M, 32R. Certainly, as in the first embodiment, the middle line L2 is a non-effective line that is not set as an effective line, and the position adjacent to the "cherry" symbol and the upstream or downstream side in the left reel 32L If the “Bell” symbol is arranged in this way, it is possible to prevent the occurrence of missing due to avoiding an unfair winning prize without executing correction processing as in the present embodiment. However, for example, in the case where the symbol arrangement of the first embodiment is applied and the middle line L2 is set as an effective line, overshooting based on avoiding an unfair winning prize may occur, and the left reel 32L This is because it may be necessary to change the symbol arrangement or the like.

(Third embodiment)
In the present embodiment, the configuration of the determination value calculation information buffer B is different from that in the first embodiment (see FIG. 28b), and further, a winning is selected in accordance with the configuration of the determination value calculation information buffer B. The processing configuration of the determination process is different. Therefore, these different configurations will be described below. The description of the same configuration as that of the first embodiment is basically omitted.

  First, the configuration of the determination value calculation information buffer B will be described with reference to FIG.

  The decision value calculation information buffer B of the present embodiment has a first buffer B1 and a second buffer B2 as in the first embodiment, and is composed of a total of 2 bytes of 1 byte each. ing. However, some of the functions assigned to each bit of the first buffer B1 are different from those in the first embodiment.

  Specifically, the highest 7th bit in the first buffer B1 has a function as an unreasonable winning determination bit for storing unreasonable winning determination information, and the sixth bit is for storing replay information. It has a function as a replay bit, the fifth bit has a function as a replay priority line bit for storing replay priority line information, and the fourth bit is for storing BB combination information It has a function as a BB combination bit, and the third to 0th bits have a function as an acquired number bit for storing acquired number information.

  That is, in the determination value calculation information buffer B of this configuration, only the replay bit and the BB combination bit are set as the winning combination bit, and the small combination bit is not set. A replay priority line bit is assigned in place of the small combination bit. However, in the first embodiment, the small combination bit is allocated to a lower bit than the BB combination bit, but the replay priority line bit is allocated to a higher bit than the BB combination bit.

  By the way, even if it is a configuration that does not set the small role bit as described above, the winning number bit is set, so that the priority number judgment value of the symbol number that constitutes the small role winning is set to win any winning combination. It can be made larger than the priority order judgment value of the symbol number that is not configured. That is, in the symbol number constituting the winning of the small role, the obtained number information is stored in the obtained number bit of the determination value calculation information buffer B (“1” is stored in any of the bits constituting the acquired number bit). This is because the priority determination value can be made larger than the symbol number that does not constitute any winning combination.

  Next, the winning determination process of the present embodiment will be described with reference to the flowcharts of FIGS.

  In steps S3101 to S3104, the same processing as in steps S1801 to S1804 in the first embodiment is performed. Thereafter, in step S3105, it is determined whether or not the current search line is an effective line. If it is an effective line, the process proceeds to step S3106. If it is not an effective line, the process proceeds to step S3124 without performing the processes of steps S3107 to S3123. This is because the ineffective line is a line that is not related to winning, and it is not necessary to perform processing related to winning in steps S3107 to S3123.

  In steps S3106 to S3111, the same processing as in steps S1805 to S1810 in the first embodiment is performed. In steps S3112 to S3113, the same processing as in steps S1812 to S1813 in the first embodiment is performed. In the winning determination process of the present embodiment, the process of step S1811 and the processes of steps S1814 to S1815 in the first embodiment are not performed. In steps S3114 to S3115, the same processing as in steps S1816 to S1817 in the first embodiment is performed.

  Thereafter, in step S3116, the winning combination classification buffer 170 in the RAM 106 is referred to, and it is determined whether or not the winning classification is re-game information. If it is replay information, “1” is stored in the replay bit of the determination value calculation information buffer B in step S3117, and then the process proceeds to step S3120. If it is not replay information, the process proceeds to step S3118.

  In step S3118, the winning combination type buffer 170 is referred to and it is determined whether or not the winning type is BB combination information. If it is the BB combination information, “1” is stored in the BB combination bit of the determination value calculation information buffer B in step S3119, and then the process proceeds to step S3120. If it is not BB combination information, the process proceeds to step S3120 as it is.

  In step S 3120, it is determined whether or not the current search line matches the information on the priority line stored in the priority line buffer 156 of the RAM 106. If they do not match, the process proceeds to step S3124, and if they match, the process proceeds to step S3121.

  In step S3121, the winning combination classification buffer 170 is referred to and it is determined whether or not the winning combination is re-game information. If it is replay information, “1” is stored in the replay priority line bit of the determination value calculation information buffer B in step S3122, and then the process proceeds to step S3124. If it is not replay information, “1” is stored in the first priority line bit of the determination value calculation information buffer B in step S3123, and then the process proceeds to step S3124.

  In steps S3124 to S3132, the same processing as in steps S1825 to S1833 in the first embodiment is performed.

  As described above, the replay priority line bit is set between the replay bit and the BB combination bit in the first buffer B1 of the determination value calculation information buffer B, and further in steps S3121 to S3123 in the winning determination process. By executing the processing, regardless of the stop order or stop operation timing of the stop switches 42 to 44, the replay winning can be given the highest priority under the situation where the replay is won.

  That is, assuming that the replay priority line bit is not set as described above, when the replay is won in the BB win situation, the replay bit and the BB combination bit in the determination value calculation information buffer B The priority determination value of No. 16 in which “1” is stored in both and becomes larger than other symbol numbers. Therefore, when the middle reel 32M is stopped for the first time, the stop symbol number is likely to be set to No. 16, and the stop appearance shown in FIG. 66 (a) is likely to occur.

  When the left stop switch 42 is stopped at the timing when the arrival symbol number is 20 (other than this, 18th or 19th) in such a stoppage, as shown in FIGS. 66 (b) to 66 (f). Expected to stop. Of these stop events, the only stop event in which a re-game winning can be established is shown in FIG. 66 (d). However, in such a stop event, the third "" is displayed on the upper line L1 and the lower right line L4. The “Cherry” symbol stops and the prize goes wrong. In other words, the stop event in FIG. 66 (d) is avoided. Therefore, in this case, the replay is lost.

  On the other hand, the replay priority line bit is set as in the present embodiment, and the priority line at the time of irregular pressing in the replay win is set to the upper line L1 as in the first embodiment. For example, the “replay” symbol stops on the upper line L1 rather than the symbol number of 16 in which “1” is stored in both the replay bit and the BB combination bit. The number priority determination value can be increased. Therefore, the stop appearance shown in FIG. 66 (a) can be avoided, and the occurrence of replay failure can be prevented. The establishment of the replay is set to have a higher probability than other combinations, and on the premise that the replay is established with the set probability, the payout of medals for the number of inserted medals in the slot machine 10 The ratio of the number of sheets is set. In such a situation, if the re-game is missed, the actual rate will be different from the planned rate. Therefore, it is preferable to prevent the re-game from being missed as described above.

(Fourth embodiment)
Next, a description will be given of another embodiment in which the combination of the symbols arranged on the reels 32L, 32M, and 32R is different from the symbols that are awarded, and all the combination lines L1 to L5 are set as valid lines. To do. Since the basic configuration is the same as that of the third embodiment, description of the same configuration is basically omitted.

  FIG. 69 is a diagram showing a symbol arrangement of the left reel 32L, the middle reel 32M, and the right reel 32R, and FIG. 70 is a correspondence relationship between a winning combination of symbols and a privilege given when winning. FIG. 71 is a lottery table that is selected when three bets are placed in the normal gaming state of “setting 1”.

  Small prizes for which medals are paid out include cherry prizes, bell prizes, and watermelon prizes.

  There are three types of BB wins, a first BB win, a second BB win, and a third BB win, as the state transfer wins in which the game state shifts. If you stop alongside the “Red 7” symbol, “Red 7” symbol, and “Red 7” symbol from the left on the active line, the 1st BB win will be established, and the “Blue 7” symbol from the left on the active line, “Blue If you stop alongside the “7” symbol and “Blue 7” symbol, the 2nd BB prize will be established. 3BB winning is established.

  The re-game prizes to which the re-game privilege is given include the first re-game prize, the second re-game prize, the third re-game prize, the fourth re-game prize, and the fifth re-game prize. Five types are set. Specifically, when the “Replay” symbol, “Replay” symbol, and “Replay” symbol from the left on the active line are stopped along with the “Replay” symbol, the first replay prize is established, and “Bell” from the left on the active line. When the symbol, “Replay” symbol, and “Replay” symbol are stopped side by side, the second re-game winning prize is established, and “Youth” symbol, “Red 7” symbol, “White 7” symbol from the left on the active line If you stop side by side, the 3rd regame prize will be established, and if you stop alongside the "Youth" symbol, "Youth" symbol, and "White 7" symbol from the left on the active line, the 4th regame prize will be established. Thus, when the “Youth” symbol, “Blue 7” symbol, and “White 7” symbol are stopped from the left on the active line, the fifth replay prize is established.

  Thus, in this embodiment, 11 types of winning combinations are set. For this reason, in the present embodiment, the first symbol correspondence information and the like that are used when performing the determination relating to the combination information and winning are composed of 2 bytes. A specific example in which each piece of information is composed of 2 bytes has been described in the second embodiment, and will not be described.

  As shown in FIG. 71, 13 index values IV are set in the lottery table under the normal gaming state, and a lottery combination is set for each index value IV. That is, in the normal game state, in addition to the cherry, the bell, the watermelon, the first BB, the second BB, and the third BB, seven lottery combinations of the replay 1 to 7 groups are set. The replay 1-7 group is a lottery winning combination for any of the first to fifth replays.

  Specifically, when the replay 1 group is won, the combination information indicating the first replay is stored in the winning combination determination buffer 151. When the re-game 2 group is won, the combination information indicating the first re-game and the second re-game is stored in the winning combination determination buffer 151. When the replay 3 group is won, the role correspondence information indicating the first replay, the second regame, and the third regame is stored in the winning combination determination buffer 151. When the replay 4 group is won, the role correspondence information indicating the first replay, the second regame, and the fourth regame is stored in the winning combination determination buffer 151. When the replay 5 group is won, the combination information indicating the first replay, the second regame, the third regame, and the fourth regame is stored in the winning combination determination buffer 151. When the replay 6 group is won, the combination information indicating the first replay, the second regame, and the fifth regame is stored in the winning combination determination buffer 151. When the replay 7 group is won, the combination information indicating the first replay, the second replay, the third regame, the fourth regame, and the fifth regame is stored in the winning combination determination buffer 151. The In other words, the replay 1 group is a lottery that is won only for the first replay, and the replay 2-7 groups are the first regame and other replays, that is, a plurality of replays are won. It is a lottery role. In addition to the winning combination determination buffer 151, a lottery result storage buffer may be provided in the RAM 106 to store information indicating which lottery combination is won when a winning combination is won. For example, when the replay second group is won, information indicating the first replay and second regame is not stored, but information indicating that the replay second group is won (for example, an index value “ 5) ”is stored.

  In the present embodiment, when the replay 1 group is won, the first replay prize is established regardless of the operation order of the stop switches 42 to 44. On the other hand, when the other replay group is won, the first replay prize is established only when the stop switches 42 to 44 are operated in a predetermined operation order, and the operation is performed in the other operation order. In such a case, a re-game prize corresponding to a winning combination other than the first re-game is established.

  Specifically, when the replay 2 group is won, the first is only when the stop switches 42 to 44 are operated in the order of the left stop switch 42 → the middle stop switch 43 → the right stop switch 44. Re-play prize is established. When the replay 3 group is elected, the first replay prize is established only when the stop switches 42 to 44 are operated in the order of the left stop switch 42 → the right stop switch 44 → the middle stop switch 43. To do. If the replay 4 group is won, the first replay prize is established only when the stop switches 42 to 44 are operated in the order of the middle stop switch 43 → the left stop switch 42 → the right stop switch 44. To do. When the 5 replay groups are selected, the first replay prize is established only when the stop switches 42 to 44 are operated in the order of the middle stop switch 43 → the right stop switch 44 → the left stop switch 42. To do. When the 6 replay groups are selected, the first replay prize is established only when the stop switches 42 to 44 are operated in the order of the right stop switch 44 → the left stop switch 42 → the middle stop switch 43. To do. If the replay 7 group is selected, the first replay prize is established only when the stop switches 42 to 44 are operated in the order of the right stop switch 44 → the middle stop switch 43 → the left stop switch 42. To do.

  Here, as shown in FIG. 69, the “replay” symbols that form the first replay prize are set with a total symbol interval within the range of the maximum number of reels (4 symbols) in each reel 32L, 32M, 32R. Has been. Therefore, when the first regame is won, it is possible to perform stop control for establishing the first regame prize regardless of the operation timing and operation sequence of the stop switches 42 to 44. In other words, when one of the replay 2-7 groups is won, the stop control for establishing the first replay prize only when the stop switches 42-44 are operated in a predetermined operation order. When the stop switches 42 to 44 are operated in another operation order, it is necessary to perform stop control for establishing another regame prize while avoiding establishment of the first regame prize.

  Therefore, a specific configuration for realizing such stop control will be described below. In addition, since it is the same as that of the said 3rd Embodiment about the case where a lottery combination other than the replay 1-7 group is won, description is abbreviate | omitted fundamentally.

  First, information acquired when one of the replay 1 to 7 groups is won will be described with reference to FIGS. 72 and 73. FIG. 72 is a diagram showing various information acquired when the replay 1 group is won, and FIG. 73 is a diagram showing various information acquired when the replay 2 group is won.

  72 (a) and 73 (a) are diagrams showing the sliding table and the offset reference table number. In the slip table, the number of slips, priority lines, and lead-in bit offsets are set in a one-to-one correspondence with 21 symbol numbers. 72 (b) and 73 (b) are diagrams showing priority line information and lead-in bit offset information acquired in step S2702 (see FIG. 51) of the irregular pushing priority order information creation processing. 72 (c) and 73 (c) show the second stop and subsequent priority information creation processing S2205 (see FIG. 44) of the second stop processing when an irregular push is made, more specifically the second It is a figure which shows the information of the priority line acquired in drawing-in bit table acquisition process S1602 (refer FIG. 31) of the priority order information creation process after a stop, and information of drawing-in bit offset. Hereinafter, the information shown in (b) and (c) is collectively referred to as irregular pushing information.

  As shown in FIG. 72 (a), a pull-in bit offset “0” is set for all symbol numbers from 0 to 20, as shown in FIG. 72 (a). “0” is set as the offset reference table number corresponding to the replay 1 group. As for the irregular pushing information, as shown in FIGS. 72B and 72C, the pull-in bit offset “0” is set in any case. As described in the first embodiment, the offset reference table is a group of information for acquiring the pull-in bit table based on the pull-in bit offset that has already been acquired. Further, the pull-in bit information acquired using the pull-in bit table is for making a predetermined stoppage when no lottery is won in the lottery process or when a loss occurs. When the replay 1 group is won, only the first replay is won, and the first replay prize is established regardless of the operation sequence and operation timing of the stop switches 42 to 44. For this reason, all of the offset reference table numbers and the drawn-in bit offsets that are acquired when the replay 1 group is won are all set to “0”, that is, the drawn-in bit information is not acquired.

  On the other hand, as shown in FIG. 73A, a pull-in bit offset other than “0” is set for all symbol numbers 0 to 20 in the sliding table acquired when the replay 2 group is won. “3” is set as the offset reference table number corresponding to the replay 2 group. As for the irregular pushing information, as shown in FIGS. 73B and 73C, in each case, a pull-in bit offset other than “0” is set. When the replay 2 group is won, the first replay and the second replay are won, and the stop switches 42 to 44 are operated in the order of the left stop switch 42 → the middle stop switch 43 → the right stop switch 44. The first re-game winning is established only in the case, and the second re-game winning is established when operated in the other operation order. In other words, from the viewpoint of the first replay, if the stop switches 42 to 44 are not operated in the order of the left stop switch 42 → the middle stop switch 43 → the right stop switch 44, the overshoot will occur. Therefore, the offset reference table number and the pull-in bit offset acquired when winning the replay 2 group are all set to values other than “0” to acquire the pull-in bit information.

  Although not shown in the figure, the offset reference table number is also set to “3” for the slip table and irregular pushing information acquired when one of the replay 3 to 7 groups is won. A value other than “0” is set for all the pull-in bit offsets.

  Next, the offset reference table will be specifically described. FIG. 74 is an offset reference table that is referred to in the case of losing, and FIG. 75 is a case where an offset reference table with an offset reference table number “3”, that is, one of the replay 2 to 7 groups is won. It is an offset reference table to be referred to.

  As shown in FIG. 74, each offset bit offset is stored in the offset reference table that is referred to in the case of detachment, and a pull-in bit table number is assigned corresponding to each pull-in bit offset. Yes. More specifically, two pull-in bit table numbers from among a large number of pull-in bit table numbers (for example, 100) are assigned to each pull-in bit offset. In other words, it can be said that the offset reference table is provided with a first area and a second area corresponding to each pull-in bit offset, and the numbers of the pull-in bit table are stored in these areas. When the left reel 32L is stopped as the first stop, the number of the pull-in bit table in one area is for the middle reel 32M, and the number of the pull-in bit table in the other area is for the right reel 32R.

  In the case of winning a small role (Bell, Cherry, or Watermelon), the offset reference table that is referred to in the case of BB winning is also the same as the offset reference table in the case of losing, and each drawn bit offset The first area and the second area are provided in correspondence with each other, and the number of the pull-in bit table is stored in each area.

  On the other hand, as shown in FIG. 75 (a), in the offset reference table that is referred to when any of the replays 2 to 7 is won, there are a large number of drawn bit tables for each drawn bit offset. Of the numbers (for example, 100), four pull-in bit table numbers are assigned. In other words, as shown in FIG. 72 (b), the offset reference table that is referred to when one of the replays 2 to 7 is elected has the first area corresponding to each drawn bit offset. It can be said that the second area, the third area, and the fourth area are provided, and the numbers of the pull-in bit table are stored in these areas. Although details will be described later, in the first area and the second area, the numbers of the pull-in bit tables acquired in the second and subsequent priority information generation process S1106 (see FIG. 24) of the first stop process are stored. In the third area and the fourth area, the numbers of the pull-in bit tables acquired in the second and subsequent priority information generation process S2205 (see FIG. 44) of the second stop process are stored.

  Next, in the present embodiment, priority line search processing is performed instead of the processing in steps S3120 to S3123 (see FIG. 65) in the winning determination processing of the third embodiment. Thus, the priority line search process will be described based on the flowchart of FIG.

  In step S3201, it is determined whether or not the current search line matches the information on the priority line stored in the priority line buffer 156 of the RAM 106, and if not, the process ends. If the information matches the priority line information, the process proceeds to step S3202, and it is further determined whether or not there is a push order designation. Specifically, it is determined whether or not the offset reference table number is “3”. That is, in step S3202, it is determined whether or not one of the replay 2 to 7 groups is won. In addition, it is good also as a structure which refers to the winning combination determination buffer 151 and determines whether the role corresponding information which shows either the 2nd-5th regame is stored. This is because when one of the second to fifth replays is won, it means that one of the second to seventh replay groups is won. If it is determined in step S3202 that there is a push order designation, that is, if any of the replay groups 2 to 7 is won, this processing is terminated.

  If no push order is specified, the process advances to step S3203 to refer to the winning combination type buffer 170 to determine whether or not the winning type is replay information. If it is replay information, “1” is stored in the replay priority line bit of the determination value calculation information buffer B in step S3204, and then this process is terminated. If it is not re-game information, “1” is stored in the first priority line bit of the determination value calculation information buffer B in step S3205, and then this process is terminated.

  Thus, in the priority line search process, if the current search line is a priority line, if the role other than the replay 2-7 group is won, the replay priority line bit or the first priority line bit is set to “ 1 "is stored. On the other hand, if one of the replay 2-7 groups is won, even if the current search line is a priority line, “1” is not stored in the replay priority line bit and the first priority line bit. .

  Also, in this embodiment, instead of the drawn bit table acquisition process (see FIG. 33) for acquiring the drawn bit information referred to in the drawn bit information search process (step S3130, see FIG. 65) of the third embodiment. Then, a pull-in bit table acquisition process shown in FIG. 77 is performed.

  More specifically, first, in step S3301, it is determined whether or not the offset reference table number is “0”. If it is “0”, the process is terminated. If the offset reference table number is not “0”, it is further determined in step S3302 whether the offset reference table number is “3”.

  When the offset reference table number is “3”, it means that one of the replay 2-7 groups has been won. In such a case, the process proceeds to step S3303, and it is determined whether or not there is one rotating reel (more specifically, whether there is one reel for which a stop command has not been issued). If there is one reel that is rotating, the process proceeds to step S 3304, and “0” is set as the offset value. If the offset reference table number is not “3”, or if the offset reference table number is “3” and two or more reels are rotating, the process proceeds to step S3305, where the offset value is “3”. 1 ”is set.

  In step S3306, it is determined whether or not the value of the pull-in bit offset is “0”. As described in the first embodiment, when the value of the pull-in bit offset is “0”, the corresponding pull-in bit table is not prepared. Therefore, if the value of the pull-in bit offset is “0”, the pull-in bit table acquisition process is terminated after clearing the pull-in bit table buffer 166 in step S3309.

  On the other hand, when the value of the pull-in bit offset is not “0”, it means that the pull-in bit table is prepared. In such a case, the process advances to step S3307 to perform an address specifying process for specifying the address where the pull-in bit table number is stored.

  Here, prior to the description of the address specifying process, the configuration of the offset reference table will be described with reference to FIG.

  In the offset reference table with the offset reference table number “3”, the addresses of the first to fourth areas are assigned consecutive values and set so that the addresses increase from the first area toward the fourth area. Has been. For example, in the pull-in bit offset “1”, the address of the first area is set to 0, the address of the second area is set to 1, the address of the third area is set to 2, and the address of the fourth area is set to 3. In “19”, the address of the first area is set to 36, the address of the second area is 37, the address of the third area is 38, and the address of the fourth area is 39. An odd number is assigned to the value of the pull-in bit offset, and the address of the first area of each pull-in bit offset is set by multiplying the pull-in bit offset value by 2 and subtracting 2 from the multiplication result. Has been. For example, the address of the first area of the pull-in bit offset “3” is set to 4 (= 3 × 2-2), and the address of the first area of the pull-in bit offset “13” is 24 (= 13 × 2- 2) is set.

  Incidentally, for the offset reference tables other than the offset reference table number “3”, two areas are assigned to one pull-in bit offset, and not only odd numbers but also even numbers are assigned to the pull-in bit offset values. It is the same except that it is. Referring to FIG. 74 as an example, the address of the first area of the pull-in bit offset “1” is 0 (= 1 × 2-2), and the address of the second area is 1. Further, the address of the first area of the pull-in bit offset “6” is 10 (= 6 × 2-2), and the address of the second area is 11.

  In the address specifying process, a predetermined calculation is performed using the value of the pull-in bit offset and the offset value set in step S3304 or step S3305, and the address where the pull-in bit table number is stored is specified. Specifically, the offset value is subtracted from the pull-in bit offset value, and the subtraction result is multiplied by 2.

  After performing the address specifying process, in step S3308, the pull-in bit table number stored in the address area specified in the address specifying process and the pull-in bit table number stored in the address area obtained by adding 1 to the address. And get. Then, the information indicated by the acquired pull-in bit table number is stored in the pull-in bit table buffer 166. Thereafter, the acquisition bit table acquisition process is terminated.

  Here, in order to facilitate understanding, a case where the replay 2 group is won and the left stop switch 42 is operated first will be described as an example. The replay 2 group is a lottery role that wins the first replay and the second replay, and the stop switches 42 to 44 are operated in the order of the left stop switch 42 → the middle stop switch 43 → the right stop switch 44. In this case, the first re-game winning is established, and when the stop switches 42 to 44 are operated in another operation order, the second re-game winning is achieved.

  When the replay 2 group is won, the slide table shown in FIG. 73A is acquired, and when the left stop switch 42 is operated first, stop control of the left reel 32L is performed using the slide table.

  At this time, for example, when the left stop switch 42 is operated when the 0th symbol of the left reel 32L has reached the lower stage, the left reel 32L stops after sliding for 2 symbols and stops. Stops at the bottom. In such a case, the second “white 7” symbol stops in the lower row, the third “bell” symbol stops in the middle row, and the fourth “replay” symbol stops in the upper row (see FIG. 69). As described above, the first replay prize is established when the combination of the “replay” symbol, the “replay” symbol, and the “replay” symbol is stopped on the active line, and the second regame prize is designated as the “bell” symbol, “ This is established when the combination of “replay” symbol and “replay” symbol stops on the active line. For this reason, when the left reel 32L comes out of the above stoppage, there is a possibility that the first re-game prize will be established on the upper line L1 and the right-fall line L4, and the second re-game prize will be awarded on the middle line L2. It may be established.

  In the pull-in bit table acquisition process in the first stop process, since the offset reference table number is “3”, a negative determination is made in step S3301, a positive determination is made in step S3302, and the process proceeds to step S3303. In step S3303, since there are two reels that are rotating, a negative determination is made. In step S3305, the offset value is set to “1”. When the second symbol of the left reel 32L is stopped at the lower stage, the value of the lead-in bit offset is “1”. Therefore, a negative determination is made in step S3306, and an address specifying process is performed in step S3307. In the address specifying process, the offset value “1” is subtracted from the pull-in bit offset value “1”, and the result is multiplied by 2. Therefore, the obtained address is “0”. Therefore, in step S3308, the acquisition bit table number “1” is acquired from the first area of the acquisition bit offset “1”, and the acquisition bit table number “3” is acquired from the second area of the acquisition bit offset “1”. These pieces of information are stored in the pull-in bit table buffer 166 (see FIG. 75A).

  Although not shown, the pull-in bit table with the pull-in bit table number “1” is for the middle reel 32M, and the symbol number (for example, No. 5, No. 13, etc.) that causes the “replay” symbol to stop in the middle row. The pull-in bit information having the largest value (that is, “11”) is stored. In addition, the pull-in bit table of the pull-in bit table number “3” is for the right reel 32R, and the largest value (for example, No. 6, No. 14, etc.) at which the “replay” symbol stops in the middle stage ( That is, “11”) is stored.

  For this reason, in the winning bit information search process (step S3130, see FIG. 65) of the winning determination process, the largest drawn bit information is stored in the symbol number at which the “replay” symbol stops in the middle stage of the middle reel 32M. The largest pull-in bit information is stored in the symbol number at which the “replay” symbol stops in the middle of the right reel 32R. As a result, when the middle stop switch 43 is operated as the second stop command, the “replay” symbol stops at the middle stage of the middle reel 32M, and there is a possibility that the first replay prize will be established at the right lowering line L4. The remaining possibility remains that the second regame prize will be established in the middle line L2. Further, when the right stop switch 44 is operated as the second stop command, the “replay” symbol stops in the middle stage of the right reel 32R, and there is no possibility that the first replay winning will be established, while the middle line L2 Thus, there is a possibility that the second replay prize will be established.

  Incidentally, in the determination value calculation information buffer B, the first priority line bit, the kick determination bit, the acquired number of bits, the BB role bit, the replay priority line bit, the replay bit, and the unfair winning prize are placed on the higher order side of the pull-in bit. A decision bit is assigned. Since the case where the replay 2 group is won is described here, the information stored in the acquired number of bits and the BB combination bit is “0”. Regarding the kick determination bit, since there is only one reel that is currently stopped, the information is not changed. The replay bit stores “1” regardless of whether the first regame win or the second regame win can be established. As described in the priority line search process (see FIG. 76), the first priority line bit and the replay priority line bit end the process as it is when the replay 2 group is selected. It is. In other words, when the replay 2 group is won, the judgment value calculation information differs depending on the value stored in the pull-in bit, and the result of stopping the spinning reel is determined by the pull-in bit. Become.

  Next, a case where the middle stop switch 43 is operated as the second stop command will be described.

  In the pull-in bit table acquisition process in the second stop process, since the offset reference table number is “3”, a negative determination is made in step S3301, a positive determination is made in step S3302, and the process proceeds to step S3303. In step S3303, since there is one reel that is rotating, an affirmative determination is made. In step S3304, the offset value is set to “0”. When the second symbol of the left reel 32L is stopped at the lower stage, the value of the lead-in bit offset is “1”. Therefore, a negative determination is made in step S3306, and an address specifying process is performed in step S3307. In the address specifying process, the offset value “0” is subtracted from the value “1” of the pull-in bit offset, and the result is multiplied by 2. Therefore, the obtained address is “2”. Therefore, in step S3308, the acquisition bit table number “1” is acquired from the third area of the acquisition bit offset “1”, and the acquisition bit table number “2” is acquired from the fourth area of the acquisition bit offset “1”. These pieces of information are stored in the pull-in bit table buffer 166.

  The pull-in bit table of the pull-in bit table number “1” is as described above. The pull-in bit table of the pull-in bit table number “2” is for the right reel 32R, and the largest value (that is, “7”, “15”, etc.) at which the “replay” symbol stops at the lower stage (ie, “ 11 ") is stored.

  Therefore, in the winning bit information search process (step S3130, see FIG. 65) of the winning determination process, the largest drawn bit information is stored in the symbol number at which the “replay” symbol stops at the lower stage of the right reel 32R. It will be. As a result, when the middle stop switch 43 is operated as the second stop command, the right stop switch 44 is operated as the third stop command, whereby the “replay” symbol stops at the lower stage of the right reel 32R, and the right A first re-game winning is established at the falling line L4. In the pull-in bit table acquisition process in the second stop process, the pull-in bit table number “1” is acquired from the third area. In the pull-in bit information search process, the pull-in bit information is stored using the pull-in bit table. There is nothing. This is because the middle reel 32M has already stopped. That is, when the middle stop switch 43 is operated as the second stop command and the right stop switch 44 is operated as the third stop command, the information stored in the first and fourth areas of the pull-in bit offset is used. Will be.

  Next, a case where the right stop switch 44 is operated as the second stop command will be described.

  The pull-in bit table acquisition process in the second stop process is the same as when the middle stop switch 43 is operated as the second stop command.

  In the winning bit information retrieval process (step S3130, see FIG. 65) of the winning determination process, the largest drawn bit information is stored in the symbol number at which the “replay” symbol stops in the middle stage of the middle reel 32M. . As a result, when the right stop switch 44 is operated as the second stop command, the middle stop switch 43 is operated as the third stop command, so that the “replay” symbol stops at the middle stage of the middle reel 32M. A second regame prize is established at line L2. In the pull-in bit table acquisition process in the second stop process, the pull-in bit table number “2” is acquired from the fourth area. In the pull-in bit information search process, the pull-in bit information is stored using the pull-in bit table. There is nothing. This is because the right reel 32R has already stopped. That is, when the right stop switch 44 is operated as the second stop command and the middle stop switch 43 is operated as the third stop command, the information stored in the second area and the third area of the pull-in bit offset is used. Will be.

  Next, as another example, the case where the replay 3 group is won and the left stop switch 42 is operated first will be described as an example. The replay 3 group is a lottery winning combination for the first replay, the second replay, and the third replay, and the stop switch 42 in the order of the left stop switch 42 → the right stop switch 44 → the middle stop switch 43. In the lottery where the first re-game prize is established when... 44 is operated, and the second re-game prize or the third re-game prize is established when the stop switches 42 to 44 are operated in another operation order. is there.

  When the replay 3 group is won, the slide table prepared for the replay 3 group win is acquired, and when the left stop switch 42 is operated first, the stop control of the left reel 32L is performed using the slide table. Is done.

  At this time, for example, when the left stop switch 42 is operated when the 13th symbol of the left reel 32L reaches the lower stage, the left reel 32L stops after sliding 3 symbols, and the 16th symbol is stopped. Stops at the bottom. In such a case, the 16th “replay” symbol stops in the lower row, the 17th “bell” symbol stops in the middle row, and the 18th “youth” symbol stops in the upper row (FIG. 69). reference). As described above, the first replay prize is established when the combination of the “replay” symbol, the “replay” symbol, and the “replay” symbol is stopped on the active line, and the second regame prize is designated as the “bell” symbol, “ It is established when the combination of “Replay” and “Replay” symbols stops on the active line, and the third replay prize is the combination of “Youth” symbol, “Red 7” symbol and “White 7” symbol on the effective line. It is established when the vehicle stops at For this reason, when the left reel 32L comes out of the above-mentioned stoppage, there is a possibility that the third re-game prize will be established at the upper line L1 and the right-down line L4, and the second re-game prize will be awarded at the middle line L2. There is a possibility that it will be established, and there is a possibility that the first re-game winning will be established on the lower line L3 and the right rising line L5.

  Here, if the left stop switch 42 is operated when the symbols 12 to 16 of the left reel 32L reach the lower stage, the symbol 16 is displayed in the sliding table when the replay 3 group is selected. The number of slides is set to stop at the bottom. With this configuration, when the left stop switch 42 is first operated at the above timing, not only the first to third re-game winnings are all established, but also the fourth re-game winnings and the fifth re-play winnings. There is also room for winning game prizes. The same applies to the sliding table when the replay 2 group and the replay 4-7 group are selected, and the left stop switch 42 was operated when the symbols 12-16 of the left reel 32L reached the lower stage. In this case, the number of slides is set so that the 16th symbol stops in the lower stage. Therefore, when one of the replays 2 to 7 groups is won, it becomes possible to diversify the stop appearance.

  In the pull-in bit table acquisition process in the first stop process, since the offset reference table number is “3”, a negative determination is made in step S3301, a positive determination is made in step S3302, and the process proceeds to step S3303. In step S3303, since there are two reels that are rotating, a negative determination is made. In step S3305, the offset value is set to “1”. When the 16th symbol of the left reel 32L is stopped at the lower stage, the value of the lead-in bit offset is set to “11”. Therefore, a negative determination is made in step S3306, and an address specifying process is performed in step S3307. In the address specifying process, the offset value “1” is subtracted from the pull-in bit offset value “11”, and the result is multiplied by 2. Therefore, the obtained address is “20”. Therefore, in step S3308, the acquisition bit table number “1” is acquired from the first area of the acquisition bit offset “11”, and the acquisition bit table number “6” is acquired from the second area of the acquisition bit offset “11”. These pieces of information are stored in the pull-in bit table buffer 166 (see FIG. 75A).

  Although not shown, the pull-in bit table with the pull-in bit table number “1” is for the middle reel 32M, and the symbol number (for example, No. 5, No. 13, etc.) that causes the “replay” symbol to stop in the middle row. The pull-in bit information having the largest value (that is, “11”) is stored. In addition, the pull-in bit table of the pull-in bit table number “6” is for the right reel 32R, and the largest value (for example, No. 5, No. 13, etc.) at which the “replay” symbol stops at the upper stage ( That is, “11”) is stored.

  For this reason, in the winning bit information search process (step S3130, see FIG. 65) of the winning determination process, the largest drawn bit information is stored in the symbol number at which the “replay” symbol stops in the middle stage of the middle reel 32M. The largest pull-in bit information is stored in the symbol number at which the “replay” symbol stops in the middle of the right reel 32R. As a result, when the middle stop switch 43 is operated as the second stop command, the “replay” symbol stops at the middle stage of the middle reel 32M, and there is a possibility that the first replay prize will be established at the right rising line L5. The remaining possibility remains that the second regame prize will be established in the middle line L2. Further, when the right stop switch 44 is operated as the second stop command, the “replay” symbol is stopped at the upper stage of the right reel 32R, and there is no possibility that the second re-game winning will be established. There is a possibility that the first replay prize will be established at L5.

  Here, as shown in FIG. 69, the “replay” symbol is arranged adjacent to the downstream side of the “red 7” symbol on the middle reel 32M, and the “white 7” symbol from the right reel 32R. “Replay” symbols are arranged upstream and downstream one symbol apart. Specifically, the “red 7” symbol is arranged at the second position and the “replay” symbol is arranged at the first position on the middle reel 32M. On the right reel 32R, a “white 7” symbol is arranged at the 0th position, and a “replay” symbol is arranged at the 2nd and 19th positions. As described above, the pull-in bit table of the pull-in bit table number “1” stores the pull-in bit information of the largest value in the symbol number at which the “replay” symbol stops in the middle stage of the middle reel 32M. In the pull-in bit table of the bit table number “6”, the pull-in bit information having the largest value is stored in the symbol number at which the “replay” symbol stops in the upper stage of the right reel 32R. For this reason, when the middle stop switch 43 is operated as the second stop command and the first “replay” symbol stops in the middle stage of the middle reel 32M, the first replay prize can be established on the right-up line L5. Therefore, there is a possibility that the second re-game prize will be established in the middle line L2, and a possibility that the third re-game prize will be established in the upper line L1 remains. Further, when the right stop switch 44 is operated as the second stop command and the second “replay” symbol is stopped on the upper stage of the right reel 32R, the first replay winning prize may be established at the right rising line L5. Will remain, and there is a possibility that the third re-game winning will be established at the lower right line L4.

  Next, a case where the middle stop switch 43 is operated as the second stop command will be described.

  In the pull-in bit table acquisition process in the second stop process, since the offset reference table number is “3”, a negative determination is made in step S3301, a positive determination is made in step S3302, and the process proceeds to step S3303. In step S3303, since there is one reel that is rotating, an affirmative determination is made. In step S3304, the offset value is set to “0”. As described above, when the 16th symbol of the left reel 32L is stopped at the lower stage, the value of the lead-in bit offset is “11”. Therefore, a negative determination is made in step S3306, and an address specifying process is performed in step S3307. In the address specifying process, the offset value “0” is subtracted from the pull-in bit offset value “11”, and the result is multiplied by 2. Therefore, the obtained address is “22”. Therefore, in step S3308, the acquisition bit table number “1” is acquired from the third area of the acquisition bit offset “11”, and the acquisition bit table number “7” is acquired from the fourth area of the acquisition bit offset “11”. These pieces of information are stored in the pull-in bit table buffer 166.

  The pull-in bit table of the pull-in bit table number “1” is as described above. The pull-in bit table of the pull-in bit table number “7” is for the right reel 32R, and is the second largest value (for example, No. 6, No. 14, etc.) in which the “replay” symbol stops in the middle ( That is, “10”) is stored, and 19th is the largest value (ie, “11”).

  For this reason, in the winning bit information search process (step S3130, see FIG. 65) of the winning determination process, the largest drawn bit information is in the symbol number at which the 19th “replay” symbol stops at the lower stage of the right reel 32R. The second largest pull-in bit information is stored in the symbol number that is stored and one of the “replay” symbols stops in the middle. As a result, when the middle stop switch 43 is operated as the second stop command, the stop outcome is as follows. If the right stop switch 44 is operated when the 15th to 19th symbols on the right reel 32R reach the lower level, the 19th “replay” symbol stops at the lower level and the 0th “white” 7 ”Since the symbol stops at the upper stage, the third replay prize is established at the upper line L1. When the right stop switch 44 is operated at another operation timing, the “replay” symbol stops in the middle stage, and thus the second re-game winning is established at the middle line L2.

  As described above, when the stop switches 42 to 44 are operated in the order of the left stop switch 42 → the middle stop switch 43 → the right stop switch 44, the second restart switch is performed according to the operation timing of the middle stop switch 43 and the right stop switch 44. A game prize or a third re-game prize is established.

  Next, a case where the right stop switch 44 is operated as the second stop command will be described.

  The pull-in bit table acquisition process in the second stop process is the same as when the middle stop switch 43 is operated as the second stop command.

  In the winning bit information retrieval process (step S3130, see FIG. 65) of the winning determination process, the largest drawn bit information is stored in the symbol number at which the “replay” symbol stops in the middle stage of the middle reel 32M. . As a result, when the right stop switch 44 is operated as the second stop command, the middle stop switch 43 is operated as the third stop command, whereby the “replay” symbol stops at the middle stage of the middle reel 32M. A first regame prize is established at the rising line L5.

  Although detailed explanation is omitted, when the stop switches 43 and 44 other than the left stop switch 42 are operated as the first stop command, the second re-game winning is established in the middle line L2. That is, when the stop switches 42 to 44 are operated in an operation order other than the operation order capable of establishing the first replay prize, the operation is performed in the order of the left stop switch 42 → the middle stop switch 43 → the right stop switch 44. And the third regame prize is awarded only when each of the stop switches 42 to 44 is operated at a predetermined timing (that is, a timing at which the third replay symbol can be stopped on the active line). When the stop switches 42 to 44 are operated at a timing other than the other operation order and a predetermined timing, the second regame winning is established. The same applies to the replay 4-7 group, and the third to fifth replay wins are won by any of the replay 3-7 groups, the left stop switch 42 → the middle stop switch 43 → the right stop switch 44 This is the case when the switches are operated in order, and only when the stop switches 42 to 44 are operated at a predetermined timing.

  As described above, by performing the priority line search process and the pull-in bit table acquisition process, the first re-game winning can be established or not established depending on the operation order of the stop switches 42 to 44. As a result, it becomes possible to diversify the stoppage and improve the game entertainment.

  In the offset reference table that is referred to when one of the replays 2 to 7 is won, the first to fourth areas are provided corresponding to each drawn bit offset, and the number of the drawn bit table is assigned to each of these areas. I remembered. And in the 1st field and the 2nd field, the number of the drawing bit table acquired in the priority information creation process for the 2nd stop and after of the 1st stop process is memorized, and in the 3rd field and the 4th field, The number of the pull-in bit table acquired in the priority information generation process for second and subsequent stops of the second stop process is stored. By adopting such a configuration, the processing program for winning determination processing, more specifically, the processing program for acquisition bit table acquisition processing is increased as compared with the processing program for acquisition bit table acquisition processing in the third embodiment. Can be suppressed. Further, by suppressing the increase in the processing program, it is possible to suppress an increase in the processing time required for creating the determination value calculation information.

  Certainly, in the offset reference table that is referred to when one of the replays 2 to 7 is won, the first and third priority areas are created in the first area and the third area. Is stored in the second area and the fourth area, and the number of the drawn bit table acquired in the priority information creation process for the second and subsequent stops of the second stop process is stored in the second area and the fourth area. It is also possible. However, in such a configuration, the processing program for the acquisition bit table acquisition process is further increased as compared with the acquisition bit table acquisition process in the above embodiment. In the above embodiment, by setting “0” or “1” as the offset value, the address of the first area or the third area corresponding to the value of the pull-in bit offset can be specified. When the address of the area is specified and the address of the second area is to be specified at the time of the second stop process, it is necessary to devise, for example, to change the calculation performed in the address specifying process depending on the number of rotating reels. Because.

  Regardless of the operation order of the stop switches 42 to 44, the replay 1 group was set as a lottery that can establish the first replay prize. By adopting such a configuration, it is possible to increase the chance that the first re-game winning is established. In addition, when one of the replay 2-7 groups is won, whether or not the first replay winning is established depends on the operation of the stop switch by the player, but when the replay 1 group is won, The first replay prize is established without depending on the operation of the stop switch by the player. For this reason, when the replay 1 group is won, it is possible to perform an effect suggesting that the first replay win is established from the start stage of all the reels 32L, 32M, 32R, and diversification of the stop appearance In addition, it is possible to diversify the production.

  In addition to winning the first regame and at least one of the third to fifth regames when winning the replay 3-7 group, the second regame is also won. did. In the left reel 32L, the “bell” symbols forming the second replay prize are set with all symbol intervals within the range of the maximum number of reels (4 symbols). In the middle reel 32M and the right reel 32R, In the “replay” symbols forming the second replay winning prize, all symbol intervals are set within the range of the maximum number of reels (4 symbols). For this reason, the second re-game winning can be established regardless of the operation timing of the stop switches 42 to 44. By adopting such a configuration, it is possible to prevent the player from suffering a disadvantage due to the occurrence of a loss as a result of avoiding the establishment of the first re-game winning.

  Here, it is also possible to adopt a configuration in which the second re-game winning is always established when the third to fifth re-game winnings are not set and are not operated in a predetermined order. However, in such a configuration, even if any of the replay 2 to 7 groups is won, the stop game will be the first re-game prize or the second re-game prize, and diversification of the stop game There is a possibility that it may not be sufficiently achieved. On the other hand, when the replay 3-7 group is won, in the configuration in which at least one of the third to fifth regames is won, it is possible to diversify the stop appearance.

  The third to fifth replay prizes are awarded when one of the replay 3 to 7 groups is won and operated in the order of the left stop switch 42 → the middle stop switch 43 → the right stop switch 44. Only when each of the stop switches 42 to 44 is operated at the timing, the configuration is established. By adopting such a configuration, it is possible to avoid the opportunity for the player to suffer a disadvantage while diversifying the stopping appearance.

  Here, consider a case where 4 replay groups are won. If the 4 replay groups are won, the 1st replay, the 2nd replay and the 4th replay are won, and the stop switches 42 to 44 are changed from the middle stop switch 43 → the left stop switch 42 → the right stop switch 44. Only when operated in order, the first replay prize is established. In this situation, when the left stop switch 42 is first operated at the timing when the number 16 of the left reel 32L reaches the lower stage, the first regame prize, the second regame prize, and the fourth regame prize Since it is desirable to leave room for all to be established, the 16th “replay” symbol is stopped at the bottom. Thereafter, as the second stop command, when the right stop switch 44 is operated at the timing when the number 0 of the right reel 42R reaches the lower stage, at least the second regame prize or the fourth regame prize is established. It is necessary to stop the right reel 42R so as to leave room. Here, when the “white 7” design of No. 0 on the right reel 42R is stopped at the upper or lower level, there remains room for the fourth re-game prize to be established on the upper line L1 or the lower right line L4. When the “replay” symbol is stopped in the middle stage, there remains room for the second re-game winning to be established on the middle line L2. However, if the “White 7” symbol of No. 0 on the right reel 42R is stopped at the upper or lower level, the symbols No. 14 to No. 18 of the middle reel 42M arrive on the active line where the fourth replay winning prize is established. When the middle stop switch 43 is operated at a timing other than the current timing, none of the first re-game winning, the second re-game winning, and the fourth re-game winning will be established, and an overshoot will occur. This will lead to a player's disadvantage. On the other hand, when the second “replay” symbol is stopped in the middle stage, the second replay prize can be established on the middle line L2 regardless of the operation timing of the middle stop switch 43, and the player can replay the game. Can be granted.

  More specifically, the third stop switch 42 is operated in the order of the left stop switch 42 → the middle stop switch 43 → the right stop switch 44, and only when the stop switches 42 to 44 are operated at a predetermined timing. In the case where the fifth regame winning is established, the stop mode of the left reel 32L can be defined in advance by the sliding table. For this reason, it is sufficient to prepare in advance a pull-in bit table that assumes only the subsequent stop situation, and it becomes possible to suppress an increase in the amount of data and an increase in the number of debugging steps.

  In addition, it is not limited to the description content of each embodiment mentioned above, For example, you may implement as follows.

  (1) Each determination value calculation information buffer B in the first to third embodiments may be configured only by an unfair winning determination bit and a winning combination determination bit. The priority determination value of each symbol number is set such that the symbol number where a winning occurs> the symbol number where neither winning nor illegal winning occurs> symbol number causing an illegal winning. Even in such a configuration, when the stop symbol number is calculated after the stop command is generated, the symbol number where the winning occurs is given priority, and the symbol number where the illegal winning is generated is avoided.

  (2) As an aspect relating to the stop control of each reel 32L, 32M, 32R, the aspect in the first to third embodiments and the aspect shown in (1) may be combined. For example, when the left reel 32L is stopped as the first stop, the first stop to the third stop are all performed in the manner of the first embodiment, and the rest other than the left reel 32L is stopped as the first stop. When operated, all of the first stop to the third stop may be performed in the manner shown in the above (1).

  (3) In each of the above embodiments, when the reel stop control is performed based on each determination value calculation information (priority information), before the reel stop operation is validated, each determination value calculation information Only “0” or “1” is stored in each bit of the buffer B, and the priority determination value calculation, the slip number calculation, and the stop symbol number calculation are performed after the stop command is generated. This may be changed.

  For example, the priority order determination values of all symbol numbers may be calculated before the corresponding reel stop operation is validated. In such a configuration, since it is not necessary to calculate the priority determination value after the stop command is generated, it is possible to reduce the time lag from when the stop command is generated until the corresponding stop symbol number is determined. .

  Further, the number of slips corresponding to each of all symbol numbers may be calculated before the corresponding reel stop operation is validated. In such a configuration, since it is not necessary to calculate the number of slips after the stop command is generated, it is possible to reduce the time lag from when the stop command is generated until the corresponding stop symbol number is determined.

  Alternatively, the stop symbol numbers corresponding to all the symbol numbers may be calculated before the corresponding reel stop operation is validated. In such a configuration, since it is not necessary to calculate the stop symbol number after the stop command is generated, it is possible to reduce the time lag from when the stop command is generated until the corresponding stop symbol number is determined.

  Then, by reducing the time lag as described above, when the symbol of the reaching symbol number that has reached the base point position at the timing when the stop switch is operated is stopped as it is, the reel actually corresponds to the operation timing of the stop switch. The stop timing can be made as close as possible, and the response until the reel stops can be improved.

  (4) In each of the above-described embodiments, when the target of the first stop command is the left reel 32L, the determination of the stop symbol number of the left reel 32L is made in advance according to the slip stored in the ROM 105 of the main controller 101. Although it is based on the table, even in such a case, the stop symbol number may be determined based on the priority information. With this configuration, no sliding table is required, and the data amount of the ROM 105 can be further reduced with respect to the stop control of each reel 32L, 32M, 32R.

  In addition, regarding a specific reel such as the left reel 32L, the stop symbol number may be determined based on the sliding table regardless of the stop operation order. In addition, regarding the reels to be stopped in a specific order such as the first stop command, the stop symbol number may be determined based on the sliding table regardless of which reel. Even with these configurations, the data amount of the ROM 105 can be reduced with respect to stop control of each reel 32L, 32M, 32R, compared to a configuration in which a slide table is stored in advance for all reels and all stop operation orders. It becomes possible to plan.

  (5) In each of the above embodiments, when reel stop control is performed based on each determination value calculation information, a priority determination value is calculated after the stop command is generated, and thereafter, based on the priority determination value. Although the number of slips is calculated and the stop symbol number is calculated at the end, this may be changed. For example, the stop symbol number may be calculated instead of calculating the number of slips by comparing the priority determination values. In this case, the processing time from when the stop command is generated until the stop symbol number is calculated can be made shorter than in the above embodiments.

  (6) In each of the above embodiments, the higher the priority order, the higher the priority determination value, but instead, the higher the priority number, the lower the priority determination value. May be. In such a configuration, in the second stop and subsequent slip number acquisition process (see FIG. 45), the symbol number having the smallest priority determination value among the symbol numbers corresponding to the maximum number of slips from the reached symbol number is set as the stop symbol number. Set. By the way, in this configuration, for a symbol number where an unfair winning occurs, by storing “1” in each bit of the determination value calculation information buffer B, the priority determination value of the symbol number where the unreasonable winning occurs is the largest. Can be the lowest priority. In addition, the maximum value that can be stored is stored in the acquired number of bits in the determination value calculation information buffer B (specifically, all “1” is stored in the third to zeroth bits of the first buffer B1). In other words, every time the number of acquired sheets is calculated, it may be subtracted sequentially.

  (7) In each of the above embodiments, each determination value calculation information buffer B is composed of 2 bytes, but may be composed of 3 bytes or more. However, it is preferable to unify the number of bytes in each determination value calculation information buffer B in order to uniformly calculate the priority order determination values.

  Further, each determination value calculation information buffer B may be composed of 1 byte. However, in this configuration, since the number of bits is smaller than that in each of the above embodiments, it is necessary to reduce the type of information included in the determination value calculation information as compared to each of the above embodiments.

  (8) In each of the above-described embodiments, the priority information for the second stop and later in the situation where the interrupt process for stop is permitted in the first stop process (see FIG. 24) and the second stop process (see FIG. 44). By executing the creation process, the reel deceleration process and the creation of each determination value calculation information are performed in parallel, but this may be changed. For example, in the situation where the stop interrupt process is permitted, the determination information calculation information is generated after the reel deceleration process is completed by not performing the priority information generation process for the second and subsequent stops. You may do it. However, in such a configuration, it is necessary to make the time from when one stop command is generated until the next stop operation is validated longer than in each of the above embodiments.

  (9) In each of the above-described embodiments, the processing time of the priority information creation process for the second and subsequent stops is stopped after the reel is slid after the maximum number of symbols (4 symbols) after the stop command is generated. However, instead of this, the processing time of the second stop and subsequent priority information generation processing may exceed the specified period. However, in such a configuration, it is necessary to make the time from when one stop command is generated until the next stop operation is validated longer than in each of the above embodiments.

  (10) In each of the above embodiments, in the reel rotation process (see FIG. 18), the irregular pushing priority order information creation process is executed in a situation where the start interrupt process is permitted, thereby the reel acceleration process and Although the creation of each judgment value calculation information for pushing irregularities is performed in parallel, this may be changed. For example, in the situation where start interrupt processing is permitted, the creation of each determination value calculation information for irregular pushing after the reel acceleration processing is completed by not performing the irregular pushing priority information creation processing May be performed. However, in such a configuration, it is necessary to make the time from when the start command is generated until the first stop operation is validated longer than in each of the above embodiments.

  (11) In each of the above-described embodiments, the processing time of the irregular pushing priority order information creation processing ends within the acceleration period from the start of the acceleration processing of each reel 32L, 32M, 32R to the steady rotation. However, instead of this, the processing time of the irregular pressing priority information creation processing may be configured to exceed the acceleration period. However, in such a configuration, it is necessary to make the time from when the start command is generated until the first stop operation is validated longer than in each of the above embodiments.

  (12) In each of the first and second embodiments, each determination value calculation information buffer B summarizes the small role winnings such as a watermelon role and a bell role as a small role bit. It is good also as a structure which allocates a bit according to a kind. For example, in the first embodiment, a watermelon combination bit, a bell combination bit, and a cherry combination bit are allocated to each determination value calculation information buffer B, respectively. In this case, in the priority determination value, a symbol number that causes a win of a watermelon role or causes the possibility of winning, a symbol number that causes a win of a bell role or causes the possibility of winning, and a cherry role A difference can be provided for each of the symbol numbers where the winnings are generated. In such a configuration, the order in which the small combination bits are arranged is higher in the small combination with the larger number of payouts, so that the plurality of small combinations can be simultaneously performed without assigning the acquired number of bits in each determination value calculation information buffer B. When winning, you can prioritize winning a small role with a large number of payouts.

  (13) In each of the above embodiments, all symbols in the determination value calculation information buffer B are cleared to “0” for the symbol number where the unsuccessful winning occurs, but only the unsuccessful winning determination bit is cleared to “0”. It is good also as a structure. Even in such a configuration, since each of the determination value calculation information buffers B is assigned with the most unsuccessful prize determination bit, the priority order determination value of the symbol number at which the unsuccessful prize is generated can be minimized.

  (14) In each of the above embodiments, each of the decision value calculation information buffers B is assigned with an unfair winning decision bit and a kick decision bit. However, the functions of these two bits may be integrated into one bit. In such a configuration, the priority determination value of the symbol number that causes an unfair winning is the same as the priority determination value of the symbol number that causes a kicked eye to appear.

  (15) In each of the above embodiments, the pull-in bit table is not provided for a combination that does not cause a miss, but a pull-in bit table may be provided for a combination that does not cause a miss. In the configuration, even if a winning combination such as re-playing does not occur is won, the drawn bit information composite value is stored in the drawn bits of each determination value calculation information buffer B of each symbol number. Become. In this case, for at least a predetermined reel, a winning combination of the drawn bit information at a predetermined symbol number (first symbol number) that causes a re-game win or a possibility of the win is the next re-game win. May be set so as to be smaller than the combined value of the drawn bit information in the symbol number (second symbol number) that causes the possibility of winning or the possibility of winning. As a result, when the stop switch is stopped at the timing when the first symbol number is the arrival symbol number in the situation where the re-game is won, the second symbol number is calculated as the stop symbol number, The reel will stop after sliding to some extent. For example, by performing such a stop mode only in the BB winning status, it is possible to notify the BB winning status according to the slip mode when the reel stops.

  (16) In each of the embodiments described above, the pull-in bit information composite value is calculated from the pull-in bit table and stored in the pull-in bit of each determination value calculation information buffer B. The drawn bit information set in the bit table may be stored in the drawn bits as they are. Further, in each of the above embodiments, the configuration is such that the information of the pull-in bit table is acquired based on the information of the pull-in bit offset. However, the information of the pull-in bit table may be acquired without using the pull-in bit offset. .

  (17) The priority line when the irregular push is performed may be the lower right line L4 or the upper right line L5 regardless of the winning combination. Here, in the winning determination processing (see FIG. 35) in the irregular pushing priority information creation processing (see FIG. 51), the possibility of winning is detected for the same winning combination while searching for each active line. In this case, the information on the number of payouts is not added. However, in the configuration in which the priority line when the irregular push is performed as described above is the right-down line L4 or the right-up line L5 regardless of the winning combination etc. There is no need to do. The above process is for preventing the priority line from being substantially limited to the right falling line L4 or the right rising line L5 when trying to set the priority line to other than the right falling line L4 or the right rising line L5. It is.

  (18) The arrangement order of the bits in each determination value calculation information buffer B is not limited to the above-described embodiments, and may be another arrangement order.

  (19) The information stored in the acquired number of bits in each determination value calculation information buffer B is not limited to information on the number of payouts, but may be configured to store information corresponding to the number of payouts.

  (20) In each of the above embodiments, a pull-in bit table is stored in advance in the ROM 105 of the main controller 101, a pull-in bit information composite value is calculated based on the pull-in bit table, and the calculated pull-in bit information composite value is Although stored in the pull-in bit of the determination value calculation information buffer B, this may be changed. For example, a configuration without a pull-in bit table may be adopted. Even in such a configuration, by assigning specific eye bits such as an alternative eye in the case of missing or a reach eye in the BB winning situation to the determination value calculation information buffer B, the specific eyes appear. The priority order judgment value of the symbol number can be made larger than the priority order judgment value of the symbol number that does not cause the specific eye to appear (no winning is generated). That is, even in a configuration in which no pull-in bit table is provided, it is possible to diversify the stop appearance.

  More specifically, in the determination value calculation information buffer B, a specific bit is assigned instead of the pull-in bit. In the winning determination process (see FIG. 35, FIG. 36, etc.), instead of performing the lead-in bit information search process, a process for storing the specific item information in the specific item bit (specific item information storing process) is performed instead. To do. In the specific eye information storage process, it is determined whether or not a combination of symbols corresponding to the specific eye is configured on the current search line, and if configured, the specific eye information is stored in the specific eye bit. To.

  Whether or not a combination of symbols corresponding to the specific eye is configured can be determined as follows, for example. That is, the second symbol correspondence information (see FIG. 38) is ANDed with respect to the symbol number of each reel on the search line, and the kicking correspondence information (see FIG. 40) is ANDed with respect to the result of the AND processing. When “1” is stored in any bit in the information of the result, it is determined that a combination of symbols corresponding to the specific eye is configured. In this case, “1” is stored in the specific bit. Thereby, the priority determination value of the symbol number that causes the specific eye to appear can be made larger than the priority determination value of the symbol number that does not cause the specific eye to appear. In addition, the symbol correspondence information and kicking correspondence information used in the specific eye information storage processing are used in the processing for storing winning combination information for the winning combination bits (re-playing bit, BB combination bit, etc.) and the kicking processing. It is done. In other words, information for storing winning combination information, information for performing kicking processing, etc. are also used as information for causing a specific eye to appear, and information used for creating judgment value calculation information is unified. Figured.

  (21) The symbol arrangement of each reel 32L, 32M, 32R is not limited to that in each of the above embodiments.

  (21-1) For example, it is good also as a symbol arrangement | sequence which a stop appearance as shown in FIG. 67 may appear. Specifically, with respect to the left reel 32L and the middle reel 32M, as shown in FIG. 67A, “replay” symbols are arranged on the upper line L1, and “red 7” symbols and “white” are arranged on the lower line L3. 7 ”is a symbol arrangement in which symbols may be arranged. For the right reel 32R, the symbols with symbol numbers “7” to “12” are “red 7” symbol, “cherry” symbol, “replay” symbol, “bell” symbol, “watermelon” symbol, “replay”. "It is a design.

  In this case, when the reaching symbol number becomes the symbol number 7 in the situation where the re-game is won (the reaching symbol number may be the symbol number 6), a re-game winning is made. As stop events to be generated, a stop event with a stop symbol number of 7 as shown in FIG. 67 (b) and a stop symbol number of 12 as shown in FIG. 67 (c). It can be considered as a stop-out.

  In the situation described above, when the stop appearance shown in FIG. 67 (b) appears, the “red 7” symbol, the “white 7” symbol, and the “red 7” symbol are arranged on the lower line L3. Since this symbol arrangement is generally an arrangement that constitutes a reach, there is a risk that the player will be mistaken for the appearance of a reach. On the other hand, in the stop control of the reels 32L, 32M, and 32R in each of the above-described embodiments, the determination value of the seventh symbol number is provided because each determination value calculation information buffer B is provided with a kick determination bit. By storing “0” in the kick determination bit in the calculation information buffer B and storing “1” in the kick determination bit in the determination value calculation information buffer B of the number 10 symbol, the symbol number 7 In addition, the priority determination value of the symbol number 10 can be increased, and the stop event shown in FIG. 67 (c) is prioritized.

  Even in the above configuration, for example, if the stop command for the right reel 32R is generated when the reaching symbol number is the fifth symbol number, the symbol number 10 is to be used as the stop symbol number. The maximum slip number of the reel will be exceeded. In this situation, since “1” is stored in the replay bit in the determination value calculation information buffer B for the 7th symbol number, the stop symbol number becomes the 7th symbol number, and a replay win occurs. The stop event where a replay win occurs is given priority over the non-stop event.

  Incidentally, the appearance of the stop event as described above can be realized by allocating the wrong winning determination bit and the kick determination bit in the determination value calculation information buffer B, respectively. Assuming the case where these two bits are combined as one bit, the symbol number 7 becomes a symbol number where an illegal winning occurs, and when the reaching symbol number is 5, the re-game win This is because a stop game that does not generate a replay win is given priority over a stop game that generates a game.

  (21-2) For example, it is good also as a symbol arrangement | sequence which a stop appearance as shown in FIG. 68 may appear. More specifically, as shown in FIG. 68A, the left reel 32L has a symbol arrangement in which the “watermelon” symbol, the “red 7” symbol, and the “bell” symbol may stop from the top. For the middle reel 32M, the symbols with symbol numbers “3” to “6” are the “white 7” symbol, the “bell” symbol, the “cherry” symbol, and the “watermelon” symbol.

  In this case, if the winning combination is a combination of watermelon and bell, and the winning combination is in the situation where the combined role is won, only the winning of the Bell role will occur. It is preferable to use the stop appearance of FIG. 68 (c) in which either a watermelon role or a bell role can be generated, rather than the possible stop appearance of FIG. 68 (b). On the other hand, in each of the above embodiments, the acquired number of bits is assigned higher than the first priority line bit in each determination value calculation information buffer B, so the priority line is set to the right-up line L5. Even if the situation is, the stop event shown in FIG. 68 (c) has priority over the stop event shown in FIG. 68 (b).

  (22) The types of small roles are not limited to the three types of watermelon, bell, and cherry, and there are four or more types of small roles as in the second embodiment. It is good. In a configuration in which a large number of small combinations are set in this way, each decision value calculation information buffer B calculates each determination value by assigning a winning bit in a one-to-one correspondence with these small combinations. There is a risk that the amount of data in the information buffer B will increase beyond 2 bytes. On the other hand, in each determination value calculation information buffer B, the winnings of all the small roles are collected as small portion bits. Therefore, even in the configuration in which many types of small roles are set, each determination value calculation information The amount of data in the buffer B does not increase. Even if the winnings of all the small roles are collected as small portion bits in this way, the winning number bits are assigned to each judgment value calculation information buffer B, so It is possible to provide a difference in the priority order judgment value of each symbol number.

  (23) In each of the above embodiments, the avoidance information (result information for determining avoidance) is created by ANDing the calculation information and the establishment determination information in the unfair prize determination process and the kick eye appearance process. However, when “1” is stored in any of the bits in the avoidance information, it is determined that an unfair prize has occurred or a kicked eye has appeared, but this may be changed. For example, when “1” is stored in any bit in the created avoidance information, it may be determined that an unfair prize has occurred or a kicked eye has appeared. However, in this configuration, it is necessary to perform OR processing instead of AND processing when creating avoidance information.

  (24) In the pull-in bit table, the pull-in bit information having the same value may be set for all or part of the same symbol type. For example, for the symbol number to which the “red 7” symbol is attached, the same value pull-in bit information is set, and for the symbol number to which the “bell” symbol is attached, the same value is set at a value smaller than the “red 7” symbol. Set the pull-in bit information. In this case, it becomes easy to set the pull-in bit table at the design stage of the slot machine 10.

  (25) In the second embodiment, the mask information storage area 105h of the ROM 105 stores line mask information associated with each combination line L1 to L5. It is sufficient that at least mask information is stored. This is because the combination lines associated with the other combination lines L2, L3, and L5 can be replaced with general-purpose line mask information. However, in the case of such a configuration, when an affirmative determination is made in step S2802 of the correction process (see FIG. 52), it is determined whether or not the current search line is the upper line L1 or the lower right line L4. Further, it is necessary to obtain a line mask information corresponding to the search line when an affirmative determination is made, and to acquire general-purpose line mask information when a negative determination is made. That is, in such a configuration, it is necessary to review the processing configuration of the correction processing for each model of the slot machine.

  (26) In the second embodiment, when the BB winning status is won in the BB winning situation, that is, when the BB role and the Bell role are won, line mask information corresponding to the search line is acquired. The first establishment determination information is corrected, but in addition to this, the line mask information corresponding to the search line is acquired and the first establishment determination information is obtained even when only the bell combination is won. You may perform the correction. In such a configuration, regarding the priority line for anomaly pushing stored in advance in the ROM 105, the case where the bell role is won and the case where the BB role and the bell role are won are made common. This makes it possible to reduce the amount of data stored in advance.

  (27) In the second embodiment, when the BB role and the bell role are won, line mask information corresponding to the search line is acquired, and the first establishment determination information is corrected. However, it goes without saying that the winning combination at the time of execution is arbitrary. That is, in the second embodiment, if the “watermelon” symbol is arranged at the position where the “bell” symbol of each reel 32L, 32M, 32R is arranged, the BB role and the watermelon role are won. It will be necessary to execute it. Further, the present invention is not limited to the case where a winning combination and a small combination that are valid over a plurality of games are won, and may be configured to be executed when a plurality of small combinations are won. Furthermore, in a configuration with a single winning role that is elected only for the bell role and a duplicate winning role that is elected for the bell role and the cherry role, the above correction process is executed when the single winning role is won. In addition, when the duplicate winning combination is won, the above correction process may not be executed.

  (28) In each of the above embodiments, the priority line at the time of irregular pressing is set in correspondence with the gaming situation of the slot machine 10 and is set in correspondence with each combination in each gaming situation. Change the configuration. That is, it is set in correspondence with each combination in the BB non-winning situation, and is set in correspondence with each combination in the situation in which any BB combination is won. That is, the priority line of each combination in the BB winning situation is made common by regardless of which BB combination is won. In the case of such a configuration, the effect described in the second embodiment is more remarkable. That is, on the right reel 32R, the “White 7” symbol, which is the second BB symbol, is arranged at positions No. 4 and No. 9, and the “White 7” symbol is located upstream of the No. 4 “White 7” symbol. A “bell” symbol is placed at the number 5 position adjacent to the symbol, and “bell” is positioned at the number 8 position adjacent to the “white 7” symbol on the downstream side of the number 9 “white 7” symbol. The pattern is arranged. For this reason, when the priority lines are shared, the “bell” symbol of the right reel 32R may stop at any of the upper, middle, and lower positions.

  (29) In the second embodiment, when the first establishment determination information is corrected, the acquired line mask information and the first establishment determination information are ANDed, and the result is obtained as a new first establishment. The determination information is stored in the establishment determination buffer 169 of the RAM 106. However, the correction information storage buffer is provided separately from the establishment determination buffer 169 in the RAM 106, and the information in the establishment determination buffer 169 is not changed. The result of AND processing may be stored in the correction information storage buffer. Even in such a configuration, in the winning symbol establishment determination process, the information stored in the correction information storage buffer and the winning information (role correspondence information) stored in the winning combination determination buffer 151 of the RAM 106 are used. If the AND process is performed and the result is stored as the determination information in the determination table provided in the CPU 102, the same operational effects as those in the second embodiment can be obtained.

  Or, instead of storing the result of the AND process, the correction information is stored when the value of the bit storing “1” is “0” in the role combination information of the bell role as a result of the AND process. A winning / not-established flag indicating the result is stored in the buffer, and when the value of the bit is not “0”, the winning / not-established flag is not stored. In the winning symbol establishment determination process, the first establishment determination information (information relating to the combination) of the establishment determination information stored in the establishment determination buffer 169 of the RAM 106 and the winning combination determination buffer 151 of the RAM 106 are stored. The winning information (combination correspondence information) is AND-processed, and the result is stored as the determination information in a determination table for determination of success / failure provided in the CPU 102. Thereafter, in step S1813, it is confirmed whether or not there is a winning / non-winning flag and whether or not a winning / non-winning flag is stored. (Determined negative). Even in such a configuration, it is possible to omit the process of storing information in the winning combination bits and the acquired number of bits, and it is possible to shorten the processing time required for creating the judgment value calculation information. .

  (30) In the second embodiment, the correction process is executed in the winning determination process. However, in addition to this, the correction process may be executed in the priority line change process.

  (31) In the second embodiment described above, the correction process is executed so as to avoid the occurrence of overshooting based on the award winning avoidance. Instead, in accordance with the winning combination in the priority line change process. The priority line stored in advance in the ROM 105 may be set, or the order of the search lines may be changed, thereby preventing the occurrence of missing due to the award winning avoidance.

  (32) In the fourth embodiment, the case where a combination combination (replay group) that wins a plurality of replays is set as a lottery combination has been described. You may set as a lottery combination, and you may set the multiple combination which becomes a prize for several BB as a lottery combination.

  Further, not only the same role type, but also a combination role that is won for different role types, for example, a combination role that is won for replay and watermelon may be set as a lottery role. However, in such a configuration, when the winning determination process described in each of the above embodiments is performed, a difference occurs in the replay bit and the number-of-acquisition bits positioned on the higher side than the drawn-in bit. For this reason, when a composite combination is won, a process for storing information in a bit positioned higher than a drawn bit such as a replay bit or an acquired number of bits is not performed, or in the determination value calculation information buffer B It is necessary to assign the lead-in bit to a higher-order side than the replay bit or the acquired number of bits.

  Furthermore, a configuration in which a composite combination is not set may be used. For example, in the fourth embodiment, even if any of the replays 2 to 7 groups are won, the first replay is only won, and each of the replays 2 to 7 groups has a first. An operation order that can establish a replay prize is set. Even if it is a case where it is set as this structure, it is clear that there exists an effect similar to the said 4th Embodiment. In addition, in such a configuration, in addition to the lottery of the winning combination in the lottery process, it is possible to perform the lottery of the operation order. Simplification can be achieved.

  (33) In the fourth embodiment, six types of operation sequences are set as conditions for establishing the first regame winning by setting six types of composite combinations that are won for the first replay and other replays. However, the present invention is not limited to such a configuration. If four types of operation order are set, four types of composite roles may be set. If three types of operation order are set, the composite type is set. What is necessary is just to set three types of combinations. That is, it is only necessary to set the same number of complex roles as the type of operation order to be set.

  (34) In the fourth embodiment, when one of the replay 2-7 groups is won and the stop switches 42-44 are operated in an operation order other than the predetermined operation order, the first replay The replay prize other than winning is configured to be established. However, the present invention is not limited to such a configuration, and when the stop switches 42 to 44 are operated in an operation order other than a predetermined operation order, missing is generated or A configuration in which there is a possibility that the data may be missed is also possible.

  (35) In the fourth embodiment, the first replay prize is established when all the operation orders of the first stop operation to the third stop operation coincide with the predetermined operation order. The present invention is not limited to this configuration, and may be configured such that a first replay winning prize is established when a predetermined stop switch is operated as the first stop operation, or a predetermined stop switch as the second stop operation. It is good also as a structure where a 1st re-game winning a prize is materialized when is operated.

  (36) In the fourth embodiment, the following game playability may be added.

  When the first re-game winning is established, it shifts to a specific gaming state (for example, an RT state where the re-game winning probability is higher) that is more advantageous to the player than the normal gaming state until a predetermined end condition is established, In the case where another re-game winning is established, it is configured not to shift to the specific gaming state.

  When a predetermined condition (for example, the end of the BB state, etc.) is established, a transition to a transition preparation state in which a transition to a specific gaming state can be made. When the first regame prize is established in the transition preparation state, the transition is made to the specific game state, and when another regame prize is established in the transition preparation state, the transition preparation state is ended. .

  With these configurations, the player's degree of advantage changes depending on whether or not the first replay prize can be established. It becomes possible for the player to consider whether to operate the stop switches 42 to 44 in the operation order. As a result, it becomes possible for players to actively participate in the game and to diversify the game characteristics.

  (37) In each of the above-described embodiments, a privilege for paying out medals is awarded when a small role winning is established. However, the present invention is not limited to this configuration, and some privilege is granted to a player. Any configuration may be used. For example, a configuration in which prizes other than medals are paid out when a small winning combination is established. In this configuration, for each determination value calculation information buffer B, information corresponding to a prize to be paid out is stored in the acquired number of bits. Further, in a slot machine that does not have an actual medal insertion or medal payout function and manages credits owned by a player, an increase in credited medals corresponds to provision of a privilege.

  (38) In each of the above embodiments, the medal payout is not performed when the “7” symbols as the state transition symbols are aligned on the active line. However, the medal payout may be performed.

  (39) In each of the above-described embodiments, the slot machine 10 in which a plurality of effective lines are set has been described. However, the reel 32L in each of the above-described embodiments may be applied to the slot machine 10 in which the effective lines are limited to one line. A configuration related to stop control of 32M and 32R may be applied. Further, the configuration relating to the stop control of the reels 32L, 32M, and 32R in each of the above embodiments may be applied to the slot machine 10 in which five or more effective lines are set.

  (40) In each of the above embodiments, a slot machine having three reels arranged in parallel has been described. However, the present invention is not limited to such a configuration. For example, the slot machine is provided with five reels arranged in parallel. Also good.

  (41) In each of the above embodiments, the so-called A type slot machine has been described. However, the B type, the C type, the combined type of the A type and the C type, the combined type of the B type and the C type, and further the CT game. The present invention may be applied to any slot machine such as a provided type, and it is apparent that the same effects as those of the above-described embodiment can be obtained in any case. In addition, examples of bonus winning in each type include BB winning, RB winning, SB winning and the like.

  (42) The symbols of the reels 32L, 32M, and 32R are not limited to pictures, numbers, characters, and the like, but may be geometric lines or figures. In addition, the design can be configured by light, color, or the like, the design can be configured by a three-dimensional shape or the like, and the design can be configured by combining these. That is, it is sufficient that the symbol has a function as identification information (identification information).

(43) Each reel 32L, 32M, 32R of the reel unit 31 is an example of a means for variably displaying the identification information, and the means is a structure other than this as long as the means is variably displayed in the circumferential direction. Also good. For example, other mechanical reel configurations such as a type in which the belt is rotated instead of rotating may be used, and instead of the mechanical reel configuration, an electric display such as a liquid crystal display or a dot matrix display is used. What displays variable identification information may be provided. For example, in the case of using a pattern display device such as a liquid crystal display, about the means 1 in the means for solving the problem,
“Pattern display means having a pattern circulation display area in which a plurality of types of patterns are cyclically displayed in a specific direction;
A display section for enabling visual recognition of each of the pattern circulation display areas;
Start operation means operated to start cyclic display of the pattern in each of the pattern circulation display areas,
Lottery means for performing a lottery of a role based on the operation of the start operation means;
Start control means for starting and controlling the picture display means so as to start circulation display in each picture circulation display area based on the operation of the start operation means;
A plurality of stop operation means operated to individually stop the circulation display in each of the pattern circulation display areas;
Based on the operation of each stop operation means, in order to stop the cyclic display of the corresponding pattern circulation display area, and when the winning operation lottery is won and the stop operation means is operated at a predetermined timing Stop control means for stopping the picture display means so that the winning picture corresponding to the winning role stops at an effective position visible from the display unit;
In the gaming machine provided with a privilege granting means for granting a privilege as a winning establishment, when the winning design stops at the effective position forming a predetermined combination,
Correspondence relationship storage means for storing a correspondence relationship between a plurality of partition areas each partitioned in the circulation display direction and the pattern set in each partition area in the circulation display direction.
When the stop operation means is operated and a stop command is generated, a reaching section area grasping means for grasping a reaching section area that has reached a predetermined specified position among each section area of the corresponding pattern circulation display area When,
When the stop command occurs, based on the grasping result of the reaching compartment area grasping means, out of the corresponding pattern circulation display area, stop compartment area determining means for determining a stop compartment area to be stopped at the specified position;
Stop information deriving means for deriving stop information used when stopping the cyclic display of the pattern circulation display area for which the stop partition area has not been determined, based on the determination result of the stop partition area determining means;
Stop information storage means for storing the stop information,
The stop control means stop-controls the corresponding pattern circulation display area so that the stop section area determined by the stop section area determination means stops at the specified position,
The stop information deriving means is based on a determination result of the stop partition area determining means, and at least one stop partition area is not determined from when the stop command is generated until the next stop command is generated. Deriving stop information for all partitioned areas for each partitioned area for the pattern circulation display area,
The stop section area determining means is
When a stop command is generated after the stop information deriving means derives the stop information, an arrival that can reach the specified position within a predetermined specified period based on the grasping result of the reaching section area grasping means Reachable partition area grasping means for grasping the possible partition area;
Comparison determination means for comparing and determining all the stop information of the reachable partition area and the reachable partition area stored in the stop information storage means,
A gaming machine comprising: a stop partition area deriving unit that derives the stop partition area based on a determination result of the comparison determination unit. "

  (44) In each of the above-described embodiments, an example in which the slot machine 10 is embodied has been shown. That is, in the slot machine, instead of the medal insertion and medal payout functions, a gaming machine having a ball insertion and ball payout function such as a pachinko machine may be used. If such a gaming machine is used in place of a slot machine, only a ball can be handled as a gaming value in the gaming hall. Therefore, the gaming value seen in the current gaming hall in which pachinko machines and slot machines are mixed is used. Problems such as the burden on equipment due to the separate handling of medals and balls and restrictions on the location of the gaming machine can be solved.

  DESCRIPTION OF SYMBOLS 10 ... Slot machine as a gaming machine, 11 ... Housing which comprises a part of gaming machine body, 12 ... Front door which constitutes a part of gaming machine body or opening / closing member of gaming machine body, 26 ... Display window, 31 ... Reel unit that constitutes a fluctuation display means and has a drive means, 32... A reel that constitutes a fluctuation display means and serves as a rotating or rotating body, 41... Start lever as a start operation means, 42 to 44. Stop operation means Stop switch, 64 ... speaker, 65 ... auxiliary display unit, 81 ... display control device constituting output control means, 91 ... power supply device, 101 ... main control constituting start drive control means, stop drive control means, etc. Device, 102... CPU constituting various control means such as main control means, 105, 106... ROM, RAM as storage means.

Claims (1)

A plurality of circling bodies that circulate in the circumferential direction and that are provided with a plurality of kinds of patterns in the circumferential direction;
A display window that allows a part of the design to be visually recognized with respect to each orbiting body,
Start operation means operated to start the circulation of each of the circulating bodies;
Lottery means for performing a lottery of a role based on the operation of the start operation means;
A driving means provided for each of the rotating bodies, and for rotating each of the rotating bodies;
Start drive control means for starting and controlling the drive means so as to start the circulation of the revolving bodies based on the operation of the start operation means;
A plurality of stop operation means operated to individually stop the lap of each of the lap members;
Based on the operation of each of the stop operation means, if the corresponding orbiting body is stopped, and if the winning combination lottery is won and the stop operation means is operated at a predetermined timing, the winning combination is won. Stop drive control means for stopping and controlling each of the drive means so that the winning pattern corresponding to the winning role stops at an effective position visible from the display window;
In the gaming machine provided with a privilege granting means for granting a privilege as a winning establishment, when the winning design stops at the effective position forming a predetermined combination,
A correspondence storage means for storing a correspondence relationship between a plurality of partition regions each partitioning each of the circulating bodies in the circumferential direction, and a pattern attached to each partition region;
When the stop operation means is operated and a stop command is generated, a reaching section area grasping means for grasping a reaching section area that has reached a predetermined specified position among each section area of the corresponding circulating body,
When the stop command is generated, based on the grasping result of the reaching compartment area grasping means, stop compartment area determining means for deciding a stop compartment area to be stopped at the specified position among the respective compartment areas of the corresponding circulating body; ,
Stop information deriving means for deriving stop information to be used when stopping a circulating body for which the stop partition area has not been determined, based on a determination result of the stop partition area determining means;
Stop information storage means for storing the stop information,
The stop drive control means performs stop drive control of the corresponding drive means so that the stop partition area determined by the stop partition area determination means stops at the specified position,
The stop information deriving means is based on a determination result of the stop partition area determining means, and at least one stop partition area is not determined from when the stop command is generated until the next stop command is generated. Deriving stop information of all partitioned areas for each rotating area,
The stop section area determining means is
When a stop command is generated after the stop information deriving means derives the stop information, an arrival that can reach the specified position within a predetermined specified period based on the grasping result of the reaching section area grasping means Reachable partition area grasping means for grasping the possible partition area;
Comparison determination means for comparing and determining all the stop information of the reachable partition area and the reachable partition area stored in the stop information storage means,
Based on the determination result of the comparison determination means, comprising a stop partition area deriving means for deriving the stop partition area,
The stop information deriving means, when at least the lottery result of the lottery means is the first result, when the stop operation means is operated in a predetermined operation order, the first pattern corresponding to the first role is In order to stop at the effective position, when the stop operation means is operated in an operation order other than the predetermined operation order, a priority is set for each partition area so that the first picture does not stop at the effective position. A priority deriving means for deriving,
Provide a priority preparation information group that defines priority preparation information for deriving the priority for each partition area,
The stop information storage means is provided with a priority storage area for storing priority information indicating the derivation result of the priority derivation means ,
The stop drive control means controls the drive means to stop drive so that the corresponding rotating body stops until a predetermined specified period elapses after the stop command is generated, and the stop information derivation means Terminates the derivation of the stop information during the specified period .

Images