|
-
April 15th, 2010, 11:04 AM
#1
Implementing BFS
Any ideas about implementing bfs, or any other algorithm that you may find appropriate, in the game TipOver for finding the shortest path from the initial point to the final one. For me, the problem is that the graph is dynamic, every time we do a tupple of a crate we have a new graph. I need a hand with this if you please.
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|