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