Can chess moves be verified on-chain? — The answer is zero-knowledge proofs

Zero-knowledge proofs enable proving a chess move's legality or a game's end in checkmate without disclosing the moves themselves. Several hackathon projects and research efforts have developed versions of this concept, including zkautochess, ZeroKing, a play-by-email zkChess referee, and general-purpose frameworks like ZkNoid. These developments showcase the potential of applying zero-knowledge proofs to chess, a game of perfect information, in the context of blockchain technology.

However, there are limitations to what these proofs can accomplish. Proving circuits are expensive due to chess's complex rule set, and no proof can prevent someone from secretly consulting an engine before making a move. Despite these challenges, zero-knowledge proofs offer an intriguing intersection between chess and blockchain, potentially enabling trustless and serverless games.