{"id":"W45528085","doi":"","title":"Dynamic Decomposition Search: A Divide and Conquer Approach and its Application to the One-Eye Problem in Go.","year":2005,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Divide and conquer algorithms; Decomposition; Computer science; Position (finance); Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.000406811,0.00007833834,0.00007990748,0.00007655432,0.00008686096,0.0001352858,0.0003145921,0.00003576879,0.000003398319],"category_scores_gemma":[0.0000105096,0.00005903612,0.000009209524,0.0002458552,0.0000370358,0.0003507384,0.0002409985,0.00009545576,0.00007099639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004416345,"about_ca_system_score_gemma":0.00001552836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007886784,"about_ca_topic_score_gemma":0.0005168284,"domain_scores_codex":[0.99912,0.00005841705,0.0001666328,0.0003233437,0.0001503703,0.0001812463],"domain_scores_gemma":[0.9995793,0.0000692234,0.00002423993,0.0002196314,0.00004329058,0.00006436397],"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.00001529246,0.0002035721,0.002436924,0.00003263636,0.00001087538,7.839756e-7,0.009764447,0.01277248,0.01347677,0.1961853,0.0001468457,0.7649541],"study_design_scores_gemma":[0.00004383231,0.00003395011,0.00588788,0.00001103736,0.00000175302,0.000005322788,0.00008871912,0.9844484,0.00531395,0.003024759,0.001035296,0.0001050711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1925949,0.0001154991,0.7934755,0.01127738,0.00000952264,0.0006694455,7.454786e-7,0.00005366536,0.001803353],"genre_scores_gemma":[0.9241787,0.0000229798,0.07494827,0.000534665,0.00001714285,0.0001052828,0.000001425127,0.000004438358,0.0001870982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9716759,"threshold_uncertainty_score":0.2407423,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03449704538697389,"score_gpt":0.3156988943396283,"score_spread":0.2812018489526544,"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."}}