[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fmIJTi1iZ3XLR44lHPgKSUNHuYuleHIqgosv3BLCX_E0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":21,"type":22},[],"2023-10-24 23:01:22",101432647,[8,9,10,11],"状态空间法","问题归约法","谓词逻辑法","语义网络法",{"courseId":13,"courseImg":14,"courseName":15},"6ae4565f655a0499bf813a03938faf63","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F151b1e04e0edd24518d87450e76e122a.jpg","人工智能","已知初始问题的描述,通过一系列变换把此问题最终变为一个子问题集合;这些子问题的解可以直接得到,从而解决了初始问题.这是知识表示法叫____",[18,23,32,41,50,59,68,77,86,94],{"answer":19,"createTime":5,"id":6,"options":20,"question":16,"source":21,"type":22},[],[8,9,10,11],"v1",0,{"answer":24,"createTime":5,"id":25,"options":26,"question":31,"source":21,"type":22},[],101432648,[27,28,29,30],"框架网络","语义图","博弈图","状态图","或图通常称为____",{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":21,"type":22},[],101432649,[36,37,38,39],"或后继结点","与后继结点","后继结点","与或结点","如果某个非终叶节点含有____ 时,那么只有当其后继节点至少有一个是可解时,此非终叶节点才是可解的",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":21,"type":22},[],101432650,[45,46,47,48],"全部","至少有一个","某些","确定的一些","在问题归约图中,如果某个非终叶节点含有与后继节点,那么只要当其后裔____ 为不可解时,此非终叶节点才是不可解的",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":21,"type":22},[],101432651,[54,55,56,57],"最大","最小","任意","以上答案均不正确","在极大极小过程中,当端节点的估值计算出来后,推算"或"父节点得分的方法是选其子节点中一个 ____的得分作为父节点的得分",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":21,"type":22},[],101432652,[63,64,65,66],"估价函数取值越小越好","估价函数取值越大越好","估价函数无影响","以上选项都错","对于一棵博弈搜索树,自己方寻找最优行动方案时,那些对己方有利的叶节点,取估价值的原则是 ____",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":21,"type":22},[],101432653,[72,73,74,75],"代价最小","深度最小","深度最大","代价最大","在等代价搜索算法中,总是选择____节点进行扩展",{"answer":78,"createTime":5,"id":79,"options":80,"question":85,"source":21,"type":22},[],101432654,[81,82,83,84],"节点x与目标状态位置不同的棋子个数","节点x的子节点数","节点 x 与目标状态位置相同的棋子个数","节点x所在层数","八数码问题中, 启发函数f(x)=g(x)+h(x)中的常使用____来定义g(x)",{"answer":87,"createTime":5,"id":88,"options":89,"question":93,"source":21,"type":22},[],101432655,[90,91,92],"不一定","不能","能","宽度优先搜索方法____保证在搜索树中找到一条通向目标节点的最短路径",{"answer":95,"createTime":5,"id":96,"options":97,"question":102,"source":21,"type":22},[],101432656,[98,99,100,101],"前端","末端","任意位置","后端","在图搜索算法中,设规定每次优先从OPEN表的前端取一个节点进行考察,则在宽度优先搜索中,新扩展出的子代节点应该放在OPEN表的____"]