The correctness of operations can be checked by using zero-knowledge proofs, so that players don't need to reveal their strategy to verify the game's correctness.
This makes the correspondence between the theory and the implementation highly non-trivial and correctness of implementations can be hard to establish.
Additionally, interactive proof assistants allow mathematicians to develop human-readable proofs which are nonetheless formally verified for correctness.
