Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

RE: Graph Traversal

by Blue (Hermit)
on Nov 09, 2000 at 00:54 UTC ( #40626=note: print w/replies, xml ) Need Help??


in reply to Graph Traversal

A slight change on the question may give you a better perspective. Instead of "how do I pass over the most given a specified location", instead figure out "given X moves, what is the best starting position & path". This gives you a one time problem, which you may be able to apply more resources to. Once you do that, you have a single sub-optimal day where you move to your new starting location, and then you just cycle through the pattern and it's reverse on alternate days.

=Blue
...you might be eaten by a grue...

Replies are listed 'Best First'.
RE: RE: Graph Traversal
by lhoward (Vicar) on Nov 09, 2000 at 00:58 UTC
    Only thing is with the game you're not allowed to choose your starting position. Every day you start at the same location. So it effectively is already a one-time problem.

    I don't make the rules... I just have to live by 'em.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://40626]
help
Chatterbox?
[stevieb]: cheers beech. twas totally my mistake, and I got bit. When things work for so long without issue, one becomes complacent (ie. replace we/one with I ;) I've been copy/pasting that around for a few years without a hiccup, so when...
[stevieb]: choroba pointed that out, I was just, you know, *sigh*. In effect, I was lucky and fortunate
[stevieb]: Kind of like my regex-fu went out the window, but only while looking at that specific file ;)

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (6)
As of 2017-07-25 23:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I came, I saw, I ...
























    Results (383 votes). Check out past polls.