300 KB3054 KB155 KB0 KB2004Klavžar, SandiMilutinović, UrošPetr, Ciril112 straniIX, 102 str., 30 cmCOBISSID:13020761URN:URN:NBN:SI:doc-FCUAES0EslC. Petrvisokošolska dela1-popolna kodaalgoritmicomputer scienceDisertacijegrafi SierpińskegaHanojski stolpiKombinatorikanajkrajša potračunalništvoKombinatorika posplošenih Hanojskih stolpov| doktorska disertacija|We introduce a complete description of the state of generalized Towers of Hanoi, and partial description in which only positions of the top-most discs are specified. We define a mapping from the complete to the incomplete description, analyze its surjectivity and injectivity, count the elements in the image of this map, i.e. all the different partial descriptions, compute the cardinality of the preimages, give the condition for a partial description to have the unique complete description, and count all such partial descriptions. We define a state graph of generalized Towers of Hanoi. We look at some of the induced subgraphs. We count the number of edges in the graph in two different ways. We also count the number of moves of a certain disc, and calculate the minimum, maximum and average degree of the graph. Wedefine five strategies for solving the generalized Towers of Hanoi problem, including the presumed optimal strategies of Frame and Stewart. We prove that they are equivalent with respect to the number of discs moves. We prove the existence and describe all 1-perfect codes in Sierpiński graphs, which represent the state graphs of the generalized Towers of Hanoi with modified rules for moving discs. This result is a generalization of previously known results about the graphs of Towers of Hanoi with three pegs, where the approach is intrinsically different. We also present the optimal decoding algorithm, which for a given 1-perfect code and a vertex of a graph decides whether it is a code vertex, and if not, find its nearest code vertexVpeljemo popoln opis stanja posplošenih Hanojskih stolpov in delni opis, s katerim opišemo le razmestitev vrhnjih ploščic. Definiramo preslikavo iz popolnega v delni opis, ugotavljamo njeno surjektivnost, injektivnost, preštejemo elemente v sliki te preslikave, to je vse različne delne opise, računamo moč praslik, navedemo pogoj, kdaj delnemu opisu ustreza enoličen popolni opis, in preštejemo vse take delne opise stanj. Definiramo graf stanj posplošenih Hanojskih stolpov. Ogledamo si nekatere inducirane podgrafe. Na dva načina preštejemo vse povezave v grafu, preštejemo tudi število prestavitev posamezne ploščice ter izračunamo minimalno, maksimalno in povprečno stopnjo grafa. Definiramo pet strategij reševanja problema posplošenih Hanojskih stolpov, med katerimi sta tudi domnevno optimalni Framova in Stewartova strategija. Dokažemo, da so enakovredne glede na število premikov ploščic. Dokažemo obstoj in opišemo vse 1-popolne kode v grafih Sierpińskega, ki predstavljajo grafe stanj posplošenih Hanojskih stolpov s spremenjenim pravilom prestavljanja ploščic. Ta rezultat je posplošitev znanih rezultatov o grafih Hanojskih stolpov s tremi položaji, pri katerih pa je pristop bistveno drugačen. Podamo tudi optimalen dekodirni algoritem, ki za dano 1-popolno kodo in točko grafa ugotovi, ali je kodna točka. Če ni, poišče njej najbližjo kodno točkodoktorska disertacijaTEXTvisokošolska delatheses and dissertationsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza v Mariboru, Pedagoška fakulteta