Bishop's graph

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.

Source: Wikipedia — Bishop's graph (CC BY-SA 4.0)

Bishop's graph

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.

This neuron ends here.

Source: Wikipedia "Bishop's graph" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy