Tile based pathfinding?

I’m making a Pokémon Mystery Dungeon gameplay remake (I don’t plan on releasing it). But I’m struggling on how I would make the enemies go towards the player in a turn based way.

I already have the tile based movement figured out. I just need to figure out how to go about making the enemies find the player.

Anybody know where I could start?

1 Like

You can use any pathfinding algorithm, like Breadth First Search or A*, to generate a path between the enemy’s current tile and the player’s current tile. Then have the enemy move to each tile in the path for however movement points it has.

2 Likes

This topic was automatically closed 14 days after the last reply. New replies are no longer allowed.