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