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