/towers-of-hanoi-scheme

An implementation of the Towers of Hanoi problem in Scheme, featuring dynamic input for the number of disks and step-by-step instructions for solving the puzzle. This project showcases the principles of functional programming and recursion.

Primary LanguageSchemeOtherNOASSERTION

Stargazers