[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fYNPT_Tr2JcAL5EQi53I_vmj2JfOPH1-2tD-3sZK9wCU":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":16,"related":17,"source":23,"type":24},[],"2024-10-25 12:38:43",999757470,[8,9],"对","错",{"courseId":11,"courseImg":12,"courseName":13,"workId":14,"workName":15},"1000000860","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcf3bb414b5ea2367f316b2d3561124c7.jpg","[共享课]人工智能","59023984","第四章单元测试","任何N元约束满足问题都可以转化为二元约束满足问题.( )",[18,25,28,38,48],{"answer":19,"createTime":5,"id":20,"options":21,"question":22,"source":23,"type":24},[],999757466,[8,9],"约束满足问题的解是满足所有约束的一组变量赋值.( )","v2",3,{"answer":26,"createTime":5,"id":6,"options":27,"question":16,"source":23,"type":24},[],[8,9],{"answer":29,"createTime":5,"id":30,"options":31,"question":36,"source":23,"type":37},[],999757493,[32,33,34,35],"对于任何类型的变量都可以通过枚举的方式展现所有变量赋值情况","一元约束仅涉及一个变量","变量赋值往往伴随与倾向性相关的评价","交通排班可以构建成一个约束满足问题","关于约束满足问题,说法错误的是( )",0,{"answer":39,"createTime":5,"id":40,"options":41,"question":46,"source":23,"type":47},[],999757501,[42,43,44,45],"应选择剩余赋值选择最少的变量进行赋值","应选择剩余赋值选择最多的变量进行赋值","赋值时,应选择最多限制的取值","赋值时,应选择最少限制的取值","关于约束满足问题的回溯搜索算法,以下说法正确的是( )",1,{"answer":49,"createTime":5,"id":50,"options":51,"question":52,"source":23,"type":24},[],999757545,[8,9],"约束满足问题关注动作路径.( )"]