The multiway trees of hanoi

We consider the multiway generalisation of the binary Trees of Hanoi. We provide a recursive algorithm for its solution and prove its optimality. Finally we solve the simultaneous recurrence equations to give an exact formula for the minimal number of moves necessary.

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of computer mathematics Ročník 14; číslo 2; s. 137 - 153
Hlavní autoři: Jürgensen, Helmut, Wood, Derick
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Gordon and Breach Science Publishers 01.01.1983
Taylor and Francis
Témata:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-omputations on discrete structures
G.2.1 [Discrete Mathematics]: Combinatorics-recurrences and difference equations
multiway trees
optimality
simultaneous recurrence equations
Theoretical computing
Towers of Hanoi
trees of Hanoi
Algorithm analysis
ISSN:0020-7160, 1029-0265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We consider the multiway generalisation of the binary Trees of Hanoi. We provide a recursive algorithm for its solution and prove its optimality. Finally we solve the simultaneous recurrence equations to give an exact formula for the minimal number of moves necessary.
AbstractList We consider the multiway generalisation of the binary Trees of Hanoi. We provide a recursive algorithm for its solution and prove its optimality. Finally we solve the simultaneous recurrence equations to give an exact formula for the minimal number of moves necessary.
Author Wood, Derick
Jürgensen, Helmut
Author_xml – sequence: 1
  givenname: Helmut
  surname: Jürgensen
  fullname: Jürgensen, Helmut
  organization: Institut für theoretische
– sequence: 2
  givenname: Derick
  surname: Wood
  fullname: Wood, Derick
  organization: Department of Computer Science , University of Waterloo
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=9653446$$DView record in Pascal Francis
BookMark eNp9kDtLA0EUhQdRMIn-ALHZwnb1zt7MY8FGgi8I2MR6mScZ2eyEmZGQf29C1ELR6hT3-y6HMybHQxwcIRcUrilIuAFoQFAuEaQERAlHZEShaWtoODsmo_293gFwSsY5vwGAbAUfkcvF0lWr976EjdpWJTmXq-irpRpiOCMnXvXZnX_mhLw-3C9mT_X85fF5djevDTai1Joz0M5L1pjWWe1RWkEdtUJ7JRvJAamkwlLDULdMWeulQKY1ogEpnMUJuTr8XatsVO-TGkzI3TqFlUrbruUMp1O-w-gBMynmnJz_Jih0-xG6XyPsHPHDMaGoEuJQkgr9v-btwQyDj2mlNjH1titq28f01RD_1j8A049yrw
CODEN IJCMAT
CitedBy_id crossref_primary_10_1080_00207169008803833
crossref_primary_10_1016_0020_0255_88_90007_2
Cites_doi 10.1016/0020-0190(80)90150-7
10.1016/0020-0190(76)90015-6
10.1016/S0020-7373(81)80048-X
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 1983
1984 INIST-CNRS
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 1983
– notice: 1984 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1080/00207168308803380
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISSN 1029-0265
EndPage 153
ExternalDocumentID 9653446
10_1080_00207168308803380
8803380
GroupedDBID -~X
07G
0R~
1TA
4.4
5GY
5VS
AAIKQ
AAKBW
AAYJJ
ABEFU
ABJNI
ABUFD
ACGEE
ACGEJ
ACGFS
ACGOD
ACIWK
ACNCT
ADCVX
ADXPE
AENEX
AEPSL
AEUMN
AEYOC
AFFNX
AGLEN
AI.
ALMA_UNASSIGNED_HOLDINGS
AMVHM
AMXXU
AQTUD
AWYRJ
BCCOT
BPLKW
C06
CS3
DU5
DWIFK
EBS
EJD
H13
HZ~
IVXBP
NA5
NUSFT
O9-
P2P
PQQKQ
TAQ
TDBHL
TFL
TFMCV
TFW
TN5
TOXWX
UB9
UPT
UU8
V3K
V4Q
VH1
WH7
ZY4
.4S
.7F
.DC
.QJ
0BK
29J
30N
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
AAYXX
ABCCY
ABDBF
ABFIM
ABHAV
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACAGQ
ACTCW
ACTIO
ACUHS
ADGTB
AEISY
AEOZL
AFKVX
AFRVT
AGCQS
AGDLA
AGMYJ
AGROQ
AHDZW
AHMOU
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALCKM
ALQZU
AMEWO
AQRUH
ARCSS
AVBZW
BLEHA
CAG
CCCUG
CE4
CITATION
COF
CRFIH
DGEBU
DKSSO
DMQIW
EAP
EDO
EMK
EPL
EST
ESX
E~A
E~B
GTTXZ
HF~
H~9
H~P
IPNFZ
J.P
KYCEM
LJTGL
M4Z
MK~
NY~
QCRFL
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TEJ
TFT
TTHFI
TUROJ
TUS
TWF
UT5
UU3
ZGOLN
~S~
IQODW
ID FETCH-LOGICAL-c327t-b650bef852c9edbf38d71e1d7bfa8286031817d1c53b95addf8735bb33c087ed3
IEDL.DBID TFW
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1080_00207168308803380&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-7160
IngestDate Wed Nov 12 07:01:01 EST 2025
Tue Nov 18 21:49:33 EST 2025
Sat Nov 29 02:21:21 EST 2025
Mon Oct 20 23:37:20 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Algorithm analysis
Language English
License CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c327t-b650bef852c9edbf38d71e1d7bfa8286031817d1c53b95addf8735bb33c087ed3
PageCount 17
ParticipantIDs crossref_primary_10_1080_00207168308803380
informaworld_taylorfrancis_310_1080_00207168308803380
pascalfrancis_primary_9653446
crossref_citationtrail_10_1080_00207168308803380
PublicationCentury 1900
PublicationDate 1/1/1983
1983-01-00
1983
PublicationDateYYYYMMDD 1983-01-01
PublicationDate_xml – month: 01
  year: 1983
  text: 1/1/1983
  day: 01
PublicationDecade 1980
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle International journal of computer mathematics
PublicationYear 1983
Publisher Gordon and Breach Science Publishers
Taylor and Francis
Publisher_xml – name: Gordon and Breach Science Publishers
– name: Taylor and Francis
References Buneman P. (CIT0002) 1980; 10
Partsch H. (CIT0005) 1976; 5
CIT0001
Wirth N. (CIT0006) 1976
Engelfriet J. (CIT0003) 1981
Wood D. (CIT0007) 1981; 14
Luger G.F. (CIT0004) 1981; 14
References_xml – volume: 10
  start-page: 243
  year: 1980
  ident: CIT0002
  publication-title: Information Processing Letters
  doi: 10.1016/0020-0190(80)90150-7
– volume-title: The Trees of Hanoi
  year: 1981
  ident: CIT0003
– volume: 5
  start-page: 174
  issue: 6
  year: 1976
  ident: CIT0005
  publication-title: Information Processing Letters
  doi: 10.1016/0020-0190(76)90015-6
– ident: CIT0001
– volume-title: Algorithms + Data − Structures = Programs
  year: 1976
  ident: CIT0006
– volume: 14
  start-page: 449
  year: 1981
  ident: CIT0004
  publication-title: International Journal of Man-Machine Studies
  doi: 10.1016/S0020-7373(81)80048-X
– volume: 14
  start-page: 17
  year: 1981
  ident: CIT0007
  publication-title: Journal of Recreational Mathematics
SSID ssj0008976
Score 1.2550898
Snippet We consider the multiway generalisation of the binary Trees of Hanoi. We provide a recursive algorithm for its solution and prove its optimality. Finally we...
SourceID pascalfrancis
crossref
informaworld
SourceType Index Database
Enrichment Source
Publisher
StartPage 137
SubjectTerms Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-omputations on discrete structures
G.2.1 [Discrete Mathematics]: Combinatorics-recurrences and difference equations
multiway trees
optimality
simultaneous recurrence equations
Theoretical computing
Towers of Hanoi
trees of Hanoi
Title The multiway trees of hanoi
URI https://www.tandfonline.com/doi/abs/10.1080/00207168308803380
Volume 14
WOSCitedRecordID wos10_1080_00207168308803380&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Journals Complete
  customDbUrl:
  eissn: 1029-0265
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008976
  issn: 0020-7160
  databaseCode: TFW
  dateStart: 19640101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpR3LSgMxMEjx4MX6xForOXgSAslm0yRHEYsHKR6q9rbkiQXZSner-Pcmu9ulFelB7zN5zSuTmcwAcIVNcDqcSpEMJECpZkMkEm-RsM5ojq3jVQT_-YGPx2I6lY9Nbk7RpFVGH9rXhSIqXR2FW-lilREXf3AHwzgUNEgIDi5W9NiD2Y9iORm9tHpYyKq1XIRGAbyNaf42woZV2qhZGpMlVRHOy9eNLtasz6j7z3UfgP3m2glvaj45BDsuPwLdVUsH2Ej4MegHtoFVkuGn-oIxYl3AuYevKp_PTsDT6G5ye4-a_gnI0ISXSIfbl3ZesMRIZ7WnwnLiiOXaq_h7PMoz4ZYYRrVkQdF5wSnTmlKDBXeWnoJOPs_dGYBYqEQK5YPNc6kjTKXMBwwjsZM-0aYH8Or8MtMUF489Lt4y0tYg_bH5HrhuUd7ryhrbgNk6UbKyes5oSJLRLXiDDeq1M8kho8ETPv_juH2wR6Sg9VvMBeiUi6UbgF3zUc6KxWXFh9_nddd7
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpR1NS8Mw9CEq6MX5iXNOe_AkBNqmWZKjiGPiHB6m7lbyiQPpZKuK_96k7comsoPe30vavK-8j7wHcBEq53QYkSDuSIASSTqIxVYjpo2SNNSGFhn8pz4dDNhoxB-qgNusKqv0PrQtG0UUutoLtw9Gz0vi_BNuZxk7DDsRCZ2P5Vz2DeLsrO-dP-w-15qY8WK4nAdHDr7Oav62xJJdWupa6sslxcydmC1HXSzYn27jv1--CzvVzTO4KlllD9ZMtg-N-VSHoBLyA2g5zgmKOsNP8RX4pPUsmNjgRWST8SE8dm-G1z1UjVBACsc0R9JdwKSxjMSKGy0tZppGJtJUWuEfkHuRjqiOFMGSE6frLKOYSImxChk1Gh_BejbJzDEEIRMxZ8I6s2cSExGREOswFA8Nt7FUTQjnB5iqqr-4H3PxmkZ1G9IfP9-EyxrlrWyusQqYLFIlzYuIRkWTFK_Aay-Rr96Jdwh2zvDJH9c9h63e8L6f9m8Hdy3YjjjDZWjmFNbz6btpw6b6yMez6VnBlN-k9tul
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpR1NS8MwNMgU8eL8xDmnPXgSAm3TNMlR1KI4xg5Tdyv5xIF0Y62K_96k7comsoPe30vavO-8l_cAuPSlDTo0jyCzJICRwDGkoVGQKi0F8ZUmZQb_uU8GAzoes2Fdm5PXZZUuhjZVo4hSVzvhnimzqIhzL7itYYwpshLi2xDLRuyb1m2OHYOPkpdGEVNWzpZz4NDCN0nN35ZYMUsrTUtdtSTP7YGZatLFkvlJ2v_88D2wW_ud3nXFKPtgQ2cHoL2Y6eDVIn4IupZvvLLK8JN_eS5lnXtT473ybDo5Ak_J3ejmHtYDFKBEISmgsO6X0IbiUDKthEFUkUAHigjD3fNxJ9ABUYHESDBsNZ2hBGEhEJI-JVqhY9DKppk-AZ5PecgoN9bo6UgHmEfYWAzJfM1MKGQH-IvzS2XdXdwNuXhLg6YJ6Y-f74CrBmVWtdZYB4yXiZIW5X1GTZIUrcHrrVCv2YnFGNlQ-PSP616A7eFtkvYfBo9dsBMwiqp7mTPQKubvuge25EcxyefnJUt-AyQg2lc
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+multiway+trees+of+Hanoi&rft.jtitle=International+journal+of+computer+mathematics&rft.au=JURGENSEN%2C+H&rft.au=WOOD%2C+D&rft.date=1983&rft.pub=Taylor+and+Francis&rft.issn=0020-7160&rft.volume=14&rft.issue=2&rft.spage=137&rft.epage=153&rft_id=info:doi/10.1080%2F00207168308803380&rft.externalDBID=n%2Fa&rft.externalDocID=9653446
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7160&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7160&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7160&client=summon