{"id":"W1528184253","doi":"10.1007/978-3-642-31866-5_2","title":"Revisiting Move Groups in Monte-Carlo Tree Search","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Branching (polymer chemistry); Tree (set theory); Monte Carlo method; Game tree; Mathematical optimization; Search tree; Algorithm; Theoretical computer science; Search algorithm; Game theory; Mathematics; Combinatorics; Statistics; Sequential game; Mathematical economics","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"],"consensus_categories":[],"category_scores_codex":[0.002489131,0.0006637646,0.0007416499,0.001361965,0.0002341991,0.0007163406,0.005253303,0.0004500033,0.00004530403],"category_scores_gemma":[0.0002462761,0.0006371387,0.0001854965,0.00118009,0.0008661428,0.001398279,0.002578798,0.001662623,0.000215771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006643886,"about_ca_system_score_gemma":0.0004364189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001754033,"about_ca_topic_score_gemma":0.0002658809,"domain_scores_codex":[0.9941446,0.0001019873,0.0009453935,0.001864036,0.00152739,0.001416607],"domain_scores_gemma":[0.9962368,0.001045496,0.0002925974,0.001857035,0.000283939,0.0002841457],"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.000004341353,0.00002303561,0.0006859436,0.00003225669,0.000005130688,0.0001128192,0.002552472,0.02505987,0.0001302695,0.01982167,0.000005928741,0.9515663],"study_design_scores_gemma":[0.0001439239,0.0001186779,0.00146827,0.001113972,0.000007363142,0.00008686187,0.00000275179,0.889973,0.003877644,0.1010894,0.0008358085,0.001282283],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001509175,0.001968917,0.9880888,0.0009917712,0.001550579,0.0005052018,0.000002859787,0.0001754817,0.005207147],"genre_scores_gemma":[0.7736461,0.0001512383,0.2233071,0.0009914696,0.001439591,0.00001533415,0.000001662151,0.00006200353,0.000385532],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.950284,"threshold_uncertainty_score":0.999608,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04173228012486649,"score_gpt":0.2875969155058841,"score_spread":0.2458646353810176,"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."}}