Past research on the Tower of Hanoi problem has provided clear evidence for the importance of goal-subgoal structures in problem solving. However, the nature of the traditional Tower of Hanoi problem makes it impossible to determine whether there is any special cost associated with storing or retrieving goals. A variation of the Tower of Hanoi problem is described that allows one to determine separately if there is an effect of how long a goal has to be retained on storage time or how long ago it was formed on retrieval time. This paradigm provides evidence for an effect of retention interval on retrieval time and not on storage time. An ACT-R (Adaptive Control of Thought-Rational; J. R. Anderson & C. Lebiere, 1998) simulation of these data is described, which treats goal memory as no different from other memories.The Tower of Hanoi problem has become a tool in cognitive psychology to understand planning both from an informationprocessing perspective (e.g., Simon, 1975) and a cognitive neuroscience perspective (e.g., Goel & Grafman, 1995). A simple version of this problem is illustrated in Figure 1. There are three pegs and four disks of differing sizes. The disks have holes in them, so they can be stacked on the pegs. The disks can be moved from any peg to any other peg. Only the top disk on a peg can be moved, and it can never be placed on a smaller disk. The disks all start out on Peg A, but the goal is to move them all to Peg C, one disk at a time, by means of transferring disks among pegs.Until the 1970s, the Tower of Hanoi was a puzzle of mild interest to mathematicians (e.g., Claus, 1884;Domoryad, 1964;Hinz, 1992) and just one of a stock of problems used by researchers interested in the effects of various manipulations on problem solving (e.g., Ewert & Lambert, 1932;Gagne & Smith, 1962). Then, reflecting the rise of the information-processing perspective, its structure became a task of special interest to psychologists (e.g., Egan & Greeno, 1974;Hayes & Simon, 1974;Simon, 1975). In Simon's (1975) paper, he described a number of methods for solving the problem that required a goal-subgoal structure. One of these methods was the goal-recursion strategy, which prescribed that in order to move a pyramid of n disks from Peg A to Peg C, one moved a pyramid of n -1 disks from Peg A to Peg B, the nth (largest) disk to Peg C, and then the pyramid of n -1 disks from Peg B to Peg C. The strategy applied recursively to moving the smaller pyramids. He also described a variety of "sophisticated perceptual" strategies that basically prescribed focusing on the largest disk out of place, finding the largest disk blocking its move,