Abstract
In this paper, we proposed a method for solving the rectangle piece jigsaw puzzle assembly problem. A shape of a piece is a rectangle, and a picture of a puzzle is only painted in black and white, i.e., puzzles are processed as binary images. The assembly of the puzzle is performed only using information of the pixel value on the border line of the pieces. This problem cannot be solved by the simple local piece matching because there are many similar pieces. Global matching is required. The proposed method utilizes a genetic algorithm (GA) to search the optimum piece arrangement because GA has the ability to find the global solution in the large optimization space. The proposed method correctly assembled all pieces in the 8 /spl times/ 8-piece puzzle.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
