# Towers of hanoi

Part 1:

Results Number of Disks | Number of Moves _________________________________ 1 | 2 | 4 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | In general, for n disks, how many moves are required? (Use the ^ symbol, if needed to convey exponents, e.g., a^b signifies a raised to the b power.) Part 2:

Results Trial | Number of Disks | Seconds of Execution ---------------------------------------------- | | | | | | | | | | ---------------------------------------------- What pattern do you see between the computing time for n disks and that for n + 1 disks?