[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$frDiK2mA0h2f5lhUMeWfl-y1uuWkGF7pvxgtUmmkOEcM":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":28,"type":29},[],"2024-03-23 17:16:32",135253027,[8,9,10,11],"最小","最大","任意","以上答案均不正确",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},19,"8bbb97f998a533b0210d61a11c5cafb6","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2abfda980c06780cab891e2d70a68690.jpg","人工智能原理-2022智能","a771af6b91e3482289e9affb16221909","","在极大极小过程中,当端节点的估值计算出来后,推算"或"父节点得分的方法是选其子节点中一个( )的得分作为父节点的得分",[21,30,39,42,51,60,69,79,88,97],{"answer":22,"createTime":5,"id":23,"options":24,"question":27,"source":28,"type":29},[],135253025,[8,9,25,26],"平均","alpha","在alpha-beta剪枝中,一个min节点的beta值等于其后续节点当前 ( ) 的最终倒推值","v1",0,{"answer":31,"createTime":5,"id":32,"options":33,"question":38,"source":28,"type":29},[],135253026,[34,35,36,37],"beta剪枝","alpha剪枝","alpha-beta剪枝","极小极大分析法","在alpha-beta剪枝技术中,"或"节点n的a值如果不能降低其父节点的beta值,则对节点n以下的分支可停止搜索,并使节点n的倒推值为alpha,这种剪枝称为()",{"answer":40,"createTime":5,"id":6,"options":41,"question":19,"source":28,"type":29},[],[8,9,10,11],{"answer":43,"createTime":5,"id":44,"options":45,"question":50,"source":28,"type":29},[],135253028,[46,47,48,49],"估价函数取值越小越好","估价函数取值越大越好","估价函数无影响","以上选项都错","对于一棵博弈搜索树,自己方寻找最优行动方案时,那些对己方有利的叶节点,取估价值的原则是什么",{"answer":52,"createTime":5,"id":53,"options":54,"question":59,"source":28,"type":29},[],135253029,[55,56,57,58],"与","或","不确定","以上都不对","博弈树中,或节点和与节点逐层交替出现,自己一方扩展节点是 关系",{"answer":61,"createTime":5,"id":62,"options":63,"question":68,"source":28,"type":29},[],135253030,[64,65,66,67],"剪枝就是在搜索深度不变的情况下,利用已有的搜索信息增加生成的节点数","α剪枝:如果一个MIN节点的β值小于或等于它的某一个MAX祖先节点的α值,则剪枝发生在该MIN节点之下","极小化极大过程中节点数会随着搜索深度的增加呈指数增长","β剪枝:如果一个MAX节点的α值大于或者等于它的某一个MIN祖先节点的β值,则剪枝发生在该MAX节点之下","以下关于说法错误的是",{"answer":70,"createTime":5,"id":71,"options":72,"question":77,"source":28,"type":78},[],135253031,[73,74,75,76],"α-β剪枝旨在增加其搜索树中由minimax算法评价的大部分","α-β剪枝旨在增加其搜索树中由minimax算法评价的节点数量","α-β剪枝旨在消除其搜索树中由minimax算法评价的大部分","α-β剪枝旨在减少其搜索树中由minimax算法评价的节点数量","关于α-β剪枝的哪些陈述是正确的",1,{"answer":80,"createTime":5,"id":81,"options":82,"question":87,"source":28,"type":78},[],135253032,[83,84,85,86],"设计一个估价函数","推算父节点的得分","估算当前节点的得分","估算前一节点的得分","设二方博弈已生成一棵博弈搜索树,一方寻找最优行动方案,需进行( )等",{"answer":89,"createTime":5,"id":90,"options":91,"question":96,"source":28,"type":78},[],135253034,[92,93,94,95],"任何与节点x的b值如果不能升高其父节点的a值,则对节点x以下的分支可停止搜索,并使x的倒推值为b","任何或节点x的a值如果不能降低其父节点的b值,则对节点x以下的分支可停止搜索,并使x的倒推值为a","任何与节点x的b值如果不能降低其父节点的a值,则对节点x以下的分支可停止搜索,并使x的倒推值为b","任何或节点x的a值如果不能升高其父节点的b值,则对节点x以下的分支可停止搜索,并使x的倒推值为a","在进行α-β剪枝时,下列说法正确的是",{"answer":98,"createTime":5,"id":99,"options":100,"question":105,"source":28,"type":78},[],135253036,[101,102,103,104],"一种机器博弈算法","可提高极小极大搜索效率的算法","采用广度优先搜索策略的算法","采用深度优先搜索策略的算法","Alpha-Beta剪枝是()"]