Problem solve me this.

PaulStat

PaulStat

PaulStat

Soldato
Joined
1 Mar 2003
Posts
5,508
Location
Cotham, Bristol
Help me problem solve folks, it's a Friday afternoon and i've had a couple of beers, so me brain isn't fully engaged.

Code: 
b--->c--->d--->e
^         ^     |
|         |     |
|         |     |
|         |     |
|         |     ->a-------
|         |          |    |
|         -----------     |
|                         |
--------------------------

On the first run start from a, go through b etc. Second run through start at a go to d then e. The problem is b needs information from c and d, c needs information from b and d needs information from c. Argh me brain is frazzled, help meeee :)

Edit: forgot to say, re-organise or add another intermediate step to the above to make sure they all have the required information.

Edit2: They all have to go in order, so it's not like you can jump forwards to grab the required information you need.
 
Last edited:
Sirrel Squirrel said:
wtf mate
Click to expand...
Just what I was thinking :p

CONFUZZLED.gif
 
hendrix said:
2nd route, take the same route as first time, goes to d and e :) aswell as passing through b + c :D

nb: That could be cheating, but i'm a bit confused at the question still.
Click to expand...

Yes but you have to start from a, and b requires information from d from the first time round.

Same applies to c requiring info from b.

Therefore you can't just put d before b, since d requires c and c requires b

Argh :confused: :confused: :confused:
 
PaulStat said:
Yes but you have to start from a, and b requires information from d from the first time round.

Same applies to c requiring info from b.

Therefore you can't just put d before b, since d requires c and c requires b

Argh :confused: :confused: :confused:
Click to expand...

If you tell us what it is for then you may get an answer :)
 
If you have to go in the direction of the arrows on your map, then each time you do a circuit you either visit ADE or ABCDE, so any route at all is going to be made up of combinations of those two. If B needs information from C the first time round, then you need to have a sequence that has C before B. But that's impossible, because the way you've drawn it you always have to visit B before C.

Either the answer is "it's impossible" or you've got the question wrong.
 
You must log in or register to reply here.
Back
Top Bottom