3 ms·
That's not a difficulty. As noted in the post, you can easily solve it through the application of randomness. All you need is for one player to send an unoppose
by thaumasiotes 5y ago
That's not a difficulty. As noted in the post, you can easily solve it through the application of randomness. All you need is for one player to send an unopposed message announcing a color; at that point both players can use that color. There are only two failure states you can be in: both players can be talking, or both players can be waiting for a message. In the first case, one player needs to shut up long enough for the other player to make a choice. In the second case, one player needs to make a choice. A random approach will let these tiebreakers occur in an asymmetric way.
> So maybe you’d have a clause which says, if the other player gives an ultimatum message, then you will go along with that.
But that doesn't work, because both players can send such a message simultaneously, but they can't both comply simultaneously.
- throwaway73838 5y agoYeah, randomness is the only way to break the symmetry problem.