python - Tron 游戏碰撞 - turtle python

Question

我正在尝试制作一款本地 2 人玩家的 tron 游戏。我的代码如下，但它是一个未完成的产品。我想知道如何做到这一点，以便如果形状敌人和形状玩家相互接触或接触他们创建的线，就会产生结果。就像打印游戏结束和更改背景一样。我不断收到下面评论中写的错误。

def up():
    player.fd(15)
def right():
    player.fd(15)
def left():
    player.fd(15)
def down():
    player.fd(15)

playerPath = [[[100],[100]]]
enemyPath = [[[600],[600]]]
previousMove = "na"

#I keep getting this error: TclError: bad event type or keysym "up"

if previousMove != "up":
        #Check for other methods
    if previousMove == right():
        playerPath.append((playerPath[0][0][0] + 90, playerPath[0][0][1]))
    if previousMove == left():
        playerPath.append((playerPath[0][0][0] - 90, playerPath[0][0][1]))
    if previousMove == down():
        playerPath.append((playerPath[0][0][0] + 180, playerPath[0][0][1]))
        #repeat for other directions
if previousMove == "up":
    playerPath[0][0].append(playerPath[0][0][0] + 30)
    playerPath[0][1].append(playerPath[0][1][0] + 30)
previousMove = "up"


if previousMove != "right":
        #Check for other methods
    if previousMove == up():
        playerPath.append((playerPath[0][0][0] - 90, playerPath[0][0][1]))
    if previousMove == left():
        playerPath.append((playerPath[0][0][0] + 180, playerPath[0][0][1]))
    if  previousMove ==down():
        playerPath.append((playerPath[0][0][0] + 90, playerPath[0][0][1]))
       #repeat for other directions
if previousMove == "right":
    playerPath[0][0].append(playerPath[0][0][0] + 30)
    playerPath[0][1].append(playerPath[0][1][0] + 30)
previousMove = "right"


if previousMove != "left":
    #Check for other methods
    if previousMove == up():
        playerPath.append((playerPath[0][0][0] + 90, playerPath[0][0][1]))
    if previousMove == right():
        playerPath.append((playerPath[0][0][0] + 180, playerPath[0][0][1]))
    if previousMove == down():
        playerPath.append((playerPath[0][0][0] - 90, playerPath[0][0][1]))
        #repeat for other directions
if previousMove == "left":
    playerPath[0][0].append(playerPath[0][0][0] + 30)
    playerPath[0][1].append(playerPath[0][1][0] + 30)
previousMove = "left"


if previousMove != "down":
        #Check for other methods
    if previousMove == up():
        playerPath.append((playerPath[0][0][0] + 180, playerPath[0][0][1]))
    if previousMove == left():
        playerPath.append((playerPath[0][0][0] + 90, playerPath[0][0][1]))
    if previousMove == right():
        playerPath.append((playerPath[0][0][0] - 90, playerPath[0][0][1]))
        #repeat for other directions
if previousMove == "down":
    playerPath[0][0].append(playerPath[0][0][0] + 30)
    playerPath[0][1].append(playerPath[0][1][0] + 30)
previousMove = "down"

#This code gives me this error: IndexError: list index out of range    
#for subPath in enemyPath:
#    if player.position()[0] in range(subPath[0][0], subPath[0][1]) and player.position()[1] in range(subPath[1][0], subPath[1][1]):
#        print("Collision")


onkey(up, "up")
onkey(left, "left")
onkey(right, "right")
onkey(down, "down")

onkey(up1, "w")
onkey(left1, "a")
onkey(right1, "d")

listen()
mainloop()  

Answer 1

你的代码不可能按照给定的方式工作——例如每个击键代码的巨大块位于顶层，它只会运行一次。下面是对您的代码的完整修改。

你需要测试你是否跨越了敌人或你自己划定的任何界限。此代码会跟踪这些段并在每次移动时对其进行测试，从而完全消除意外踩到线上的失败者:

from turtle import Turtle, Screen

screen = Screen()
screen.bgcolor('black')

def up(who):
    global previousMove

    turtle, path = players[who]
    turtle.setheading(90)

    if previousMove != 'up':
        path.append(turtle.position())
    previousMove = 'up'

    turtle.fd(15)

    if checkCollision(turtle.position(), path, players[1 - who][PATH]):
        collision(turtle)

def right(who):
    global previousMove

    turtle, path = players[who]
    turtle.setheading(0)

    if previousMove != 'right':
        path.append(turtle.position())
    previousMove = 'right'

    turtle.fd(15)

    if checkCollision(turtle.position(), path, players[1 - who][PATH]):
        collision(turtle)

def left(who):
    global previousMove

    turtle, path = players[who]
    turtle.setheading(180)

    if previousMove != 'left':
        path.append(turtle.position())
    previousMove = 'left'

    turtle.fd(15)

    if checkCollision(turtle.position(), path, players[1 - who][PATH]):
        collision(turtle)

def down(who):
    global previousMove

    turtle, path = players[who]
    turtle.setheading(270)

    if previousMove != 'down':
        path.append(turtle.position())
    previousMove = 'down'

    turtle.fd(15)

    if checkCollision(turtle.position(), path, players[1 - who][PATH]):
        collision(turtle)

def collision(turtle):
    for key in ('Up', 'Left', 'Right', 'Down', 'w', 'a', 'd', 'x'):
        screen.onkey(None, key)  # disable game
    turtle.clear()  # remove the loser from the board!

def checkCollision(position, path1, path2):
    if len(path1) > 1:

        A, B = position, path1[-1]  # only check most recent line segment

        if len(path1) > 3:  # check for self intersection
            for i in range(len(path1) - 3):
                C, D = path1[i:i + 2]

                if intersect(A, B, C, D):
                    return True

        if len(path2) > 1:  # check for intersection with other turtle's path
            for i in range(len(path2) - 1):
                C, D = path2[i:i + 2]

                if intersect(A, B, C, D):
                    return True
    return False

X, Y = 0, 1

def ccw(A, B, C):
    """ https://stackoverflow.com/a/9997374/5771269 """
    return (C[Y] - A[Y]) * (B[X] - A[X]) > (B[Y] - A[Y]) * (C[X] - A[X])

def intersect(A, B, C, D):
    """ Return true if line segments AB and CD intersect """
    return ccw(A, C, D) != ccw(B, C, D) and ccw(A, B, C) != ccw(A, B, D)

player = Turtle('circle')
player.shapesize(6 / 20)
player.color('red')
player.pensize(6)
player.speed('fastest')
player.penup()
player.setposition(100, 100)
player.pendown()

enemy = Turtle('circle')
enemy.shapesize(6 / 20)
enemy.color('blue')
enemy.pensize(6)
enemy.speed('fastest')
enemy.penup()
enemy.setposition(-300, -300)
enemy.pendown()

players = [[player, [player.position()]], [enemy, [enemy.position()]]]
PLAYER, ENEMY = 0, 1
TURTLE, PATH = 0, 1

previousMove = None  # consolidate moves in same direction into single line segment

screen.onkey(lambda: up(PLAYER), 'Up')
screen.onkey(lambda: left(PLAYER), 'Left')
screen.onkey(lambda: right(PLAYER), 'Right')
screen.onkey(lambda: down(PLAYER), 'Down')

screen.onkey(lambda: up(ENEMY), 'w')
screen.onkey(lambda: left(ENEMY), 'a')
screen.onkey(lambda: right(ENEMY), 'd')
screen.onkey(lambda: down(ENEMY), 'x')

screen.listen()

screen.mainloop()

线段交叉代码取自How can I check if two segments intersect?

上面的代码不完整并且有错误——它需要额外的工作才能成为一个完成的游戏。但它基本上可以让你尝试想法: