prikaz prve stranice dokumenta Poopćeni problem Hanojskih tornjeva
No public access
undergraduate thesis
Poopćeni problem Hanojskih tornjeva
2017. urn:nbn:hr:168:387597
Dodig, Krešimir
University of Zagreb
Faculty of Electrical Engineering and Computing

Cite this document

Dodig, K. (2017). Poopćeni problem Hanojskih tornjeva (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:387597

Dodig, Krešimir. "Poopćeni problem Hanojskih tornjeva." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2017. https://urn.nsk.hr/urn:nbn:hr:168:387597

Dodig, Krešimir. "Poopćeni problem Hanojskih tornjeva." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2017. https://urn.nsk.hr/urn:nbn:hr:168:387597

Dodig, K. (2017). 'Poopćeni problem Hanojskih tornjeva', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 13 March 2025, https://urn.nsk.hr/urn:nbn:hr:168:387597

Dodig K. Poopćeni problem Hanojskih tornjeva [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2017 [cited 2025 March 13] Available at: https://urn.nsk.hr/urn:nbn:hr:168:387597

K. Dodig, "Poopćeni problem Hanojskih tornjeva", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:168:387597

Please login to the repository to save this object to your list.
Metadata
TitlePoopćeni problem Hanojskih tornjeva
Title (english)Tower of Hanoi and its Generalizations
AuthorKrešimir Dodig
MentorTomislav Burić (mentor)
Committee memberTomislav Burić (predsjednik povjerenstva)
Committee memberAnamari Nakić (član povjerenstva)
Committee memberAna Anušić (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2017-07-10, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
U ovom radu pokazali smo da se problem Hanojskih tornjeva s 3 klina i n diskova može riješiti na više načina, među kojima valja posebno istaknuti rekurzivno rješenje. Svaki od navedenih načina problem rješava optimalno. Nadalje, razmotrili smo poopćenje problema na više od 3 klina. Za slučaj s 4 klina, Frame-Stewartov algoritam daje optimalno rješenje, dok je za slučajeve s više od 4 klina optimalnost algoritma i dalje otvoreni problem. Međutim, treba napomenuti da je 2016. godine Demontis ponudio navodni dokaz optimalnosti Frame-Stewartovog algoritma. Njegov rad još nije potvrđen.
Abstract (english)
In this paper we show that the Towers of Hanoi problem with 3 pegs and n disks can be solved in several ways, using different methods, among which should be specifically mentioned recursive solution. Each of these methods solves the problem optimally. Furthermore, we have generalized the problem by allowing more than 3 pegs. In the 4-peg scenario, Frame-Stewart algorithm gives the optimal solution, while for cases with more than four pegs optimality of this algorithm is still an open problem. However, it should be noted that in 2016. Demontis offered alleged evidence of the algorithm's optimality. His work has not yet been confirmed.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:387597
Study programmeTitle: Computing
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsClosed access
Terms of useLicence In copyright icon
Public note
Created on2019-03-13 19:57:02