yeah that works. well done . however the sea has changed direction and wiped out the bridge between B and C.

This was meant to be the problem lol. i realised it was wrong when i saw your route lol.

edited as i gave a clue away.

That makes things interesting .... back to the drawing board

yes its more challenging now haha. was far too easy before.

Just so I've got this clear before I go and have a think, there are now only 7 bridges and no adverse weather conditions imminent

7 bridges and the sea has calmed down.

Well done

Hmmm, must admit I'm struggling with this one Adam because, from what I remember from graph theory and topology from uni (which as a very very long time ago lol), in order for you to successfully traverse a graph only taking a particular path once then there should be exactly zero or 2 nodes that have an odd number of connecting paths (i.e. source and destination) - this was theorised by someone and proven by someone else, but can't think for the life of me who they were (old age being what it is). So I must have missed something in the description of the puzzle, because the graph I get has all nodes (i.e. the islands) with odd numbers of paths

I think I will have to think about this tomorrow (after the Grand Prix Practice Sessions) because at the moment, I can't see the wood for the trees lol

Woooooooooooooooooohoooooooooooo

If I am a three digit number and my first digit is seven less than second digit and the second digit is four times that of third digit. What digit am i?

182.

yes

A little boy walked up to his uncle and said, "Uncle, do you know how to make 100 dollars out of ten bills, but not use a single 10 dollar bill?" "What do you mean?" he replied. The little boy replied, " Make 100 dollars out of any ten bills that aren't a 10." And so the uncle tried and gave up. But when the boy tried he got it right. What ten bills, all but the 10 dollar bill, did he use?

1x$50 bill, 2x$20bills, 3x$2bills, 4x$1 biils

Name someting that is lighter than a feather but cannot be held by anyone for longer than a few minutes.

their breath duh.

Correct Adam.

Name someone that is 19 but still feels the need to use the word duh?

Adam duh

Just bringing this forward so it doesn't get forgotten (got a bit of time between practice sessions )

I dunno tyhe answer to that one, but try this one

A devious army general has taken 4 enemies prisoner, buried them up to their necks in the ground and placed a hat (either red or blue) on each prisoner (there are 2 red hats and 2 blue hats). The prisoners are lined up like so:

X
facing this direction B X R B R
X

the XXX is a wall that they cannot see through
The prisoners cannot see the color of their own hat, and they cannot turn around far enough to see the hat behind them.

The general says that he will will let them go if one of them can correctly state the color of the hat he is wearing (the prisoners will be shot if the given color is incorrect)
There is a catch however, the first word spoken by any of the prisoners must be a color, and that will be their final answer. The prisoners cannot communicate to each other in any way.

Which prisoner knows for sure the color of his hat, and how does he know?

hmmmm, can't get the XXX to line properly, but you get the idea i think

B X R B R

The one I underlined shouts out blue.

He knows that the person in front of him is red, so if he was also red, then the person behind him would see 2 red hats in front of him. Because there are 2 red and 2 blue, the person behind him would know that he was blue and would shout. Since the person behind hasn't shouted, then the underlined one knows that he must be different to the person in front of him. The person in front is red, so he knows that he is blue.

Sounds good to me