def selection(self):
		return max(self.children.iteritems(), key=lambda (a, n): n.toValue())
Select among subtree to get the position that gives maximum action value Q plus bonus u(P)
dataset/ETHPy150Open Rochester-NRT/RocAlphaGo/AlphaGo/mcts.py/TreeNode.selection