{"id":"W1528097685","doi":"10.1007/978-3-642-12993-3_2","title":"A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Monte Carlo tree search; Scalability; Parallel computing; Tree (set theory); Monte Carlo method; Algorithm; Lock (firearm); Search tree; Search algorithm; Node (physics); Monte Carlo algorithm; Theoretical computer science; Mathematics; Operating system","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001416949,0.0008964392,0.0008276491,0.00130165,0.0004797455,0.001135885,0.01176016,0.0008416707,0.00007170146],"category_scores_gemma":[0.0003422065,0.0008261125,0.000281611,0.0009958057,0.002249629,0.001017253,0.004639545,0.002742482,0.0003081991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003861941,"about_ca_system_score_gemma":0.0009603354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002946041,"about_ca_topic_score_gemma":0.001202635,"domain_scores_codex":[0.9928313,0.00006454653,0.0008952453,0.002641792,0.002184638,0.001382421],"domain_scores_gemma":[0.9934067,0.0009335853,0.0003141649,0.004256169,0.0006631035,0.0004262696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004916824,0.00004701993,0.00002646939,0.00001635649,0.00001330933,0.0001957237,0.001592717,0.007681895,0.0005807186,0.004675182,0.00003680641,0.9851289],"study_design_scores_gemma":[0.0002032815,0.0002174362,0.0000638477,0.0002496029,0.000009131506,0.0001111818,8.322e-7,0.8270743,0.02084403,0.1481639,0.002034966,0.001027477],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001639278,0.0004091539,0.9900702,0.001584455,0.003594678,0.0006831743,0.00001497882,0.0003923882,0.003087001],"genre_scores_gemma":[0.0303348,0.00005291446,0.9658641,0.001016051,0.00117772,0.00002302523,0.000002712878,0.00008251264,0.00144623],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9841014,"threshold_uncertainty_score":0.9999011,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03295147993357291,"score_gpt":0.2787970192146341,"score_spread":0.2458455392810612,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}