Recent posts by ben_burrows on Kongregate

Flag Post

Topic: Game Programming / Al Zimmermann's contest.

Many thanks for the tips. What a bizarre optimization problem … I’ve never seen a simple formulation with such an ugly solution space.

Would love to see your code once the contest is over, if you decide to open source it.

 
Flag Post

Topic: Game Programming / Al Zimmermann's contest.

@Ace_Blue does your solver work from 1 and go forward, or from N! and go backward? Does it backtrack, or is it greedy?

I’m considering backwards search w/ backtracking. But, even if addition is limited to very small numbers, I’m finding that there are just too many “viable” ways of factoring out primes. Sometimes it’s best to take out a full square, other times it’s best to leave some terms in because there are tricks to get rid of them. Given p1^n1*p2^n2*p3^n3…, I don’t see a technique to break that in half that consistently produces short programs.

Thoughts? Advice?