Tutoring an Entire Game with Dynamic Strategy Graphs: The Mixed-Initiative Sudoku Tutor
|
| Title | Tutoring an Entire Game with Dynamic Strategy Graphs: The Mixed-Initiative Sudoku Tutor |
| Authors | |
| Abstract | In this paper, we develop a mixed-initiative intelligent tutor for the game of Sudoku called MITS. We begin by developing a characterization of the strategies used in Sudoku as the basis for teaching the student how to play. In order to reason about interaction with the student, we also introduce a student modeling component motivated by the mixed-initiative model of Fleming and Cohen that tracks what the student knows and understands. In contrast to other systems for tutoring games, we are able to interact with students to complete an entire game. This is achieved by retaining a model of acceptable next moves (called a strategy graph) and dynamically adjusting this model as the student plays the game. We present the overall architecture of the system followed by an explanation of the modules that encapsulate the rules of Sudoku. We also outline formulae for reasoning about interaction with the student that support mixed-initiative where either the system or the student can elect to direct the playing of the game. An implementation of the system is discussed, including examples of MITS interacting with students in order to tutor the game. To conclude, we discuss how this research is useful not only to gain insight into how to tutor students about strategy games but also to understand how to support mixed-initiative interaction in tutorial settings. |
| Publisher | ACADEMY PUBLISHER |
| Date | 2007-02-01 |
| Source | Journal of Computers Vol 2, No 1 (2007) |
| Rights | Copyright © ACADEMY PUBLISHER - All Rights Reserved.To request permission, please check out URL: http://www.academypublisher.com/copyrightpermission.html. |