Scientific Computing Reference M

The code outline below may or may not help you in working in the access heuristic for this exercise.

// The book suggests using two separate arrays for horizontal and vertical, // but you could combine them as a single 2dimensional array like so: // This is defined globally here so that it is available in functions... int move[8][2] = {{2,-1},{1,-2},{-1,-2},{-2,-1},{-2,1},{-1,2},{1,2},{2,1}};

int main()
{
  // Each number represents how many squares the square is accessible from, originally
  // This matrix needs to be updated each time you move and is used to help strategize
  // about how to visit all the squares on a knight's tour.
  int access[8][8] = {{2,3,4,4,4,4,3,2},
                      {3,4,6,6,6,6,4,3},
                      {4,6,8,8,8,8,6,4},
                      {4,6,8,8,8,8,6,4},
                      {4,6,8,8,8,8,6,4},
                      {4,6,8,8,8,8,6,4},
                      {3,4,6,6,6,6,4,3},
                      {2,3,4,4,4,4,3,2}};

  int board[8][8] = {{0,0,0,0,0,0,0,0},
                     {0,0,0,0,0,0,0,0},
                     {0,0,0,0,0,0,0,0},
                     {0,0,0,0,0,0,0,0},
                     {0,0,0,0,0,0,0,0},
                     {0,0,0,0,0,0,0,0},
                     {0,0,0,0,0,0,0,0},
                     {0,0,0,0,0,0,0,0}};
  
  int currentRow, currentColumn;
  // define other variables here, as needed
  
  // To get started, prompt the user for an 
  // initial position on the board and mark it with a "1"
  cout << "What row and column would you like to start at? ";
  cin >> currentRow >> currentColumn;
  board[currentRow][currentColumn] = 1;
  
  // You'll need a way of keeping track of your progress on the hunt
  // Introduce variables to keep track of how many squares have been visited
  // and whether or not your knight is stuck.
  int squareCounter = 1;
  bool stuck = false;
  while (!stuck && squareCounter < 64) {
    // Initialize variables here, as needed, before reentering the for loop.
    // The for loop should check each of the 8 (theoretically) possible moves
    // to see if it's on the board and never before been visited.
    // Later, improve the code to use the information about accessibility.
    for(int i = 0; i < 8; i++) {
      //check if the move is on the board and the square is available
          // if it's a legal move
          // check the accessibility of the square
          // and choose the square with strategic accessibility
    // As a final touch (part d),
    // If there are two (or more) 
    // different squares with the same 
    // optimal accessibility, 
    // find a way to check ahead
    // one move to see which of those
    // choices leads to more choices.
    // Remember, if your knight is stuck, the tour is over. 
    
    // Update all parameters.
    // Update the board
    // Update the access table
    // Show the board
    // system("PAUSE");    
  }
  return 0;
}

void showBoard(// specify input) {
  // Write code to show the board
}
    
void updateAccess(// specify input) { 
  //  Write code to update the access table
}

Knight's Tour Problem