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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
#!/usr/bin/env python
"""New and improved bot, OPTIMISED!!"""
import random
import sys
DEBUG = False
# Show tracebacks, then pause for debugging.
if DEBUG:
sys_excepthook = sys.excepthook
def excepthook(*args, **kwargs):
sys_excepthook(*args, **kwargs)
import time
time.sleep(10)
sys.excepthook = excepthook
EMPTY_TILE = '.'
APPLE_TILE = '*'
WIDTH, HEIGHT, SNAKE_BODY = raw_input().split()
WIDTH = int(WIDTH)
HEIGHT = int(HEIGHT)
SNAKE_BODY = SNAKE_BODY.lower()
SNAKE_HEAD = SNAKE_BODY.upper()
HEADX = None
HEADY = None
SNAKE_LENGTH = 0
def get_cell(board, x, y):
if x < 0 or x >= WIDTH or y < 0 or y >= HEIGHT:
raise KeyError, 'out of range.'
return board[y][x]
BOARD = []
for y in xrange(HEIGHT):
row = raw_input()
for x, char in enumerate(row):
if char == SNAKE_HEAD:
HEADX = x
HEADY = y
elif char == SNAKE_BODY:
SNAKE_LENGTH += 1
BOARD.append(row)
MOVES = (
(-1, 0, 'l'),
(1, 0, 'r'),
(0, -1, 'u'),
(0, 1, 'd')
)
def get_score(x, y, n, done=None):
if done is None:
done = set()
done.add((x, y))
score = 0
explore = False
# See if the cell exists.
try:
square = get_cell(BOARD, x, y)
except KeyError:
return 0
# Give some extra points for getting an apple.
if square == APPLE_TILE:
explore = True
score += 100
# Yay - it's empty!
elif square == EMPTY_TILE:
explore = True
score += 50
elif square.islower():
score += 2
elif square.isupper():
score += 1
if explore and n > 0:
# Explore n-1 cells further.
for dx, dy, move in MOVES:
nx = x + dx
ny = y + dy
if (nx, ny) in done:
continue
subscore = get_score(nx, ny, n - 1, done)
score += subscore / 10
return score * n
max_score = None
max_moves = []
for dx, dy, move in MOVES:
score = 0
x = HEADX + dx
y = HEADY + dy
n = (SNAKE_LENGTH + 4) / 2
n = min([n, 10])
score = get_score(x, y, n)
# print 'Score for', move, '=', score
# Suicide protection squad!
try:
square = get_cell(BOARD, x, y)
except KeyError:
continue
else:
if square not in (APPLE_TILE, EMPTY_TILE):
continue
if score == max_score:
max_moves.append(move)
elif max_score is None or score > max_score:
max_score = score
max_moves = [move]
if max_moves:
print random.choice(max_moves)
else:
raise Exception, "No suitable moves found!"
|
