def get_move(self, state):
		action_probs = self._policy(state)
		self.root.expansion(action_probs)

		for n in xrange(0, self._n_search):
			state_copy = state.copy()
			self._DFS(self._L, self.root, state_copy)

		# chosen action is the *most visited child*, not the highest-value
		# (note that they are the same as self._n_search gets large)
		return max(self.root.children.iteritems(), key=lambda (a, n): n.nVisits)[0]
Return a dict with key being minion and value
dataset/ETHPy150Open Rochester-NRT/RocAlphaGo/AlphaGo/mcts.py/MCTS.get_move--crossover with--dataset/ETHPy150Open saltstack/salt/salt/returners/couchdb_return.py/get_fun