Jump to content

Hexagonal tortoise problem

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SmackBot (talk | contribs) at 06:48, 14 January 2011 (Dated {{Uncategorized}}. (Build p603)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The hexagonal tortoise problem (Template:Lang-ko, a.k.a. jisuguimundo) was invented by Korean aristocrat and mathematician Seok-jeong Choi, who lived from 1646 to 1715. It is a mathematical problem that involves a hexagonal lattice, like the hexagonal pattern on some tortoises' shells, to the (N) vertices of which must be assigned integers (from 1 to N) in such a way that the sum of all integers at the vertices of each hexagon is the same.[1] The problem is similar to a magic square.[1]

References

What supports what

  1. ^ a b Choe, Choi & Moon 2003, pp. 850.

Sources used

  • Choe, Heemahn; Choi, Sung-Soon; Moon, Byung-Ro (2003). Cantù-Paz, Erick (ed.). A Hybrid Genetic Algorithm for the Hexagonal Tortoise Problem. Proceedings of the Genetic and Evolutionary Computation (GECCO) Conference, Chicago, IL, USA, July 12–16, 2003. Springer. ISBN 9783540406020. {{cite conference}}: Invalid |ref=harv (help)