Thread: pathfinding and lists???

Hi
I am trying some pathfinding in 2d labyrinth,first improvised code and AI get stuck at one point in 2d Labyrinth
so second attempt I have researched pathfinding and found some tutorial and its about openlist and closelist
I thought I would start with simpler 4way solution first
maybe some tip about exercise for list program first,to understand lists first,which is new to me
or maybe tree's are better solutions?

Did you research the topic before you started coding?
Maze solving algorithm - Wikipedia

Originally Posted by I C everything

Hi
I am trying some pathfinding in 2d labyrinth,first improvised code and AI get stuck at one point in 2d Labyrinth
so second attempt I have researched pathfinding and found some tutorial and its about openlist and closelist
I thought I would start with simpler 4way solution first
maybe some tip about exercise for list program first,to understand lists first,which is new to me
or maybe tree's are better solutions?

There are several ways of doing pathfinding. Really you need to be familiar with basic structures like trees and lists before you develop your own algorithm. On the other hand, developing your own algorithm as a learning exercise might help you become familiar with these structures.

Tbe "best" algorithm is a complex question, as there are several considerations - execution time, quality of path, memory usage, coding complexity, worst case time, average case time, whether it is easily extensible into arbitrary dimensions or non-flat spaces. There are lots of things you could potentialy consider.