{"id":"W2474732749","doi":"10.1007/978-3-662-49619-0_2","title":"On Achieving History-Based Move Ordering in Adversarial Board Games Using 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":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Heuristics; Heuristic; A priori and a posteriori; Context (archaeology); Pruning; Adversarial system; Tree (set theory); Search tree; Monte Carlo tree search; Ranking (information retrieval); Game tree; Theoretical computer science; Artificial intelligence; Sequential game; Algorithm; Game theory; Search algorithm; 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","open_science"],"consensus_categories":[],"category_scores_codex":[0.001033994,0.0007575253,0.0007260863,0.001430777,0.0001993821,0.0003369032,0.007469474,0.0004252969,0.00005971341],"category_scores_gemma":[0.0004960383,0.0006545091,0.0001205605,0.0004618755,0.001145839,0.001275846,0.002930066,0.001111436,0.00003003395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002075644,"about_ca_system_score_gemma":0.001647432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000213962,"about_ca_topic_score_gemma":0.0004215655,"domain_scores_codex":[0.9941581,0.0001002236,0.0007883796,0.002682512,0.001327235,0.0009434836],"domain_scores_gemma":[0.9946551,0.001392504,0.0005084799,0.003074841,0.0001922563,0.000176784],"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.00006548577,0.00003329853,0.00009899909,0.00002415915,0.00001551912,0.0001941888,0.001059601,0.3301051,0.0005307866,0.05189085,0.00003407414,0.6159479],"study_design_scores_gemma":[0.0002108851,0.0001617458,0.00007596419,0.0009939482,0.000008103497,0.0000110262,5.720559e-7,0.8782282,0.001414463,0.1170677,0.0009865136,0.0008408789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000637623,0.0004270683,0.9919973,0.0003369556,0.004465299,0.0004587437,0.00001757493,0.0001508092,0.001508617],"genre_scores_gemma":[0.4380464,0.00001637806,0.5591112,0.001699878,0.0009216034,0.000006437251,0.000005434556,0.00008022933,0.0001124616],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.615107,"threshold_uncertainty_score":0.9995906,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06677026653193777,"score_gpt":0.2875299927013429,"score_spread":0.2207597261694052,"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."}}