Chess_Knight_Paths is a Python project that finds all minimum-length sequences for a knight to move from a starting cell to an ending cell on an empty chessboard. It accepts positions in algebraic notation, prompts user input, and generates visualizations of the paths in DOT, PDF, PNG, and GIF formats, including animations of the knight's movement.
active 2024-11-14 → 2024-11-15 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 2 days from 2024-11-14 to 2024-11-15. Pushes: 13 total, peak 7 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: 0 total, peak 0 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 |
|---|---|---|---|---|
| AlviRownok | 13 | 13 | 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 — 0 stars here means stars gained during the window, not the repo's star count.