Knight's Tour Option

  Place a Knight on a chess board at any location

  Move it randomly and keep track of total number of moves

  Knight must stay on board and cannot revisit a square that it has already visited (landed on)

  Determine the maximum number of moves possible and whether this can be duplicated for other starting

     points.

  Discuss whether it is better to populate the outer squares first or the inner squares first.

  Present graphical output.