{"id":"W1750339092","doi":"10.1609/aiide.v8i1.12527","title":"Fast Heuristic Search for RTS Game Combat Scenarios","year":2012,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Scripting language; Computer science; Adversary; Heuristic; Incremental heuristic search; State (computer science); Sorting; Iterative deepening depth-first search; Beam search; Search algorithm; Artificial intelligence; Computer security; Algorithm; Programming language","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"],"consensus_categories":[],"category_scores_codex":[0.0004084779,0.0003615484,0.0003662901,0.0001411745,0.0002100713,0.0007591083,0.001358892,0.00008996002,0.00004001466],"category_scores_gemma":[0.000397771,0.0002701484,0.0002098376,0.0002949096,0.0004210022,0.002078997,0.0007105141,0.0003201399,0.00008973006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001361514,"about_ca_system_score_gemma":0.00005312926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002234674,"about_ca_topic_score_gemma":0.000002782102,"domain_scores_codex":[0.9974503,0.00002099564,0.0006967237,0.0005696138,0.0005573115,0.0007050363],"domain_scores_gemma":[0.9981101,0.0003522267,0.0003435452,0.0003109206,0.0006499329,0.0002332551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003401015,0.001024661,0.003406123,0.00008965341,0.00009053784,6.030011e-7,0.01097774,0.0001172811,0.009038414,0.6741376,0.0002315248,0.3005458],"study_design_scores_gemma":[0.00007964805,0.001145006,0.0006637227,0.0005839879,0.00003026895,0.00002270841,0.008234131,0.09183978,0.8484663,0.04721154,0.001109532,0.0006134108],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7635544,0.00009138993,0.2165177,0.003984387,0.001487916,0.001942447,0.0000601576,0.0001308167,0.01223077],"genre_scores_gemma":[0.9986278,0.00002739748,0.0004439347,0.0002898883,0.0001231652,0.00009768029,0.000002457001,0.00002205055,0.0003656484],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8394278,"threshold_uncertainty_score":0.9999751,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0665393189233454,"score_gpt":0.3124185084308653,"score_spread":0.2458791895075199,"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."}}