Knights Tour Mobile Robot
Solving the classic mathematical puzzle through FPGA-driven robotics.
The Challenge
The project began with a fundamental question: Can we design a physical system capable of solving the complex "Knights Tour" algorithm in real-time? Our goal was to develop a SystemVerilog-based design that would allow a mobile robot to traverse a standard chessboard, visiting every single square exactly once, regardless of where it started.
Working in a team of five, we navigated the intersection of logic design and physical locomotion. The complexity lay in the verification. Ensuring that the hardware logic was bulletproof before it ever touched the physical FPGA. This led to a robust development cycle where simulation and hardware synthesis had to work in perfect harmony.
The journey culminated in a successful hardware demonstration, where the design was synthesized for an Altera Cyclone-IV FPGA. Watching the robot accurately navigate the grid was the ultimate validation of our design and verification architecture.
Core Requirements
- ✔ Complete board coverage (64 squares).
- ✔ Start-position independence.
- ✔ Real-time path calculation on FPGA hardware.
- ✔ High-fidelity simulation for logic verification.
The Tech Stack
My Engineering Contributions
Design & Verification
Designed comprehensive testbenches and integrated Python scripts for advanced simulation control.
Analysis & Automation
Built systems for waveform analysis, automated log collection, and file management to streamline debugging.
Hardware Synthesis
Led the synthesis process for real-world implementation on the Altera Cyclone-IV FPGA.
Collaboration
Led a team of five to ensure hardware-software parity and project success.