Full metadata record
DC Field | Value | Language |
---|---|---|
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 | 2014-12-08T15:21:31Z | - |
dc.date.available | 2014-12-08T15:21:31Z | - |
dc.date.issued | 2012-01-01 | en_US |
dc.identifier.issn | 1016-2364 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/15290 | - |
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 [9] strongly solved seven layer Triangular Nim while some of the authors recently strongly solved eight layer Triangular Nim. The latter required 8 gigabytes in memory and 8,472 seconds. Using a retrograde method, this paper strongly solves nine 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.72 and the computation time by a factor of 4.62. 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.subject | misere games | en_US |
dc.subject | impartial games | en_US |
dc.title | Solving Nine Layer Triangular Nim | en_US |
dc.type | Article | en_US |
dc.identifier.journal | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
dc.citation.volume | 28 | en_US |
dc.citation.issue | 1 | en_US |
dc.citation.spage | 99 | en_US |
dc.citation.epage | 113 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000299446100008 | - |
dc.citation.woscount | 1 | - |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.