King's graph
id:
king-s-graph-273-856463
title:
King's graph
text:
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 king's graph is a king's graph of an n × m chessboard. It is the map graph formed from the squares of a chessboard by making a vertex for each square and an edge for each two squares that share an edge or a corner. It can also be constructed as the strong product of two p
brand slug:
wiki
category slug:
encyclopedia
description:
Graph that represents all legal moves of the king on a chessboard
original url:
https://en.wikipedia.org/wiki/King%27s_graph
date created:
date modified:
2023-08-13T18:23:20Z
main entity:
{"identifier":"Q6411145","url":"https://www.wikidata.org/entity/Q6411145"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/b4/King%27s_graph_with_white_king.svg","width":432,"height":432}
fields total:
13
integrity:
15