Question

This is an Artificial Intelligence assignment.

Implement 8 Queen Problem in C/C++ using Breadth First Search. The number of steps should be minumum to find the position on the 8x8 board where all queens are at non attacking positions.  

Also mention the State space,transition operators and the initial state as per the definiton of state space with the code.

Answer 1

if n == 0:
    return [[]]
else:
    return add_queen(n-1, width, n_queens(n-1, width))


def add_queen(new_row, width, previous_solutions):
solutions = []
for sol in previous_solutions:
    for new_col in range(width):
        if safe_queen(new_row, new_col, sol):
            solutions.append(sol + [new_col])
return solutions


def safe_queen(new_row, new_col, sol):
for row in range(new_row):
    if (sol[row] == new_col or                  
        sol[row] + row == new_col + new_row or
        sol[row] - row == new_col - new_row):
            return 0
return 1