diplomsko delo
Abstract
V tej diplomski nalogi se je reševal problem iskanja najboljše strategije pri igri Kača, ki nas bi ponesla do najboljšega rezultata. Problem pri tem je, da je mogočih neskončno različnih strategij, vsaka pa ima svoje prednosti in slabosti. Za reševanje problema se je najprej izdelalo osnovno igro Kača. Na njej se je potem implementiralo in izdelalo različne algoritme umetne inteligence, pri čemer vsak uporablja svojo strategijo. Ko je igra delovala, se je začelo z izdelavo algoritmov. Algoritme se je izdelalo enega za drugim. Rezultati se primerjajo po največji dolžini kače, številih premikov in številih poskusov.
Keywords
GameMaker Studio 2;razvoj igre;algoritmi;visokošolski strokovni študij;diplomske naloge;
Data
Language: |
Slovenian |
Year of publishing: |
2022 |
Typology: |
2.11 - Undergraduate Thesis |
Organization: |
UL FRI - Faculty of Computer and Information Science |
Publisher: |
[B. Mokrin] |
UDC: |
004.5:794(043.2) |
COBISS: |
125773827
|
Views: |
23 |
Downloads: |
10 |
Average score: |
0 (0 votes) |
Metadata: |
|
Other data
Secondary language: |
English |
Secondary title: |
Strategy comparison in the Snake game |
Secondary abstract: |
This paper solves the problem of looking for the best strategy in the Snake game that would ensure the best result. The problem is that there are countless possible strategies, with each having its strengths and weaknesses. To solve the problem, the basic Snake game was first created. After that, various artificial intelligence algorithms were created and implemented, with each using its own strategy. When the game was functional, algorithms were created one after another. Results are compared in terms of snake length, number of moves and number of tries. |
Secondary keywords: |
computer games;GameMaker Studio 2;game development;algorithms;computer science;diploma;Videoigre;Umetna inteligenca;Računalništvo;Univerzitetna in visokošolska dela; |
Type (COBISS): |
Bachelor thesis/paper |
Study programme: |
1000470 |
Embargo end date (OpenAIRE): |
1970-01-01 |
Thesis comment: |
Univ. v Ljubljani, Fak. za računalništvo in informatiko |
Pages: |
60 str. |
ID: |
16746405 |