{"schema_version":"1.0","language":"zh-CN","generated_from":"NEWVAR 从零开始学AI structured Markdown","write_access":false,"full_text_access":false,"content_boundary":"This endpoint exposes metadata, objectives, prerequisites, labs and source summaries. It does not expose chapter body text or answer text.","chapter":{"slug":"planning-and-games","title":"规划、博弈树与对手","english_title":"Planning and games","chapter_number":28,"volume":2,"volume_title":"第二卷：经典AI与机器学习","month":7,"unit_title":"搜索、约束与规划","review_status":"draft","updated_at":"2026-08-06","estimated_hours":8,"focus":"理解动作前提、效果、效用、极小极大和剪枝，区分确定与随机对手。","objectives":["理解动作前提、效果、效用、极小极大和剪枝，区分确定与随机对手。","解释核心数学关系并完成最小实现","运行单变量实验并记录失败样例","完成工程线或研究线至少一项迁移任务"],"prerequisites":["csp-and-sat"],"exercise_count":3,"tracks":["engineering","research"],"human_url":"/learn/planning-and-games"},"labs":[{"id":"lab-planning-and-games","chapter_slug":"planning-and-games","title":"规划、博弈树与对手：单变量实验","kind":"search_depth","data_status":"教学模拟","variable":{"label":"搜索深度","unit":"层","min":1,"max":12,"step":1,"default":4},"objective":"只改变“搜索深度”，观察结果、代价和风险如何一起变化，理解理解动作前提、效果、效用、极小极大和剪枝，区分确定与随机对手。","static_fallback":"静态替代：把搜索深度分别设为1层、4层和12层，手工比较三组教学模拟输出。","keyboard":"聚焦滑块后使用方向键微调，Page Up/Page Down大步调整，Home/End到达边界。","measurement_note":"页面数值由公开公式生成，只用于教学，不代表真实模型性能或现实世界因果效果。","source_ids":["S016","S017"]}],"project":{"id":"project-07","month":7,"title":"实现一个校园路线与排课求解器","brief":"分别用图搜索和约束求解处理路径与排课，比较正确性、代价和扩展节点数。","deliverables":["问题与边界说明","可运行最小实现","实验记录与失败分析","来源与许可清单","风险、隐私与人工闸门","复现README"]},"sources":[{"id":"S016","author":"Stuart Russell, Peter Norvig","title":"Artificial Intelligence: A Modern Approach","source_level":"经典教材官方站","published_at":"持续更新","accessed_at":"2026-08-06","doi_or_url":"https://aima.cs.berkeley.edu/"},{"id":"S017","author":"Stanford University","title":"CS221: Artificial Intelligence","source_level":"大学课程一手资料","published_at":"持续更新","accessed_at":"2026-08-06","doi_or_url":"https://stanford-cs221.github.io/"}]}