Knights Tour Backtracking

Overview

Java implementation of Knight's Tour problem using backtracking with Warnsdorff's heuristic. Finds a sequence of moves that visits every square exactly once. Open-source project by Nestor Nuñez Diaz, published on GitHub.

Highlights

• 1 star on GitHub
• 1 fork
• Primary language: Java
• Open source — view the code and contribute on GitHub

Built with

• Java