> 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.
Re:Full ZX-81 Chess in 1K (1983)
by sillysaurus3 on Saturday January 31, 2015 @11:47PM
(#8979200)
This is awesome. Thank you.
What are some typical bases for OSIC?
Incorrect. A single instruction can be Turing complete.
http://en.wikipedia.org/wiki/One_instruction_set_computer
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.