Write a Lisp program to solve the 8-queens problem. (This problem is to find a way to place eight queens on a chessboard so that no queen may capture any other through a single move, i.e., no two...

Write a Lisp program to solve the 8-queens problem. (This problem is to find a way to place eight queens on a chessboard so that no queen may capture any other through a single move, i.e., no two queens are on the same row, column, or diagonal.) Do depth-first, breadth-first, and best-first solutions to this problem. Write a Lisp program to solve the full 8 x 8 version of the Knight’s Tour problem. This problem asks you to find a path from any square to any other square on the chessboard, using only the knight. Do a depth-first, breadthfirst, and best-first solutions for this problem.