Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

RE: Re: Graph Traversal

by Albannach (Prior)
on Nov 09, 2000 at 00:09 UTC ( #40618=note: print w/ replies, xml ) Need Help??


in reply to Re: Graph Traversal
in thread Graph Traversal

Because you have only a limited number of moves, the importance of a single node is also a function of the importance of its neighbours, so that a nearby (to the player) but lonely oil node isn't as important as a more distant oil node that is itself near to other oil nodes.

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! ;-)


Comment on RE: Re: Graph Traversal

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://40618]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (8)
As of 2014-09-23 19:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (240 votes), past polls