consider the following variant of rock, paper, scissors (rps) played by two players rei and norman.  the game consists of $3n$ rounds of rps, with the twist being that rei (the restricted player) must use each of rock, paper, and scissors exactly $n$ times during the $3n$ rounds, while norman is allowed to play normally without any restrictions. we show that a certain greedy strategy is the unique optimal strategy for rei in this game, and that norman's expected score is $\theta(\sqrt{n})$.  we also prove several general theorems about semi-restricted games arising from digraphs.  this is joint work with erlang surya, yuanfan wang, ji zeng.