… for example, the recursive version of the towers of Hanoi on the Science Fair Microcomputer Trainer - it should be, by all means, impossible! Yet, Jason Jacques was able to pull it off:
Implementing it on the Microtronic was a piece of cake in comparison:
Of course, both machines neither offer a native stack, nor computed / indirect jumps, (nor indexed memory access in case of the Microtronic) - that would have been too easy!
@mainframetom if you want to follow and understand the code to inform yourself, please check out the Hackaday log entry posted above. As mentioned, this video is not ment for explanation, way too complex.