Hi! I'm working on a game where people have to accumulate groups of items. For the time being, suppose we have a Scrabble tile distribution and the objects are letters.
One player has to get one of the following three words: FIX, BOX, or JUNK. He sees that one of his opponents has the X and the J. He is allowed to ask for a trade to get the J or X. Remember that there is only one X in the game and one J.
Clearly, he is right to ask for a trade as he'll need one of those two letters to proceed. However, how can I set up the rules to indicate that the opponent HAS to trade with him to prevent him from being blocked? Although in general people can decline trades, such a trade CANNOT be refused by the person with the J and X. There is absolutely no way he can win the game unless the opponent deals with him.
The tricky part is that the opponent has no idea which words the blocked player is trying to form, and therefore has no idea that the other player is blocked!
How do other games handle this?
Thanks in advance,
ACG
There's already a limit as to how many pieces the player can have at a time. I figured that would help. However, I'm still figuring that it's still physically possible for the problem to occur during a game (though unlikely).