# ShawnOakley/DFS-BFS-Knight-Move-Search

> Tree Node and Binary Tree Node Implementation in Ruby.  Implements Breadth First Search and Depth First Search.  Tests searching by finding all possible sequences of moves by a knight on an infinitely large chessboard.

- **Canonical URL**: https://githubrepo.cloud/repo/ShawnOakley/DFS-BFS-Knight-Move-Search
- **GitHub Repository**: https://github.com/ShawnOakley/DFS-BFS-Knight-Move-Search
- **Maintainer / Creator**: https://github.com/ShawnOakley
- **Discovered On**: Sep 29, 2026

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