| | | |
| Session ID | Author List | Title |
| Note: For IWCG2010, TAEA2010 and TAAIDT papers, please click the tabs at the bottom of spreadsheet. |
| CG1(4 papers) | Kuo-Yuan Kao | |
| 12 | Automatic Construction of High-Correctness Chinese Chess Endgame Knowledge Base | Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu, Tsan-sheng Hsu |
| 10 | Searching for Stage Proof Number in Connect6 | Jung-Kuei Yang and Shi-Jim Yen |
| 14 | Solving 9 Layer Triangular Nim | Yi-Chang Shan, I-Chen Wu, Hung-Hsuan Lin, Kuo-Yuan Kao |
| 15 | Chilled Domineering | Kuo-Yuan Kao, I-Chen Wu, Hung-Hsuan Lin, Yi-Chang Shan |
| | | |
| CG2(5 papers) | Takeshi Ito | |
| 3 | Enhancing Transparent Fuzzy Controllers with Temporal Concepts: An Application to Computer Games | Giovanni Acampora, Vincenzo Loia and Autilia Vitiello |
| 6 | A Trial AI system with its Suggestion of Kifuu (playing style) in Shogi | Satoshi Namai, Takeshi Ito |
| 9 | A Simple and Rapid Lights-up Solver | Shih-Yuan Chiu, Shi-Jim Yen, Cheng-Wei Chou and Tai-Ning Yang |
| 11 | An Efficient Algorithm for Nonogram's Solver | Shi-Jim Yen, Tsan-Cheng Su, Shih-Yuan Chiu and Jr-Chang Chen |
| 13 | Solving the Minimum Sudoku Problem | Hung-Hsuan Lin, I-Chen Wu |
| | | |
| CG3(4 papers) | Yoshiyuki Kotani | |
| 1 | Time Management for Monte-Carlo Tree Search Applied to the Game of Go | Shih-Chieh Huang, R´emi Coulom, Shun-Shii Lin |
| 4 | UCD : Upper Confidence Bound for Rooted Directed Acyclic Graphs | Abdallah Saffidine, Tristan Cazenave and Jean Mehat |
| 5 | Monte-Carlo Tree Search Using Expert Knowledge: An Application to omputer Go | Jacques Basaldúa, Tai-Ning Yang and J. Marcos Moreno Vega |
| 16 | Modification of UCT Algorithm with Quiescent Search in Computer GO | Feng Xiao, Zhiqing Liu |
| | | |
| CG4(3 papers) | Keh-Hsun Chen | |
| 2 | Ontology-based Intelligent Agent for Game of Go | Mei-Hui Wanga, Chang-Shing Leea, Li-Wen Wua, Ming-Chi Chengb, Olivier Teytaud |
| 7 | Parallel Monte-Carlo Tree Search with Simulation Servers | Hideki Kato and Ikuo Takeuchi |
| 8 | Dynamic Randomization of Parameters Enhances Monte-Carlo Tree Search in Go | Keh-Hsun Chen |
