Algorithm to compute every path in a 5 by 5 grid, non-repeating
I have a grid of NxN cells (think of a 2 dimensional array defined as follows Array[N][N]). What is the fastest algorithm, with the least amount of memory usage required, that will compute **every path** from every cell a[i][j] to every cell a[k][l] where no cell is included twice within a single path?

Algorithm to compute every path in a 5 by 5 grid, non-repeating
===

I have a grid of NxN cells (think of a 2 dimensional array defined as follows Array[N][N]). What is the fastest algorithm, with the least amount of memory usage required, that will compute **every path** from every cell a[i][j] to every cell a[k][l] where no cell is included twice within a single path?
