3 ms·
There are also some really obscure rules that came about to prevent what you might call exploits. For example, it had to be clarified that you’re not allowed to
by mikeash 9y ago
There are also some really obscure rules that came about to prevent what you might call exploits. For example, it had to be clarified that you’re not allowed to castle vertically (this could happen if you promoted the king’s pawn to a rook) and that you’re not allowed to promote pawns to a piece of your opponent’s color.
A perfect chess implementation from before those rule changes would no longer be correct!
It’s possible to prove that code perfectly implements a formal spec. It’s tough to prove that the formal spec perfectly describes what you want it to describe.
- AstralStorm 9y agoActually easy. With any automated theorem prover you will get requests for additional proofs if any ambiguity or missing info is detected. This is a very strong if. It means the rule cannot be reduced in plain logic. The example of forward castling rule is a good one. A missing definition of some en passant situations is caught too. (E.g. situations of check.) Completely missing rule cannot be caught with these techniques. You also need to ask the prover right questions. Say: when does a chess game end. Proof requires proving the existence of a halting Oracle for any game state. Not quite easy but possible. To actually verify, you will have to provide reduction rules unless you happen to own a supercluster.
- mikeash 9y agoHow would that work? In the cases I mentioned, the rules weren’t ambiguous, they just didn’t say what most people thought they said.