What is a better algorithm for finding routes that traverse all vertices in a graph?

Question

So I have the following problem:

Given a grid of x by y dimensions, calculate the number of routes through it that start in one corner (let\'s say top l