43 lines
1.2 KiB
Python
43 lines
1.2 KiB
Python
from params import GX, GY
|
|
|
|
|
|
def generate_map_1():
|
|
path = [
|
|
(25, int(GY - 25)),
|
|
(int(GX / 2), int(GY - 25)),
|
|
(int(GX / 2 + 75), int(GY - 150)),
|
|
(int(GX / 2 + 150), int(GY - 150)),
|
|
(int(GX - 75), int(GY / 2)),
|
|
(int(GX - 100), int(GY / 2 - 75)),
|
|
(int(GX - 100), int(GY / 2 - 150)),
|
|
(int(GX - 50), int(GY / 4)),
|
|
(int(3 * GX / 4 - 50), int(50)),
|
|
(int(50), int(50)),
|
|
(int(100), int(GY / 2)),
|
|
(25, int(GY - 25)),
|
|
]
|
|
|
|
path2 = [
|
|
(100, int(GY - 85)),
|
|
(int(GX / 2 - 50), int(GY - 85)),
|
|
(int(GX / 2 + 50), int(GY - 210)),
|
|
(int(GX / 2 + 110), int(GY - 210)),
|
|
(int(GX - 170), int(GY / 2 + 30)),
|
|
(int(GX - 200), int(GY / 2 - 20)),
|
|
(int(GX - 200), int(GY / 2 - 200)),
|
|
(int(GX - 170), int(GY / 4 - 20)),
|
|
(int(3 * GX / 4 - 100), int(120)),
|
|
(int(120), int(120)),
|
|
(int(175), int(GY / 2)),
|
|
(100, int(GY - 85)),
|
|
]
|
|
|
|
lines = [[path[i], path[i + 1]] for i in range(len(path) - 1)]
|
|
lines2 = [[path2[i], path2[i + 1]] for i in range(len(path2) - 1)]
|
|
|
|
lines = lines + lines2
|
|
return lines
|
|
|
|
|
|
map1 = generate_map_1()
|