The classical Towers of Hanoi problem begins with a stack of n > = 1disks on one of three pegs. No two discs are of the same size, and the discs are stacked in order, with the largest on the bottom. Solving the problem requires moving the stack from peg A to peg B in such a way that only one disc is moved at a time and no disc can be placed on top of a disc smaller than itself. The Cyclic Towers of Hanoi problem adds the following constraint: The pegs are placed at the vertices of a triangle and discs can only be moved to the adjacent peg in the cyclic order. Thus a single move can transfer a disk from A to B, from B to C, or from C to A. All other moves are illegal.