This project implements the classic Towers of Hanoi problem using assembly language for the RISC-V architecture.
The Towers of Hanoi problem involves moving a series of disks of different sizes from a source tower to a destination tower, using an auxiliary tower, while following these rules:
- Only one disk can be moved at a time.
- A disk can only be placed on top of a larger disk or on an empty tower.
- The goal is to move all the disks from the source tower to the destination tower.
This project implements a recursive algorithm to solve the Towers of Hanoi problem in RISC-V assembly.
- Emulator or hardware compatible with RISC-V.
- Basic knowledge of assembly language.
- Clone the Repository:
git clone https://github.com/Hamibubu/HanoiASM.git cd towers-of-hanoi-riscv
Abraham de León Gutiérrez & Luis Santiago Zamora Vargas