given a board of NxN, if it's possible for a chess knight starting at position [0,0] to reach all the squares once only, the function should return true , otherwise the function should return false
bool KnightTour(int n){
}// TODO: Replace examples and use TDD by writing your own tests
Describe(knight_tour)
{
It(Fixed_test)
{
Assert::That(KnightTour(1), Equals(true));
Assert::That(KnightTour(2), Equals(false));
Assert::That(KnightTour(8), Equals(true));
}
};