This repository provides a tree-based framework for solving the Knight's Tour problem using various tree search algorithms, including BFS, DFS, DFS-H1B, and DFS-H2, along with their heuristics. The Knight's Tour problem is a classic combinatorial puzzle in which a knight on a chessboard must visit every square exactly once.
active 2024-12-19 → 2025-02-22 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 66 days from 2024-12-19 to 2025-02-22. Pushes: 2 total, peak 1 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 1 total, peak 1 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| Pirate-960 | 2 | 2 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 1 stars here means stars gained during the window, not the repo's star count.