prikaz prve stranice dokumenta Rješavanje problema obilaska skakača svih polja na šahovskoj ploči korištenjem genetskih algoritama
No public access
undergraduate thesis
Rješavanje problema obilaska skakača svih polja na šahovskoj ploči korištenjem genetskih algoritama
2018. urn:nbn:hr:168:800073
Palić, Kristijan
University of Zagreb
Faculty of Electrical Engineering and Computing

Cite this document

Palić, K. (2018). Rješavanje problema obilaska skakača svih polja na šahovskoj ploči korištenjem genetskih algoritama (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:800073

Palić, Kristijan. "Rješavanje problema obilaska skakača svih polja na šahovskoj ploči korištenjem genetskih algoritama." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2018. https://urn.nsk.hr/urn:nbn:hr:168:800073

Palić, Kristijan. "Rješavanje problema obilaska skakača svih polja na šahovskoj ploči korištenjem genetskih algoritama." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2018. https://urn.nsk.hr/urn:nbn:hr:168:800073

Palić, K. (2018). 'Rješavanje problema obilaska skakača svih polja na šahovskoj ploči korištenjem genetskih algoritama', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 01 February 2025, https://urn.nsk.hr/urn:nbn:hr:168:800073

Palić K. Rješavanje problema obilaska skakača svih polja na šahovskoj ploči korištenjem genetskih algoritama [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2018 [cited 2025 February 01] Available at: https://urn.nsk.hr/urn:nbn:hr:168:800073

K. Palić, "Rješavanje problema obilaska skakača svih polja na šahovskoj ploči korištenjem genetskih algoritama", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2018. Available at: https://urn.nsk.hr/urn:nbn:hr:168:800073

Please login to the repository to save this object to your list.
Metadata
TitleRješavanje problema obilaska skakača svih polja na šahovskoj ploči korištenjem genetskih algoritama
Title (english)Solving Knight's Tour Problem by Using Genetic Algorithms
AuthorKristijan Palić
MentorMarin Golub (mentor)
Committee memberMarin Golub (predsjednik povjerenstva)
Committee memberDomagoj Alagić (član povjerenstva)
Committee memberMladen Karan (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2018-07-13, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
U ovom radu dan je kratak uvod u optimizacijske probleme i genetski algoritam te se genetskim algoritmom pristupilo problemu rješavanja obilaska skakača svih polja na šahovskoj ploči. Takod̄er je uvedena heuristika kao dodatak genetskom algoritmu. Pokazani su nedostatci primjene GA na ovakav tip problema te je dano nekoliko načina rješavanja koji su bolji i efikasniji.
Abstract (english)
In this paper short intro to optimization problems and genetic algorithm is given. Genetic algorithm was used to solve knight’s tour problem, and heuristic has been implemented when GA was found to be non-optimal solution. Flaws of GA were stated and also some other approaches that would bear better results.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:800073
Study programmeTitle: Computing
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsClosed access
Terms of useLicence In copyright icon
Public note
Created on2019-03-13 23:36:21