A graph of a puzzle is obtained by associating each possible position with a vertex and by inserting edges between vertices if and only if the corresponding positions can be obtained from each other in one move. Computational methods for finding the vertices at maximum distance
1970-2025 CP (Manitoba, Canada) unless otherwise stated.