The Nature of Retrograde Analysis for Chinese Chess

Simple item page
dc.contributor.authorFang, Haw-ren
dc.date.accessioned2006-01-13T21:23:56Z
dc.date.available2006-01-13T21:23:56Z
dc.date.issued2006-01-13T21:23:56Z
dc.description.abstractRetrograde analysis has been successfully applied to solve Awari and construct 6-piece Western chess endgame databases. However, its application to Chinese chess is limited because of the special rules about indefinite move sequences. Problems caused by the most influential rule, checking indefinitely were successfully solved in practical cases, with $50$ selected endgame databases constructed in accord with this rule, where the 60-move-rule was ignored. Other special rules have much less impact on contaminating the databases, as verified by the rule-tolerant algorithms. For constructing complete endgame databases, we need rigorous algorithms. There are two rule sets in Chinese chess: Asian rule set and Chinese rule set. In this paper, an algorithm is successfully developed to construct endgame databases in accord with the Asian rule set. The graph-theoretical properties are also explored as well.en
dc.format.extent195010 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/3037
dc.language.isoen_USen
dc.relation.ispartofseriesUM Computer Science Departmenten
dc.relation.ispartofseriesCS-TR-4645en
dc.relation.ispartofseriesUMIACSen
dc.relation.ispartofseriesUMIACS-TR-2004-86en
dc.titleThe Nature of Retrograde Analysis for Chinese Chessen
dc.typeTechnical Reporten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
nature.pdf
Size:
190.44 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.81 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Technical Reports from UMIACS
Technical Reports of the Computer Science Department