scholarly journals Guiding dynamic programing via structural probability for accelerating programming by example

2020 ◽  
Vol 4 (OOPSLA) ◽  
pp. 1-29
Author(s):  
Ruyi Ji ◽  
Yican Sun ◽  
Yingfei Xiong ◽  
Zhenjiang Hu
2011 ◽  
pp. 805-805
Author(s):  
Thomas Zeugmann ◽  
Pascal Poupart ◽  
James Kennedy ◽  
Xin Jin ◽  
Jiawei Han ◽  
...  

2019 ◽  
Vol 2 (2) ◽  
pp. 114
Author(s):  
Insidini Fawwaz ◽  
Agus Winarta

<p class="8AbstrakBahasaIndonesia"><em>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 </em><em>police.</em><em> The genre of this game is arcade, built with microsoft visual studio 2008, the AI used is the </em><em>Dynamic Programming</em> <em>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 </em><em>Dynamic Programming</em> <em>algorithm to attack players</em></p>


1976 ◽  
Vol 12 (6) ◽  
pp. 1291-1297 ◽  
Author(s):  
Pradit Nopmongcol ◽  
Arthur J. Askew
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document