完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | 林, 宏軒 Jr | |
| dc.contributor.author | 吳, 毅成 Jr | |
| dc.contributor.author | 單, 益章 Jr | |
| dc.date.accessioned | 2011-03-06T19:33:52Z | |
| dc.date.accessioned | 2020-05-18T03:22:32Z | - |
| dc.date.available | 2011-03-06T19:33:52Z | |
| dc.date.available | 2020-05-18T03:22:32Z | - |
| dc.date.issued | 2011-03-06T19:33:52Z | |
| dc.date.submitted | 2009-11-28 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/30046 | - |
| dc.description.abstract | In the past, Hsu [3][4] solved all Triangular Nim positions with side size seven, In this paper, we propose a new retrograde algorithm to solve all Triangular Nim positions with side size eight. This algorithm makes use of unbalanced ratios of win and loss to reduce greatly the computation time to 2.6 hours. In addition, this algorithm also fits into the traditional 32-bit operating systems. In contrast to another independent result [1], they required 64-bit operating systems and took about 17.1 hours. | |
| dc.description.sponsorship | National Taipei University,Taipei | |
| dc.format.extent | 5p. | |
| dc.relation.ispartofseries | NCS 2009 | |
| dc.subject | Triangular Nim | |
| dc.subject | Retrograde | |
| dc.subject.other | Workshop on Algorithms and Bioinformatics | |
| dc.title | Solving Eight Layer Triangular Nim | |
| dc.title.alternative | 八層三角殺棋之解法 | |
| 分類: | 2009年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| AB 5-2.pdf | 300.04 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。