prikaz prve stranice dokumenta Računalna igra zasnovana na potrazi za hamiltonovskim ciklusom u neusmjerenom grafu
No public access
undergraduate thesis
Računalna igra zasnovana na potrazi za hamiltonovskim ciklusom u neusmjerenom grafu
Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing, 2019. urn:nbn:hr:168:310018
Petrač, Toma
University of Zagreb
Faculty of Electrical Engineering and Computing

Institutional repository: FER Repository

Cite this document

Petrač, T. (2019). Računalna igra zasnovana na potrazi za hamiltonovskim ciklusom u neusmjerenom grafu (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:310018

Petrač, Toma. "Računalna igra zasnovana na potrazi za hamiltonovskim ciklusom u neusmjerenom grafu." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2019. https://urn.nsk.hr/urn:nbn:hr:168:310018

Petrač, Toma. "Računalna igra zasnovana na potrazi za hamiltonovskim ciklusom u neusmjerenom grafu." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2019. https://urn.nsk.hr/urn:nbn:hr:168:310018

Petrač, T. (2019). 'Računalna igra zasnovana na potrazi za hamiltonovskim ciklusom u neusmjerenom grafu', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 16 July 2024, https://urn.nsk.hr/urn:nbn:hr:168:310018

Petrač T. Računalna igra zasnovana na potrazi za hamiltonovskim ciklusom u neusmjerenom grafu [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2019 [cited 2024 July 16] Available at: https://urn.nsk.hr/urn:nbn:hr:168:310018

T. Petrač, "Računalna igra zasnovana na potrazi za hamiltonovskim ciklusom u neusmjerenom grafu", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2019. Available at: https://urn.nsk.hr/urn:nbn:hr:168:310018

Metadata
TitleRačunalna igra zasnovana na potrazi za hamiltonovskim ciklusom u neusmjerenom grafu
Title (english)Computer Game Based on Hamiltonian Cycle Search in an Undirected Graph
AuthorToma Petrač
MentorMario Osvin Pavčević (mentor)
Committee memberMario Osvin Pavčević (predsjednik povjerenstva)
Committee memberMario Krnić (član povjerenstva)
Committee memberDomagoj Kovačević (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2019-07-12, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Lewis in a Maze jednostavna je računalna logička igra napisana u programskom jeziku Python. Cilj igre je u zadanom vremenu riješiti što više slučajno nacrtanih grafova, na način da se, za svaki od njih, pronađe jedan Hamiltonov put. Ako takav put ne postoji u grafu, potrebno je pritisnuti gumb za nerješivost grafa. Postoje tri različite razine koje igrač može odabrati. O tim razinama ovisi broj vrhova grafova koje treba riješiti, kao i koeficijent kojim se na kraju igre množi ukupan broj bodova. Rezultati se mogu spremiti u tablicu s rezultatima (bazu podataka, highscores). Grafičko sučelje igre realizirano je Pythonovom standardnom bibliotekom tkinter, a tablica s rezultatima standardnom bibliotekom sqlite3. Što se tiče crtanja grafova, iskorištena je i modificirana vanjska biblioteka netgraph: open-source projekt s github repozitorija za upravljanje, stvaranje i prikazivanje grafova. Glavni algoritam koji se koristi za pronalazak svih Hamiltonovih putova u grafu je iscrpna pretraga s backtrackingom.
Abstract (english)
Lewis in a Maze is a simple computer puzzle game written in a programming language called Python. Goal of the game is to solve as many graphs as possible, in the given time. To solve a graph means to find a Hamiltonian path in it. If such a path doesn't exist, it is possible to state so by pressing the „Unsolvable“ button. There are three difficulties to choose. Depending on those difficulties, the number of nodes in a graph varies, as well as the factor which multiplies total collected points at the end of the game. Results can be saved to table with the highscores (database file). Graphic user interface (GUI) is implemented with the Python's standard module, tkinter, while the highscores are implemented with sqlite3. As for graph plotting, an external library called netgraph is used and modified. It is an open-source project from the github repository for managing, creating and plotting (displaying) graphs. The main algorithm used for finding all the Hamiltonian paths in the graph is the bruteforce algorithm with backtracking.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:310018
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 on2020-01-07 21:16:58