Be firmer with exceptions/errors on analyzing games with imperfect recall.

Most Nash equilibrium computation algorithms, and our implementation of
reduced strategic forms (and mixed strategies) on extensive games,
depend on the assumption that the game is of perfect recall.

This implements a number of checks (and corresponding raised exceptions)
which rule out taking actions where incorrect or misleading results
could occur by trying to apply these methods to games without perfect
recall.