{"id":"W3022772269","doi":"10.1609/icaps.v23i1.13578","title":"Temporal-Difference Search in Computer Go","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Monte Carlo method; Search algorithm; Reinforcement learning; Beam search; Tree (set theory); Binary search algorithm; Artificial intelligence; Temporal difference learning; Search tree; Machine learning; Algorithm; Mathematics; Statistics","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.0003170609,0.00014121,0.0001605427,0.0001898341,0.00008245157,0.0004348982,0.001339599,0.00007214637,0.00002071363],"category_scores_gemma":[0.0001076415,0.0001052081,0.00002985353,0.0002416085,0.0000942503,0.000417252,0.0004165713,0.0002937845,0.00002664325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003684623,"about_ca_system_score_gemma":0.00004704082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001539016,"about_ca_topic_score_gemma":0.00000188524,"domain_scores_codex":[0.9986917,0.00001264426,0.0003347392,0.0003266871,0.0004160232,0.0002181666],"domain_scores_gemma":[0.9991837,0.00009791753,0.0001566627,0.0001101734,0.0003951125,0.00005642033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000541495,0.0002608417,0.4339088,0.0001137607,0.00009059003,0.000008016477,0.01027894,0.01322163,0.1404404,0.3525888,0.0008171656,0.04821686],"study_design_scores_gemma":[0.00007789338,0.0000506214,0.03181757,0.0004720268,0.000001139962,0.000008968484,0.000261725,0.9434426,0.01703118,0.006713517,0.000006633835,0.0001161638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9883174,0.00001956982,0.005447683,0.002929201,0.0002706409,0.0001648563,0.000001208347,0.0002150529,0.002634412],"genre_scores_gemma":[0.9763987,0.000006684259,0.0232377,0.0001896045,0.00003457626,0.00001377832,7.44665e-7,0.000006358121,0.0001118345],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9302209,"threshold_uncertainty_score":0.4290263,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06008416597085555,"score_gpt":0.310474550533724,"score_spread":0.2503903845628684,"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."}}