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