{"id":"W4387918059","doi":"10.1007/978-3-031-44505-7_37","title":"Learn, Compare, Search: One Sawmill’s Search for the Best Cutting Patterns Across and/or Trees","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"FPInnovations; Université Laval","funders":"","keywords":"Computer science; Monte Carlo tree search; Process (computing); Metric (unit); Tree (set theory); Set (abstract data type); Depth-first search; Computation; Search algorithm; Search tree; Monte Carlo method; Breadth-first search; Algorithm; Mathematics; Statistics; Engineering; Combinatorics; Operations management","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009536967,0.001248461,0.001203076,0.001018436,0.001332168,0.002663116,0.003066042,0.002138389,0.03152052],"category_scores_gemma":[0.005655211,0.0008864605,0.001233534,0.00174289,0.002082762,0.00802738,0.002291298,0.002653911,0.005487642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007690456,"about_ca_system_score_gemma":0.001185899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002828628,"about_ca_topic_score_gemma":0.005511566,"domain_scores_codex":[0.9995217,0.0001192983,0.0000312394,0.000180152,0.0001002524,0.00004744081],"domain_scores_gemma":[0.9988952,0.0007218273,0.0000435998,0.0001749333,0.0000874952,0.0000769394],"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.0004745318,0.000218695,0.002156919,0.0005096316,0.0002152907,0.0002121369,0.0009505994,0.02851329,0.003815718,0.1453117,0.1047255,0.7128959],"study_design_scores_gemma":[0.0002171378,0.0002747582,0.0008915081,0.0002122654,0.0001787854,0.0006422774,0.001031553,0.2964441,0.004836822,0.6175706,0.07760525,0.00009489524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04376776,0.00423543,0.8752887,0.00733823,0.0007093226,0.0001538482,0.0007938223,0.005268579,0.06244428],"genre_scores_gemma":[0.1659773,0.001366774,0.7912766,0.001284808,0.0002473648,0.0001366752,0.001068795,0.001445749,0.03719589],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03152052,"threshold_uncertainty_score":0.1054466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1589218717874417,"score_gpt":0.3648855646293663,"score_spread":0.2059636928419246,"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."}}