Research on Parallel Search of Chinese Chess Software “Deep Elephant”
碩士 === 國立臺灣師範大學 === 資訊工程研究所 === 95 === Since Kasparov, the world chess champion, was defeated by "Deep Blue", Chinese chess is expected to be the next chess game in which computer program can defeat any human player. This is due to the fact that the playing rules in chess or Chinese chess...
Main Author: | 林子哲 |
---|---|
Other Authors: | 林順喜 |
Format: | Others |
Language: | zh-TW |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/69143644446852307718 |
Similar Items
-
Parallelizing the Search Engine of the Game of Chinese Chess by GPU
by: Yi-YangZhuang, et al.
Published: (2010) -
The Research of Distributed Searching Techniques of Chinese Chess
by: Tsao, Ren-Ming, et al.
Published: (1998) -
The study and Software Implementation of Chinese and Korean Chesses
by: Jie-Xing Huang, et al.
Published: (2013) -
Monte Carlo Tree Search in Chinese Dark Chess
by: Chang-Wei Gong, et al.
Published: (2011) -
αβService : an asynchronous parallel tree search service for ChessGrid
by: Pramanik, Sukanta
Published: (2009)