Function Problem11

project_euler/problem_11/problem11.go:39–80

()

}

func Problem11() uint {
	max := uint(0)

	for i := 0; i < 20; i++ {
		for j := 0; j < 20; j++ {

			// Vertical
			if i+3 < 20 {
				product := grid[i][j] * grid[i+1][j] * grid[i+2][j] * grid[i+3][j]
				if product > max {
					max = product
				}
			}

			// Horizontal
			if j+3 < 20 {
				product := grid[i][j] * grid[i][j+1] * grid[i][j+2] * grid[i][j+3]
				if product > max {
					max = product
				}
			}

			if i+3 < 20 && j+3 < 20 {
				// Diagonal
				product := grid[i][j] * grid[i+1][j+1] * grid[i+2][j+2] * grid[i+3][j+3]
				if product > max {
					max = product
				}
			}

			if i+3 < 20 && j-3 >= 0 {
				// Diagonal
				product := grid[i][j] * grid[i+1][j-1] * grid[i+2][j-2] * grid[i+3][j-3]
				if product > max {
					max = product
				}
			}
		}
	}

	return max
}