Group S4 Anirudhdha Kuamr Sahu(10092) Gangaptasad Koturwar(10259) CS365 Artificial Intelligence Mentor: Prof. Amitabha Mukherjee Edge Matching Puzzles Useful links Proposal Presentation Report Results Code Resources About the Puzzle The Edge matching puzzles are ancient puzzles in which player is supposed to fill up the given grid with given tiles. Each placing tile is supposed to be match all its edges which are coomon with the adjecent tiles. Each tile has its edges identified by the pattern they carry along with them, and each tiles are different as they carry different colour patterns. The current puzzle consists of a 16X16 grid which is supposed to be filled by 256 tiles which are coloured with 23 colour patterns. The puzzle with its modified problem statement was put forth to the world as challenge by Christopher Monckton as Eternity II puzzle which attracted worldwide attraction due to the complexity associated with it. The huge search space associated with puzzle makes many of the search algorithms ineffective in finding the final solution. In this project we are trying to solve the puzzle using genetic algorithm.