I have created the most powerful topological search and modification engine I've ever seen. Woo-hoo!
In a labyrinth of an almost arbitrarily large size, it can find the shortest path(s) to the goal and then modify them. It can even make an intelligently designed path if one doesn't exist. This may sound familiar: I'm implementing Perkplot as a simple labyrinth puzzle game.
It is astonishingly fast and I am well pleased. But I found something irritating as I was trying to tweak it for release to anyone who wanted to download it:
T2D crashes due to the huge number of sprites involved in creating a 100 x 80 labyrinth (~24,000). It can create them, but when it comes time to get rid of them... crash!
This means that although it is extremely powerful, it has this pain all up it's left diodes...
So I'm looking into ways to reduce the number of sprites from 2-5 per tile to 1 per tile. It may take me a little while, but take heart:
The algorithm works!