{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn mathematics, a **queen's graph** is an undirected graph that represents all legal moves of the queen—a chess piece—on a chessboard. In the graph, each vertex represents a square on a chessboard, and each edge is a legal move the queen can make; that is, a horizontal, vertical or diagonal move by any number of squares. If the chessboard has dimensions $m\\times n$, then the induced graph is called the $m\\times n$ queen's graph.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "25RQC1KRQ8"
    ],
    "kind": "concept",
    "name": "Queen's graph",
    "same_as": {
      "wikidata": "Q29554872",
      "wikipedia": "Queen's graph"
    },
    "sources": [
      {
        "locator": "Queen's graph",
        "mention": "wikipedia://en/70073990",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:70073990@r1356335911"
      }
    ],
    "tag": "PQSBVX28E2"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/PQSBVX28E2/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/PQSBVX28E2.md",
  "msc": null,
  "name": "Queen's graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/PQS/PQSBVX28E2.md",
  "status": null,
  "tag": "PQSBVX28E2",
  "uri": "m2://PQSBVX28E2",
  "url": "https://math2.tamnd.com/wiki/queens-graph/",
  "writing": {
    "tag": "PQSBVX28E2",
    "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
      }
    ]
  }
}