出典:Wikipedia
出典:『Wikipedia』 (2010/03/16 17:22 UTC 版)
In graph theory, a knight's graph, or a knight's tour graph, is a graph that represents all legal moves of the knight chess piece on a chessboard where each vertex represents a square on a chessboard and each edge is a legal move. More specifically, an
knight's tour graph is a knight's tour graph of an
chessboard.