assume in a tabu search algorithm the state space consists of all n-dimensional binary vectors, for a fixed n>2. let us define the neighbor relation in this space as follows: the neighbors of any vector x are those vectors y, which satisfy that the number of 1-bits in x is the same as the number of 0-bits in y. (only the number of 1 and 0 bits matter, their positions do not.) is this state space connected, that is, can we reach any vector from any other one via neighbor-to-neighbor moves?