完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Shan, Yi-Chang | en_US |
dc.contributor.author | Wu, I-Chen | en_US |
dc.contributor.author | Lin, Hung-Hsuan | en_US |
dc.contributor.author | Kao, Kuo-Yuan | en_US |
dc.date.accessioned | 2018-08-21T05:56:41Z | - |
dc.date.available | 2018-08-21T05:56:41Z | - |
dc.date.issued | 2010-01-01 | en_US |
dc.identifier.issn | 2376-6816 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1109/TAAI.2010.73 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/146520 | - |
dc.description.abstract | Triangular Nim, one variant of the game Nim, is a common two-player game in Taiwan and China. In the past, Hsu strongly solved 7 layer Triangular Nim while some of the authors recently strongly solved 8 layer Triangular Nim. The latter required 8 gigabytes in memory and 8878 seconds. Using a retrograde method, this paper strongly solves 9 layer Triangular Nim. In our first version, the program requires four terabytes in memory and takes about 129.21 days aggregately. In our second version, improved by removing some rotated and mirrored positions, the program reduces the memory by a factor of 5.86 and the computation time by a factor of 4.38. Our experiment result also shows that the loss rate is only 5.0%. This is also used to help improve the performance. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Nim | en_US |
dc.subject | Triangular Nim | en_US |
dc.subject | Retrograde | en_US |
dc.title | SOLVING 9 LAYER TRIANGULAR NIM | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.doi | 10.1109/TAAI.2010.73 | en_US |
dc.identifier.journal | INTERNATIONAL CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI 2010) | en_US |
dc.citation.spage | 421 | en_US |
dc.citation.epage | 426 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000399726300063 | en_US |
顯示於類別: | 會議論文 |