<@U6P03BM0W> Nope, it just hangs if I put a 0 in t...

# advent-of-code

[andyb]

@dave08 Nope, it just hangs if I put a 0 in there

[dave08]

I don't know your input (I should maybe start w/ advent of code.. but I still enjoy seeing these solutions... simple smile ), but I guess one would have to have a limited or unlimited capacity. The idea is that the reciever machine runs until either reaching a send or a recieve and then suspends until the other one recieves or sends respectively, and same thing vise-versa... this is all if at least one reaches send and the other receive... if both reach send or both reach receive they both wait for each other to do the opposite and it hangs...

On the other hand, if you make both unlimited, there'll be a buffer for all sends until all of them are received by the other... so itll never time out while suspending, it just wont suspend.

So you really need to find a 'juste millieu' (in the middle) value for the buffers that are the logical amount of instructions that will pass the race condition of two sends or receives (but on the receive end you have a timeout, so the race should just cancel everything...)

I hope this clears up things at helps you guys for the other excercises 😃