knight's tour heuristic

 I am working on the knight's tour problem out of the dietel and dietel text book on c++. In the third part of the  problem it wants me to implement a heuristic using the accessibility array.I was thinking about using the warnsdorff algorithm. I  have googled this problem to death but I am still unsure of  how to proceed further. here is my code so far.

#include<iostream>
#include<time.h>

using namespace std;

int board[8][8] = { 0 };
int num = 0;
int horizontal[8] = { 0 };
int vertical[8] = { 0 };
int currentRow = 0; // 0 to 7
int currentCol = 0; // 0 …