[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fXlhIEKdSBqTEddX5QU9HZVGyCJ7ckxQtS-wCn6L4en4":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":28,"type":74},[],"2023-09-01 23:37:53",96120388,[8,9,10,11],"搜索过程中必须记住从目标返回的路径","是一种在图中寻找路径的方法","图的每个节点对应一个状态,每条连线对应一个操作符","搜索过程中必须记住哪些点走过了",{"courseId":13,"courseImg":14,"courseName":15},"ba3671f1a2b7020d14b72a000dfa32aa","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7e2d5ad53be3d12aacc56ee37db405b7.jpg","人工智能应用","下列关于图搜索策略说法正确的是____",[18,30,39,48,53,62,71,75,81,90],{"answer":19,"createTime":20,"id":21,"options":22,"question":27,"source":28,"type":29},[],"2023-09-01 23:37:10",96120376,[23,24,25,26],"代价最小","深度最小","深度最大","代价最大","在等代价搜索算法中,总是选择____节点进行扩展","v1",0,{"answer":31,"createTime":20,"id":32,"options":33,"question":38,"source":28,"type":29},[],96120377,[34,35,36,37],"节点x与目标状态位置不同的棋子个数","节点x的子节点数","节点 x 与目标状态位置相同的棋子个数","节点x所在层数","八数码问题中, 启发函数f(x)=g(x)+h(x)中的常使用____来定义g(x)",{"answer":40,"createTime":20,"id":41,"options":42,"question":47,"source":28,"type":29},[],96120378,[43,44,45,46],"前端","末端","任意位置","后端","在图搜索算法中,设规定每次优先从OPEN表的前端取一个节点进行考察,则在宽度优先搜索中,新扩展出的子代节点应该放在OPEN表的____",{"answer":49,"createTime":20,"id":50,"options":51,"question":52,"source":28,"type":29},[],96120379,[43,44,45,46],"在图搜索算法中,设规定每次优先从OPEN表的前端取一个节点进行考察,则在深度优先搜索中,新扩展出的子代节点应该放在OPEN表的____",{"answer":54,"createTime":20,"id":55,"options":56,"question":61,"source":28,"type":29},[],96120380,[57,58,59,60],"宽度优先搜索","深度优先搜索","有界深度优先搜索","A*算法","如果问题存在最优解,则下面几种搜索算法中,____必然可以得到该最优解",{"answer":63,"createTime":20,"id":64,"options":65,"question":70,"source":28,"type":29},[],96120381,[66,67,68,69],"估价函数","最优函数","测试函数","区间函数","在启发式搜索中,____提供一个评定侯选扩展节点的方法,以便确定哪个节点最有可能在通向目标的最佳路径上",{"answer":72,"createTime":5,"id":6,"options":73,"question":16,"source":28,"type":74},[],[8,9,10,11],1,{"answer":76,"createTime":5,"id":77,"options":78,"question":80,"source":28,"type":74},[],96120389,[57,58,79,60],"A算法","下列属于盲目式搜索的是____",{"answer":82,"createTime":5,"id":83,"options":84,"question":89,"source":28,"type":74},[],96120390,[85,86,87,88],"宽度优先搜索的特点是先生成的节点先扩展","深度优先搜索的特点是先生成的节点先扩展","深度优先搜索的特点是先扩展最新产生的节点","宽度优先搜索的特点是先扩展最新产生的节点","宽度优先搜索与深度优先搜索有何区别____",{"answer":91,"createTime":5,"id":92,"options":93,"question":96,"source":28,"type":97},[],96120391,[94,95],"正确","错误","宽度优先搜索方法能够保证在搜索树中找到一条通向目标节点的最短路径",3]