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