azspcs

How can I improve this algorithm for solving a modified Postage Stamp puzzle?

由 大城市里の小女人 提交于 2019-12-03 06:28:50
问题 Son of Darts Problem was a contest on Al Zimmermann's Programming Contests that ended on 20 Jun 2010 : Suppose that you have a dartboard that is divided into R regions. Each dartboard region has a positive integer value associated with it. Further suppose that you have D darts and that you throw each of them at the dartboard. Each dart either lands in one of the board's R regions or misses the board altogether. Your score is the sum of the values for the regions in which the darts land. A

Al Zimmermann's Son of Darts

由 拈花ヽ惹草 提交于 2019-11-29 12:39:15
There's about 2 months left in Al Zimmermann's Son of Darts programming contest , and I'd like to improve my standing (currently in the 60s) to something more respectable. I'd like to get some ideas from the great community of stackoverflow on how best to approach this problem. The contest problem is known as the Global Postage Stamp Problem in literatures. I don't have much experience with optimization algorithms (I know of hillclimbing and simulated annealing in concept only from college), and in fact the program that I have right now is basically sheer brute force, which of course isn't

Al Zimmermann's Son of Darts

由 ╄→гoц情女王★ 提交于 2019-11-28 06:07:21
问题 There's about 2 months left in Al Zimmermann's Son of Darts programming contest, and I'd like to improve my standing (currently in the 60s) to something more respectable. I'd like to get some ideas from the great community of stackoverflow on how best to approach this problem. The contest problem is known as the Global Postage Stamp Problem in literatures. I don't have much experience with optimization algorithms (I know of hillclimbing and simulated annealing in concept only from college),
订阅 azspcs