Adjudicating a towers of hanoi contest

The notion of a Towers of Hanoi contest is introduced and the complexity of some adjudication methods are investigated. We present linear time and space adjudication algorithms, that is optimal adjudication algorithms.

Uložené v:
Podrobná bibliografia
Vydané v:International journal of computer mathematics Ročník 14; číslo 3-4; s. 199 - 207
Hlavný autor: Wood, D.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Abingdon Gordon and Breach Science Publishers 01.01.1983
Taylor and Francis
Predmet:
Adjudication algorithm
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-computations on discrete structures
Optimal algorithm
Theoretical computing
Towers of hanoi
Adjudication
Optimal algorithm
Algorithm analysis
ISSN:0020-7160, 1029-0265
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract The notion of a Towers of Hanoi contest is introduced and the complexity of some adjudication methods are investigated. We present linear time and space adjudication algorithms, that is optimal adjudication algorithms.
AbstractList The notion of a Towers of Hanoi contest is introduced and the complexity of some adjudication methods are investigated. We present linear time and space adjudication algorithms, that is optimal adjudication algorithms.
Author Wood, D.
Author_xml – sequence: 1
  givenname: D.
  surname: Wood
  fullname: Wood, D.
  organization: Department of Computer Science , University of Waterloo
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=9456697$$DView record in Pascal Francis
BookMark eNp9kEtLAzEUhYNUsK3-AHezEHejN-8JuCnFFxTc6DqkeWjKdFKSkdJ_75TajaKruzjnO5x7JmjUpc4jdInhBkMDtwAEJBYNhaYBShtxgsYYiKqBCD5C471eDwY4Q5NSVgDQKCnG6HrmVp8uWtPH7r0yVZ-2PpcqherDdClWNnW9L_05Og2mLf7i-07R28P96_ypXrw8Ps9ni9pSIvvacVCOc0aw58Aso02gjHNFhRV8ySiVlDsil15KYz3HQnknlTNAPAlMLOkUXR1yN6ZY04ZsOhuL3uS4NnmnFeNCKDnY5MFmcyol-6Bt7IcXhrLZxFZj0PtV9K9VBhL_II_Z_zF3ByZ2IeW12abcOt2bXZvysSH9G_8CB1B1uw
CODEN IJCMAT
CitedBy_id crossref_primary_10_1007_s00182_017_0608_4
crossref_primary_10_1080_00207169008803905
crossref_primary_10_1080_00207169008803833
crossref_primary_10_1016_0020_0255_92_90067_I
crossref_primary_10_1080_00207168708803561
crossref_primary_10_1080_00207168808803630
crossref_primary_10_1016_j_ipl_2005_12_004
crossref_primary_10_1016_0895_7177_94_00210_F
crossref_primary_10_1016_0020_0255_87_90020_X
crossref_primary_10_1080_00207168608803502
crossref_primary_10_1080_0025570X_1994_11996245
crossref_primary_10_1080_00207168908803728
crossref_primary_10_1140_epjb_e2011_20338_0
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/00207168308803386
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISSN 1029-0265
EndPage 207
ExternalDocumentID 9456697
10_1080_00207168308803386
8803386
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~
08R
AAAVI
ABJVF
ABPTK
ABQHQ
ABTAH
ADIYS
AEGYZ
AFOLD
AFWLO
AHDLD
AIRXU
FUNRP
FVPDL
IQODW
V1K
ID FETCH-LOGICAL-c327t-d509d55421e504c438f3455936c65b433735d27be77ace5169ed79da02e2f46b3
IEDL.DBID TFW
ISICitedReferencesCount 13
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1080_00207168308803386&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 Sun Oct 29 17:08:13 EDT 2023
Sat Nov 29 02:21:21 EST 2025
Tue Nov 18 22:41:45 EST 2025
Mon Oct 20 23:36:22 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3-4
Keywords Adjudication
Optimal algorithm
Algorithm analysis
Language English
License CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c327t-d509d55421e504c438f3455936c65b433735d27be77ace5169ed79da02e2f46b3
PageCount 9
ParticipantIDs crossref_citationtrail_10_1080_00207168308803386
pascalfrancis_primary_9456697
informaworld_taylorfrancis_310_1080_00207168308803386
crossref_primary_10_1080_00207168308803386
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 Wood D. (CIT0002) 1981; 13
CIT0001
References_xml – ident: CIT0001
– volume: 13
  start-page: 304
  year: 1981
  ident: CIT0002
  publication-title: Journal of Recreational Mathematics
SSID ssj0008976
Score 1.2720988
Snippet The notion of a Towers of Hanoi contest is introduced and the complexity of some adjudication methods are investigated. We present linear time and space...
SourceID pascalfrancis
crossref
informaworld
SourceType Index Database
Enrichment Source
Publisher
StartPage 199
SubjectTerms Adjudication algorithm
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-computations on discrete structures
Optimal algorithm
Theoretical computing
Towers of hanoi
Title Adjudicating a towers of hanoi contest
URI https://www.tandfonline.com/doi/abs/10.1080/00207168308803386
Volume 14
WOSCitedRecordID wos10_1080_00207168308803386&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/eLvHCXMwpV09T8MwELVQxcDCN6JAkQfEgBTJiZ04HitExVQxFNEt8scFilCKmpTfzzlJoxahDrBksi-Rz-d3ti_vEXIjFQBn1gbCKMAH7ll1CizQ0hgZIUYZELXYhByP0-lUPbW1OWVbVun30HlDFFGv1T64tSlXFXH-D24ExiTlGCEMt1iecBth34flZPTSrcOpqqXlfOsAm3d3mr9Z2EClDc5SXyypSxyvvBG6WEOf0cE_v_uQ7LdpJx028-SI7EBxTA5Wkg60jfATcjt070tXn-MVr1TTRkSNznP6pov5jPrKdsSRU_I8epjcPwatlEJgeSSrwGFe4DBziEKImbCCpzkXsVfzs0lsBOeSxy6SBqTUFvzdGTipnGYRRLlIDD8jvWJewDmhEVNgEoR6IxIB0poYzRmtOcNlP2S2T9hqKDPb8ox7uYuPLOzoSH-MQ5_cdV0-G5KNbY3jdf9kVX2y0Xon41v6DTYc2b1JYQ6ZKHnxR7uXZC9UKW-OZa5Ir1osYUB27Vc1KxfX9ZT8BgIU2qE
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFH7oFPTi_IlTpz2IB6GQNmnTHIc4FOfwMHG3kqSpTqSTrfPv96Xtyiayg156Sl5LXpLv5eX1-wAuuTCGEq1dpoTBB55ZZWSIK7lS3EeMUoYVYhO834-GQ_FUJdymVVmlPUOnJVFEsVfbxW2T0fOSOPsLNyJjGFFcIgTPWOE6bASIs5Y7f9B9qXfiSBTicra5i-3rW83fTCzh0hJrqS2XlFMcsbSUuljAn27zv1--CztV5Ol0yqmyB2sm24fmXNXBqRb5AVx1kvdZUqTysldHOqWOmjNOnTeZjUeOLW5HKDmE5-7t4ObOrdQUXE19nrsJhgYJBg--ZwLCNKNRSllgBf10GChGKadB4nNlOJfa2Oszk3CRSOIbP2WhokfQyMaZOQbHJ8KoENFesZAZrlWA5pSUlODO7xHdAjIfy1hXVONW8eIj9mpG0h_j0ILrustnybOxqnGw6KA4L5IblXtiuqJfe8mT9ZsEhpGh4Cd_tHsBW3eDx17cu-8_nMK2JyJaZmnOoJFPZqYNm_orH00n58X8_Ab0KN7L
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED5BQYiF8hQFCh4QA1IkJ3bieKyACgSqOhTRLfIrUITSqk35_dhJGrUIMcCS6exEPt99d_blPoBLxo0hWCmPSm7sw-asIjbYE0xKFliMkoYWZBOs14uHQ96vanNmVVmly6HTslFE4audcU90uqiIc39wW2CMYmItBNsUK1qHDRs2R26DD7ovtSOOecEt58Q9K19fav40xQosrTQtddWSYmYXLC2ZLpbgp9v854fvwk4Vd6JOuVH2YM1k-9BccDqgysQP4Kqj3-e6OMjLXpFAJYsaGqfoTWTjEXKl7RZIDuG5eze4ufcqLgVPkYDlnraBgbahQ-CbEFNFSZwSGjo6PxWFkhLCSKgDJg1jQhl3eWY041rgwAQpjSQ5gkY2zswxoABzIyOL9ZJG1DAlQzudFIJg6_d9rFqAF0uZqKrRuOO7-Ej8uh_pt3VowXU9ZFJ22fhNOFzWT5IXRxuVdhLyy7j2iiLrN3EbREacnfxx3gvY6t92k6eH3uMpbPs8JuURzRk08unctGFTfeaj2fS82J1fZQrdfQ
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=Adjudicating+a+towers+of+Hanoi+contest&rft.jtitle=International+journal+of+computer+mathematics&rft.au=WOOD%2C+D&rft.date=1983&rft.pub=Taylor+and+Francis&rft.issn=0020-7160&rft.eissn=1029-0265&rft.volume=14&rft.issue=3-4&rft.spage=199&rft.epage=207&rft_id=info:doi/10.1080%2F00207168308803386&rft.externalDBID=n%2Fa&rft.externalDocID=9456697
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