Choosing a Neighbor to Visit

/* Let <r,c> be coordinates of an unvisited "neighbor" of current <r,c>, or <UNDEFINED,UNDEFINED> if current square has no unvisited neighbors. */

int unvisitedR = UNDEFINED;

int unvisitedC = UNDEFINED;

for (int k = 0; k < 8; k++) {

int Nrow = _____________________________;

int Ncol = _____________________________;

if ( B[Nrow][Ncol] == Blank ){

unvisitedR = Nrow;

unvisitedC = Ncol;

}

}

r = unvisitedR;

c = unvisitedC;

Previous slide

Next slide

Back to first slide

View graphic version