= Knight's graph
{wiki=Knight's_graph}
Knight's graph is a mathematical graph representation based on the moves of a knight in chess. Specifically, the vertices of the graph represent the squares of a chessboard, and there is an edge between two vertices if a knight can move from one square to the other in a single move. In a standard 8x8 chessboard, the knight moves in an "L" shape: it can move two squares in one direction (either horizontally or vertically) and then one square in a perpendicular direction.
Back to article page
