{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002194779,0.0008028704,0.0007608946,0.001019264,0.001291525,0.001673271,0.001540821,0.001920698,0.006273109],"category_scores_gemma":[0.008538596,0.0003627196,0.0009886737,0.001059812,0.002593327,0.003366294,0.003446317,0.002278098,0.0004861875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001197565,"about_ca_system_score_gemma":0.001334522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005156437,"about_ca_topic_score_gemma":0.005959272,"domain_scores_codex":[0.9985542,0.0008102543,0.00004946785,0.0001596543,0.0002489931,0.0001773391],"domain_scores_gemma":[0.9972396,0.002023328,0.0001324094,0.0001646944,0.0001708709,0.0002691096],"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.0004784599,0.000382243,0.001212901,0.0003109032,0.0001064436,0.000286845,0.001199543,0.2710384,0.003867757,0.5850737,0.006968818,0.1290741],"study_design_scores_gemma":[0.0001110898,0.000187432,0.0003095393,0.000056145,0.00003832033,0.000132835,0.0003363987,0.7259831,0.001271475,0.2648023,0.00674005,0.00003127262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04492088,0.0004932127,0.9264733,0.001119775,0.00006956197,0.0002794872,0.00006759347,0.0002307887,0.02634532],"genre_scores_gemma":[0.4472302,0.0004042101,0.5412477,0.0002421656,0.00005472955,0.0003514661,0.0001359722,0.0001113365,0.01022232],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006273109,"threshold_uncertainty_score":0.02098566,"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."}}