Vibe Coding as a Coding Veteran. From 8-Bit Assembly to English-as-Code
Note 1: On Tower of Hanoi Solutions and their Complexity. I chose the Tower of Hanoi puzzle (Lucas, 1883) because of its almost mythical status in computer science and discrete mathematics communities. It’s a staple in AI education and typically the first encounter with elegant doubly recursive algorithms for CS undergraduates. And, I chose the search algorithms mentioned in Section 1 because they constitute the core of the “state space search” paradigm in most AI textbooks (e.g., Chapters 3 and