Penerapan Algoritma A* Pada NPC (Non Player Character) Dalam Game Escape From Maze
Total View This Week0
Total View This Week0
Institusion
Universitas Katolik Musi Charitas
Author
., Heriadi
Subject
T Technology (General)
Datestamp
2018-11-14 11:54:55
Abstract :
The A * algorithm is the best path finding algorithm and combination of Djikstra and BFS algorithms. These three algorithms use non-directional weights graph as the basic concept of trace search. The A * algorithm applies heuristic to find the most optimum solution. This research attempts to apply the A * algorithm to NPC in the Escape From Maze game. NPC (Non-Player Character) is a game-controlled virtual agent, interacting with other NPCs, or with a human-controlled character player. Application of the A * algorithm is built to help the character player complete his mission in finding a way out in a maze.
The A * algorithm is the best path finding algorithm and combination of Djikstra and BFS algorithms. These three algorithms use non-directional weights graph as the basic concept of trace search. The A * algorithm applies heuristic to find the most optimum solution. This research attempts to apply the A * algorithm to NPC in the Escape From Maze game. NPC (Non-Player Character) is a game-controlled virtual agent, interacting with other NPCs, or with a human-controlled character player. Application of the A * algorithm is built to help the character player complete his mission in finding a way out in a maze.
File :
IF-2018-1113020-cover.pdf
IF-2018-1113020-abstract.pdf
IF-2018-1113020-complete.pdf
IF-2018-1113020-summary_id.pdf
IF-2018-1113020-tableofcontent.pdf
IF-2018-1113020-chapter1.pdf
IF-2018-1113020-chapter2.pdf
IF-2018-1113020-chapter3.pdf
IF-2018-1113020-chapter4.pdf
IF-2018-1113020-conclusion.pdf
IF-2018-1113020-reference.pdf
IF-2018-1113020-attachment.pdf
Download
book
BibTex
Latex, Jabref
cloud_download
Original Resource
url resource Institution
