Question

我对编程还是很陌生，目前正在尝试根据用户输入生成一个幻方。我设法创建了一种可憎的3x3正方形的作品。我遇到的问题是，因为我随机生成一个正方形而不检查该组合是否曾经使用过，所以大于3x3的任何东西都需要大量时间来计算。我可以做些修改以加快流程吗？抱歉，如果我没有正确格式化。

谢谢！

import random
import math

'''Checks if the diagonals add up to the magic sum (calculated below).'''
def diagonal_check(bList, point):
    reversedDiagonalCount = 0
    diagonalCount = 0
    if point == 0:
        for diagonal in range(magicSquareSize):
            diagonalCount += bList[diagonal][diagonal]
    else:
        for reversedDiagonal in range(magicSquareSize):
            reversedDiagonalCount += bList[-(reversedDiagonal+1)] 
   [reversedDiagonal]

    if diagonalCount == magicNumber or reversedDiagonalCount == magicNumber:
        return True
    else:
        return False


'''Iterates through column and row number "x" to see if both add up to the 
magic sum.'''
def check_magic_sum(aList, x):
    columnCount = 0
    rowCount = 0
    for columnNumber in range(magicSquareSize):
        columnCount += aList[columnNumber][x]
        if columnCount == magicNumber:
            for rowNumber in range(magicSquareSize):
                rowCount += aList[x][rowNumber]
    print(columnCount, rowCount)
    if columnCount == magicNumber and rowCount == magicNumber:
        return True
    else:
        return False


'''Once initiated, created a randomly generated n x n matrix of numbers.'''
def create_square():
    for number in range(1, magicSquareSize**2 + 1):
        numberList.append(number)
    for row in range(magicSquareSize):
        currentList = []
        magicNumberCount = magicNumber
        magicSquareSizeCount = magicSquareSize
        while len(currentList) < magicSquareSizeCount:
            rowEntry = random.choice(numberList)
            numberList.remove(rowEntry)
            currentList.append(rowEntry)
            magicNumberCount -= rowEntry
        magicSquare.append(currentList)


'''User inputs the grid size they would like, a magic number is then 
calculated for this value.'''
magicSquareSize = int(input('Please enter a number, "n" to generate an "n x 
n" magic square: '))
magicNumber = int((magicSquareSize/2) * (2+(magicSquareSize**2 - 1)))

'''Initiates an empty list to hold the magic square and the numbers used in 
it.'''
numberList = []
magicSquare = []
create_square()

'''Checks magic square to see if it is valid, if not, creates another 
randomly generated square and checks again.'''
while True:
    validSquare = 0
    for checkNumber in range(magicSquareSize):
        numberCheck = check_magic_sum(magicSquare, checkNumber)
        if numberCheck == True:
            validSquare += 1
        if checkNumber == 0 or checkNumber == magicSquareSize-1:
            isDiagonalGood = diagonal_check(magicSquare, checkNumber)
            if isDiagonalGood == True:
                validSquare += 1
    if validSquare == magicSquareSize + 2:
        break
    else:
        magicSquare = []
        create_square()

'''Prints each element in the magicSquare list one by one to display a 
roughly square shape.'''
for line in range(magicSquareSize):
    print(magicSquare[line])

Answer 1

魔方问题是NP难题，因此找到N> = 4的解决方案将很耗时。可以将问题表示为CSP（约束满意度问题），并且可以使用constraint包尝试像下面这样针对一般的N解决问题，您可以尝试看看这种方法是否更快：

N = 4 #5 # number of rows / columns
n = N**2 # number of cells
s = n*(n+1)//6 # sum of each row
from constraint import *
p = Problem()
p.addVariables(range(n), range(1, n+1))
p.addConstraint(AllDifferentConstraint(), range(n))
p.addConstraint(ExactSumConstraint(s), [k*(N+1) for k in range(N)])
p.addConstraint(ExactSumConstraint(s), [(k+1)*(N-1) for k in range(N)])
for row in range(N):
 p.addConstraint(ExactSumConstraint(s),
 [row*N+i for i in range(N)])
for col in range(N):
 p.addConstraint(ExactSumConstraint(s),
 [col+N*i for i in range(N)]) 

sols = p.getSolutions()
for s in sols:
  for row in range(N):
    for col in range(N):
        print s[row*N+col],
    print
  print

对于N=3，它非常快，并且可以立即打印所有可能的解决方案：

优化魔术方块生成时遇到问题

1 个答案: