Open AccessPenerapan Algoritma Dynamic Programing pada Pergerakan Lawan dalam Permainan Police and Thief
Author(s) -
Insidini Fawwaz,
Agus Winarta
Publication year - 2019
Publication title -
jite (journal of informatics and telecommunication engineering)
Language(s) - English
Resource type - Journals
eISSN - 2549-6255
pISSN - 2549-6247
DOI - 10.31289/jite.v2i2.2169
Subject(s) - dynamic programming , path (computing) , computer science , shortest path problem , sequential game , meaning (existential) , class (philosophy) , artificial intelligence , algorithm , mathematics , theoretical computer science , programming language , mathematical economics , game theory , psychology , graph , psychotherapist
Games have the basic meaning of games, games in this case refer to the notion of intellectual agility. In its application, a Game certainly requires an AI (Artificial Intelligence), and the AI used in the construction of this police and thief game is the dynamic programming algorithm. This algorithm is a search algorithm to find the shortest route with the minimum cost, algorithm dynamic programming searches for the shortest route by adding the actual distance to the approximate distance so that it makes it optimum and complete. Police and thief is a game about a character who will try to run from police. The genre of this game is arcade, built with microsoft visual studio 2008, the AI used is the Dynamic Programming algorithm which is used to search the path to attack players. The results of this test are police in this game managed to find the closest path determined by the Dynamic Programming algorithm to attack players