{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002910601,0.00008090412,0.0000640544,0.00003278169,0.0003258506,0.0003092324,0.001391315,0.00003357141,0.0002086223],"category_scores_gemma":[0.00003536803,0.00004972245,0.00004916689,0.0002942824,0.0001290511,0.0002636182,0.0002748572,0.0001296054,0.002502533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001829279,"about_ca_system_score_gemma":0.00001092276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007721121,"about_ca_topic_score_gemma":0.00002688256,"domain_scores_codex":[0.9988757,0.00005550824,0.0001647665,0.000237382,0.0003222345,0.0003444187],"domain_scores_gemma":[0.9989541,0.0002568685,0.00002076518,0.0006200892,0.00007198461,0.00007622144],"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":[3.169293e-7,0.00002209596,0.00004638913,4.454971e-7,0.00000509188,0.000007612538,0.0005492108,0.0001218297,0.00002051667,0.1203592,0.01658589,0.8622813],"study_design_scores_gemma":[0.00001915984,0.00003445652,0.00006331334,0.000001824017,6.611329e-7,0.00001027256,0.0001270287,0.9148811,0.002705792,0.01095723,0.07109881,0.000100338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002944601,0.0003181169,0.9447547,0.008353051,0.0003164037,0.0001025564,2.348848e-7,0.0001925307,0.04566799],"genre_scores_gemma":[0.3000392,0.0008360479,0.5897812,0.00229057,0.0004818286,0.00005378954,4.249982e-7,0.00002551403,0.1064913],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9147593,"threshold_uncertainty_score":0.9982741,"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."}}