Teaching Aspects of Constraint Satisfaction Algorithms Via a Game

In an Artificial Intelligence course, a basic concept is Constraint Satisfaction (CS), which is acknowledged as a hard domain for teachers to teach and student to understand. In this paper, we present a game based learning approach to assist students in learning CS algorithms, such as arc consistency and search algorithms, for problem solving in an easy, interactive and motivating way. Preliminary valuation has showed promising results.

[1]  R. Fritsch,et al.  The four-color theorem : history, topological foundations, and idea of proof , 1998 .

[2]  Todd W. Neller Rook Jumping Maze Generation for AI Education , 2011, FLAIRS Conference.

[3]  Jessica D. Bayliss The Effects of Games in CS1-3 , 2007, J. Game Dev..

[4]  Z. Markov,et al.  Pedagogical Possibilities for the N-Puzzle Problem , 2006, Proceedings. Frontiers in Education. 36th Annual Conference.

[5]  John DeNero,et al.  Teaching Introductory Artificial Intelligence with Pac-Man , 2010, Proceedings of the AAAI Conference on Artificial Intelligence.

[6]  Sven Koenig,et al.  Teaching Artificial Intelligence and Robotics Via Games , 2010, EAAI.

[7]  R. Fritsch,et al.  The four color theorem , 1998 .