In graph theory, a king's graph is a graph that represents all legal moves of the king chess piece on a chessboard where each vertex represents a square on a chessboard and each edge is a legal move. More specifically, an n × m {\displaystyle n\times m} king's graph is a king's graph of an n × m {\displaystyle n\times m} chessboard.
In graph theory, a king's graph is a graph that represents all legal moves of the king chess piece on a chessboard where each vertex represents a square on a chessboard and each edge is a legal move. More specifically, an n × m {\displaystyle n\times m} king's graph is a king's graph of an n × m {\displaystyle n\times m} chessboard.
Source: Wikipedia "King's graph" · CC BY-SA 4.0
Share this article: X · Bluesky