How are the 1s and 0s derived by the minimax algorithm for the game called "nim"?
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.