Jump to content

  • Log In with Google      Sign In   
  • Create Account

Interested in a FREE copy of HTML5 game maker Construct 2?

We'll be giving away three Personal Edition licences in next Tuesday's GDNet Direct email newsletter!

Sign up from the right-hand sidebar on our homepage and read Tuesday's newsletter for details!


A* pathfinding


Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.

  • You cannot reply to this topic
1 reply to this topic

#1 dragagon   Members   -  Reputation: 122

Like
Likes
Like

Posted 17 March 2000 - 06:02 AM

I''m looking for some general algorithms for either dijkstra''s or the A* algorithm, i am trying to write a game baased on weighted hexagons and i find a good size of information but nothing that is general enough for me to modify into my own pathfinding search routine If at first you don''t succeed, give up, someone else will try

Sponsor:

#2 Spellbound   Members   -  Reputation: 122

Like
Likes
Like

Posted 17 March 2000 - 07:40 AM

Check out Amit's Game Programming Information, there's a lot of AI and pathfinding info. In fact there is _only_ AI and pathfinding info there.

Oh, and you should go with A* or one of its derivatives as it is the best pathfinding algorithm.

Edited by - Spellbound on 3/17/00 1:41:52 PM




Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.



PARTNERS