prikaz prve stranice dokumenta Rješavanje 15-slagalice
Access restricted to students and staff of home institution
undergraduate thesis
Rješavanje 15-slagalice
2015. urn:nbn:hr:166:378330
Franić, Ana
University of Split
Faculty of Science
Department of Informatics

Cite this document

Franić, A. (2015). Rješavanje 15-slagalice (Undergraduate thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:378330

Franić, Ana. "Rješavanje 15-slagalice." Undergraduate thesis, University of Split, Faculty of Science, 2015. https://urn.nsk.hr/urn:nbn:hr:166:378330

Franić, Ana. "Rješavanje 15-slagalice." Undergraduate thesis, University of Split, Faculty of Science, 2015. https://urn.nsk.hr/urn:nbn:hr:166:378330

Franić, A. (2015). 'Rješavanje 15-slagalice', Undergraduate thesis, University of Split, Faculty of Science, accessed 18 November 2024, https://urn.nsk.hr/urn:nbn:hr:166:378330

Franić A. Rješavanje 15-slagalice [Undergraduate thesis]. Split: University of Split, Faculty of Science; 2015 [cited 2024 November 18] Available at: https://urn.nsk.hr/urn:nbn:hr:166:378330

A. Franić, "Rješavanje 15-slagalice", Undergraduate thesis, University of Split, Faculty of Science, Split, 2015. Available at: https://urn.nsk.hr/urn:nbn:hr:166:378330

Please login to the repository to save this object to your list.
Metadata
TitleRješavanje 15-slagalice
Title (english)Solving the 15-Puzzle
AuthorAna Franić
MentorBranko Žitko (mentor)
Committee memberBranko Žitko (predsjednik povjerenstva)
Committee memberAni Grubišić (član povjerenstva)
Committee memberDivna Krpan (član povjerenstva)
GranterUniversity of Split
Faculty of Science
(Department of Informatics)
Split
Defense date and country2015-09-25, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Poopćenje 15-slagalice je problem pronalaska rješenja n-slagalice za bilo koji n. U nekim je radovima dokazano da je za veće verzije n-slagalice, pronalaženje rješenja lako, ali problem pronalaženja najkraćeg rješenja NP-teško. Tako je na primjer, za 15-slagalicu, opseg optimalnih rješenja od 0 do 80 pomaka prazne pločice ili 43 mnogostruka pomaka. U ovom radu je prikazan postupak optimalnog rješavanja problema n-slagalice korištenjem algoritma pretraživanja. Algoritam pretraživanja je implementiran u programskom jeziku Python. Za kraj su analizirani rezultati njegovog izvršavanja te je dokazana njegova složenost.
Abstract (english)
Generalization of 15-puzzle is problem of finding n-puzzle for any n. In some articles is proved that for larger versions of the n-puzzle, finding a solution is easy, but the problem of finding the shortest solution is NP-hard. For example, for the 15-puzzle, lengths of optimal solutions range is from 0 to 80 single-tile moves or 43 multi-tile moves. In this article is shown process of optimal solving n-puzzle problem using search algorithm. Search algorithm is implemented in Python programming language. Ultimately, results of his execution are analyzed and complexity of algorithm is proven.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:378330
Study programmeTitle: Computer Science
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike)
Type of resourceText
File originBorn digital
Access conditionsAccess restricted to students and staff of home institution
Terms of useLicence In copyright icon
Created on2017-05-22 15:22:10