Implement Recursive Algorithms with Sub-workflows: Towers of Hanoi Demo

About

How it works This is an example of using sub-workflow nodes and a proof of concept showing that it’s possible to solve and explain recursive problems with n8n. Towers of Hanoi - Task Move a stack of n disks from rod A to rod C, using rod B as auxiliary. Only one disk can be moved at a time, and no disk may be placed on a smaller disk. Example n=4 | | | = | | === | | ===== | | ======= | | --