I was wondering if anyone has done this already, or would like to "play" for a bit.
If I have a maze (like a company cubicle farm) and I know that Sarah sits in a cube waaay over there, behind the potted tree, and I have a known "you are here" arrow showing the starting point (which can be moved anywhere), I want an algo to plot the most efficient route to travel to Sarah's desk. A polygon of 90 degree turns would be generated to display the route.
So the maze would be on a card with "groups" to represent cubicles. Inside each group would be objects that represent the desk, chair, cabinet, etc., and an outer wall with entry an point set with a specific attribute to aid the mapping algorithm. Everything should be considered solid except the designated entry points.
Thoughts or suggestions? Have any of you already done something similar?