Write a program that solves the knight’s tour problem by using Warnsdorff’s heuristic. How large a board can the program handle? Write a program that implements the Select K of N with Duplicates and...

Write a program that solves the knight’s tour problem by using Warnsdorff’s heuristic. How large a board can the program handle?

Write a program that implements the Select K of N with Duplicates and Select K of N with out Duplicates algorithms.