One of the transformer major design elements is its core design. The good performanco of the transformer requires its coil core to be laminated and composed ofclLfl~ent-widths stepped layers of specific steel packed together. For optimum design, the cross sectional shape offl~ core must be as circular as possible. So, an optimal packing can be attained by ma~mizing the steel core coverage. The number of different widths of steel plates n is selected to compose the packed core ~r a coil of diameter d. Then, an optimum sequence of decisions, for the n widths as well as the number of thin plates of each, is required. Dynamic programming (dp) is concomed with this optimum sequential decisions. An adequate for,~'ard recursive equation is formulated, because there isn't a standard dp model for all sequential decision making problems. To implement the reeursive computations, a FORTRAN program is developed. Assuming that d is given the values 150, 200,250,300,400 and 500 nun. while giving n the values from 2 to ! 5, the program is run at different combinations ofn and d. It is found fluat maximum core coverage is smsitive to changing ofn but it is slightly affected by changing ofd.