Jump to content

Question about WebWalking.


Recommended Posts

Posted (edited)

Hi man,

 

Almost all taught pathfinding algorithm will be good enough. A* is best pathfinding for games, and is modification of base work done by Dijkstra. Dijkstra is easiest to implement.

 

If you implement by hand, and distances are short, just do Dijkstra because A* weighted nodes are pain in my asshole. Why you need implement your own pathfind method, though? Bot client already got some algorithm implement. For obstacle handle write method and call when you need.

Edited by FuckingAshole

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
  • Recently Browsing   0 members

    • No registered users viewing this page.
×
×
  • Create New...