Previous [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]

°@

Journal of Information Science and Engineering, Vol.19 No.4, pp.589-603 (July 2003)


Network Tournament Pedagogical Approach Involving Game Playing in Artificial Intelligence*

Ming-Da Wu, Ying-Hong Liao and Chuen-Tsai Sun
Department of Computer and Information Science
National Chiao Tung University
Hsinchu, 300 Taiwan
E-mail: {ray, norma, ctsun}@cis.nctu.edu.tw

Game playing and genetic algorithms (GAs) are two important topics in artificial intelligence (AI). In this work we employ network tournament to assist in teaching these concepts associated with AI. Three exercises that implement a game-playing program are designed to help students learn relevant topics in AI. The first exercise involves game theory, e.g. mini-max search and alpha-beta pruning. The second exercise helps students understand the critical nature of a good heuristic function in game playing. And, the third exercise introduces GAs to learn a heuristic function. In addition to these exercises, this work also designs several programming toolkits to help students complete their exercises, such as a network tournament interface, a graphical man-machine interface, and a genetic algorithm based game-playing engine. These exercises encompass pertinent topics involving artificial intelligence and the network tournament. The network tournament provides a relatively easy means of Othello competition, and has merit in improving students°¶ motivation for learning relevant topics.

Keywords: network tournament, game playing, artificial intelligence, genetic algorithms, computer-assisted instruction

Full Text (•Ģ§Śņ…) Retrieve PDF document (200307_03.pdf)

Received December 6, 2001; revised March 18, 2002; accepted May 13, 2002.
Communicated by Hsu-Chun Yen.
*This research was supported in part by the National Science Council, R.O.C., under grant NSC89-2511-S-009-024.