{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001727433,0.001008386,0.00151175,0.001021762,0.0009655282,0.003528879,0.002171,0.00258873,0.01900847],"category_scores_gemma":[0.01382053,0.0007745053,0.0006780625,0.0006984716,0.001790532,0.005655289,0.001668604,0.002612933,0.00101605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0021618,"about_ca_system_score_gemma":0.003134657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002923235,"about_ca_topic_score_gemma":0.002556401,"domain_scores_codex":[0.9989532,0.0003361366,0.00003869494,0.0001842817,0.0001508281,0.0003367267],"domain_scores_gemma":[0.9911248,0.006143695,0.000534574,0.0003410279,0.000392435,0.001463524],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001481009,0.0002469574,0.001238737,0.0003582927,0.0001002461,0.0001838476,0.000475279,0.1323648,0.005495619,0.829381,0.009009582,0.01966472],"study_design_scores_gemma":[0.0002219054,0.0003063841,0.001246428,0.0000981894,0.00006016651,0.0001204557,0.0003061387,0.5237578,0.00163263,0.4696553,0.002525724,0.00006891865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6006289,0.001668699,0.2789401,0.004825332,0.0003223805,0.0002836414,0.001078676,0.0006436534,0.1116088],"genre_scores_gemma":[0.9720201,0.0005515924,0.0117973,0.000199056,0.00007305576,0.0001392972,0.0003124401,0.0001689482,0.01473827],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01900847,"threshold_uncertainty_score":0.06358975,"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."}}