  In this paper, some new criteria for detecting whether a finite game is
potential are proposed by solving potential equations. The verification
equations with the minimal number for checking a potential game are obtained
for the first time. Some connections between the potential equations and the
existing characterizations of potential games are established. It is revealed
that a finite game is potential if and only if its every bi-matrix sub-game is
potential.
