Abstract
The Tower of Hanoi problem is an ancient and interesting topic. In this paper, we presented an evolutionary algorithm approach for searching the solutions of the problem. We use a direct encoding and apply mutation only in the evolution. Experimental results are reported and show that the proposed method is capable of finding solutions for the problem of multiple pegs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hinz, A.M.: The tower of Hanoi. Enseign. Math 35(2), 289–321 (1989)
Er, M.C.: A representation approach to the tower of Hanoi problem. The Computer Journal 25(4), 442–447 (1982)
Hinz, A.M.: Shortest paths between regular states of the tower of Hanoi. Information Sciences 63(1), 173–181 (1992)
Klavžar, S., Milutinović, U.: Graphs S (n, k) and a variant of the Tower of Hanoi problem. Czechoslovak Mathematical Journal 47(1), 95–104 (1997)
Hayes, P.J.: Discussion and correspondence A note on the Towers of Hanoi problem. The Computer Journal 20(3), 282–285 (1977)
Chi, M.T.H., Glaser, R.: Problem-solving ability. Learning Research and Development Center, University of Pittsburgh (1985)
Spitz, H.H., Webster, N.A., Borys, S.V.: Further studies of the Tower of Hanoi problem-solving performance of retarded young adults and nonretarded children. Developmental Psychology 18(6), 922 (1982)
Cambon, S., Gravot, F., Alami, R.: A robot task planner that merges symbolic and geometric reasoning. In: ECAI, vol. 16 (2004)
McDermott, P.L., Carolan, T.F., Gronowski, M.R.: Application of Worked Examples to Unmanned Vehicle Route Planning. In: The Interservice/Industry Training, Simulation & Education Conference (I/ITSEC), vol. 2012(1). National Training Systems Association (2012)
Li, J., Huang, S.: Evolving in extended hamming distance space: hierarchical mutation strategy and local learning principle for EHW. In: Kang, L., Liu, Y., Zeng, S. (eds.) ICES 2007. LNCS, vol. 4684, pp. 368–378. Springer, Heidelberg (2007)
Miller, J.F., Thomson, P.: Cartesian genetic programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 121–132. Springer, Heidelberg (2000)
Li, J., Huang, S.: Adaptive salt-&-pepper noise removal: a function level evolution based approach. In: NASA/ESA Conference on Adaptive Hardware and Systems, AHS 2008. IEEE (2008)
Romik, D.: Shortest paths in the Tower of Hanoi graph and finite automata. SIAM Journal on Discrete Mathematics 20(3), 610–622 (2006)
Klavžar, S., Milutinović, U., Petr, C.: On the Frame–Stewart algorithm for the multi-peg Tower of Hanoi problem. Discrete Applied Mathematics 120(1), 141–157 (2002)
Houston, B., Masun, H.: Explorations in 4-peg Tower of Hanoi. Technical Report TR-04-10 (2004)
Klavzar, S., Milutinovic, U., Petr, C.: Combinatorics of topmost discs of multi-peg tower of Hanoi problem. Ars Combinatoria 59, 55–64 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Li, J., Shen, R. (2015). An Evolutionary Approach to Tower of Hanoi Problem. In: Sun, H., Yang, CY., Lin, CW., Pan, JS., Snasel, V., Abraham, A. (eds) Genetic and Evolutionary Computing. Advances in Intelligent Systems and Computing, vol 329. Springer, Cham. https://doi.org/10.1007/978-3-319-12286-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-12286-1_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12285-4
Online ISBN: 978-3-319-12286-1
eBook Packages: EngineeringEngineering (R0)