monte-carlo-tree-search

问题 Trying to learn MCST using YouTube videos and papers like this one. http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf However I am not having much of a luck understanding the details beyond the high level theoretical explanations. Here are some quotes from the paper above and questions I have. Selection Phase: MCTS iteratively selects the highest scoring child node of the current state. If the current state is the root node, where did these children come from

问题 I can't figure out why I keep getting this error: if node not in self.children: return path ValueError: The truth value of an array with more than one element is ambiguous. Use a.any() or a.all() def _select(self, node): "Find an unexplored descendent of `node`" path = [] while True: path.append(node) breakpoint() if node not in self.children: return path if node.is_terminal(): return path self.children is a dict() of set() of Nodes. node is obviously a Node I get the same error in debugger