

Report as inappropriate.
Uses recursive backtracking with the Warnsdorff heuristic to solve the Knight's Tour problem
3615 views / 17 in the last 7 days
2 votes | 0 in the last 7 days
Visit the web page for this scenario.
Want to leave a comment? You must first log in, and be a member for more than a week.
No Comments