Only need to complete steps 1-3. My code is correct and implements 1-2 already. I just need code for step 3 (calcAccess). Thank you!

main.cpp

knight.cpp

1. getNextlocation - fix infinite loop. If no squares available, set row and col to -1 2. testAll - run knights Tour many times, and report best result 3 calcAccess -implement. How many squares can the knight reach in 1 move? 4. knightsTourWarnsdorf- implement. Uses Warnsdorf's heuristic 5. knightsTourWarnsdorfRecalc -implement. Recalculate 'Access' after each move Submit your version of main.cpp and knight.cpp, extended to solve as many of the problems 1 thru 5 as you can manage. At minimum, attempt 1, 2 and 3. Submit printout from a run of testAll. #include using namespace std; // forward declarations int knightsTour (); // should try out kniqhtsTour multiple times and report best result void testAll() int best0; int i=0; while (i best) { best result ; cout #include using namespace std; const int BSIZE8; void printBoardLine() f for (int i = 0; 30) break; rm- rand () % 8; if (tries >30) rowcol-1; else f row row + vertical[ rm]; colcol horizontal[rm]; int knightsTour) { int board[ BSIZE] [BSIZE]; resetBoard (board); int row0; int col 0; int counter 0; while (row !- -1&&col !- -1) ++counter; board[row] [colcounter getNextLocation (board, row, col) printBoard (board); return counter