|
Email: chen@uncc.edu
Office: Woodward 403C
Phone: 704 687-8545
Fax: 704 687-3516
Web: http://www.cs.uncc.edu/~chen/
Mailing Address: Department of Computer Science, UNC Charlotte
9201 University City Boulevard, Charlotte, NC 28223-0001
Education:
Ph.D., Duke University, 1976
M. S., National Tsing-Hua University, 1970
B. S., Taiwan Cheng-Kung University, 1968
Honors and Awards:
World 9x9 Computer Go Championship, Second Place winner, 2008.
Computer Olympiad Gold Medal winner (9x9 Go), 2005.
Computer Olympiad Gold Medal winner (19x19 Go), 2004.
Computer Olympiad Gold Medal winner (9x9 Go), 2004.
International Computer Go Congress 1st place winner, 1994.
International Computer Go Congress 1st place winner, 1992.
Computer Olympiad Gold Medal winner (19x19 Go), 1992.
Computer Olympiad Gold Medal winner (9x9 Go), 1991.
Computer Olympiad Gold Medal winner (19x19 Go), 1990.
Computer Olympiad Gold Medal winner (9x9 Go), 1990.
Computer Olympiad Gold Medal winner (19x19 Go), 1989.
Research Interests: Heuristic Search, Computer Go, Artificial Intelligence,
Knowledge-Based Systems, Theory of Computing
Recent Publications:
K. Chen, “Dynamic
randomization and domain knowledge in Monte-Carlo Tree Search for Go
Knowledge-Based Systems ”, International Journal on Knowledge-Based
Systems (2011).
K. Chen, D. Du, and P. Zhang “A Fast Indexing Method for Monte-Carlo Go”,
Lecture Notes in Computer Science, No. 5131, 2008, 92-101.
P. Zhang and K. Chen,
“Monte-Carlo Go Tactic Search”, New Mathematics and Natural Computation
Journal, Volume 4, Number 3, 359-367, November 2008.
K. Chen and P. Zhang,
“Monte-Carlo Go with Knowledge-guided simulations”, ICGA Journal, Vol. 31,
No. 2, 67-76, June 2008.
K. Chen and P. Zhang, “A New
Heuristic Search Algorithm for Capturing Problems in Go”, Lecture Notes in
Computer Science, No. 4630, 2007, 26-36.
K. Chen, “Connectivity in the Game of Go”, New
Mathematics and Natural Computation, Vol. 2, No. 2, 147-159, 2006.
K. Chen, “Maximizing the
Chance of Winning in Searching Go Game Trees”, Information Sciences 175,
273-283, November 2005.
K. Chen, “Soft
decomposition search and binary game forest model for move decision in Go
”,
Information Sciences, Vol. 154, Issues 3-4, 157-172, September 2003.
K. Chen, “Increasing Interest”, ICGA Journal, Vol. 26, No. 1, 2003, P.
2.
K. Chen, “The way to Go”, ICGA Journal, Vol. 25, No. 4, 2002, P. 202.
K. Chen, “Go4++ wins 19x19 Go Tournament”, ICGA Journal, Vol. 25, No. 3,
179-181, September 2002.
K. Chen, “Computer
Go: Knowledge, Search, and Move Decision ”, ICGA Journal, Vol. 24, No. 4,
203- 215, December 2001.
K. Chen, “A
study of decision error in selective game tree search ”, Information
Sciences, Vol. 135,
No.3-4, 177-186, July 2001.
K. Chen, “Some Practical Techniques for Global Search in Go”, ICGA Journal,
Vol. 23, No.2, 67-74, June 2000.
K. Chen, “Heuristic search and computer game playing”, Information Sciences,
Volume 122, 1~2, 2000.
Current Course Information :
ITCS 6114/8114 Algorithms
and Data Structures
|
|
|
