JPH0772917B2 - Coin processor - Google Patents

Description

TECHNICAL FIELD The present invention relates to a coin processing device.

The term "coin" refers to genuine coins as well as private coins, slags and other articles having similar shapes and / or dimensions to genuine coins.

BACKGROUND OF THE INVENTION The present invention is particularly applicable to coin processing devices that include coin storage means, particularly means for storing and paying for one or more specific unit (denomination) coins. This kind of means is usually provided for the purpose of receiving coins from a validator and paying the coins as change in, for example, a vending machine, a game machine, and a machine simply for exchange.

A conventional coin processing device incorporating several coin storage containers decides whether the received coins should be sent to a common coin box, or different units of coins should be sent to each container and to a sorting device. It has a single gate. However, in some cases, it is desirable to first classify the coins, and separately provide each coin container with a gate for controlling whether a specific unit of coins is delivered to the container or to a sub path leading to the coin box. Such a configuration is particularly useful when a unit or all units of coins have individual coin boxes for storing coins exceeding the storage capacity of each coin container.

There is another reason to gate after coin sorting. For example, if the number of coins is large and it takes time to sort the coins, and the coin has passed through the gate, the control circuit detects that the container is empty and tries to introduce the coin. However, if there is another coin in the classifier at the time of detection, the container will receive two coins and there is a risk of overfilling.

Therefore, it is desirable to provide a separate gate for each container. However, this is quite expensive (mostly gate actuators).

On the other hand, if common gates are installed on multiple containers and a single actuator is used to operate the common gate, there is no problem if coins arrive at the gate one after another at long time intervals, but common at short time intervals. If the coins come to the gate one after another, the common operation gate moves to the first position and the next coin moves the gate to the second position while passing through the gate. In some cases, the coins inside are narrowed by the gate and cause jamming.

SUMMARY OF THE INVENTION It is an object of the present invention to provide a common operating gate control method in which a common operating gate for a plurality of coin containers does not cause jamming even when coins arrive at the gate at short time intervals. .

A coin processing device according to the present invention is a coin processing device each including a plurality of supply paths for supplying coins to a first path or a second path, each supply path having a gate and a first gate.
A coin processing device adapted to guide coins from the supply path to the first path or the second path, depending on whether it is in the second position or the second position; And a common state for the gate having a second state in which all of the gates are in the second position, and in response to each of acceptance of coins continuously put into the processing device, The control means determines a state to be taken by the common actuator according to the type, and controls the supply actuator to the decided state. Even if the subsequent coins would normally determine that the common actuator should assume the first state after determining that A means for maintaining the common actuator in the second state is provided for a predetermined period required to be guided to the second path through the first path, and the first path is provided in a coin storage container for storing coins having a specific face value. The second path is for guiding coins to a coin box for storing coins when the coin storage container is full.

Embodiments Next, embodiments of the present invention will be described with reference to the accompanying drawings.

As shown in FIGS. 1 and 2, the coin processing device 100 is
It comprises a validator 102, a classifier 104 and a coin storage assembly 106.

The validator receives coins through the hopper 108 and the inspection station 110
Check the validity with a coil in. In this embodiment, the device has five different coins, namely A, B, C, D and E.
And F are processed, of which type B is a coin-like substitute.

When the inserted coin is found to be acceptable, the acceptance gate 112 opens and the coin enters the main entry path 114 of the classifier 104. The coins are sent to the classifier 104 in the manner described in detail below and further delivered to the appropriate one of the seven inlets of the coin storage assembly 106. On the contrary, when the confirmer 102 confirms that the inserted coin is inappropriate, the receiving gate 112 does not open, and the rejected coin is delivered to another entrance of the coin storing assembly 106 through the passage 116. The path followed by each coin A to E and the reject coin F is shown in FIGS. 1 and 2.

3 and 4 are detailed views of the coin storage assembly 106.

The coins to be stored in the assembly 106 are delivered via each supply path 4 of the classifier 104.

A plurality of assemblies 106 in this embodiment (four in this case)
The storage unit 6 of FIG. Each unit 6 has a storage space 8 for storing the pile 10 of coins received from the supply path 4, a sub path 12 for receiving coins from the supply path 4, and an additional path 14.

The coins piled up in the storage space 8 are paid one by one by a payment mechanism indicated by reference numeral 16.

The coins from the supply path 4 are normally delivered to the storage space 8, but when they are full, they are delivered to the sub path 12 leading to the coin box.
In the preferred embodiment, the secondary path 12 leads to each coin box. Gate 18
Is the destination of the coins received from the supply path 4 (storage space 8
Alternatively, determine the alternative route 12).

The additional path 14 receives coins from the path 20 of each classifier. These coins are not in the desired unit and are sent to each coin box or the common coin box via the additional path 14. The additional path 14 of a unit 6 is used for this purpose, that is, for sending the coin F rejected by the validator 102 to the exit hole for the user to search. Therefore, the classifier 20 has the passage 11 of FIG.
Equivalent to 6.

Each unit 6 is divided into two in the longitudinal direction. FIG. 4 shows the left half thereof. Each half is formed by injection molding.

The storage space 8 has a cylindrical shape, and has a diameter slightly longer than coins to be stacked.

Coins pass from the supply channel 4 through the entrance 22 to the storage space 8
To reach. The inlet 22 is formed by a narrow space 24 between the wall portion 26 of the classifier 104 and the shelf 28 at the upper end of the storage unit inner wall 30. The space 24 has such a shape and size that the coin can pass only when traveling with its edge facing forward.

When the pile 10 of coins reaches a certain level (depending on the diameter of the coin) (see FIG. 4), the next coin 50 to be delivered through the inlet 22 is supported by the rack 28 at the upper edge. It will come into contact with the top of the mountain in the closed state.

Although the coin 50 is almost vertical, it is supported with its center of gravity inclined over the entire mountain 10. Storage unit outer wall
The flat upper edge 54 of 56 is inclined inward and serves to guide the coin 50 into the orientation as described above. The induction sensor 52 is mounted in the vicinity of the coin 50 surface in the classifier and detects the presence or absence of the coin 50 which indicates that the storage space 8 is full. Reliable because the position is predetermined by the shape of the inlet 22 which cooperates with the peak 10.

When coins are paid from the mountain 10 and the top of the mountain descends by a distance corresponding to the thickness of the coin, the upper edge of the coin 50 is no longer supported by the rack 28 and falls toward the mountain top. Therefore, the sensor 52 indicates that the space 8 has a space.

As shown in FIG. 3, the gates 18 of the four storage units 6 are mechanically connected to each other and are practically integrally formed.
The gate has a common actuator (solenoid 60).

The gate turns around a common axis 62 near the top edge. When the solenoid 60 is deenergized, the gate 18 is in the position shown by the phantom line in FIG. 4, and when it is in this position, the coins from the supply path 4 are not blocked, so all the coins are in the respective sub paths 12. To fall.

When the solenoid 60 is energized, the gate moves to the position shown by the solid line in FIG. 4, so that the coin is biased toward the entrance of the storage space 8.

The present apparatus operates so that coins that should originally enter the storage space 8 reach the gate 18 while the gate moves away from the position indicated by the solid line in FIG. Depending on the exact time when the coin reaches the gate, it can be biased to the entrance of the storage space 8 or entered into the sub path 12. It can also be brought into contact with the top of the shelf 28 of the wall 30, but in this case the sonorade
At the next energization of 60, the gate 18 knocks the coin to the storage space 8 (the original destination of the coin). Therefore, the storage space 8 is not jammed or overloaded.

As shown in FIGS. 1 and 2, the coins A to E and the reject coin F follow various routes. As above, coin A
Through E pass through the acceptance gate 112 and reach the main approach path 114 of the classifier 104. At that time, the coins are timed by the output, "post gate strobe (post gat
e strobu) through a detector 120.

The classifier 104 has a path gate 122 that remains closed if the incoming coin is A or B type. This causes these coins to roll down the upper ramp 124 of the classifier 104. Since the ramp 124 has a lot that allows only coins B to pass through, the coins A and B are sorted and sent to each storage unit 6. Each coin A and B enters the storage space 8 or the sub path 12 depending on the position of each gate 18.

Gate 122 if incoming coin is C, D or E type
Opens so that the coins fall into the lower ramp 126. The ramp side window and bottom slot sort coins C, D and E. The coins D and E not required for payment are guided to the additional path 14 of each unit 6 and delivered to one or more coin boxes. The coin C is guided to the gate 18 above the storage unit 6 and sent to the storage space 8 or the sub path 12.

The rejected coin F is the additional path 14 of the unused coin storage unit 6.
Sent to.

FIG. 5 is a schematic circuit diagram of the coin processing device. The circuit includes a control device 200 and a coin confirmation circuit 202. The control device 200 includes a microprocessor 204 such as a master program organization type Intel 804 type, which is connected to an interface device 212 via an input / output bus 206. The interface 212 receives from the confirmation circuit 202 via line 214 a permission signal Acc indicating that a valid coin has been accepted and a signal indicating whether the coin is A to E, and via line 216. When the permission signal Acc is being transmitted to the confirmation circuit 202, a master prohibition signal M1 for terminating the transmission is sent so that the permission signal Acc cannot be transmitted.

Interface 212 receives signals from post gate strobe detector 120 and payment sensor 218. The payment sensors are mounted below the payment mechanism 16 of the coin storage unit 6 to detect when a coin is paid.

Interface 212 sends a strobe signal via line 220 to energize each sensor 52, shown collectively at 222, and receives via line 224 an output signal indicative of the state of each sensor energized. .

Interface 212 is further connected to gate 18 via line 226.
The solenoid 60 is used to actuate the path gate 122 using the solenoid. These solenoids are collectively shown at 228.

In this particular embodiment, interface 212 has permission signal A
It also serves to energize the solenoid 230 of the gate 112 in response to cc.

The coin processing device is installed in a host machine (a game machine in this case) to which a circuit is connected via an output line 232 and an input line 234. The output line 232 sends various information to the host machine, which also includes information indicating the type of coins accepted by the device, which can be used to accumulate the user's credit count. Further, "diagnosis" information is also included, which will be described later.

The input line 234 sends a signal prohibiting the acceptance of any one of the five coins A to E. Such host machine bans are desirable in certain situations. For example, when there is a shortage of low-value coins for change, acceptance of high-value coins can be prohibited.

The rotation operation will be described. The techniques presented here are examples of various techniques that may be readily implemented by those familiar with microprocessor control circuits. Further, a wiring logic circuit or a specially designed LSI can be used in place of the general-purpose microprocessor programmed for this specific purpose.

6 and 7 are a main program loop and timing chart of the microprocessor 204, respectively.

FIG. 7 shows the overall operation of the circuit when accepting valid coins. However, this chart applies when one coin passes through the processor and when a coin seeks actuation of the path gate 122 and the bias gate 18.

The confirmation circuit 202 is similar to that described in German Patent Publication No. 2093620 and issues a power-up signal PU in response to the arrival of a coin. The power up signal is the coin inspection station 11
Exit when leaving 0. At this time, the verification device determines that the coin is valid as a result of the inspection, and issues an acceptance signal Acc.

Solenoid 230 is energized by the acceptance signal and acceptance gate 1
As the 12 is activated, the coin drops past the detector 120, resulting in the strobe signal STB.

As shown in FIG. 6, the microprocessor 20 is used in this embodiment.
4 operates after input, executes the initialization routine 250, and repeatedly cycles through the main program loop 252.

During the loop 252 cycle, the program steps 254, 258 and 2
At 62, the "state 1", "state 2" and "state 3" flags are sequentially checked, and if either is set, the program routine 256, 260 or 264 is executed. Routine 266 is then executed before re-entry into program loop 252.

If no coins have been inserted, no flags are set and therefore no routine 256, 260 or 264 is executed.

As described below, when delivering accepted coins to the classifier, the interrupt routine starts the "accept" timer by setting various registers depending on the desired path of the coin and setting the status 1 flag. Responds to the signal Acc. Setting the flag causes routine 256 to be executed each time main loop 252 is executed.

During this program section 256, the microprocessor checks the strobe signal STB sent from the detector 120 and resets the state 1 flag and sets the state 2 flag if it finds that the coin is adjacent to the detector 120. . This prevents program section 256 from being entered during the next execution of the main program loop.

If the program section 256 determines that the "accept" timer has timed out before the signal STB indicates the presence of a coin, the reject routine is executed assuming a failure. In this routine, the status 1 flag is cleared, and the master prohibition signal M1 is issued to prevent the confirmer from accepting coins for the time being. Similarly, the microprocessor 204 delivers to the host machine via line 232 a code indicating that the rejection has occurred due to the timeout of the accept timer.

When the coin reaches the detector 120 and the status 2 flag is set, the program section 26 is executed each time the main loop is executed.
It becomes 0. In this section, the master inhibit signal M
Since 1 is issued, the acceptance signal Acc is terminated and coins are not accepted for the time being. Program section 260 also monitors strobe signal STB. During execution of the section, if the strobe signal STB indicates that the coin is not adjacent to the detector 120, the state 2 flag is cleared and the state 3 flag is set.

State 3 program section 264 is executed when the main program loop is executed repeatedly in sequence. During the section, a timer is checked to control the route gate 122 and the bias gate 18. In section 264, a coin output signal indicating the type of accepted coin is sent to the host machine for a predetermined period, and a "block signal" is issued for a predetermined block period.

In addition, the state 3 program section acts to clear the state 3 flag after a predetermined time. Therefore, the subsequent execution of the main program loop reveals that all status flags have been cleared and proceeds to step 266 before recirculation.

The various periods monitored during the state 3 program section 264 are shown in FIG. _{7 as} T ₂ through T ₇ .

Step 266 provides some kind of timer, including a timer to stop the master inhibit signal M1 upon timeout after the period T1 and a timer to time out after the period P1 and activate the path gate 122 if the incoming coin is appropriate. In addition to checking, various "preparation (hous
ekeaping) "task to accomplish the task.

Since the operation of the microprocessor is periodically interrupted at regular intervals, the program flow is temporarily switched to the interrupt routine as shown in FIG. 8 before returning to the main program loop. This interrupt is performed by a timer within microprocessor 204.

The main purpose of the interrupt routine is microprocessor 204
It updates the various storage locations used as timers in the and checks the sensor 218 for acceptance signals from the verification circuit 202.
When it receives Acc, it executes the coin acceptance program routine.

At step 300, at the start of the interrupt routine, various timers are updated and only one sensor 52 is checked. The sensors 52 are sequentially checked one by one each time the interrupt routine is executed.

In step 301, the program checks the presence of the Acc signal, and if not present, terminates the interrupt routine. Otherwise, the process proceeds to step 302 and the status 1 flag is checked. Step if the flag is not set
Proceed to the coin acceptance routine starting at 303.

In step 303, the coin data indicating the type of accepted coin sent from the confirmation device is checked and the type of coin is displayed.

After that, the process proceeds to steps 304, 305, 306, and 308 sequentially, and various conditions are checked at each step, and whether the entry into the main reject coin path 310 is good or bad is determined accordingly.

For example, in step 304, the microprocessor checks for coin detection by the detector 120. This does not occur under normal operation. Therefore, if a coin is detected, it is determined that a failure has occurred, and the process proceeds to the reject path 310 to prevent the coin from being accepted.

In steps 305 and 306, the program checks for the presence or absence of an external inhibit signal or an internally generated inhibit signal from the host machine, and if there is a signal, proceeds to the reject path 310.

In step 308, the data representing the type of coin is compared with the previously stored block code, which is performed by logically combining the code representing the type of coin and the block code. The program either enters reject path 310 or proceeds to block 312 depending on the result of the logical comparison. The details of step 308 will be described below.

At block 312, the program starts an acceptance timer. The program then proceeds to step 314 which determines if the incoming coin is D-type or E-type. The D-type or E-type coin is sent to the additional path 14 of the coin storage unit 6. If the coin is one of these types, proceed to step 316, store a signal indicating that the normally open path gate 122 and bias gate 18 do not need to be activated, and use coin data indicating the type of coin. The code is stored, the "block code" associated with the coin is searched for in the table, and the block code is stored for use in subsequent executions of step 308, ie, in the verification circuit 202 in accepting the coin. As shown in FIG.
These codes are finally cleared at the end of the block period.

If the coin is not the D or E type, the process proceeds from step 314 to step 318, it is determined whether or not the storage space 8 of the coin (A, B or C type) is full, and if it is full, the process proceeds to step 320. Step 320, like step 316, maintains biasing gate 18 in the first position, except that path gate 122 is actuated depending on whether the coin is C-shaped. If it is not of type C, the gate 122 must be activated and the program starts a timer for timing the period P1 shown in FIG.

If the storage space 8 is not full, as indicated by the output of each sensor 52, the process proceeds from step 318 to step 322.

In step 322, each of the sub-paths through which the A, B or C type coin leads to the coin box, using the previously accepted coin data code.
It is determined whether or not the route is currently being routed to 12. As mentioned above, this code is automatically cleared after a certain period of time, so only when the subsequent coin arrives within the predetermined period when the preceding coin is led to the coin box, You get the answer.

If the preceding coins of type A, B or C are not currently routed to the sub paths 12 leading to the coin box, the process proceeds to step 324. In step 324, incoming coins are properly inserted into the coin storage tube 8
Similar to step 320 except that it is desired to direct the program to the program so that the program takes action to put gate 18 in the first state.

On the other hand, if it is confirmed that the A, B, or C type coin is currently being routed to each sub route leading to the coin box, the program proceeds from step 322 to 326, and the preceding coin is the same type as the arrived coin. Determine whether or not.

That is, the process proceeds to step 326 under either of the following two conditions.

(1) When the preceding coin is of the same type as the succeeding coin, it means that the preceding coin is directed to the sub path 12 although the storage space 8 has a vacancy. That is, step 32
This is because it is determined in 2 that the preceding coin is being routed to the sub route 12. This is a sensor
This is the case where the previous coin passing through 52 gives a temporary erroneous indication that the storage space 8 is full. In such a situation, the subsequent coin is originally delivered to the storage space 8. However, when the succeeding coin arrives during the predetermined period of the preceding coin, as shown by the solid line in FIG.
There is no time to move 18 from the second position to the first position. Therefore, the program proceeds from the step 326 to the reject path 310 of the program flow, rejects the coin and secures a sufficient time required to move the bias gate, and also performs a malfunction check in the step 334.

(2) If the subsequent coin is different from the coin in the path to the secondary path that currently leads to the coin box, the program proceeds from step 326 to step 3
Proceeding to 20, even if the storage space 8 is not full, this subsequent coin is delivered to the coin box via the sub route 12. This is because there is space in the coin storage space 8, but it is necessary to operate the biasing gate 18 in order to deliver it to the storage space, and as a result, it interferes with the path of the preceding coin to go to the sub route 12 as described above. Because there is a fear. In order to avoid this, the money box route is given priority.

After leaving step 316, 320 or 324, the program proceeds to step 330 and sets the "state 1 flag. Setting the state 1 flag causes another coin to generate a new acceptance signal Acc. Until it is reset at step 256 in the figure, the coin acceptance routine starting at step 303 cannot be entered.

The program proceeds from the reject path 310 to step 334, which results in the microprocessor issuing a master inhibit signal for a predetermined period of time to prevent the acceptance of coins during that time, and
The gate operation is confirmed, the register storing the coin code and the block code is cleared, and the code indicating the reason for refusal is output to the line 232. For that, the main reject route 310
Before reaching, the code is stored in the register as appropriate, which is done in any of steps R1 to R5 depending on the reason for the refusal.

As shown in FIG. 7, the confirmation circuit 202 is configured not to accept another coin until the leading edge of the strobe signal STB when the acceptance of the incoming coin is confirmed. The control device 200 prevents the circuit from inspecting another coin during the master inhibit signal M1.

After that, a period B1 from the end of the prohibition signal M1 to the end of the block period signal continues, during which coins can be accepted. Therefore, another acceptance signal Acc may be generated during the period B1, and as a result, the state 1, the state 2 and the state 3 are further entered.

When the coin is accepted and available until the end of the block period, the microprocessor 204 stores the block code and the coin data code for that particular coin.
The coin data code is a 5-bit code having a 1-bit set corresponding to the type of coin. For example, A-type coin is represented by coin data 00001 and B-type coin is 000.
Represented by 10.

The block code is also 5 bits and represents a specific coin type. The block code is determined for a specific coin according to the configuration of the classifier. After accepting the coin, the coin processing by the classifier becomes very fast, the bits in the block code corresponding to these coins are reset and the remaining bits are set.

For example, the data code of C-type coin is 00100, but C
When the type coins are processed by the classifier 104, the processing of D-type or E-type coins is very fast. This is both gate 12
This is because the operation of 2 or the gate 18 is not required. Therefore, the block code of the coin C is 00011, which means that after the processing of the coin, the processing of coins other than the A and B types can be performed quickly.

The block code of the coin previously received in step 308 of the state 1 routine is ANDed with the coin code of the newly arrived coin, and the result is zero (for example, coin C is followed by coin C, D or E). ), The process proceeds to step 312, and if it is not zero, it indicates that the subsequent coin is not a type that can be processed quickly, and thus the main reject path 310
Proceed to.

The block code of coins A and B is 11100.
When the preceding coin is A, the block code is 11100
And subsequent coins A and B coin code 00001 and 00010
AND operation is zero, and the subsequent AND operation with coin codes 00100, 01000 and 10000 of C, D and E is non-zero. Therefore, in the case of the preceding coin A, for the coins A and B that follow within the period B1, the process proceeds from step 308 to step 312 so that the gate 112 is opened and passed to the separator, and for the coins C, D and E, the gates are opened. Proceed to main reject route 310 to close 112. At the end of the period B1, the block code is cleared to zero and the process proceeds to step 308. Since the AND operation results in zero, the process proceeds to step 312.

That is, another coin cannot be accepted before the period B1. During the period B1, only coins selected according to the type of coins already accepted are delivered to the classifier, and after the period B1, any coins are accepted and delivered to the classifier.

When coins are delivered to the classifier during the period B1, the block period shown in FIG. 7 is restarted. Therefore, as long as coins are sent out quickly and sequentially, the block period lasts.

If the period B1 is sufficiently longer than the period before the delivery to the classifier is blocked, the third coin may be delivered during the period B1 set by the first coin. That is, before the period B1 set by the first coin elapses, the second coin may arrive and set its own period B1, and the third coin may arrive and be delivered to the classifier. .

In such a case, a problem arises because the path of the third coin obstructs the path of the first coin passing through the classifier. It is desirable to avoid these problems. This is because the period B1 is started earlier and the maximum coin processing speed is increased.
In the present embodiment, each time the block code is stored, it is configured to be ORed with the currently stored block code to avoid the above problem.

Therefore, in the above situation, the block code of the first coin and the second coin is OR-operated, and the obtained code is subjected to step 308.
Then, it is compared with the coin data code of the third coin. By doing so, the third coin can be delivered to the classifier only when the path of the third coin does not obstruct the path of the first and second coins.

In the above arrangement, step 266 of FIG. 6 is repeatedly executed before and during the periods of state 1, state 2 and state 3, so that the decisions made during these program sections are made in the main program loop. Can be changed during subsequent runs. This is especially important in that the path of the coin can be changed in response to changes in the current state of the device. For example, program step 266 includes a routine to check the status of sensor 52. If the storage space 8 receives a specific coin that fills it up, and if it has just received the same type of coin, the initial decision to deliver the coin to the storage space is delivered to the coin box. You can change it to

[Brief description of drawings]

FIG. 1 is a schematic front view of a coin processing device according to the present invention. FIG. 2 is a schematic cross-sectional view taken along the line II-II in FIG. FIG. 3 is a schematic perspective view of the coin storage assembly of the present device. FIG. 4 is a longitudinal side view of the coin storage assembly unit. FIG. 5 is a block diagram of a coin processing device circuit. FIG. 6 and FIG. 7 are a flow chart and a timing diagram, respectively, for explaining the main program loop executed by the circuit microprocessor. 8 and 9 are flow charts for explaining the interrupt routine executed by the microprocessor. [Explanation of symbols of main parts] 4 …… Supply path 6 …… Storage unit 12 …… Sub path 14 …… Additional path 18 …… Gate 52 …… Sensor 60 …… Solenoid 100 …… Coin processor 102 …… Confirmer 104 …… Classifier 106 …… Coin storage assembly 112 …… Acceptance gate 116 …… Rejection path 120 …… Detector 200 …… Control unit 202 …… Coin confirmation circuit 204 …… Microprocessor

Front Page Continuation (72) Inventor Peter Reginald Johnson United Kingdom. Berkshire, AR G 34 Elke, Reading, Tylhurst, Won Quadlord 54 (72) Inventor Peter Maurice Stallwood England. Buckinghamshire, Mallow Bottom, Mountain Esch 7 (72) Inventor Kim Thomas UK. Berkshire, Throw, Circle By Close 51

Claims (3)

[Claims] 1. A coin processing device, each comprising a plurality of supply paths (4) for supplying coins to a first path (24) or a second path (12), each supply path having a gate. In a coin processing device configured to guide coins from the supply path to the first path or the second path depending on whether the gate is in the first or second position, all of the gates are A common actuator (60) for the gate having a first state in which the gate is in the first position and a second state in which all of the gates are in the second position, and coins continuously inserted into the processing device. A control means (20) for determining a state to be taken by the common actuator according to the type of the coin in response to each acceptance, and controlling the supply actuator in the decided state. , The common actuator for the preceding coin Even if the subsequent coins would normally make the decision to take the first state of the common actuator after deciding the state that the data should take as the second state,
Means are provided for maintaining the common actuator in the second state for a predetermined period of time required for the preceding coin to be guided to the second path through the gate, and the first path is a coin having a specific face value. A coin processing device for guiding coins to a coin storage container for storing coins, and the second path for guiding the coins to a coin box for storing coins when the coin storage container is full. 2. The coin processing device according to claim 1, wherein the coin storage container is for payment of coins. 3. The coin processing device according to claim 1 or 2, wherein the control means determines a state to be taken by the common actuator for the preceding coin as the first state. , It is possible to determine that the second state of the common actuator should be taken by the subsequent coin even within the predetermined period,
A coin processing apparatus comprising means for switching the common actuator to a second state based on the determination.