{"id":"W2503495475","doi":"10.1007/978-3-319-42007-3_73","title":"Challenging Established Move Ordering Strategies with Adaptive Data Structures","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Pruning; Heuristic; Context (archaeology); Domain (mathematical analysis); Tree (set theory); Game tree; Monte Carlo tree search; Field (mathematics); Range (aeronautics); Artificial intelligence; Theoretical computer science; Sequential game; Game theory; Mathematical economics; Mathematics","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","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007456575,0.0007666862,0.0006381473,0.00080376,0.0003752339,0.00156564,0.009231553,0.0003115138,0.00004741222],"category_scores_gemma":[0.0001179856,0.0005495004,0.00006538226,0.0005852008,0.001378062,0.003665144,0.004113651,0.0008892491,0.0000443089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002620128,"about_ca_system_score_gemma":0.001102536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006942727,"about_ca_topic_score_gemma":0.0003258061,"domain_scores_codex":[0.9944213,0.00004068521,0.0005830429,0.002640111,0.001327986,0.0009868551],"domain_scores_gemma":[0.9946363,0.0007434905,0.0004035038,0.003638861,0.0003797369,0.0001981395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001547701,0.00001165624,0.0000172518,0.0000242872,0.00002744422,0.0001613021,0.001276545,0.05927649,0.00008756816,0.20007,0.00001068547,0.7390213],"study_design_scores_gemma":[0.0001307281,0.0002398397,0.00005807624,0.0007894856,0.00001142792,0.00009414565,0.000007254257,0.5070322,0.001787825,0.4878044,0.0009407092,0.0011039],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000634786,0.000661298,0.9880593,0.0005984012,0.001250154,0.0004095691,0.00001788075,0.0002947656,0.008645182],"genre_scores_gemma":[0.4740665,0.00009781307,0.5243565,0.0003991487,0.0007500687,0.000009390866,0.000006442348,0.0000745812,0.0002395624],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7379174,"threshold_uncertainty_score":0.9996957,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04659388762513843,"score_gpt":0.2776773149469274,"score_spread":0.231083427321789,"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."}}