Github: Knight’s Tour
Knight’s Tour problem solver. Finding a sequence of moves where the knight visits every square on a chessboard exactly once. Uses backtracking and Warnsdorff’s heuristic.
Backlinks (2)
1. Github /roam/github/
My GitHub repositories.
Public
- 100 Days Go
- 100 Days JS
- 100 Days Python
- 10K Hours AI/ML/DL
- 64 Days Lua
- Advanced Algorithms
- Anki TikZ
- Arcade
- Bananagrams
- Bookshelf
- Bots
- Bytelocker.el
- Bytelocker.nvim
- Classical CS
- Clip
- CS Projects
- Dotfiles
- Dynamic Programming
- Font2Splines
- Full Stack Chatbot
- Game of Life
- GitHub Pages Site
- GitHub Profile README
- Globe
- Hashi
- Icons
- Keychron
- Knight’s Tour
- LaTeX
- Ledger
- LeetCode
- Math
- Math Map
- Microburbs
- Orgro
- Sedgewick Algorithms in C
- Sydney Train Game
- TikZJax
- Timeline
- Tools
- Trades
- Typing Telemetry
- Ultimate Tic-Tac-Toe
- Draw
- TODO Portfolio
- Jobs