{"id":"W2017334312","doi":"10.1016/j.tcs.2015.04.005","title":"The optimal capture time of the one-cop-moves game","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Computer science; Graph; Combinatorial game theory; Monotonic function; Game tree; Set (abstract data type); Depth-first search; Greedy algorithm; Mathematics; Combinatorics; Sequential game; Mathematical optimization; Theoretical computer science; Search algorithm; Algorithm; Game theory; Mathematical economics","routes":{"ca_aff":true,"ca_fund":true,"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":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002494853,0.0001768742,0.0001988665,0.00006139931,0.0004408356,0.0005010178,0.007228771,0.00006126813,0.00001654623],"category_scores_gemma":[0.0005256748,0.00009357731,0.000103074,0.001261585,0.008491088,0.0005261598,0.002516608,0.0002813221,0.0001992523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000660881,"about_ca_system_score_gemma":0.0003735541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001209772,"about_ca_topic_score_gemma":0.000001480949,"domain_scores_codex":[0.9969608,0.0002214903,0.0003790728,0.0005264582,0.001312539,0.000599624],"domain_scores_gemma":[0.9969504,0.0006020432,0.0001437342,0.001577087,0.000468579,0.0002581881],"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.000008240049,0.00003689236,0.0000367993,0.000001430801,0.000004012531,0.000001612057,0.002487674,0.001267885,0.0006687299,0.9826232,0.000277276,0.01258623],"study_design_scores_gemma":[0.00006253109,0.0001383832,0.0003628208,0.00002860309,0.000005211618,0.0000229446,0.00006081397,0.6973962,0.03803056,0.263119,0.0005960969,0.0001769145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07090442,0.0001073203,0.9159027,0.006081882,0.001191987,0.0002524455,0.000001390234,0.0001240309,0.005433866],"genre_scores_gemma":[0.9607946,0.000002490193,0.03843298,0.0005250653,0.0001241932,0.000004844956,8.080858e-8,0.000007268411,0.0001084766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8898902,"threshold_uncertainty_score":0.9981426,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02293813111192066,"score_gpt":0.2674338826879437,"score_spread":0.244495751576023,"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."}}