{"id":"https://openalex.org/W1985427527","doi":"https://doi.org/10.1080/00207169508804412","title":"A recursive algorithm for the multi-peg tower of hanoi problem","display_name":"A recursive algorithm for the multi-peg tower of hanoi problem","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1985427527","doi":"https://doi.org/10.1080/00207169508804412","mag":"1985427527"},"language":"en","primary_location":{"id":"doi:10.1080/00207169508804412","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804412","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076413241","display_name":"M. Kaykobad","orcid":"https://orcid.org/0000-0003-0485-5041"},"institutions":[{"id":"https://openalex.org/I183697816","display_name":"Bangladesh University of Engineering and Technology","ror":"https://ror.org/05a1qpv97","country_code":"BD","type":"education","lineage":["https://openalex.org/I183697816"]}],"countries":["BD"],"is_corresponding":true,"raw_author_name":"M. Kaykobad","raw_affiliation_strings":["Department of Computer Science and Engineering , BUET , Dhaka, 1000,  Bangladesh","Department of Computer Science and Engineering , BUET , Dhaka, 1000, Bangladesh"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering , BUET , Dhaka, 1000,  Bangladesh","institution_ids":["https://openalex.org/I183697816"]},{"raw_affiliation_string":"Department of Computer Science and Engineering , BUET , Dhaka, 1000, Bangladesh","institution_ids":["https://openalex.org/I183697816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103408663","display_name":"S.T. Rahman","orcid":null},"institutions":[{"id":"https://openalex.org/I183697816","display_name":"Bangladesh University of Engineering and Technology","ror":"https://ror.org/05a1qpv97","country_code":"BD","type":"education","lineage":["https://openalex.org/I183697816"]}],"countries":["BD"],"is_corresponding":false,"raw_author_name":"S.T. Rahman","raw_affiliation_strings":["Department of Computer Science and Engineering , BUET , Dhaka, 1000,  Bangladesh","Department of Computer Science and Engineering , BUET , Dhaka, 1000, Bangladesh"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering , BUET , Dhaka, 1000,  Bangladesh","institution_ids":["https://openalex.org/I183697816"]},{"raw_affiliation_string":"Department of Computer Science and Engineering , BUET , Dhaka, 1000, Bangladesh","institution_ids":["https://openalex.org/I183697816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035717238","display_name":"Rezwan-al Bakhtiar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R-.A. Bakhtiar","raw_affiliation_strings":["Onirbaan Group , Dhaka,  Bangladesh","Onirbaan Group , Dhaka, Bangladesh"],"affiliations":[{"raw_affiliation_string":"Onirbaan Group , Dhaka,  Bangladesh","institution_ids":[]},{"raw_affiliation_string":"Onirbaan Group , Dhaka, Bangladesh","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112457811","display_name":"A. A. K. Majumdar","orcid":null},"institutions":[{"id":"https://openalex.org/I46080048","display_name":"Jahangirnagar University","ror":"https://ror.org/04ywb0864","country_code":"BD","type":"education","lineage":["https://openalex.org/I46080048"]}],"countries":["BD"],"is_corresponding":false,"raw_author_name":"A.A.K. Majumdar","raw_affiliation_strings":["Department of Mathematics , Jahangirnagar University , Savor, Dhaka, 1342,  Bangladesh","Department of Mathematics , Jahangirnagar University , Savor, Dhaka, 1342, Bangladesh"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics , Jahangirnagar University , Savor, Dhaka, 1342,  Bangladesh","institution_ids":["https://openalex.org/I46080048"]},{"raw_affiliation_string":"Department of Mathematics , Jahangirnagar University , Savor, Dhaka, 1342, Bangladesh","institution_ids":["https://openalex.org/I46080048"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5076413241"],"corresponding_institution_ids":["https://openalex.org/I183697816"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.1126681,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"57","issue":"1-2","first_page":"67","last_page":"73"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9645000100135803,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9645000100135803,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9458000063896179,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9258000254631042,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tower","display_name":"Tower","score":0.7036709785461426},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6632311344146729},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6561015844345093},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5890712738037109},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.49720528721809387},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.446547269821167},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3931128680706024}],"concepts":[{"id":"https://openalex.org/C2777831296","wikidata":"https://www.wikidata.org/wiki/Q12518","display_name":"Tower","level":2,"score":0.7036709785461426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6632311344146729},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6561015844345093},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5890712738037109},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.49720528721809387},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.446547269821167},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3931128680706024},{"id":"https://openalex.org/C147176958","wikidata":"https://www.wikidata.org/wiki/Q77590","display_name":"Civil engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169508804412","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804412","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W121929218","https://openalex.org/W1608396689","https://openalex.org/W2047225344","https://openalex.org/W2140298786","https://openalex.org/W2753176400","https://openalex.org/W3119027021","https://openalex.org/W3215274301","https://openalex.org/W4235496696","https://openalex.org/W4249958171"],"related_works":["https://openalex.org/W4214759293","https://openalex.org/W2948890638","https://openalex.org/W2377743247","https://openalex.org/W2481514411","https://openalex.org/W3213682227","https://openalex.org/W2367420223","https://openalex.org/W2567029817","https://openalex.org/W2319168490","https://openalex.org/W2320078168","https://openalex.org/W814774360"],"abstract_inverted_index":{"This":[0,51],"paper":[1],"gives":[2],"a":[3],"recursive":[4],"algorithm":[5,15,52],"to":[6,41],"solve":[7,42],"the":[8,19,25,35,43,54,60],"multi-peg":[9],"Tower":[10],"of":[11,38],"Hanoi":[12],"problem.":[13],"The":[14],"is":[16,53],"based":[17],"on":[18],"dynamic":[20],"programming":[21],"equation":[22],"satisfied":[23],"by":[24],"optimal":[26],"value":[27],"function,":[28],"M(n,":[29,32],"p),":[30],"where":[31],"p)":[33],"denotes":[34],"minimum":[36],"number":[37],"moves":[39],"required":[40],"problem":[44],"with":[45],"n":[46],"discs":[47],"and":[48],"p":[49],"pegs.":[50],"only":[55],"one":[56],"available,":[57],"particularly":[58],"for":[59],"case":[61],"when":[62],"p\u2a7e5.":[63]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}