We give very simple algorithms for best play in the simplest kind of Dots and Boxes endgames: those that consist entirely of loops and long chains. In every such endgame we compute the margin of victory, assuming both players maximize the numbers of boxes they capture, and specify a move that leads to that result. We improve on results by Buzzard and Ciere on the same problem: our algorithms examine only the current position and do not need to consider the game tree at all.

中文翻译：

---

点和盒子残局中的最佳比赛

我们给出了非常简单的算法，以在最简单的点和盒式残局中发挥最佳效果：这些完全由循环和长链组成。在每一个这样的最终游戏中，我们假设两个玩家都最大化了他们捕获的盒子数量，并指定了导致该结果的举动，以此来计算获胜的幅度。我们改进了Buzzard和Ciere在同一问题上的结果：我们的算法仅检查当前位置，根本不需要考虑游戏树。