The rise of attention for Chinese-Chess programs has resulted in the development of some effective algorithms. This article presents a new algorithm named A Minors Hash Table. It is an innovation to the well-known hash-table technique; the new ideas are tuned with the help of the Chinese-Chess programs NEUCHESS and QIXING. For the sake of generality, we mention that the algorithm is applicable to almost all other Chinese-Chess programs (other than NEUCHESS and QIXING) without facing the difficulty of code modification. The algorithm might increase the speed of almost every program by more than 10 per cent, and this leads to a significant performance improvement. The article describes the design, the operations, the complexity, the efficiency, and in particular the Minors hash-collision prevention in parallel search related to the Minors Hash Table. The results of our experiments show that the proposed algorithm is reliable and stable.
