Step 5 - alternate between three places

Hello

I hava a system that should sort pieces to three different places (today it is only alternating between two). One output sends the piece to place 1, next output to place 2, etc.

If one of the places is disabled it should only alternate between the other two, and if two is disabled it should only send to one place. If all three is disabled nothing will happen until one is avalible.

Is there any standard way to do this? or any other examples that you could look at and modify?

Best regards

who it would sort ? first peace in first place second peace and so on ?

if so u have two alternatives , either using shift instruction , u will have only bit set in byte and it will shift if peace was in place or the position disabled.



the second method , altough may look more difficult , but will be more accurate is to use a fifo table

Yes I want to sort something like that.

I am not used to work with shift instruction, at least not in step 5. I have looked at it a little bit in step 7.

But I have now written down a instruction that I think will work. I have only simulated it so far, but I will test it soon on the machine.

I have used some jump instructions, and standard logic. Its probably not the best looking program, but at least its simple for my three stations.