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