You must log in or # to comment.
I once had a professor ask to solve the tower of hanoi using only 2 pegs.
How did that turn out?
It was a trick question.
M-x hanoi
Good ol’ emacs, relevant xkcd (although I don’t think there’s anyone that hasn’t seen it).
And then someone starts talking about dining philosophers…
Oh god Hanoi’s towers… Incredible that I programmed it in BASIC on my ZX81 in the 80s, and now at 50+yo I would have no clue how to program it lol
deleted by creator
This is called Tower of Hanoi problem, usually introduced as main task when learning about recursion in programming
