{"id":"W2246744812","doi":"10.1145/1558109.1558236","title":"Optimal solutions for moving target search","year":2009,"lang":"en","type":"article","venue":"Infoscience (Ecole Polytechnique Fédérale de Lausanne)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Minimax; Graph; Computer science; Mathematical optimization; Iterative deepening depth-first search; Local search (optimization); Search algorithm; Algorithm; Theoretical computer science; Mathematics; Beam search; Best-first search","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.001935112,0.0002839138,0.000281282,0.0004048843,0.0008939924,0.0005229446,0.002862727,0.0002123944,0.00004016438],"category_scores_gemma":[0.0004618882,0.0003048872,0.0001865244,0.001253981,0.0003376896,0.001757994,0.0004604871,0.0003702256,0.00007438288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002462748,"about_ca_system_score_gemma":0.0005426405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001104968,"about_ca_topic_score_gemma":0.00001964392,"domain_scores_codex":[0.9963953,0.00009072562,0.0005383967,0.0007709034,0.0005235915,0.001681101],"domain_scores_gemma":[0.9979619,0.0002759473,0.0001500233,0.0009853736,0.0002838728,0.0003428363],"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.00004412948,0.0005051214,0.00115006,0.00003470542,0.00001556986,0.00005032585,0.003430396,0.06026293,0.1194103,0.6470373,0.01196023,0.1560989],"study_design_scores_gemma":[0.0001049417,0.0006102012,0.0009860098,0.00007057185,0.000005368527,0.00005236442,0.0001638195,0.6505909,0.3057397,0.03369014,0.007414605,0.0005713355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0126812,0.0001158494,0.9776086,0.00440207,0.0003030183,0.0008748422,0.00001722928,0.0009218812,0.003075257],"genre_scores_gemma":[0.4810995,0.00001949561,0.5164164,0.001546456,0.0001301792,0.0001629395,0.000002659124,0.00001278561,0.0006095865],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6133471,"threshold_uncertainty_score":0.9999403,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03615498199459593,"score_gpt":0.3066631074535542,"score_spread":0.2705081254589583,"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."}}