There is a non-empty finite set $\ K,\ $ say, of plates. Initially, there are $\ p_0(k)\ $ stones on the $k$-th plate, where $\ p_0(k)\in\mathbb Z_{_{\ge0}}\ $ for each $\ k\in K.$

So far, it is like a NIM game, and even the moves look similar. Namely, a move amounts to removing a positive number of stones from an arbitrary single plate, i.e. the $\ n$-th move creates a function $\ p_n:K\to\mathbb Z_{_{\ge0}}\ $ such that $\ p_n(k)=p_{n-1}(k)\ $ for every plate $\ k\in K$ but for one plate $\ \kappa_n\in K\ $ for which $\,\ 0\le p_n(\kappa_n)<p_{n-1}(\kappa_n).$

But now, we diverge from NIM games. The game is finished the moment $\ p_n\ $ is a constant function; since then, there are no more legal moves.

In JUSTICE game, the winner is the one who played the last move.

In INJUSTICE, the winner is the first player who cannot make a legal move.

**REMARK** If $\ p_0\ $ is the constant $0$-function then the first payer won INJUSTICE while the second player won JUSTICE.

**Question** Who wins which game (as a function of $\ |K|\ $ and
$\ p_0)?$

After I created the games JUSTICE & INJUSTICE, I posted them on day 2007-06-14, on alt.pl.matematyka:

https://alt.pl.matematyka.narkive.com/Nzi0PiPA/justice-and-injustice-new-games-created-by-wlod-wh