Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
Repository of the University of Ljubljana
Open Science Slovenia
Open Science
DiKUL
slv
|
eng
Search
Browse
New in RUL
About RUL
In numbers
Help
Sign in
Details
Grafi stanj za različice Hanojskega stolpa : magistrsko delo
ID
Grbec, Kristina
(
Author
),
ID
Klavžar, Sandi
(
Mentor
)
More about this mentor...
PDF - Presentation file,
Download
(607,57 KB)
MD5: 47FAD3CC852F03560BDDE4452D993871
Image galllery
Abstract
Osnovna igra o Hanojskem stolpu omogoča veliko možnosti za razširitev. Predstavili in rešili bomo nekaj različic te igre. S pomočjo grafov stanj bomo obravnavali lastnosti posamezne različice. Rekurzivna sestava vodi do izpeljave nekaterih lastnosti. Izpeljane vrednosti števila vozlišč, števila povezav, optimalne rešitve in števila optimalnih rešitev bomo primerjali z vrednostmi, ki nam jih vrnejo dokazano optimalni algoritmi.
Language:
Slovenian
Keywords:
grafi stanj
,
Hanojski stolp
,
različice Hanojskega stolpa
,
rekurzija
Work type:
Master's thesis/paper
Typology:
2.09 - Master's Thesis
Organization:
FMF - Faculty of Mathematics and Physics
Year:
2020
PID:
20.500.12556/RUL-119058
UDC:
519.17
COBISS.SI-ID:
26505475
Publication date in RUL:
02.09.2020
Views:
1143
Downloads:
145
Metadata:
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
:
GRBEC, Kristina, 2020,
Grafi stanj za različice Hanojskega stolpa : magistrsko delo
[online]. Master’s thesis. [Accessed 14 March 2025]. Retrieved from: https://repozitorij.uni-lj.si/IzpisGradiva.php?lang=eng&id=119058
Copy citation
Share:
Secondary language
Language:
English
Title:
State graphs for variations of the Tover Hanoi
Abstract:
The basic Tower of Hanoi game is open to many generalizations. We are going to introduce and solve some variations of it. By drawing state graphs for variations of the Tower of Hanoi we are going to analyse some properties of specific variations. Their recursive structure leads to several characteristics. We are going to use proven optimal algorithms to compare the numbers of vertices and edges, optimal solutions and the number of optimal solutions.
Keywords:
state graphs
,
Tower of Hanoi
,
variations of Tower of Hanoi
,
recursion
Similar documents
Similar works from RUL:
Ramsey numbers and their generalizations
Mycielski graphs and their edge chromatic number
Remarks on the Local Irregularity Conjecture
The zero-divisor graphs and total graphs of rings
The zero-divisor graph of a commutative ring
Similar works from other Slovenian collections:
ǂThe ǂchromatic number and the chromatic index of a graph
Minimum number of palettes in edge coloring
Properties of the graphs of the Tower of Hanoi
Rainbow connection in graphs
Vizingov izrek in snarki
Back