[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fQ-gohfkTfwviBZQYwkrMW4TzAfcEvfupB6pbvI3L8jc":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2024-12-12 23:49:56",165630687,[8,9,10,11],"堆栈搜索","深度优先","混合搜索","广度优先",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},50,"3a8342c5817fde55f0d9d0ddd8b119df","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F1965153f6f5efd2fba07815761982aeb.jpg","人工智能","work_38313503","","下列哪种搜索方式必然能够找到解( )",[21,33,36,44,54,63,72,79,88,98],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2024-12-13 19:44:08",165630686,[26,27,28,29],"深度优先搜索","有界深度优先搜索","启发式搜索","宽度优先搜索","如果问题存在最优解,则下面几种搜索算法中,( )可以认为是"智能程度相对比较高"的算法","v1",1,{"answer":34,"createTime":5,"id":6,"options":35,"question":19,"source":31,"type":32},[],[8,9,10,11],{"answer":37,"createTime":38,"id":39,"options":40,"question":43,"source":31,"type":32},[],"2024-12-15 13:15:04",165630688,[29,26,41,42],"A算法","代价树的广度优先搜索","以下不属于盲目搜索策略的是( )",{"answer":45,"createTime":46,"id":47,"options":48,"question":53,"source":31,"type":32},[],"2024-12-15 13:15:05",165630689,[49,50,51,52],"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":55,"createTime":56,"id":57,"options":58,"question":62,"source":31,"type":32},[],"2024-12-13 19:49:16",165630690,[59,28,60,61],"模糊搜索","大数据搜索","精确搜索","搜索分为盲目搜索和( )",{"answer":64,"createTime":38,"id":65,"options":66,"question":71,"source":31,"type":32},[],165630691,[67,68,69,70],"B4、C2、D3、D8","B3、C5、D7、E7","B2、C2、D2、E2","C6、D1、E5、E14","在重排九宫问题的状态树中(如下图),以下选项中全是分支节点的是( ). \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6301522d2495cbc3887c6ae2474fabb4.png\">",{"answer":73,"createTime":46,"id":74,"options":75,"question":78,"source":31,"type":32},[],165630692,[76,77,26,27],"广度优先搜索","全局择优搜索","盲目搜索策略不包括下列那个( )",{"answer":80,"createTime":46,"id":81,"options":82,"question":87,"source":31,"type":32},[],165630693,[83,84,85,86],"000-100-110-111","000-010-001-101-111","000-010-100-101-111","000-001-011-111","有一个农夫带一匹狼、一只羊和一棵白菜过河(从河的北岸到南岸).如果没有农夫看管,则狼要吃羊,羊要吃白菜.但是船很小,只够农夫带一样东西过河.用0和1表示狼、羊、白菜分别运到南岸的状态,0表示不在南岸,1表示在南岸,(如:100表示只有狼运到南岸).初始时,南岸状态为000,表示狼、羊、白菜都没运到南岸,最终状态为111,表示狼、羊、白菜都运到了南岸.用状态空间为农夫找出过河方法,以下狼、羊、白菜在南岸出现的序列可能是( )",{"answer":89,"createTime":90,"id":91,"options":92,"question":97,"source":31,"type":32},[],"2024-12-13 19:38:19",166315210,[93,94,95,96],"先进先出","先进后出","随机出","根据估价函数值重排","在深度优先搜索策略中,open表是( )的数据结构",{"answer":99,"createTime":100,"id":101,"options":102,"question":107,"source":31,"type":108},[],"2024-12-08 14:58:54",166315212,[103,104,105,106],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F733134c93e45c5d4844e7cca1ecffbec.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F1756000c59a664be8143e42e48951ad3.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F44a63ef5997c59a589aeebf59d5f7458.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc6547d038bfeb61f53eda555939888e9.png\">","井字棋对弈中,假设甲乙双方采用博弈策略的启发函数为: 若摆的棋子能增加自己得分机会的摆子:得1分; 若摆的棋子能减少对方取胜机会的摆子:得1分; 若摆的棋子能增加自己得分机会且能减少对方得分机会:得2分; 则下列对弈中,● 代表甲方,×代表乙方.乙方能得2分的步骤是( )",0]