{"id":"W1595285848","doi":"10.1007/11674399_2","title":"Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Adversary; Computer science; Predictability; Exploit; Perfect information; Game tree; Imperfect; Tree (set theory); Adaptation (eye); Evaluation function; Strengths and weaknesses; Function (biology); Game theory; Sequential game; Theoretical computer science; Artificial intelligence; Mathematical economics; Computer security; 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.003427211,0.001040158,0.003266707,0.0008291008,0.0007271462,0.001517917,0.002687395,0.002739037,0.004050418],"category_scores_gemma":[0.01930789,0.0008751195,0.001040713,0.001497103,0.002038983,0.003458245,0.002161553,0.002688362,0.0005395241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001431481,"about_ca_system_score_gemma":0.001654393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004517926,"about_ca_topic_score_gemma":0.003808293,"domain_scores_codex":[0.9981197,0.001219056,0.00006338156,0.0001917566,0.0001960186,0.0002101133],"domain_scores_gemma":[0.9881231,0.01048673,0.0003686802,0.0003544998,0.0003256314,0.0003413908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001554943,0.00008831124,0.0003528641,0.0001093434,0.00006636864,0.00007707971,0.0001031179,0.8530768,0.0003310865,0.1288634,0.002539069,0.01423718],"study_design_scores_gemma":[0.00002402227,0.0000186941,0.00004215231,0.000005997159,0.000006755912,0.00001141521,0.000006184049,0.9460487,0.00003517094,0.05360995,0.0001854526,0.000005456254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06575914,0.0008285625,0.9203934,0.000803294,0.0001096362,0.0001474419,0.0001283152,0.0003252316,0.01150499],"genre_scores_gemma":[0.8932854,0.0006144524,0.09580708,0.0002840452,0.0001207705,0.0003131363,0.0001748007,0.0001420009,0.009258234],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004517926,"threshold_uncertainty_score":0.018125,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02015158814965948,"score_gpt":0.2538248566446211,"score_spread":0.2336732684949616,"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."}}