Original Post
You are given six equilateral triangles (same sizes) whose edges are numbered. Your task is to form a hexagon (a 6-sided polygon) by matching the edges of the triangles. The edges common to two triangles match if they have the same number on them. You may move or rotate the triangles but you can't flip them. The score of the hexagon is the sum of the numbers on the exterior edges. Write a complete Java program that computes the maximum hexagon score. How do I exactly start to solve this problem?