Magic Triangles
Gabriel Hale, Bjorn Vogen, Matthew Wright

TL;DR
This paper introduces the concept of magic triangles, explores their properties for small sizes, and proposes a simulated annealing method to find larger magic triangles, filling a gap in the study of magic shapes.
Contribution
It defines magic triangles, analyzes small cases, and develops a simulated annealing approach for constructing larger magic triangles, which was previously overlooked.
Findings
Counted magic triangles for small sizes
Analyzed integer distributions within triangles
Proposed a simulated annealing method for larger sizes
Abstract
Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of integers with common sums in three directions, which we call magic triangles. For small sizes of these triangles, we count the number of unique magic triangles and examine distributions of integers at different positions within them. While we cannot enumerate the number of magic triangles at larger sizes, we offer a simulated annealing method for finding magic triangles.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Attention Economy in Education and Business
