figure tower of hanoi puzzle with eight disks now let' think about tower of size three in order to move the largest disk to post ci first have to move the two smaller disks out of the way the two smaller disks form tower of size two using the process outlined abovei could move this tower of two onto post band that would free up the largest disk so that can move it to post then just have to move the tower of two disks from post onto post solving the three disk case boils down to three steps move tower of two from to move one disk from to move tower of two from to the first and third steps involve moving tower of size two fortunatelywe have already figured out how to do this it' just like solving the puzzle with two disksexcept that we move the tower from to using as the temporary resting placeand then from to using as the temporary we have just developed the outline of simple recursive algorithm for the general process of moving tower of any size from one post to another algorithmmove -disk tower from source to destination via resting place move - disk tower from source to resting place move disk tower from source to destination move - disk tower from resting place to destination what is the base case for this recursive processnotice how move of disks results in two recursive moves of disks since we are reducing by one each timethe size of the tower