News for hackers. Stuff that matters.
Re:Students at Berlin University Build Chess Game on Ethereum by AstralStorm on Tuesday September 06, 2016 @10:06PM (#12440574)
It is a highly constrained search though. You need to verify moves against the piece that is checking only and then verify if the move potentially preventing the check does not discover another check.

Even easier in case of double checks, since you exclude captures.

Verifying a tie or mate due to repetition is more tricky for a usual test, but not if you hash the whole board state.

There are no comments on this comment yet.