[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fh4GLftpzExz15Gkt1igR3K22ERwhhZkzTBFT0q49hWA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":17,"related":18,"source":29,"type":72},[],"2024-10-02 09:30:22",160655176,[8,9],"正确","错误",{"count":11,"courseId":12,"courseImg":13,"courseName":14,"workId":15,"workName":16},6,"11d2824b32a123c5b7bda0137ea3cb78","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2d4e920a2e6bca9b70c97a8302bc5241.jpeg","人工智能导论","0f78b19097ba42cc9af144099d0aaff5","搜索章末测试","在图搜索算法中,如果按估价函数\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9d6f17046da938067a9298a3d7aacc71.png\"> 作为OPEN表中的结点排序的依据,则该算法就是深度优先算法",[19,31,40,51,60,69],{"answer":20,"createTime":21,"id":22,"options":23,"question":28,"source":29,"type":30},[],"2023-09-06 12:44:16",96331069,[24,25,26,27],"框架网络","语义图","博亦图","状态图","或图通常称为","v1",0,{"answer":32,"createTime":21,"id":33,"options":34,"question":39,"source":29,"type":30},[],96331070,[35,36,37,38],"宽度优先搜索","深度优先搜索","有界深度搜索","启发式搜索","如果问题存在最优解,则下面几种搜索算法中,( )可以认为是"智能程度相对比较高"的算法",{"answer":41,"createTime":42,"id":43,"options":44,"question":49,"source":29,"type":50},[],"2023-09-16 12:22:14",96331071,[45,46,47,48],"g(x)是从初始节点到节点x的实际代价","h(x)是从初始节点x到目标节点的实际代价","g(x)是从初始节点到节点x的最优路径的估价代价","h(x)是从节点x到目标节点的最优路径的估价代价","在估价函数中,对与g(x)和h(x)下面描述正确的是( )",1,{"answer":52,"createTime":42,"id":53,"options":54,"question":59,"source":29,"type":30},[],96850265,[55,56,57,58],"h(x)≤h*(x)","h(x)≠h*(x)","h(x)≥h*(x)","h(x)>h*(x)","依据估价函数f(x)=g(x)+h(x) (其中g(x)为初始节点到节点x已实际付出的代价,h(x)是节点x到目标节点的最优路径的估计代价)对OPEN表中的节点进行排序,并且要求启发函数满足( ),则称这种状态空间图的搜索算法为A*算法",{"answer":61,"createTime":42,"id":62,"options":63,"question":68,"source":29,"type":30},[],96850272,[64,65,66,67],"closed表用于存放已扩展的节点","open表用于存放已扩展的节点","open表用于存放所有已生成的节点","closed表用于存放所有已生成而未扩展的节点","在启发式图搜索策略中,下面描述正确的是( )",{"answer":70,"createTime":5,"id":6,"options":71,"question":17,"source":29,"type":72},[],[8,9],3]