Project Euler Problem 18 shortest path

/home/user> python eighteen.py
1074
/home/user> cat eighteen.py
class TriangleMatrix:
def __init__(self):
self.triangle = []
self.triangle +=[[0,0,0,0,0,0,0,0,0,0,0,0,0,0, 75]]
self.triangle += [[0,0,0,0,0,0,0,0,0,0,0,0,0,95,0, 64]]
self.triangle += [[ 0,0,0,0,0,0,0,0,0,0,0,0,17,0, 47,0, 82]]
self.triangle += [[0,0,0,0,0,0,0,0,0,0,0,18,0, 35,0, 87,0, 10]]
self.triangle += [[0,0,0,0,0,0,0,0,0,0,20,0, 4,0, 82,0, 47,0, 65]]
self.triangle += [[0,0,0,0,0,0,0,0,0,19,0, 1,0, 23,0, 75,0, 3,0, 34]]
self.triangle +=[[ 0,0,0,0,0,0,0,0,88,0, 2,0, 77,0, 73,0, 7,0, 63,0, 67]]
self.triangle += [[0,0,0,0,0,0,0,99,0, 65,0, 4,0, 28,0, 6,0, 16,0, 70,0, 92]]
self.triangle += [[0,0,0,0,0,0,41,0, 41,0, 26,0, 56,0, 83,0, 40,0, 80,0, 70,0, 33]]
self.triangle += [[0,0,0,0,0,41,0, 48,0, 72,0, 33,0, 47,0, 32,0, 37,0, 16,0, 94,0, 29]]
self.triangle +=[[0,0,0,0,53,0, 71,0, 44,0, 65,0, 25,0, 43,0, 91,0, 52,0, 97,0, 51,0, 14]]
self.triangle += [[0,0,0,70,0, 11,0, 33,0, 28,0, 77,0, 73,0, 17,0, 78,0, 39,0, 68,0, 17,0, 57]]
self.triangle += [[0,0,91,0, 71,0, 52,0, 38,0, 17,0, 14,0, 91,0, 43,0, 58,0, 50,0, 27,0, 29,0, 48]]
self.triangle += [[0,63,0, 66,0, 4,0, 68,0, 89,0, 53,0, 67,0, 30,0, 73,0, 16,0, 69,0, 87,0, 40,0, 31]]
self.triangle += [[4,0, 62,0, 98,0, 27,0, 23,0, 9,0, 70,0, 98,0, 73,0, 93,0, 38,0, 53,0, 60,0, 4,0, 23]]

def recurse(self,n,m):
if n == 13:
return self.triangle[n][m] + max(self.triangle[14][m-1], self.triangle[14][m +1])
else:
return self.triangle[n][m] + max(self.recurse(n+1, m-1), self.recurse(n+1, m+1))




t = TriangleMatrix()
print t.recurse(0,14)