Papers
1
Total Citations
4
H-Index
1
About
Te-Yi Hsu is a researcher whose work bridges artificial intelligence and traditional game theory, with a particular focus on applying heuristic search methods to complex board games. Hsu is best known for pioneering the application of the A* search algorithm to Chinese chess, a domain that presents unique computational challenges due to its larger board and more intricate movement rules compared to Western chess. In their seminal 2011 paper, "A* search algorithm applied to a Chinese chess game," Hsu demonstrated how this classic pathfinding algorithm could be adapted to evaluate game states and generate optimal move sequences, achieving a balance between search depth and computational efficiency. While the paper has accumulated 4 citations, its true impact lies in laying groundwork for subsequent research into AI-driven Chinese chess engines and broader applications of heuristic search in combinatorial games. Hsu's work remains a reference point for students and researchers exploring the intersection of AI, game theory, and cultural heritage, illustrating how foundational algorithms can be creatively repurposed for specialized domains.
Research Focus
Key Achievements
Top Papers
- 1A* search algorithm applied to a Chinese chess game4 citations · 2011