Skip to content

Can your solve the tower of hanoi (recursive vietnam) problem?

License

Notifications You must be signed in to change notification settings

racketf/tower-of-hanoi

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 

Repository files navigation

The objective is to return the state (slot no.) of all disks after each move. The larger disk is listed first.

Note: The state of each disk is its tower no.

Course: Discrete Maths and Algorithms, Monsoon 2019
Taught by: Prof. Bapi Raju S.

; (toh ldisk to)
> (toh '(1 1) 3)

'((1 2)
  (3 2)
  (3 3))

About

Can your solve the tower of hanoi (recursive vietnam) problem?

Topics

Resources

License

Stars

Watchers

Forks

Languages