An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by X'a(G). Sierpinski graphs S(n, 3) are the graphs of the Tower of Hanoi with n disks, while Sierpinski gasket graphs Sn are the graphs naturally defined by the finite number of iterations that lead to the Sierpinski gasket. Sierpinski graph and Sierpinski gasket constitute Sierpinski-like graphs. We give algorithms for coloring the Sierpinski-like graphs acyclically using optimal set of colors. © 2013 Academic Publications, Ltd.