{"id":"W2114735315","doi":"","title":"Bootstrapping from Game Tree Search","year":2009,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Incremental heuristic search; Evaluation function; Beam search; Heuristic; Computer science; Search algorithm; Artificial intelligence; Null-move heuristic; Bootstrapping (finance); Search tree; Function (biology); Best-first search; Outcome (game theory); Tree (set theory); Node (physics); Machine learning; Algorithm; Mathematics; Engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":{"n_in":0,"stratum":"aff_core","weight":5595.2375,"opus":{"tier":"OUT","genre":"empirical","about_ca":false,"confidence":"high","reason":"Machine learning algorithm for updating heuristic evaluation functions in game tree search."},"gpt":{"tier":"OUT","genre":"empirical","about_ca":false,"confidence":"high","reason":"It develops a machine-learning algorithm for chess evaluation."},"grok":{"tier":"OUT","genre":"empirical","about_ca":false,"confidence":"high","reason":"AI algorithm for learning from game-tree search is computer science, not research studies."}},"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002200889,0.0007923428,0.001605351,0.001076889,0.0005627657,0.0008767106,0.002250252,0.001275838,0.003862281],"category_scores_gemma":[0.01577816,0.0005704617,0.0006348408,0.0007974758,0.001140088,0.002107466,0.001951111,0.00161471,0.001008371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008688929,"about_ca_system_score_gemma":0.0009369606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001643019,"about_ca_topic_score_gemma":0.002453721,"domain_scores_codex":[0.9987013,0.0005997776,0.0000536599,0.0002041322,0.0003197286,0.0001212254],"domain_scores_gemma":[0.9950634,0.003406158,0.0002583844,0.0006905817,0.0004227645,0.0001587758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003112625,0.0001790978,0.002987717,0.0001734487,0.00008236136,0.0002087889,0.0003001465,0.6513979,0.003172332,0.06532414,0.005629543,0.2702332],"study_design_scores_gemma":[0.0000272256,0.00003618876,0.000120855,0.00001460299,0.000006116716,0.00003241441,0.00001339849,0.9727622,0.0004511031,0.02554149,0.0009885305,0.000005880615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0383154,0.0002980303,0.9552431,0.0002122217,0.00007318223,0.0001414121,0.00008198788,0.001324888,0.004309775],"genre_scores_gemma":[0.6217349,0.0001966515,0.3732134,0.0003821029,0.00009849585,0.0005444598,0.000401195,0.0003940715,0.003034618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003862281,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06177432430172206,"score_gpt":0.3135268052003696,"score_spread":0.2517524808986475,"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."}}