Get_Dist Without Diagonals, and counting obstacles.

BYOND Forums

Announcements · BYOND Help · Bug Reports · Feature Requests · Beta Testers · Beta Bugs · Developer Help · Design Philosophy · Demos & Libraries · Tutorials & Snippets · Art & Sound · Classified Ads · Game Updates · Contests & Events · Linux Talk · On Topic · Off Topic

ID:156624

Aug 25 2010, 1:03 pm

Asellia

Hi. I'm sorry to be posting this in this specific forum, as, it may belong in Code Problems. The thing is, I know this would require INTENSE math, and I am quite bad with my math skills. Not sure I should be programming, but, I enjoy it.

Overall, I want to make a get_dist proc that doesn't use diagonals, and puts obstacles into account. Does anyone have a library, or is there an actual proc for this? Thank you!

Aug 25 2010, 1:55 pm
Ter13	Search for A* pathfinding. It's easier than you may thing. There is no linear solution, though, it's pretty processor heavy.

Aug 25 2010, 2:17 pm In response to Ter13
Asellia	Ter13 wrote: Search for A* pathfinding. It's easier than you may thing. There is no linear solution, though, it's pretty processor heavy. A* Did the trick, thank you Ter13! I basically just used the A*GetPath, and checked its length (Number of turfs, the minimum amount) compared to the players max movement, and if it was less or same, it lets them move there.