{"id":"W1605924412","doi":"10.1109/spdp.1996.570365","title":"The APHID parallel αβ search algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Iterative deepening depth-first search; Parallel computing; Tree (set theory); Parallelism (grammar); Asynchronous communication; Depth-first search; Game tree; Workstation; Search tree; Table (database); Parallel algorithm; Theoretical computer science; Algorithm; Search algorithm; Game theory; Sequential game; Beam search; Operating system; Mathematics; Best-first search","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.0004836278,0.0005798736,0.0006021541,0.000725363,0.000734252,0.001137764,0.00170782,0.0006238064,0.01191469],"category_scores_gemma":[0.001833139,0.0003599946,0.0005668697,0.0006991915,0.0004891236,0.001096346,0.002363023,0.001056445,0.003431007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007508676,"about_ca_system_score_gemma":0.001848262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004110648,"about_ca_topic_score_gemma":0.004154961,"domain_scores_codex":[0.9994492,0.00008825862,0.000032018,0.0001240135,0.0002170817,0.00008934233],"domain_scores_gemma":[0.9997014,0.0000675785,0.00001659141,0.00005542197,0.0001215459,0.00003736559],"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.0004670485,0.0001645843,0.001571746,0.0002991921,0.00006322288,0.0002264206,0.0001914745,0.1595582,0.006228558,0.1079819,0.03148611,0.6917615],"study_design_scores_gemma":[0.0001993857,0.00009108525,0.0002718349,0.00003471786,0.00003485005,0.0002747875,0.00006101565,0.8632748,0.004594111,0.08180462,0.04933612,0.00002260464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01049366,0.0002765921,0.9591679,0.0003157438,0.0001553658,0.0002065286,0.0003093655,0.00308686,0.025988],"genre_scores_gemma":[0.1230491,0.0002632094,0.8569282,0.0003101602,0.00004906743,0.0004174313,0.0007869991,0.0004803159,0.01771562],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01191469,"threshold_uncertainty_score":0.03985864,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06304370030554499,"score_gpt":0.2922838583298609,"score_spread":0.2292401580243159,"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."}}