八皇后的問題解析請見：

這裡給出Python的解法，相對於C語言，Python比較簡單，程式碼量較小，但是效率也只能呵呵了，貌似很難兩全啊。

首先定義衝突函式：

def conflict(state,nextX):
    nextY = len(state)
    for i in range(nextY):
        if abs(state[i] - nextX) in (0,nextY - i):
            return True
    return False

def queen(num = 8,state = ()):
    if len(state) == num-1:
        for pos in range(num):
            if not conflict(state,pos):
                yield (pos,)
    else:
        for pos in range(num):
            if not conflict(state,pos):
                for result in queen(num,state+(pos,)):
                    yield (pos,)+result
 

def prettyprint(solution):
    def line(pos,length = len(solution)):
        return '. '*pos + '* ' + '. '*(length - pos - 1)
    for pos in solution:
        print(line(pos))