Bay 12 Games Forum

..

Thanks, this looks awesome.. i just have to think of how to complement the two methods efficiently..
The point is it looks a lot more "heavy" to calculate, and if i don't do it every turn the monster might just end up where i was some turns before instead of on top of me..

..

Yes, i think i'll let the normal moster act like this..

I want to make the standard pathfinding ALWAYS finding the player, because i want some monsters to be able to do so; then i plan to limit the standard monster by sight/hearing (depending on witch type of monster it is)

I'm working on a turn-based roguelike in c, but i'm stuck on the pathfinding; and i would like a little help here:
I have some mosters and a hero, some walls etc. The maps are generated in a semi-random way; and i need some sort of AI to find which way to go to get to the hero in the fastest way. I tried creating differents kind of AI, but most of them aren't applicable in a random map, and the only one AI (i can think of) that works on all kind of maps just tries everything and writes down how many turns would take if the monster choose that way, then decides to go for the shortest..
The problem should be solved but an AI of this kind in a pretty big map, with several different monster would take too long to process.
Can you guys let me see some kind of codes (possibly in c since is the only programming language i'm confident in, or some other language that's pretty similiar to it) that handles the AI for pathfinding?
Thanks in advance.