# dyang12/Knights-Travails

> Use tree data structure to find the path of a knight on a chess board from a starting position to an ending position

- **Canonical URL**: https://githubrepo.cloud/repo/dyang12/Knights-Travails
- **GitHub Repository**: https://github.com/dyang12/Knights-Travails
- **Maintainer / Creator**: https://github.com/dyang12
- **Discovered On**: Sep 29, 2026

---
*Indexed by GitHubRepo (https://githubrepo.cloud). Real-time open-source discovery & telemetry.*
