0

我正在尝试编写单词搜索/查找单词生成器,但我遇到了一些问题。此代码的目的是从用户输入中获取维度和单词,并生成随机单词搜索/查找单词。

问题是这些字母偶尔会相互覆盖。为了尝试阻止这种情况,我的函数中有这行代码:

lines[0][randCoO[0] - (i)][randCoO[1]] == '-':

该行属于函数 U

它旨在测试空间是否为空(由 ' - ' 填充)

我知道我应该尽量避免将我的整个代码放入其中,因为它可能很长而且读起来很烦人,但是请尝试帮助我

这是我的代码:

    try:
    dim=int(raw_input('How many letters high and long do you want your find-a-word? (It has to be <= 79) '))
except ValueError:
        raise SystemExit, 'Dude, thats not a number!'

if dim > 79:
    raise SystemExit, "\n That number is bigger than 79. It won't print to well. \n"


count=0

allwords = raw_input('What words do you want in your find-a-word?\n(Enter them all together seperated by a comma)')

allwords = allwords.upper()
allwords = allwords.split(', ')
nowords = len(allwords)

while count < nowords:
    if len(allwords[count])>dim:
        raise SystemExit, "\nYour find-a-word is not big enough for one or more of your words.\nIt is doomed to fail! "
    count = count + 1

    randletter = []
    import random
    randrange = random.randrange
    alphabet = ['A', 'B', 'C', 'D', 'E', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']

    all_words = ' '.join(allwords)

    print '\n\nTry to find these words in the word find-a-word\n\n'
    count = 0
    while count < nowords:
        print allwords[count],'\n'
        count=count+1

        drctn = ['U','D','L','R','UL','UR','DL','DR']

        randdrctnlist = []

for i in range(nowords):
    randdrctn = drctn[randrange(0,4)]
    randdrctnlist.append(randdrctn)

    d = {}

for i in range(dim):
    d['line' + str(i + 1)] = ['-']*dim

    lines = []
    lines.append(d.values())
    lines.sort()

    CoO1 = []
    CoO2 = []
    CoO = []

for i in range(dim):
    CoO1.append(i)
    CoO2.append(i)    

    CoO.append(CoO1)
    CoO.append(CoO2)

    count = 0

def U(word, wordno, count, dim, lines):
    stop = 0
    randCoO = []
    while count == 0:
        rand = CoO[0][randrange(0,dim)]
        randCoO.append(rand)
        rand = CoO[1][randrange(0,dim)]
        randCoO.append(rand)
        for i in range(len(word[wordno])):
            if randCoO[0] >= (len(word[wordno]) - 1) and lines[0][randCoO[0] - (i)][randCoO[1]] == '-':
                count = 1               
                lines[0][randCoO[0]][randCoO[1]] = word[wordno][0]
                while count < len(allwords[wordno]):
                    lines[0][randCoO[0] - (count)][randCoO[1]] = word[wordno][count]
                    count = count + 1                
            else:
                print randCoO
                randCoO = []
                stop = stop + 1
                print stop
                if stop > dim*dim:
                    raise SystemExit, "\nThe find-a-word is probably impossible to make\nwithout overwriting already placed letters.\nPlease try it again. If this has show up many times in a row try making the dimensions of you find-a-word bigger\n(Or you're just unlucky!)\n"
                break

def D(word, wordno, count, dim, lines):
    stop = 0
    randCoO = []
    while count == 0:
        rand = CoO[0][randrange(0,dim)]
        randCoO.append(rand)
        rand = CoO[1][randrange(0,dim)]
        randCoO.append(rand)
        for i in range(len(word[wordno])):
            if dim - randCoO[0] > len(word[wordno]) - 1 and lines[0][randCoO[0] + (i)][randCoO[1]] == '-':
                count = 1
                lines[0][randCoO[0]][randCoO[1]] = word[wordno][0]
                while count < len(allwords[wordno]):
                    lines[0][randCoO[0] + (count)][randCoO[1]] = word[wordno][count]
                    count = count + 1
            else:
                print randCoO
                randCoO = []
                stop = stop + 1
                print stop
                if stop > dim*dim:
                    raise SystemExit, "\nThe find-a-word is probably impossible to make\nwithout overwriting already placed letters.\nPlease try it again. If this has show up many times in a row try making the dimensions of you find-a-word bigger\n(Or you're just unlucky!)\n"
                break   

def L(word, wordno, count, dim, lines):
    stop = 0
    randCoO = []
    while count == 0:
        rand = CoO[0][randrange(0,dim)]                            
        randCoO.append(rand)
        rand = CoO[1][randrange(0,dim)]
        randCoO.append(rand)
        for i in range(len(word[wordno])):
            if dim - randCoO[1] > (len(word[wordno]) - 1) and lines[0][randCoO[0]][randCoO[1] + (i)] == '-':
                count = 1  
                lines[0][randCoO[0]][randCoO[1]] = word[wordno][0]
                while count < len(allwords[wordno]):
                    lines[0][randCoO[0]][randCoO[1] + (count)] = word[wordno][count]
                    count = count + 1
            else:
                print randCoO
                randCoO = []
                stop = stop + 1
                print stop
                if stop > dim*dim:
                    raise SystemExit, "\nThe find-a-word is probably impossible to make\nwithout overwriting already placed letters.\nPlease try it again. If this has show up many times in a row try making the dimensions of you find-a-word bigger\n(Or you're just unlucky!)\n"
                break

def R(word, wordno, count, dim, lines):
    stop = 0 
    randCoO = []
    while count == 0:
        rand = CoO[0][randrange(0,dim)]                            
        randCoO.append(rand)
        rand = CoO[1][randrange(0,dim)]
        randCoO.append(rand)
        for i in range(len(word[wordno])):
            if randCoO[1] >= (len(word[wordno]) - 1) and lines[0][randCoO[0]][randCoO[1] + (i)] == '-':
                count = 1  
                lines[0][randCoO[0]][randCoO[1]] = word[wordno][0]
                while count < len(allwords[wordno]):
                    lines[0][randCoO[0]][randCoO[1] - (count)] = word[wordno][count]
                    count = count + 1
            else:
                print randCoO
                randCoO = []
                print stop
                stop = stop + 1
                if stop > dim*dim:
                    raise SystemExit, "\nThe find-a-word is probably impossible to make\nwithout overwriting already placed letters.\nPlease try it again. If this has show up many times in a row try making the dimensions of you find-a-word bigger\n(Or you're just unlucky!)\n"
                break

for i in range(nowords):
    count = 0
    print randdrctnlist
    if randdrctnlist[i] == 'U':
        U(allwords, i, count, dim, lines)
    if randdrctnlist[i] == 'D':
        D(allwords, i, count, dim, lines)
    if randdrctnlist[i] == 'L':
        L(allwords, i, count, dim, lines)
    if randdrctnlist[i] == 'R':
        R(allwords, i, count, dim, lines)

for i in range(dim):
    print ' '.join(lines[0][i])
4

1 回答 1

1

我认为您需要重新考虑基本算法。您的代码试图在随机方向上创建单词,然后管理冲突。相反,您可以考虑所有单词之间的所有交点,然后构建所有可能的重叠,并从结果中随机选择。

例如:“FROG”以两个字母与“DOG”相交,因此它们可以从“G”上的 7 个方向和“O”上的 6 个方向相交。'CAT' 和 ('DOG' or 'FROG') 没有共同的字母,因此它们根本无法相交。如果您尝试“迄今为止的现有解决方案”的每种组合,然后递归调用您的解决方案并在适合拼图尺寸的所有其他可能组合中添加一个新单词,您将拥有所有可能的 find-a-words给定的单词。

为了降低这个的维度,我认为你应该首先放置不相交的单词。如果它们不完全适合,您可以退出并出现错误。然后按大小递减的顺序处理单词。

然后,您可以随机选择,也可以在找到解决方案后立即退出。如果您希望您的答案具有不同的特征(例如更加分散以使用整个给定尺寸),我认为您可以重新排列尝试组合的方式,并选择给定的第一个解决方案。

于 2012-12-27T01:16:53.943 回答