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