Upon arriving home I've spent over 8 hours to complete a travel from China to Chicago in 11 (eleven!)links.
Finally I've decided to post an abridged version, long enough to qualify as D4 and forcing the solver to go through all the stages.
Later I have decided to lower the level of difficulty of "bananas travel" and waive the above requirement.
Here we go:
a. CHINA+BANANA=MEXICO
b. MEXICO+BANANA=ALBANIA
c. ALBANIA+BANANA=ABIDJAN
d. ABIDJAN+BANANA= SEATTLE
e. SEATTLE+BANANA=HOBOKEN
f. HOBOKEN+BANANA= BELMONT
g. BELMONT +BANANA=ARMENIA
h. ARMENIA+BANANA=ROMANIA
i. ROMANIA+BANANA= COLOMBO
j. COLOMBO+BANANA=VATICAN
You have to solve enough independent alphametics, to get the name of a (City, Country) hinted below.
The City (a9, a5, d8, d9, b7, g1, c3, c1, b3) is the official Capital of (what country)?
What City?
You may solve all alphametics (have fun!), but you don't need to.
Clarification: d5 means a letter representing 5 in the solution of alphametic d.