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.
The Proof of Concept:
- Is written in Java
- Builds using Maven
- Does not have any AI, rather it showcases a constraint satisfaction problem solver that can determine move legality
- Does not have check
- Is missing many ‘edge’ case rules from chess like enpassant and piece promotion
- 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!