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

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