Implementing recursive algorithms on extremely limited machines

… 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!

3 Likes

An engineering marvel pulled off by Jason:

1 Like

Great trainer.
I watched the videos. It’s a bit hard to follow.
And I wonder if you have the original manual.

There’s also at least one emulator

And the manual with 100 programs including many details like the musical notes

1 Like

We started a Hackaday project page:

I am happy to say we have two very accomplished Science Fair experts on board:

@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.

2 Likes