Thinking thinking I've found a solution for create the Chess Robot Invencible. It consists in a Graph of Chip Movement and where the next movement always is the shortest way to get checkmate.
-
Updated
Jun 1, 2017 - Java
Thinking thinking I've found a solution for create the Chess Robot Invencible. It consists in a Graph of Chip Movement and where the next movement always is the shortest way to get checkmate.
Add a description, image, and links to the finding-collaborators topic page so that developers can more easily learn about it.
To associate your repository with the finding-collaborators topic, visit your repo's landing page and select "manage topics."