Skip to content
#

knight-moves

Star

Here are 3 public repositories matching this topic...

Language: All
Filter by language
All 3 JavaScript 2 C 1

singharyan006 / knights-travails

Star 0

This project explores graph traversal using Breadth-First Search (BFS) to find the shortest path a knight can take on a standard 8×8 chessboard. Each square is treated as a node in an implicit graph, and knight moves represent edges. The goal is to compute the minimum-move path from a starting position to a target square.

javascript algorithms pathfinding data-structures chessboard bfs graph-traversal dsa the-odin-project knight-moves
  • Updated Jul 14, 2025
  • JavaScript

Improve this page

Add a description, image, and links to the knight-moves topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the knight-moves topic, visit your repo's landing page and select "manage topics."

Learn more