Problem:
An up-right path from (a,b)∈R2 to (c,d)∈R2 is a finite sequence (x1,y1),…,(xk,yk) of points in R2 such that (a,b)=(x1,y1),(c,d)=(xk,yk), and for each 1≤i<k we have that either (xi+1,yi+1)=(xi+1,yi) or (xi+1,yi+1)=(xi,yi+1).
Let S be the set of all up-right paths from (−400,−400) to (400,400). What fraction of the paths in S do not contain any point (x,y) such that ∣x∣,∣y∣≤10 ? Express your answer as a decimal number between 0 and 1.
If C is the actual answer to this question and A is your answer, then your score on this problem is ⌈max{25(1−10∣C−A∣),0}⌉.