{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004692302,0.0003701742,0.0003756648,0.0006005566,0.0004989268,0.0007788581,0.001618477,0.0002068305,0.0001840928],"category_scores_gemma":[0.00003837152,0.0003678577,0.0001949716,0.0003091915,0.0003328176,0.000984796,0.000008753388,0.0005738648,0.0008533796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002286722,"about_ca_system_score_gemma":0.0002678352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006267354,"about_ca_topic_score_gemma":0.0007722816,"domain_scores_codex":[0.9970839,0.0002200324,0.0004992087,0.0008764587,0.0006729373,0.0006474399],"domain_scores_gemma":[0.9971609,0.000413336,0.0001822103,0.001923027,0.0001202948,0.0002002793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002688914,0.0009969916,0.0002040033,0.0000548961,0.0000306857,0.000182938,0.001300248,0.1035452,0.01576798,0.0006765355,0.0002295448,0.8767421],"study_design_scores_gemma":[0.0004847847,0.0009784054,0.007191071,0.0002204042,0.00002057255,0.0000142804,0.0001871525,0.7935377,0.1951929,0.001315202,0.0002816275,0.0005758344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2460473,0.00001050221,0.7375522,0.001241412,0.001535278,0.0005900881,0.00002431702,0.0004575568,0.01254132],"genre_scores_gemma":[0.9945663,0.00005029035,0.00230387,0.0001713594,0.00008331689,0.00008535115,0.000001719828,0.00003710377,0.002700673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8761662,"threshold_uncertainty_score":0.9999246,"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."}}