Magic Polygons and Combinatorial Algorithms

Abstract

In this work, we study the Magic Polygons of order 3 (P(n; 2)) and we introduce some properties that were useful to build an algorithm to find out how many Magic Polygons exists for the regular polygons up to 24 sides. The concepts of Equivalents Magic Polygons and Derivatives Magic Polygons which allowed to classify, and avoid ambiguity about the representations of such elements, are also introduced.