我有一个类似俄罗斯方 block 的游戏,用户控制一个随机颜色的方 block ,然后将该方 block 放到底部,锁定到位,然后在屏幕顶部生成一个新方 block 。每当两个相同颜色的 block 彼此相邻放置时,我想“清除”,并且对于那些清除 block 上方的任何 block 都向下移动,就好像它们受到重力的影响一样。
我试过使用冲突列表无济于事。
请您参考如下方法:
您必须找到具有相同颜色的相邻 block 并将它们从copylist 中删除。每次当一个 block 到达底部时(例如在 chooseBlock) 中,都必须这样做。
找到相邻 block 的索引并将它们存储到 set() .请注意,在集合中,索引是唯一的:
例如:
adjoining = set()
for i in range(len(copylist)):
for j in range(len(copylist)):
if i == j or colorList[i] != colorList[j]:
continue
if (copylist[i][0] == copylist[j][0] and abs(copylist[i][1]-copylist[j][1]) == height) or \
(copylist[i][1] == copylist[j][1] and abs(copylist[i][0]-copylist[j][0]) == width):
adjoining.add(i)
adjoining.add(j)
创建一个新的copylist和colorList,只包含那些索引不包含在adjoining中的元素:
copylist = [copylist[i] for i in range(len(copylist)) if i not in adjoining]
colorList = [colorList[i] for i in range(len(colorList)) if i not in adjoining]
最后你必须找到所有必须掉到地上的方 block ,因为下面的方 block 已被删除。
在 not any() 中向下移动一个街区 block 如下:
例如
for i in range(len(copylist)):
if copylist[i][1] >= 390:
continue
if not any([copylist[j] for j in range(len(copylist)) \
if i != j and copylist[i][0] == copylist[j][0] and copylist[i][1] + height == copylist[j][1]]):
copylist[i][1] += height
执行 chooseBlock 中的算法并重复它直到找到相邻的 block :
def chooseBlock():
global player, copylist, colorList, colorChoice, blocksLeft
#running list of blocks and their positions once placed
copylist.append(player.copy())
#running list of those blocks' colors
colorList.append(colorChoice)
#resetting player position
player.y = 50
#choosing the color of the next block randomly from a list
colorChoice = random.choice(colors)
#subtracting 1 from the count of the blocks left to place after one is placed
blocksLeft = blocksLeft - 1
while True:
adjoining = set()
for i in range(len(copylist)):
for j in range(len(copylist)):
if i == j or colorList[i] != colorList[j]:
continue
if (copylist[i][0] == copylist[j][0] and abs(copylist[i][1]-copylist[j][1]) == height) or \
(copylist[i][1] == copylist[j][1] and abs(copylist[i][0]-copylist[j][0]) == width):
adjoining.add(i)
adjoining.add(j)
if not adjoining:
break
copylist = [copylist[i] for i in range(len(copylist)) if i not in adjoining]
colorList = [colorList[i] for i in range(len(colorList)) if i not in adjoining]
testmovedown = True
while testmovedown:
testmovedown = False
for i in range(len(copylist)):
if copylist[i][1] >= 390:
continue
if not any([copylist[j] for j in range(len(copylist)) \
if i != j and copylist[i][0] == copylist[j][0] and copylist[i][1] + height == copylist[j][1]]):
copylist[i][1] += height
testmovedown = True
