| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:MOBILNA IGRA VARUH ZAKLADA
Authors:ID Pajek, Robert (Author)
ID Guid, Nikola (Mentor) More about this mentor... New window
ID Strnad, Damjan (Comentor)
Files:.pdf UNI_Pajek_Robert_2014.pdf (3,95 MB)
MD5: 4F557924E982A2A6E6AE25809011A958
 
Language:Slovenian
Work type:Bachelor thesis/paper
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V sklopu diplomske naloge smo izdelali mobilno igro Varuh zaklada, v kateri igralec poskuša s postavitvijo stolpov na igralno površino preprečiti tatovom osvojitev zaklada. Tatovi za iskanje poti uporabljajo algoritem A*. Igralec lahko stolpe, ki streljajo na tatove, postavlja na poljubna mesta na igralni površini. V igro smo implementirali 3 vrste stolpov, ki se med seboj ločijo po dometu, ceni ter moči. Vsaka igra je sestavljena iz več valov. Če igralec uniči vse tatove določenega vala, se začne nov val z novim naborom tatov. Ko igralec preživi določeno število valov, je zmagal. Če pa tatovi osvojijo in odnesejo zaklad do izhodiščnega polja na igralni površini, je igralec poražen.
Keywords:mobilna igra, algoritem A*, iskanje poti
Place of publishing:[Maribor
Publisher:R. Pajek
Year of publishing:2014
PID:20.500.12556/DKUM-45591 New window
UDC:519.857:621.397.721.5(043.2)
COBISS.SI-ID:19100182 New window
NUK URN:URN:SI:UM:DK:ARHVY2ZP
Publication date in DKUM:06.11.2015
Views:2022
Downloads:90
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:TREASURE GUARDIAN MOBILE GAME
Abstract:Within the scope of this thesis we developed mobile game Treasure guardian, in which player try to prevent thieves win the treasure by putting towers on the playfield. Thieves search for the best path with the algorithm A*. The player may set towers, which shoot at thieves, at any place on the playfield. In the game we implemented three types of towers, which are differentiated among themselves by range, price and power. Each game consists of several waves. If the player destroys all thieves in a specific wave, he starts a new wave with a new set of thieves. If the player survives a certain number of waves, he wins. However, if the thieves get and take the treasure back to the starting field on the playfield, the player is defeated.
Keywords:mobile game, algorithm A*, path finding


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica