diplomsko delo
Robert Pajek (Author), Nikola Guid (Mentor), Damjan Strnad (Co-mentor)

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

mobilne igre;algoritem A;iskanje poti;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: R. Pajek
UDC: 519.857:621.397.721.5(043.2)
COBISS: 19100182 Link will open in a new window
Views: 1049
Downloads: 43
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: TREASURE GUARDIAN MOBILE GAME
Secondary 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.
Secondary keywords: mobile game;algorithm A;path finding;
URN: URN:SI:UM:
Type (COBISS): Bachelor thesis/paper
Thesis comment: Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije
Pages: VI, 36 f.
ID: 9063598