5 ms·
How are these problems more interesting than simple arithmetic or algorithmic problems?
by thomasahle 1y ago
How are these problems more interesting than simple arithmetic or algorithmic problems?
- mrbungie 1y agoTowers of Hanoi IS an algorithmic problem. It is a high-school/college level problem when designing algorithms, probably kid level when trying to solve intuitively, heuristically or via brute force for few disks (i.e. like when playing Mass Effect 1 or similar games that embed it as a minigame*). * https://www.youtube.com/watch?v=1vTBVyhX7n4 https://www.youtube.com/watch?v=1vTBVyhX7n4
- pcooperchi 1y agoThe problems themselves aren’t particularly interesting, I suppose. The interesting part is how the complexity of each problem scales as a function of the number of inputs (e.g. the number of disks in the tower of Hanoi).