A modern take on the classic game of Dots and Boxes
-
Updated
Jan 7, 2018 - Java
A modern take on the classic game of Dots and Boxes
This maze solver is based on the Dijkstra algorithm. Each free cell being considered as a node, and each full cell being considered as a node located at infinite distance from all empty cells. The entire algorithm (including the 10 extras) has been hand-coded in Java, with an object-oriented method including a very rigorous architecture.
Add a description, image, and links to the boxes topic page so that developers can more easily learn about it.
To associate your repository with the boxes topic, visit your repo's landing page and select "manage topics."