News for hackers. Stuff that matters.
Re:Full ZX-81 Chess in 1K (1983) by sillysaurus3 on Saturday January 31, 2015 @10:33PM (#8979065)
Well, an instruction set is said to be Turing complete if it can be used to simulate any Turing machine. A single instruction can't, so if you design an instruction set to implement Chess and then don't use it, that's not really the point of the question.

Any ideas about how to better specify the rules of the competition to exclude degenerate answers like the one you provided? The goal is to answer the interesting question. You'd never find such a high-level instruction in a real instruction set, because it wouldn't be useful except to play Chess.

I'd add a rule like "The goal of your instruction set is to be useful while still implementing Chess," but then that would exclude answers which give interesting instruction sets that aren't necessarily useful except in implementing Chess in the fewest possible bytes.

Thanks for pointing out the flaws in my ruleset. I've been toying around with creating a blogpost about this, so having a bulletproof ruleset or at least one that isn't so easily sidestepped would be great.

Re:Full ZX-81 Chess in 1K (1983) by dragonwriter on Saturday January 31, 2015 @10:56PM (#8979113)
> Well, an instruction set is said to be Turing complete if it can be used to simulate any Turing machine. A single instruction can't

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.

Re:Full ZX-81 Chess in 1K (1983) by taejo on Sunday February 01, 2015 @03:43AM (#8979498)
> 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?