Move n disks A → C, one at a time · optimal recursion, exactly 2ⁿ − 1 moves
Run this interactive Discrete Math demo live below, or download it as a single self-contained HTML file that works offline in any browser or LMS — one of 1,900+ free interactive teaching demos on Notedeck. With Notedeck you upload your own materials and turn them into interactive courseware, question papers with answer keys, and AI-taught lessons.