Better Solve

{

/* Initial configuration. */

int move = 0; // moves so far.

int r = lo; // current row of Kn.

int c = lo; // current column of Kn.

while (r != UNDEFINED) {

move++;

B[r][c] = move;

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

. . .

}

}

Previous slide

Next slide

Back to first slide

View graphic version