Take screenshots of functions running in cLISP. Provide a description for each screenshot.

8 Queens problem

The local condition is:

- no two queens attack each other

-no two queens are on the same row,

- no two queens are on the same column,

- no two queens are on the same diagonal line.

Problem: place 8 queens on a standard 8x8 chessboard so that no queen is attacking another queen.

For this CSP problem, you are to implement a backtrack depth-first search in cLISP, that takes as input an integer and solves the corresponding 8-queens problem.