Implementation Of Dynamic Programming Algorithm For Npc Movement In Police And Thief Game

0Citations
Citations of this article
39Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 from 10 tests 90% success rate for Dynamic Programming to help police in this game to find the closest path to attack players

Cite

CITATION STYLE

APA

Fawwaz, I., Winarta, A., Selvianna, Ramli, J. J., & Waruwu, L. M. (2019). Implementation Of Dynamic Programming Algorithm For Npc Movement In Police And Thief Game. Journal of Information Technology Education: Research, 2(2), 114–121. https://doi.org/10.31289/jite.v2i2.2169

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free