A Novel Algorithm to Verify the Solution of Geometric Puzzle Games

In this paper, we present a novel algorithm to solve the problem of correctly verifying the solution for geometric puzzles. When compared with others, this approach covers a satisfactory amount of cases. The method comprises the use of sixteen possible relations between polygon edges, which are classified to eliminate those that are not necessarily part of the final figure. This method provides for a precise verification of an arranged set of polygons that must form the same image as the desired solution, without the need of extra meta-data. Only the vertexes themselves (also the edge concavity and center position, when circumference arcs are present) are used the algorithm.