prikaz prve stranice dokumenta Rješavanje problema jednodimenzionalnog pasijansa
Access restricted to authenticated users
undergraduate thesis
Rješavanje problema jednodimenzionalnog pasijansa
2023. urn:nbn:hr:166:151747
Krstičević, Lucija
University of Split
Faculty of Science
Department of Informatics

Cite this document

Krstičević, L. (2023). Rješavanje problema jednodimenzionalnog pasijansa (Undergraduate thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:151747

Krstičević, Lucija. "Rješavanje problema jednodimenzionalnog pasijansa." Undergraduate thesis, University of Split, Faculty of Science, 2023. https://urn.nsk.hr/urn:nbn:hr:166:151747

Krstičević, Lucija. "Rješavanje problema jednodimenzionalnog pasijansa." Undergraduate thesis, University of Split, Faculty of Science, 2023. https://urn.nsk.hr/urn:nbn:hr:166:151747

Krstičević, L. (2023). 'Rješavanje problema jednodimenzionalnog pasijansa', Undergraduate thesis, University of Split, Faculty of Science, accessed 24 November 2024, https://urn.nsk.hr/urn:nbn:hr:166:151747

Krstičević L. Rješavanje problema jednodimenzionalnog pasijansa [Undergraduate thesis]. Split: University of Split, Faculty of Science; 2023 [cited 2024 November 24] Available at: https://urn.nsk.hr/urn:nbn:hr:166:151747

L. Krstičević, "Rješavanje problema jednodimenzionalnog pasijansa", Undergraduate thesis, University of Split, Faculty of Science, Split, 2023. Available at: https://urn.nsk.hr/urn:nbn:hr:166:151747

Please login to the repository to save this object to your list.
Metadata
TitleRješavanje problema jednodimenzionalnog pasijansa
Title (english)Solving One-Dimensional Solitaire Problem
AuthorLucija Krstičević
MentorBranko Žitko (mentor)
Committee memberBranko Žitko (predsjednik povjerenstva)
Committee memberAni Grubišić (član povjerenstva)
Committee memberInes Šarić-Grgić (član povjerenstva)
GranterUniversity of Split
Faculty of Science
(Department of Informatics)
Split
Defense date and country2023-09-26, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Problem jednodimenzionalnog pasijansa je problem iz područja kombinatorike. Cilj je pronaći pozicije na kojima se u početnoj konfiguraciji nalazi prazna pozicija te pozicije na kojima se na kraju može nalaziti preostali klin. Kako bi riješili problem korištena je strategija smanji-pa-vladaj, a algoritam korišten za razvoj algoritma je algoritam pretraživanja u dubinu (DFS). Algoritamsko rješenje je implementirano u programskom jeziku Python.
Abstract (english)
The problem of one-dimensional Solitaire is a combinatorial problem. The objective is to find the positions where the empty slot is initially located and the positions where the remaining peg can end up at the end. To solve the problem, a divide-and-conquer strategy is employed, and the algorithm used for algorithm development is Depth-First Search (DFS). The algorithmic solution has been implemented in the Python programming language.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:151747
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 authenticated users
Terms of useLicence In copyright icon
Created on2023-10-18 12:26:08