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