Question 12
On these eight magical islands, Beaver can move between islands through buildings with the same number. For example, from A it can reach D or E through buildings numbered 1, or H through buildings numbered 2.
No island may be visited more than once. How many different routes lead from A to B?
No island may be visited more than once. How many different routes lead from A to B?