在這篇研究報告中，我們討論的是一種方形集合圖形的數量。”多元方形鏈”約略在 60 年代被提出，衍生出一系列的問題和遊戲，例如熟知的電玩軟體 『 俄羅斯方塊 』 ，或是 『 益智積木 』 的遊戲，都是多元方形鏈的應用。在這些問題當中，最令人頭痛的難題就是 n 元方形鏈的圖形總數。為了解決這道難題，我們採用一種轉換方法將圖形轉換成序組，並且給出序組的性質，再據此寫成 C 語言的程式；反覆地修改程式以增進執行效率及速度，最後利用該程式成功地統計出圖形總數。 In this report, we discussed the amount of polyominoes, the graphs of a set of squares. “Polyominoes” has been brought up in 1960s, and later developed into a series of questions and games, such as a well-known video game — Tetrix, and the game of puzzle blocks. Both are the applications of polyominoes. Among those questions, the toughest one is the amount of n-polyominoes. To solve this problem, we used a method which transforms the graphs into sequences. By looking into the properties of those sequences, we obtain a set of rules that can be used to determine the quantity of n-polyomines. The rules are implemented into computer codes in C language with proper modifications made to speed up the efficiency of our algorithm. The computational results show that the amount has been successfully calculated.
「為配合國家發展委員會「推動ODF-CNS15251為政府為文件標準格式實施計畫」，以及 提供使用者有文書軟體選擇的權利，本館檔案下載部分文件將公布ODF開放文件格式， 免費開源軟體可至LibreOffice 下載安裝使用，或依貴慣用的軟體開啟文件。」