https://github.com/youssefbennour/knightshortestpath

Display the shortest path for reaching a point(x,y) in an infinitie chess board, stimulating the 'Knight' moves, using graph theory(BFS).
https://github.com/youssefbennour/knightshortestpath

bfs bfs-algorithm chess csharp dotnet knight-problem

Last synced: 8 months ago
JSON representation

Display the shortest path for reaching a point(x,y) in an infinitie chess board, stimulating the 'Knight' moves, using graph theory(BFS).

• Host: GitHub
• URL: https://github.com/youssefbennour/knightshortestpath
• Owner: youssefbennour
• Created: 2022-12-14T15:48:29.000Z (almost 3 years ago)
• Default Branch: master
• Last Pushed: 2024-04-01T21:28:25.000Z (over 1 year ago)
• Last Synced: 2025-01-18T12:14:27.225Z (10 months ago)
• Topics: bfs, bfs-algorithm, chess, csharp, dotnet, knight-problem
• Language: C#
• Homepage:
• Size: 40.3 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Shortest-Knight-Moves

Display the shortest path for reaching a point(x,y) in an infinitie chess board, stimulating the 'Knight' moves, using graph theory and BFS.