Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
For students
For employees
Statistics
Login
First page
>
Show document
Show document
Title:
Hanojski stolp z usmerjenimi premiki diskov
Authors:
ID
Golob, Martina
(Author)
ID
Klavžar, Sandi
(Mentor)
More about this mentor...
ID
Petr, Ciril
(Comentor)
Files:
UN_Golob_Martina_2016.pdf
(541,41 KB)
MD5: 5462EB1B266065A3B5E478C3A4BD971A
Language:
Slovenian
Work type:
Undergraduate thesis
Typology:
2.11 - Undergraduate Thesis
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
Igra Hanojski stolp spada v področje razvedrilne matematike. Rešujemo jo tako, da premikamo diske iz začetne palice na končno palico po določenih pravilih. Cilj igre je uporabiti najmanjše število premikov. V diplomskem delu obravnavamo Hanojski stolp z usmerjenimi premiki diskov, kar pomeni, da obstajajo omejitve pri premikih. Ločimo pet različnih primerov Hanojskega stolpa, ki jih ponazorimo z digrafi. Vsak digraf ima tri vozlišča, med katerimi obstajajo usmerjene povezave. V prvem delu bomo najprej predstavili Hanojski stolp in podali osnovne definicije o grafih. V naslednjem poglavju se bomo osredotočili na rekurzivno in iterativno rešitev problema. Jedro diplomskega dela predstavljajo optimalne rešitve za vsak digraf ter izračunano število premikov. V zaključku bomo z digrafi stanj vizualizirali prepovedane, dovoljene ter uporabljene premike pri iskanju optimalne rešitve. Končna ugotovitev kaže na to, da podan algoritem za reševanje Hanojskega stolpa z omejenimi premiki daje optimalne rešitve problema. Vsaka druga rešitev daje nujno večje število premikov. Za vsak digraf bomo zapisali natančno formulo za izračun števila premikov.
Keywords:
Hanojski stolp
,
graf
,
digraf
,
rekurzija
,
iteracija
,
število premikov
,
optimalne rešitve.
Place of publishing:
Maribor
Publisher:
[M. Golob]
Year of publishing:
2016
PID:
20.500.12556/DKUM-63944
UDC:
519.1(043.2)
COBISS.SI-ID:
22724360
NUK URN:
URN:SI:UM:DK:X5SFNXUN
Publication date in DKUM:
11.11.2016
Views:
2449
Downloads:
148
Metadata:
Categories:
FNM
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
GOLOB, Martina, 2016,
Hanojski stolp z usmerjenimi premiki diskov
[online]. Bachelor’s thesis. Maribor : M. Golob. [Accessed 15 March 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=63944
Copy citation
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Similar works from our repository:
Hinz, Andreas M.; Parisse, Daniele: On the planarity of Hanoi graphs. - Expo. Math. 20 (2002), no. 3, 263-268
Uporaba teorije grafov pri igrah in drugih realnih problemih
Algoritmi v teoriji grafov
Lastnosti grafov Hanojskega stolpa
Peterin, Iztok(SV-MAREE): A characterization of planar median graphs. (English summary). - Discuss. Math. Graph Theory 26 (2006), no. 1, 41--48.
Similar works from other repositories:
Grafi deliteljev niča nad komutativnimi kolobarji
Grafi deliteljev niča in totalni grafi kolobarjev
Vložitve grafov v topološke knjige
Delne risbe polnih grafov
Izrek Kuratowskega
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Secondary language
Language:
English
Title:
The Tower of Hanoi with forbidden moves
Abstract:
The game the Tower of Hanoi falls within the area of recreational mathematics. We solve it by moving discs from the initial position to the final position according to certain rules. The objective is to use minimal number of moves. In this graduation thesis we deal with the Tower of Hanoi with forbidden moves, which means that there are certain limited moves. We investigate five different cases of Hanoi Tower, which are represented by digraphs. Every digraph is a digraph on three vertices, between which there can be directed edges. In the first part we will introduce the Tower of Hanoi and present basic definitions of graphs. In the next chapter we will deal with the recursive and the iterative solution. The focus of this graduation thesis is on optimal solution of every digraph and calculated number of moves. In the last chapter we will visualize forbidden, allowed and used moves in the search of the optimal solution. The final results show, that the given algorithm for solving Hanoi Tower with forbidden moves provides optimal solution of the problem. Moreover, every distinct solution takes strictly more moves than the given algorithm. We will write down a precise formula for the number of moves for every digraph.
Keywords:
The Tower of Hanoi
,
graph
,
digraph
,
recursion
,
iteration
,
number of moves
,
optimal solutions.
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
