[ghytwgpm] Chess and theoretical computer science

Create a chess problem such that determining who wins is equivalent to simulating a Turing machine (or other Turing-complete system).

Create a chess problem from whose solution may be read off the solution to arbitrary NP-complete problems.

Not exactly problems but tasks. Reductions.

Add features from chess variants as necessary, probably very large boards.