20161101 Python 读书笔记之八皇后问题

生成器

#ecoding=utf-8
#生成器
nested = [[1,2],[3,4],[5]]
def flatten(nested):
    for sublist in nested:
        for element in sublist:
            yield element
for num in flatten(nested):
    print num
#递归生成器
def flatten(nested):
    try:
        for sublist in nested:
            for element in flatten(sublist):
                yield element
    except TypeError:
        yield nested
def repeater(value):
    while True:
        new = (yield value)
        if new is not None: value = new
r = repeater(42)
print r.next()
print r.send("Hello,World!")


八皇后问题

#八皇后问题
#寻找冲突
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 queens(num=8,state=()):
    for pos in range(num):
        if not conflict(state,pos):
            if len(state) == num-1:
                yield (pos,)
            else:
                for result in queens(num,state+(pos,)):
                    yield (pos,) + result
print list(queens(3))
print list(queens(4))
print list(queens(8))
#打包
def prettyprint(solution):
    def line(pos,length=len(solution)):
        return '. '*(pos) + 'X '+'. '*(length-pos-1)
    for pos in solution:
        print line(pos)
import random
prettyprint(random.choice(list(queens(8))))


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值