A TAPA TAPA. Follow regular Tapa rules. Additionally, each train represents a city (though which is which is not given), and shortest distances between some cities are given. The distance between two cities is the number of shaded cells in a path that travels horizontally and vertically along the Tapa wall and touches both cities (it can touch the cities diagonally). [Rules source with example, though note that I’ve omitted the cities-are-all-ones rule since I didn’t notice it when constructing this]

Written on a train.








