The challenge of the path problem is to find whether a given graph has a Hamiltonian path.

路径题挑战是找出给定图是否具有哈密顿路径。

This puzzle is related to the Hamiltonian path problem named after the 19th century Irish mathematician William Rowan Hamilton.

这个谜题与以 19 世纪爱尔兰数学家 William Rowan Hamilton 命名哈密顿路径题有关。

In any grid with that configuration, a Hamiltonian path that starts and ends in opposite corners is impossible.

在具有该配置任何网格中，一条在对角开和结束哈密顿路径是不可能。

So a Hamiltonian path on an even-sided grid that starts on black will have to end on white.

因此，从黑色开边网格上哈密顿路径必须以白色结束。

This puzzle adds a twist to the Hamiltonian path problem in that you have to start and end at specific points.

这个难题为哈密顿路径题增加了一个转折点，因为您必须在特定点开和结束。

But before you waste a ton of graph paper, you should know that a true Hamiltonian path isn't possible with these end points.

但是在你浪费大量方格纸之前，你应该知道真正哈密顿路径对于这些端点是不可能。

However, in any grid with even numbered sides, opposite corners are the same color, so it's impossible to start and end a Hamiltonian path on opposite corners.

然而， 在任何具有数边网格中，对角是相同颜色，因此不可能在对角上开和结束哈密顿路径。