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.