“八皇后问题”的 Python 语言解法

最新推荐文章于 2022-11-10 21:58:08 发布

diradical

最新推荐文章于 2022-11-10 21:58:08 发布

阅读量1.5k

点赞数 2

分类专栏： Python 文章标签： python 算法

本文链接：https://blog.csdn.net/luozhen07/article/details/50532745

版权

Python 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

本文介绍了使用 Python 编程解决经典八皇后问题的过程，探讨了如何在棋盘上放置八个皇后，使得任意两个皇后都无法在同一行、同一列或同一斜线上。

摘要由CSDN通过智能技术生成

学习 Python 的过程中的一次编码练习。

#! /usr/bin/env python

__metaclass__ = type

class Chessboard:
    board = []
    def __init__(self, queens):
        """the constructor function of Chessboard class"""
        for site in range(queens):
            self.board.append(-1)
        self.arrangements = 0
    def __getitem__(self, index):
        """overloaded const int& operator[] const"""
        return self.board[index]
    def __setitem__(self, index, value):
        """overloaded non-const int& operator[]"""
        self.board[index] = value
    def addCount(self):
        """++arrangements"""
        self.arrangements += 1
    def getCount(self):
        """return arrangements"""
        return self.arrangements

def show(board, queens):
    """show the result"""
    board.addCount()
    print '-------------------------------------'
    print '--> Arrangement index', board.getCount()
    for ix in range(queens):
        print '(%d, %d)' % (ix, board[ix]),
        if ix == queens - 1:
            print

def conflict(board, site):
    """check whether the site can be placed on the board"""
    for ix in range(site):
        if board[ix] == board[site]:
            return True
        if abs(board[ix] - board[site]) == site - ix:
            return True
    return False
    
def put(board, site, queens):
    """depth first algorithm"""
    for ix in range(queens):
        board[site] = ix
        if not conflict(board, site):
            if site == queens - 1:
                show(board, queens)
            else:
                put(board, site + 1, queens)

def Queens():
    """N-Queens Problem Solver"""
    queens = input('Queens: ')
    checkerboard = Chessboard(queens)
    put(checkerboard, 0, queens)
    print '-------------------------------------'
    print '--> total arrangements:', checkerboard.getCount()

Queens()