  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.
