元胞自动机 ¶

from random import randint
def getBirth(N):
    f=-1 
    while f==-1: #避免产生1和0数目相同的初始状态
        s=''
        for i in range(N):
            s+=str(randint(0,1))
        if s.count('0')>s.count('1'):
            f=0
        elif s.count('0')==s.count('1'):
            f=-1
        else:
            f=1
    return s,f

def getNext(n,f):
    rule='0000010100000110000101011000\
011100000111000001000001010101\
010111011001000111011100000101\
0000000101111101111111111011011101111111'
    nextGeneration=''
    N=len(n)
    for i in range(N):
        #边缘单独考虑补全
        if i<3:
            s=str(f)*(3-i)+n[0:i]+n[i:i+4]
        elif i>N-4:
            s=n[i-3:i]+n[i:N]+str(f)*(3-(N-1-i))
        else:
            s=n[i-3:i]+n[i:i+4]
        s=int(s,2)
        nextGeneration+=rule[s]
    return nextGeneration

def main():
    num=0; #记录成功次数
    datas=200 #测试数据总数
    for i in range(datas):
        N=100 #序列长度
        t=0  #记录时间
        n,f=getBirth(N) #生成初始状态
        while t<300: #超过300次，默认判定无法成功
            n=getNext(n,f)
            t+=1
            if (f==0 and n.count('0')==N) or (f==1 and n.count('1')==N): #判断是否成功
                num+=1
                break
    # 输出结果
    print('datas sum:',datas)
    print(int(num/datas*100),'%')

if __name__=='__main__':
    main()
    input()