Rješavanje problema obilaska skakača svih polja na šahovskoj ploči korištenjem genetskih algoritama

undergraduate thesis

• Title (english): Solving Knight's Tour Problem by Using Genetic Algorithms
• Author: Kristijan Palić
• Mentor: Marin Golub (mentor)
• Committee member: Marin Golub (predsjednik povjerenstva)
• Committee member: Domagoj Alagić (član povjerenstva)
• Committee member: Mladen Karan (član povjerenstva)
• Granter: University of Zagreb; Faculty of Electrical Engineering and Computing; Zagreb
• Defense date and country: 2018-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: Optimizacija; genetski algoritam; heuristika; šah
• Keywords (english): Optimization; genetic algorithm; heuristic; chess
• Language: croatian
• URN:NBN: urn:nbn:hr:168:800073
• Study programme: Title: 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 resource: Text
• File origin: Born digital
• Access conditions: Closed access
• Created on: 2019-03-13 23:36:21