Bishop's graph
id:
bishop-s-graph-274-5449151
title:
Bishop's graph
text:
In mathematics, a bishop's graph is a graph that represents all legal moves of the chess piece the bishop on a chessboard. Each vertex represents a square on the chessboard and each edge represents a legal move of the bishop; that is, there is an edge between two vertices (squares) if they occupy a common diagonal. When the chessboard has dimensions m × n , then the induced graph is called the m × n bishop's graph.
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical graph relating to chess
original url:
https://en.wikipedia.org/wiki/Bishop%27s_graph
date created:
date modified:
2024-02-05T04:04:33Z
main entity:
{"identifier":"Q29554807","url":"https://www.wikidata.org/entity/Q29554807"}
image:
fields total:
13
integrity:
14