title: Algorithm for counting number of paths in an X by Y grid
body: <p>I'd like to create a program in Java that calculates the number of paths a robot can take from top left of a grid T(x, y)  to bottom left.. Using each square in the grid only once and using ALL the squares in the grid. The robot can move up down left and right, making it more complicated. I know it's a recursive program I just don't know how to implement it.</p>