> Though the relevant question is whether universal computation can be built on the back of an instruction which plays chess rather than one of the more typical

> Though the relevant question is whether universal computation can be built on the back of an instruction which plays chess rather than one of the more typical bases for a OISC. Well you can have two instructions: SUBLEQ and CHESS. Then it's Turing-complete, and there's a one-bit program that plays chess.