-
Notifications
You must be signed in to change notification settings - Fork 38
/
botclean-partially-observable.py
108 lines (98 loc) · 3.93 KB
/
botclean-partially-observable.py
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
# The game Bot Clean took place in a fully observable environment,
# i.e., the state of every cell was visible to the bot at all times.
# Let us consider a variation of it where the environment is partially
# observable. The bot has the same actuators and sensors. But the
# sensors visibility is confined to its 8 adjacent cells.
# Link: https://www.hackerrank.com/challenges/botcleanv2
# Developer: Murillo Grubler
# import library
import os
import math
# Get board saved in memory
def get_info_file():
temp_memory_board = []
filename = "file-bot/board.txt"
if os.path.isfile(filename):
with open(filename, "r") as f:
memory_board = f.read().split('\n')
for i in range(len(memory_board)):
temp_row_memory = []
for j in range(len(memory_board[i])):
temp_row_memory.append(memory_board[i][j])
temp_memory_board.append(temp_row_memory)
return temp_memory_board
# Save the board in bot's memory
def save_info_file(board, filename):
os.makedirs(os.path.dirname(filename), exist_ok=True)
with open(filename, "w") as f:
for i in range(len(board)):
columns = "\n" if i > 0 else ""
for j in range(len(board[i])):
if board[i][j] == "b":
columns = columns + "-"
else:
columns = columns + board[i][j]
f.write(columns)
# Save and read the file that contains the bot's memory
def update_info_file(board):
filename = "file-bot/board.txt"
if os.path.isfile(filename):
with open(filename, "r") as f:
new_memory_board = []
memory_board = f.read().split('\n')
for i in range(len(memory_board)):
new_row_memory = []
for j in range(len(memory_board[i])):
if ((memory_board[i][j] == 'o' and board[i][j] == '-') or
(memory_board[i][j] == 'd' and board[i][j] == '-') or
(memory_board[i][j] == 'd' and board[i][j] == 'b')):
new_row_memory.append('-')
elif memory_board[i][j] == 'o' and board[i][j] == 'd':
new_row_memory.append('d')
else:
new_row_memory.append(memory_board[i][j])
new_memory_board.append(new_row_memory)
save_info_file(new_memory_board, filename)
else:
save_info_file(board, filename)
# Update cost that bot need to arrive the dirty
def update_position(posr, posc, dirties):
nearest_dirt = []
for i in range(len(dirties)):
# Euclidean distance
result = math.sqrt(((dirties[i][0] - posr) ** 2) + ((dirties[i][1] - posc) ** 2))
nearest_dirt.append(result)
return [x for (y,x) in sorted(zip(nearest_dirt,dirties))]
# Find certain elements on the board
def get_element_board(board, element):
dirties = []
for i in range(len(board)):
for j in range(len(board[i])):
if board[i][j] in element:
dirties.append([i, j])
return dirties
# Set next action the bot
def next_move(posx, posy, board):
# Save board in bot's memory
update_info_file(board)
elements = get_element_board(board, ['d'])
if len(elements) == 0:
elements = get_element_board(get_info_file(), ['o','d'])
next_dirt = update_position(posx, posy, elements)
if (len(next_dirt) > 0):
if next_dirt[0][1] > posy:
print('RIGHT')
elif next_dirt[0][1] < posy:
print('LEFT')
elif next_dirt[0][0] < posx:
print('UP')
elif next_dirt[0][0] > posx:
print('DOWN')
else:
print('CLEAN')
# Start application
if __name__ == "__main__":
# Set data
pos = [int(i) for i in input().strip().split()]
board = [[j for j in input().strip()] for i in range(5)]
next_move(pos[0], pos[1], board)