[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fFBcnUusDbXReXtP9TqNHp9ndrOmZDHCP4bh_iSz4iGU":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":13,"related":14,"source":19,"type":20},[],"2025-05-22 15:47:37",1008571616,[8,9,10,11],"终叶节点都是可解节点","对&quot;或&quot;节点,当其子节点中至少有一个为可解节点时,则该或节点就是可解节点","对&quot;与&quot;节点,只有当其子节点全部为可解节点时,该与节点才是可解节点","终叶节点与可解节点无关",{},"在与\u002F或树中,满足以下哪个条件的节点为可解节点 ?(多选题)",[15,21,31,40,49],{"answer":16,"createTime":5,"id":17,"options":18,"question":13,"source":19,"type":20},[],1008571282,[8,9,10,11],"v2",1,{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":19,"type":30},[],1008571613,[25,26,27,28],"或后继结点","与后继结点","后继结点","与或结点","如果某个非终叶节点含有____ 时,那么只有当其后继节点至少有一个是可解时,此非终叶节点才是可解的",0,{"answer":32,"createTime":5,"id":33,"options":34,"question":39,"source":19,"type":30},[],1008571614,[35,36,37,38],"估价函数取值越小越好","估价函数取值越大越好","估价函数无影响","以上选项都错","对于一棵博弈搜索树,自己方寻找最优行动方案时,那些对己方有利的叶节点,取估价值的原则是 ____",{"answer":41,"createTime":5,"id":42,"options":43,"question":48,"source":19,"type":20},[],1008571615,[44,45,46,47],"设计一个估价函数","推算父节点的得分","估算当前节点的得分","估算前一节点的得分","设二方博弈已生成一棵博弈搜索树,一方寻找最优行动方案,需进行 ____等.(多选题)",{"answer":50,"createTime":5,"id":6,"options":51,"question":13,"source":19,"type":20},[],[8,9,10,11]]