{"id":"W2794254934","doi":"10.1109/tciaig.2017.2717902","title":"Game Tree Search Based on Nondeterministic Action Scripts in Real-Time Strategy Games","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Games","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Iterative deepening depth-first search; Computer science; Nondeterministic algorithm; Scripting language; Tree (set theory); Search algorithm; Action (physics); Beam search; Adversarial system; Representation (politics); State (computer science); Search tree; Artificial intelligence; Incremental heuristic search; Machine learning; Theoretical computer science; 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.001101749,0.0007320672,0.0008162701,0.0004205327,0.0004127021,0.0007568936,0.00109283,0.0009806154,0.002976941],"category_scores_gemma":[0.006100499,0.0003280381,0.0005148601,0.0003449976,0.001161143,0.001579022,0.001036308,0.001245589,0.0003780586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008655517,"about_ca_system_score_gemma":0.001172836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003882145,"about_ca_topic_score_gemma":0.00366378,"domain_scores_codex":[0.9991273,0.0003968805,0.00004672554,0.0001358881,0.0002047005,0.00008853497],"domain_scores_gemma":[0.9977368,0.001582666,0.0001788803,0.000211675,0.0001412041,0.0001488304],"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.0002628247,0.0001581093,0.001316488,0.0001301424,0.00005482448,0.0001784096,0.0002320203,0.9074928,0.005008535,0.04664163,0.001026548,0.03749764],"study_design_scores_gemma":[0.00001956096,0.00005820891,0.00009932975,0.000007449369,0.000005392732,0.00003169883,0.00001189756,0.9877687,0.0007876728,0.01063027,0.0005747734,0.000005088998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1584921,0.0004167055,0.8314051,0.0002560646,0.00006290202,0.0002296386,0.000126339,0.001314271,0.007696876],"genre_scores_gemma":[0.8426703,0.0001717361,0.1541838,0.0001349877,0.00001183088,0.0002036697,0.0001577763,0.0001070279,0.002358803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003882145,"threshold_uncertainty_score":0.009958923,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09331092000930677,"score_gpt":0.350508201937805,"score_spread":0.2571972819284982,"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."}}