A recursive utility function to solve Knight Tour problem
static bool solveKTUtil ( int x , int y , int movei , int [ , ] sol , int [ ] xMove , int [ ] yMove ) { int k , next_x , next_y ; if ( movei == N * N ) return true ;