Infinite Search Space

Orchard Planting

Primary tabs



Contest ends on 12/25/11 @ 12:00:01 AM - Merry Christmas!

Description

C'mon y'all, put on your overalls and and grab a shovel, it's orchard planting time! After you've fed the chickens and milked the cows, you'll need to plant N trees in the orchard to maximize the number of lines which contain exactly 4 trees. If any line contains more than 4 trees, the solution will be considered invalid.

Scoring

Your final score for each N will be 'your score'/'top score'. Your overall score will be the sum of all individual scores.

Submissions

Only the best solution for each N will be counted. The range of N is: 11<=N<=60. The boundaries for the 'orchard' are from -2^31 to 2^31-1 UPDATE: The scoring function now uses GMP, which means the limits are dependant on computer memory. Thus, limits are unknown at this point, and all coordinates must be submitted as integers in the form of (0,0),(1,1),(2,2),(3,3)... If decimal values are submitted, they will be truncated to integers. In fact, everything will be truncated to integers; any text will be truncated to 0.

Discuss

You can discuss this contest by clicking here. Don't discuss your algorithms or methods until after the contest is over.

And the winner will receive.... A NEW CAR!

No, not really. My father takes classes at a local college just for fun, and it just so happened he was taking a graphics class right when I started building this web site. One of his first assignments was to design and screen print a simple logo. He actually came up with the ISS logo, and printed off several shirts for the site. Click here to see the shirt.
If you have anything you would be willing to contribute for future prizes, please let me know.

Inspiration

http://oeis.org/A006065
http://gpj.connectfree.co.uk/gpjm.htm#(10)
http://mathworld.wolfram.com/Orchard-PlantingProblem.html