[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fqRzU7dKxp0JsUlzoR9tlneD_Ck2Fz_9oQ3QJi71Tnnk":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":18,"related":19,"source":29,"type":48},[],"2024-10-25 12:26:30",1006309656,[8,9,10,11],"G1","G2","G3","均不可能",{"courseId":13,"courseImg":14,"courseName":15,"workId":16,"workName":17},"1000000860","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcf3bb414b5ea2367f316b2d3561124c7.jpg","[共享课]人工智能","59859673","搜索算法的介绍和应用","在下列图搜索问题中,S为起始节点,G1、G2、G3均为目标节点,则采用一致代价找到的解是( )\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff61ef9bf59f17ce5fe78d71ec4436357.png\">",[20,31,40,49,57],{"answer":21,"createTime":5,"id":22,"options":23,"question":28,"source":29,"type":30},[],1006309652,[24,25,26,27],"深度优先图搜索(BFS)可以保证找到解(如果存在至少一解)","一致代价搜索(UCS)不一定总能找到最优解","存在广度优先树搜索有解而深度优先树搜索无解的案例","存在深度优先树搜索有解而广度优先树搜索无解的案例","对于有限状态图上的搜索问题,以下说法正确的有( )","v2",1,{"answer":32,"createTime":5,"id":33,"options":34,"question":39,"source":29,"type":30},[],1006309653,[35,36,37,38],"不在目标位置的数码总数","各数码到目标位置的曼哈顿距离总和","数码1、2、3、4移动到正确位置的步数","都不正确","在如下图的八数码问题中,如果A格与B格相邻且B为空,则A可以移动至B.以下可以作为八数码问题的一致启发式函数的有( ).\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9f7b233164e43f4a605e3be2d392c85e.png\">",{"answer":41,"createTime":5,"id":42,"options":43,"question":47,"source":29,"type":48},[],1006309654,[44,45,46,44],"9","8","9*9","在下图八数码问题中,需要通过移动将杂乱的8个方块按照右侧的顺序进行排列,那么该问题的状态空间的大小是( )?\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ffeb172e27c2784719c655359c75c69df.png\">",0,{"answer":50,"createTime":5,"id":51,"options":52,"question":55,"source":29,"type":56},[],1006309655,[53,54],"对","错","对于一个边损耗非负的有限图,采用广度优先树搜索可以得到最优解,并且对每条边加上一个相同的非负损耗c>0之后,最优路径保持不变",3,{"answer":58,"createTime":5,"id":6,"options":59,"question":18,"source":29,"type":48},[],[8,9,10,11]]