{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn mathematics, a **bishop's graph** is a [[graph|00C0BR7D7H]] 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\\times n$, then the induced graph is called the $m\\times n$ bishop's graph.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "1E4QS23854"
    ],
    "kind": "concept",
    "name": "Bishop's graph",
    "same_as": {
      "wikidata": "Q29554807",
      "wikipedia": "Bishop's graph"
    },
    "sources": [
      {
        "locator": "Bishop's graph",
        "mention": "wikipedia://en/72198733",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:72198733@r1285181617"
      }
    ],
    "tag": "40R5MAE4YJ"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/40R5MAE4YJ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/40R5MAE4YJ.md",
  "msc": null,
  "name": "Bishop's graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/40R/40R5MAE4YJ.md",
  "status": null,
  "tag": "40R5MAE4YJ",
  "uri": "m2://40R5MAE4YJ",
  "url": "https://math2.tamnd.com/wiki/bishops-graph/",
  "writing": {
    "tag": "40R5MAE4YJ",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}