We present a game-theoretic foundation for gene regulatory analysis based on the recent formalism of rewriting game theory. Rewrit- ing game theory is discrete and comes with a graph-based framework for understanding compromises and interactions between players and for computing Nash equilibria. The formalism explicitly represents the dy- namics of its Nash equilibria and, therefore, is a suitable foundation for the study of steady states in discrete modelling. We apply the formalism to the discrete analysis of gene regulatory networks introduced by R. Thomas and S. Kauffman. Specifically, we show that their models are specific instances of a C/P game deduced from the K parameter.