{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006613034,0.001036119,0.002536249,0.00228612,0.00161187,0.002355568,0.004541961,0.003617343,0.01337008],"category_scores_gemma":[0.04228678,0.001189922,0.001567001,0.003428983,0.002649609,0.00700756,0.004457378,0.003716128,0.002434715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001545841,"about_ca_system_score_gemma":0.002866757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006030112,"about_ca_topic_score_gemma":0.008669103,"domain_scores_codex":[0.995246,0.002595432,0.0001629689,0.0004540964,0.001190038,0.0003514247],"domain_scores_gemma":[0.9735173,0.02157443,0.000610353,0.002475165,0.001325629,0.0004970743],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003785118,0.000298494,0.001462843,0.0002669968,0.0001056572,0.00009550382,0.0006104229,0.3822713,0.0007781867,0.4565731,0.009647979,0.1475109],"study_design_scores_gemma":[0.0000527677,0.00006113646,0.0001075025,0.00005290052,0.00002658844,0.00002618926,0.00004067086,0.777308,0.0002861314,0.2188602,0.003165269,0.00001268255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0174656,0.0005150679,0.9677746,0.0005454468,0.0001642418,0.0001528931,0.00009640712,0.0007178249,0.01256786],"genre_scores_gemma":[0.2821578,0.0004576603,0.7035679,0.0004553025,0.0002630331,0.0004604288,0.0004601592,0.001140032,0.0110378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01337008,"threshold_uncertainty_score":0.04472733,"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."}}