1
from itertools import permutations
import random
import pprint
import timeit
start_time = timeit.default_timer()
count = 0
def gird(board_size):
print ("\n".join('# ' * inrange + 'Q ' + '# ' * (8-inrange-1)\
for inrange in board_size) + "\n\n= = new board \n")
count+=1
coloms = range(8)
for board_size in permutations(coloms):
if 8 == len(set(board_size[inrange]+inrange for inrange in coloms)):
if 8 == len(set(board_size[inrange]-inrange for inrange in coloms)):
gird(board_size)
elapsed = timeit.default_timer() - start_time
print(elapsed)
print(count)
我想看看這段代碼運行多少次,我必須測量搜索成本(迭代次數,直到遇到最小值)和百分比解決了問題。這是一個8皇后問題。我怎麼能計算多少時間程序已經在python執行
[XY問題]的案例(http://meta.stackexchange.com/questions/66377/what-is-the-xy-problem)? –
@詹姆斯米爾斯這是一個8皇后問題,我只是想多少次它運行到停止 –
'計數= 0'和其他地方在你的代碼'計數+ = 1'? – IanAuld