Backtracking/Knight tour problem/c/knight_tour_problem.c
/* A utility function to check if i,j are valid indexes 
   for N*N chessboard */
A utility function to check if i,j are valid indexes
for N*N chessboard
A utility function to check if i j are valid indexes for N * N chessboard
bool isSafe(int x, int y, int sol[N][N]) 
{ 
    return ( x >= 0 && x < N && y >= 0 && 
             y < N && sol[x][y] == -1); 
}
bool isSafe ( int x , int y , int sol [ N ] [ N ] ) { return ( x >= 0 && x < N && y >= 0 && y < N && sol [ x ] [ y ] == -1 ) ; }
A utility function to check if i,j are valid indexes
for N*N chessboard
A utility function to check if i j are valid indexes for N * N chessboard