My assignment is to implement Uniform Cost Search on 8 Queen Problem.

8 Queen Problem: The queens have to be placed on a 8x8 chess board such that all the queens are at non-attacking positions.

I want you to

1. Design the State Space

2. State the transition Operators

3. State the Initial State as per the definition of state space

4. State the goal state such that all queens are at non-attacking positions

I want the implementation to be done in C/C++, Java or Python using Uniform Cost Search Algorithm.