A Study for Compressing Endgame Databases of Computer Dark Chess
| Autor: | Gang-Yu Fan, 范綱宇 |
|---|---|
| Rok vydání: | 2015 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 103 Building endgame databases improves the strength of computer game programs. Currently, the number of pieces in Chinese dark chess endgames reaches six pieces. It takes a mount of time and space for construction and storage. Thus, the built databases need to be compressed by applying state-of-the-art compression programs, such as gzip, before being stored in the disk. The aim of the thesis is to reduce the space needed to store endgame databases of Chinese dark chess in the disk. The baseline for comparison is the method proposed by Chen, et al. We change the index scheme used in building endgames. The endgames were then compressed by applying gzip. The appropriate index for Chinese dark chess is thus found. The experiment results shows that endgames comprising of six revealed pieces are compressed upto 55.68% compared to the baseline. The storage space for endgame databases is significantly reduced while maintaining the same efficiency of querying databases. We expect that our method could facilitate the endgame development for other board games. Keywords：Computer chinese dark chess、Endgame databases |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|