# Wolfram alpha algorithm for geometric packing in 2D [closed]

Is there any way to gain access to the algorithm that wolfram alpha uses? More specifically, I want to pack small circles in hex and square patters in a larger cicle (https://www.wolframalpha.com/examples/GeometricPackingIn2D.html), but wolfram alpha only does this up to a number of 1,000.

## closed as off-topic by Daniel Lichtblau, MarcoB, dr.blochwave, Simon Woods, Bob HanlonDec 1 '15 at 20:41

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "The question is out of scope for this site. The answer to this question requires either advice from Wolfram support or the services of a professional consultant." – Daniel Lichtblau, MarcoB, dr.blochwave, Simon Woods, Bob Hanlon
If this question can be reworded to fit the rules in the help center, please edit the question.

• Realted demonstration project: Circles Packed in a Circle. Disclaimer: there is no algorithm there, only plain list of circle positions up to 100 circles. See also (99580) for hexagonal packing approximation. – ybeltukov Dec 1 '15 at 13:20
• Yeah, the code for that one is oddly unsatisfying. I don't know if someone here has access to the methods used by alpha, I suspect it's off-topic for this site. You would have better luck rephrasing the question along the lines of "How can I use Mathematica to find the densest packing of _ circles in _ shape?" Even better if you can give it a shot yourself and ask for improvements to the code. Some of these might be relevant. – Jason B. Dec 1 '15 at 13:25
• The thing is, I'm not interested in the densest packing of circles. I'm interested in the required radius to pack N circles in square and hex patterns. – J Doe Dec 1 '15 at 18:00