47 lines
1.6 KiB
Python
47 lines
1.6 KiB
Python
from utilities import movement,check_moves
|
|
from DataModels.House import House
|
|
from DataModels.Container import Container
|
|
stack = []
|
|
def visit_cell(grid, available_movement, gc_moveset, depth=0):
|
|
global stack
|
|
possible_goals = []
|
|
a = gc_moveset[-1][0]
|
|
b = gc_moveset[-1][1]
|
|
possible_goals.append([a+1,b])
|
|
possible_goals.append([a-1,b])
|
|
possible_goals.append([a,b+1])
|
|
possible_goals.append([a,b-1])
|
|
house_in_area = False
|
|
for location in possible_goals:
|
|
try:
|
|
cell = grid[location[0]][location[1]]
|
|
if(type(cell) == House and cell.container.is_full and cell.unvisited):
|
|
cell.unvisited = False
|
|
house_in_area = True
|
|
break
|
|
except:
|
|
continue
|
|
if(house_in_area):
|
|
xy = gc_moveset[-1]
|
|
gc_moveset.append("pick_garbage")
|
|
return (xy, gc_moveset)
|
|
|
|
if len(available_movement) == 0 or depth>30:
|
|
return
|
|
x,y = gc_moveset[-1]
|
|
for direction in available_movement:
|
|
x_next, y_next = movement(grid,x,y)[0][direction]
|
|
available_movement_next = check_moves(grid, x_next,y_next,direction)
|
|
gc_moveset_next = gc_moveset.copy()
|
|
gc_moveset_next.append([x_next,y_next])
|
|
stack.append([grid, available_movement_next, gc_moveset_next, depth+1])
|
|
|
|
def DFS(grid, available_movement, gc_moveset, depth=0):
|
|
global stack
|
|
stack.append([grid, available_movement, gc_moveset, 0])
|
|
while not len(stack)==0:
|
|
state = stack.pop()
|
|
result = visit_cell(state[0], state[1], state[2],state[3])
|
|
if result!= None:
|
|
return result
|