如何在Python中正确实现具有n分支因子的树？

我想在python中实现minimax算法，但我在创建分支树结构时遇到了一些问题。我仍然是一个业余程序员，所以请不要介意我的代码看起来不好。这里是我的节点结构如何在Python中正确实现具有n分支因子的树？

class Node: 
    parent = None 
    state = None 
    pmax = 0  #this represents the MAX player symbol; i.e. SELF 
    pmin = 0  #this represents the MIN player symbol; i.e. OPPONENT 
    stateCost = 0 #this represents utility cost of leaf nodes based on the matrix state 
    bestCost = None #this represents the chosen path in the minimax algorithm 
    children = [] 

    def __init__(self,mat,up,mx,mn): 
     self.parent = up 
     self.state = mat 
     self.pmax = mx 
     self.pmin = mn 
     stateCost = 0 

    def addChild(self,newState,up): 
     n = Node(newState,up,self.pmax,self.pmin) 
     self.children.append(n) 

    def evaluateChildren(self,minmax): 
     ln = len(self.state[0]) 
     for x in range(ln): 
      #newState = insertIntoSink(self.state[0],x) 
      cloneState = cloneMatrix(self.state) 
      newState = insertIntoSink(cloneState,x,minmax) 
      print "state being added" 
      for list in newState: 
       print list 
      self.addChild(newState,self) 

     print "done Evaluating CHILDREN" 


    def evaluateSubChildren(self,minimax): 
     ln = len(self.state[0]) 

     for l in self.children: 
      for x in range(ln): 
       cloneState = cloneMatrix(self.state) 
       newState = insertIntoSink(cloneState,x,minimax) 
       l.addChild(newState,l)

在我在做什么的情况下，必须有7个孩子的根节点，每个孩子应该有7个孩子的本身。每个孩子将在父节点中拥有初始矩阵的修改克隆。

发生错误是在添加子级（即第二级子级）后，不会将子级添加到子级列表中，而是会将它们添加到根节点中。

孩子的创造被称为如下。

def getBestMove(self): 
    move =0 
    maxVal = -1; 
    i=-1; 
    #evaluate all the 7 children 

    self.evaluateChildren(2) 

    self.evaluateSubChildren(1) 

    #more calculations go here

我第一次尝试调用相同evaluateChildren（）函数如下：

def getBestMove(self): 
    move =0 
    maxVal = -1; 
    i=-1; 
    #evaluate all the 7 children 

    self.evaluateChildren(2) 


    #evaluate second level children 
    for n in self.children: 
     print "evaluating SECOND LEVEL CHILDREN" 
     n.evaluateChildren()

如果我检查评估后的根节点的子节点的数量，应该是7，但是它保持加更多的2级的孩子，这是在无限循环中抛出我的程序。

请让我知道我要去哪里错了。请询问是否需要更多信息。

来源

2016-09-17 A. Wali Jr.

如何在Python中正确实现具有n分支因子的树？

回答

相关问题