对角钉Solitaire
Diagonal Peg Solitaire
摘要：
我们研究了允许对角跳跃的经典纸牌游戏。我们证明，在许多董事会，一个可以开始从一个完整的董事会与一个钉失踪，并完成与一个钉在董事会的任何地方。然后，我们考虑的问题，找到解决方案，最大限度地减少移动的数量（移动是一个或多个跳跃相同的挂钩），并找到最短的解决方案的“中心游戏”，开始和结束在中心。在某些情况下，我们可以通过分析证明我们的解决方案是最短的，在其他情况下，我们应用A* 或双向搜索算法。
英文摘要：
We study the classical game of peg solitaire when diagonal jumps are allowed. We prove that on many boards, one can begin from a full board with one peg missing, and finish with one peg anywhere on the board. We then consider the problem of finding solutions that minimize the number of moves (where a move is one or more jumps by the same peg), and find the shortest solution to the "central game", which begins and ends at the center. In some cases we can prove analytically that our solutions are the shortest possible, in other cases we apply A* or bidirectional search heuristics.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
