{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GKDRYYP2T6KZ5R5XWVOKXTW5UU","short_pith_number":"pith:GKDRYYP2","schema_version":"1.0","canonical_sha256":"32871c61fa9f959ec7b7b55cabcedda536277043860374496b4639a09b3eea4c","source":{"kind":"arxiv","id":"1406.0486","version":4},"attestation_state":"computed","paper":{"title":"Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Marc Lanctot, Mark H.M. Winands, Nathan R. Sturtevant, Tom Pepels","submitted_at":"2014-06-02T19:32:12Z","abstract_excerpt":"Monte Carlo Tree Search (MCTS) has improved the performance of game engines in domains such as Go, Hex, and general game playing. MCTS has been shown to outperform classic alpha-beta search in games where good heuristic evaluations are difficult to obtain. In recent years, combining ideas from traditional minimax search in MCTS has been shown to be advantageous in some domains, such as Lines of Action, Amazons, and Breakthrough. In this paper, we propose a new way to use heuristic evaluations to guide the MCTS search by storing the two sources of information, estimated win rates and heuristic "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1406.0486","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-02T19:32:12Z","cross_cats_sorted":[],"title_canon_sha256":"7e5f285ea0d3e68c83e237966ae4f75d1b2861780ceb712732970e4614625539","abstract_canon_sha256":"8a85e1b26baa0a4d0292fbcb67d3dcde73ce51eacbf1f80a0fe9dd6898867d11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:19.814409Z","signature_b64":"B7IA+f+neUQRk4wnwhxBO1I9u9F0riYNAZW1o5DEJmZ1FM+UqgRyW2P4ocNOx45E+1IGJ7oZifYSNRSASzuWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32871c61fa9f959ec7b7b55cabcedda536277043860374496b4639a09b3eea4c","last_reissued_at":"2026-05-18T02:49:19.813670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:19.813670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Marc Lanctot, Mark H.M. Winands, Nathan R. Sturtevant, Tom Pepels","submitted_at":"2014-06-02T19:32:12Z","abstract_excerpt":"Monte Carlo Tree Search (MCTS) has improved the performance of game engines in domains such as Go, Hex, and general game playing. MCTS has been shown to outperform classic alpha-beta search in games where good heuristic evaluations are difficult to obtain. In recent years, combining ideas from traditional minimax search in MCTS has been shown to be advantageous in some domains, such as Lines of Action, Amazons, and Breakthrough. In this paper, we propose a new way to use heuristic evaluations to guide the MCTS search by storing the two sources of information, estimated win rates and heuristic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0486","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.0486","created_at":"2026-05-18T02:49:19.813771+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0486v4","created_at":"2026-05-18T02:49:19.813771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0486","created_at":"2026-05-18T02:49:19.813771+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKDRYYP2T6KZ","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKDRYYP2T6KZ5R5X","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKDRYYP2","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GKDRYYP2T6KZ5R5XWVOKXTW5UU","json":"https://pith.science/pith/GKDRYYP2T6KZ5R5XWVOKXTW5UU.json","graph_json":"https://pith.science/api/pith-number/GKDRYYP2T6KZ5R5XWVOKXTW5UU/graph.json","events_json":"https://pith.science/api/pith-number/GKDRYYP2T6KZ5R5XWVOKXTW5UU/events.json","paper":"https://pith.science/paper/GKDRYYP2"},"agent_actions":{"view_html":"https://pith.science/pith/GKDRYYP2T6KZ5R5XWVOKXTW5UU","download_json":"https://pith.science/pith/GKDRYYP2T6KZ5R5XWVOKXTW5UU.json","view_paper":"https://pith.science/paper/GKDRYYP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0486&json=true","fetch_graph":"https://pith.science/api/pith-number/GKDRYYP2T6KZ5R5XWVOKXTW5UU/graph.json","fetch_events":"https://pith.science/api/pith-number/GKDRYYP2T6KZ5R5XWVOKXTW5UU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKDRYYP2T6KZ5R5XWVOKXTW5UU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKDRYYP2T6KZ5R5XWVOKXTW5UU/action/storage_attestation","attest_author":"https://pith.science/pith/GKDRYYP2T6KZ5R5XWVOKXTW5UU/action/author_attestation","sign_citation":"https://pith.science/pith/GKDRYYP2T6KZ5R5XWVOKXTW5UU/action/citation_signature","submit_replication":"https://pith.science/pith/GKDRYYP2T6KZ5R5XWVOKXTW5UU/action/replication_record"}},"created_at":"2026-05-18T02:49:19.813771+00:00","updated_at":"2026-05-18T02:49:19.813771+00:00"}