algorithms/mcts_basic.py
def _expand(self, node):
        "Update the `children` dict with the children of `node`"
        if node in self.children:
            return  # already expanded
        if node.is_terminal():
            self.children[node] = []
        else:
            self.children[node] = node.find_children()
Update the `children` dict with the children of `node`
Update the `children` dict with the children of `node`
Update the ` children ` dict with the children of ` node `
def _expand(self, node):
        if node in self.children:
            return  
        if node.is_terminal():
            self.children[node] = []
        else:
            self.children[node] = node.find_children()
def _expand ( self , node ) : if node in self . children : return if node . is_terminal ( ) : self . children [ node ] = [ ] else : self . children [ node ] = node . find_children ( )
Update the `children` dict with the children of `node`
Update the ` children ` dict with the children of ` node `
"Update the `children` dict with the children of `node`" # already expanded
self
node