Project Euler #15 is to find out all the distinct possible ways there are to move from the first point (1,1) to point (n,n) in an n*n lattice.

def lattice_paths_of_n(n):
    list2 = []
    my_list = []
    for i in range(1, n+2):
    for i in range(1, n+2):
    for i in range(0,n+1):
        for f in range(0,n+1):
            if f == 0 or i == 0:
                my_list[i][f] = 1
                my_list[i][f] = my_list[i-1][f]+my_list[i][f-1]
    return my_list[n][n]


However, this function is extremely inefficient and I would appreciate it if you could give me suggestions to optimize the same. I tried to find a more efficient solution to this problem on this site, but couldn't find one in Python 3.

  • \$\begingroup\$ What leads you to believe it's extremely inefficient? (I'm not arguing it isn't, just asking) \$\endgroup\$ – Insane May 20 '16 at 3:10
  • \$\begingroup\$ Well, I basically used brute force; whereas I can use a more efficient intelligent way to calculate the answer. \$\endgroup\$ – Aradhye Agarwal May 20 '16 at 3:11
  • \$\begingroup\$ Won't spoil the fun for you, but there is a closed form solution that involves permutations: you just need to compute a couple of factorials to get to the answer. \$\endgroup\$ – Jaime May 20 '16 at 4:51
  • \$\begingroup\$ @Jaime Well this is what Code Review is! Feel free to write it up as an answer with an explanation :) \$\endgroup\$ – Insane May 20 '16 at 10:03
  • \$\begingroup\$ @Jaime if you do answer, I would appreciate it if you also provided a logical explanation behind your formula and it's derivation. \$\endgroup\$ – Aradhye Agarwal May 20 '16 at 10:31

To move from the top left corner of an \$n\times n\$ grid to the opposite one you have to move \$n\$ times to the right and \$n\$ times down. So in total you will do \$2n\$ moves. If you could make those in any order there would be \$(2 n)!\$ ways of doing them. But you don't have that freedom, because the order within the movements to the right and within the movements down is fixed, e.g. you have to move from row 4 to row 5 before you can move from row 5 to row 6. So of the \$n!\$ ways the movements to the right can be ordered, only one is valid, and similarly with the movements down.

Summing it all up, the closed form answer to that problem is:

$$ \frac{(2n)!}{n!n!} $$

Unsurprisingly this is the same as \$C_{2n, n}\$, the combinations of \$2n\$ items taken \$n\$ at a time. You could think of the same problem as having \$2n\$ movements and having to choose \$n\$ of those to make e.g. the movements down, leaving the others for the movements right.

With Python's arbitrary size integers you could simply calculate that as:

import math

def pe15(n):
    n_fact = math.factorial(n)
    return math.factorial(2 * n) / n_fact / n_fact

To give this answer a little more meat, in most other languages you don't have the luxury of not having to worry about integer overflows. Even in Python it may be a good idea if you want to keep your computations fast for very large numbers. So you would typically do the same computation as:

def pe15_bis(n):
    ret = 1
    for j in range(1, n+1):
        ret *= n + j
        ret //= j
    return ret

In Python that doesn't seem to pay off (performance wise) until n is in the many hundreds, but I find lovely that, the way that code goes, ret is always exactly divisible by j. Figuring out why is left as an exercise for the reader...


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.