Every node in layer i of G∗ corresponds to a state specifying which city is in position i, and which cities are visited in positions 1 through i−1. What makes G∗ an efficient tool is that the state corresponding to any node can be expressed economically by the following four entities: i (the position in the tour), j (the city assigned to position i, i.e. having