Go horse, horse

One of the older readers remembers when they played chess with each other on benches in the park, played by correspondence, making one move a month, solved and sent chess problems to the magazines. But time is inexorable, and at first computers learned how to solve multi-paths by sorting moves and classifying positions, then people preferred communication over a chessboard over Internet, and finally a deeply thoughtful computer defeated an intelligent person, and he became a politician.

Nevertheless, chess problems did not die to the end. The former politician sits and quietly issues puzzles one better than the other, and my friend’s seven-year-old son clicks these puzzles. Which, incidentally, makes itself felt - the boy is already the champion of Moscow. Well, not our story about chess. A tale about my favorite game, which never had the time or the strength to finish.



Each game throws up difficult tactical tasks, and if the reader of this blog is interested, we will solve it together. So, the picture shows how the Yuliev family, having completed the first move with a successful capture of Segesta, is going to start the second move. The Senate asks for the capture of Patavium, the commander in Arretium is concerned about the fugitive slaves in the south. Question: which detachment should begin to go, and how?

I will leave the chance for the habrasociety to solve a chess problem in one move - there is a huge clue in the text. Those who still want to try their hand at solving computer games problems do not read further.

So, the correct answer to the problem is that diplomats must go. Before each attack on the enemy’s cities or runaway slaves, you must ask your allies for money for fighting.



If you several times remove the siege from the enemy’s city, and again besiege this city, they will give more money, diplomats will become more experienced, and the second move will end with good financial results. For that kind of money you can buy all the neutral cities that you can reach.