number the disk from 1 to n in increasing order of their size.

number the disk from 1 to n in increasing order of their size.the disk moments will be represented by a tuple of n bits,in which the bits will be counted from left to right so that the rightmost bit will represent the moments of the smallest disk and leftmost bit will represent the movements of the largest disk,initialize the tuple with all 0's.for each move in the puzzle's solution.flip the ith bit if the move involves the i th disk