Nobody knows more about course scheduling algorithm than I do.
A few weeks ago, I was invited to a friend's house. On the table I saw the Tower of Hanoi game. I immediately realized with intuition that the total number of steps to move should be exponential to the number of disks, but I could not think of a proof at the time. Thus, I write this blog to explain this interesting ancient problem.
Studiennotizen zum Deutschlernen.
Deutsch Notizen vom 30. März bis 8. Mai.
Deutsch Notizen vom 16. bis 27. März.
Deutsch Notizen vom 9. bis 15. März.
This blog illustrates some notes on using my Mac (model was released in mid 2015, OS is Catalina 10.15).
Deutsch Notizen vom 2. bis 8. März.
I write this blog both to spread the efficiency of
tmux and keep some useful notes for myself.