The Proof of Concept

Posted on 30 November 2017 in Schroedinger-Chess

This is the third in a series of posts detailing Haft Schroedinger Chess. In this post I briefly review the Proof of Concept Github project which demonstrates key concepts discussed in the other two articles.

Proof of Concept

The Proof of Concept:

  1. Is written in Java
  2. Builds using Maven
  3. Does not have any AI, rather it showcases a constraint satisfaction problem solver that can determine move legality
  4. Does not have check
  5. Is missing many ‘edge’ case rules from chess like enpassant and piece promotion
  6. Does not have an optimized CSP solver; the revelation about domain retricting came after it was written, and I never got around to updating it

Go have a look!