**Problem 566**(View Problem)

Does an efficient solution to this problem achieve the goal of running in under 1 minute!? (or even under 10 min?)

I've worked long and hard on this problem and I've learned a lot, no-doubt. But in my simulation-type solution, some of the elements such as F(13,14,53) are running beyond 1 billion and are taking hours on a fast machine running Java in NetBeans. Many F() values are in the 10s or even 100s of millions. My solution quickly matches the samples provided including G(17), but I have my doubts because of the time involved in calculating the final answer for G(53). If it can be computed in under 10 min, I clearly need a new approach.

Thanks (first post, 25 problems solved so far).