Try new release: COBISS+
 Shared database: COBIB.SI - Union bibliographic/catalogue database (No. of records: 5.029.354)

Selected record permalink

AuthorPetr, Ciril
Title Posplošitve klasičnega problema hanojskih stolpov : magistrska naloga / Ciril Petr ; [mentor Sandi Klavžar ; komentor Peter Kokol]
Other titlesGeneralizations of the classical towers of Hanoi problem
Type/contenttype of material master's thesis
LanguageSlovenian
Publication date1998
Publication and manufactureMaribor : [C. Petr], 1998
Other authorsKlavžar, Sandi
Kokol, Peter, 1957-
Physical description107 f. : graf. prikazi, tabele ; 30 cm
NotesLiteratura: str. 102-104
Bibliografija: str. 106-107
Povzetek ; Abstract
Mag. delo, Univerza v Mariboru, Fakulteta za elektrotehniko, računalništvo in informatiko, 1998
Uncontrolled subject headingshanojski stolpi / posplošeni hanojski stolpi / Revova uganka / domnevno optimalna rešitev / Pascalov trikotnik / Grayeva koda / Sierpińskijev trikotnik / optimizacija / algoritem / iteracija / graf stanj / towers of Hanoi / generalized towers of Hanoi / Reve's puzzle / presumed optimal solution / Pascal's triangle / Gray code / Sierpiński's triangle / optimization / algorithm / iteration / state graph
UDC519.1
519.68
SummaryV delu obravnavamo klasični problem hanojskih stolpov, hanojske stolpe z več kot tremi položaji in različico z vzporednimi premiki. Predstavimo osnovni formalizem za opis problemov. Z Dijkstrovim algoritmom iščemo razdalje med stanji hanojskih stolpov z več položaji. Razvijemo več rekurzivnih in iterativnih algoritmov za reševanje problemov. Prikažemo povezave med klasičnimi hanojskimi stolpi in nekaj znanimi matematičnimi strukturami: Grayevo kodo ter Sierpińskijevim in Pascalovim trikotnikom.
This work deals with the classical towers of Hanoi problem, towers of Hanoi problem with multiple pegs and a variant with parallel moves. We present basic formalism for problems description. We have applied Dijkstra's algorithm to search distances between the states of towers of Hanoi with multiple pegs. Some recursive and iterative algorithms for solving these problems are developed. We show the relations of the classical towers of Hanoi problem to some well known mathematical structures: Gray code, Sierpiński's and Pascal's triangle.
COBISS.SI-ID327957

Holdings in libraries

View catalogue:  

info Select a library and check if the item is actually available for loan!
No. Institution/library name Place Acronym For loan Other holdings
Library of Technical Faculties, Maribor Maribor KTFMB 001availability reading room: 1 Cop. Library of Technical Faculties, Maribor
Institute of Information Science, Maribor Maribor IZUM 002availability reading room: 1 Cop. Institute of Information Science, Maribor