The player who brings all the cars back to the hometown wins. Here we shall give a method for finding the Nim values for some of these towns. We will explain why this works when we cover the theory of general games. First we label the home town with 0. As before let m be the smallest non-negative integer which does not occur in this set .
Talk is nothing without some action.
Let us proceed to analyse our game of Nim City above. Hence, if B is to be labelled, the label must be 0. Hence, B should be labelled with 0 . It has a path to a town B, which we had just labelled with 0 two paragraphs ago. Let's see if we label the last two towns.