
#211: Classic CS problems in Python
Talk Python To Me
00:00
The Towers of Hano - How to Move a Single Disk
The towers of hano is a difficult problem to solve by hand. The solution turns out to be, it's beautifully solved with recursion. And i don't think we can explain it wonderfully on the podcast, but i guess people will just have to take our word for it.
Transcript
Play full episode