{"id":"W2230033167","doi":"","title":"Adversarial hierarchical-task network planning for complex real-time games","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Adversarial system; Task (project management); Tree (set theory); Theoretical computer science; Artificial intelligence; Combinatorial game theory; Point (geometry); Machine learning; Game theory; Sequential game; Monte Carlo method; Mathematics; Mathematical economics","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.001122579,0.0004352031,0.0004443931,0.0002876491,0.0002823348,0.0007771936,0.003000899,0.0001997914,0.0003769785],"category_scores_gemma":[0.0009957586,0.0004368837,0.000218917,0.000469747,0.0003571826,0.0007294715,0.0004633765,0.0003843583,0.001472822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002374428,"about_ca_system_score_gemma":0.000423598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001135411,"about_ca_topic_score_gemma":0.00003964802,"domain_scores_codex":[0.9958414,0.0001839089,0.001038989,0.001059732,0.001058321,0.0008175834],"domain_scores_gemma":[0.9965402,0.0007817853,0.0003635438,0.0007657153,0.001118627,0.0004300509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003970435,0.0001665197,0.00006069941,0.000004699281,0.00006120111,0.00002713535,0.001735777,0.02577572,0.003959497,0.8764124,0.008610667,0.08278864],"study_design_scores_gemma":[0.00005760931,0.0003553838,0.00003467972,0.00007741375,0.000007981005,0.000009313992,0.0002896855,0.5718582,0.006375813,0.4119817,0.008559006,0.0003931655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00332312,0.0000197209,0.9400339,0.006757567,0.003843905,0.0006365278,0.00004328124,0.000488513,0.04485352],"genre_scores_gemma":[0.9125475,0.00003035927,0.08324226,0.0009664151,0.001946631,0.0001492454,0.00007346783,0.00004284741,0.001001219],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9092245,"threshold_uncertainty_score":0.9998083,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2196141500131067,"score_gpt":0.3844458776644416,"score_spread":0.1648317276513349,"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."}}