Pathfinding newbie needs help

[masamunelord]

Pretty much stuck on AI path finding part.

I can use navcells to draw walkable map

Sure I can implement A* based on the map but there are few problems:

• Is it normal that some scenes in the dungeon is not returned unless you walk closer to the scene? Right now there are areas that are cut off if the character is far away from it. Or perhaps i did something wrong in the library.
• What would be the best approach/algo if im going to navigate through the entire dungeon, how do I know each destination the character needs to go through to clear the entire dungeon?
• I have no idea what NavGridSquares do?
• I keep on hearing people navigate easily using NavMesh, how exactly is that being achieved?

I have searched everywhere and simply cannot find any anwsers.

Thanks and cheers!

[Valtharak]

yes only scenes close to you are shown. and i think the game unload scenes that are far from you so you have to cache scenes on your side if you want to do long path finding.

if you want to explore everything you have to add some info to your scenes to mark them as explorered or not and such

navgridsquare is simply an other way to know the walkable area rather then navcell , each square is 2.5 unit. each square has a navgridflag like the navcell has

some poeple create a waypoint system using the center of the navcell and link them all together

[ValvePro]

Here is a function that show you if the coords are walkable or not => 0x8F3560

[infotech1]

there is a very basic a* implementation i wrote in mooege which uses the navgridsquares + handles scene > scene. Was written a while ago though, few more of the fields in the nav data are known now i think.

[kinouxe]

Here is a function that show you if the coords are walkable or not => 0x8F3560

Hello, i'm interested by this "function" but i don't know how to use it (offset, memoryread?)

Thanks