A Computer Verification of the Kepler Conjecture

摘要

The Kepler conjecture asserts that the density of a packing of congruent balls in three dimensions is never greater than π/18~(1/2). A computer assisted verification confirmed this conjecture in 1998. This article gives a historical introduction to the problem. It describes the procedure that converts this problem into an optimization problem in a finite number of variables and the strategies used to solve this optimization problem.