ID:1796200
 
(See the best response by Ter13.)
Problem description:
Can someone help point me in the right direction of creating an A* pathfinding algorithm compatible with pixel movement.

I can't seem to see things past a grid of tiles. I was wondering if someone would be so kind to help me see things from a different perspective.

Best response
A* pathing works with any nodegraph. The problem is that free-flow pixel movement can't be represented efficiently with a nodegraph. You want to look up Navmeshes.
you can use developers help and find any good and working path finding libs
http://www.byond.com/developer/?text=tag%3apathfinding
None of those are going to work very well for pixel movement. Nobody's developed a Navmesh approach for DM yet. I'm going to have to tackle it at some point this spring, and even I'm dreading it.