magistrsko delo
Kristina Grbec (Author), Sandi Klavžar (Mentor)

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.

Keywords

grafi stanj;Hanojski stolp;različice Hanojskega stolpa;rekurzija;

Data

Language: Slovenian
Year of publishing:
Typology: 2.09 - Master's Thesis
Organization: UL FMF - Faculty of Mathematics and Physics
Publisher: [K. Grbec]
UDC: 004.42
COBISS: 26505475 Link will open in a new window
Views: 843
Downloads: 113
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: State graphs for variations of the Tover Hanoi
Secondary 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.
Secondary keywords: state graphs;Tower of Hanoi;variations of Tower of Hanoi;recursion;
Type (COBISS): Master's thesis/paper
Study programme: 0
Embargo end date (OpenAIRE): 1970-01-01
Thesis comment: Univ. v Ljubljani, Fak. za matematiko in fiziko, Oddelek za matematiko, Pedagoška matematika
Pages: XI, 61 str.
ID: 12021452
Recommended works:
, magistrsko delo
, magistrsko delo
, na dvopredmetnem študijskem programu 2. stopnje Izobraževalna matematika
, diplomsko delo
, doctoral thesis