GitHub - dorklord/monkeybounce: There is a monkey which can walk around on a planar grid. The monkey can move one space at a time left, right, up or down. That is, from (x, y) the monkey can go to (x+1, y), (x-1, y), (x, y+1), and (x, y-1). Points where the sum of the digits of the x coordinate plus the sum of the digits of the y coordinate are greater than 25 are inaccessible to the monkey. For example, the point (59, 79) is inaccessible because 5 + 9 + 7 + 9 = 30, which is greater than 25. The sum of the digits for negative coordinates should be calculated based on the absolute value. For example, the sum of the digits of (-22, 12) equals the sum of the digits of (22, 12). How many points can the monkey access if it starts at (0, 0), including (0, 0) itself?

dorklord / monkeybounce Public

Notifications You must be signed in to change notification settings
Fork 1
Star 1

There is a monkey which can walk around on a planar grid. The monkey can move one space at a time left, right, up or down. That is, from (x, y) the monkey can go to (x+1, y), (x-1, y), (x, y+1), and (x, y-1). Points where the sum of the digits of the x coordinate plus the sum of the digits of the y coordinate are greater than 25 are inaccessible…