There are nine islands mutually connected by bridges, such that **no** two bridges intersect. If each island can be visited only once, how many possible ways are there to traverse between any selected pair of islands?

**Notes:**

1) All islands are interconnected to form a complete network.

2) By 'no two bridges intersect', I mean they to not form 4-way intersections (use your imagination to envision the infrastructural layout).

×

Problem Loading...

Note Loading...

Set Loading...