So I am really into algorithms and i have been researching pathfinding and the various algorithms and methodology behind it.
After some very intruiging research i have gotten down to the nitty-gritty of making my own algorithm and I am happy to announce i have a working algorithm for any obstacle and [in theory] it takes less steps and time than traditional pathfinding algorithms (such as A* and Dijkstra's algorithm) .
for ex.) I had set up a 100x100 "tile" maze and after 6 steps into the algorithm it had a definite path from the start to finish. As far as i know 6 steps is very impressive-
Its not completely worked out, however most of the algorithm is complete! I wont release any code [today] , however I would like to know: Do we really need more efficient or faster path-finding algorithms? Clearly its good for AI movement in real world situations but do other algorithms meet the criteria for a sufficiently moving AI?