- #1

fluidistic

Gold Member

- 3,948

- 263

It's been years I wanted to post this question here. I would like to build a zero knowledge proof that a given chess position contains at least one checkmate. I know that anything provable admits a zero k proof. I know about https://crypto.stackexchange.com/questions/110939/zero-knowledge-proof-applied-to-a-chess-position and .

I know it's been done already (see https://github.com/risc0/risc0/tree/main/examples/chess):

But I would like to understand exactly how to do so, every single step. There are other ways to accomplish it. I think I should be able to transform the problem into a graph/map with 3 colors scheme. I.e. if I can convince the Verifier that I can color the map with 3 colors such that no 2 colors are adjacent, then the proof would be complete. The hard part I don't know how to do is to apply an algorithm to transform a given FEN (or chess position) into such a graph. For example, this position

Code:

`6Q1/8/8/8/8/8/5K2/7k w - - 0 1`