Computer Chinese Chess

@article{Yen2004ComputerCC,
  title={Computer Chinese Chess},
  author={Shi-Jim Yen and Jr-Chang Chen and Tai-Ning Yang and Shun-chin Hsu},
  journal={J. Int. Comput. Games Assoc.},
  year={2004},
  volume={27},
  pages={3-18}
}
A heat recovery device is adapted for placement in the heat exhaust vent pipe of a conventional clothes dryer. [] Key Method The scrubber includes a series of ducts opening into an enlarged plenum and a baffle plate in the plenum to inhibit streamlined flow of air allowing the lint to settle to the bottom of the plenum, and the final filter includes a series of expanded aluminum screens or mesh for positively prohibiting passage of lint into the atmosphere.
A Minors Hash Table in Chinese-Chess Programs
TLDR
The article describes the design, the operations, the complexity, the efficiency, and in particular the Minors hash-collision prevention in parallel search related to theMinors Hash Table.
Path Searching Algorithms of Multiple Robot System Applying in Chinese Chess Game
TLDR
The multi-robots system is used to present the scenario of the chess movement for the Chinese chess game, and play the Chinese Chess game according to the real-time image feedback to the supervised computer via wireless image system.
Chinese Dark Chess
TLDR
The game Chinese dark chess is introduced and some research topics about this game are given and programs that reveal pieces reasonably and effectively have better playing strength.
Self-Optimizing Evaluation Function for Chinese-Chess
TLDR
The results show that the particle swarm optimization is successfully applied to optimize the evaluation function in Chinese chess and the performance of the presented program is effectively improved after many trains.
TAAI 2013 Computer Game Tournaments
th , 2013. In this event, fifty computer programs from the Netherlands, France, and Taiwan participated in tournaments for ten different games being Go 9x9, Chinese chess, Connect6, Chinese dark
Designing a high-performance Chinese chess computer player for middle game position
  • Wan-guo Yu
  • Computer Science
    2012 International Conference on Machine Learning and Cybernetics
  • 2012
TLDR
A high-performance C CCG player named CCCGylh for middle game position is designed and implemented by using the alpha-beta algorithm to search a pruned game tree which can be formed by only storing the pieces array and constructing a simplified evaluation function which can appraise a position with more little time consumption.
Knowledge Inferencing on Chinese Chess Endgames
TLDR
A novel strategy is proposed that applies a knowledge-inferencing algorithm on a sufficiently small database to determine whether endgames with a certain combination of material are advantageous to a player.
A* search algorithm applied to a Chinese chess game
TLDR
An A* search algorithm to be applied to path planning in a Chinese chess game using multiple mobile robots to solve the shortest-path problem for the mobile robots from the starting point to the target point on the chess board is presented.
The research of Chinese chess based on database with self learning
TLDR
A new game tree search strategy for Chinese Chess computer programs that stores the movement of the opponent and the position value in database so that it can avoid making the same mistake next time.
Comparison Training for Computer Chinese Chess
TLDR
A modified comparison training for automatic feature weight tuning into which tapered eval is incorporated and n-tuple networks is applied to extract features to improve the evaluation functions used in Chinese chess programs.
...
...

References

SHOWING 1-10 OF 53 REFERENCES
Construction of Chinese Chess Endgame Databases by Retrograde Analysis
TLDR
The approach to the construction of Chinese Chess Endgame Databases when only one of the players possesses attacking piece(s) is described and a set of 151 endgame databases with a total of at most two attacking pieces, four defending pieces and two Kings are constructed.
Computer shogi
Computer Go: An AI oriented survey
Experiments in Forward Pruning with Limited Extensions
TLDR
This paper considers a spectrum of simple heuristics and strategies and applies them to Chinese chess and tries to provide quantitative data to support the use of not only these standard techniques but also of some newer ideas involving attack-evading moves and strictly-forced moves.
Space-efficient indexing of endgame tables for chess
TLDR
Heinz’ and Nalimov’s endgame tables (EGTs) encompass the en passant rule and have the most compact index schemes to date and are individually more compact than previous tables.
Guard heuristic by dynamic fuzzy reasoning model for Chinese chess
  • Mei Chen, Yo-Ping Huang
  • Computer Science
    Proceedings of 3rd International Symposium on Uncertainty Modeling and Analysis and Annual Conference of the North American Fuzzy Information Processing Society
  • 1995
TLDR
Based on the proposed model, not only can the legitimacy of the next move be improved but the decision time is much shorter than the same tree searching method of the alpha-beta model.
Dynamic fuzzy reasoning model with fuzzy cognitive map in Chinese chess
  • Mei Chen, Yo-Ping Huang
  • Computer Science
    Proceedings of ICNN'95 - International Conference on Neural Networks
  • 1995
TLDR
Not only the legitimacy of the next move can be improved but also the decision time is much shorter than the game tree searching method of alpha-beta model.
Indefinite Sequence of Moves in Chinese Chess Endgames
TLDR
In western chess, retrograde analysis has been successfully applied to construct 6-piece endgame databases by first determining all terminal win or loss positions, and then propagating the values back to their predecessors until no further propagation is possible.
Minimax Search Algorithms With and Without Aspiration Windows
Investigation of several algorithms for computing exact minimax values of game trees (utilizing backward pruning) are discussed. The focus is on trees with an ordering similar to that actually found
...
...