Shortest path finding algorithms

  • Thread starter shashmehro
  • Start date
  • #1

Main Question or Discussion Point

hello folks...
my frnds and I have a project in which we have to find the shortest path possible for a mouse to traverse to the middle of the maze(any random maze)...we have understood that simply applying djikstra`s would not work...also prevalent algorithms like floodfill have a level of complexity which is not easy to program with...any suggestions or any algorithms which u guys can suggest???
 

Answers and Replies

  • #2
79
0
Try with the "Knapsack problem", it is a optimization tree search algorithm which is easy to
implement on a computer.
 

Related Threads on Shortest path finding algorithms

  • Last Post
Replies
3
Views
11K
  • Last Post
Replies
12
Views
912
  • Last Post
Replies
4
Views
2K
Replies
1
Views
3K
Replies
2
Views
2K
Replies
12
Views
1K
Replies
13
Views
1K
  • Last Post
Replies
22
Views
2K
Top