This is starting to sound like some statistical clustering is in order, then you measure distances to the various clusters along with the maximum number of moves required to suck up all the oil in each cluster. You then increase the cluster sizes and choose the largest cluster you can reach.
Maybe I've just restated another posting, but I feel better! ;-)
In reply to RE: Re: Graph Traversal
by Albannach
in thread Graph Traversal
by lhoward
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |