, count
. count
, , count = count + 1
, count
, .
( extend
92).
def can_be_extended_to_solution(perm):
i = len(perm) - 1
for j in range(i):
if i - j == abs(perm[i] - perm[j]):
return False
return True
def extend(perm, count, n):
if len(perm) == n:
count = count + 1
print("cycle counter= " + str(count))
print(perm)
for k in range(n):
if k not in perm:
perm.append(k)
if can_be_extended_to_solution(perm):
count = extend(perm, count, n)
perm.pop()
return count
print(extend(perm=[], count=0, n=8))