{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "shannon-computer-chess-1950",
    "title": "Shannon: search and evaluation for computer chess",
    "summary": "Shannon described how a computer could generate chess moves, search continuations and evaluate positions. He contrasted fixed-depth exploration of all variations with selective search guided by promising moves and unstable tactical positions.\n\nChess made limited computation a concrete design problem. An exhaustive tree grows rapidly, so Shannon examined evaluation functions, move-generation subprograms and selective continuations. This is a human-designed AI method whose approximations differ from an exact game specification.",
    "boundary": "The paper is a programming and search proposal. It does not report a strong implemented player, solve chess or guarantee that heuristic evaluation and selective search select the best move.",
    "area": "Game-playing algorithms",
    "topic": "Game-playing algorithms",
    "year": 1950,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "shannon-computer-chess-1950",
    "target": {
      "record_id": "urn:uuid:c716476c-fc74-41be-a0c1-8c864b1ae82f",
      "version": 1,
      "content_hash": "sha256:5c6f8e48027d55710ec677deff7809912d962f56ebefd608086f00e7d4a6372e"
    },
    "humans": [
      "Claude E. Shannon"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "pc26-shannon-chess",
        "title": "Claude E. Shannon, Programming a Computer for Playing Chess, Philosophical Magazine 41 (1950), 256–275",
        "url": "https://vision.unipv.it/IA1/ProgrammingaComputerforPlayingChess.pdf"
      }
    ],
    "points": "100000",
    "published_grade": {
      "id": "shannon-computer-chess-1950",
      "entry_id": "shannon-computer-chess-1950",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:c716476c-fc74-41be-a0c1-8c864b1ae82f",
        "version": 1,
        "content_hash": "sha256:5c6f8e48027d55710ec677deff7809912d962f56ebefd608086f00e7d4a6372e"
      },
      "what_changed": "Move-generation routines, position evaluation and fixed-depth versus selective continuations make limited-computation game search an explicit programming design.",
      "scope": "Move-generation routines, position evaluation and fixed-depth versus selective continuations make limited-computation game search an explicit programming design. The paper is a programming and search proposal. It does not report a strong implemented player, solve chess or guarantee that heuristic evaluation and selective search select the best move.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:c716476c-fc74-41be-a0c1-8c864b1ae82f",
        "version": 1,
        "content_hash": "sha256:5c6f8e48027d55710ec677deff7809912d962f56ebefd608086f00e7d4a6372e"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Claude E. Shannon",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Claude E. Shannon, Programming a Computer for Playing Chess, Philosophical Magazine 41 (1950), 256–275",
            "url": "https://vision.unipv.it/IA1/ProgrammingaComputerforPlayingChess.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Claude E. Shannon, Programming a Computer for Playing Chess, Philosophical Magazine 41 (1950), 256–275",
            "url": "https://vision.unipv.it/IA1/ProgrammingaComputerforPlayingChess.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The paper is a programming and search proposal. It does not report a strong implemented player, solve chess or guarantee that heuristic evaluation and selective search select the best move.",
        "domain": "Game-playing algorithms"
      },
      "sources": [
        {
          "citation": "Claude E. Shannon, Programming a Computer for Playing Chess, Philosophical Magazine 41 (1950), 256–275",
          "url": "https://vision.unipv.it/IA1/ProgrammingaComputerforPlayingChess.pdf"
        }
      ],
      "statement": "# Shannon: search and evaluation for computer chess\n\nShannon described how a computer could generate chess moves, search continuations and evaluate positions. He contrasted fixed-depth exploration of all variations with selective search guided by promising moves and unstable tactical positions.\n\nChess made limited computation a concrete design problem. An exhaustive tree grows rapidly, so Shannon examined evaluation functions, move-generation subprograms and selective continuations. This is a human-designed AI method whose approximations differ from an exact game specification.\n\n## Scientific scope\n\nThe paper is a programming and search proposal. It does not report a strong implemented player, solve chess or guarantee that heuristic evaluation and selective search select the best move.\n\n## People and systems\n\nClaude E. Shannon\n\n\n\n## Original sources\n\n- [Claude E. Shannon, Programming a Computer for Playing Chess, Philosophical Magazine 41 (1950), 256–275](https://vision.unipv.it/IA1/ProgrammingaComputerforPlayingChess.pdf)\n",
      "summary": "Shannon described how a computer could generate chess moves, search continuations and evaluate positions. He contrasted fixed-depth exploration of all variations with selective search guided by promising moves and unstable tactical positions.\n\nChess made limited computation a concrete design problem. An exhaustive tree grows rapidly, so Shannon examined evaluation functions, move-generation subprograms and selective continuations. This is a human-designed AI method whose approximations differ from an exact game specification.",
      "title": "Shannon: search and evaluation for computer chess"
    },
    "record_id": "urn:uuid:c716476c-fc74-41be-a0c1-8c864b1ae82f",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:c716476c-fc74-41be-a0c1-8c864b1ae82f",
      "version": 1,
      "content_hash": "sha256:5c6f8e48027d55710ec677deff7809912d962f56ebefd608086f00e7d4a6372e"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:213eb59938870cd5801c88f06dbf06cabf362964554606d6081af3e3b27a0809"
  },
  "target": {
    "record_id": "urn:uuid:c716476c-fc74-41be-a0c1-8c864b1ae82f",
    "version": 1,
    "content_hash": "sha256:5c6f8e48027d55710ec677deff7809912d962f56ebefd608086f00e7d4a6372e"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "shannon-computer-chess-1950",
    "entry_id": "shannon-computer-chess-1950",
    "revision": 1,
    "title": "Shannon: search and evaluation for computer chess",
    "context": "Game-playing algorithms",
    "track": "Game-playing algorithms",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-03",
    "evidence_cutoff": "2026-10-03",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Move-generation routines, position evaluation and fixed-depth versus selective continuations make limited-computation game search an explicit programming design.",
    "scope": "Move-generation routines, position evaluation and fixed-depth versus selective continuations make limited-computation game search an explicit programming design. The paper is a programming and search proposal. It does not report a strong implemented player, solve chess or guarantee that heuristic evaluation and selective search select the best move.",
    "evidence_summary": "Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.",
    "references": [
      {
        "title": "Claude E. Shannon, Programming a Computer for Playing Chess, Philosophical Magazine 41 (1950), 256–275",
        "url": "https://vision.unipv.it/IA1/ProgrammingaComputerforPlayingChess.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Claude E. Shannon",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:c716476c-fc74-41be-a0c1-8c864b1ae82f",
      "version": 1,
      "content_hash": "sha256:5c6f8e48027d55710ec677deff7809912d962f56ebefd608086f00e7d4a6372e"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "100000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}