{
  "aliases": [
    "coil-in-the-box",
    "snake-in-a-box"
  ],
  "backlinks": null,
  "body": "\n## Statement\n\nThe **snake-in-the-box** problem in graph theory and coding theory deals with finding a certain kind of path along the edges of a hypercube. This path starts at one corner and travels along the edges to as many corners as it can reach. After it gets to a new corner, the previous corner and all of its neighbors must be marked as unusable. The path must never travel to a corner which has been marked unusable.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "coil-in-the-box",
      "snake-in-a-box"
    ],
    "inventory": [
      "FTQNKRCPFS"
    ],
    "kind": "conjecture",
    "name": "Snake-in-the-box",
    "same_as": {
      "wikidata": "Q15995476",
      "wikipedia": "Snake-in-the-box"
    },
    "sources": [
      {
        "locator": "Snake-in-the-box",
        "mention": "wikipedia://en/1850040",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:1850040@r1366107604"
      }
    ],
    "tag": "PSJJJYGXHZ"
  },
  "kind": "conjecture",
  "link": "https://math2.tamnd.com/node/PSJJJYGXHZ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/PSJJJYGXHZ.md",
  "msc": null,
  "name": "Snake-in-the-box",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/PSJ/PSJJJYGXHZ.md",
  "status": null,
  "tag": "PSJJJYGXHZ",
  "uri": "m2://PSJJJYGXHZ",
  "url": "https://math2.tamnd.com/wiki/snake-in-the-box/",
  "writing": {
    "tag": "PSJJJYGXHZ",
    "kind": "conjecture",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "have": 0,
        "want": 1
      }
    ]
  }
}