The "AI" in this case is trivial, it's just a graph search algorithm finding the path in the graph.
You could look into A* search algorithm for more detail. In this case I think Dijkstra or even simpler BFS which is 20 lines of code to implement will work.
nice work!
but you have to prevent the npc from walking through a corner! its not hard to do
DasAntiNaziBroetchen 1 year ago
wow that's nice, could you make a tutorial on the AI
loriobrothers 2 years ago 3
The "AI" in this case is trivial, it's just a graph search algorithm finding the path in the graph.
You could look into A* search algorithm for more detail. In this case I think Dijkstra or even simpler BFS which is 20 lines of code to implement will work.
HenryKorol 2 years ago