Construct a Turing Machine that solves the n-queen problem. The problem is stated as follows:
Given a n x n chessboard, how can n queens be placed on the chessboard so that all the queens are unable to attack each other?
possible initial conditions
If there is no possible placing of the n queens the Turing Machine stops on an empty chessboard.