[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fUnUNmbAqRchQsYAoIrxWzquRCZpKfX9yclaI5ocaiI4":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2023-10-29 22:22:41",102498121,[8,9,10,11],"或后继结点","与后继结点","后继结点","与或结点",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},10,"ab5c2cee5356f51738180a90a74fe869","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F48eba3395437dd881b1b9275a0ad1028.png","人工智能","6e1765f8dd5348d394cf43b4a761e768","第三章测试","3【单选题】(10分)‍如果某个非终叶节点含有 时,那么只有当其后继节点至少有一个是可解时,此非终叶节点才是可解的",[21,32,41,44,54,63,72,82,91,100],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],102498118,[25,26,27,28],"状态空间法","问题归约法","谓词逻辑法","语义网络法","1【单选题】 (10分)已知初始问题的描述,通过一系列变换把此问题最终变为一个子问题集合;这些子问题的解可以直接得到,从而解决了初始问题.这是知识表示法叫____.‎","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],102498120,[36,37,38,39],"框架网络","语义图","博弈图","状态图","2【单选题】(10分)‏或图通常称为",{"answer":42,"createTime":5,"id":6,"options":43,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":45,"createTime":46,"id":47,"options":48,"question":53,"source":30,"type":31},[],"2023-10-29 22:22:42",102498124,[49,50,51,52],"全部","至少有一个","某些","确定的一些","4【单选题】(10分)‌在问题归约图中,如果某个非终叶节点含有与后继节点,那么只要当其后裔 为不可解时,此非终叶节点才是不可解的",{"answer":55,"createTime":46,"id":56,"options":57,"question":62,"source":30,"type":31},[],102498125,[58,59,60,61],"最大","最小","任意","以上答案均不正确","5【单选题】(10分)‎在极大极小过程中,当端节点的估值计算出来后,推算"或"父节点得分的方法是选其子节点中一个 的得分作为父节点的得分",{"answer":64,"createTime":46,"id":65,"options":66,"question":71,"source":30,"type":31},[],102498126,[67,68,69,70],"估价函数取值越小越好","估价函数取值越大越好","以上选项都错","估价函数无影响","6【单选题】(10分)‏对于一棵博弈搜索树,自己方寻找最优行动方案时,那些对己方有利的叶节点,取估价值的原则是",{"answer":73,"createTime":46,"id":74,"options":75,"question":80,"source":30,"type":81},[],102498128,[76,77,78,79],"α-β剪枝旨在消除其搜索树中由minimax算法评价的小部分.","α-β剪枝旨在增加其搜索树中由minimax算法评价的节点数量","α-β剪枝旨在消除其搜索树中由minimax算法评价的大部分","α-β剪枝旨在减少其搜索树中由minimax算法评价的节点数量","7【多选题】(10分)‏关于α-β剪枝的陈述哪些是正确的",1,{"answer":83,"createTime":46,"id":84,"options":85,"question":90,"source":30,"type":81},[],102498130,[86,87,88,89],"设计一个估价函数","推算父节点的得分","估算当前节点的得分","估算前一节点的得分","8【多选题】(10分)‍设二方博弈已生成一棵博弈搜索树,一方寻找最优行动方案,需进行 等",{"answer":92,"createTime":46,"id":93,"options":94,"question":99,"source":30,"type":81},[],102498131,[95,96,97,98],"终叶节点都是可解节点","对"或"节点,当其子节点中至少有一个为可解节点时,则该或节点就是可解节点","对"与"节点,只有当其子节点全部为可解节点时,该与节点才是可解节点","终叶节点与可解节点无关","9【多选题】(10分)​在与\u002F或树中,满足以下哪个条件的节点为可解节点",{"answer":101,"createTime":46,"id":102,"options":103,"question":108,"source":30,"type":81},[],102498133,[104,105,106,107],"任何与节点x的b值如果不能升高其父节点的a值,则对节点x以下的分支可停止搜索,并使x的倒推值为b","任何或节点x的a值如果不能降低其父节点的b值,则对节点x以下的分支可停止搜索,并使x的倒推值为a","任何与节点x的b值如果不能降低其父节点的a值,则对节点x以下的分支可停止搜索,并使x的倒推值为b","任何或节点x的a值如果不能升高其父节点的b值,则对节点x以下的分支可停止搜索,并使x的倒推值为a","10【多选题】(10分)‌在进行α-β剪枝时,下列说法正确的是"]