1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
|
# Constants
MAPWIDTH = 4
MAPHEIGHT = 5
STARTPOINT = [0, 2]
ENDPOINT = [1, 4]
checkpointList = [
STARTPOINT,
[0, 0],
[1, 4],
[3, 2],
[3, 4],
ENDPOINT
]
wallList = [ # Each of these walls' locations are based on their neighboring squares (Ex. wall #1 is between (2, 0) and (3, 0)
[[2, 0], [3, 0]],
[[1, 0], [1, 1]],
[[3, 0], [3, 1]],
[[0, 1], [0, 2]],
[[0, 2], [1, 2]],
[[2, 2], [3, 2]],
[[1, 3], [1, 4]],
[[3, 3], [3, 4]],
[[1, 4], [2, 4]]
]
courseMap = []
def populateCourse(course, width, height):
for x in range(width):
for y in range(height):
course.append([x, y])
def queryNeighbors(node):
# Right Down Left Up
directions = [[1, 0], [0, 1], [-1, 0], [0, -1]]
result = []
for dir in directions: # for x in range(4)
neighbor = [node[0] + dir[0], node[1] + dir[1]] # [nodeX + DirectionModifierX, nodeY + DirectionModifierY]
if neighbor in courseMap: # Makes sure the neighbor is within bounds
result.append(neighbor)
for x in range(len(wallList)):
if node in wallList[x] and neighbor in wallList[x]: # TBD: Optimize determining if wall is present
result.remove(neighbor)
return result
def getShortestPath(courseMap, startPos, endPos):
searchPaths = [[startPos]]
visitedCoordinates = [startPos]
while searchPaths != []:
currentPath = searchPaths.pop(0)
currentPos = currentPath[-1]
if currentPos == endPos:
return currentPath
for nextPos in queryNeighbors(currentPos):
if nextPos in visitedCoordinates:
continue
searchPaths.append(currentPath + [nextPos])
visitedCoordinates += nextPos
def solveCourse(course, obstacles, checkpoints):
for x in range(len(checkpoints) - 1):
shortestPath = getShortestPath(course, checkpoints[x], checkpoints[x + 1])
print(shortestPath)
populateCourse(courseMap, MAPWIDTH, MAPHEIGHT)
solveCourse(courseMap, wallList, checkpointList)
|
