{"id":"W1543366997","doi":"10.1017/cbo9780511807251.002","title":"Playing games with algorithms: Algorithmic combinatorial game theory","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorial game theory; Ideal (ethics); Computer science; Game complexity; Algorithmic game theory; Game theory; Constraint (computer-aided design); Theoretical computer science; Turns, rounds and time-keeping systems in games; Computational complexity theory; Algorithm; Mathematics; Sequential game; Game mechanics; Video game design; Mathematical economics; Artificial intelligence; Worst-case complexity","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.0005603203,0.000797518,0.0007556088,0.0003639581,0.0002140454,0.0004698912,0.00234927,0.0005484397,0.000381679],"category_scores_gemma":[0.00004107985,0.0006455194,0.0002414591,0.0001236857,0.0003673642,0.0006176758,0.0004112422,0.0008820537,0.0008929102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001874039,"about_ca_system_score_gemma":0.0003237727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002928877,"about_ca_topic_score_gemma":0.00001121506,"domain_scores_codex":[0.996314,0.00006565754,0.0006827759,0.001249356,0.00101643,0.0006717712],"domain_scores_gemma":[0.9971111,0.0004312532,0.000403194,0.001498394,0.0003111075,0.0002449531],"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.00001631913,0.00002245519,0.000001370202,0.000006444459,0.00005898742,0.0001273561,0.0002502653,0.00001942235,0.000004524182,0.6652496,0.0005594327,0.3336838],"study_design_scores_gemma":[0.0002395543,0.0006039263,0.000008631446,0.0002969457,0.00005619021,0.0001239118,0.00003634141,0.009565488,0.0009194725,0.8939822,0.09289779,0.001269536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000005518444,0.0004303167,0.4246347,0.0002274123,0.001346793,0.0004125961,0.000005877575,0.000628219,0.5723085],"genre_scores_gemma":[0.00628661,0.0003170973,0.1296677,0.001406119,0.002242285,0.00004374212,0.0000226643,0.0002071932,0.8598066],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3324143,"threshold_uncertainty_score":0.999885,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02165721671861152,"score_gpt":0.2509490699804338,"score_spread":0.2292918532618223,"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."}}