Removing the obstacle that yields the best path from a map after A* traversal
Posted
by David Titarenco
on Stack Overflow
See other posts from Stack Overflow
or by David Titarenco
Published on 2010-03-22T02:18:56Z
Indexed on
2010/03/22
2:21 UTC
Read the original article
Hit count: 511
I traverse a 16x16 maze using my own A* implementation. This is exactly what my program does:
http://www.screenjelly.com/watch/fDQh98zMP0c?showTab=share
All is well. However, after the traversal, I would like to find out what wall would give me the best alternative path. Apart from removing every block and re-running A* on the maze, what's a clever solution?
I was thinking give every wall node (ignored by A*), a tentative F-value, and change the node structure to also have a n-sized list of node *tentative_parent
where n is the number of walls in the maze. Could this be viable?
© Stack Overflow or respective owner