Project Euler Solver: Largest Product in a Grid

largest_prod_grid is a Python program that solves a mathematics problem posed by Project Euler:

Given a 20 x 20 table of numbers, find the largest product of four linearly adjacent numbers. The four numbers can run up, down, left, right, or diagonally.

Project Euler gives this example, where the largest product in a 20 x 20 table is created by multiplying 26, 63, 78, and 14 to get 1788696.

This implementation generalizes the solution – it can compute the largest product of four adjacent numbers in table that’s at least 4 x 4.

The code lives in this repo, which also contains two samples text files that contain tables.

Note

This program reports only the largest product. Future versions will report the four factors and their locations in the table.

We describe how to use the program and provide examples of input in Usage.

To see how the program is implemented, see Implementation.

See this example script.

• Usage
  • Run the program
  • Run the program with debugging print statements
  • Examples of number tables
  • Example output
• Implementation
  • Functions