Full metadata record
DC FieldValueLanguage
dc.contributor.authorShan, Yi-Changen_US
dc.contributor.authorWu, I-Chenen_US
dc.contributor.authorLin, Hung-Hsuanen_US
dc.contributor.authorKao, Kuo-Yuanen_US
dc.date.accessioned2014-12-08T15:21:31Z-
dc.date.available2014-12-08T15:21:31Z-
dc.date.issued2012-01-01en_US
dc.identifier.issn1016-2364en_US
dc.identifier.urihttp://hdl.handle.net/11536/15290-
dc.description.abstractTriangular 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.isoen_USen_US
dc.subjectNimen_US
dc.subjectTriangular Nimen_US
dc.subjectretrogradeen_US
dc.subjectmisere gamesen_US
dc.subjectimpartial gamesen_US
dc.titleSolving Nine Layer Triangular Nimen_US
dc.typeArticleen_US
dc.identifier.journalJOURNAL OF INFORMATION SCIENCE AND ENGINEERINGen_US
dc.citation.volume28en_US
dc.citation.issue1en_US
dc.citation.spage99en_US
dc.citation.epage113en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000299446100008-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. 000299446100008.pdf

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.