Analog neuro-based approach to tiling problem using fitting function of polyominoes

The tiling problem is a typical NP-complete problem, where the polyominoes are to be arranged without a gap on a finite checkerboard. In this study, t he arrangement of l polyominoes on an m x n checkerboard is considered. As the first step, the conventional parallel algorithm using the maximum neura l network is verified. Then, the authors propose a solution procedure for t he tiling problem, where the analog neural network is used in addition to t he fitting function. Lastly, the proposed method and the conventional metho d are compared, and it is shown that the proposed method is also effective for more complex tiling problems. (C) 1999 Scripta Technica, Electron Comm Jpn Pt 3, 83(2): 1-10, 2000.