{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:36:05Z","timestamp":1742913365071,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319122854"},{"type":"electronic","value":"9783319122861"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-12286-1_10","type":"book-chapter","created":{"date-parts":[[2014,9,30]],"date-time":"2014-09-30T10:20:04Z","timestamp":1412072404000},"page":"89-98","source":"Crossref","is-referenced-by-count":0,"title":["An Evolutionary Approach to Tower of Hanoi Problem"],"prefix":"10.1007","author":[{"given":"Jie","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"10_CR1","first-page":"289","volume":"35","author":"A.M. Hinz","year":"1989","unstructured":"Hinz, A.M.: The tower of Hanoi. Enseign. Math\u00a035(2), 289\u2013321 (1989)","journal-title":"Enseign. Math"},{"issue":"4","key":"10_CR2","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1093\/comjnl\/25.4.442","volume":"25","author":"M.C. Er","year":"1982","unstructured":"Er, M.C.: A representation approach to the tower of Hanoi problem. The Computer Journal\u00a025(4), 442\u2013447 (1982)","journal-title":"The Computer Journal"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0255(92)90067-I","volume":"63","author":"A.M. Hinz","year":"1992","unstructured":"Hinz, A.M.: Shortest paths between regular states of the tower of Hanoi. Information Sciences\u00a063(1), 173\u2013181 (1992)","journal-title":"Information Sciences"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022444205860","volume":"47","author":"S. Klav\u017ear","year":"1997","unstructured":"Klav\u017ear, S., Milutinovi\u0107, U.: Graphs S (n, k) and a variant of the Tower of Hanoi problem. Czechoslovak Mathematical Journal\u00a047(1), 95\u2013104 (1997)","journal-title":"Czechoslovak Mathematical Journal"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1093\/comjnl\/20.3.282","volume":"20","author":"P.J. Hayes","year":"1977","unstructured":"Hayes, P.J.: Discussion and correspondence A note on the Towers of Hanoi problem. The Computer Journal\u00a020(3), 282\u2013285 (1977)","journal-title":"The Computer Journal"},{"key":"10_CR6","unstructured":"Chi, M.T.H., Glaser, R.: Problem-solving ability. Learning Research and Development Center, University of Pittsburgh (1985)"},{"issue":"6","key":"10_CR7","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1037\/0012-1649.18.6.922","volume":"18","author":"H.H. Spitz","year":"1982","unstructured":"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\u00a018(6), 922 (1982)","journal-title":"Developmental Psychology"},{"key":"10_CR8","unstructured":"Cambon, S., Gravot, F., Alami, R.: A robot task planner that merges symbolic and geometric reasoning. In: ECAI, vol.\u00a016 (2004)"},{"key":"10_CR9","unstructured":"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.\u00a02012(1). National Training Systems Association (2012)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/978-3-540-74626-3_35","volume-title":"Evolvable Systems: From Biology to Hardware","author":"J. Li","year":"2007","unstructured":"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.\u00a04684, pp. 368\u2013378. Springer, Heidelberg (2007)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-46239-2_9","volume-title":"Genetic Programming","author":"J.F. Miller","year":"2000","unstructured":"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.\u00a01802, pp. 121\u2013132. Springer, Heidelberg (2000)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/AHS.2008.27"},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1137\/050628660","volume":"20","author":"D.. Romik","year":"2006","unstructured":"Romik, D.: Shortest paths in the Tower of Hanoi graph and finite automata. SIAM Journal on Discrete Mathematics\u00a020(3), 610\u2013622 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0166-218X(01)00287-6","volume":"120","author":"S. Klav\u017ear","year":"2002","unstructured":"Klav\u017ear, S., Milutinovi\u0107, U., Petr, C.: On the Frame\u2013Stewart algorithm for the multi-peg Tower of Hanoi problem. Discrete Applied Mathematics\u00a0120(1), 141\u2013157 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR15","unstructured":"Houston, B., Masun, H.: Explorations in 4-peg Tower of Hanoi. Technical Report TR-04-10 (2004)"},{"key":"10_CR16","first-page":"55","volume":"59","author":"S. Klavzar","year":"2001","unstructured":"Klavzar, S., Milutinovic, U., Petr, C.: Combinatorics of topmost discs of multi-peg tower of Hanoi problem. Ars Combinatoria\u00a059, 55\u201364 (2001)","journal-title":"Ars Combinatoria"}],"container-title":["Advances in Intelligent Systems and Computing","Genetic and Evolutionary Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12286-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T03:42:44Z","timestamp":1674272564000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12286-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319122854","9783319122861"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12286-1_10","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}