https://github.com/pandh4cker/knight-s-tour

Knight's Tour Problem
https://github.com/pandh4cker/knight-s-tour

c chess depth-first-search dfs dijkstra dijkstra-algorithm dijkstra-shortest-path graph graph-theory graphs knight knight-problem knight-tour knights-tour

Last synced: 4 months ago
JSON representation

Knight's Tour Problem

• Host: GitHub
• URL: https://github.com/pandh4cker/knight-s-tour
• Owner: PandH4cker
• License: mit
• Created: 2019-05-05T19:38:42.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2019-09-04T06:57:13.000Z (almost 6 years ago)
• Last Synced: 2025-01-18T02:21:55.443Z (5 months ago)
• Topics: c, chess, depth-first-search, dfs, dijkstra, dijkstra-algorithm, dijkstra-shortest-path, graph, graph-theory, graphs, knight, knight-problem, knight-tour, knights-tour
• Language: C
• Homepage:
• Size: 10.7 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Knight's Tour using Graph Theory and Depth First Search

---

## Authors: Raphael Dray.

---

> This program can:

> 1. Print the graph of knight's moves

> 2. Calculate the shortest path between two positions

> 3. Print optimal zone

> 4. Find the max minimal distance

> 5. Perform a knight's tour from a position given

> It's written in __C language__.

> It's for an engineering school **project C using Graph Theory and Pathfinding**.