{
  "aliases": [
    "cayley-mousetrap"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\n**Mousetrap** is the name of a game introduced by the English mathematician Arthur Cayley. In the game, cards numbered $1$ through $n$ (\"say thirteen\" in Cayley's original article) are shuffled to place them in some random [[permutation|05RWFKVTJ7]] and are arranged in a circle with their faces up. Then, starting with the first card, the player begins counting $1, 2, 3, ...$ and moving to the next card as the count is incremented. If at any point the player's current count matches the number on the card currently being pointed to, that card is removed from the circle and the player starts all over at $1$ on the next card. If the player ever removes all of the cards from the permutation in this manner, then the player wins. If the player reaches the count $n+1$ and cards still remain, then the game is lost.\n",
  "commit": "135c6437fad4260afa9c407aa7649bf9dea295b7",
  "front": {
    "aliases": [
      "cayley-mousetrap"
    ],
    "inventory": [
      "RS61XNQX53"
    ],
    "kind": "concept",
    "name": "Cayley's mousetrap",
    "same_as": {
      "wikidata": "Q4726764",
      "wikipedia": "Cayley's mousetrap"
    },
    "sources": [
      {
        "locator": "Cayley's mousetrap",
        "mention": "wikipedia://en/9380313",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:9380313@r1258129802"
      }
    ],
    "tag": "E1C53WBJ4M"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/E1C53WBJ4M/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/E1C53WBJ4M.md",
  "msc": null,
  "name": "Cayley's mousetrap",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/E1C/E1C53WBJ4M.md",
  "status": null,
  "tag": "E1C53WBJ4M",
  "uri": "m2://E1C53WBJ4M",
  "url": "https://math2.tamnd.com/wiki/cayleys-mousetrap/",
  "writing": {
    "tag": "E1C53WBJ4M",
    "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
      }
    ]
  }
}