I'm having trouble figuring out why the 1s and 0s are where they are in this game tree for the game Nim:There is a statement in the book that explains the numbers but it's still not clear to me,In implementing minimax, we label each level in the search space according to whosemove it is at that point in the game, MIN or MAX. In the example, MIN isallowed to move first. Each leaf node is given a value of 1 or 0, depending on whether it isa  win  for  MAX  or  for  MIN.  Minimax  propagates  these  values  up  the  graph  throughsuccessive parent nodes according to the rule:If the parent state is a MAX node, give it the maximum value among its children.If the parent is a MIN node, give it the minimum value of its children. If I was to draw the tree by hand how would I know where to put the 1s and 0s? 
How are the 1s and 0s derived by the minimax algorithm for the game called nim?
artificial intelligence;heuristics;game theory
The graph contains all positions reachable from the initial position. The values are determined as follows:A leaf (a node with no children) is labeled 0 if it is MAX's turn to play, and 1 if it is MIN's turn to play.A non-leaf belonging to MAX gets the maximum of the labels of its children.A non-leaf belonging to MIN gets the minimum of the labels of its children.Hopefully you can now read the book and understand why we're doing the computation in this way.